{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"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":"check_popk_dataset.check_dataset (cyclomatic 130): check_popk_dataset.check_dataset has cyclomatic complexity 130 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/check_popk_dataset.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f85f2f9d8e30bb20ae5a11136d00025b5d1c64d3223e6ff91007a8da534a21"}},{"ruleId":"D1","level":"warning","message":{"text":"_schema.validate_config (cyclomatic 104): _schema.validate_config 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":"skills/fluidsim/scripts/_schema.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a62e7379094b5d3f8822c1d9b53e4307c3f39c035ac738ae10ddf0ec7fda48f"}},{"ruleId":"D1","level":"warning","message":{"text":"simulate_regimen.run (cyclomatic 85): simulate_regimen.run has cyclomatic complexity 85 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/simulate_regimen.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14fc01076c44158ec7e847e606d2a63f8b7ac7dcc811732e0e40afd20919a88"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_register.validate_register (cyclomatic 62): validate_register.validate_register has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-brainstorming/scripts/validate_register.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"680fd945d9be9952cfa9c2e94c216c24f3e8bea8b482eb0f72de6d212c372c51"}},{"ruleId":"D1","level":"warning","message":{"text":"_manifest._validate_elements (cyclomatic 58): _manifest._validate_elements has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_manifest.py"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60c7b7e1791c8bea830a8be29495aa0000d51f173719dd27f480ca7d2c3a99c"}},{"ruleId":"D1","level":"warning","message":{"text":"convert_session.convert (cyclomatic 57): convert_session.convert has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nwb-conversion/scripts/convert_session.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a69fb6b7f67c232fcc2ec972d57cbffa912e5db80fbf6acf4c63da73a71f84"}},{"ruleId":"D1","level":"warning","message":{"text":"arax_client.parse_trapi_response (cyclomatic 56): arax_client.parse_trapi_response has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"caea21a4e9b507e1e2c11c17153ca71d4937ad28ec872c8a1df0090e123178e9"}},{"ruleId":"D1","level":"warning","message":{"text":"lineage_prevalence.main (cyclomatic 54): lineage_prevalence.main has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathogen-variant-surveillance/scripts/lineage_prevalence.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"85329a52e5ebada067c178e1a35254e28a7b4921966b855429ae5ff70c0ceb6b"}},{"ruleId":"D1","level":"warning","message":{"text":"arax_client.validate_saved_request_contract (cyclomatic 51): arax_client.validate_saved_request_contract has cyclomatic complexity 51 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40514327cce6d8189bd00e640af8b6e3a8a1dd0d15bc93266f516f84abbf2a9"}},{"ruleId":"D1","level":"warning","message":{"text":"ddi_static.run (cyclomatic 51): ddi_static.run has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/ddi_static.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d63630fb9e7112fa688d2347f2fbd93726832cc6570915814560c104f220fd2"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.validate_rubric (cyclomatic 51): _common.validate_rubric has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/_common.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb3e7b0310e736aa981db3a13f7db5a43cb45dfca5779286dfc0bdd7a028da5"}},{"ruleId":"D1","level":"warning","message":{"text":"check_accuracy_precision.main (cyclomatic 50): check_accuracy_precision.main has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/check_accuracy_precision.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f327281d03e56e62624789624c01b752575cd938d6d252dfeb1ede90afb02c6"}},{"ruleId":"D1","level":"warning","message":{"text":"check_detection_limits.main (cyclomatic 50): check_detection_limits.main has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/check_detection_limits.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"013eb17a0f6e22460f9c28fb8ce3ca511a1453b5eb7899ddb35dce35926c4322"}},{"ruleId":"D1","level":"warning","message":{"text":"consistency_checker.validate_consistency (cyclomatic 50): consistency_checker.validate_consistency has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/consistency_checker.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14517bb64f3eb971355fd318e7bce7b5beea7e4deebf3125cdfd413c380317b"}},{"ruleId":"D1","level":"warning","message":{"text":"snapshot_tools.validate_snapshot (cyclomatic 50): snapshot_tools.validate_snapshot has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/snapshot_tools.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e536e47cb254783e85da8eca67cd6fcc7c7f26f47ca5ddb85844181b76012799"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect_signal.inspect_csv (cyclomatic 50): inspect_signal.inspect_csv has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/inspect_signal.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b48345f492bccf95aebeb9e96853e009adb0f5431b39289169d248b3660136"}},{"ruleId":"D1","level":"warning","message":{"text":"export_plan.validate_against_plan (cyclomatic 50): export_plan.validate_against_plan has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/export_plan.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"583adec77dca7156ca3717f7aa055fdd906a0190893c7d8d74d2771c661c0667"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus_auditor.audit (cyclomatic 49): corpus_auditor.audit has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/corpus_auditor.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82d941750e0c9031ad117b8e02fb0f2a8564a35b2bca36a42d40dd5a4b057f9"}},{"ruleId":"D1","level":"warning","message":{"text":"check_completeness.check_completeness (cyclomatic 49): check_completeness.check_completeness has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/treatment-plans/scripts/check_completeness.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5379d06db69260c3795658eba6b501c40c8a25ea2ce8ac75cec652f1de51458"}},{"ruleId":"D1","level":"warning","message":{"text":"survival_plan_validator.validate_plan (cyclomatic 47): survival_plan_validator.validate_plan has cyclomatic complexity 47 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/survival_plan_validator.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e8120d2400b246dafec591b6b0d5ae39bc3c4a93089fe1edf2d77563d80556"}},{"ruleId":"D1","level":"warning","message":{"text":"consensus_plan.plan (cyclomatic 47): consensus_plan.plan has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/consensus_plan.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c0867eeba9a699fd684af755e8955e0de97968355ed65e735ec3d9722ed2af"}},{"ruleId":"D1","level":"warning","message":{"text":"bed_validator.validate (cyclomatic 46): bed_validator.validate has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/bed_validator.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6535e2efd982eb3c8dcadeb3f24b33396fb21e916cb53a08b79aab95a6a5086c"}},{"ruleId":"D1","level":"warning","message":{"text":"solve_carbonate.solve (cyclomatic 46): solve_carbonate.solve has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/marine-carbonate-chemistry/scripts/solve_carbonate.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"df14aaf1e486b70608423b90eeea8618fce892e82075599535368509991c669b"}},{"ruleId":"D1","level":"warning","message":{"text":"cohort_table_generator._build_table (cyclomatic 45): cohort_table_generator._build_table 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":"skills/clinical-decision-support/scripts/cohort_table_generator.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff0bcc90b97d154e546f6e0be522623c036ec8542beffe1777b98878a27c3c4"}},{"ruleId":"D1","level":"warning","message":{"text":"anonymize_dicom.transform_dataset (cyclomatic 45): anonymize_dicom.transform_dataset 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":"skills/pydicom/scripts/anonymize_dicom.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9ace21516d877c028018b1f1cde5fb619f75df79f8a809610b654a35fc11fa"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_samplesheet.validate_samplesheet (cyclomatic 43): validate_samplesheet.validate_samplesheet has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bulk-rnaseq/scripts/validate_samplesheet.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bdea02aa074a28aeb180b61b26603020a15faf506bacf67829d4151bb273a2"}},{"ruleId":"D1","level":"warning","message":{"text":"model_biomarker_evaluation.evaluate (cyclomatic 41): model_biomarker_evaluation.evaluate 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":"skills/clinical-decision-support/scripts/model_biomarker_evaluation.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"548d77dd0e731a48d9d8ebe4e704ebb732cc436facef43ad70ba1589c81eb606"}},{"ruleId":"D1","level":"warning","message":{"text":"embedding_plan.plan (cyclomatic 40): embedding_plan.plan 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":"skills/geniml/scripts/embedding_plan.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4e0764b66c45c7e7ec09236bca9e731aeec240abc4fec9c436119d30dd4805"}},{"ruleId":"D1","level":"warning","message":{"text":"detect_resources.detect_cgroup_v2 (cyclomatic 40): detect_resources.detect_cgroup_v2 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":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7030a1363e7ab281d532438ea2ac0e9c5a1010f4cf2c679b6e19a75161932a4"}},{"ruleId":"D1","level":"warning","message":{"text":"plan_pipeline.make_plan (cyclomatic 40): plan_pipeline.make_plan has cyclomatic complexity 40 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathml/scripts/plan_pipeline.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b360beaf57424c024c497fb0c7771e3755a77109d82935610f07e098f79ee66a"}},{"ruleId":"D1","level":"warning","message":{"text":"power._resolve (cyclomatic 40): power._resolve 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":"skills/statistical-power/scripts/power.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d263d225991166c98db47eec316c2adecacd5dbfd873efe0644acd4fdad279"}},{"ruleId":"D1","level":"warning","message":{"text":"check_consistency.check_consistency (cyclomatic 40): check_consistency.check_consistency 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":"skills/treatment-plans/scripts/check_consistency.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87ec7a37c865768e72a67ce577569c4bc9b994a53087586443ad1c2207cf51d"}},{"ruleId":"D1","level":"warning","message":{"text":"spatial_join_audit.audit (cyclomatic 39): spatial_join_audit.audit has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/spatial_join_audit.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e745deb48040cd1aa568cb917621a71316d72581b89c6ae7c2a41143b76b29"}},{"ruleId":"D1","level":"warning","message":{"text":"spa_workflow.validate_star (cyclomatic 39): spa_workflow.validate_star has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relion/scripts/spa_workflow.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e961a4706e1625bcba34b439961a06d7e627c0996e16d9ce42d4557cad1066bd"}},{"ruleId":"D1","level":"warning","message":{"text":"deidentification_checklist.check_documentation (cyclomatic 38): deidentification_checklist.check_documentation has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/deidentification_checklist.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedc06bcf1d3dc966278b346fb3fc2af1db0afbeda9bfb3c32cb3011b512165e"}},{"ruleId":"D1","level":"warning","message":{"text":"evidence_profile_check.check_profile (cyclomatic 38): evidence_profile_check.check_profile has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/evidence_profile_check.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ba57c9b88d453484c5f7cbaa8ef15ed0690767a1f3256f1112d932a4983639"}},{"ruleId":"D1","level":"warning","message":{"text":"check_deidentification.validate_process (cyclomatic 38): check_deidentification.validate_process has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/check_deidentification.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fdb21bc0a26ffd18fe7590f6a629640097ce63aa9a531d8108aa7ada0760d6"}},{"ruleId":"D1","level":"warning","message":{"text":"detect_resources._detect_memory (cyclomatic 38): detect_resources._detect_memory has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0a078a1b5fc75b209bc3eff46953835c6a853c1c941a37b86747e0b5371eef"}},{"ruleId":"D1","level":"warning","message":{"text":"InfographicGenerator.generate_iterative (cyclomatic 38): InfographicGenerator.generate_iterative has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c365058381c4c8e0e0e6284b2d434cb5c8206f06d7ab0a7693516421b2b1b0"}},{"ruleId":"D1","level":"warning","message":{"text":"design_primers.validate_config (cyclomatic 38): design_primers.validate_config has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/design_primers.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0535dd9d056a1559351e167f4f493a2b86a63ac68f61b1efc104faf05f9837be"}},{"ruleId":"D1","level":"warning","message":{"text":"relsa_score.main (cyclomatic 38): relsa_score.main has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/relsa_score.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4386855ddc17ab5113d98904241086583683023939a82316ea962a97dfd1744"}},{"ruleId":"D1","level":"warning","message":{"text":"provenance_validator.validate_provenance (cyclomatic 37): provenance_validator.validate_provenance has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/provenance_validator.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"52502d375eeed797cf199b1f1c3438a0db6816cd0363008ad90dfc355ea41908"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_case_report.validate_case_manifest (cyclomatic 37): validate_case_report.validate_case_manifest has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/validate_case_report.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e386a395453444796e03a5a41b4d49375175a066cc026f5e9c85a11002fcf85"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_trial_report.validate_trial_manifest (cyclomatic 37): validate_trial_report.validate_trial_manifest has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/validate_trial_report.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"3678b4d45ee04c41663577bc18ef4bcf0f38737e88ba4d12f446c866f6cb849e"}},{"ruleId":"D1","level":"warning","message":{"text":"mutation_profile.main (cyclomatic 37): mutation_profile.main has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathogen-variant-surveillance/scripts/mutation_profile.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"541a64ec4ee57ffacd35605dd1640622e8053a3a6fda957873aa5d3168e480d4"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_review_intake.validate_intake (cyclomatic 37): validate_review_intake.validate_intake has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/peer-review/scripts/validate_review_intake.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3d89ead9fe9880d61b92a7155ac939de5f9822b1eeabfe677b2b84a58600c4"}},{"ruleId":"D1","level":"warning","message":{"text":"dicom_to_image.render_frame (cyclomatic 37): dicom_to_image.render_frame has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/dicom_to_image.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c0bfeb01be9e0c1a52635ed7dbe500ee1811003754230998589f8574c55cb8"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_cds_artifact.validate_artifact (cyclomatic 36): validate_cds_artifact.validate_artifact has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/validate_cds_artifact.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"03886a2bd3a259f9585022349e8b0dd7265221a27710161a066b05f0848a94d4"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_project_manifest.validate (cyclomatic 36): validate_project_manifest.validate has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matlab/scripts/validate_project_manifest.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f575ad348e944a38c6f1a9e95a59486da5dad9e308cf5ed13c0e1aab088a3a"}},{"ruleId":"D1","level":"warning","message":{"text":"resolve_lineage.main (cyclomatic 36): resolve_lineage.main has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathogen-variant-surveillance/scripts/resolve_lineage.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e81d52c89fa6abd85fbe23dfa93a11d2bcdf8f3ed720896982115f95a862bc"}},{"ruleId":"D1","level":"warning","message":{"text":"rna_velocity_workflow.run_velocity_analysis (cyclomatic 36): rna_velocity_workflow.run_velocity_analysis has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scvelo/scripts/rna_velocity_workflow.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4625b1bbdbc252dfd4f952e84370cd6c5988f5fdc091a97b8b35b56d28d03b2"}},{"ruleId":"D1","level":"warning","message":{"text":"sensitive_coordinates_checklist.checklist (cyclomatic 35): sensitive_coordinates_checklist.checklist has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/sensitive_coordinates_checklist.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"730977afe687f09b226207c452eab85dcd382438afe9f0019ca38c44cb260138"}},{"ruleId":"D1","level":"warning","message":{"text":"plan_workload.build_plan (cyclomatic 35): plan_workload.build_plan has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/plan_workload.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7137771e997fe7671edcd3b1b75361ef5ae6cca874019f18d8f11598be910a"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_multimodal._stream_profile (cyclomatic 35): validate_multimodal._stream_profile has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/validate_multimodal.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b448f68b2067be8f93360cf384e99f5a040d433f61e12d1eaa6567c1f97fcf7f"}},{"ruleId":"D1","level":"warning","message":{"text":"deidentification_audit.audit_dataset (cyclomatic 35): deidentification_audit.audit_dataset has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/deidentification_audit.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aabf1c8c92fe5c47c67134f06c8dce0f1617505e67f95c3249e05b3165d6f5c"}},{"ruleId":"D1","level":"warning","message":{"text":"model_diagnostics.check_diagnostics (cyclomatic 35): model_diagnostics.check_diagnostics has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymc/scripts/model_diagnostics.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"116c8e7f70361ab6669be7a52cd2c562992e211288fbef2507008b2aafc48278"}},{"ruleId":"D1","level":"warning","message":{"text":"image_metadata.screen_metadata (cyclomatic 35): image_metadata.screen_metadata has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/image_metadata.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"3348d11b3cf8641d3e383e7ee436c49fbfe2ada2c40df9d520e305fcf1202b95"}},{"ruleId":"D1","level":"warning","message":{"text":"prepare_batch_csv.validate_csv (cyclomatic 34): prepare_batch_csv.validate_csv 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":"skills/diffdock/scripts/prepare_batch_csv.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c223c33d08c083f6e617694e967622fa42cd3f75481123cb8d91b27d42f1c5e8"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_hypothesis_schema.validate_record (cyclomatic 34): validate_hypothesis_schema.validate_record has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/validate_hypothesis_schema.py"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7de6e6ce397be80a821b72e37b93ae9491ca622bb62b218d692c645368b9f3"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_spatial_schema.validate_multiplex (cyclomatic 34): validate_spatial_schema.validate_multiplex 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":"skills/pathml/scripts/validate_spatial_schema.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15e3e29f1503cc557f11dad73e36d8beb55616a219e62f3117b214275f3a413"}},{"ruleId":"D1","level":"warning","message":{"text":"Network.__init__ (cyclomatic 33): Network.__init__ has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/13c-metabolic-flux/scripts/_mfa_model.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d217c8a79dee2538f831bc8c2a2b0a816eb0c642d1121199a2e4c5c9698e5d1a"}},{"ruleId":"D1","level":"warning","message":{"text":"decision_logic_traceability.validate_matrix (cyclomatic 33): decision_logic_traceability.validate_matrix 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":"skills/clinical-decision-support/scripts/decision_logic_traceability.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64c2bf7e109b19f4ee6136d0d185f0dc8731a4fc8296c1de2e49b883ea56b9e"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_trial_report._validate_guidance (cyclomatic 33): validate_trial_report._validate_guidance 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":"skills/clinical-reports/scripts/validate_trial_report.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"df80c76256db060322eea00311a909e687cef2a0a81ea2197b9326d70589db65"}},{"ruleId":"D1","level":"warning","message":{"text":"restart_compatibility.compare (cyclomatic 33): restart_compatibility.compare 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":"skills/fluidsim/scripts/restart_compatibility.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"758b417d05b239e7d6d5b322adbd49df90d5b322bac9925f7418586ae181de51"}},{"ruleId":"D1","level":"warning","message":{"text":"export_plan.plan (cyclomatic 33): export_plan.plan 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":"skills/geopandas/scripts/export_plan.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59ad35bdace842c1c33844d98e0ffd7add8515773840d1d3370ed3c4eebf1fb"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.inspect_bed (cyclomatic 33): _common.inspect_bed 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":"skills/gtars/scripts/_common.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14705174df471406b69a137f6142fd53c26f598541cdb0d21dac1ee3e44b636"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_spatial_schema.validate_graph (cyclomatic 33): validate_spatial_schema.validate_graph 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":"skills/pathml/scripts/validate_spatial_schema.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19017edbed3f828060032b673b4ebacb3c984e48d3c6fe2b0c04c2468cf29f7"}},{"ruleId":"D1","level":"warning","message":{"text":"nca.analyse (cyclomatic 33): nca.analyse 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":"skills/pkpd-modeling/scripts/nca.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9ed6d7b17207295bea683069374bb0d01315665d18af77dcac2ad295208e93"}},{"ruleId":"D1","level":"warning","message":{"text":"alignment_qc.inspect_alignments (cyclomatic 33): alignment_qc.inspect_alignments 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":"skills/pysam/scripts/alignment_qc.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59928f014cbf1765bb6b5338bea6f5216ae40cb6ab2ba2aaa99e3660a495548"}},{"ruleId":"D1","level":"warning","message":{"text":"SlideImageGenerator.generate_slide (cyclomatic 33): SlideImageGenerator.generate_slide 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":"skills/scientific-slides/scripts/generate_slide_image_ai.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6701be5cf7034c1c9736a2087957904976f85b47b1067f14c15abb801105a9"}},{"ruleId":"D1","level":"warning","message":{"text":"check_bioanalytical_run.check_run (cyclomatic 32): check_bioanalytical_run.check_run has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/check_bioanalytical_run.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e17f33f4917a54dc9d6539d9fa758acb6726c38c757732f818ec6f13fa4fafa"}},{"ruleId":"D1","level":"warning","message":{"text":"CitationValidator.validate_file (cyclomatic 32): CitationValidator.validate_file has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/validate_citations.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"348cbf791547cb854983a2e32bc4b22386d672649d116fc3b883a95c234b778b"}},{"ruleId":"D1","level":"warning","message":{"text":"allometry_and_fih.run (cyclomatic 32): allometry_and_fih.run has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/allometry_and_fih.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bf5e7383c5c80e363fc5ec62ec6e19429ac3087a849bb0f7390ca64ca38ea2"}},{"ruleId":"D1","level":"warning","message":{"text":"figure_export.export_figure (cyclomatic 32): figure_export.export_figure has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/figure_export.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35dfefc8aee3fc2a6d35188f99770479fbbbd3eb200ec9fa7f5b80cd04cca42"}},{"ruleId":"D1","level":"warning","message":{"text":"check_consistency.validate_numeric_facts (cyclomatic 32): check_consistency.validate_numeric_facts has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/check_consistency.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6c5e2bbd623e8f2e6e3ab3a78223bc50ca354c15162c2b5feb4a5aa9061105"}},{"ruleId":"D1","level":"warning","message":{"text":"refget_digest_plan.validate (cyclomatic 31): refget_digest_plan.validate has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gtars/scripts/refget_digest_plan.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca473b06f8f59dab40b56aea10fe0197b844e400292e97f067b2b5bdb85a5ec0"}},{"ruleId":"D1","level":"warning","message":{"text":"tokenizer_manifest.check (cyclomatic 31): tokenizer_manifest.check 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":"skills/gtars/scripts/tokenizer_manifest.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3105d6f618e4b60b2e3eebe2fe44ef2f4155f3e24ca3727c1e4b52df33b76d7"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.run_openpiv (cyclomatic 31): runner.run_openpiv 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":"skills/openpiv/scripts/runner.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"44459557a291edb59fb70e5322aa41baf9f949f74087d8513b3ef66b69fc980a"}},{"ruleId":"D1","level":"warning","message":{"text":"design_primers.design (cyclomatic 31): design_primers.design 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":"skills/primer-design/scripts/design_primers.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb31b74a21bb46d9d532a453e40e1499ac8cd451b888491cf2b3e8fcc38bef8c"}},{"ruleId":"D1","level":"warning","message":{"text":"plan_write_request.build_plan (cyclomatic 31): plan_write_request.build_plan 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":"skills/protocolsio-integration/scripts/plan_write_request.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf8963e00245dc3db86b26ee1afdd9265c760c69abed85b7021f5dbcb10985e"}},{"ruleId":"D1","level":"warning","message":{"text":"manuscript_packet.deduplicate_sources (cyclomatic 31): manuscript_packet.deduplicate_sources has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/research-lookup/scripts/manuscript_packet.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"163018ece052128cdfad4a2ae934b143880b41be7d84ec7cf42b65926f8ca4f2"}},{"ruleId":"D1","level":"warning","message":{"text":"check_response.main (cyclomatic 30): check_response.main has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/check_response.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b394ee2875fbd5d7672f63f3b7850b8cfc6f772f8902a293be22acce33c8fe63"}},{"ruleId":"D1","level":"warning","message":{"text":"lint_causal_claims.lint (cyclomatic 30): lint_causal_claims.lint has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/lint_causal_claims.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb5a9b6b53fa973c2bb167e86afc1ec9e4a5ed04cf862e01df2eea9ab4fa4c1"}},{"ruleId":"D1","level":"warning","message":{"text":"library_search.validate_args (cyclomatic 30): library_search.validate_args has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matchms/scripts/library_search.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e9ebe894eedcb605dafb01480a3230d3e48bfc78135858237de11df968e2b6"}},{"ruleId":"D1","level":"warning","message":{"text":"ecg_hrv_pipeline.main (cyclomatic 30): ecg_hrv_pipeline.main has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/ecg_hrv_pipeline.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea2ae35dcee833b882ad7c703bdcd7c506e821d1d894e91dd5bf2f59b32877c"}},{"ruleId":"D1","level":"warning","message":{"text":"_specificity.enumerate_products (cyclomatic 30): _specificity.enumerate_products has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/_specificity.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afd5a49296e2891f8b70b8e413e842da55942d1b65c2e436e07e4655aa4ad23"}},{"ruleId":"D1","level":"warning","message":{"text":"forecast_relsa.auto_arima (cyclomatic 30): forecast_relsa.auto_arima has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/forecast_relsa.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"860ceead3489c2898f719b49e2ce9d3b6be8fdd111c5919c0742525f495a8b9d"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.validate_evaluation (cyclomatic 30): _common.validate_evaluation has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/_common.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c1e62cac3a7e5a9fc744ff2f74e35cb830694c6d493515a5041e6eaedc7603"}},{"ruleId":"D1","level":"warning","message":{"text":"check_cad_file.check (cyclomatic 29): check_cad_file.check has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fictiv/scripts/check_cad_file.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b7dad8a7f98531a83546e755dd4b60a50160d6dbe2fbd47f7a252d340c2503"}},{"ruleId":"D1","level":"warning","message":{"text":"model_artifact_inspector.inspect (cyclomatic 29): model_artifact_inspector.inspect has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/model_artifact_inspector.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"924050c0f976078de27eadbecebf85f64c4eddaba34dbbc912f0dadc6655809d"}},{"ruleId":"D1","level":"warning","message":{"text":"lint_review.lint (cyclomatic 29): lint_review.lint has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/peer-review/scripts/lint_review.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c139eed7423be1175df5750a7517abf104950148734e1861d9fd6af4128ea4"}},{"ruleId":"D1","level":"warning","message":{"text":"screen_specificity.run (cyclomatic 29): screen_specificity.run has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/screen_specificity.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"564a1dbd5756aadb73552cc4be081e852d2faccc846fa3429cfb536db76c2a80"}},{"ruleId":"D1","level":"warning","message":{"text":"_common._validate_schema (cyclomatic 29): _common._validate_schema has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/treatment-plans/scripts/_common.py"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"f529f0758b008ff1604f17efbc40f2bc1c29dc1053f1ab848115ae6eafd6abb9"}},{"ruleId":"D1","level":"warning","message":{"text":"scan_skills.scan_with_progress (cyclomatic 28): scan_skills.scan_with_progress has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan_skills.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"798fdeb0aafdb2c6699da53c3d61223d726d53787344292b82d4e8ad45bf083e"}},{"ruleId":"D1","level":"warning","message":{"text":"atlas_query.cmd_avi (cyclomatic 28): atlas_query.cmd_avi has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/alphagenome/scripts/atlas_query.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e602dfe39918e92748e586979bb92c631d6c20d436c35500c1f1e5ca6ed9264"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_intervals.audit_bed (cyclomatic 28): audit_intervals.audit_bed has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/audit_intervals.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ca78f3e5a3a904581436eeae578efcb883ba664c889723965cf4a4b4ce362e"}},{"ruleId":"D1","level":"warning","message":{"text":"arax_client.render_text_summary (cyclomatic 28): arax_client.render_text_summary has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"70df24fb8cd2dbf2f4e91690bd6597422437674ad2bff70d8e7dda647544f10e"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.validate_manifest (cyclomatic 28): _common.validate_manifest has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pylabrobot/scripts/_common.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af2c4e6990832344c5a8c09db4befe49c3d4580738b7b3891d744cf57683b9b"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.plan_transfers (cyclomatic 28): _common.plan_transfers has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pylabrobot/scripts/_common.py"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f16ed829dbaa0d706f1fa28f76f031908826d91430752c576ccb6a337065d2d"}},{"ruleId":"D1","level":"warning","message":{"text":"filter_alignments.filter_file (cyclomatic 28): filter_alignments.filter_file has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pysam/scripts/filter_alignments.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5796ba659aeac52427c84ee4a0cadd10419ede091c82db40bf36024377f2df"}},{"ruleId":"D1","level":"warning","message":{"text":"result_audit._audit_simulation (cyclomatic 28): result_audit._audit_simulation has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qutip/scripts/result_audit.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5619b127ee0722c4d63c533db397c55d71cb645e2bb258d4769926857f7c83be"}},{"ruleId":"D1","level":"warning","message":{"text":"competing_risk_cif.estimate_cif (cyclomatic 28): competing_risk_cif.estimate_cif has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scikit-survival/scripts/competing_risk_cif.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"53153d650811aa01e812da936da8068dd0cd0b1ba966b689c07645f05854d893"}},{"ruleId":"D1","level":"warning","message":{"text":"compare_methods.main (cyclomatic 27): compare_methods.main has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/compare_methods.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e034673c1d5bc432b298c87cbab4820a148c621edf824a34bf4934512dc483f"}},{"ruleId":"D1","level":"warning","message":{"text":"budget_summary.summarize_spectral_file (cyclomatic 27): budget_summary.summarize_spectral_file has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/budget_summary.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"79eff67397d91bd46b166181a1eb7b4a9cf3f102b242e2f1a23a7b9038765966"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_intervals.audit_vcf (cyclomatic 27): audit_intervals.audit_vcf has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/audit_intervals.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a0b67ad978e5c6331df34d9067552c27d7d280748f2e95ee71e64ac4ba10fe"}},{"ruleId":"D1","level":"warning","message":{"text":"check_contigs.identify (cyclomatic 27): check_contigs.identify has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/check_contigs.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c161cc7b02ea6d96fed67d6c72c3e2acb77678e87abfbc8bd2282448597bb9"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.inspect_geoparquet (cyclomatic 27): _common.inspect_geoparquet has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/_common.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b469d2113fa65cec8691b468f41dc7062adf94aa53c93267a489888dcc863c5"}},{"ruleId":"D1","level":"warning","message":{"text":"execution_plan.build_plan (cyclomatic 27): execution_plan.build_plan has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gtars/scripts/execution_plan.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f501c5ff56d85f576c1b352a39a252bef13a458d2cbda2f3d98700c4b363f24"}},{"ruleId":"D1","level":"warning","message":{"text":"gen.main (cyclomatic 27): gen.main has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/lab-hardware-cad/scripts/gen.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3975e9ab233035e1cae237cfce00f3a6ad996a080db8b2f2e906c9cd7b3ffe"}},{"ruleId":"D1","level":"warning","message":{"text":"notebook_operations.inspect_container (cyclomatic 27): notebook_operations.inspect_container has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/labarchive-integration/scripts/notebook_operations.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c22e4ac07d5d4edec2061ffa251cd0ff7c5f6b1d2df9135b4d98175e4257c8"}},{"ruleId":"D1","level":"warning","message":{"text":"nca.load_profiles (cyclomatic 27): nca.load_profiles has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/nca.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81f8b8d3d5ed58ba1bcd9bf0bcc17d266f42150df38eb57a88d157294bed5fb"}},{"ruleId":"D1","level":"warning","message":{"text":"_pptx.analyze_layout (cyclomatic 27): _pptx.analyze_layout has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_pptx.py"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75bfcddbf557579c11c3487f729af632b95c4c386680f0b33139ff5ff31ff42"}},{"ruleId":"D1","level":"warning","message":{"text":"simulate_battery.solve_protocol (cyclomatic 27): simulate_battery.solve_protocol has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pybamm/scripts/simulate_battery.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9542f9e69b2a436fc8fc32311dce49987b6b281c6ddd91e3453cf75fd29bd53e"}},{"ruleId":"D1","level":"warning","message":{"text":"equilibrate.validate (cyclomatic 27): equilibrate.validate has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pycalphad/scripts/equilibrate.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1877307879c7d2f2b785f419893ae53ed7343ffcd3ad3ed0f0fe4bcebe15e71e"}},{"ruleId":"D1","level":"warning","message":{"text":"dicom_inventory.inspect_dataset (cyclomatic 27): dicom_inventory.inspect_dataset has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/dicom_inventory.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee63b4fddd49e17eb0e87af0ddd1f575e004f3ed75c482d3f28b5ac0f68527e"}},{"ruleId":"D1","level":"warning","message":{"text":"sequence_inspector.inspect_sequence_file (cyclomatic 26): sequence_inspector.inspect_sequence_file 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":"skills/exploratory-data-analysis/scripts/sequence_inspector.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a64abcccbc6537beb42579f3e341b4a88ac24f255295df12bbec55c2ceea35"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_image.preflight (cyclomatic 26): generate_image.preflight 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":"skills/generate-image/scripts/generate_image.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb593de4a216889d17d5a935dcfe9983403babd318e4a1aee0110b7b3b78d3e8"}},{"ruleId":"D1","level":"warning","message":{"text":"crs_reprojection_plan.plan (cyclomatic 26): crs_reprojection_plan.plan 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":"skills/geopandas/scripts/crs_reprojection_plan.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"111203d9daf9e4036778cf038a11d52cf6920a9a41e646dd415db5f3ea14b7d5"}},{"ruleId":"D1","level":"warning","message":{"text":"_common._normalise_region (cyclomatic 26): _common._normalise_region 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":"skills/lab-hardware-cad/scripts/_common.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1551c3449e98a5bb71a67d228175d1e4c34a87e30cb222287891984333215a"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_claim_citations.audit (cyclomatic 26): audit_claim_citations.audit 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":"skills/market-research-reports/scripts/audit_claim_citations.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f3bdbfbd466ae2154b0078a915ac8ea70a89a95fe7ff5ad2c5035d27c026f3"}},{"ruleId":"D1","level":"warning","message":{"text":"exposure_response.run (cyclomatic 26): exposure_response.run 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":"skills/pkpd-modeling/scripts/exposure_response.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"6008c09fd3dd387ebfb58e685deb1d61b7b8cd7e306c709aff3554d5fa240912"}},{"ruleId":"D1","level":"warning","message":{"text":"anonymize_dicom.process_file (cyclomatic 26): anonymize_dicom.process_file has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/anonymize_dicom.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed40d6f1705989a0eb1b732a08890415d94eeaf8b1e96becaa92a77c7c75f20"}},{"ruleId":"D1","level":"warning","message":{"text":"amplicon_workflow.validate (cyclomatic 26): amplicon_workflow.validate 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":"skills/qiime2-amplicon/scripts/amplicon_workflow.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a373dfdaf171f49e2366cc3e866064376408541546e96dac46380cc561d87b36"}},{"ruleId":"D1","level":"warning","message":{"text":"qobj_model_validator.validate_model (cyclomatic 26): qobj_model_validator.validate_model 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":"skills/qutip/scripts/qobj_model_validator.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd9fbc5190b902c9d3d65df12db2bca2a156b94e61162f989257b872e144a0c"}},{"ruleId":"D1","level":"warning","message":{"text":"solver_config_planner.create_plan (cyclomatic 26): solver_config_planner.create_plan 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":"skills/qutip/scripts/solver_config_planner.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b6ad2e0ee71f3ed1e60b647965b055add5c7508793e1a310d482b6adcdcfa6"}},{"ruleId":"D1","level":"warning","message":{"text":"forecast_relsa.main (cyclomatic 26): forecast_relsa.main 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":"skills/relsa-severity-assessment/scripts/forecast_relsa.py"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab0297d85651ebbda6ce44e3d0117b13244c91e143258d46b3a2516b6fe9314"}},{"ruleId":"D1","level":"warning","message":{"text":"check_consistency.validate_methods_results (cyclomatic 26): check_consistency.validate_methods_results 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":"skills/scientific-writing/scripts/check_consistency.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"826ea7ad442ebcb09a78aab7df499f567b25891220ea092a7bab8fac8764dc04"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_format.main (cyclomatic 26): validate_format.main has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/venue-templates/scripts/validate_format.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b7ff6cdd0da0a0583c084bfedb298ab302aace89054af5e7574f7f8c513c72"}},{"ruleId":"D1","level":"warning","message":{"text":"compound_cross_reference.get_kegg_info (cyclomatic 25): compound_cross_reference.get_kegg_info has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bioservices/scripts/compound_cross_reference.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"418330384bf4eace5bc406406e422deb4f79d151af6ab92a165032315a7eca2f"}},{"ruleId":"D1","level":"warning","message":{"text":"CitationValidator.validate_entry (cyclomatic 25): CitationValidator.validate_entry has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/validate_citations.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea03de63ea02063502b60beab1ed19aff529473bb49e323ecd35c50012417438"}},{"ruleId":"D1","level":"warning","message":{"text":"gene_analysis.analyze_gene (cyclomatic 25): gene_analysis.analyze_gene has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gget/scripts/gene_analysis.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"348b450f062ad0b8410d959c4cdec395258c349b5465b9e98e537a838cf27bec"}},{"ruleId":"D1","level":"warning","message":{"text":"fit_compartmental.run (cyclomatic 25): fit_compartmental.run has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/fit_compartmental.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a08defdd4fe04442fe58fa62dd91a2aed759fb082277b4555dbdf459612e908"}},{"ruleId":"D1","level":"warning","message":{"text":"tdm_bayes.run (cyclomatic 25): tdm_bayes.run has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/tdm_bayes.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03d04485c9657b4ec7c9a81782b34a4f9c56b85394ea8bf7fa689e50329e9ab"}},{"ruleId":"D1","level":"warning","message":{"text":"_pptx._preflight_members (cyclomatic 25): _pptx._preflight_members has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_pptx.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ad74cda1513b7b85644534b9189fb876da5134902be6afb3e4941be6145eeb"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_protocol_json._validate_steps (cyclomatic 25): validate_protocol_json._validate_steps has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/protocolsio-integration/scripts/validate_protocol_json.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8028286acacfe6c1320e0e1457faa5a254024a9cd9f8f1a27620c9c7831a7633"}},{"ruleId":"D1","level":"warning","message":{"text":"uid_mapping_validator.validate_mapping (cyclomatic 25): uid_mapping_validator.validate_mapping has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/uid_mapping_validator.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ee5bdaf49d75372da9880d696b710ec3ecd4edfce67d677044bae1ab265ecf"}},{"ruleId":"D1","level":"warning","message":{"text":"substructure_filter.main (cyclomatic 25): substructure_filter.main has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/rdkit/scripts/substructure_filter.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5013d3c1b86c225edba0d711543c30d3c89efe0fc2968ae15571bba3806e038"}},{"ruleId":"D1","level":"warning","message":{"text":"check_traceability.validate_manifest (cyclomatic 25): check_traceability.validate_manifest has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/check_traceability.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"384ee70ff853f070d73c590b5ec1425e567490455cf1b3e442ff62795e12e260"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluate_matrix.load_scores (cyclomatic 25): evaluate_matrix.load_scores has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-brainstorming/scripts/evaluate_matrix.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a374a73429ff1f2c0167e49f85966c9bc30230fde373566042264ebbded3aa51"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_intervals.audit_gff (cyclomatic 24): audit_intervals.audit_gff has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/audit_intervals.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df7ada7fe001004a51b430e2b10918f84150b2bb1b3e7434f3203c469665093"}},{"ruleId":"D1","level":"warning","message":{"text":"check_contigs.compare (cyclomatic 24): check_contigs.compare has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/check_contigs.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e9dc9000b10fa1680fcd0dd9d8a549f78f0a8fe031ff2c7c5ac03ff0a61732"}},{"ruleId":"D1","level":"warning","message":{"text":"artifact_inspector.inspect (cyclomatic 24): artifact_inspector.inspect has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gtars/scripts/artifact_inspector.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c6d828efd54c1b04d8d917889b4dcd943c3f8bc69ad5fda04799522db788fd"}},{"ruleId":"D1","level":"warning","message":{"text":"check_falsification_controls.audit (cyclomatic 24): check_falsification_controls.audit has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/check_falsification_controls.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc17215b9dfa7891120b05c3ce53f25af064cd5825c976ec11f353d7115fc0f"}},{"ruleId":"D1","level":"warning","message":{"text":"screen_analysis.inspect_screen (cyclomatic 24): screen_analysis.inspect_screen has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/mageck/scripts/screen_analysis.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95b188ad3757316dda933bb5116268cee62f97181aaf8bb2866215b73f12491"}},{"ruleId":"D1","level":"warning","message":{"text":"solve_carbonate.read_samples (cyclomatic 24): solve_carbonate.read_samples has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/marine-carbonate-chemistry/scripts/solve_carbonate.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9351cbc22b493952150e7e627682bb0225fbc7f7deb86169c51c624ab1f2a05d"}},{"ruleId":"D1","level":"warning","message":{"text":"_specificity.blast_hits (cyclomatic 24): _specificity.blast_hits has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/_specificity.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf1566b49ab5cd221ac6c5b1b9e5136cdd40e4deaecfa8d335e653c15b39e0b"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_report_scaffold.generate_scaffold (cyclomatic 24): generate_report_scaffold.generate_scaffold has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/generate_report_scaffold.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59ae0b814a905528d29f43bb92a421a2d836610b3e8cc3b6f13f1f51fc26ca3"}},{"ruleId":"D1","level":"warning","message":{"text":"kinetic_experiment.validate_experiment (cyclomatic 24): kinetic_experiment.validate_experiment has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/tellurium/scripts/kinetic_experiment.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b2cba9fe00b067bd2223031aea3b215a9077e718c92cefe9b435a6cd71a570"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.parse_expression (cyclomatic 24): _common.parse_expression has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/_common.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2624abc956d121e58871a65361bfc5fd9cb2a418e70f7f24c6bf7e95cb45af4"}},{"ruleId":"D1","level":"warning","message":{"text":"Observations.__init__ (cyclomatic 23): Observations.__init__ has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/13c-metabolic-flux/scripts/_mfa_model.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc9cb0433ef45b818b0c6553bab7f466664948413e305ee449ccb728bb8b594"}},{"ruleId":"D1","level":"warning","message":{"text":"build_counts_matrix.build_from_salmon (cyclomatic 23): build_counts_matrix.build_from_salmon has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bulk-rnaseq/scripts/build_counts_matrix.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6ff92abc98f91453a94a84ecb835e8316ac1a673bf392d7127354e8d57cd51"}},{"ruleId":"D1","level":"warning","message":{"text":"nuclei_assay.summarize (cyclomatic 23): nuclei_assay.summarize has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/cellprofiler/scripts/nuclei_assay.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f021884c64d7b7507648a2a21680e40c7e80a90ed7ca2e3df82dd0d535cc3105"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.parse_bibtex (cyclomatic 23): _common.parse_bibtex has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/_common.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf173c88e5f8118895f0ee784ca1c6f159de3b2e5b816aad312ea47c77ca05fb"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.evaluate_model (cyclomatic 23): _common.evaluate_model has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/deepchem/scripts/_common.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfff250050f7e8d4ea81845b66c35137da2f96cf8c31bf882b9914f03210586"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_image.main (cyclomatic 23): generate_image.main has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/generate-image/scripts/generate_image.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05a0ab9a87f974152d69899530f453df90f23f5ca225fdac44914ee47979241"}},{"ruleId":"D1","level":"warning","message":{"text":"detect_resources._detect_cpu_inventory (cyclomatic 23): detect_resources._detect_cpu_inventory has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad44c9a74d6a8c9959c482606e1dc5ff0a89d8783e839f92bd18efa4693f27b"}},{"ruleId":"D1","level":"warning","message":{"text":"ScientificSchematicGenerator.generate_iterative (cyclomatic 23): ScientificSchematicGenerator.generate_iterative has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4006596432df23bd462b451effe3587b71f87773956b867f4c9c92f81b33fa"}},{"ruleId":"D1","level":"warning","message":{"text":"ScientificSchematicGenerator.generate_iterative (cyclomatic 23): ScientificSchematicGenerator.generate_iterative has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/literature-review/scripts/generate_schematic_ai.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"368e0e86952c738c09ab8d2f02a4fd1a5c166e5df9d4301af06a4c844c47258b"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_multimodal.validate_manifest (cyclomatic 23): validate_multimodal.validate_manifest has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/validate_multimodal.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"8307cbfce243f4563e2f0c0f737ac9eb5a0c20bc6b171270b18619ae6dea7e99"}},{"ruleId":"D1","level":"warning","message":{"text":"reporting_lag.main (cyclomatic 23): reporting_lag.main has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathogen-variant-surveillance/scripts/reporting_lag.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb114a19910caf20204b9b65325d44220b8399ec1a1e79a5db4fb6a5a9f2018"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_plan._validate_vectorization (cyclomatic 23): validate_plan._validate_vectorization has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pufferlib/scripts/validate_plan.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0e2e0bae96b9b660b1233b1ca7cca33f7ef532ed2d2f6bca3be7015d600253"}},{"ruleId":"D1","level":"warning","message":{"text":"amplicon_workflow.retention (cyclomatic 23): amplicon_workflow.retention has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qiime2-amplicon/scripts/amplicon_workflow.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"11caa0e0a0dadb12455e62265e698bd56336368d80a08b6c256f4fc492a7e56d"}},{"ruleId":"D1","level":"warning","message":{"text":"ResearchLookup._extract_api_citations (cyclomatic 23): ResearchLookup._extract_api_citations has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/research-lookup/scripts/research_lookup.py"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf343d8c437926a475a5e6f434ab254c63ff779d3c6347ab56d835319aac50ec"}},{"ruleId":"D1","level":"warning","message":{"text":"run_pipeline.main (cyclomatic 23): run_pipeline.main has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scanpy/scripts/run_pipeline.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaace177e8c9799529f9bf1dab44032f7f3956b4e0dca44ca3f18a04258add8"}},{"ruleId":"D1","level":"warning","message":{"text":"weight_sensitivity.analyze (cyclomatic 23): weight_sensitivity.analyze has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/weight_sensitivity.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec772622533173fa78686becd1454a95dbb07d18c11978fb4e502d57509b009"}},{"ruleId":"D1","level":"warning","message":{"text":"ScientificSchematicGenerator.generate_iterative (cyclomatic 23): ScientificSchematicGenerator.generate_iterative has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-schematics/scripts/generate_schematic_ai.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a98e2f2c85114f43d027ac8009fc220a4da3842c97e7b1995898e2da208de5"}},{"ruleId":"D1","level":"warning","message":{"text":"ScientificSchematicGenerator.generate_iterative (cyclomatic 23): ScientificSchematicGenerator.generate_iterative has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/generate_schematic_ai.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"571ddf5cb500a29bb0ce9d7811b4a00b7f170e8be881437f8f4eadde3a4265ed"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.validate_document (cyclomatic 23): _common.validate_document has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/treatment-plans/scripts/_common.py"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a2a4ccfe86ac16bf6118a0159b68cacc1260666bca99d4db82b4e72e981c75"}},{"ruleId":"D1","level":"warning","message":{"text":"propagate_uncertainty.run (cyclomatic 23): propagate_uncertainty.run has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/propagate_uncertainty.py"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62c6533b30586df6923c7c5be542a0d539c075d045c5c1309b2ae25e2ce6e8f"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.parse_rows (cyclomatic 22): _common.parse_rows 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":"skills/analytical-method-validation/scripts/_common.py"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b338cef6ad1bcdce74236972151167e4899776a8ebf4aed9fabe1eb9137cce"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAlexSearcher.search (cyclomatic 22): OpenAlexSearcher.search 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":"skills/citation-management/scripts/search_openalex.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b38184904bc197accf491106fb7569e8ea82fb0fc8e2d6e5616ccc78fa57620"}},{"ruleId":"D1","level":"warning","message":{"text":"normalize_variant.normalize (cyclomatic 22): normalize_variant.normalize 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":"skills/genomic-coordinates/scripts/normalize_variant.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c805a3e6607d5a4ff01c190a7bc84f40198266d677958e3977e37087e9ac0231"}},{"ruleId":"D1","level":"warning","message":{"text":"detect_resources._detect_accelerators (cyclomatic 22): detect_resources._detect_accelerators 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":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa0666aa75e8786daeaa08dc7030c87aec0f671aff8c10fbcad438142566cf0"}},{"ruleId":"D1","level":"warning","message":{"text":"enrichment_pipeline.enrichment_pipeline (cyclomatic 22): enrichment_pipeline.enrichment_pipeline has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gget/scripts/enrichment_pipeline.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e44d1c3c2e1d84a135e79645606db666234066fbeb0a8127a745619e7406a1"}},{"ruleId":"D1","level":"warning","message":{"text":"coverage_preflight.preflight (cyclomatic 22): coverage_preflight.preflight has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gtars/scripts/coverage_preflight.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"515ea0e6aeb13b326ca7ff81a8e8e8b0c4d1e6312c535956c3081b4b192de969"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_pdf.generate_pdf (cyclomatic 22): generate_pdf.generate_pdf has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/literature-review/scripts/generate_pdf.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f72eee898d71ce0433ec59baf8b656c4e2addcd9a0fb0409d4444436dee0301"}},{"ruleId":"D1","level":"warning","message":{"text":"plan_batch_command.matlab_literal (cyclomatic 22): plan_batch_command.matlab_literal 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":"skills/matlab/scripts/plan_batch_command.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"617ced592e719bb0a31e9191ff2ac95d23c908e25262086c06544a82e0a89ce0"}},{"ruleId":"D1","level":"warning","message":{"text":"filter_molecules.main (cyclomatic 22): filter_molecules.main has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/medchem/scripts/filter_molecules.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53051ca990c840fcb836de98f2d18cf851ca4529aec475bbc9e8e1b131784bb"}},{"ruleId":"D1","level":"warning","message":{"text":"arax_client.parse_normalization_response (cyclomatic 22): arax_client.parse_normalization_response has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"7445c8b9b8645f6b0bd4b0692fb4372d0ff5f2282a55de621a512b2821444a6b"}},{"ruleId":"D1","level":"warning","message":{"text":"arax_client._classify_logs (cyclomatic 22): arax_client._classify_logs 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":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"520e404d19a3d16acf830c5e5ac7e344fcf5c5e4d2905c1cb10c3f67b8212dcd"}},{"ruleId":"D1","level":"warning","message":{"text":"eda_pipeline.main (cyclomatic 22): eda_pipeline.main has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/eda_pipeline.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2385a18fcef8273ed9f391215616d6df19c7b46256716cebc6821a3820833631"}},{"ruleId":"D1","level":"warning","message":{"text":"plan_epochs.plan (cyclomatic 22): plan_epochs.plan 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":"skills/neurokit2/scripts/plan_epochs.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"22207c2babe2dbee853ac3f7918b2be80d35f1510bf3aba891f5aaf98b91bc12"}},{"ruleId":"D1","level":"warning","message":{"text":"process_1d.process (cyclomatic 22): process_1d.process has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nmrglue/scripts/process_1d.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e844a442d8a206bf96267b7570bc07f58eb7972168ffc82f92e13999be00fd"}},{"ruleId":"D1","level":"warning","message":{"text":"onekgpd_meta.cmd_select_samples_by_population (cyclomatic 22): onekgpd_meta.cmd_select_samples_by_population has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/onekgpd/scripts/onekgpd_meta.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d806f364f8aaefefb97c10c38eb78c4df5b78a359cd36a6318c90a3b1fc16e48"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_terms.check_term (cyclomatic 22): validate_terms.check_term 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":"skills/ontology-term-resolution/scripts/validate_terms.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdf5dee312df99685cd952f17a1d1bbfcb8f52f325ad2597fe1c78180c9f4be"}},{"ruleId":"D1","level":"warning","message":{"text":"slide_manifest.validate_manifest (cyclomatic 22): slide_manifest.validate_manifest 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":"skills/pathml/scripts/slide_manifest.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9ff3814f71b98f9208b09684d434ebf8701d052708671539010e2fc45f580d"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_statistics_reproducibility.audit (cyclomatic 22): audit_statistics_reproducibility.audit 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":"skills/peer-review/scripts/audit_statistics_reproducibility.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3173851d8e66d9f49a063b7367334ee05f98e21f982adfabb63cae2acae6d487"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_protocol_json.validate_and_summarize (cyclomatic 22): validate_protocol_json.validate_and_summarize 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":"skills/protocolsio-integration/scripts/validate_protocol_json.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7091a58a366e9295e517e53a3b6cb272f861108b3680d3387a84c4bab2735358"}},{"ruleId":"D1","level":"warning","message":{"text":"simulate_battery.validate_protocol (cyclomatic 22): simulate_battery.validate_protocol 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":"skills/pybamm/scripts/simulate_battery.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36e9f62bdc3c9f9fde338f357c9fd06b2e5f5fdfd4e6e89c9df4be438cff3f3"}},{"ruleId":"D1","level":"warning","message":{"text":"extract_chromatograms.main (cyclomatic 22): extract_chromatograms.main has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/extract_chromatograms.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"77978af1db3775b1dcf04117c32f143fe208df8d00dd675ad740c0702c072ab5"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmark_evaluation.normalize_predictions (cyclomatic 22): benchmark_evaluation.normalize_predictions 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":"skills/pytdc/scripts/benchmark_evaluation.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b71ed8c9e7a1012260c38380dac52822452b07981c8e9707e25c2824caa82ee"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_authorship.validate_ai_disclosure (cyclomatic 22): validate_authorship.validate_ai_disclosure 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":"skills/scientific-writing/scripts/validate_authorship.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf436f454c22c162b6f6e78ae612b17e72f82c72bfcdd2c36bc4c1d4b23169c"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_manifest.validate_manuscript_manifest (cyclomatic 22): validate_manifest.validate_manuscript_manifest has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/validate_manifest.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a666918f321fae29672b32df60ba4ccaad5b2286575f1b5b2a426ff7eddeea5"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_manifest.validate_source_manifest (cyclomatic 22): validate_manifest.validate_source_manifest 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":"skills/scientific-writing/scripts/validate_manifest.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e6196ad23ba4cc36df1b3d8e40603ebfebefaacf3e8038b2ed0754f6aaafee"}},{"ruleId":"D1","level":"warning","message":{"text":"_mfa_fit.diagnostics (cyclomatic 21): _mfa_fit.diagnostics 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":"skills/13c-metabolic-flux/scripts/_mfa_fit.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b8b9a0c64ee341ca983456a983778ebd9017312f0257861e7dda5a811e03c3"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_samplesheet.validate_metadata (cyclomatic 21): validate_samplesheet.validate_metadata has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bulk-rnaseq/scripts/validate_samplesheet.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33578bf8b7fead226a4e6475a103b6b958e31a08100b95d519562007525f7f3"}},{"ruleId":"D1","level":"warning","message":{"text":"_capabilities.validate_magic (cyclomatic 21): _capabilities.validate_magic 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":"skills/exploratory-data-analysis/scripts/_capabilities.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4b27b728fbe76e80f355297d3fd7b8f64596206f5a6f197cdaf6e7c68d4321"}},{"ruleId":"D1","level":"warning","message":{"text":"_structured.inspect_hdf5 (cyclomatic 21): _structured.inspect_hdf5 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":"skills/exploratory-data-analysis/scripts/_structured.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6600fc7778450308be05bc921efbed06d3e53acad008d2c46b3768365219a2"}},{"ruleId":"D1","level":"warning","message":{"text":"tokenizer_compatibility.inspect (cyclomatic 21): tokenizer_compatibility.inspect has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/tokenizer_compatibility.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc33e16911d6f20bd00376ce29e0279a8aeb18c5216e15e44189aa479a5e121"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.validate_dataset_manifest (cyclomatic 21): _common.validate_dataset_manifest has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6f17ded5bc4c72cf16c8117b08044e10ca8b88c6e2696ecc3dfe83a437c300"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_document_records.validate (cyclomatic 21): audit_document_records.validate 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":"skills/iso-standards-readiness/scripts/audit_document_records.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5214dc6f133c30dbbf657e4174cce4ba7bf859708521180e1d56c21e29c58ec5"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.normalise_checks (cyclomatic 21): _common.normalise_checks 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":"skills/lab-hardware-cad/scripts/_common.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"7751d94d8b0e656c7f2d8c44c547419756f31f3f74daa2ed85c5b77eb11bab85"}},{"ruleId":"D1","level":"warning","message":{"text":"zooma_client.flatten_hit (cyclomatic 21): zooma_client.flatten_hit has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/zooma_client.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e9749a5e1bd7b32de73aa982f6d153e2bf5eea1665f58d55a63218339ac58e"}},{"ruleId":"D1","level":"warning","message":{"text":"plan_write_request._validate_update (cyclomatic 21): plan_write_request._validate_update 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":"skills/protocolsio-integration/scripts/plan_write_request.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6187ae527f6570a6aabd2e2d54245342660571940f74edb63e7618c6e1575c"}},{"ruleId":"D1","level":"warning","message":{"text":"protocols_read._plan (cyclomatic 21): protocols_read._plan 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":"skills/protocolsio-integration/scripts/protocols_read.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d4ac4cc00eb726f9e38529606688ab1c377ba3153a7065f439f8b5db829e48"}},{"ruleId":"D1","level":"warning","message":{"text":"phase_diagram_generator.entries_from_payload (cyclomatic 21): phase_diagram_generator.entries_from_payload 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":"skills/pymatgen/scripts/phase_diagram_generator.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"568bade40afb2ea4a9c6494c539b2b8dd1a760acefb432d4a00115cc69a83810"}},{"ruleId":"D1","level":"warning","message":{"text":"uncertainty_budget.normalize_component (cyclomatic 21): uncertainty_budget.normalize_component has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/uncertainty_budget.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f06349a4a12d4efb04824ef671692fa27548d9def7cb262dc67dc18f8f028c6"}},{"ruleId":"D1","level":"warning","message":{"text":"protein_analysis_workflow.get_go_annotations (cyclomatic 20): protein_analysis_workflow.get_go_annotations 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":"skills/bioservices/scripts/protein_analysis_workflow.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"582c71d05c39bcf16d281b86b2b48b47cca0f9b902bfd3bef8a89bd96dad8c08"}},{"ruleId":"D1","level":"warning","message":{"text":"nuclei_assay.prepare (cyclomatic 20): nuclei_assay.prepare 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":"skills/cellprofiler/scripts/nuclei_assay.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"619c6110f053b230361cb65a2ac3cb0101b81f8601dfa1ec0118431fef90ff99"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAlexSearcher._normalise (cyclomatic 20): OpenAlexSearcher._normalise has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/search_openalex.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"147e4ab6cf30461a1bbff742d277da59fe7e6b17362132e19f354aca4ef02316"}},{"ruleId":"D1","level":"warning","message":{"text":"format_adverse_events.load_aggregate_csv (cyclomatic 20): format_adverse_events.load_aggregate_csv 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":"skills/clinical-reports/scripts/format_adverse_events.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1fc98d8e1ca6646c1f3d8eb34c19d87a880c7f3134011be15cf68de6bf5ce3"}},{"ruleId":"D1","level":"warning","message":{"text":"Validator.validate_run_spec (cyclomatic 20): Validator.validate_run_spec has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/dnanexus-integration/scripts/validate_dxapp.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b308546bba58965795db2f5608be415656cb717309b432626ed6e0c091d15cb"}},{"ruleId":"D1","level":"warning","message":{"text":"detect_resources._amd_entries (cyclomatic 20): detect_resources._amd_entries 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":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76ac03ee1e014c3239987e8fabcef689a0a47be4425eaa12d39c16908ef58af"}},{"ruleId":"D1","level":"warning","message":{"text":"detect_resources._amd_memory_bytes (cyclomatic 20): detect_resources._amd_memory_bytes 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":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6eeb0c47abacac2e08b14ddcd95bb823f8a13f271d0fad76ce3db2be103a81"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_evidence_manifest.validate (cyclomatic 20): validate_evidence_manifest.validate 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":"skills/iso-standards-readiness/scripts/validate_evidence_manifest.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cc6520584c89f7671723b776f1a5daa37336b19f6eac52342f6cf656133c28"}},{"ruleId":"D1","level":"warning","message":{"text":"id_client.classify_prefix_query (cyclomatic 20): id_client.classify_prefix_query has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/id_client.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8048009b92e997ac961a9b76e4e902fd2ef1a74f0a3d6289fc1e4190e53acf7"}},{"ruleId":"D1","level":"warning","message":{"text":"paginate._rxiv_parse (cyclomatic 20): paginate._rxiv_parse has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/paper-lookup/scripts/paginate.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17cbe4ac8afb4151a78585a9bb089421e372968386c0fabe2920f0a4bfabcd0"}},{"ruleId":"D1","level":"warning","message":{"text":"plan_write_request._validate_steps (cyclomatic 20): plan_write_request._validate_steps 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":"skills/protocolsio-integration/scripts/plan_write_request.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16473b02d071350df9b0a208afd3ec7acb2b50bec4818a368c59fdc0606f703"}},{"ruleId":"D1","level":"warning","message":{"text":"model_comparison.model_averaging (cyclomatic 20): model_comparison.model_averaging 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":"skills/pymc/scripts/model_comparison.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1518fa59206614985e23e251a855f8f23438c62b5825e1ac2b8ff0e76d81228"}},{"ruleId":"D1","level":"warning","message":{"text":"convergence_sweep.run_sweep (cyclomatic 20): convergence_sweep.run_sweep 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":"skills/qutip/scripts/convergence_sweep.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed70c34aed47b3ce97ac35d395c528b21608acd8bfd2b821346396625c85aeff"}},{"ruleId":"D1","level":"warning","message":{"text":"forecast_relsa.forecast_animal (cyclomatic 20): forecast_relsa.forecast_animal has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/forecast_relsa.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ed2079f02ff8650b429e6493173cc0660ae7e5d97d1cac945d1bf060754172"}},{"ruleId":"D1","level":"warning","message":{"text":"kde_thresholds.find_thresholds (cyclomatic 20): kde_thresholds.find_thresholds 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":"skills/relsa-severity-assessment/scripts/kde_thresholds.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4cbad939b3319b78d936ec0c08fc910b5f70b44e3af2f6de64b1b4e8cf613d"}},{"ruleId":"D1","level":"warning","message":{"text":"ResearchLookup._extract_sources (cyclomatic 20): ResearchLookup._extract_sources 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":"skills/research-lookup/scripts/research_lookup.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed02ecd75f7a35db751260104e81d9d5335e985dbbc3dd84e512ed6ee9a8130"}},{"ruleId":"D1","level":"warning","message":{"text":"convert_units.run (cyclomatic 20): convert_units.run 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":"skills/uncertainty-and-units/scripts/convert_units.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"021a00941f329978e3e1fae52b005a6404b5eac589e949a5e56f7152456f00ec"}},{"ruleId":"D1","level":"warning","message":{"text":"scan_skills.generate_report (cyclomatic 19): scan_skills.generate_report has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan_skills.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4baabdc8fdc8630c2b1b5bf88fe00f527f1a1a2384eeaa76744d54720ec010"}},{"ruleId":"D1","level":"warning","message":{"text":"terminology_validator.validate_terminology_manifest (cyclomatic 19): terminology_validator.validate_terminology_manifest has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/terminology_validator.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe4368c553480c7cb73a2eec813bb1ee0c95d80d73bbd59856a37f69e41070f"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze_gates.analyze (cyclomatic 19): analyze_gates.analyze has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/flowkit/scripts/analyze_gates.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44571cf188710286675a6b5140f204004aae3cf45f21f0bf303cad059c837e2"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.simple_yaml_mapping (cyclomatic 19): _common.simple_yaml_mapping has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb6e7393b3ed69c71bdcbd1d94dcbb2558d6b0afd3f1f0fad8bc2dc24e2abf0"}},{"ruleId":"D1","level":"warning","message":{"text":"check_operationalization.audit (cyclomatic 19): check_operationalization.audit has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/check_operationalization.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a865924c6d3deec48c9237196ca9ccbd518f9457c1349519d1a8be52590cc783"}},{"ruleId":"D1","level":"warning","message":{"text":"generate_infographic.main (cyclomatic 19): generate_infographic.main has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7471bf7c005643fec8aa633952e4e3fe091b66fb48eb7cab72e3d6a05e27edd"}},{"ruleId":"D1","level":"warning","message":{"text":"check_capa.validate (cyclomatic 19): check_capa.validate has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/check_capa.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe77a021e70a193be3fbc629647d74d12677b3ba804703ec95623d3e16912a33"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.read_numeric_columns (cyclomatic 19): _common.read_numeric_columns has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"d724cd00db98e12464880c9fb0d9ca340a873491be9edcb53733235fe6aabf4c"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.read_csv_records (cyclomatic 19): _common.read_csv_records has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/peer-review/scripts/_common.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84c9b484d8323fcad8f7aa25734bc485805de3fbfaf18a091df6bf5ccae3198"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_claim_evidence.validate_matrix (cyclomatic 19): validate_claim_evidence.validate_matrix has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/peer-review/scripts/validate_claim_evidence.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d875640ab9f95d7931c0cfe650e72793e34e3cf9dd443590f8255394d6c717"}},{"ruleId":"D1","level":"warning","message":{"text":"bioequivalence.crossover_2x2 (cyclomatic 19): bioequivalence.crossover_2x2 has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/bioequivalence.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ecaab82c7639d9fa4155941969da67e863950b68dfe5af546cb2595c652fd4"}},{"ruleId":"D1","level":"warning","message":{"text":"fit_compartmental._fit_and_report (cyclomatic 19): fit_compartmental._fit_and_report has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/fit_compartmental.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80be90833bf1ff7fd0362d2ed6b07ab843cee1f5008f8136c54919deea58716"}},{"ruleId":"D1","level":"warning","message":{"text":"accurate_mass_search.main (cyclomatic 19): accurate_mass_search.main has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/accurate_mass_search.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2027e2169bb5f716e5a30bdb35c24b7829c26d0db8d2c19709ed265bda3ee7"}},{"ruleId":"D1","level":"warning","message":{"text":"ResearchLookup.__init__ (cyclomatic 19): ResearchLookup.__init__ has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/research-lookup/scripts/research_lookup.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e073113e7648db9976df4674eda2246bb710059dfd9d46e4fa2bbcc70da670b"}},{"ruleId":"D1","level":"warning","message":{"text":"plot.main (cyclomatic 19): plot.main has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scanpy/scripts/plot.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"139e8e01b2b82d6557869cd1319772cfead96df60ac8cb8c58307b31f39709fa"}},{"ruleId":"D1","level":"warning","message":{"text":"image_metadata.inspect_svg (cyclomatic 19): image_metadata.inspect_svg has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/image_metadata.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc8ec1c409a54ace7fb1048a39104a73c8a0eec33c407698a63f2c2956c1fdb"}},{"ruleId":"D1","level":"warning","message":{"text":"lint_manuscript.lint_text (cyclomatic 19): lint_manuscript.lint_text has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/lint_manuscript.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadedc9e4db609a04d2d529ee0e4f84fabc4d2bfa3c6d70a58884bf75c5997ff"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.read_variant_table (cyclomatic 18): _common.read_variant_table 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":"skills/alphagenome/scripts/_common.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"116651a578f3ac0e87fce8dc1dde17919462f951eeb15eb7fa8217aefe26ca42"}},{"ruleId":"D1","level":"warning","message":{"text":"atlas_query.tidy_atlas_scores (cyclomatic 18): atlas_query.tidy_atlas_scores 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":"skills/alphagenome/scripts/atlas_query.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"097eed95fd5002f1da5a00b0d06ae1fa5f8f6936f25ac32266405b6ae8f535b1"}},{"ruleId":"D1","level":"warning","message":{"text":"atlas_query.cmd_scores (cyclomatic 18): atlas_query.cmd_scores 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":"skills/alphagenome/scripts/atlas_query.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"669e1ef1ca5bf1e06f2dfda0e423cfecbd6f65de0b3651055403f7ffc8a9aa81"}},{"ruleId":"D1","level":"warning","message":{"text":"score_variants.score (cyclomatic 18): score_variants.score has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/alphagenome/scripts/score_variants.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a49b6fc2bd1a4219c7351b0f8d47676411f6126974c569f71985a34741c3d05"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch_window.fetch_window (cyclomatic 18): fetch_window.fetch_window 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":"skills/autoskill/scripts/fetch_window.py"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb0855b7c78ea7b154a5b8bf697cbf7f3ca05a680bc21bc083b64e5689248ac"}},{"ruleId":"D1","level":"warning","message":{"text":"transfer_learning.main (cyclomatic 18): transfer_learning.main has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/deepchem/scripts/transfer_learning.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"196fb369e617c6938f0cf01b9b71903bb7a157b761d1ab806a896bf1c8960d25"}},{"ruleId":"D1","level":"warning","message":{"text":"restart_compatibility.load_hdf5_state (cyclomatic 18): restart_compatibility.load_hdf5_state 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":"skills/fluidsim/scripts/restart_compatibility.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf104abb20c54a871c081e8457a832302fd6553867266f68a0434c0a755f5c18"}},{"ruleId":"D1","level":"warning","message":{"text":"detect_resources._detect_process_cpu_count (cyclomatic 18): detect_resources._detect_process_cpu_count 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":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edc7c2c21bb55e07a2a255ae6eeef54d36c315690b269126b09ddc5fce1048a"}},{"ruleId":"D1","level":"warning","message":{"text":"check_qmsr_transition.validate (cyclomatic 18): check_qmsr_transition.validate 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":"skills/iso-standards-readiness/scripts/check_qmsr_transition.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9648e8e5149984362932e80b2f40ff8e530ba48839d86cd7d7d21ea4d1c6a1"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_scope_intake.validate (cyclomatic 18): validate_scope_intake.validate 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":"skills/iso-standards-readiness/scripts/validate_scope_intake.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"456d4dff88d93f2494339de708828ddcf834e563c8b13f1d8ef1d9e84f623a70"}},{"ruleId":"D1","level":"warning","message":{"text":"check.cmd_fit (cyclomatic 18): check.cmd_fit 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":"skills/lab-hardware-cad/scripts/check.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"e580bf1fd8b4d3cd022a792887832030d971cf39aabdc6c33170cca491ca0f56"}},{"ruleId":"D1","level":"warning","message":{"text":"ScientificSchematicGenerator.review_image (cyclomatic 18): ScientificSchematicGenerator.review_image has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5c22969913cd5b087e3d3ff0a6fdb95aa9af130a75fc522ab7b9e2ad4cc063"}},{"ruleId":"D1","level":"warning","message":{"text":"ScientificSchematicGenerator.review_image (cyclomatic 18): ScientificSchematicGenerator.review_image has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/literature-review/scripts/generate_schematic_ai.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"f319db4575592d8e44f4c421cf4c68b085e5421108f50a66a38127246e2c50fb"}},{"ruleId":"D1","level":"warning","message":{"text":"check_unit_consistency.check (cyclomatic 18): check_unit_consistency.check 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":"skills/market-research-reports/scripts/check_unit_consistency.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b308e0ebd2f6b78687110c3cef76f550c9649214ece9c26c1f983568af7b8b5c"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_evidence_ledger.validate_records (cyclomatic 18): validate_evidence_ledger.validate_records 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":"skills/market-research-reports/scripts/validate_evidence_ledger.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0218ed29b87cfc48b262e7d5623b0fc7fb12e329e186f19a033ef90b02b31db3"}},{"ruleId":"D1","level":"warning","message":{"text":"scan_m_code.collect (cyclomatic 18): scan_m_code.collect 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":"skills/matlab/scripts/scan_m_code.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da5a62dd356938ecfc1eb419d56d0dc85e22088649dafc8038648070c862f76"}},{"ruleId":"D1","level":"warning","message":{"text":"analysis_template.main (cyclomatic 18): analysis_template.main has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neuropixels-analysis/assets/analysis_template.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa872b91dace83168d34b0830a710ec782f9908c87f9d2dac5c8c024082a24f8"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_terms.read_pairs (cyclomatic 18): validate_terms.read_pairs 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":"skills/ontology-term-resolution/scripts/validate_terms.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7826603ff429cc24018cef879d2aab425ed2749031944618888a940a8e17b18"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_terms.main (cyclomatic 18): validate_terms.main has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/validate_terms.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fe47fad13615aa90b6ec4421a33507a3529e2915ed962876027330c23bf2af"}},{"ruleId":"D1","level":"warning","message":{"text":"jats_to_text.main (cyclomatic 18): jats_to_text.main has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/paper-lookup/scripts/jats_to_text.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6df1704585b7701addc90abbac278983ccdafcc0427a578db3cdc220a1de2c"}},{"ruleId":"D1","level":"warning","message":{"text":"phylogenetic_analysis.validate_fasta (cyclomatic 18): phylogenetic_analysis.validate_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":"skills/phylogenetics/scripts/phylogenetic_analysis.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfbc7ae34869215099d901a9eb5795122194798c0e0991e3d4ae2fe4bd154c6"}},{"ruleId":"D1","level":"warning","message":{"text":"_pptx._inspect_slide_accessibility (cyclomatic 18): _pptx._inspect_slide_accessibility 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":"skills/pptx-posters/scripts/_pptx.py"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5931611c1fcce17153f4c1bf9e6ff665c8e42295f94e772925e54b6661d1f4"}},{"ruleId":"D1","level":"warning","message":{"text":"check_thermodynamics.assess (cyclomatic 18): check_thermodynamics.assess 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":"skills/primer-design/scripts/check_thermodynamics.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5713373978f752d332a290d112bb6d6812d242069354048474d653b1052b10"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.request_bytes (cyclomatic 18): _common.request_bytes 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":"skills/protocolsio-integration/scripts/_common.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"6728a1ffe4a99f15ae3d2db1913793689a6bc77ab3631d24643ed7dfbf119e57"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.load_structure_json (cyclomatic 18): _common.load_structure_json 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":"skills/pymatgen/scripts/_common.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad5add8c710a78df60304ed911bb41f772f7cb6c2ac31f24d813fb228701a86"}},{"ruleId":"D1","level":"warning","message":{"text":"composition_structure_validator.validate_structure (cyclomatic 18): composition_structure_validator.validate_structure has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymatgen/scripts/composition_structure_validator.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fa9eb55ba67ef13acb102a796622c858f8e49a546515f36ea103a0e38c126c"}},{"ruleId":"D1","level":"warning","message":{"text":"decision_making_example.apply_pseudo_weights (cyclomatic 18): decision_making_example.apply_pseudo_weights has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymoo/scripts/decision_making_example.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d2c0fd26c13cd40b65f37f3674b14ab6c9a1ef9deec102714ba19982260bf4"}},{"ruleId":"D1","level":"warning","message":{"text":"process_spectra.main (cyclomatic 18): process_spectra.main has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/process_spectra.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf772b9963b3268cc09200dc5e47f543226793dce05f01583e27930c54caa33"}},{"ruleId":"D1","level":"warning","message":{"text":"variant_summary.summarize_variants (cyclomatic 18): variant_summary.summarize_variants 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":"skills/pysam/scripts/variant_summary.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"932c69a5cd6bc02c4eea8b35f28a39748f17d6095025ef211157b569b9fe8f42"}},{"ruleId":"D1","level":"warning","message":{"text":"substructure_filter.filter_molecules (cyclomatic 18): substructure_filter.filter_molecules 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":"skills/rdkit/scripts/substructure_filter.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9f9666ad9964b63174adfc3cc70a637217be9c58fc458520378a54501e5c39"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.validate (cyclomatic 18): _common.validate has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/_common.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce48ab94b646ab4b24c9d2944fa96d67d27a8af25cff41116474dda0654d3c14"}},{"ruleId":"D1","level":"warning","message":{"text":"_common._scan_structure (cyclomatic 18): _common._scan_structure 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":"skills/scholar-evaluation/scripts/_common.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb3d7285292445e7fbaa0bfdbd794fd41149d76613cf8c5028f053ea080c672"}},{"ruleId":"D1","level":"warning","message":{"text":"_common._validate_scale (cyclomatic 18): _common._validate_scale 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":"skills/scholar-evaluation/scripts/_common.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3e9f7a491d7cba4933df74ee3b05132031792bc2ad75f76fb4708e3c72c565"}},{"ruleId":"D1","level":"warning","message":{"text":"summarize_agreement.read_rows (cyclomatic 18): summarize_agreement.read_rows 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":"skills/scholar-evaluation/scripts/summarize_agreement.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbe9cb5a529e9361967952a60a73309c83851168495c0c1ce6586ff2fce2e07"}},{"ruleId":"D1","level":"warning","message":{"text":"summarize_agreement.summarize (cyclomatic 18): summarize_agreement.summarize 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":"skills/scholar-evaluation/scripts/summarize_agreement.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd95cb64af5deaaa9e07cc84b436d2b19524b8f25b69f56d4c165bcc7036906e"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluate_matrix.load_criteria (cyclomatic 18): evaluate_matrix.load_criteria 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":"skills/scientific-brainstorming/scripts/evaluate_matrix.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f951354dcff166650425749f8258afb72cebbc6a7c3b2259fd4c731875db0c6"}},{"ruleId":"D1","level":"warning","message":{"text":"ScientificSchematicGenerator.review_image (cyclomatic 18): ScientificSchematicGenerator.review_image has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-schematics/scripts/generate_schematic_ai.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55e06ecceff90bcbe9b1954c69503f694f8a2ed7cff5cde3b941695e14413af"}},{"ruleId":"D1","level":"warning","message":{"text":"ScientificSchematicGenerator.review_image (cyclomatic 18): ScientificSchematicGenerator.review_image has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/generate_schematic_ai.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e04f1c35c62d1f3ab2c2cd057f18f5da9ead2b2b3eea44c463cebbe9b594592"}},{"ruleId":"D1","level":"warning","message":{"text":"SlideImageGenerator.review_image (cyclomatic 18): SlideImageGenerator.review_image has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/generate_slide_image_ai.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d55690de3b2fdaa0fb82ae01e449e5fde371b1fd15d477b31a522adeb1c754a"}},{"ruleId":"D1","level":"warning","message":{"text":"slides_to_pdf.combine_images_to_pdf (cyclomatic 18): slides_to_pdf.combine_images_to_pdf 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":"skills/scientific-slides/scripts/slides_to_pdf.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfef376556d6ebdee404345e6e39d9845e38bd26aedb90a0be8ffc00d72c149f"}},{"ruleId":"D1","level":"warning","message":{"text":"figure_export.save_for_journal (cyclomatic 18): figure_export.save_for_journal has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/figure_export.py"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"72af37c9782e606920c01be29ba78bfa9092fd6014940e27e6855bc567ab0202"}},{"ruleId":"D1","level":"warning","message":{"text":"assumption_checks.check_regression_diagnostics (cyclomatic 18): assumption_checks.check_regression_diagnostics has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/statistical-analysis/scripts/assumption_checks.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b609f02a202a1593ba7f79c49fd8079e7388c6f9e3b9d48de0c6cb8f12802e"}},{"ruleId":"D1","level":"warning","message":{"text":"privacy_process_check.check_privacy_process (cyclomatic 18): privacy_process_check.check_privacy_process 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":"skills/treatment-plans/scripts/privacy_process_check.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e7ade18aca7b6d505ddf760706b8cc291a6131c973895a663e8d3b566ae8fb"}},{"ruleId":"D1","level":"warning","message":{"text":"tree.cmd_observe (cyclomatic 17): tree.cmd_observe 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":"skills/arbor/scripts/tree.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6dfa02a469ee59fd292aa238813a391709907a65cd480aa5d7eab56c8d1a39"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze_results.print_summary (cyclomatic 17): analyze_results.print_summary 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":"skills/diffdock/scripts/analyze_results.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcbbf56d2d16073b55b653cd397eb33b345f869e36e6ac657c6a2524a18d806"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect_dxpy.print_text (cyclomatic 17): inspect_dxpy.print_text 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":"skills/dnanexus-integration/scripts/inspect_dxpy.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49cf0b310ee9c600ab4db81d24b3894699506e7087e479e30a64ad9f192fd38"}},{"ruleId":"D1","level":"warning","message":{"text":"_tabular.profile_json_structure (cyclomatic 17): _tabular.profile_json_structure has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_tabular.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e72914dace42c81a2d2367710eda5431c02ac77742f89c85e1400affe38909"}},{"ruleId":"D1","level":"warning","message":{"text":"restart_compatibility.load_manifest (cyclomatic 17): restart_compatibility.load_manifest has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/restart_compatibility.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e407435e706ba572b833d128c3b1ad01b99269f268365df6a91ca8cca7a7766"}},{"ruleId":"D1","level":"warning","message":{"text":"gap_analyzer.analyze (cyclomatic 17): gap_analyzer.analyze 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":"skills/iso-standards-readiness/scripts/gap_analyzer.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"280165ba01cf9e97d7dbac36836749eac0e052bd97d237fcec483d65713a4702"}},{"ruleId":"D1","level":"warning","message":{"text":"search_databases.format_search_results (cyclomatic 17): search_databases.format_search_results 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":"skills/literature-review/scripts/search_databases.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"18033ec09cf605e1aa46010d5c78c201d85dd5db57b8cb90ac0bc33bcb591109"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.checked_input (cyclomatic 17): _common.checked_input has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matlab/scripts/_common.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f81c9338e670f76a03f6616e8f9a3b5c8a96bec98b3efeab670609784c474ea"}},{"ruleId":"D1","level":"warning","message":{"text":"reproducibility_report.build (cyclomatic 17): reproducibility_report.build has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matlab/scripts/reproducibility_report.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ad1cf1ef8692b8dd267f18469b654872e66690847da5914371f3c58ae2966a"}},{"ruleId":"D1","level":"warning","message":{"text":"convert_session.align_behavior (cyclomatic 17): convert_session.align_behavior has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nwb-conversion/scripts/convert_session.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d30892f065cf9e5c1c4bd92e4aa7f56eecc0a1c0cb8f3bad5c7bd80bcee5fd"}},{"ruleId":"D1","level":"warning","message":{"text":"select_reporting_guidelines.assess (cyclomatic 17): select_reporting_guidelines.assess 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":"skills/peer-review/scripts/select_reporting_guidelines.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5364b3a65f5a2034cce3f96f0c47738effe416891903f6c93fb04ee65915099"}},{"ruleId":"D1","level":"warning","message":{"text":"phylogenetic_analysis.root_for_display (cyclomatic 17): phylogenetic_analysis.root_for_display 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":"skills/phylogenetics/scripts/phylogenetic_analysis.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7090d05fc28be85d4f981d8367355c92ae29f00d8b47ae3218d56e50f7ba7858"}},{"ruleId":"D1","level":"warning","message":{"text":"_models.simulate_tmdd (cyclomatic 17): _models.simulate_tmdd has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/_models.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc948d9d5547e0fbedacd7acc45b00e794b642730adf30d2d219a8d34b99259"}},{"ruleId":"D1","level":"warning","message":{"text":"bioequivalence.run (cyclomatic 17): bioequivalence.run has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/bioequivalence.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"a816d1e3604175b6323aa0e245cd0883f160313aa903ed4aa2165e9645e89130"}},{"ruleId":"D1","level":"warning","message":{"text":"nca.estimate_lambda_z (cyclomatic 17): nca.estimate_lambda_z 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":"skills/pkpd-modeling/scripts/nca.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff146e1ede74be0c3221a9a22166e8bbaf5417d00eed67c481525749518a8a0d"}},{"ruleId":"D1","level":"warning","message":{"text":"_pptx._inspect_content_types (cyclomatic 17): _pptx._inspect_content_types 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":"skills/pptx-posters/scripts/_pptx.py"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5f7adb8ef21ee8f96c3b57d84ba2590b458bfdc3cde8fdfa3ee91d1c72166a"}},{"ruleId":"D1","level":"warning","message":{"text":"dicom_to_image._apply_grayscale_transforms (cyclomatic 17): dicom_to_image._apply_grayscale_transforms has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/dicom_to_image.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"254dba0d8a189c50f71bd084ee2c01bd6efc1596021f3fa585ce758fe5925890"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_claims.audit_markdown (cyclomatic 17): audit_claims.audit_markdown 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":"skills/scientific-writing/scripts/audit_claims.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b5835a03c14902831ac63702ff92bbdaa5e9510054d5be4357fc825f356628"}},{"ruleId":"D1","level":"warning","message":{"text":"check_references.check_sources (cyclomatic 17): check_references.check_sources 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":"skills/scientific-writing/scripts/check_references.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"73eebccd2672d38a3d5a611f4153f58c9cd20142e93f1e4d026dcc5e31984350"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluate_survival_metrics.validate_time_grid (cyclomatic 17): evaluate_survival_metrics.validate_time_grid has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scikit-survival/scripts/evaluate_survival_metrics.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1191941db2de9053589c9ab611007b29c38e0037a939f37f93e5f7ac466b95a"}},{"ruleId":"D1","level":"warning","message":{"text":"event_trace_summary.summarize_resource_csv (cyclomatic 17): event_trace_summary.summarize_resource_csv 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":"skills/simpy/scripts/event_trace_summary.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d982f5fe909cdef96bbf429b98c7d25caa0dafea2cff27d261fedb57674c7463"}},{"ruleId":"D1","level":"warning","message":{"text":"_mfa_fit.profile (cyclomatic 16): _mfa_fit.profile 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":"skills/13c-metabolic-flux/scripts/_mfa_fit.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"4803178ee9b90502b19999647c613e58ffba35e3c77c09f81c011262b55414b5"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.passing_bablok (cyclomatic 16): _common.passing_bablok has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/_common.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3a6b597afa6dd3f28460aa8f98e46592074c3417421e3482cfdee9838e958d"}},{"ruleId":"D1","level":"warning","message":{"text":"compound_cross_reference.get_chembl_info (cyclomatic 16): compound_cross_reference.get_chembl_info has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bioservices/scripts/compound_cross_reference.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"535ae527852cc7dff87a49db03aabf42a208f71d52d2ee76f3a9dceec6f19ef3"}},{"ruleId":"D1","level":"warning","message":{"text":"MetadataExtractor.metadata_to_bibtex (cyclomatic 16): MetadataExtractor.metadata_to_bibtex 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":"skills/citation-management/scripts/extract_metadata.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6d49b10e553cb2122d181e5f31045e325d5f97d781fc67e20e58fe16301c9b"}},{"ruleId":"D1","level":"warning","message":{"text":"extract_metadata.main (cyclomatic 16): extract_metadata.main 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":"skills/citation-management/scripts/extract_metadata.py"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b798427fcda40998ce133ef6c08aa2e5806d68564e18e7cb7966e0756db2f0"}},{"ruleId":"D1","level":"warning","message":{"text":"_common._check_tree (cyclomatic 16): _common._check_tree has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/_common.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9c57ec54b1e0384c25521bd68514f1bf1e46fbc660eaf5f46e7fcd43f19ab3"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.load_csv (cyclomatic 16): _common.load_csv has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/deepchem/scripts/_common.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"50aa880b928d8f076ee0968722996ceaedfa1eebabe7b8eead7a6f698885e542"}},{"ruleId":"D1","level":"warning","message":{"text":"exa_search.run (cyclomatic 16): exa_search.run has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exa-search/scripts/exa_search.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6265c23e888345ec9c9fc931f94610d68d94ebd508db38cfadad52d3da71f3"}},{"ruleId":"D1","level":"warning","message":{"text":"budget_summary.summarize_scalar_file (cyclomatic 16): budget_summary.summarize_scalar_file has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/budget_summary.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"de16cbdda2bb78d67ec6802cc6d6aa027f142ebee3d054c7b3fbbaece2ea4a4a"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.iter_text_lines (cyclomatic 16): _common.iter_text_lines has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d472411ab5aa1477ef6fc3cc21c432cd5215420b665cdcb277aa4fa262fe210"}},{"ruleId":"D1","level":"warning","message":{"text":"convert_coords.read_intervals (cyclomatic 16): convert_coords.read_intervals has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/convert_coords.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf2b45c4cb85eac213ba8a42e8d7629c22a23aa5e2c54fde62c4b498f2af171"}},{"ruleId":"D1","level":"warning","message":{"text":"detect_resources.detect_scheduler (cyclomatic 16): detect_resources.detect_scheduler 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":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a82ad6b517b7029054e80407d5183c53a3acd938f392bd70fcfd913be35757e"}},{"ruleId":"D1","level":"warning","message":{"text":"detect_resources.parse_apple_profiler_json (cyclomatic 16): detect_resources.parse_apple_profiler_json has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5735a477e45513583b1d95bc00222785fc9ec0362f2992598f2458e64e8382f"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.validate_run_config (cyclomatic 16): _common.validate_run_config 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":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed3f13dd994aa46b3b4feb366ed0a939254de003d7959223bda0771b51ea102"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.read_csv_records (cyclomatic 16): _common.read_csv_records has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4ffcd1f7541381e53619dd650f61847adf07c83972024ecaf9b7c247f678c3"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.read_csv_records (cyclomatic 16): _common.read_csv_records has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/market-research-reports/scripts/_common.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc78fccf1097ca5eadbccec1647b4a556b21219fd5310b89515e38c7fcd69f7"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_competitor_matrix.validate (cyclomatic 16): validate_competitor_matrix.validate has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/market-research-reports/scripts/validate_competitor_matrix.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c216f85cfea868a45b4bf01c6d80b9599f11f6c2f7800519386dfa0cc62a11d3"}},{"ruleId":"D1","level":"warning","message":{"text":"style_configurator.interactive_mode (cyclomatic 16): style_configurator.interactive_mode has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matplotlib/scripts/style_configurator.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c48033c36cb53167f43e76cf7d66d7d5813f02f785277d854ac1a359b14b30"}},{"ruleId":"D1","level":"warning","message":{"text":"preprocess_recording.preprocess_recording (cyclomatic 16): preprocess_recording.preprocess_recording 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":"skills/neuropixels-analysis/scripts/preprocess_recording.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a090111e80cfb1ec250e2987baffefd0bbb9c68328af6bab1c3eeb3a628c9790"}},{"ruleId":"D1","level":"warning","message":{"text":"image_qc._read_pnm (cyclomatic 16): image_qc._read_pnm 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":"skills/pathml/scripts/image_qc.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"696fabd616826b3f4a93fa3c4f96baddad03918d3764d7c480489efcf1f31d4e"}},{"ruleId":"D1","level":"warning","message":{"text":"_manifest._validate_requirements (cyclomatic 16): _manifest._validate_requirements 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":"skills/pptx-posters/scripts/_manifest.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1652cdd50ee25ce60f6df0ddfe6a129ec948431fad2ccd8159b03b251beccf0"}},{"ruleId":"D1","level":"warning","message":{"text":"_pptx._inspect_relationships (cyclomatic 16): _pptx._inspect_relationships has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_pptx.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa59b1edcb15fc275d4a35e6be6397f5d5f54e69a8eeee278188a7346c41a26"}},{"ruleId":"D1","level":"warning","message":{"text":"_pptx.patch_accessibility_metadata (cyclomatic 16): _pptx.patch_accessibility_metadata has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_pptx.py"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb8fa0f370af48439eda14df65d7c7f3655fa329a602f1104eadbe591d1de70"}},{"ruleId":"D1","level":"warning","message":{"text":"query_primekg.find_paths (cyclomatic 16): query_primekg.find_paths has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primekg/scripts/query_primekg.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c76c7d3b4b215fea373ab0ad27b680bf1a82dc39af2529b0ef4574a83f8d6cd"}},{"ruleId":"D1","level":"warning","message":{"text":"_specificity.read_expected (cyclomatic 16): _specificity.read_expected has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/_specificity.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"def3346f9f8bd8628dcf498e3db921b472b7b8518840e2086fca48b36edc59a3"}},{"ruleId":"D1","level":"warning","message":{"text":"io_conversion_plan.build_plan (cyclomatic 16): io_conversion_plan.build_plan 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":"skills/pymatgen/scripts/io_conversion_plan.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b82e29aea7aeb47539101be0bb679076c8d271b0b415ecb62f8e3f04d8632b3"}},{"ruleId":"D1","level":"warning","message":{"text":"process_identifications.main (cyclomatic 16): process_identifications.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/process_identifications.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58d82fb85f9f708d5c92e3e767059134cb4e7d5b9ad579096005fcf1166d5fd"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.canonicalize (cyclomatic 16): _common.canonicalize has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/_common.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39534d910a20d386d3f483d393df3ac1073dcde3be7b103111ffcb3a92de54e"}},{"ruleId":"D1","level":"warning","message":{"text":"_common.percent_of_baseline (cyclomatic 16): _common.percent_of_baseline has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/_common.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8334550896ad3e72213e3e80cb82a179b8c6714e47f3c5927205269a418eed7d"}},{"ruleId":"D1","level":"warning","message":{"text":"ResearchLookup._parallel_search (cyclomatic 16): ResearchLookup._parallel_search 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":"skills/research-lookup/scripts/research_lookup.py"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c842f159f2eee9683d2604ad403366528a2471a5b32dd3f7a8118273b2bc94f"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_claims.load_claims (cyclomatic 16): audit_claims.load_claims has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/audit_claims.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9d6ffe3b3dacff5c1d838ece044b5678a44f3874397ca3c860f1d449d93d71"}},{"ruleId":"D1","level":"warning","message":{"text":"evaluate_agent.evaluate_agent (cyclomatic 16): evaluate_agent.evaluate_agent 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":"skills/stable-baselines3/scripts/evaluate_agent.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6107825c162fbb42f35235e1bb84168e7e49637c380519c44dad3759659d3ca0"}},{"ruleId":"D1","level":"warning","message":{"text":"timeline_generator.build_schedule (cyclomatic 16): timeline_generator.build_schedule has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/treatment-plans/scripts/timeline_generator.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a770ea56a5d4f7f868e89bdf94d27fd48a6a4fa8123a2648d9694e272f3f962"}},{"ruleId":"D1","level":"warning","message":{"text":"check_plausibility.run (cyclomatic 16): check_plausibility.run has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/check_plausibility.py"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"325cac5da78d6375b2204071195d9718701a3c3690ef2a20e56bc06d278e87d4"}},{"ruleId":"D2","level":"warning","message":{"text":"check_popk_dataset.check_dataset (cognitive 204): check_popk_dataset.check_dataset has cognitive complexity 204 (threshold 15). Drivers by points: if/else 62 (113 pts), ternaries 16 (41 pts), boolean chains 39, loops 8 (11 pts) (nesting depth added 79). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/check_popk_dataset.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0726fc9a8cf1b16b5fb12ed80d043f95f299631be0714e34867574a7e6efa75d"}},{"ruleId":"D2","level":"warning","message":{"text":"_schema.validate_config (cognitive 171): _schema.validate_config has cognitive complexity 171 (threshold 15). Drivers by points: if/else 56 (95 pts), error handling 12 (27 pts), boolean chains 23, loops 12 (20 pts), ternaries 3 (6 pts) (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_schema.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c1186ceceae3b398d0e42d093d177a5545364fab765d72f8227da236af6652"}},{"ruleId":"D2","level":"warning","message":{"text":"arax_client.parse_trapi_response (cognitive 141): arax_client.parse_trapi_response has cognitive complexity 141 (threshold 15). Drivers by points: if/else 34 (93 pts), ternaries 6 (23 pts), loops 5 (14 pts), boolean chains 11 (nesting depth added 85). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbdb1eb8305c62279f64cf90f731ac13057172c664dfd6a282c249414ed865b"}},{"ruleId":"D2","level":"warning","message":{"text":"_manifest._validate_elements (cognitive 126): _manifest._validate_elements has cognitive complexity 126 (threshold 15). Drivers by points: if/else 45 (113 pts), boolean chains 9, loops 2, ternaries 1 (2 pts) (nesting depth added 69). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_manifest.py"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f819e5f87828bead25d8bff7e2e1844a588e12fe1fcdefcdb1077dadd594cc"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_register.validate_register (cognitive 117): validate_register.validate_register has cognitive complexity 117 (threshold 15). Drivers by points: if/else 40 (86 pts), loops 10 (17 pts), boolean chains 7, error handling 2 (7 pts) (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-brainstorming/scripts/validate_register.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"576c590b5f1e01ea28dffb7d6599da710fcd5432fbf398060adfc0267db42889"}},{"ruleId":"D2","level":"warning","message":{"text":"simulate_regimen.run (cognitive 116): simulate_regimen.run has cognitive complexity 116 (threshold 15). Drivers by points: if/else 36 (48 pts), boolean chains 32, ternaries 14 (27 pts), loops 4 (9 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/simulate_regimen.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acac47948b3ea9df45210e57f28b63739afd7401c67ff4a61a00c1da839d73c"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.validate_rubric (cognitive 103): _common.validate_rubric has cognitive complexity 103 (threshold 15). Drivers by points: if/else 37 (77 pts), loops 6 (14 pts), boolean chains 9, ternaries 2 (3 pts) (nesting depth added 49). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/_common.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b19c1b4e4fe4391c8ae38e4ee00269d68081a42351f048885de93fde36d49b"}},{"ruleId":"D2","level":"warning","message":{"text":"anonymize_dicom.transform_dataset (cognitive 99): anonymize_dicom.transform_dataset has cognitive complexity 99 (threshold 15). Drivers by points: if/else 29 (77 pts), boolean chains 11, loops 3 (7 pts), ternaries 1 (4 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/anonymize_dicom.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ec83bc435146f258734b6e77b8588023a7977bc5cc102d63972527f0978449"}},{"ruleId":"D2","level":"warning","message":{"text":"lineage_prevalence.main (cognitive 92): lineage_prevalence.main has cognitive complexity 92 (threshold 15). Drivers by points: if/else 25 (46 pts), ternaries 14 (26 pts), boolean chains 9, loops 6 (9 pts), error handling 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathogen-variant-surveillance/scripts/lineage_prevalence.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c95057bac4896cba94a275cdbc5f38317a116b866fc174560f8c215c7ce396"}},{"ruleId":"D2","level":"warning","message":{"text":"ddi_static.run (cognitive 90): ddi_static.run has cognitive complexity 90 (threshold 15). Drivers by points: if/else 33 (63 pts), ternaries 5 (13 pts), boolean chains 10, loops 3 (4 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/ddi_static.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fe720b06dd27f94797857e8995f2faf2439962631cb123c9e3f39490afc461"}},{"ruleId":"D2","level":"warning","message":{"text":"check_accuracy_precision.main (cognitive 89): check_accuracy_precision.main has cognitive complexity 89 (threshold 15). Drivers by points: if/else 30 (60 pts), loops 8 (14 pts), boolean chains 11, ternaries 2 (4 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/check_accuracy_precision.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"124b854a8ef1a31efa4c960f27be563d9a674e9d7e5244cbbc94dc62e5d6be1e"}},{"ruleId":"D2","level":"warning","message":{"text":"arax_client.render_text_summary (cognitive 83): arax_client.render_text_summary has cognitive complexity 83 (threshold 15). Drivers by points: if/else 12 (40 pts), ternaries 6 (21 pts), loops 7 (20 pts), boolean chains 2 (nesting depth added 56). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"4904a15807c39242cda5b573cfccfed1d4bdbf8e55a760b63a37539880a980ce"}},{"ruleId":"D2","level":"warning","message":{"text":"cohort_table_generator._build_table (cognitive 79): cohort_table_generator._build_table has cognitive complexity 79 (threshold 15). Drivers by points: if/else 34 (64 pts), loops 6 (7 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/cohort_table_generator.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34385adf3b915f0acb23a488fbcd1c1640eaf74c100c3f2a730717076466f39"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_samplesheet.validate_samplesheet (cognitive 77): validate_samplesheet.validate_samplesheet has cognitive complexity 77 (threshold 15). Drivers by points: if/else 23 (49 pts), loops 7 (12 pts), ternaries 3 (9 pts), boolean chains 6, error handling 1 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bulk-rnaseq/scripts/validate_samplesheet.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d237434da356a09d9d4b4419b49c89d2f51da614cf270293f74c7ad331788e6e"}},{"ruleId":"D2","level":"warning","message":{"text":"check_deidentification.validate_process (cognitive 75): check_deidentification.validate_process has cognitive complexity 75 (threshold 15). Drivers by points: if/else 27 (52 pts), error handling 5 (11 pts), loops 4 (8 pts), boolean chains 3, ternaries 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/check_deidentification.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9da9bb50ebe97cdcd34f1acfd193aad11df47c63e09189e1d9a9af2daff175"}},{"ruleId":"D2","level":"warning","message":{"text":"export_plan.validate_against_plan (cognitive 75): export_plan.validate_against_plan has cognitive complexity 75 (threshold 15). Drivers by points: ternaries 16 (38 pts), if/else 21 (24 pts), boolean chains 10, loops 1 (2 pts), error handling 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/export_plan.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f1f5b3b56eb5be2ee3b04b9689f31a26900c98fff7b62e04b706ba9bce097a"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus_auditor.audit (cognitive 74): corpus_auditor.audit has cognitive complexity 74 (threshold 15). Drivers by points: if/else 32 (55 pts), boolean chains 6, ternaries 4 (6 pts), loops 4 (5 pts), error handling 1 (2 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/corpus_auditor.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c320fb747b8451598f022ce63390ec68a1e88fba29e5d4047a2fc39ea6756fd"}},{"ruleId":"D2","level":"warning","message":{"text":"check_detection_limits.main (cognitive 72): check_detection_limits.main has cognitive complexity 72 (threshold 15). Drivers by points: if/else 33 (52 pts), ternaries 5 (10 pts), boolean chains 8, loops 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/check_detection_limits.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c38a48163b615cc6869fed035b19affd9e463c6baac48c20599bc31e6dd324"}},{"ruleId":"D2","level":"warning","message":{"text":"consistency_checker.validate_consistency (cognitive 71): consistency_checker.validate_consistency has cognitive complexity 71 (threshold 15). Drivers by points: if/else 18 (30 pts), error handling 12 (22 pts), boolean chains 10, loops 6 (7 pts), ternaries 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/consistency_checker.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5183410263d06b7cad52aa0d6a55c43f54fe386b9a6ea9fb57c7e6e9b9bd0df"}},{"ruleId":"D2","level":"warning","message":{"text":"bed_validator.validate (cognitive 70): bed_validator.validate has cognitive complexity 70 (threshold 15). Drivers by points: if/else 31 (52 pts), boolean chains 11, ternaries 4 (6 pts), loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/bed_validator.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e8379161d277097da42b721a3ebdbb39906ceb59d8e3418c86753c0e78e25a"}},{"ruleId":"D2","level":"warning","message":{"text":"check_contigs.compare (cognitive 70): check_contigs.compare has cognitive complexity 70 (threshold 15). Drivers by points: if/else 12 (43 pts), ternaries 2 (11 pts), loops 4 (10 pts), boolean chains 6 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/check_contigs.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"67472c0a3919f41b060d7591ba02bbfe767f46a6d7eff4063b971a9910a39d02"}},{"ruleId":"D2","level":"warning","message":{"text":"design_primers.validate_config (cognitive 70): design_primers.validate_config has cognitive complexity 70 (threshold 15). Drivers by points: if/else 22 (45 pts), loops 10 (19 pts), boolean chains 6 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/design_primers.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c5234ef2235a0e78d8e2dd0112381d5c7794d5f9a0f4435919f345497099aa"}},{"ruleId":"D2","level":"warning","message":{"text":"check_bioanalytical_run.check_run (cognitive 69): check_bioanalytical_run.check_run has cognitive complexity 69 (threshold 15). Drivers by points: if/else 23 (51 pts), loops 5 (9 pts), boolean chains 5, ternaries 1 (4 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/check_bioanalytical_run.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb17bb488b8a62d7a079cb7c1d929434176c024d47639c7c8c7d2cd7d6be9db"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect_signal.inspect_csv (cognitive 66): inspect_signal.inspect_csv has cognitive complexity 66 (threshold 15). Drivers by points: if/else 29 (44 pts), boolean chains 10, loops 4 (6 pts), error handling 3, ternaries 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/inspect_signal.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"346fc2fac13dbd397f1c99b5092cfa1ba65d919f8f30bc708ec3aa43487854b0"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_session.convert (cognitive 66): convert_session.convert has cognitive complexity 66 (threshold 15). Drivers by points: if/else 29 (39 pts), boolean chains 17, loops 10 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nwb-conversion/scripts/convert_session.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"93eea0a1770406fd257d5cbdd7aae59e68f67efd84f75b9ae205e301a9d03320"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence_profile_check.check_profile (cognitive 65): evidence_profile_check.check_profile has cognitive complexity 65 (threshold 15). Drivers by points: if/else 28 (53 pts), loops 7 (10 pts), boolean chains 1, error handling 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/evidence_profile_check.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca6199a8329645bef18b2b800fffed73c417c708dca3d681f0595f65be3c13a"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot_tools.validate_snapshot (cognitive 65): snapshot_tools.validate_snapshot has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (35 pts), loops 13 (15 pts), boolean chains 14, error handling 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/snapshot_tools.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab1ec01d7c300bd1e3f5b15708db11cc9f3e911a0802dc2ddd9e7e5c6cd177e"}},{"ruleId":"D2","level":"warning","message":{"text":"solve_carbonate.solve (cognitive 64): solve_carbonate.solve has cognitive complexity 64 (threshold 15). Drivers by points: if/else 22 (36 pts), boolean chains 11, loops 7 (9 pts), ternaries 5 (8 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/marine-carbonate-chemistry/scripts/solve_carbonate.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cce21f7ed428e1659efbc91e16d878f696cda24eec39314b52152308c8bbfa4"}},{"ruleId":"D2","level":"warning","message":{"text":"deidentification_audit.audit_dataset (cognitive 64): deidentification_audit.audit_dataset has cognitive complexity 64 (threshold 15). Drivers by points: if/else 16 (45 pts), boolean chains 12, loops 3 (7 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/deidentification_audit.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"35075bc03ae6c6ff39e525f2a97162366466c30c4c9a55265563d9a4804af5f7"}},{"ruleId":"D2","level":"warning","message":{"text":"consensus_plan.plan (cognitive 63): consensus_plan.plan has cognitive complexity 63 (threshold 15). Drivers by points: if/else 26 (39 pts), boolean chains 12, error handling 2 (5 pts), ternaries 4, loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/consensus_plan.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c40a68ef6e9f8b758732a587a2a2353c1bbd96d8bf5134ce89ca36063a8b11"}},{"ruleId":"D2","level":"warning","message":{"text":"check_completeness.check_completeness (cognitive 63): check_completeness.check_completeness has cognitive complexity 63 (threshold 15). Drivers by points: if/else 33 (48 pts), loops 13, boolean chains 1, ternaries 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/treatment-plans/scripts/check_completeness.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e00f0c150b375f5cbb94a24f1f189b9eb2f79b6d2f7ca783e2cbdf55290b42d"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_trial_report._validate_guidance (cognitive 62): validate_trial_report._validate_guidance has cognitive complexity 62 (threshold 15). Drivers by points: if/else 19 (34 pts), error handling 7 (18 pts), loops 2 (6 pts), boolean chains 4 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/validate_trial_report.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e049627330103809b52766277ddc6219801dc1c4d6638916da9fc07abe142db7"}},{"ruleId":"D2","level":"warning","message":{"text":"forecast_relsa.auto_arima (cognitive 61): forecast_relsa.auto_arima has cognitive complexity 61 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 7 (21 pts), boolean chains 8, ternaries 2 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/forecast_relsa.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75fdf9e8e4cbde8e9bcffcfdac898d227b1926209f350137aee0b6efb3a689f"}},{"ruleId":"D2","level":"warning","message":{"text":"check_consistency.validate_numeric_facts (cognitive 60): check_consistency.validate_numeric_facts has cognitive complexity 60 (threshold 15). Drivers by points: if/else 15 (39 pts), boolean chains 9, ternaries 3 (9 pts), loops 2 (3 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/check_consistency.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5fba0fd1c07a694c7e11463c7680b357d2fe3c1e900082821fceab87a93d57"}},{"ruleId":"D2","level":"warning","message":{"text":"_specificity.enumerate_products (cognitive 59): _specificity.enumerate_products has cognitive complexity 59 (threshold 15). Drivers by points: if/else 11 (32 pts), ternaries 4 (11 pts), loops 6 (10 pts), boolean chains 6 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/_specificity.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e8c8f7953d205923eaae65219cad5f597a0b5a1a6baafdd2d3448f21b5c3e6"}},{"ruleId":"D2","level":"warning","message":{"text":"spa_workflow.validate_star (cognitive 59): spa_workflow.validate_star has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (39 pts), boolean chains 10, ternaries 2 (6 pts), loops 3 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relion/scripts/spa_workflow.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cf98d72e910e2e1c1f77b996bd9954a1cf4367c43e0dc0cd95389aa6ef2e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_trial_report.validate_trial_manifest (cognitive 58): validate_trial_report.validate_trial_manifest has cognitive complexity 58 (threshold 15). Drivers by points: if/else 19 (29 pts), error handling 8 (17 pts), ternaries 4 (8 pts), boolean chains 2, loops 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/validate_trial_report.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c33694b9afcd05cf79b90c7642508bb22eeaa2f94a8fcd3a5514eca1e4a3197"}},{"ruleId":"D2","level":"warning","message":{"text":"resolve_lineage.main (cognitive 58): resolve_lineage.main has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 13 (25 pts), if/else 11 (18 pts), error handling 5 (11 pts), boolean chains 3, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathogen-variant-surveillance/scripts/resolve_lineage.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"601eb64e77dffb05a88d05ddecb2c61ba4fddcf01a0e12d514c4560b38399c4a"}},{"ruleId":"D2","level":"warning","message":{"text":"_pptx.analyze_layout (cognitive 58): _pptx.analyze_layout has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 5 (10 pts), boolean chains 5, error handling 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_pptx.py"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c169f4e3beedd26990f4059cea0f4ff0d50f4d4e38cdecbb51921869340da18c"}},{"ruleId":"D2","level":"warning","message":{"text":"model_biomarker_evaluation.evaluate (cognitive 57): model_biomarker_evaluation.evaluate has cognitive complexity 57 (threshold 15). Drivers by points: if/else 28 (40 pts), loops 6 (8 pts), boolean chains 5, ternaries 1 (3 pts), error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/model_biomarker_evaluation.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09c6093c8e463e1ebd12f31629606477924b29749af79202fbc08f1b856873f"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare_batch_csv.validate_csv (cognitive 57): prepare_batch_csv.validate_csv has cognitive complexity 57 (threshold 15). Drivers by points: if/else 23 (44 pts), boolean chains 6, loops 3 (5 pts), error handling 1, ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/diffdock/scripts/prepare_batch_csv.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1961536978641c21716290fdeecf1eb3fd6e3ab58a41af1d4a3e9ee2d1b87575"}},{"ruleId":"D2","level":"warning","message":{"text":"embedding_plan.plan (cognitive 57): embedding_plan.plan has cognitive complexity 57 (threshold 15). Drivers by points: if/else 25 (41 pts), boolean chains 9, ternaries 5, loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/embedding_plan.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba96a2226be45c89e345246396e51c6e4b0e72d009e8bbc19fad901bb7b0d02"}},{"ruleId":"D2","level":"warning","message":{"text":"spatial_join_audit.audit (cognitive 57): spatial_join_audit.audit has cognitive complexity 57 (threshold 15). Drivers by points: if/else 26 (43 pts), boolean chains 11, error handling 1, loops 1, ternaries 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/spatial_join_audit.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d4888c2030c219855076671fad706a1fe2f6100149c24ea30ab39117f0496c"}},{"ruleId":"D2","level":"warning","message":{"text":"lint_causal_claims.lint (cognitive 57): lint_causal_claims.lint has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (41 pts), loops 4 (9 pts), boolean chains 6, ternaries 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/lint_causal_claims.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad794ed76157945ff54dbf1e79a0d23c74b75ee46651d739d2e2ea7e32e40f4"}},{"ruleId":"D2","level":"warning","message":{"text":"arax_client.validate_saved_request_contract (cognitive 57): arax_client.validate_saved_request_contract has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (31 pts), boolean chains 16, ternaries 7 (8 pts), loops 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9cd5f66408a101678a0f333e0814cb62cd6087c5db7d08829d42a256e00042"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_spatial_schema.validate_multiplex (cognitive 57): validate_spatial_schema.validate_multiplex has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (43 pts), boolean chains 6, error handling 3 (5 pts), loops 2 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathml/scripts/validate_spatial_schema.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"913fca0291ddac97c1f194888a7f8cce6d99bc8d9d557564c2fea56715a2e2d5"}},{"ruleId":"D2","level":"warning","message":{"text":"detect_resources.detect_cgroup_v2 (cognitive 56): detect_resources.detect_cgroup_v2 has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (31 pts), ternaries 10 (12 pts), boolean chains 9, loops 3 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f860a3a148e37f039fede4c4813dd0019856496741593bcc6f6e7688dee2a97"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.inspect_bed (cognitive 56): _common.inspect_bed has cognitive complexity 56 (threshold 15). Drivers by points: if/else 22 (41 pts), boolean chains 7, ternaries 4 (7 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":"skills/gtars/scripts/_common.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"60829fe903951b31a8ce2ba39de5021e71849222713472cc6dd7eeb01bac24e2"}},{"ruleId":"D2","level":"warning","message":{"text":"mutation_profile.main (cognitive 56): mutation_profile.main has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 10 (23 pts), if/else 13 (20 pts), boolean chains 10, loops 1 (2 pts), error handling 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathogen-variant-surveillance/scripts/mutation_profile.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"281c7de322c3a6ff8d7a45b064b1145212cebc877e14053a0c158830e0d8d8a9"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.validate_evaluation (cognitive 56): _common.validate_evaluation has cognitive complexity 56 (threshold 15). Drivers by points: if/else 22 (47 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/_common.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"11820352534561949b61eb22a2905e3906218dca11f321eeaf209c75057ba40f"}},{"ruleId":"D2","level":"warning","message":{"text":"power._resolve (cognitive 56): power._resolve has cognitive complexity 56 (threshold 15). Drivers by points: if/else 27 (43 pts), boolean chains 9, ternaries 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/statistical-power/scripts/power.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe6d70f0e77e1014bbe706cc13bc67b81eba7fae2429faf10701f49ed11d70b"}},{"ruleId":"D2","level":"warning","message":{"text":"InfographicGenerator.generate_iterative (cognitive 55): InfographicGenerator.generate_iterative has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (35 pts), boolean chains 10, ternaries 5 (7 pts), loops 3 (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":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"5248c9257db8a5f5ae9e076e9de372ff1b86614060b24a4fac5294aab77f26b7"}},{"ruleId":"D2","level":"warning","message":{"text":"check_consistency.check_consistency (cognitive 55): check_consistency.check_consistency has cognitive complexity 55 (threshold 15). Drivers by points: if/else 20 (36 pts), loops 6 (8 pts), boolean chains 7, ternaries 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/treatment-plans/scripts/check_consistency.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bd992e4f60df87d8416a16e2bfa5631f1cc6a60fd0709d50c2c443e76e1eb1"}},{"ruleId":"D2","level":"warning","message":{"text":"check_falsification_controls.audit (cognitive 54): check_falsification_controls.audit has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (43 pts), loops 4 (8 pts), ternaries 2, boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/check_falsification_controls.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3f9c5d640b69abc4918efa1a2ff92cdf5271bd84b93278a78cbb7f7697fb68"}},{"ruleId":"D2","level":"warning","message":{"text":"budget_summary.summarize_spectral_file (cognitive 53): budget_summary.summarize_spectral_file has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (34 pts), boolean chains 6, ternaries 2 (6 pts), error handling 3 (4 pts), loops 2 (3 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/budget_summary.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0ffe84911bdc3ff1b83369903c4f46c23632109243faecd0ff04e5dad32556"}},{"ruleId":"D2","level":"warning","message":{"text":"alignment_qc.inspect_alignments (cognitive 53): alignment_qc.inspect_alignments has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (42 pts), ternaries 5, boolean chains 4, error handling 1, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pysam/scripts/alignment_qc.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35a7d95c1cca11294ee8d01212924b6f3af4aacff02a263a3f70f58c6727ec4"}},{"ruleId":"D2","level":"warning","message":{"text":"relsa_score.main (cognitive 53): relsa_score.main has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (29 pts), ternaries 9 (12 pts), boolean chains 9, loops 2 (3 pts) (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":"skills/relsa-severity-assessment/scripts/relsa_score.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e68181e198c56e6652b4f0ef9fe72831e3a8fd0479c97ad7f00dbdfa52297d"}},{"ruleId":"D2","level":"warning","message":{"text":"provenance_validator.validate_provenance (cognitive 52): provenance_validator.validate_provenance has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (31 pts), error handling 7 (11 pts), loops 4 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/provenance_validator.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b916c5edb45ffe4c77081be0499b909314bf64859ce239f870628f032a707459"}},{"ruleId":"D2","level":"warning","message":{"text":"_structured.inspect_hdf5 (cognitive 52): _structured.inspect_hdf5 has cognitive complexity 52 (threshold 15). Drivers by points: if/else 11 (30 pts), ternaries 4 (15 pts), error handling 3, loops 2 (3 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_structured.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86c8acdfe6263a646483e259f369b83b3a1676b47cc34ae3a1cc3f04222b13d"}},{"ruleId":"D2","level":"warning","message":{"text":"atlas_query.cmd_avi (cognitive 51): atlas_query.cmd_avi has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 5 (11 pts), boolean chains 7, error handling 1 (3 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":"skills/alphagenome/scripts/atlas_query.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a605366ead936893a44aaec6131c852fa72352a732e64419ef448785ba2cb2aa"}},{"ruleId":"D2","level":"warning","message":{"text":"detect_resources._detect_memory (cognitive 51): detect_resources._detect_memory has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (19 pts), ternaries 8 (14 pts), boolean chains 10, error handling 3 (6 pts), loops 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":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbac827f3383cb2cad40b47e4b6b216f58f4deac98925235b9061ab345055a7b"}},{"ruleId":"D2","level":"warning","message":{"text":"allometry_and_fih.run (cognitive 51): allometry_and_fih.run has cognitive complexity 51 (threshold 15). Drivers by points: if/else 21 (40 pts), loops 3 (5 pts), boolean chains 4, 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":"skills/pkpd-modeling/scripts/allometry_and_fih.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"998f5bb19374f8e3b586976750e56d30f3d8efdf5873ede6afd7d1ddecd685e3"}},{"ruleId":"D2","level":"warning","message":{"text":"scan_skills.scan_with_progress (cognitive 50): scan_skills.scan_with_progress has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (21 pts), ternaries 4 (14 pts), boolean chains 6, loops 4 (5 pts), error handling 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan_skills.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e562a7b58080570bd2b1f826fe808a9c044e12958209dc8d6fd0d5ca4d80d1"}},{"ruleId":"D2","level":"warning","message":{"text":"survival_plan_validator.validate_plan (cognitive 50): survival_plan_validator.validate_plan has cognitive complexity 50 (threshold 15). Drivers by points: if/else 28 (33 pts), loops 13, boolean chains 3, error handling 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/survival_plan_validator.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9337490333e417b38bc8efe0f59528cc4da998589b61034af311a303f8c1d0cc"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_spatial_schema.validate_graph (cognitive 50): validate_spatial_schema.validate_graph has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (38 pts), boolean chains 5, loops 3 (5 pts), ternaries 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathml/scripts/validate_spatial_schema.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8938b82fe4a5972f7651d90e0820e63c783cc0f535efcc2be1bb662cc260445"}},{"ruleId":"D2","level":"warning","message":{"text":"dicom_to_image.render_frame (cognitive 50): dicom_to_image.render_frame has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (31 pts), boolean chains 8, error handling 4 (6 pts), ternaries 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/dicom_to_image.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcf38b7e9113283a8166f964bce70d925168e69959e43ed769a7910e0462152"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.plan_transfers (cognitive 50): _common.plan_transfers has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (39 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pylabrobot/scripts/_common.py"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddd895eeadb40e0d48ec621999da408c135d689488038fc0d1eca7a489b9cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_intervals.audit_bed (cognitive 49): audit_intervals.audit_bed has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (33 pts), error handling 3 (8 pts), boolean chains 7, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/audit_intervals.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1576a9b5001b8bdb8db03abb48bc4c8322b7c62baaace7d7faa33c2d5c1bc9"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_multimodal._stream_profile (cognitive 49): validate_multimodal._stream_profile has cognitive complexity 49 (threshold 15). Drivers by points: if/else 23 (35 pts), boolean chains 9, ternaries 4, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/validate_multimodal.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a6b200fad884c1e88883769b1a38be5198c788ba6d6b1b2cc1bff5a9c39557"}},{"ruleId":"D2","level":"warning","message":{"text":"decision_logic_traceability.validate_matrix (cognitive 48): decision_logic_traceability.validate_matrix has cognitive complexity 48 (threshold 15). Drivers by points: if/else 24 (39 pts), loops 4 (5 pts), boolean chains 3, error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/decision_logic_traceability.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"521bd8cf83fceaaa1d77e3c228b8c3c55d4f85721993da8393760f92f077c59e"}},{"ruleId":"D2","level":"warning","message":{"text":"deidentification_checklist.check_documentation (cognitive 48): deidentification_checklist.check_documentation has cognitive complexity 48 (threshold 15). Drivers by points: if/else 30 (40 pts), loops 6 (7 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/deidentification_checklist.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6359e5049d83dabedcc23288de73c75e02c4c84b4dbd8e050a639e86feb237b7"}},{"ruleId":"D2","level":"warning","message":{"text":"refget_digest_plan.validate (cognitive 48): refget_digest_plan.validate has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (35 pts), boolean chains 7, loops 3 (5 pts), ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gtars/scripts/refget_digest_plan.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5283c1b79a4d9bd371cbebd497df2473167d135e7c1bd90a69c4b018e118e42c"}},{"ruleId":"D2","level":"warning","message":{"text":"ecg_hrv_pipeline.main (cognitive 48): ecg_hrv_pipeline.main has cognitive complexity 48 (threshold 15). Drivers by points: if/else 25 (33 pts), error handling 5 (12 pts), boolean chains 2, ternaries 1 (nesting depth added 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/ecg_hrv_pipeline.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2a8f062700ea2413881f2e296b3495c651a2a45136942613df71497e65b068"}},{"ruleId":"D2","level":"warning","message":{"text":"_common._normalise_region (cognitive 47): _common._normalise_region has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (26 pts), error handling 4 (11 pts), boolean chains 6, loops 2 (4 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":"skills/lab-hardware-cad/scripts/_common.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea48a2fb308c56c0f086bbd5ddaf89890321ae0f2ca90d9c25996fde6050632e"}},{"ruleId":"D2","level":"warning","message":{"text":"nca.analyse (cognitive 47): nca.analyse has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (26 pts), ternaries 7 (14 pts), boolean chains 6, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/nca.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"7937be5bc577502b33b3f7790f5cfb53dcc8822d2aeea4622e393d6d720f2431"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.validate_manifest (cognitive 47): _common.validate_manifest has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 4 (8 pts), boolean chains 6 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pylabrobot/scripts/_common.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"588362436fb59842bccda4451b0189c2085751a7a3c1c60d2123cf0b8a9e72ce"}},{"ruleId":"D2","level":"warning","message":{"text":"SlideImageGenerator.generate_slide (cognitive 47): SlideImageGenerator.generate_slide has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 9, ternaries 6 (8 pts), loops 3 (4 pts), error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/generate_slide_image_ai.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cca9bf7c694088e7e011edd63855cdc5a3413550b9d6b5095d93f501e648ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.parse_expression (cognitive 47): _common.parse_expression has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (41 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/_common.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2b9874ba90c401ea4688e99b309b1c52b6299d38dbe39a4b20aff7629bd999"}},{"ruleId":"D2","level":"warning","message":{"text":"CitationValidator.validate_file (cognitive 46): CitationValidator.validate_file has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 6 (11 pts), boolean chains 7 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/validate_citations.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"b326ba5d59707d3929ec4e99764d11b30fc20efa896c5ce4f02c594197166a0c"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.evaluate_model (cognitive 46): _common.evaluate_model has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 8 (23 pts), if/else 11 (18 pts), boolean chains 3, loops 2 (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":"skills/deepchem/scripts/_common.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"07deb1f08a52eb7f6e322841cfd1c6fc4884d2fabb373bb43ca1b2a1aac2a40e"}},{"ruleId":"D2","level":"warning","message":{"text":"model_artifact_inspector.inspect (cognitive 46): model_artifact_inspector.inspect has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (39 pts), boolean chains 4, loops 2, ternaries 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/model_artifact_inspector.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"88eca775545107e216a035c494c86cc04219a622f4ebbfe6353ec49547eb2ae5"}},{"ruleId":"D2","level":"warning","message":{"text":"check_consistency.validate_methods_results (cognitive 46): check_consistency.validate_methods_results has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (35 pts), boolean chains 6, loops 4 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/check_consistency.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ebbd03f69f4592a06e0fccd304498a87097cce294e0710879e1126435c8a30"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_case_report.validate_case_manifest (cognitive 45): validate_case_report.validate_case_manifest has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (24 pts), error handling 10 (15 pts), loops 3, boolean chains 2, ternaries 1 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/validate_case_report.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02d30cf20f619cc09f6acfe77763186b41ad34ede4289eb9c4dc5faee2057e7"}},{"ruleId":"D2","level":"warning","message":{"text":"execution_plan.build_plan (cognitive 45): execution_plan.build_plan has cognitive complexity 45 (threshold 15). Drivers by points: if/else 22 (38 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gtars/scripts/execution_plan.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"962b37f858cd5299b5f3f5ebf532219c15db3d391d5a0a1f76f6c9f03ddd2d9b"}},{"ruleId":"D2","level":"warning","message":{"text":"manuscript_packet.deduplicate_sources (cognitive 45): manuscript_packet.deduplicate_sources has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 15, ternaries 4 (8 pts), loops 3 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/research-lookup/scripts/manuscript_packet.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"125108dce8519238daa67108820ee01b05bb0135d1f20864682752ce0574658e"}},{"ruleId":"D2","level":"warning","message":{"text":"_common._validate_schema (cognitive 45): _common._validate_schema has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 4 (8 pts), boolean chains 6 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/treatment-plans/scripts/_common.py"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"82db611cfd40bd52f46963250f6e47c80dca2355ec9d2ed823b6a48cc4e67079"}},{"ruleId":"D2","level":"warning","message":{"text":"scan_skills.generate_report (cognitive 44): scan_skills.generate_report has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 4 (11 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan_skills.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfdf4dd433df2ffec5327607565d728e7947c8f76edcd66d881c25039eb499f"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_project_manifest.validate (cognitive 44): validate_project_manifest.validate has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (30 pts), loops 6 (8 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matlab/scripts/validate_project_manifest.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec98c4c85abde8ed01ab82a5b2a6e83e26503fea1abc3073ebc91e8d78d67a6"}},{"ruleId":"D2","level":"warning","message":{"text":"image_metadata.screen_metadata (cognitive 44): image_metadata.screen_metadata has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (21 pts), ternaries 6 (14 pts), boolean chains 8, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/image_metadata.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"263598355c8af679a08436db65fe6ed925e0bb26a2bac1efd2d8d9771318bcde"}},{"ruleId":"D2","level":"warning","message":{"text":"sensitive_coordinates_checklist.checklist (cognitive 43): sensitive_coordinates_checklist.checklist has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 11, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/sensitive_coordinates_checklist.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"22598b9afcee856385bcb80665143ea581ed0da3fe954a6b8119e6588f233fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"_pptx._preflight_members (cognitive 43): _pptx._preflight_members has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (37 pts), boolean chains 5, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_pptx.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"87909330c8c70e9b6667ee11a4bd82cee4f04b69037d6cc46c1b4535ec9a36f9"}},{"ruleId":"D2","level":"warning","message":{"text":"_pptx.patch_accessibility_metadata (cognitive 43): _pptx.patch_accessibility_metadata has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 5 (14 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_pptx.py"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b010f61373e8e74f25232851115e6cb4660386574219bc8c23ce2b841ca4a9"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate_matrix.load_scores (cognitive 43): evaluate_matrix.load_scores has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (33 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-brainstorming/scripts/evaluate_matrix.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8b7418d9598237c999d0f7bc7021010416e4f77164905d24016af967990ed6"}},{"ruleId":"D2","level":"warning","message":{"text":"atlas_query.tidy_atlas_scores (cognitive 42): atlas_query.tidy_atlas_scores has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 4 (14 pts), loops 5 (13 pts), if/else 5 (12 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/alphagenome/scripts/atlas_query.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4faad75d73a08491ad4d9a2cd6d30e7244230321d7c23847427c57c4fa3f58"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.parse_bibtex (cognitive 42): _common.parse_bibtex has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 5 (9 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/_common.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf356dae77616a6ef9de6eab7cbc20a8d6dab42e2d24ccd2824635445ba09d74"}},{"ruleId":"D2","level":"warning","message":{"text":"check_contigs.identify (cognitive 42): check_contigs.identify has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 4, ternaries 2 (4 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/check_contigs.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff41894f79e40d73f3842c05217895c4a3ea2907c19815ad69574ad7634ba43f"}},{"ruleId":"D2","level":"warning","message":{"text":"lint_review.lint (cognitive 42): lint_review.lint has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 5 (8 pts), boolean chains 4, ternaries 3 (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":"skills/peer-review/scripts/lint_review.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"451a40212b2de4b6706c5b05d4c943f9a8cf61d07a08e6c556e1da7bba50f046"}},{"ruleId":"D2","level":"warning","message":{"text":"fit_compartmental.run (cognitive 42): fit_compartmental.run has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 8, ternaries 3 (8 pts), loops 4 (7 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/fit_compartmental.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae1dd89c4fd637b92cdff66e64b206ff49a447802e26763b6673fe3316240a8"}},{"ruleId":"D2","level":"warning","message":{"text":"substructure_filter.filter_molecules (cognitive 42): substructure_filter.filter_molecules has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 5 (10 pts), boolean chains 2, 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":"skills/rdkit/scripts/substructure_filter.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b98925b1f53bf2cd0d7762672594867f052e74b1dbadd60d03723396d09a1b"}},{"ruleId":"D2","level":"warning","message":{"text":"substructure_filter.main (cognitive 42): substructure_filter.main has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (28 pts), loops 5 (11 pts), ternaries 2, boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/rdkit/scripts/substructure_filter.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1394a840ba1fdd3ac6f48b1af05d29fccc00d86008a50cda3131c3a3596d36"}},{"ruleId":"D2","level":"warning","message":{"text":"check_traceability.validate_manifest (cognitive 42): check_traceability.validate_manifest has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/check_traceability.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af7293a0c658eefad1003f12be3ffa53afc78c463a0097d762ca817acdaeb4f"}},{"ruleId":"D2","level":"warning","message":{"text":"rna_velocity_workflow.run_velocity_analysis (cognitive 42): rna_velocity_workflow.run_velocity_analysis has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 9, loops 5, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scvelo/scripts/rna_velocity_workflow.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d565a3d9bf13127a73d530ff4ad6c9b7d7c41d52ed34becfca942ba4701266c2"}},{"ruleId":"D2","level":"warning","message":{"text":"CitationValidator.validate_entry (cognitive 41): CitationValidator.validate_entry has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/validate_citations.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"defddf4899513c3f26d33f850cc894fb9fa5dbbbdf3f5177faf18ae392cc0b08"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_intervals.audit_vcf (cognitive 41): audit_intervals.audit_vcf has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 9, loops 2 (3 pts), ternaries 1 (3 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":"skills/genomic-coordinates/scripts/audit_intervals.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddd6edff7096c0f52f1437e99fd948fc042310df73bb3093d58f1494102844c"}},{"ruleId":"D2","level":"warning","message":{"text":"plan_pipeline.make_plan (cognitive 41): plan_pipeline.make_plan has cognitive complexity 41 (threshold 15). Drivers by points: if/else 29 (30 pts), boolean chains 9, ternaries 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathml/scripts/plan_pipeline.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0112909802edd9880b8f54e11401f2cd79942eec57a688a114f77df41a780c1"}},{"ruleId":"D2","level":"warning","message":{"text":"nca.load_profiles (cognitive 41): nca.load_profiles has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 11, loops 3 (4 pts), ternaries 1 (2 pts) (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":"skills/pkpd-modeling/scripts/nca.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0d94f22d11c9fd8011bdf5cba549b9707127b081efdcd9e96bda9bc303a5f5"}},{"ruleId":"D2","level":"warning","message":{"text":"scan_pr_skills.format_comment (cognitive 40): scan_pr_skills.format_comment has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (11 pts), ternaries 2 (7 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan_pr_skills.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5b757c81aebb421a9126dd41887acfb86ee9c5bdc48450cffba0cc5059aeb2"}},{"ruleId":"D2","level":"warning","message":{"text":"Network.__init__ (cognitive 40): Network.__init__ has cognitive complexity 40 (threshold 15). Drivers by points: loops 12 (17 pts), boolean chains 16, if/else 4 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/13c-metabolic-flux/scripts/_mfa_model.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc280efe4e808f2306a5f15869a75f724e9e5152968f3461ec65904fe11af7e7"}},{"ruleId":"D2","level":"warning","message":{"text":"sequence_inspector.inspect_sequence_file (cognitive 40): sequence_inspector.inspect_sequence_file has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 11 (18 pts), if/else 7 (15 pts), boolean chains 3, error handling 3, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/sequence_inspector.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f6683a905ded42012d16e15292f899d1f3f78cb7304bd119ba22696697dae3"}},{"ruleId":"D2","level":"warning","message":{"text":"restart_compatibility.compare (cognitive 40): restart_compatibility.compare has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 6, loops 4, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/restart_compatibility.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d1544a8a1ab14466e41447de952595d770d11bb13c82c0e2eece2f8f644a1f"}},{"ruleId":"D2","level":"warning","message":{"text":"plan_workload.build_plan (cognitive 40): plan_workload.build_plan has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (27 pts), boolean chains 8, ternaries 4, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/plan_workload.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1ebac64f091fa6ed56f155203d4fa1bb3a1df16e4fd5bde1a10d4fa718ef03"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_claim_citations.audit (cognitive 40): audit_claim_citations.audit has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 7, error handling 2 (3 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/market-research-reports/scripts/audit_claim_citations.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"16778cd4742412b5895709705713b349090680d73e91b3955def57f4420e92ab"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_protocol_json._validate_steps (cognitive 40): validate_protocol_json._validate_steps has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (2 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":"skills/protocolsio-integration/scripts/validate_protocol_json.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d28539009aa8e24b57da74262c85497a2ba3d980acefd133a97d30e7768c7cb"}},{"ruleId":"D2","level":"warning","message":{"text":"model_diagnostics.check_diagnostics (cognitive 40): model_diagnostics.check_diagnostics has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (29 pts), boolean chains 10, ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymc/scripts/model_diagnostics.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2950625c02691a318b18e7621e617f86e52dd1af92a493b2069be2bc6e3e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"qobj_model_validator.validate_model (cognitive 40): qobj_model_validator.validate_model has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 7, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qutip/scripts/qobj_model_validator.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"750a7a066b558b56a57aed6774d182b860e48f8fdc66a66b8b6a6a00f943a8ee"}},{"ruleId":"D2","level":"warning","message":{"text":"weight_sensitivity.analyze (cognitive 40): weight_sensitivity.analyze has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 4 (7 pts), ternaries 3 (7 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/weight_sensitivity.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"17272535cda1232cdfc3a30f0a74d25ba60a5c6f57a8a7babdf60f98c7928e72"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.iter_local_files (cognitive 39): _common.iter_local_files has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (27 pts), error handling 2 (7 pts), loops 2 (5 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e6dd9aa019fc45fbc425aac2ba8a167bb131f4d1d459ce24ffb36b659dcf89"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.normalise_checks (cognitive 39): _common.normalise_checks has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 6, ternaries 2 (6 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/lab-hardware-cad/scripts/_common.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"b089b01671d5a15e41fa1d8b7e609191e2537026b6b73bcb27642af9fbb89ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"plan_batch_command.matlab_literal (cognitive 39): plan_batch_command.matlab_literal has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matlab/scripts/plan_batch_command.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00d5baaa1037881245207edd2d297b7914356cb2af736d8dde7f1417949bd1c"}},{"ruleId":"D2","level":"warning","message":{"text":"forecast_relsa.main (cognitive 39): forecast_relsa.main has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 6 (10 pts), ternaries 2 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/forecast_relsa.py"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"df52b1ad561f4a96288a9636d33829181320009e8eabb7bb6d26af74cc74fdde"}},{"ruleId":"D2","level":"warning","message":{"text":"check_response.main (cognitive 38): check_response.main has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 6, ternaries 3 (5 pts), loops 4 (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":"skills/analytical-method-validation/scripts/check_response.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efcab6cc3f037a4228fc05f9c8c7a9eedd669a8cc3babe908cbd2b16ada321d"}},{"ruleId":"D2","level":"warning","message":{"text":"export_plan.plan (cognitive 38): export_plan.plan has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 12, ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/export_plan.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"95993aed2c4fd095047cf0bfb801ced120c7c358c92a0c239aa750e9cbc8d6fa"}},{"ruleId":"D2","level":"warning","message":{"text":"detect_resources._amd_entries (cognitive 38): detect_resources._amd_entries has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (7 pts), boolean chains 5, ternaries 1 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8f491317e9bd84cc5179ba2c21e9df355e5699831d2147766b1d7baf70eba2"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_hypothesis_schema.validate_record (cognitive 38): validate_hypothesis_schema.validate_record has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (22 pts), loops 10, boolean chains 4, ternaries 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/validate_hypothesis_schema.py"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"736c23cdb005bce603de09091d47a90d4f8aff54f036ff1bb2d6d7cd62b22392"}},{"ruleId":"D2","level":"warning","message":{"text":"check_capa.validate (cognitive 38): check_capa.validate has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/check_capa.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7d5b536d47a6ec594e597e173db1be1615be7b4f649bde9e3e25b9fa464ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"scan_m_code.collect (cognitive 38): scan_m_code.collect has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matlab/scripts/scan_m_code.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9a9652e41fe718cece84af9f3be0244cc2793d81a09c3bed3f2c28f30b05cc"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_statistics_reproducibility.audit (cognitive 38): audit_statistics_reproducibility.audit has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (32 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/peer-review/scripts/audit_statistics_reproducibility.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35cef35e98b7163140fde5ce5174268ec0139e2fb12e798424c01b5ec8eb27d"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_plan._validate_vectorization (cognitive 38): validate_plan._validate_vectorization has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 8, ternaries 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pufferlib/scripts/validate_plan.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ddd333740d75b3e5257aba8835d72ea90fd49f13910d55853f6aef5cc5e6db"}},{"ruleId":"D2","level":"warning","message":{"text":"amplicon_workflow.validate (cognitive 38): amplicon_workflow.validate has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 9, loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qiime2-amplicon/scripts/amplicon_workflow.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca9e082e733db2234484ea271a46ecb91cdfb1a6a3f65c6d92b3ef297db1b4a"}},{"ruleId":"D2","level":"warning","message":{"text":"figure_export.export_figure (cognitive 38): figure_export.export_figure has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 8, ternaries 3 (6 pts), loops 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/figure_export.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8038a1948c7b5682f580a29cb09227b2341e3872dd877cae343199a858c4e487"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_image.preflight (cognitive 37): generate_image.preflight has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 7, ternaries 3 (7 pts), error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/generate-image/scripts/generate_image.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee547cbe8f6e0f978b731ec0ac2eb3799b09ecd3b830b3ba6ccd28b35c81b88"}},{"ruleId":"D2","level":"warning","message":{"text":"notebook_operations.inspect_container (cognitive 37): notebook_operations.inspect_container has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (28 pts), ternaries 2 (7 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/labarchive-integration/scripts/notebook_operations.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d16f35fc7745076db7a035b3bd06217c7c299a769d5e62d62ff860c5b203b4"}},{"ruleId":"D2","level":"warning","message":{"text":"solve_carbonate.read_samples (cognitive 37): solve_carbonate.read_samples has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 7, loops 3 (4 pts), error handling 1 (3 pts) (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":"skills/marine-carbonate-chemistry/scripts/solve_carbonate.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d3cba3b7ccfd30d2df94cad8d32682475703423db0d93b84007f1ee4d537f0"}},{"ruleId":"D2","level":"warning","message":{"text":"_pptx._inspect_relationships (cognitive 37): _pptx._inspect_relationships has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (24 pts), error handling 2 (5 pts), ternaries 1 (4 pts), loops 2 (3 pts), boolean chains 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":"skills/pptx-posters/scripts/_pptx.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f6e3ef421ac5060bdc1860654c0b31c2a5b54b2b29603637759624215f1ac3"}},{"ruleId":"D2","level":"warning","message":{"text":"_specificity.blast_hits (cognitive 37): _specificity.blast_hits has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 4, ternaries 2 (4 pts), boolean chains 3 (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":"skills/primer-design/scripts/_specificity.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"09bc9436440dbd6ebecbccc742d46825db6339d2e409f154a6d094dc616a915f"}},{"ruleId":"D2","level":"warning","message":{"text":"check_references.check_sources (cognitive 37): check_references.check_sources has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/check_references.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ead78042ed762804dfc969d5d1e7ea964077b1d3c2416559d17ec84e3ce3bf8"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_scope_intake.validate (cognitive 36): validate_scope_intake.validate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 5 (12 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/validate_scope_intake.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9e068e7619025ed7c0cbfabe84330bf4847b54b4f156e306a19c8ebf4e4e47"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_review_intake.validate_intake (cognitive 36): validate_review_intake.validate_intake has cognitive complexity 36 (threshold 15). Drivers by points: if/else 24 (28 pts), boolean chains 7, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/peer-review/scripts/validate_review_intake.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"609b18b9ce0c91262c10393c0b55b54a33540784cf5ee67e5ad68c590778a9fd"}},{"ruleId":"D2","level":"warning","message":{"text":"uid_mapping_validator.validate_mapping (cognitive 36): uid_mapping_validator.validate_mapping has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 7, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/uid_mapping_validator.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65014d183f72dc67f0fd127c701812531bbdcd359bb51800aaf16288beb1915"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.parse_rows (cognitive 35): _common.parse_rows has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 4 (8 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (2 pts) (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":"skills/analytical-method-validation/scripts/_common.py"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f60ae00ed39b24d1f2d772333732ebf9e7d794e44972e90346b93e1612e2f9"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_cds_artifact.validate_artifact (cognitive 35): validate_cds_artifact.validate_artifact has cognitive complexity 35 (threshold 15). Drivers by points: if/else 26, loops 7, boolean chains 1, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/validate_cds_artifact.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4a4c0fab9ad5bdad3d7665134eaba7c757d211b5d150f92a16caa52772c216"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_intervals.audit_gff (cognitive 35): audit_intervals.audit_gff has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 7, error handling 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/audit_intervals.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94350c3793232df133375c0a762453a6ec7282b3f32736dfeb83ba2de9d2b65"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.inspect_geoparquet (cognitive 35): _common.inspect_geoparquet has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, error handling 3 (4 pts), loops 3 (4 pts), ternaries 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/_common.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cbd01a0f92f3912336478fd39d457ff2e0700695c7796475810784388d4c76"}},{"ruleId":"D2","level":"warning","message":{"text":"detect_resources._amd_memory_bytes (cognitive 35): detect_resources._amd_memory_bytes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 7, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe252cae0a5f5dd1450915c3374c6b14436ca71b8a87ebe8b093f31a4bd0a57"}},{"ruleId":"D2","level":"warning","message":{"text":"ScientificSchematicGenerator.generate_iterative (cognitive 35): ScientificSchematicGenerator.generate_iterative has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 7, ternaries 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"f357dc322c7731d28c884c9a2976a292c5f1a8ec7d0b4cbf14ce0cdf89ceb787"}},{"ruleId":"D2","level":"warning","message":{"text":"ScientificSchematicGenerator.generate_iterative (cognitive 35): ScientificSchematicGenerator.generate_iterative has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 7, ternaries 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/literature-review/scripts/generate_schematic_ai.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5d38d00194b8d3376885185c79c1f1bc73f00c6c0508adcdee7860a4d6d880"}},{"ruleId":"D2","level":"warning","message":{"text":"search_databases.format_search_results (cognitive 35): search_databases.format_search_results has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/literature-review/scripts/search_databases.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"872d1e41d523c4e66d6f862aadd5af7e54cb4ee314a91e2ffc1096ed15dc9577"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.run_openpiv (cognitive 35): runner.run_openpiv has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 6, loops 4 (5 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/openpiv/scripts/runner.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ed59fd9869313dc2b6b7d04f043b55958640201f4d8cb896e90310f001a898"}},{"ruleId":"D2","level":"warning","message":{"text":"_pptx._inspect_slide_accessibility (cognitive 35): _pptx._inspect_slide_accessibility has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (7 pts), boolean chains 5, ternaries 1 (3 pts), error handling 1 (2 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":"skills/pptx-posters/scripts/_pptx.py"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc04f709bbab5b0045aa6477d90eecd62750853f743967a57476e343b63a8e8"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_chromatograms.main (cognitive 35): extract_chromatograms.main has cognitive complexity 35 (threshold 15). Drivers by points: loops 5 (12 pts), ternaries 4 (11 pts), if/else 9, boolean chains 3 (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":"skills/pyopenms/scripts/extract_chromatograms.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c634c0f5862e43d0779eb7851f719853220fb10a94ba9671a894f7e57897716"}},{"ruleId":"D2","level":"warning","message":{"text":"result_audit._audit_simulation (cognitive 35): result_audit._audit_simulation has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 10 (13 pts), boolean chains 9, if/else 8, error handling 3 (5 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qutip/scripts/result_audit.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc1a286bf331df6e68cde9a88f8402b432b1d0c42288a92765543b6e247d66f"}},{"ruleId":"D2","level":"warning","message":{"text":"ScientificSchematicGenerator.generate_iterative (cognitive 35): ScientificSchematicGenerator.generate_iterative has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 7, ternaries 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-schematics/scripts/generate_schematic_ai.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fd5a04c9a0f25cf3b17e9afa3c96569d362721321637a2ab6a4c7e6d5a004e"}},{"ruleId":"D2","level":"warning","message":{"text":"ScientificSchematicGenerator.generate_iterative (cognitive 35): ScientificSchematicGenerator.generate_iterative has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 7, ternaries 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/generate_schematic_ai.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"496619b06235e63dd3605667c314e27f7f77c88fb273832098ab6b538e1d54c4"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_manifest.validate_source_manifest (cognitive 35): validate_manifest.validate_source_manifest has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 5, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/validate_manifest.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"9324a72d499bfbd824e8d5936cacd2726e8578f418fc762f60895c721929b31d"}},{"ruleId":"D2","level":"warning","message":{"text":"Observations.__init__ (cognitive 34): Observations.__init__ has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 14, loops 5 (10 pts), if/else 3 (7 pts), error handling 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/13c-metabolic-flux/scripts/_mfa_model.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ab1802315429983d4b713c9b14a71996f80ef867522f10813e4d94b841ca66"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_coords.read_intervals (cognitive 34): convert_coords.read_intervals has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (19 pts), ternaries 2 (8 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/convert_coords.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"835877805b62946dd1d1341b92aa13f58cfeec7b6d7d46bb2dff95ff4a219ff1"}},{"ruleId":"D2","level":"warning","message":{"text":"artifact_inspector.inspect (cognitive 34): artifact_inspector.inspect has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (25 pts), ternaries 4 (8 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gtars/scripts/artifact_inspector.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"68767b260956d92741fb83c785e3707e1df5bf079ed763cb82bc3d67ee351beb"}},{"ruleId":"D2","level":"warning","message":{"text":"design_primers.design (cognitive 34): design_primers.design has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (20 pts), ternaries 8, boolean chains 3, loops 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/design_primers.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5d9f29181e93ed5e11bd8889bd8aad1ec14068357887d3884f71533aabd2c5"}},{"ruleId":"D2","level":"warning","message":{"text":"simulate_battery.solve_protocol (cognitive 34): simulate_battery.solve_protocol has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 7, ternaries 3 (6 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pybamm/scripts/simulate_battery.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"141db972f63a95bf48eba9a4d4dfff0f30d64513b8977b9673018a98ad288454"}},{"ruleId":"D2","level":"warning","message":{"text":"process_spectra.main (cognitive 34): process_spectra.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/process_spectra.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"be09a84595511bd96eed6cd7fd70aafaf5396f45b0e53a954bbf25b6f3a1f9bd"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmark_evaluation.normalize_predictions (cognitive 34): benchmark_evaluation.normalize_predictions has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pytdc/scripts/benchmark_evaluation.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"422bc08d7d2aaaa6e380fd6d64d734c22f5c3b79511879c63e59e4ba2a714c43"}},{"ruleId":"D2","level":"warning","message":{"text":"convergence_sweep.run_sweep (cognitive 34): convergence_sweep.run_sweep has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (8 pts), boolean chains 5, ternaries 2 (5 pts) (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":"skills/qutip/scripts/convergence_sweep.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"81021fe603917c4d619c94feae076f9cf018bae125f9a3b2f86e00dd13b4d5bb"}},{"ruleId":"D2","level":"warning","message":{"text":"summarize_agreement.read_rows (cognitive 34): summarize_agreement.read_rows has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (26 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2 (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":"skills/scholar-evaluation/scripts/summarize_agreement.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4613d622aa24d43e2b44efc2d4c3d39d217bacddd0b0a26d2821b5968ece3c6"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.validate_document (cognitive 34): _common.validate_document has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/treatment-plans/scripts/_common.py"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e44e8c8471bd6d272413261e8830ca8638c8c0c55a9673a05899cecf1fbd0ca"}},{"ruleId":"D2","level":"warning","message":{"text":"nuclei_assay.summarize (cognitive 33): nuclei_assay.summarize has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 5, ternaries 2 (4 pts), loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/cellprofiler/scripts/nuclei_assay.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fea5eed4b046d2db0818b78b8ef4506544dc82cc5041499bb27f5de52a75c2e"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAlexSearcher.search (cognitive 33): OpenAlexSearcher.search has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/search_openalex.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b06740564864b9b71fdcbc6b905542dd803ec8b943bf5920337f222deb9ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"check_cad_file.check (cognitive 33): check_cad_file.check has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (28 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fictiv/scripts/check_cad_file.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c2574875e174459cfab51f3d6c814fe299ba11942daad31ff4c6ea0689a180"}},{"ruleId":"D2","level":"warning","message":{"text":"check_operationalization.audit (cognitive 33): check_operationalization.audit has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (5 pts), boolean chains 2, ternaries 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/check_operationalization.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"343462b40b5e0f99ddfea4cdc023b551f10689656f187bef66f0978c46bb0d21"}},{"ruleId":"D2","level":"warning","message":{"text":"gen.main (cognitive 33): gen.main has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 5, loops 2 (5 pts), error handling 3 (4 pts), ternaries 3 (4 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/lab-hardware-cad/scripts/gen.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c23ea9254ae8853f3d34c882bf4dc3c05531e567bc4bac4a00d7293c9c5a812"}},{"ruleId":"D2","level":"warning","message":{"text":"library_search.validate_args (cognitive 33): library_search.validate_args has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 7, loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matchms/scripts/library_search.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"931c2089e4c01b6e4fd71b841827483afe6aec512087a6ad6327d1a4a25ea892"}},{"ruleId":"D2","level":"warning","message":{"text":"slide_manifest.validate_manifest (cognitive 33): slide_manifest.validate_manifest has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 4, error handling 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathml/scripts/slide_manifest.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bd0382cf011fcacc2033d87b7ff0d6426ed0eb65489297a9031773e0385970"}},{"ruleId":"D2","level":"warning","message":{"text":"plan_write_request.build_plan (cognitive 33): plan_write_request.build_plan has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/protocolsio-integration/scripts/plan_write_request.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5f0e3067cbca1a52c8e6fa5f2f9611e72885f4ab1fe9d14f4b9093fc4d3066"}},{"ruleId":"D2","level":"warning","message":{"text":"dicom_inventory.inspect_dataset (cognitive 33): dicom_inventory.inspect_dataset has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 7, error handling 2 (3 pts), ternaries 3 (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":"skills/pydicom/scripts/dicom_inventory.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"43de50f305103948aaf2f9c36e452e61468f20b44390d17377d8a5705668433b"}},{"ruleId":"D2","level":"warning","message":{"text":"amplicon_workflow.retention (cognitive 33): amplicon_workflow.retention has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 4 (8 pts), boolean chains 7, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qiime2-amplicon/scripts/amplicon_workflow.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f6a6517f158e8f23073ad338ed26e941a8a23103c6a977f44d003f585a9853"}},{"ruleId":"D2","level":"warning","message":{"text":"summarize_agreement.summarize (cognitive 33): summarize_agreement.summarize has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/summarize_agreement.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c209c18abaa575cc0caa66d30c598d02423bb06aa9722bddae322a87c152b4af"}},{"ruleId":"D2","level":"warning","message":{"text":"compound_cross_reference.get_chembl_info (cognitive 32): compound_cross_reference.get_chembl_info has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), ternaries 1 (4 pts), boolean chains 3, error handling 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bioservices/scripts/compound_cross_reference.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffd1fe0b0b037024782378fe1ca63f8105ab6bdae61a4107f5ca12fdb4f6f7c"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze_results.print_summary (cognitive 32): analyze_results.print_summary has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (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":"skills/diffdock/scripts/analyze_results.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2af68884188db7bd08cf45d9db11a6fe88c7256b3fb4514d82150244e05fc2"}},{"ruleId":"D2","level":"warning","message":{"text":"_structured._array_report (cognitive 32): _structured._array_report has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 8 (24 pts), if/else 7 (8 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_structured.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"779cb2c9393df9a1554c1154f40b075a7957a69e6c6c517fa1e42527db65212f"}},{"ruleId":"D2","level":"warning","message":{"text":"budget_summary.summarize_scalar_file (cognitive 32): budget_summary.summarize_scalar_file has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (7 pts), boolean chains 3, ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/budget_summary.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f050e790aff460acce17311bd0c2e1747e56f22dd83b4f4f036c2a515bfb7d"}},{"ruleId":"D2","level":"warning","message":{"text":"crs_reprojection_plan.plan (cognitive 32): crs_reprojection_plan.plan has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 9, error handling 4 (6 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":"skills/geopandas/scripts/crs_reprojection_plan.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dfdb5aebd88d320896ebff34566a6c3ba0dfde931d1b6f529af1493bb07157"}},{"ruleId":"D2","level":"warning","message":{"text":"enrichment_pipeline.enrichment_pipeline (cognitive 32): enrichment_pipeline.enrichment_pipeline has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 5 (7 pts), error handling 3 (5 pts), boolean chains 3, ternaries 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gget/scripts/enrichment_pipeline.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcb3f01c84ed3a63d677351b421d6df221f56eb9247bdfc3b4455f336ec188f"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.read_numeric_columns (cognitive 32): _common.read_numeric_columns has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (23 pts), error handling 3 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b8e84c87bb3f7dfdfaa3cde40bcadda84f820ee6117d22bbf291f454950f71"}},{"ruleId":"D2","level":"warning","message":{"text":"reporting_lag.main (cognitive 32): reporting_lag.main has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 3, loops 3, ternaries 2, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathogen-variant-surveillance/scripts/reporting_lag.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db4e93d93e2228b32fa3ad6cba3d2375a511e9281146726eb7dfd34c5c3e675"}},{"ruleId":"D2","level":"warning","message":{"text":"exposure_response.run (cognitive 32): exposure_response.run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 8 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/exposure_response.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c147ce8352b1989ba072cc93e9ec8a36eacc36da82ffd27cb74406b66a2fea9c"}},{"ruleId":"D2","level":"warning","message":{"text":"screen_specificity.run (cognitive 32): screen_specificity.run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (18 pts), ternaries 5, boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/screen_specificity.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa77c67bb51dc1620f24afa9e8c2085b94e47ce291cf3d51ca3180e66ddc41d5"}},{"ruleId":"D2","level":"warning","message":{"text":"protocols_read._plan (cognitive 32): protocols_read._plan has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (26 pts), ternaries 3 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/protocolsio-integration/scripts/protocols_read.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"5858275dda757f2af6024d456cdff47ac3d78e91aca7232181b959c3b34bfdda"}},{"ruleId":"D2","level":"warning","message":{"text":"anonymize_dicom.process_file (cognitive 32): anonymize_dicom.process_file has cognitive complexity 32 (threshold 15). Drivers by points: if/else 22 (29 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/anonymize_dicom.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"73076486a58927c234eda2216401f71eef838e273484289ac34f19fa1af92fc3"}},{"ruleId":"D2","level":"warning","message":{"text":"_common._scan_structure (cognitive 32): _common._scan_structure has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/_common.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"084ddf3e3403a28a4333ccc6eba2aa6db9c06894a4f8dac35018a32204f6959b"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_authorship.validate_ai_disclosure (cognitive 32): validate_authorship.validate_ai_disclosure has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/validate_authorship.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73e2ff31d90973790e37750cbc5e761f3187b1ecf245f3cb1c6698095dc3152"}},{"ruleId":"D2","level":"warning","message":{"text":"kinetic_experiment.validate_experiment (cognitive 32): kinetic_experiment.validate_experiment has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 8, loops 3 (4 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":"skills/tellurium/scripts/kinetic_experiment.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc4a184a2c6ac6083ff573310c87488791102da480aaf7a720d180d13c76f40"}},{"ruleId":"D2","level":"warning","message":{"text":"propagate_uncertainty.run (cognitive 32): propagate_uncertainty.run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 5, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/propagate_uncertainty.py"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f1e7e2d8c95d880108d2562018144f219720fd4745d6fd6e9f1457be551471"}},{"ruleId":"D2","level":"warning","message":{"text":"compare_methods.main (cognitive 31): compare_methods.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 6, ternaries 5, error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/compare_methods.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d787885b67579ac67acf241b94f870558632a4850f8aecd4f24bb400e0285a20"}},{"ruleId":"D2","level":"warning","message":{"text":"compound_cross_reference.get_kegg_info (cognitive 31): compound_cross_reference.get_kegg_info has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (5 pts), boolean chains 3, error handling 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bioservices/scripts/compound_cross_reference.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"36636eda0dc1bbf9ec28a590535000c201f0c94a69a9a4ba6cbde3bc8897f9f2"}},{"ruleId":"D2","level":"warning","message":{"text":"protein_analysis_workflow.get_go_annotations (cognitive 31): protein_analysis_workflow.get_go_annotations has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bioservices/scripts/protein_analysis_workflow.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"623a393214545136b442ea5b378652bd3253775016c6c996145a4c18a8f8b27b"}},{"ruleId":"D2","level":"warning","message":{"text":"detect_resources._detect_accelerators (cognitive 31): detect_resources._detect_accelerators has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (21 pts), ternaries 4 (6 pts), boolean chains 4 (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":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"069a652bd11edb8299c6beb61468f96a4ec0bbcca960af6daaab23e9b00a2148"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_document_records.validate (cognitive 31): audit_document_records.validate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 4, loops 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/audit_document_records.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afae42cf81dd753fe28e7db5a9b88b2693b80565962adfa6d60c669c5257ec8"}},{"ruleId":"D2","level":"warning","message":{"text":"check.cmd_fit (cognitive 31): check.cmd_fit has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (5 pts), ternaries 3 (4 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/lab-hardware-cad/scripts/check.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"93eaec083d6c8e87265fca09916fd32aac497287121bd6bace1a66fcf99144c6"}},{"ruleId":"D2","level":"warning","message":{"text":"screen_analysis.inspect_screen (cognitive 31): screen_analysis.inspect_screen has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/mageck/scripts/screen_analysis.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0baa50361544d1a62b1c48fd46654763d982c627ce28cd16d23c6e1e126e58b"}},{"ruleId":"D2","level":"warning","message":{"text":"plan_write_request._validate_steps (cognitive 31): plan_write_request._validate_steps has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/protocolsio-integration/scripts/plan_write_request.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4fa88ee9afa0916b8e4fb4fdbfe83fcfa4acd0ff8ab61c59c48eeb21c164a7"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.collect_local_files (cognitive 31): _common.collect_local_files has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (23 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/_common.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceda38c27a0eb3d6a11cdcd39942afec8935d1a66965a3d0fd895b39c31b4d3a"}},{"ruleId":"D2","level":"warning","message":{"text":"cache_audit.audit_cache (cognitive 31): cache_audit.audit_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (5 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pytdc/scripts/cache_audit.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"07880a857947d11c654c0ed48f0c78351057065bdb7ff806258bbf8a1b02974e"}},{"ruleId":"D2","level":"warning","message":{"text":"PresentationValidator._check_pptx_content (cognitive 31): PresentationValidator._check_pptx_content has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (10 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/validate_presentation.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75d24d55bc182271bf44f5ffbf741d930692809bb5810c05422e1d6f5ae0891"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_files.validate_files (cognitive 30): validate_files.validate_files has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 3 (6 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/deeptools/scripts/validate_files.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fcf87b4e1fda08967a6d66fb00cb9ccd0a8788e7302d58294c9fcd468a460b"}},{"ruleId":"D2","level":"warning","message":{"text":"detect_resources._detect_cpu_inventory (cognitive 30): detect_resources._detect_cpu_inventory has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 6, error handling 3 (6 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ace56536e7e73a04830d9de9f073237deb8e1732c4b6bfd81c1be7a48a11347"}},{"ruleId":"D2","level":"warning","message":{"text":"check_qmsr_transition.validate (cognitive 30): check_qmsr_transition.validate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 3 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/check_qmsr_transition.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"16aa68caee50084de9dcf2cdfd400c4568e025fbe8f52e07fab4bb173482e9f0"}},{"ruleId":"D2","level":"warning","message":{"text":"plan_transfer.scan_import_path (cognitive 30): plan_transfer.scan_import_path has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (5 pts), error handling 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/omero-integration/scripts/plan_transfer.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7369502ff322a01f78e8950ceab435b829dbff363b2b47e0f9e42f3d14b5f610"}},{"ruleId":"D2","level":"warning","message":{"text":"jats_to_text.main (cognitive 30): jats_to_text.main has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 2 (5 pts), boolean chains 2, loops 1 (2 pts), error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/paper-lookup/scripts/jats_to_text.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"2337e5842fcafc464625fc7e4f4c7077b9983270004a04f02974f109abcbc960"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_claim_evidence.validate_matrix (cognitive 30): validate_claim_evidence.validate_matrix has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 4, ternaries 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/peer-review/scripts/validate_claim_evidence.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"59419676a607d19983c46d9e7b6393aa42e7834717b0fe7262cf839ab752fc3a"}},{"ruleId":"D2","level":"warning","message":{"text":"_specificity.exhaustive_hits (cognitive 30): _specificity.exhaustive_hits has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 4 (10 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/_specificity.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5411f1fd5001abfd7d13786909ba5a73d3d766277fb7223a9317b2ee696ef54e"}},{"ruleId":"D2","level":"warning","message":{"text":"filter_alignments.filter_file (cognitive 30): filter_alignments.filter_file has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 8 (9 pts), boolean chains 7, error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pysam/scripts/filter_alignments.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3baf52ecd6f418680073f6e7ebccb1ddd0e1c526f0848c1bdae362da92ba889"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_claims.audit_markdown (cognitive 30): audit_claims.audit_markdown has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/audit_claims.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92e31521bc2afde7ffa2db9da445be7293b4df1d5e10527ede143bab39ba5f4"}},{"ruleId":"D2","level":"warning","message":{"text":"lint_manuscript.lint_text (cognitive 30): lint_manuscript.lint_text has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/lint_manuscript.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22e6288a3f8142efbbbe577167e63b6568868b8280c9ceabeb593fe79716fbd"}},{"ruleId":"D2","level":"warning","message":{"text":"competing_risk_cif.estimate_cif (cognitive 30): competing_risk_cif.estimate_cif has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 7, ternaries 4, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scikit-survival/scripts/competing_risk_cif.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0260e5d3278921390ca342e7cd0f7b2a21d3edb6664418b9df42226ab778fd"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.read_variant_table (cognitive 29): _common.read_variant_table has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 6 (7 pts), error handling 2 (6 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/alphagenome/scripts/_common.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fbc2a50f9f8b060da5706cbe39e933df1952781e6656936ee34eeb01a217d7"}},{"ruleId":"D2","level":"warning","message":{"text":"build_counts_matrix.build_from_salmon (cognitive 29): build_counts_matrix.build_from_salmon has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 4, error handling 1, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bulk-rnaseq/scripts/build_counts_matrix.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"44413bb641fdff66dfec4bd492e398bb641408d105143e6b2686c67ba48655be"}},{"ruleId":"D2","level":"warning","message":{"text":"nuclei_assay.prepare (cognitive 29): nuclei_assay.prepare has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 5, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/cellprofiler/scripts/nuclei_assay.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac32f3bc08d02375174c2b4a6d7edfe8a978e347e39bf980a9abaa8edf04602"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect_dxpy.print_text (cognitive 29): inspect_dxpy.print_text has cognitive complexity 29 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 5 (10 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/dnanexus-integration/scripts/inspect_dxpy.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced584b8c7508418581444b5681ecb80bac3c16f3e018ee774096ee3038f6846"}},{"ruleId":"D2","level":"warning","message":{"text":"output_inventory.inspect_hdf5_metadata (cognitive 29): output_inventory.inspect_hdf5_metadata has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (17 pts), ternaries 2 (7 pts), loops 2 (3 pts), error handling 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/output_inventory.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8321325167c7adb3fdf13f7959f68bb2494732cced707329a4bf68f9f1557bb7"}},{"ruleId":"D2","level":"warning","message":{"text":"tokenizer_manifest.check (cognitive 29): tokenizer_manifest.check has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 6, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gtars/scripts/tokenizer_manifest.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ac4381d6d8d60d910cc5af8ddd76b48fa60675bc6b302161c10d5da948e6bd"}},{"ruleId":"D2","level":"warning","message":{"text":"eda_pipeline.main (cognitive 29): eda_pipeline.main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (20 pts), error handling 3 (6 pts), boolean chains 2, ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/eda_pipeline.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f2781a6feb7459a8ac6ddcf5233d89a7e3b31f17c8759717f4cff0bbbb774f"}},{"ruleId":"D2","level":"warning","message":{"text":"id_client._request (cognitive 29): id_client._request has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (17 pts), error handling 3 (8 pts), boolean chains 3, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/id_client.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"be357778a5fde39972cbb6648a3eea914321a27bd92ae5ea0c9fb4dd06a9dc88"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_terms.check_term (cognitive 29): validate_terms.check_term has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/validate_terms.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcc322fc8e6269d74d89cf01c20dade540cb697d35bef818bd3cb7e33285236"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.read_csv_records (cognitive 29): _common.read_csv_records has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), ternaries 2 (4 pts), loops 2 (3 pts), error handling 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/peer-review/scripts/_common.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"93be51d0c4b5f454cdffc89f0e674dea1482ef22a3130e583876f4d8e134aeef"}},{"ruleId":"D2","level":"warning","message":{"text":"simulate_battery.validate_protocol (cognitive 29): simulate_battery.validate_protocol has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 4, loops 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":"skills/pybamm/scripts/simulate_battery.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a3ef00920f18195f0e005b2819b356b6faf4a3dc0df4cada6c60e823a14dea"}},{"ruleId":"D2","level":"warning","message":{"text":"equilibrate.validate (cognitive 29): equilibrate.validate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 8, loops 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pycalphad/scripts/equilibrate.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e622933e1a4d39f2c6d843f174cad4badc8e7d2292cbc3fbc8fb275e6039fc"}},{"ruleId":"D2","level":"warning","message":{"text":"run_pipeline.main (cognitive 29): run_pipeline.main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (16 pts), error handling 2 (5 pts), boolean chains 3, ternaries 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scanpy/scripts/run_pipeline.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"be89a1e5f2cebe3969e91350a2fd35f77c372408c9599989e0aa3c05adba0413"}},{"ruleId":"D2","level":"warning","message":{"text":"format_adverse_events.load_aggregate_csv (cognitive 28): format_adverse_events.load_aggregate_csv has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 3, boolean chains 1, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/format_adverse_events.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8005854098e048c18209081383a5a3a8715d07677b49390696648fa8dca79e"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze_gates.analyze (cognitive 28): analyze_gates.analyze has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/flowkit/scripts/analyze_gates.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1aff1ec423b70228111322ff23c87be4f167b5a5ac07f84cf880e6b8c7fd135"}},{"ruleId":"D2","level":"warning","message":{"text":"restart_compatibility.load_hdf5_state (cognitive 28): restart_compatibility.load_hdf5_state has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (4 pts), boolean chains 3, error handling 2, ternaries 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/restart_compatibility.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69958aed63867a5b55438f30d7f04bfb6ee269437c7bc8d1063a036e10f8709"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize_variant.normalize (cognitive 28): normalize_variant.normalize has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 5, loops 2, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/normalize_variant.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb4fcdcdadce818c12ce1f43c1bde679a39603e4f2293ac88508446232b4f16"}},{"ruleId":"D2","level":"warning","message":{"text":"check_unit_consistency.check (cognitive 28): check_unit_consistency.check has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (4 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/market-research-reports/scripts/check_unit_consistency.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"db840dca524a143842d20f825b89021209f44a984aeaf6b94f7807515ccc0940"}},{"ruleId":"D2","level":"warning","message":{"text":"_pptx.strip_generated_printer_settings (cognitive 28): _pptx.strip_generated_printer_settings has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_pptx.py"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"d476fa0ee91b7f95e99411c6968b360b64849993cacb9f0970f19d54eae13ac9"}},{"ruleId":"D2","level":"warning","message":{"text":"plan_write_request._validate_update (cognitive 28): plan_write_request._validate_update has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 8, loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/protocolsio-integration/scripts/plan_write_request.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28cd0d0b9e1ae536048e574c74ab1b252be9ef78cec92700b3b95993bd74c42"}},{"ruleId":"D2","level":"warning","message":{"text":"phase_diagram_generator.entries_from_payload (cognitive 28): phase_diagram_generator.entries_from_payload has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5, ternaries 1 (3 pts), error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymatgen/scripts/phase_diagram_generator.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2780efd8aabfc8d95f4013cb17f07ac2038dc12d6e113ce446e5a96ca881cfae"}},{"ruleId":"D2","level":"warning","message":{"text":"ResearchLookup._extract_sources (cognitive 28): ResearchLookup._extract_sources has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 9, loops 2 (3 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/research-lookup/scripts/research_lookup.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee14a777597bbd3147300fec861327c8923b53b7b1722ff00142192026ad1e81"}},{"ruleId":"D2","level":"warning","message":{"text":"privacy_process_check.check_privacy_process (cognitive 28): privacy_process_check.check_privacy_process has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 4 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/treatment-plans/scripts/privacy_process_check.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd1b4e73043ac55e1b2c644393bb9f18f64efb560983b9ad9af614ce9c34ffa"}},{"ruleId":"D2","level":"warning","message":{"text":"_capabilities.validate_magic (cognitive 27): _capabilities.validate_magic has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5, loops 1 (2 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_capabilities.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d79a6d0aa38f2a9ca1e465cdd286c92670d7f53aa01be399c2e9619f55ae402"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_evidence_manifest.validate (cognitive 27): validate_evidence_manifest.validate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, loops 3, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/validate_evidence_manifest.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38a66a0e36456f5affd81e3443357c941c7e086e9d47f10709010fe9f10eff5"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_evidence_ledger.validate_records (cognitive 27): validate_evidence_ledger.validate_records has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, error handling 2 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/market-research-reports/scripts/validate_evidence_ledger.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"09249434f2242f42c8775a0767c01b87b39a2a71f37a31f6d87d4386d1c240fd"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_synthetic.generate_rows (cognitive 27): generate_synthetic.generate_rows has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 2 (6 pts), loops 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/generate_synthetic.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f504157567f1ed445fb5453a38df9044fe4159d40b0794134b9498321107f1f"}},{"ruleId":"D2","level":"warning","message":{"text":"plan_epochs.plan (cognitive 27): plan_epochs.plan has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 6, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/plan_epochs.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bc1f88868c12be86cce8b4c71397d28522a345a4f1cb26b2e22365953aa89b"}},{"ruleId":"D2","level":"warning","message":{"text":"tdm_bayes.run (cognitive 27): tdm_bayes.run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 7, loops 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/tdm_bayes.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0998c840b23d12b45d958e91ba24f28543eda2b44a9ffa525a576eac1f120e"}},{"ruleId":"D2","level":"warning","message":{"text":"check_thermodynamics.assess (cognitive 27): check_thermodynamics.assess has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (4 pts), ternaries 4, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/check_thermodynamics.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1cda0bf1be9c3a888f06a9d190034d8c0db8d241004d6b64f1103ff9d66751"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.request_bytes (cognitive 27): _common.request_bytes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 3 (7 pts), boolean chains 6, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/protocolsio-integration/scripts/_common.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f3e9660ac360b0e4d8e872455d4013a893f5e9e4de6f1756e8cb0faf19ffff"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_protocol_json.validate_and_summarize (cognitive 27): validate_protocol_json.validate_and_summarize has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/protocolsio-integration/scripts/validate_protocol_json.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2545f5bd68d5ae4384ab8f241af2636256d041d9be0ab4a2bfaf2a7b63ea65f2"}},{"ruleId":"D2","level":"warning","message":{"text":"check_environment.collect_report (cognitive 27): check_environment.collect_report has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (23 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qiskit/scripts/check_environment.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1eea89f9ac5567f2e83d5dc348e57bfc50d790a029ae0c0680914cb3780958"}},{"ruleId":"D2","level":"warning","message":{"text":"solver_config_planner.create_plan (cognitive 27): solver_config_planner.create_plan has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), ternaries 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":"skills/qutip/scripts/solver_config_planner.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3a8aaeb85e1bec6b1037a3f78d7ac3d32c2e48b9c970c0902bfdd0e3240ae8"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate_matrix.calculate_matrix (cognitive 27): evaluate_matrix.calculate_matrix has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (8 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-brainstorming/scripts/evaluate_matrix.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7eef7c730aee5a79933c58743db48059089e2f9dac90b2370e6f86dd43fb8a1"}},{"ruleId":"D2","level":"warning","message":{"text":"slides_to_pdf.combine_images_to_pdf (cognitive 27): slides_to_pdf.combine_images_to_pdf has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (5 pts), ternaries 2 (4 pts), error handling 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/slides_to_pdf.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8617bdcbd07b961c22ea573f13eda1b9c63657cb53562027416906492df32a9"}},{"ruleId":"D2","level":"warning","message":{"text":"atlas_query.track_rows (cognitive 26): atlas_query.track_rows has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), ternaries 2 (6 pts), boolean chains 3 (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":"skills/alphagenome/scripts/atlas_query.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f7ac4619fe40fc07114579889d8562cb2c3ac28b1b2f059f34ac6d8466bb3d"}},{"ruleId":"D2","level":"warning","message":{"text":"atlas_query.cmd_scores (cognitive 26): atlas_query.cmd_scores has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/alphagenome/scripts/atlas_query.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffc8f48150f04ea3b2e636d0053f58d235e24b40a368b0ebf8b977fa7c56605"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch_window.fetch_window (cognitive 26): fetch_window.fetch_window has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/autoskill/scripts/fetch_window.py"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d186649c6b5404dabe4f9e3b1931bc3f92ba092036c75c6b8a8f18619080224"}},{"ruleId":"D2","level":"warning","message":{"text":"PubMedSearcher._extract_metadata_from_xml (cognitive 26): PubMedSearcher._extract_metadata_from_xml has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (4 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/search_pubmed.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f2ffea56756ac627868a0ca2688942f6647fe3a6ffdc8e257a801d8cf011b0"}},{"ruleId":"D2","level":"warning","message":{"text":"check_traceability.validate (cognitive 26): check_traceability.validate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/check_traceability.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceab609219a0904da9e17640a30e870776857b36dd02607a77fb4fbe13d29005"}},{"ruleId":"D2","level":"warning","message":{"text":"select_reporting_guidelines.assess (cognitive 26): select_reporting_guidelines.assess has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 2 (3 pts), ternaries 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/peer-review/scripts/select_reporting_guidelines.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cece96e0a31f16565eee25cc77c278485b5fca719c4f6115bcd89e06b34e390"}},{"ruleId":"D2","level":"warning","message":{"text":"phylogenetic_analysis.validate_fasta (cognitive 26): phylogenetic_analysis.validate_fasta has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, loops 2, ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/phylogenetics/scripts/phylogenetic_analysis.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c4ecdf4c02ba0351894d214356296f18ea2d65cd16360ee9ca7f9fb51a3922"}},{"ruleId":"D2","level":"warning","message":{"text":"accurate_mass_search.main (cognitive 26): accurate_mass_search.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/accurate_mass_search.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0b1b3a70b00d75affb404e3ea0de35e0ceca754d1e8f620b53092f1f054c5d"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate_matrix.load_criteria (cognitive 26): evaluate_matrix.load_criteria has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-brainstorming/scripts/evaluate_matrix.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcc3929d2ddf51e04f878408b491ba9cc5069b96bf56134d1f5b29bd0a57a6f"}},{"ruleId":"D2","level":"warning","message":{"text":"terminology_validator.validate_terminology_manifest (cognitive 25): terminology_validator.validate_terminology_manifest has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), error handling 3 (4 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/terminology_validator.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cf686ea620b9f879f17d05022516d39abea5488cdba91741e57a8070041f16"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.simple_yaml_mapping (cognitive 25): _common.simple_yaml_mapping has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"e376cf4ddf337577282a25ea6d7130e2c1bfa28f5bf6fccfb9481e5f0146b4f8"}},{"ruleId":"D2","level":"warning","message":{"text":"gene_analysis.analyze_gene (cognitive 25): gene_analysis.analyze_gene has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13, boolean chains 5, error handling 4, loops 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gget/scripts/gene_analysis.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e843ad049b12e24775c5311b44a15860a8d97c7512b36513f6b945627b7b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.read_csv_records (cognitive 25): _common.read_csv_records has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (3 pts), ternaries 1 (3 pts), error handling 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc48f5832821c30bf45481e36a58067a803efb221ff03f1fc7b0e2a3dd9f7f7"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect_latch_sdk.print_text (cognitive 25): inspect_latch_sdk.print_text has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (6 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latchbio-integration/scripts/inspect_latch_sdk.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b065720e3945a4e635b02de964fa7fbaa627e273c46fa21bf0b36d022383bfa1"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_pdf.generate_pdf (cognitive 25): generate_pdf.generate_pdf has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4, ternaries 3 (4 pts), error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/literature-review/scripts/generate_pdf.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7dd2b0b75bf4c80b4c3865486ebcfc1ba5694b42a214f6bd17f8014c14d4ce8"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.read_csv_records (cognitive 25): _common.read_csv_records has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2 (3 pts), ternaries 1 (3 pts), error handling 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/market-research-reports/scripts/_common.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd495b350c625c40958a47969b73b74b6cb8138d47363ae9c2cffed1a8fb82e"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_multimodal.validate_manifest (cognitive 25): validate_multimodal.validate_manifest has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 5, loops 3, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/validate_multimodal.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecd52f76b41f5bad0807cd3f6141d80b5e0104a03293553db940087b3932dfb"}},{"ruleId":"D2","level":"warning","message":{"text":"bioequivalence.crossover_2x2 (cognitive 25): bioequivalence.crossover_2x2 has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, loops 3, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/bioequivalence.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"50129f4e88215f922a21156c06ba68dfbf5168500db708c2e5f9543710f21266"}},{"ruleId":"D2","level":"warning","message":{"text":"fit_compartmental._fit_and_report (cognitive 25): fit_compartmental._fit_and_report has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (7 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/fit_compartmental.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ee3486cee1c2a3f9bc1bab698cf1c0c6e8112b87a91a7eb0dd35253a81be4c"}},{"ruleId":"D2","level":"warning","message":{"text":"_pptx._inspect_content_types (cognitive 25): _pptx._inspect_content_types has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_pptx.py"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f942483d5545d063d5fd7f69163fa867d019107fe3b3245854567156a20fb7f"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.percent_of_baseline (cognitive 25): _common.percent_of_baseline has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (5 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/_common.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b280e85061a32e95a03d232ecc55591ace9b34a4d1ddeed1a55db51fda37e0d0"}},{"ruleId":"D2","level":"warning","message":{"text":"run_pipeline.apply_config (cognitive 25): run_pipeline.apply_config has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scanpy/scripts/run_pipeline.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3adca13cb18b8b7163407d833a38a46d45c32ec0c56ff5fc7663e27540c604"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_claims.load_claims (cognitive 25): audit_claims.load_claims has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/audit_claims.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"18055203760a458028e1a7c79b30a9fd59acf31cfdcf7d1430e6e7c0a05d8c77"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_units.run (cognitive 25): convert_units.run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 7, ternaries 1 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/convert_units.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"805e9673f8fb6559c43ced2446bde08ac55b1a6640535fb1e84664da94adec1a"}},{"ruleId":"D2","level":"warning","message":{"text":"uncertainty_budget.normalize_component (cognitive 25): uncertainty_budget.normalize_component has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 5, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/uncertainty_budget.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49e5190205b249d557c39f2799f23de304b65489a8bdf635927bee2a6c6e2e4"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_format.main (cognitive 25): validate_format.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, boolean chains 7, ternaries 2, error handling 1, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/venue-templates/scripts/validate_format.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"351d1e3cb87427beb64be34c95d0e523d067a96a18c9a4f8a33d5ec48ba42d2d"}},{"ruleId":"D2","level":"warning","message":{"text":"_mfa_fit.diagnostics (cognitive 24): _mfa_fit.diagnostics has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 4 (6 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/13c-metabolic-flux/scripts/_mfa_fit.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41dd90d82d9245525bf7113e0551f60746c9028e352045c2d407d6d5895333e"}},{"ruleId":"D2","level":"warning","message":{"text":"doi_to_bibtex.main (cognitive 24): doi_to_bibtex.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (18 pts), error handling 3 (6 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/doi_to_bibtex.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"06be5d02aa8275e55baec8ab039665697902337b322ed7442e5928c54253834f"}},{"ruleId":"D2","level":"warning","message":{"text":"detect_resources._detect_process_cpu_count (cognitive 24): detect_resources._detect_process_cpu_count has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, error handling 3 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee50405583b642c18ec97095bccc68d4abd58a5ad52297b7c2b51e5de8d6475"}},{"ruleId":"D2","level":"warning","message":{"text":"snapshot_tools._diff_values (cognitive 24): snapshot_tools._diff_values has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/snapshot_tools.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07caadfb90e1465b95bd98492ea00e47a18b73c82dde974f65f085bceeddc63"}},{"ruleId":"D2","level":"warning","message":{"text":"refget_digest_plan._read_fasta (cognitive 24): refget_digest_plan._read_fasta has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gtars/scripts/refget_digest_plan.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbea3e119125d215d116131d0e1b893e0a76847d9404d646229d6eb1cd97ce4b"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_competitor_matrix.validate (cognitive 24): validate_competitor_matrix.validate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/market-research-reports/scripts/validate_competitor_matrix.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b527594ad0a8b6bb4a19c505e5189af8054e6bd50d022c0c97477a5e0869ec"}},{"ruleId":"D2","level":"warning","message":{"text":"filter_molecules.main (cognitive 24): filter_molecules.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/medchem/scripts/filter_molecules.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed64e986f2b1050ca6bb3e335bf87f13ce21f01a1dd33361e9e35cefcfa06f9c"}},{"ruleId":"D2","level":"warning","message":{"text":"arax_client.parse_normalization_response (cognitive 24): arax_client.parse_normalization_response has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 8, boolean chains 5, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff91f8253faf8d6e2e3fd7d5561ea503ed47d6517dcb648b0691704dae62103"}},{"ruleId":"D2","level":"warning","message":{"text":"arax_client._classify_logs (cognitive 24): arax_client._classify_logs has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 12, if/else 5 (9 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe4bf8199a46d847e4fd876cd19680947bb3ae471ff14dc30dd00f06c9434a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Report.emit (cognitive 24): Report.emit has cognitive complexity 24 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 4 (5 pts), boolean chains 2, ternaries 1 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/_common.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c8980a5ad60502c6789b883ddd7eaf8cbefe3b3f340c91a1ee8a2f1d46ac9a"}},{"ruleId":"D2","level":"warning","message":{"text":"_manifest._validate_assets (cognitive 24): _manifest._validate_assets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_manifest.py"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d2b0e12a9c7675479f71af96d017b0575848522f9a261d07cec130977c31cf"}},{"ruleId":"D2","level":"warning","message":{"text":"process_identifications.main (cognitive 24): process_identifications.main has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 2 (8 pts), if/else 7, loops 2 (5 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/process_identifications.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dea2c4ae73b81e7783072efe9e190bf694281dc39d507ab20e12a30f2e0f106"}},{"ruleId":"D2","level":"warning","message":{"text":"result_audit._audit_convergence (cognitive 24): result_audit._audit_convergence has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 5, loops 2 (5 pts), error handling 1 (4 pts), ternaries 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":"skills/qutip/scripts/result_audit.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"40993fea5a2bb34580f8526b09ef2c380ab949b550c69e3df5eacd97e5303ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"ResearchLookup._extract_api_citations (cognitive 24): ResearchLookup._extract_api_citations has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 14, if/else 3 (6 pts), loops 4 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/research-lookup/scripts/research_lookup.py"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1ed47185cfe3e75820e45f67f902dd585b65d932ff9e10c27875ca307cbda6"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_report_scaffold.generate_scaffold (cognitive 24): generate_report_scaffold.generate_scaffold has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 8, ternaries 8, if/else 5 (6 pts), loops 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/generate_report_scaffold.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecab6e2ed5cdcf945b011c335de12522ef7546e56221e55554afbe855f76aab3"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_traceability.validate_traceability (cognitive 24): validate_traceability.validate_traceability has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/treatment-plans/scripts/validate_traceability.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2bab97426d0fe7302b4a3890d11735ea2fd802e7d24a0553f8343bc4c6ba55"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_samplesheet.validate_metadata (cognitive 23): validate_samplesheet.validate_metadata has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 4, loops 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bulk-rnaseq/scripts/validate_samplesheet.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"33504bddadc7ed90ea07f9c7c38c2851d9c7fdc5e40027c7efcb1d9c05e71bbb"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_image.find_api_key (cognitive 23): generate_image.find_api_key has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/generate-image/scripts/generate_image.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd454d4888b4f015ec063cbde44674644b160929203a1e0d4dfbc01b614b4df0"}},{"ruleId":"D2","level":"warning","message":{"text":"batch_sequence_analysis.analyze_sequences (cognitive 23): batch_sequence_analysis.analyze_sequences has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 3 (7 pts), loops 3 (5 pts), boolean chains 3 (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":"skills/gget/scripts/batch_sequence_analysis.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcddc21c019f7d208bb7bc6153cc179e4b4a11d8c9411afc463e16c1785d7653"}},{"ruleId":"D2","level":"warning","message":{"text":"onekgpd_api._build_annotation_filter (cognitive 23): onekgpd_api._build_annotation_filter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/onekgpd/scripts/onekgpd_api.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccf8f818bc6b4671b32b6aa344fd679414e9eb8f30ab61d5d530b0400d31d66"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_terms.read_pairs (cognitive 23): validate_terms.read_pairs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, ternaries 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/validate_terms.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"73841a22450a79aad024b5452a60e7b38ed1cf86ca36e7e1228826177ceca7f1"}},{"ruleId":"D2","level":"warning","message":{"text":"paginate.walk (cognitive 23): paginate.walk has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/paper-lookup/scripts/paginate.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"064e3f065a5fd6d7da6c3ee8d761fd9386f8b5e6e4d1b4923fc2781c7494a7bd"}},{"ruleId":"D2","level":"warning","message":{"text":"model_comparison.model_averaging (cognitive 23): model_comparison.model_averaging has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymc/scripts/model_comparison.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c17629d0d00dbb5db8b6e8dd8d77048a3561d9f09ee2f9f5496530b68d10d2"}},{"ruleId":"D2","level":"warning","message":{"text":"mass_calculator.main (cognitive 23): mass_calculator.main has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 6 (8 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/mass_calculator.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c8a29428572a924de45a440d815363954dd71657a07b35e49aa11481b14578"}},{"ruleId":"D2","level":"warning","message":{"text":"variant_summary.summarize_variants (cognitive 23): variant_summary.summarize_variants has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 4, boolean chains 2, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pysam/scripts/variant_summary.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"7161d20a5ead8f06e818a352c79fbc220dfd908aa2e7f567149226c1c5062fbb"}},{"ruleId":"D2","level":"warning","message":{"text":"kde_thresholds.find_thresholds (cognitive 23): kde_thresholds.find_thresholds has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 9, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/kde_thresholds.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"761bb6d59e0a5092f3c40d2d56a422dd350a710837426109485577367f9509b6"}},{"ruleId":"D2","level":"warning","message":{"text":"ResearchLookup._parallel_search (cognitive 23): ResearchLookup._parallel_search has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 2 (6 pts), ternaries 3 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/research-lookup/scripts/research_lookup.py"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"c979926445ec1b73be981c1efebeacc372bc52827ce0262ab40cca71c7aa4193"}},{"ruleId":"D2","level":"warning","message":{"text":"_common._validate_scale (cognitive 23): _common._validate_scale has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/_common.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25fc43fec62698f93345bbe06e99fe85e31e6e52f3f7e5522454c66084e33ad"}},{"ruleId":"D2","level":"warning","message":{"text":"image_metadata.inspect_svg (cognitive 23): image_metadata.inspect_svg has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, error handling 2 (3 pts), ternaries 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/image_metadata.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca504eb19d6816f29c1e0a8915552ccd3d18501a03031d0c6baec42458996ba3"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_authorship.validate_people (cognitive 23): validate_authorship.validate_people has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/validate_authorship.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d314d88fd84dbbffcbf56d45cae30853766b2027cb18d68309c778c40b06e570"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.passing_bablok (cognitive 22): _common.passing_bablok has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/_common.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c7482ab9e422b53a4f724ef7fc4691f8e4ee75e54072eac3ab42c778115c5b"}},{"ruleId":"D2","level":"warning","message":{"text":"GoogleScholarSearcher.search (cognitive 22): GoogleScholarSearcher.search has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, error handling 2 (4 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/search_google_scholar.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5675f5be3d026cc3f9aea3c872a099cf892a1d2def4abb2f4108a8f5459a268"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_trial_report._validate_metadata (cognitive 22): validate_trial_report._validate_metadata has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 5 (7 pts), error handling 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/validate_trial_report.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c9b8239bd19b5b8dc47e21835a9c6e52ea07552a61ea4403a2ba18bbd1a5b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Validator.validate_parameter_list (cognitive 22): Validator.validate_parameter_list has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 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":"skills/dnanexus-integration/scripts/validate_dxapp.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ff52f737f1d242d1095f249097568e081a3747832455a8a8f12b65fa804089"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_image.request_bytes (cognitive 22): generate_image.request_bytes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 2 (4 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/generate-image/scripts/generate_image.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfea3ce5e7574d9e82903d84921b7654488d94dab3d79c2e54b908881fc5e64"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_image.main (cognitive 22): generate_image.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11, boolean chains 5, error handling 3, loops 2, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/generate-image/scripts/generate_image.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7b9a8b315b92da9c1cac6949dd0489cf386b58158e3ea1e692209bb119aedf"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_coords.main (cognitive 22): convert_coords.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (5 pts), error handling 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/convert_coords.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89d98be29f787c2cb6ed9e2701610f0457612bbc319160427a944215f582c33"}},{"ruleId":"D2","level":"warning","message":{"text":"coverage_preflight.preflight (cognitive 22): coverage_preflight.preflight has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14, boolean chains 6, ternaries 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gtars/scripts/coverage_preflight.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"83511d1b0598a16fab16880fb3faa014d2ce499b7976d0667438b87289a528df"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.validate_dataset_manifest (cognitive 22): _common.validate_dataset_manifest has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 6, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed86fb7eab54a0266c99521d6f3e4f934f441944a1bd928df639f90c28abc55c"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_dataset._rows_from_document (cognitive 22): audit_dataset._rows_from_document has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/audit_dataset.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d089399a0d8d0d91233edd6e1e6b2e69c4e7358faec9f259e52c25c41caf400"}},{"ruleId":"D2","level":"warning","message":{"text":"phylogenetic_analysis.root_for_display (cognitive 22): phylogenetic_analysis.root_for_display has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, ternaries 2 (4 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/phylogenetics/scripts/phylogenetic_analysis.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"491275a7e7f9d8fdb2b59ebeae0baaaee7aadc142b58649aa07ad7382b4f4deb"}},{"ruleId":"D2","level":"warning","message":{"text":"_specificity.read_expected (cognitive 22): _specificity.read_expected has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/_specificity.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"86253af66e36b2d1701dcc1a0a93aa7880ee85f27b46aee17b2a108ae2d782d6"}},{"ruleId":"D2","level":"warning","message":{"text":"process_identifications.filter_psm_qvalues (cognitive 22): process_identifications.filter_psm_qvalues has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/process_identifications.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cd0208ede72a8e0dbd3ecfd903f74b5002a6b341a36624e404e0962596fad3"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.read_molecule_records (cognitive 22): _common.read_molecule_records has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, loops 2 (4 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":"skills/rdkit/scripts/_common.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f15161162a791e2ddf956373216ec77a61d627379e6de871f23f8097463d4e"}},{"ruleId":"D2","level":"warning","message":{"text":"forecast_relsa.forecast_animal (cognitive 22): forecast_relsa.forecast_animal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 5, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/forecast_relsa.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4ab459db5c8c188a5acd6a89c326786654abd9f71f46cd4585027346c9fdff"}},{"ruleId":"D2","level":"warning","message":{"text":"plot.main (cognitive 22): plot.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 8, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scanpy/scripts/plot.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"616f335d8954a73922bfa6e3a35eb3f5c2fe08f4137751c14092147da40e16f1"}},{"ruleId":"D2","level":"warning","message":{"text":"score_genes.main (cognitive 22): score_genes.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 1 (2 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scanpy/scripts/score_genes.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"361ead39e71d34c9c82b8624725b655c3519eb5fe5d7fa7e21dde961fd6c2d29"}},{"ruleId":"D2","level":"warning","message":{"text":"check_process.check_process (cognitive 22): check_process.check_process has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (6 pts), ternaries 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/check_process.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc86710cf8f39754b0a768dcae60f3da1e3bb6c343daff18b0a613feb114011e"}},{"ruleId":"D2","level":"warning","message":{"text":"select_reporting_guidelines.check_coverage (cognitive 22): select_reporting_guidelines.check_coverage has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, loops 2, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/select_reporting_guidelines.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"81790e98380871867abc922dc89a5e8eb88aa95f76b4caaf69ed128a1a69c6fb"}},{"ruleId":"D2","level":"warning","message":{"text":"propagate_uncertainty.normalize_variables (cognitive 22): propagate_uncertainty.normalize_variables has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/propagate_uncertainty.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e0561991c16e781b38ab9e5d82fbb1b17e9e4785b85efa36119e7ef211ce65"}},{"ruleId":"D2","level":"warning","message":{"text":"propagate_uncertainty.collect_warnings (cognitive 22): propagate_uncertainty.collect_warnings has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/propagate_uncertainty.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9819b911ca9347eef5d2b79147412a7742cdcb291b8815e17fdf28618fc215"}},{"ruleId":"D2","level":"warning","message":{"text":"profiler_to_waypoint.parse_kraken_report (cognitive 22): profiler_to_waypoint.parse_kraken_report has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/waypoint-bio/scripts/profiler_to_waypoint.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf41d248e239446690584d4b15e20e075e8252c415f771295c66c8e1f3eacd6"}},{"ruleId":"D2","level":"warning","message":{"text":"vocab_coverage.coverage_report (cognitive 22): vocab_coverage.coverage_report has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/waypoint-bio/scripts/vocab_coverage.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba19a1156eff64149bbf71f8891be4e17329c450bda18275dd7312124f132355"}},{"ruleId":"D2","level":"warning","message":{"text":"scan_pr_skills.scan_skill_dirs (cognitive 21): scan_pr_skills.scan_skill_dirs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 3 (6 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan_pr_skills.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1298df535f6da502db824d01c5e135019e8946476016854f4f91298e4aaf03b"}},{"ruleId":"D2","level":"warning","message":{"text":"atlas_query.summarize_avi (cognitive 21): atlas_query.summarize_avi has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (6 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/alphagenome/scripts/atlas_query.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a482050edd204d805ebee94eabadfa6db87dfd1a2ced5eb12e6f18f691662f9"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.default_llm_probe (cognitive 21): doctor.default_llm_probe has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 3 (6 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/autoskill/scripts/doctor.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a81035e35c28a7ddd3b4f4fa3a7a003ccafaef01575703bf5898bb4677179b"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataExtractor.extract_from_arxiv (cognitive 21): MetadataExtractor.extract_from_arxiv has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4 (8 pts), loops 1 (2 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/extract_metadata.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f763c180268684186b4ec46ec8a0e436ab1291a9cc0df368dcdac2c0cae2be5"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_files.check_bed_file (cognitive 21): validate_files.check_bed_file has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/deeptools/scripts/validate_files.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"895b2d39d9a58577edde6931808b9ed816f6f2c699f6e55b92af10b5ba363b39"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.iter_text_lines (cognitive 21): _common.iter_text_lines has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0152ec3cbeca0ab7409d87e6a1d97b5443acc507dfde3639268fa0bbe888f03b"}},{"ruleId":"D2","level":"warning","message":{"text":"tokenizer_compatibility.inspect (cognitive 21): tokenizer_compatibility.inspect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/tokenizer_compatibility.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"db392111016d777cb60ca09a4dc88f252ccd4d185c4028e92cf7a3e43d1642f2"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_dataset.audit (cognitive 21): audit_dataset.audit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 2 (3 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":"skills/hypogenic/scripts/audit_dataset.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e106cad7ccb0f9c98aba699bdeb7608af5a7cc5dd3a568529319cf4e78c1287"}},{"ruleId":"D2","level":"warning","message":{"text":"ScientificSchematicGenerator.review_image (cognitive 21): ScientificSchematicGenerator.review_image has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 5 (6 pts), boolean chains 5, loops 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"3361e6e254b6cff82124f5594b9a29aea239d71fd79f2bc9248dfc32a42166ab"}},{"ruleId":"D2","level":"warning","message":{"text":"ScientificSchematicGenerator.review_image (cognitive 21): ScientificSchematicGenerator.review_image has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 5 (6 pts), boolean chains 5, loops 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/literature-review/scripts/generate_schematic_ai.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa0c91ee4f1f1611190cd0e2df3d71bf038c22ecc22cf94f2fc40c4c7774439"}},{"ruleId":"D2","level":"warning","message":{"text":"process_1d.process (cognitive 21): process_1d.process has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nmrglue/scripts/process_1d.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72efe4f35efaa1386e3d49e08e7e834f17278ce8424d21e3cf036b6738ae77d"}},{"ruleId":"D2","level":"warning","message":{"text":"onekgpd_meta.cmd_select_samples_by_population (cognitive 21): onekgpd_meta.cmd_select_samples_by_population has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8, boolean chains 6, ternaries 6, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/onekgpd/scripts/onekgpd_meta.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"07551aab2bdef1cfd2284d4d2e7495dc4ddb6fec9bd8d9de536ba9153af5da64"}},{"ruleId":"D2","level":"warning","message":{"text":"zooma_client.flatten_hit (cognitive 21): zooma_client.flatten_hit has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 15, if/else 2 (3 pts), loops 2, ternaries 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/zooma_client.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"941c69aa88ee931e1b7fc97e70850f7dad18de834f6fa071f653a9c9cc48f6e9"}},{"ruleId":"D2","level":"warning","message":{"text":"nca.estimate_lambda_z (cognitive 21): nca.estimate_lambda_z has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/nca.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a313a48c4ae6dde4d7d29bf238b4b14b965885846d6c0ed96a0923e808bcddb"}},{"ruleId":"D2","level":"warning","message":{"text":"query_primekg.find_paths (cognitive 21): query_primekg.find_paths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primekg/scripts/query_primekg.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac26726b53c43f269439d63c0c4b112ed0d44f3249d883a97f611d4422a0efb"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.read_fasta (cognitive 21): _common.read_fasta has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/_common.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb3947879b25ffd06994113b96f870eb62036c8500a178768bc63da12a29eeb"}},{"ruleId":"D2","level":"warning","message":{"text":"ScientificSchematicGenerator.review_image (cognitive 21): ScientificSchematicGenerator.review_image has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 5 (6 pts), boolean chains 5, loops 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-schematics/scripts/generate_schematic_ai.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1eb3aefe03a48ef0d803eb7a3b828a17e943748058e8a1d2a8395277c1bd57b"}},{"ruleId":"D2","level":"warning","message":{"text":"ScientificSchematicGenerator.review_image (cognitive 21): ScientificSchematicGenerator.review_image has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 5 (6 pts), boolean chains 5, loops 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/generate_schematic_ai.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a931f78bb4f0966a3af1086b96fc1f7be7adcd5585342ae29aa2bb09e77b4bf"}},{"ruleId":"D2","level":"warning","message":{"text":"SlideImageGenerator.review_image (cognitive 21): SlideImageGenerator.review_image has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 5 (6 pts), boolean chains 5, loops 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/generate_slide_image_ai.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b931b9e1f7404da880ff3fa53929b40ab4be1a7b1a835322d71a69593a13b4"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_manifest.validate_manuscript_manifest (cognitive 21): validate_manifest.validate_manuscript_manifest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, loops 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/validate_manifest.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"562a206212a17d2cbbcaa9746b036cda6f16f51ae914f131a2316dd2b2b97509"}},{"ruleId":"D2","level":"warning","message":{"text":"check_plausibility.run (cognitive 21): check_plausibility.run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/check_plausibility.py"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5b029a072daa8e21f0c8f8cb06378e0b1b3fd476fd5b5d8074e4db08171e13"}},{"ruleId":"D2","level":"warning","message":{"text":"tree.cmd_observe (cognitive 20): tree.cmd_observe has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (4 pts), loops 3, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/arbor/scripts/tree.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"607f41bad4a478e6696b8dc20b710862033aa66396b2d278f83ebb38eb6d4225"}},{"ruleId":"D2","level":"warning","message":{"text":"batch_id_converter.batch_convert (cognitive 20): batch_id_converter.batch_convert has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 2 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bioservices/scripts/batch_id_converter.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f254ae04f04d44cf9f0cc71828183d21ce13c12fdeca25fab9a83e90ddf6c7c"}},{"ruleId":"D2","level":"warning","message":{"text":"batch_id_converter.print_mapping_summary (cognitive 20): batch_id_converter.print_mapping_summary has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts), ternaries 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bioservices/scripts/batch_id_converter.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aace106453bd32e05c0ef8d769577a023177f5f32e8e98704058047d64856b7"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_metadata.main (cognitive 20): extract_metadata.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 pts), error handling 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/extract_metadata.py"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"10da8575cdca0bdb6833e4d74bf66e87a1293181ad03d3edff613ce0e73c87ff"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAlexSearcher._normalise (cognitive 20): OpenAlexSearcher._normalise has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 16, if/else 4. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/search_openalex.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d34bfc72b5db441b8842764dd92cb39a03f80ed82bc411c4abd5a19e57c730"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.load_csv (cognitive 20): _common.load_csv has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/deepchem/scripts/_common.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbf8ac6a5babfc834cfb00b4011ae208dea2e2453c9642b367e3cb87b73b728"}},{"ruleId":"D2","level":"warning","message":{"text":"transfer_learning.main (cognitive 20): transfer_learning.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/deepchem/scripts/transfer_learning.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"046454b99f8759475bc16dbe264312e15c4005e65e5be3381985fb0a0d31a045"}},{"ruleId":"D2","level":"warning","message":{"text":"check_cad_file.inspect_stl (cognitive 20): check_cad_file.inspect_stl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (8 pts), ternaries 1 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fictiv/scripts/check_cad_file.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"472c08ebf7f2696cfd51dffef762fc9abfcff3ac84df0879dbf4ec56939b16c1"}},{"ruleId":"D2","level":"warning","message":{"text":"check_cad_file.main (cognitive 20): check_cad_file.main has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (11 pts), ternaries 3 (7 pts), if/else 2 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fictiv/scripts/check_cad_file.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f3b0c615ef2386419e542fdeac98493908b8f0f88814237ee28583e17f390a"}},{"ruleId":"D2","level":"warning","message":{"text":"check_contigs.read_vcf (cognitive 20): check_contigs.read_vcf has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (8 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/check_contigs.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abb2b1cb5f6eba08d41751ad6a5e2617d7882fbe259812dbd05a8bec5277489"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_prediction_matrix.validate_matrix (cognitive 20): validate_prediction_matrix.validate_matrix has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/validate_prediction_matrix.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0507ce2ae085495eb810417697821bd3856456f96177532c5ac270ecc331cf"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_infographic.resolve_api_key (cognitive 20): generate_infographic.resolve_api_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76e2fcf2cb096a63793a50979ab5811c610824d8dabb55d6406071e1f0163c2"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_infographic_ai._resolve_api_key (cognitive 20): generate_infographic_ai._resolve_api_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ddd66b33a8ce46a6c524178ec1b4741f9bc3e79ad9c84e0c3b673eda4569cb"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_schematic.resolve_api_key (cognitive 20): generate_schematic.resolve_api_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b53ece9d973dfae6041049e334ba702356513387cb416bf97c062c3f27e286"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_schematic_ai._resolve_api_key (cognitive 20): generate_schematic_ai._resolve_api_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4453888e7c6f73c532134a09ecf85226c166b961ee2da85194a846be1b3e515"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_schematic.resolve_api_key (cognitive 20): generate_schematic.resolve_api_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/literature-review/scripts/generate_schematic.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cdfbfdcc8472fcddcd993db0a397281875c5193c9276c2d9bfe727f9e9e44c"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_schematic_ai._resolve_api_key (cognitive 20): generate_schematic_ai._resolve_api_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/literature-review/scripts/generate_schematic_ai.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1486173a6dbe1803770a2618ae6d5d93a4cc11da410ceccebf21424f0f5a3a0a"}},{"ruleId":"D2","level":"warning","message":{"text":"library_search.write_hits (cognitive 20): library_search.write_hits has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matchms/scripts/library_search.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"c044a91c29944aa445f15447a7e40f22cdb669399606cff97d5376c25d965afa"}},{"ruleId":"D2","level":"warning","message":{"text":"lookup_prefix.read_inputs (cognitive 20): lookup_prefix.read_inputs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/lookup_prefix.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"51817cc721ab0d237bc7dbcdb90f24e68e47242427b3dbe00e3e26c75db23b63"}},{"ruleId":"D2","level":"warning","message":{"text":"map_terms.read_inputs (cognitive 20): map_terms.read_inputs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/map_terms.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5ca5830f564ee9d97e684463b5fddb4988c5402deeb833268425226ffd1125"}},{"ruleId":"D2","level":"warning","message":{"text":"resolve_terms.read_inputs (cognitive 20): resolve_terms.read_inputs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/resolve_terms.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"162e0a02d804a1a6fd45d3942074eed16061a379f8af0cba5cb39f854c945759"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_terms.main (cognitive 20): validate_terms.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), error handling 3 (5 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/validate_terms.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c292cd3e5cc0282cff863fbac6dff4460e39861ccbc69dbebdb86c3b0916158"}},{"ruleId":"D2","level":"warning","message":{"text":"source_ingestion.iter_sources (cognitive 20): source_ingestion.iter_sources has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/open-notebook/scripts/source_ingestion.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b89468fea06f0a379eea02e09054946adf89eefe7db160b93501cb99241fc97"}},{"ruleId":"D2","level":"warning","message":{"text":"paginate._rxiv_parse (cognitive 20): paginate._rxiv_parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, ternaries 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/paper-lookup/scripts/paginate.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4fc9451a35663d2f54501f4aa066fa60777eeb8c9cac53a37dfd62336bd69b"}},{"ruleId":"D2","level":"warning","message":{"text":"_models._integrate_with_doses (cognitive 20): _models._integrate_with_doses has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/_models.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80490efa297c597e9d3c77c59b02d1fb6dff0f7fad180e79ba4f145740eb6ca"}},{"ruleId":"D2","level":"warning","message":{"text":"model_comparison._validate_comparable_observations (cognitive 20): model_comparison._validate_comparable_observations has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymc/scripts/model_comparison.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bebdc385c43aba04032c65c0fd8c28154e6036ff61c5aada75859d7385419f1"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.canonicalize (cognitive 20): _common.canonicalize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/_common.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18d4daa9e8e62335954147a60c34f78c2838ad5a3a756c61562ae94981ce539"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_schematic.resolve_api_key (cognitive 20): generate_schematic.resolve_api_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-schematics/scripts/generate_schematic.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"43695703cdd5bd94cfbfe64d764b2bae818f2f8a244ea47823ec387008f729e3"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_schematic_ai._resolve_api_key (cognitive 20): generate_schematic_ai._resolve_api_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-schematics/scripts/generate_schematic_ai.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"289c52200bad10d5725eafb7df708c2fe9e55873e58c827d495cb821ea42ed6d"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_schematic.resolve_api_key (cognitive 20): generate_schematic.resolve_api_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/generate_schematic.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"121f39e1b47cb88d983b5ca7eb1cc849d6f559bb812d9c36a88e42576cd5f74c"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_schematic_ai._resolve_api_key (cognitive 20): generate_schematic_ai._resolve_api_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/generate_schematic_ai.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef20ff6a3f2d97f27eccbc3d3104e1e02c58564c78c61208454f0dc6dcb9573"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_slide_image.resolve_api_key (cognitive 20): generate_slide_image.resolve_api_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/generate_slide_image.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c025f76ed6f1ab7fbf41a68efbe0c78a1e1b4e29781be07721364e2982750d"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_slide_image_ai._resolve_api_key (cognitive 20): generate_slide_image_ai._resolve_api_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/generate_slide_image_ai.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc5013f503d8b739304d10cb9a9540351f71ce0f2161a1e0996ddfceab3f8e7"}},{"ruleId":"D2","level":"warning","message":{"text":"event_trace_summary.summarize_resource_csv (cognitive 20): event_trace_summary.summarize_resource_csv has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, error handling 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/simpy/scripts/event_trace_summary.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebe2af39999495f68c78628e1742dfac6b3cbff182b84af94095717f7cef0a0"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.read_vcf (cognitive 19): _common.read_vcf has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 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":"skills/alphagenome/scripts/_common.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fce33f47c759b9a902974eb7c2d2f13a9a19244c171b212421a673bb76d4af"}},{"ruleId":"D2","level":"warning","message":{"text":"CitationValidator.verify_doi (cognitive 19): CitationValidator.verify_doi has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/validate_citations.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"71065b5a567c649b377c7c2e5ed99c0f388f5f97b823471c95dc788ed5ecb3af"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_citations.main (cognitive 19): validate_citations.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/validate_citations.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8bbc45b7ae2e5f921ee3f2bb8a1e826738dfb6912f594ef6673168a48faee2"}},{"ruleId":"D2","level":"warning","message":{"text":"detect_resources.parse_apple_profiler_json (cognitive 19): detect_resources.parse_apple_profiler_json has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (5 pts), ternaries 3 (5 pts), error handling 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"908f667f3cad89e4785ab6592e7af9003315d0a87b1f6483363d8da638ff169e"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.classification_metrics (cognitive 19): _common.classification_metrics has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (9 pts), boolean chains 4, loops 3 (4 pts), if/else 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb902fc13a7d24e980c257997ea4fd999e4f3da710496e8e4dba3651be37633"}},{"ruleId":"D2","level":"warning","message":{"text":"gap_analyzer.analyze (cognitive 19): gap_analyzer.analyze has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, ternaries 3, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/gap_analyzer.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cac8501412190e5e8820e19b562db708e9a33325266d65c6e98f6e511aa6d9"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.checked_input (cognitive 19): _common.checked_input has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, error handling 2 (3 pts), ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matlab/scripts/_common.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99a4172971cdfdac0843ce45a71156c2707c60702f658dd7df47ec3661c5507"}},{"ruleId":"D2","level":"warning","message":{"text":"plan_batch_command.build_plan (cognitive 19): plan_batch_command.build_plan has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matlab/scripts/plan_batch_command.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c056c7795bef3dbfac6f7f3180dddf4745c0b27aed8c5cbe2e84a0bad0035c56"}},{"ruleId":"D2","level":"warning","message":{"text":"filter_molecules.generate_summary (cognitive 19): filter_molecules.generate_summary has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (7 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/medchem/scripts/filter_molecules.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa56ae20ae8b90102dc819f3f23bb98b2fba10707e1b6f301630868a6b3aa8e1"}},{"ruleId":"D2","level":"warning","message":{"text":"id_client.classify_prefix_query (cognitive 19): id_client.classify_prefix_query has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 13, if/else 4, ternaries 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/id_client.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc9c12e88cebd9a7f962d1654616343366797e6b2a93921b24860b34df0ae74"}},{"ruleId":"D2","level":"warning","message":{"text":"bioequivalence.run (cognitive 19): bioequivalence.run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5, ternaries 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/bioequivalence.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62b9cdafdf1085425eb8e7c74543bccff0c13bb703b213a8b01265b54516ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.sanitize_untrusted (cognitive 19): _common.sanitize_untrusted has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/protocolsio-integration/scripts/_common.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"33931ca2c697b4090c38dcb00ef311f629c92a426a2c17c22443ba2c70e6ba2e"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.load_structure_json (cognitive 19): _common.load_structure_json has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymatgen/scripts/_common.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6198cfd861be9fed8029408719affca71f8ce8ca80cf84796b521ed628c48e3"}},{"ruleId":"D2","level":"warning","message":{"text":"composition_structure_validator.validate_structure (cognitive 19): composition_structure_validator.validate_structure has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymatgen/scripts/composition_structure_validator.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a680e830640ec2dc50269eec1d3601a42de9ce495b5e375de28513afd5521e"}},{"ruleId":"D2","level":"warning","message":{"text":"decision_making_example.apply_pseudo_weights (cognitive 19): decision_making_example.apply_pseudo_weights has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymoo/scripts/decision_making_example.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07c936f955901a088dbb482173b40190a303dc62d761d773fb2cb791850c13a"}},{"ruleId":"D2","level":"warning","message":{"text":"digest_protein.main (cognitive 19): digest_protein.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (7 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/digest_protein.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0046bcc996976fa066fe7086dbf8e1c2c6f692197b405d83621b2bc0b6a748"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.validate (cognitive 19): _common.validate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/_common.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ac467cc7bf306fb1d865397318a3ff8257b3a6d0bd4356a4180a45b376fb13"}},{"ruleId":"D2","level":"warning","message":{"text":"research_lookup.main (cognitive 19): research_lookup.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 1 (2 pts), ternaries 2, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/research-lookup/scripts/research_lookup.py"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb42ad2ba1486f3d44ef8250cac0b2294ce32567a67f45275b29cb193a170ad"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect_data.main (cognitive 19): inspect_data.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 5 (9 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scanpy/scripts/inspect_data.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7661a5ac9373ffd92d7d4b7eeb7bf1a63db0cb95e95f0b3b7be6fb952f9ef5"}},{"ruleId":"D2","level":"warning","message":{"text":"slides_to_pdf.get_image_files (cognitive 19): slides_to_pdf.get_image_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/slides_to_pdf.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdc28976348bc7ba3bba2d277e40caf0d0ee1cc60c8dd990f46d8934f1b9780"}},{"ruleId":"D2","level":"warning","message":{"text":"Auditor.visit_Call (cognitive 19): Auditor.visit_Call has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/audit_units.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"67adc7386954cf635052422714826668805c35c63edfac6dd11d4318e6ec772d"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.write_rows (cognitive 18): _common.write_rows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 3 (7 pts), ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/alphagenome/scripts/_common.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83b90cb389af3f64c3a0c340451631dc1c3e5150702ffdecd8af19fb69c2aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"score_variants.score (cognitive 18): score_variants.score has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/alphagenome/scripts/score_variants.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6ec586260f49add809d5ccd68c4f209a00f39e79741bb0a5af510ba667f108"}},{"ruleId":"D2","level":"warning","message":{"text":"compound_cross_reference.get_chebi_info (cognitive 18): compound_cross_reference.get_chebi_info has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bioservices/scripts/compound_cross_reference.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78ad6244ace9f10812458b9aa4d166243aa9dfde29ceb3da5fadcfb7298f092"}},{"ruleId":"D2","level":"warning","message":{"text":"_common._check_tree (cognitive 18): _common._check_tree has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/_common.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd5bb998911daea7c27b95c6de8abaf6112b78a4ba36b34912a9af2894825af"}},{"ruleId":"D2","level":"warning","message":{"text":"format_adverse_events.render_markdown (cognitive 18): format_adverse_events.render_markdown has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/format_adverse_events.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"011520e59b047559118498c20efd66b5848d178d8f341078a24699ed3f2e76a2"}},{"ruleId":"D2","level":"warning","message":{"text":"_tabular.audit_missingness_and_leakage (cognitive 18): _tabular.audit_missingness_and_leakage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), ternaries 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_tabular.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c7dc9176e900374033b3eb317eb81342619d81cbef53d31f9d3e9a9a585d1d"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect_fcs.inspect_file (cognitive 18): inspect_fcs.inspect_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/flowio/scripts/inspect_fcs.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7298ae9d4b69bf9e4ab904e9123e566fef0d05ec73c593d022b32d838d8452"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize_variant.main (cognitive 18): normalize_variant.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 2 (3 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/normalize_variant.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"879203dbe99ac13f1989ed2ee4760e7170cbcfbae19b224fdcc7031025c1150e"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_infographic.main (cognitive 18): generate_infographic.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16, error handling 1, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"bece94ca136de3d4ff0f1c6f55e99f93e3aa933b0649d7dcbfa23bd1f6fc3401"}},{"ruleId":"D2","level":"warning","message":{"text":"check_supplier_controls.validate (cognitive 18): check_supplier_controls.validate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/check_supplier_controls.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c8a75920f7c2981586b39f7e6b4c21e4b4b42194340e79661b08e926009513"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.evaluate_checks (cognitive 18): _common.evaluate_checks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/lab-hardware-cad/scripts/_common.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba5e5266b0feffde78a1d7fb8d06be69a7ff5aff86f85a709a7ad28b615457a"}},{"ruleId":"D2","level":"warning","message":{"text":"reproducibility_report.build (cognitive 18): reproducibility_report.build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matlab/scripts/reproducibility_report.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b16979e2cc460e98c66e7aa2e8c21dc960b1fbb90d916915776c2722fbdcb6"}},{"ruleId":"D2","level":"warning","message":{"text":"scan_m_code._without_comments (cognitive 18): scan_m_code._without_comments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matlab/scripts/scan_m_code.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c9bf9dfdd5f4eae652af75f2d310ca24c6f5bf63ac5c6a069594ceb1646059"}},{"ruleId":"D2","level":"warning","message":{"text":"arax_client.request_get_with_retry (cognitive 18): arax_client.request_get_with_retry has cognitive complexity 18 (threshold 15). Drivers by points: error handling 4 (9 pts), if/else 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c68b1d995ba7c6199f91e9bb3c77a53a9d1ef9e759f01519e48c91dc736aa75"}},{"ruleId":"D2","level":"warning","message":{"text":"arax_client._validate_edge_contract (cognitive 18): arax_client._validate_edge_contract has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cfb343227d0b9573ff817954b483deee3810f494358452ccd14955c5d38786"}},{"ruleId":"D2","level":"warning","message":{"text":"analysis_template.main (cognitive 18): analysis_template.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neuropixels-analysis/assets/analysis_template.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee5e7ab981efbd83d8ba5c3bc05ebefe587b7e8d14cc14b58627bdbe7543be9"}},{"ruleId":"D2","level":"warning","message":{"text":"omero_common.json_safe (cognitive 18): omero_common.json_safe has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/omero-integration/scripts/omero_common.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fd900be6d059f49868702a60725477937380e28c983e81502f401dfa28bdfa"}},{"ruleId":"D2","level":"warning","message":{"text":"jats_to_text.extract_metadata (cognitive 18): jats_to_text.extract_metadata has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/paper-lookup/scripts/jats_to_text.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee71c8e8105d487eb451a93805e2811c73182f5f83f13b23a2ec9107a2cad0d"}},{"ruleId":"D2","level":"warning","message":{"text":"image_qc.calculate_qc (cognitive 18): image_qc.calculate_qc has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathml/scripts/image_qc.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69df4b8ccf36ad048e29984129487ca2899fde4da0e29754d95dfd28b2613af"}},{"ruleId":"D2","level":"warning","message":{"text":"nca._parse_conc (cognitive 18): nca._parse_conc has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/nca.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80730d927a07858a20e2ce644217c337b8ec25717cb8a381c69b2661298f809"}},{"ruleId":"D2","level":"warning","message":{"text":"dicom_to_image._apply_grayscale_transforms (cognitive 18): dicom_to_image._apply_grayscale_transforms has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/dicom_to_image.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa49d9f11e0f248673745a13cfe20bd96aff20a095e8f42f79a982c45a8fa8ad"}},{"ruleId":"D2","level":"warning","message":{"text":"similarity_search.main (cognitive 18): similarity_search.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/rdkit/scripts/similarity_search.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe3ecf1333bf97b021f6a9f8e08d0f3e48b6af6820f3d874f96d35160be7952"}},{"ruleId":"D2","level":"warning","message":{"text":"ResearchLookup.__init__ (cognitive 18): ResearchLookup.__init__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 7, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/research-lookup/scripts/research_lookup.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b24e1c36b3901461c55a7742b14284bf5ab8cb910832cd40aa7ea1c7727e23"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.write_json (cognitive 18): _common.write_json has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 4 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-brainstorming/scripts/_common.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba16e8a4019d5c642400e7f4baa2eb210196a7d99c26c01065ce07c8f0a3663"}},{"ruleId":"D2","level":"warning","message":{"text":"timeline_generator.build_schedule (cognitive 18): timeline_generator.build_schedule has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 5, boolean chains 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/treatment-plans/scripts/timeline_generator.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a1cf7d19b2c3cd8237b68dcc1832cfdae5690242158b6e80b2507923c8a563"}},{"ruleId":"D2","level":"warning","message":{"text":"check_bioanalytical_run.main (cognitive 17): check_bioanalytical_run.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/check_bioanalytical_run.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8863fd8530412eb8fde2a46502af9e413aa03845783d406445a949bc2c49360"}},{"ruleId":"D2","level":"warning","message":{"text":"plan_validation.main (cognitive 17): plan_validation.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/plan_validation.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"369663da46315d7743ebfd0db64098026d1aefe8559c09d48bf1e7c1222f8d21"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataExtractor.extract_from_doi (cognitive 17): MetadataExtractor.extract_from_doi has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 4, if/else 2, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/extract_metadata.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5288cb8c3219fd23c07116af3194ce9309bf73ae1c0d96dfdb029cbd023b9d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"PubMedSearcher.fetch_metadata (cognitive 17): PubMedSearcher.fetch_metadata has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/search_pubmed.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5675caf077e428db8f0d2b46d7c75452a18cfa76274302e5a867468306699dd7"}},{"ruleId":"D2","level":"warning","message":{"text":"CitationValidator.detect_duplicates (cognitive 17): CitationValidator.detect_duplicates has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/validate_citations.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee8aca13d8ffb43adca82dececf3fb4f6d933fbb507ab5ffc494bd0a1271f17"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.validate_splits (cognitive 17): _common.validate_splits has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/deepchem/scripts/_common.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"842fca2c09605eac1ff471da257c489d4b4149ea9c331c0a44bf7f4364e2cc8b"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_files.check_bigwig_file (cognitive 17): validate_files.check_bigwig_file has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 2, boolean chains 1, loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/deeptools/scripts/validate_files.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f88e9c7ffa4b0356e413539cd8b085fdbf00aa6bc3d2b6fdbcca82b2c7cc31"}},{"ruleId":"D2","level":"warning","message":{"text":"Validator.validate_run_spec (cognitive 17): Validator.validate_run_spec has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/dnanexus-integration/scripts/validate_dxapp.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b55d436dde850d5d7fc2a74394c26c79eade0e149c19dba45edd4e6abfa684"}},{"ruleId":"D2","level":"warning","message":{"text":"Validator.validate_regional_options (cognitive 17): Validator.validate_regional_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/dnanexus-integration/scripts/validate_dxapp.py"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"079452f397c8be5ed7bb02ae88c174882ff270c84a38462aef85334d16b42ca5"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.checked_input (cognitive 17): _common.checked_input has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8257ee460668107cef4f2c201f9c11682f24a9202735b0caca73d452e89f9e"}},{"ruleId":"D2","level":"warning","message":{"text":"restart_compatibility.load_manifest (cognitive 17): restart_compatibility.load_manifest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/restart_compatibility.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c214e7422431d3be78ebb3d9536d228006ff32c96c090d42270c104d945424ea"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.load_chrom_sizes (cognitive 17): _common.load_chrom_sizes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e5dd9e7810fd423e897c94f86a14c3aaa73db546292c7963e30bbf6e52d499"}},{"ruleId":"D2","level":"warning","message":{"text":"model_artifact_inspector._redacted_metadata (cognitive 17): model_artifact_inspector._redacted_metadata has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/model_artifact_inspector.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"962974333bfbc01129fa6eac6037e733e1ab744eae4ceddef9e0e085cb49cabd"}},{"ruleId":"D2","level":"warning","message":{"text":"detect_resources._recursive_scalar (cognitive 17): detect_resources._recursive_scalar has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f447ce0daf5375dc9b950e8af611b18ce86da5eb8b900f421a9ad4621e400e"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.iter_text_lines (cognitive 17): _common.iter_text_lines has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gtars/scripts/_common.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fbba68563acc7fc1cdace0ddc8878b8f07ebf14b19d9a5945b5ae59d689e75"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch_catalog.parse_markdown (cognitive 17): fetch_catalog.parse_markdown has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hugging-science/scripts/fetch_catalog.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92800428fc0160fcfb130e4a1a2fd555e485f6c4baca03d35bbaf8891019b9d"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.validate_hypothesis_bank (cognitive 17): _common.validate_hypothesis_bank has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8e86db576508f6786177368abe9e6a7ba79f9120d57d58578e0d01329dc9f4"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_evidence_ledger.audit (cognitive 17): audit_evidence_ledger.audit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (7 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/audit_evidence_ledger.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fe682b557fdfb7c5aab64ea913f56649fcd9550600bd0a5ee04fc664bee848"}},{"ruleId":"D2","level":"warning","message":{"text":"screen_analysis.read_counts (cognitive 17): screen_analysis.read_counts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/mageck/scripts/screen_analysis.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8894bf7281437c7dcf3137307dd6ae3d90fc88aa9837d0b42283d98b1c6c2d4"}},{"ruleId":"D2","level":"warning","message":{"text":"library_search.create_processor (cognitive 17): library_search.create_processor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, ternaries 3 (6 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matchms/scripts/library_search.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea36ee4f5b2f006bdddd0d07ea4c672d181b397e1a34cf48c3d4cc0d0ee51b9"}},{"ruleId":"D2","level":"warning","message":{"text":"filter_molecules.load_molecules (cognitive 17): filter_molecules.load_molecules has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/medchem/scripts/filter_molecules.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"45350dd6889a9172fb4b2c717a2a9c978eac4eb5be366e1eb259ac4e8ba2ca62"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_session.align_behavior (cognitive 17): convert_session.align_behavior has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nwb-conversion/scripts/convert_session.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b3807c62305b73890024aeb86d2416c9fdd284f7795f12e25da348c2a7100a"}},{"ruleId":"D2","level":"warning","message":{"text":"ols_client._request_url (cognitive 17): ols_client._request_url has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/ols_client.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"001cec31a17ca3abc79378f88a648820381ee016bd8226cb958bf871b21ecfa3"}},{"ruleId":"D2","level":"warning","message":{"text":"source_ingestion.wait_for_processing (cognitive 17): source_ingestion.wait_for_processing has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/open-notebook/scripts/source_ingestion.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4903f4fec637e9eb5a63ca3f5f6e38ff20b9b39eb573836a579bcc1fac55875"}},{"ruleId":"D2","level":"warning","message":{"text":"arxiv_atom.main (cognitive 17): arxiv_atom.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, error handling 2, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/paper-lookup/scripts/arxiv_atom.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"451c29413c3a0058df93744836beea5819855c8bcf6c5e7eef34f77960e4a65e"}},{"ruleId":"D2","level":"warning","message":{"text":"openalex_abstract.reconstruct (cognitive 17): openalex_abstract.reconstruct has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/paper-lookup/scripts/openalex_abstract.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df5b5da81880778c7d36561ffeb8ba0d627fe8c7f3e7b50cd31f0ab9f267788"}},{"ruleId":"D2","level":"warning","message":{"text":"image_qc._read_pnm (cognitive 17): image_qc._read_pnm has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 3, loops 1 (2 pts), error handling 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathml/scripts/image_qc.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4fd9add7e5a7730ed033a59364d889bf767fe36816e5cd22e7f10c73aa1a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"slide_manifest._inspect_openslide (cognitive 17): slide_manifest._inspect_openslide has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathml/scripts/slide_manifest.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c220131cd2d1932f3c46257397e8d2575ef015ff63b896e66eb59c114f7395b6"}},{"ruleId":"D2","level":"warning","message":{"text":"slide_manifest.main (cognitive 17): slide_manifest.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathml/scripts/slide_manifest.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c0a1e128f50a76e74affbe43dfaa0068486f889d361308f5edb07ca5baaf26"}},{"ruleId":"D2","level":"warning","message":{"text":"lineage_prevalence.parse_where (cognitive 17): lineage_prevalence.parse_where has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathogen-variant-surveillance/scripts/lineage_prevalence.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabe86527b5216c6236ab07bbb997ec9c793824ea4014fe7b1976604e90896c1"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.read_table (cognitive 17): _common.read_table has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/_common.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0af0c357c2fcc4d3c3caea98e513680ddf1aa6ed9c35a0c2fe5035a0cac410"}},{"ruleId":"D2","level":"warning","message":{"text":"_models.simulate_tmdd (cognitive 17): _models.simulate_tmdd has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 7, ternaries 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/_models.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4dc10734f60abe57492244056e6510fd683085e3e72c3c7acfb4aab9613e67"}},{"ruleId":"D2","level":"warning","message":{"text":"fit_compartmental.fit_one (cognitive 17): fit_compartmental.fit_one has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 3 (5 pts), error handling 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/fit_compartmental.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcff98d6cfe8d1f5fbc24ac76c6cdbb46c3284b62d184a6211d5fb7dbd016dd1"}},{"ruleId":"D2","level":"warning","message":{"text":"_manifest._validate_palette (cognitive 17): _manifest._validate_palette has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_manifest.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d42c35baebecf69f379027f6e9f71299ecfcc3de5acec3d5b95faca5ce6fff4"}},{"ruleId":"D2","level":"warning","message":{"text":"inventory_images.build_inventory (cognitive 17): inventory_images.build_inventory has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/inventory_images.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25ded3486863dae28394cfc838af5656ceb499424d8fc0e35b0ce38b9ebecc3"}},{"ruleId":"D2","level":"warning","message":{"text":"anonymize_dicom._date_action (cognitive 17): anonymize_dicom._date_action has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/anonymize_dicom.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7edd5a1312a4f6769b97ea67760a57b85ad619a72ea74f17f8fc98939ad4654"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.load_structure (cognitive 17): _common.load_structure has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, error handling 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymatgen/scripts/_common.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"330b049a233111b7c673b01374e300c8d263bff4a0f0585e8e67deb95a3ece07"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect_ms_data.summarize_experiment (cognitive 17): inspect_ms_data.summarize_experiment has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/inspect_ms_data.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f83f6f7c8465c96105058d122451c622241413813c5cd0f2fb367ed35aa8d7b"}},{"ruleId":"D2","level":"warning","message":{"text":"filter_alignments.validate_destinations (cognitive 17): filter_alignments.validate_destinations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pysam/scripts/filter_alignments.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb9f26a21fdc2827eb4bdd6b631b231b36964ed6887577875bb989d4dbadd52"}},{"ruleId":"D2","level":"warning","message":{"text":"spa_workflow.main (cognitive 17): spa_workflow.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relion/scripts/spa_workflow.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc0c6b8b297efd54197eddfd2d24173d8ca6d57473c125924746ae1fc5db821"}},{"ruleId":"D2","level":"warning","message":{"text":"subset.main (cognitive 17): subset.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 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":"skills/scanpy/scripts/subset.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2ea17e959cddafebc434e2dcbd14f1818a5abd7721818910c770aab44d802b"}},{"ruleId":"D2","level":"warning","message":{"text":"figure_export.save_for_journal (cognitive 17): figure_export.save_for_journal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, boolean chains 7, error handling 1, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/figure_export.py"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b74748f5f49b06d6a19dfd446a6d5be27b0b425f9c879c833f697e93f3e917"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate_survival_metrics.validate_predictions (cognitive 17): evaluate_survival_metrics.validate_predictions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scikit-survival/scripts/evaluate_survival_metrics.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c4c971a67a8d397f63c0264daee6acbb5c7b17a44012adf539edeea887af2a"}},{"ruleId":"D2","level":"warning","message":{"text":"assumption_checks.check_regression_diagnostics (cognitive 17): assumption_checks.check_regression_diagnostics has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 3, ternaries 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/statistical-analysis/scripts/assumption_checks.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d201d51b4e4d0f8c7adc56db86f1385a2698ddbde2cb64332f64896d719d74"}},{"ruleId":"D2","level":"warning","message":{"text":"_common._check_bounds (cognitive 17): _common._check_bounds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/treatment-plans/scripts/_common.py"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0e9a4999ebd031c2a3f0169e338f43396c7a8985852a1e6dfb32e06e3f7382"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_treatment_plan.validate_target (cognitive 17): validate_treatment_plan.validate_target has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (5 pts), ternaries 1 (4 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":"skills/treatment-plans/scripts/validate_treatment_plan.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb09871521ffd3b4c5877aa9ab28dd35a3abfe7b5444ba64ac577e0e0c3daa4d"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_units.parse_suppressions (cognitive 17): audit_units.parse_suppressions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/audit_units.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"161d9fa9873bd4747a35018ef694a9c3f9b98086758963b076a872a13e6f695f"}},{"ruleId":"D2","level":"warning","message":{"text":"uncertainty_budget.collect_warnings (cognitive 17): uncertainty_budget.collect_warnings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/uncertainty_budget.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be32fb9d5094a575329083b61a7e74924201a56fd4a70fc6c59c2b7bdb0c898"}},{"ruleId":"D2","level":"warning","message":{"text":"profiler_to_waypoint.parse_metaphlan (cognitive 17): profiler_to_waypoint.parse_metaphlan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/waypoint-bio/scripts/profiler_to_waypoint.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded12a7de52894c258a53e1ec0afa34723d58ae41e013a8b8e2be51eb429ad69"}},{"ruleId":"D2","level":"warning","message":{"text":"ignition_delay.run (cognitive 16): ignition_delay.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 3, loops 3, ternaries 2 (3 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/cantera/scripts/ignition_delay.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a285c69f7b7de5c671f3b8cda16b60317559d136f8146c3ccf25d3a4a2ac8fc"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.local_path (cognitive 16): _common.local_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82a21d30a174f333e6f772e6939078b00af077159f5489b1264f15a2d31dd09"}},{"ruleId":"D2","level":"warning","message":{"text":"check_contigs.main (cognitive 16): check_contigs.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (5 pts), boolean chains 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/check_contigs.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fdda459e09f62cc545d6d937e7dc3915e11f99df242979ab5c83e1ba57be0f"}},{"ruleId":"D2","level":"warning","message":{"text":"raster_workflows.classify_imagery (cognitive 16): raster_workflows.classify_imagery has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geomaster/scripts/raster_workflows.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b7211d703bcc3dc521ddead27796707d4e4eeac68e95989545192ff181b1b3"}},{"ruleId":"D2","level":"warning","message":{"text":"detect_resources._visibility_summary (cognitive 16): detect_resources._visibility_summary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (5 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":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"332e9a99c0acf5f7f4ddae1fde06de4b70a84e2b7857ffc1e8e5e74353cfb0ee"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.local_path (cognitive 16): _common.local_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gtars/scripts/_common.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2867ca77664455352b40e0b22395d4020e5a8ad76556ac0e80847d61be671fb"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.validate_run_config (cognitive 16): _common.validate_run_config has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efa67500836d93c8e6bb32ea1d066ac748d6abaccaa7362c97bc70ed3c5a1d8"}},{"ruleId":"D2","level":"warning","message":{"text":"notebook_operations._parse_manifest (cognitive 16): notebook_operations._parse_manifest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/labarchive-integration/scripts/notebook_operations.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e149d2abfdc2d7b98b90d71865fe3f0175409460e30c9f1b9827754cae7ba2ea"}},{"ruleId":"D2","level":"warning","message":{"text":"style_configurator.interactive_mode (cognitive 16): style_configurator.interactive_mode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matplotlib/scripts/style_configurator.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"853312508d185e5d0000ffbe86868619ac9b7c249b034add79066fcf95ab396d"}},{"ruleId":"D2","level":"warning","message":{"text":"process_1d.load_fid (cognitive 16): process_1d.load_fid has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nmrglue/scripts/process_1d.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f49eff9fbf1f77cadf8d4ad4eef3481874b3675d67f3a68be1ce325861172a4"}},{"ruleId":"D2","level":"warning","message":{"text":"reporting_lag.cohort_curve (cognitive 16): reporting_lag.cohort_curve has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (5 pts), error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathogen-variant-surveillance/scripts/reporting_lag.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c46854a01ad04cb26f463b3c27bedbd7a954522911417d6c366b1145282dc3"}},{"ruleId":"D2","level":"warning","message":{"text":"nca.summarise (cognitive 16): nca.summarise has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/nca.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c2114bf0911ba83c8c3b52ce1cbe869899faa6ffdb48e1cd03844f0f63358b"}},{"ruleId":"D2","level":"warning","message":{"text":"_manifest._validate_requirements (cognitive 16): _manifest._validate_requirements has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_manifest.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a6159aca38605bb0fba8a8f6ab9578654aad620306113c1e6cfcddcb99ac94"}},{"ruleId":"D2","level":"warning","message":{"text":"_manifest.validate_manifest_document (cognitive 16): _manifest.validate_manifest_document has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 2 (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":"skills/pptx-posters/scripts/_manifest.py"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c1074e627a06eeae0136a511caa8c08cd1083eb114736bd761e28c1a075868"}},{"ruleId":"D2","level":"warning","message":{"text":"pixel_frame_planner.parse_frame_selection (cognitive 16): pixel_frame_planner.parse_frame_selection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/pixel_frame_planner.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea1776b83f48eb21e51fc5e6980d6ba421c33af43f5c32911a079188a3154ca"}},{"ruleId":"D2","level":"warning","message":{"text":"_common.geometry_report (cognitive 16): _common.geometry_report has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pylabrobot/scripts/_common.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e40d9896e4c8c7381767065f554b7686d50388db583b116017b4a43b43eee5"}},{"ruleId":"D2","level":"warning","message":{"text":"artifact_manifest.main (cognitive 16): artifact_manifest.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2, boolean chains 1, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymatgen/scripts/artifact_manifest.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37d8e1c39f81dce83ec7c721376040c91fc0713f25e1f18bfd3fd03959cfd15"}},{"ruleId":"D2","level":"warning","message":{"text":"composition_structure_validator.main (cognitive 16): composition_structure_validator.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, error handling 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymatgen/scripts/composition_structure_validator.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3fb9afd8d9ebd2b49c054e4a2e906b6d372db4d1b740df5f5c5f4cdb3e4377"}},{"ruleId":"D2","level":"warning","message":{"text":"theoretical_spectrum.main (cognitive 16): theoretical_spectrum.main has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (8 pts), loops 4 (5 pts), if/else 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/theoretical_spectrum.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d0c05b0c86718ce233cc977a522fe71287023ce56c78ac341ca5d8b0f209aa"}},{"ruleId":"D2","level":"warning","message":{"text":"forecast_relsa.predict_endpoint (cognitive 16): forecast_relsa.predict_endpoint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/forecast_relsa.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"b296104931de7511a4749a054ffc43ab7bf4ae1a50b66e9a9a79d2064d7e3d62"}},{"ruleId":"D2","level":"warning","message":{"text":"figure_export._atomic_savefig (cognitive 16): figure_export._atomic_savefig has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), error handling 4 (5 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/figure_export.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2224ed1c2d7daf576379ffea69a123c8698d37e32451134ee336a27eaa7c47ca"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate_survival_metrics.validate_time_grid (cognitive 16): evaluate_survival_metrics.validate_time_grid has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 3, error handling 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scikit-survival/scripts/evaluate_survival_metrics.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6feb82fa88fe7eda04d4e2ab06837b446ec1c7dae2e6be4804c6060e3ca64a9f"}},{"ruleId":"D2","level":"warning","message":{"text":"power.mde (cognitive 16): power.mde has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/statistical-power/scripts/power.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d750f16e2f8ab39209cc0c409124348ae184b7a1bc3863dcb7c60dc20fa7027"}},{"ruleId":"D2","level":"warning","message":{"text":"forecast_csv.prepare_inputs (cognitive 16): forecast_csv.prepare_inputs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/timesfm-forecasting/scripts/forecast_csv.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e50a42baa1c8e73c70d08af16e7932638d16370b3ca8083b95e4967ed77e4c3"}},{"ruleId":"D2","level":"warning","message":{"text":"uncertainty_budget.build_budget (cognitive 16): uncertainty_budget.build_budget has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 2 (3 pts), boolean chains 2, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/uncertainty_budget.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a669543287fbf1d9d7d8afea4a8158fc59fac27413c09972a3c4fa742dd354"}},{"ruleId":"D2","level":"warning","message":{"text":"profiler_to_waypoint.matrix_to_waypoint (cognitive 16): profiler_to_waypoint.matrix_to_waypoint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/waypoint-bio/scripts/profiler_to_waypoint.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"178db30c70a10a66ecb6f8be6a471bdd6b84419b9083e0a3ed2a7dbee7c0269d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/arax_client.py: FileTooLong \u2014 1786 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1286 over it, 3.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5463a7bf19788f6f8ac483b638f11712ed2e699dfe03ba06733f4a0d8c8cd98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/detect_resources.py: FileTooLong \u2014 1593 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1093 over it, 3.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb9df46c456619ccf119bf32c98d8857c51a3bd04745acd813174c782117b5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/_pptx.py: FileTooLong \u2014 1213 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 713 over it, 2.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_pptx.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3d0a2c8d2d2bde4cdb2a5473c5929ab80ac0610b975b937f96fbf419b14494"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/_manifest.py: FileTooLong \u2014 1095 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 595 over it, 2.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_manifest.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32620b23aa3b2bd560414e374b13fa942285bbac968b2f72e9636c792ce69fc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/_common.py: FileTooLong \u2014 1052 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 552 over it, 2.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"817eb9470863856fae0d02fdf3f750aba69e3201d8e923bf2a2898d49591c5dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/research_lookup.py: FileTooLong \u2014 900 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 400 over it, 1.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/research-lookup/scripts/research_lookup.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe8de80dd34c207fa7714adaa26bac18a531989feb76b6e38b818652f41ce27"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/_common.py: FileTooLong \u2014 882 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 382 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/treatment-plans/scripts/_common.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fb8ed412e57ba51f8ea57ae47306958ca2b7571ef0ccb7eebd0d1dcca4fce1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/_common.py: FileTooLong \u2014 841 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 341 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/_common.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"133596b6ab8b5bb7e50479680f9206e6059ef6ea74803f1e64db3c24ceb4b342"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/validate_hypothesis_schema.py: FileTooLong \u2014 837 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 337 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/validate_hypothesis_schema.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f1974f4e63fe9060b71e45be8c7c5d29f0ec0a24bf2d59bc3723944c1751c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/_schema.py: FileTooLong \u2014 763 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 263 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_schema.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5bfc96cd93e0aa175d9577d2500c119fd4c0616f4ec69f1dae7ac77ea27893"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/_tabular.py: FileTooLong \u2014 759 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 259 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_tabular.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5871668d372561b9d5a5444bccb3aaed7e6728071deaa5058f91a395b79f49"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/_common.py: FileTooLong \u2014 721 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 221 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/_common.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"821e6a03e233e19778d586c8e7d8dd16198f5f895f73985f9a31064664b0e17f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/_common.py: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 173 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/_common.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d70fca6a8180a54e75c21b1b5bbc6c91058b2450799d5e921bcfadc7221cbcb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/check_plausibility.py: FileTooLong \u2014 667 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 167 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/check_plausibility.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fc9e299609685e782274f10f618eff30c375f2ef47ff6c1ef164a32a43903e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/validate_dxapp.py: FileTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 149 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/dnanexus-integration/scripts/validate_dxapp.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef19d79326599ccc1deca5a0daf4a82aa820d58f1416d6aa6086f72a8e8b4c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/image_metadata.py: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 126 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/image_metadata.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fac90c071afe3acae4ace885becb001362b58b8ce9b466c4904f3cfc5990e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/generate_infographic_ai.py: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 112 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafdebb00ee2a26c86b25e90bcc73d2db327cc695778145a85286a4c1c79b83f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/forecast_relsa.py: FileTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 110 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/forecast_relsa.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aece451b6071640b8434313ac46b3247874089da1f112cb47754ea0c71ca82d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/manuscript_packet.py: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 109 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/research-lookup/scripts/manuscript_packet.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa98162c43e6244ff61e6053b79bca338e92c8ba9da7651a5025be1b1ef7741"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/_common.py: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 101 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pylabrobot/scripts/_common.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0736c240d60c60360e3471e9e4d73ef85884aecf8aaffc01162d07f1c54b6aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/onekgpd_api.py: FileTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 100 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/onekgpd/scripts/onekgpd_api.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb49d40ed16b6237ebc6d94804fd108bbca80fb08b55f7475fbd061b8cac6904"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/plan_write_request.py: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 78 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/protocolsio-integration/scripts/plan_write_request.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cf74cad90fc239950cc5c8d53a946704e539cde91fd546f531156484e97002"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/propagate_uncertainty.py: FileTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 53 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/propagate_uncertainty.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"443c96eb596099a3e40c8a7fa58477f8294ecf07b826b041113d92373dd14fba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/figure_export.py: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 45 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/figure_export.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0cc30223ac93d8c3e8b61923c1e35e32e96d68d9d05af3735e7f4a81ef9cd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/_common.py: FileTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/_common.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa1e81e24678748405e18e25d5ef89b13b7672696be50e070367d4bdc6d7c7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/_common.py: FileTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/_common.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"043fee353eb819875ad7135310622b45894a77e4413655a4e9bdfb097ffbf3f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/check.py: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/lab-hardware-cad/scripts/check.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68562781f6f86c6a6c0d209a2cdb866622dc02d84fa66a137056c21239094fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (6 members, 58 shared lines): skills/infographics/scripts/generate_infographic_ai.py:776-922 | skills/latex-posters/scripts/generate_schematic_ai.py:376-534 | skills/literature-review/scripts/generate_schematic_ai.py:376-534 | skills/scientific-schematics/scripts/generate_schematic_ai.py:376-534 | skills/scientific-slides/scripts/generate_schematic_ai.py:376-534 | skills/scientific-slides/scripts/generate_slide_image_ai.py:400-526 \u2014 These 6 members are variants of one another: a block of 58 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4dc88c3a9b5033ae81f80813eb561213c83500a727ba2e97c455f8f6965c20"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 46 shared lines): skills/latex-posters/scripts/generate_schematic.py:89-196 | skills/literature-review/scripts/generate_schematic.py:89-196 | skills/scientific-schematics/scripts/generate_schematic.py:89-196 | skills/scientific-slides/scripts/generate_schematic.py:89-196 | skills/scientific-slides/scripts/generate_slide_image.py:92-194 \u2014 These 5 members are variants of one another: a block of 46 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b94299ce103167c9641a3a94435de3aac73d3c4df90e3714e3e05f9b6aed27"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (24 shared lines): skills/pyopenms/scripts/detect_features_centroided.py:49-81 | skills/pyopenms/scripts/detect_features_metabo.py:69-109 \u2014 These two members are variants of one another: 24 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":"skills/pyopenms/scripts/detect_features_centroided.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d5f44646130e37267f3b17d0c2f5e1163398dc23e279d0f40c70f4c2ae7b98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): skills/infographics/scripts/generate_infographic_ai.py:708-746 | skills/infographics/scripts/generate_infographic_ai.py:932-970 \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":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a07fcd132ab66d78497f9ba2a495e62467d5f4272977dd341fc05ff679be25"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (14 members, 50\u002B identical tokens): scripts/generate_skill_image.py:396-424 | skills/generate-image/scripts/generate_image.py:98-140 | skills/infographics/scripts/generate_infographic.py:57-90 | skills/infographics/scripts/generate_infographic_ai.py:116-150 | skills/latex-posters/scripts/generate_schematic.py:44-77 | skills/latex-posters/scripts/generate_schematic_ai.py:114-148 | skills/literature-review/scripts/generate_schematic.py:44-77 | skills/literature-review/scripts/generate_schematic_ai.py:114-148 | skills/scientific-schematics/scripts/generate_schematic.py:44-77 | skills/scientific-schematics/scripts/generate_schematic_ai.py:114-148 | skills/scientific-slides/scripts/generate_schematic.py:44-77 | skills/scientific-slides/scripts/generate_schematic_ai.py:114-148 | skills/scientific-slides/scripts/generate_slide_image.py:47-80 | skills/scientific-slides/scripts/generate_slide_image_ai.py:127-161 \u2014 These 14 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 14 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 14 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate_skill_image.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f96bb2ef06aee02c75e60d3ea1ade563a500e386befc78d8025a6a5956c611"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): skills/exploratory-data-analysis/scripts/_common.py:255-280 | skills/fluidsim/scripts/_common.py:321-339 | skills/neurokit2/scripts/_common.py:192-218 | skills/pathml/scripts/_common.py:233-253 | skills/pydicom/scripts/_common.py:629-645 | skills/qutip/scripts/_common.py:322-345 | skills/scientific-visualization/scripts/_common.py:73-100 | skills/scikit-survival/scripts/_common.py:168-185 | skills/simpy/scripts/_common.py:130-147 | skills/uncertainty-and-units/scripts/_common.py:253-270 \u2014 These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_common.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1f61811a0c3165665208dd52cd3c9779207ec6b8cbf02c91857066468ff01c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): skills/exploratory-data-analysis/scripts/capability_manifest.py:30-77 | skills/exploratory-data-analysis/scripts/distribution_sensitivity.py:21-69 | skills/exploratory-data-analysis/scripts/eda_analyzer.py:50-113 | skills/exploratory-data-analysis/scripts/image_inspector.py:29-53 | skills/exploratory-data-analysis/scripts/missingness_leakage_audit.py:21-80 | skills/exploratory-data-analysis/scripts/sequence_inspector.py:32-68 | skills/exploratory-data-analysis/scripts/tabular_profile.py:22-65 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/capability_manifest.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"08aae836c4f3c85aa1aefa58857df71d4df5a7626e1c85c229e445fbd3194e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): skills/hypogenic/scripts/_common.py:1276-1291 | skills/neurokit2/scripts/_common.py:222-239 | skills/pathml/scripts/_common.py:203-222 | skills/qutip/scripts/_common.py:293-313 | skills/scikit-survival/scripts/_common.py:189-208 | skills/simpy/scripts/_common.py:151-170 | skills/uncertainty-and-units/scripts/_common.py:274-293 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"920907aa489813e7e3e5e725ed5ce7d061aada8b6267426918d733431f05f6e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): skills/clinical-reports/scripts/check_deidentification.py:289-300 | skills/clinical-reports/scripts/consistency_checker.py:373-389 | skills/clinical-reports/scripts/provenance_validator.py:251-262 | skills/clinical-reports/scripts/terminology_validator.py:261-273 | skills/clinical-reports/scripts/validate_case_report.py:263-274 | skills/clinical-reports/scripts/validate_trial_report.py:519-530 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/check_deidentification.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"201d67675b0aeca7dec513dbc957e58c11cd5adf263f48173d22387f863a14ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): skills/infographics/scripts/generate_infographic_ai.py:620-651 | skills/latex-posters/scripts/generate_schematic_ai.py:255-286 | skills/literature-review/scripts/generate_schematic_ai.py:255-286 | skills/scientific-schematics/scripts/generate_schematic_ai.py:255-286 | skills/scientific-slides/scripts/generate_schematic_ai.py:255-286 | skills/scientific-slides/scripts/generate_slide_image_ai.py:283-314 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea0ad7da8364bb70269175d1b203dafe5063e06d6fc3834ee2e01bc779f5c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): skills/infographics/scripts/generate_infographic_ai.py:662-682 | skills/latex-posters/scripts/generate_schematic_ai.py:297-317 | skills/literature-review/scripts/generate_schematic_ai.py:297-317 | skills/scientific-schematics/scripts/generate_schematic_ai.py:297-317 | skills/scientific-slides/scripts/generate_schematic_ai.py:297-317 | skills/scientific-slides/scripts/generate_slide_image_ai.py:325-345 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fa67a9c26a74bdabf08382a003f0105a3961d7e43879aa080a2208af80355b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): skills/infographics/scripts/generate_infographic_ai.py:990-1230 | skills/latex-posters/scripts/generate_schematic_ai.py:564-754 | skills/literature-review/scripts/generate_schematic_ai.py:564-754 | skills/scientific-schematics/scripts/generate_schematic_ai.py:564-754 | skills/scientific-slides/scripts/generate_schematic_ai.py:564-754 | skills/scientific-slides/scripts/generate_slide_image_ai.py:547-735 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ea717ddf7dd91beff85dba442e1ce328ecfed3cdbab5128bdcbc0092056031"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): skills/pptx-posters/scripts/_common.py:52-73 | skills/qutip/scripts/_common.py:80-99 | skills/scientific-visualization/scripts/_common.py:26-40 | skills/scikit-survival/scripts/_common.py:115-134 | skills/simpy/scripts/_common.py:77-96 | skills/uncertainty-and-units/scripts/_common.py:200-219 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_common.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"345b6563ab9fea219ab6f9c327a6b1875ceec75e04b76af3c28a029d6b0b9352"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): skills/neurokit2/scripts/_common.py:301-308 | skills/pathml/scripts/_common.py:315-324 | skills/pptx-posters/scripts/_common.py:211-220 | skills/qutip/scripts/_common.py:155-164 | skills/simpy/scripts/_common.py:255-264 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"1096a4455e02256e0c891f91a2349c9c4df4e26f6f8b39057278c967ec8cbaca"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): skills/neurokit2/scripts/_common.py:332-341 | skills/pathml/scripts/_common.py:350-361 | skills/pptx-posters/scripts/_common.py:257-267 | skills/qutip/scripts/_common.py:191-205 | skills/simpy/scripts/_common.py:291-305 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"8047e90452d94a77fecd3612ccffd8b2e1f18f71d14950f0fba9bc4cdbdaf9c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): skills/citation-management/scripts/extract_metadata.py:658-740 | skills/citation-management/scripts/search_google_scholar.py:163-262 | skills/citation-management/scripts/search_openalex.py:266-321 | skills/citation-management/scripts/search_pubmed.py:302-430 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/extract_metadata.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b77b6a5c830090b32d53314cb8f180a138846deb3b2f116177b81255847c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): skills/flowio/scripts/inspect_fcs.py:414-426 | skills/pysam/scripts/alignment_qc.py:293-305 | skills/pysam/scripts/inspect_hts.py:453-465 | skills/pysam/scripts/variant_summary.py:333-345 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/flowio/scripts/inspect_fcs.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd7c760e5f674a936acc445e1828f3e8989e0c5e2132d991cbd7f96d488cdd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): skills/flowio/scripts/inspect_fcs.py:430-461 | skills/pysam/scripts/alignment_qc.py:309-333 | skills/pysam/scripts/inspect_hts.py:469-493 | skills/pysam/scripts/variant_summary.py:349-373 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/flowio/scripts/inspect_fcs.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc20f8920ad87ff5563110a2ff9b9567e311ac985ebea7589497de88db2ca3f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): skills/geniml/scripts/consensus_plan.py:34-95 | skills/geniml/scripts/embedding_plan.py:33-101 | skills/gtars/scripts/coverage_preflight.py:32-109 | skills/gtars/scripts/execution_plan.py:34-113 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/consensus_plan.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"57708e5466cc9e2f64cd8c5f9fe094f8aa016271fe2bf7e27943e41238d4eb95"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): skills/hypothesis-generation/scripts/_common.py:389-408 | skills/market-research-reports/scripts/_common.py:288-309 | skills/peer-review/scripts/_common.py:350-369 | skills/pytdc/scripts/_common.py:175-205 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edd7c0407071259351cc34e5d61222ddf0e1c046f0c6ceed437614518acdc04"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): skills/latex-posters/scripts/generate_schematic_ai.py:320-343 | skills/literature-review/scripts/generate_schematic_ai.py:320-343 | skills/scientific-schematics/scripts/generate_schematic_ai.py:320-343 | skills/scientific-slides/scripts/generate_schematic_ai.py:320-343 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d284fd0eff09d279b01678752b30e2f56633f7dddb40f4f6fac547b123d27b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): skills/latex-posters/scripts/generate_schematic_ai.py:346-371 | skills/literature-review/scripts/generate_schematic_ai.py:346-371 | skills/scientific-schematics/scripts/generate_schematic_ai.py:346-371 | skills/scientific-slides/scripts/generate_schematic_ai.py:346-371 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2293a17c5cb450e72d52aafef039f2190b092e1279f204727649e9fcd15f17"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): skills/neurokit2/scripts/_common.py:270-291 | skills/pathml/scripts/_common.py:284-305 | skills/qutip/scripts/_common.py:129-145 | skills/simpy/scripts/_common.py:209-227 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fb14af14d4ee894d906f8613b67dd7b12528eb2df478faebdb3780792281f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): skills/ontology-term-resolution/scripts/lookup_prefix.py:148-161 | skills/ontology-term-resolution/scripts/map_terms.py:136-149 | skills/ontology-term-resolution/scripts/resolve_terms.py:161-175 | skills/ontology-term-resolution/scripts/validate_terms.py:218-232 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/lookup_prefix.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f13f59de51927ed87a634ab2e017e3297e76be20f8adc16a709fc79434bcc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): skills/scholar-evaluation/scripts/calculate_scores.py:25-40 | skills/scholar-evaluation/scripts/check_traceability.py:197-214 | skills/scholar-evaluation/scripts/generate_report_scaffold.py:187-214 | skills/scholar-evaluation/scripts/summarize_agreement.py:241-255 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/calculate_scores.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a76a41913beafe5b428fa3715a75deb638d5bd42fa18d2d3abf81b108787119"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): skills/pymc/assets/hierarchical_model_template.py:56-105 | skills/pymc/assets/linear_regression_template.py:41-90 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymc/assets/hierarchical_model_template.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b1de5c81e52e6534d12fd804f64df5c243d2f0fa77030bc11750e72db7fa16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): skills/hypothesis-generation/scripts/_common.py:159-207 | skills/peer-review/scripts/_common.py:124-180 \u2014 These two members are one piece of code written twice and then edited apart: 49 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":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f238caca51a99003e3ed320e5e89cf17f4f4edd19b287cb9bb2c3bbee4507d88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): skills/ontology-term-resolution/scripts/map_terms.py:191-229 | skills/ontology-term-resolution/scripts/resolve_terms.py:212-260 \u2014 These two members are one piece of code written twice and then edited apart: 39 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":"skills/ontology-term-resolution/scripts/map_terms.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fe1e9d0a06b728aa911a397641b18025e8324832e6b0ae2a222d844744c324"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): skills/pymatgen/scripts/composition_structure_validator.py:241-297 | skills/pymatgen/scripts/structure_analyzer.py:242-290 \u2014 These two members are one piece of code written twice and then edited apart: 49 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":"skills/pymatgen/scripts/composition_structure_validator.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e371fa231eb630e7171d3e8d91bf2e12b674f43b287bedb8060df7f440a491"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): skills/analytical-method-validation/scripts/_common.py:60-91 | skills/simpy/scripts/_common.py:325-372 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/_common.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ac235dd0158f0bdd331bab354d411e13d658fd3b134e5244c117625b60b4d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): skills/ncats-arax/scripts/arax_client.py:615-666 | skills/ncats-arax/scripts/arax_client.py:670-713 \u2014 These two members are one piece of code written twice and then edited apart: 44 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":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db721510c9b5db38bda0b028e6c762c6f5264f3bf57827098dce758b81d95d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 32\u002B corresponding lines): skills/exploratory-data-analysis/scripts/_common.py:192-223 | skills/neurokit2/scripts/_common.py:150-181 | skills/pathml/scripts/_common.py:165-199 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 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":"skills/exploratory-data-analysis/scripts/_common.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"92adeb1203e4ec369937cbcb2700fb638db9ccdc86ae9bab4fef9f79909458a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): skills/fluidsim/scripts/_common.py:441-483 | skills/pydicom/scripts/_common.py:514-550 \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":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcae3f67a35d611a348a4f11303c85c202581088e0c1d27924ea8ebec4d5cfb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): skills/geniml/scripts/_common.py:165-203 | skills/gtars/scripts/_common.py:159-199 \u2014 These two members are one piece of code written twice and then edited apart: 39 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":"skills/geniml/scripts/_common.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d221155647237bbb16dbe3499def1571a64c0d1c52e3f41424ea3705233716e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): skills/neurokit2/scripts/ecg_hrv_pipeline.py:68-101 | skills/neurokit2/scripts/eda_pipeline.py:54-96 | skills/neurokit2/scripts/plan_epochs.py:189-222 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 34 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":"skills/neurokit2/scripts/ecg_hrv_pipeline.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff07d3d84327cfd1108b54f1fbf2e3116595d0fe3eea4bfbc86c6dceb203ca4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): skills/statistical-power/scripts/simulate_power.py:232-266 | skills/statistical-power/scripts/simulate_power.py:271-298 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/statistical-power/scripts/simulate_power.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2fd99d61f7ea9c419025fb91dec7c4458f1b2ad9666d5714489fdc288e2910"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): skills/fluidsim/scripts/_common.py:248-282 | skills/pydicom/scripts/_common.py:413-438 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c3da75fea4314c5533e7f9d257c5140d56c44592b543f43ff1f47537e4f712"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): skills/scikit-survival/scripts/_common.py:143-164 | skills/simpy/scripts/_common.py:105-126 | skills/uncertainty-and-units/scripts/_common.py:228-249 \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":"skills/scikit-survival/scripts/_common.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cf2b31e9c2f21ea683b34f70876c314c265022c7e778071a26bd59394bbbaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): skills/exploratory-data-analysis/scripts/_common.py:152-182 | skills/neurokit2/scripts/_common.py:113-140 | skills/pathml/scripts/_common.py:127-155 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 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":"skills/exploratory-data-analysis/scripts/_common.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a93232768d9f8574cc0f1849d3542b78006b7def0626b48d0fea1d7c58305c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): skills/geniml/scripts/_common.py:309-338 | skills/gtars/scripts/_common.py:270-301 \u2014 These two members are one piece of code written twice and then edited apart: 30 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":"skills/geniml/scripts/_common.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb06ee4169369ab36d1bccd61bd0a922e4b7cfaf23656215aad00e4f96892a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): skills/fluidsim/scripts/budget_summary.py:375-411 | skills/fluidsim/scripts/output_inventory.py:309-349 \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":"skills/fluidsim/scripts/budget_summary.py"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4180d979adb917e20777083b5f86c31873acad08e2fcc095956a610d1c7b3a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): skills/pufferlib/scripts/benchmark_vectorization.py:208-240 | skills/pufferlib/scripts/repro_plan.py:140-173 \u2014 These two members are one piece of code written twice and then edited apart: 33 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":"skills/pufferlib/scripts/benchmark_vectorization.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"58284bd36b3f7d1870581a61fd3df05679465571546d13f55b0ad312253fd43a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): skills/opentrons-integration/scripts/basic_protocol_template.py:22-68 | skills/opentrons-integration/scripts/ot2_basic_protocol_template.py:22-63 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/opentrons-integration/scripts/basic_protocol_template.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe5e540f9af24951c300a956ed8ca03a6ba3ad1c627acfa313b8aa6f1a43464"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): skills/research-lookup/scripts/research_lookup.py:744-797 | skills/research-lookup/scripts/research_lookup.py:800-865 \u2014 These two members are one piece of code written twice and then edited apart: 54 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":"skills/research-lookup/scripts/research_lookup.py"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efc3727a9ddaa93c51747d0a523d0720cd1b1af969ec4c037ec2317a9ded170"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): skills/simpy/scripts/resource_monitor.py:150-176 | skills/simpy/scripts/resource_monitor.py:342-368 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/simpy/scripts/resource_monitor.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc695479eff5f439581b60fbcc8b1f61c4dd7a4e4b487a24a8bcfebaeaa04bc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 24\u002B corresponding lines): skills/pydicom/scripts/deidentification_audit.py:344-376 | skills/pydicom/scripts/extract_metadata.py:301-335 | skills/pydicom/scripts/pixel_frame_planner.py:286-309 | skills/pydicom/scripts/transfer_syntax_inspector.py:217-241 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/deidentification_audit.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ac33156a8ec1285406c051191045d1c4ada40f8282ed13915356634765b2bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): skills/clinical-reports/scripts/_common.py:42-61 | skills/hypothesis-generation/scripts/_common.py:53-73 | skills/market-research-reports/scripts/_common.py:30-49 | skills/peer-review/scripts/_common.py:40-59 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/_common.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"14970c6c959c8e51d2d110f378426d54dbc832ac4bb2fccf8468dbf2db964fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): skills/pathogen-variant-surveillance/scripts/lapis_client.py:766-776 | skills/pkpd-modeling/scripts/_common.py:225-237 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathogen-variant-surveillance/scripts/lapis_client.py"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0848daa1bbf26c25678daccb780b6341620b74fd5ec44ab4b7440e070cd8505"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): skills/pptx-posters/scripts/_common.py:81-97 | skills/scientific-visualization/scripts/_common.py:49-69 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_common.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbce341c21da494c33e062f1419792884099f4454e286f1f36a9d5dda71cfaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): skills/genomic-coordinates/scripts/convert_coords.py:129-144 | skills/ontology-term-resolution/scripts/map_terms.py:153-187 | skills/ontology-term-resolution/scripts/resolve_terms.py:179-208 | skills/ontology-term-resolution/scripts/validate_terms.py:236-263 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/convert_coords.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59be66a888032755cb620b9a01387b5c78e2e1656af76197f4d739445c4af8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): skills/infographics/scripts/generate_infographic_ai.py:749-770 | skills/scientific-slides/scripts/generate_slide_image_ai.py:368-395 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4285a9deeec11f84faf79f87484a05c96da88a33cfcbdca1f3e2c9a252be6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): skills/onekgpd/scripts/onekgpd_api.py:360-393 | skills/onekgpd/scripts/onekgpd_api.py:491-523 \u2014 These two members are one piece of code written twice and then edited apart: 33 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":"skills/onekgpd/scripts/onekgpd_api.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9a53927d5497637461bd101b0090c713ba2b89e81b34fc707ec834314b09f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): skills/iso-standards-readiness/scripts/check_traceability.py:43-61 | skills/iso-standards-readiness/scripts/validate_evidence_manifest.py:68-84 | skills/iso-standards-readiness/scripts/validate_scope_intake.py:35-54 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 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":"skills/iso-standards-readiness/scripts/check_traceability.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"52270c8773a1764e6118d2da864689263362723ec1fd5fa922a9d7fc80fea5d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): skills/pytorch-lightning/scripts/quick_trainer_setup.py:70-118 | skills/pytorch-lightning/scripts/quick_trainer_setup.py:131-181 \u2014 These two members are one piece of code written twice and then edited apart: 49 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":"skills/pytorch-lightning/scripts/quick_trainer_setup.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"88dad25241093b2db5fe60885ba9e593601d8b2725933cc713298696ada0ce8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): skills/qutip/scripts/_common.py:235-252 | skills/qutip/scripts/convergence_sweep.py:28-48 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qutip/scripts/_common.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9297d307a2b8bfac88d69bfa98ee620d0bcb800462fe374c81dfd27f9527580b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): skills/protocolsio-integration/scripts/plan_write_request.py:161-174 | skills/pufferlib/scripts/_common.py:174-186 | skills/treatment-plans/scripts/_common.py:1132-1147 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 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":"skills/protocolsio-integration/scripts/plan_write_request.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"13043a9180b3a0da82b20e41c485ac0a549a192a731dea03e9b45022018c54da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): scripts/generate_skill_image.py:639-653 | skills/generate-image/scripts/generate_image.py:476-498 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate_skill_image.py"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e573e5451a7b70c18bec11d447388b0f454da01240f80300d28b1071fb622c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): skills/analytical-method-validation/scripts/_common.py:95-110 | skills/simpy/scripts/_common.py:376-390 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/_common.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"653feed271eef0eaf47f8522826d8caa0b12b0fe3a2f60bd48923104d5bd26d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): skills/clinical-decision-support/scripts/deidentification_checklist.py:235-256 | skills/clinical-decision-support/scripts/evidence_profile_check.py:237-259 | skills/clinical-decision-support/scripts/survival_plan_validator.py:266-290 | skills/clinical-decision-support/scripts/validate_cds_artifact.py:240-265 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/deidentification_checklist.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c51f6ebeca1d7e1d548f32656d6a1e1db03f8950eef75fa92e79c100f103b47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): skills/pufferlib/scripts/env_contract_validator.py:177-194 | skills/pufferlib/scripts/env_template.py:195-206 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pufferlib/scripts/env_contract_validator.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dade2ec184131ff3722fd6de5cd45be2bd7a269b5f563c1775ec9472f096168"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): skills/protocolsio-integration/scripts/_common.py:347-368 | skills/protocolsio-integration/scripts/_common.py:377-397 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/protocolsio-integration/scripts/_common.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd771e41705874fd4a8ad1f0c8c2bda2cb47d500fee9d6354a7b7b32441beac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): skills/geniml/scripts/embedding_plan.py:105-118 | skills/geniml/scripts/tokenizer_compatibility.py:129-143 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/embedding_plan.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47f03b91b94309d4d6ef12723904309ebb915b963f3915877c659e7418dee32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): skills/market-research-reports/scripts/audit_claim_citations.py:88-107 | skills/market-research-reports/scripts/validate_evidence_ledger.py:130-142 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/market-research-reports/scripts/audit_claim_citations.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9125d9d0af0711fbd4061be8a61d7f9e974a39cc7dfd177d4805dcdbc65459b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): skills/iso-standards-readiness/scripts/gap_analyzer.py:143-173 | skills/iso-standards-readiness/scripts/validate_evidence_manifest.py:213-242 \u2014 These two members are one piece of code written twice and then edited apart: 30 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":"skills/iso-standards-readiness/scripts/gap_analyzer.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"448720fd77e8fe55c04b47ce45e05a0b8af3a57bea7d24f0cf0e2781389c7388"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): skills/pytorch-lightning/scripts/template_lightning_module.py:63-88 | skills/pytorch-lightning/scripts/template_lightning_module.py:91-110 | skills/pytorch-lightning/scripts/template_lightning_module.py:113-132 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 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":"skills/pytorch-lightning/scripts/template_lightning_module.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f09bf3658b9f7f9e7d692483b21c1d16257537f96d9e8ccb88e9394e5f600b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): scripts/generate_skill_image.py:571-586 | skills/generate-image/scripts/generate_image.py:144-165 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate_skill_image.py"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fac4020bad46c8213eed1ea4ba9d37ad604dcf920d59fbcaf98d75622523571"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): skills/genomic-coordinates/scripts/check_contigs.py:121-131 | skills/genomic-coordinates/scripts/check_contigs.py:149-165 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/check_contigs.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad06e9e3988cd6fd1af38084010a6be9651ff222f272a521a2c5baf20fee37f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): skills/clinical-decision-support/scripts/_common.py:128-140 | skills/clinical-decision-support/scripts/validate_cds_artifact.py:62-72 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/_common.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7133c4e30822e653008b27ec9a75335d9d8d67d18fefeb24d74411b547034484"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): skills/fluidsim/scripts/budget_summary.py:359-371 | skills/fluidsim/scripts/output_inventory.py:292-305 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/budget_summary.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a58e47fa24bdd789301772047cecf30360a2ed8977e08f9b0ee1b8522586d67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): skills/pybamm/scripts/simulate_battery.py:204-210 | skills/tellurium/scripts/kinetic_experiment.py:199-205 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pybamm/scripts/simulate_battery.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bf99cb2f1d7428cee0e8cc5c66f8f5b7c8fd3cefd6673ec3d4fff4bba7b306"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/genomic-coordinates/scripts/audit_intervals.py:83-92 | skills/genomic-coordinates/scripts/check_contigs.py:72-80 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/audit_intervals.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7d40c2eda499740a4cb960fb682c53011e3bef71c60cd57b6095a022808e61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): skills/hypogenic/scripts/_common.py:1238-1251 | skills/matlab/scripts/_common.py:222-232 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"936ed01dd1cacc6e16a0240c59d6af45c3e72078cc7a6af100512d182519667a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 35\u002B corresponding lines): skills/hypothesis-generation/scripts/audit_evidence_ledger.py:69-131 | skills/hypothesis-generation/scripts/validate_hypothesis_schema.py:127-184 | skills/hypothesis-generation/scripts/validate_hypothesis_schema.py:188-244 | skills/hypothesis-generation/scripts/validate_hypothesis_schema.py:248-306 | skills/hypothesis-generation/scripts/validate_hypothesis_schema.py:356-390 | skills/hypothesis-generation/scripts/validate_hypothesis_schema.py:394-436 | skills/hypothesis-generation/scripts/validate_prediction_matrix.py:44-108 | skills/peer-review/scripts/validate_claim_evidence.py:68-124 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 35 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/audit_evidence_ledger.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42324cb6a8e552ff620fff194f72bc5852ec79f7a17afee8d8ec545ff287523"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): skills/pathml/scripts/image_qc.py:95-113 | skills/pathml/scripts/slide_manifest.py:285-311 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathml/scripts/image_qc.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fd1b4428b317f9d67de06d897f489218a839981b853baf8b673a54a4f15a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): scripts/generate_skill_image.py:971-989 | skills/generate-image/scripts/generate_image.py:420-445 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate_skill_image.py"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c238746044a2b9266115ec91803a7b86e838ce0a368014d4eef41280674c51e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): skills/clinical-reports/scripts/_common.py:189-202 | skills/hypogenic/scripts/_common.py:383-393 | skills/pylabrobot/scripts/_common.py:169-179 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/_common.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"758f5e16cf426a48a2614d62bdd2db8f84f13043833720c17b3c2850a42b9f36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): skills/qutip/scripts/qobj_model_validator.py:109-141 | skills/qutip/scripts/two_level_simulation.py:151-183 \u2014 These two members are one piece of code written twice and then edited apart: 33 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":"skills/qutip/scripts/qobj_model_validator.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"923a8b842150453ea7096890a4cdd6faa0287587af02fe417fc146a5b1b45395"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): skills/pptx-posters/scripts/check_palette.py:121-138 | skills/pptx-posters/scripts/inventory_images.py:236-248 | skills/pptx-posters/scripts/plan_export.py:194-206 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 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":"skills/pptx-posters/scripts/check_palette.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"012fe1d90117aeeb28aeb5652b155a938473af6d190e6cf7f658eb9bec41a7b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): skills/iso-standards-readiness/scripts/_common.py:311-324 | skills/treatment-plans/scripts/_common.py:899-913 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/_common.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"003b367c1d55a40d3ced9af8df4f4189e9e4bac10198c0d7e94bf9ec8a8f33f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): skills/labarchive-integration/scripts/entry_operations.py:238-266 | skills/labarchive-integration/scripts/entry_operations.py:272-303 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"skills/labarchive-integration/scripts/entry_operations.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d5c0308638646629001e538038a513be7d26cda391cb5ba98f5e93248cb7e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/clinical-decision-support/scripts/_common.py:174-182 | skills/clinical-reports/scripts/consistency_checker.py:57-65 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/_common.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bdb81a6d5005402900571ccb42615ab3f94a0ce93a65bb3a80c14481d35da4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): skills/pymatgen/scripts/composition_structure_validator.py:97-108 | skills/pymatgen/scripts/structure_analyzer.py:27-34 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymatgen/scripts/composition_structure_validator.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"144f7f536ba7342dd71c89c1aed202d3447cab410f1e13ac13fc93e7a5650eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): skills/fluidsim/scripts/_common.py:217-230 | skills/pydicom/scripts/_common.py:385-396 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d7a0242fdf59fecdd8dae0192aec338409440e26063e1cc60ba8f85c829218"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): skills/pytdc/scripts/cache_audit.py:130-142 | skills/scientific-brainstorming/scripts/evaluate_matrix.py:534-549 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pytdc/scripts/cache_audit.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1c3a572be72e0794e941ffb07f9754c2a06ce5e0ead2cf1f894d62424c359e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): skills/dnanexus-integration/scripts/inspect_dxpy.py:177-189 | skills/latchbio-integration/scripts/inspect_latch_sdk.py:173-185 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/dnanexus-integration/scripts/inspect_dxpy.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d436685f4dd48a71dd51c431fadf532af32ea38022b12c8815d9f75ab3c1bd75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/pufferlib/scripts/_common.py:43-52 | skills/pydicom/scripts/_common.py:306-314 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pufferlib/scripts/_common.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0b383cee6efa32458e6473a1400e7adb9a410bd379efdde2e7d81f7d67d73e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): skills/pytdc/scripts/_common.py:162-171 | skills/scikit-survival/scripts/_common.py:248-259 \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":"skills/pytdc/scripts/_common.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54cb14908241f5ef5dfb87d985e2b83c85cc329455d22151d1105e768c640e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): skills/treatment-plans/scripts/_common.py:666-679 | skills/treatment-plans/scripts/_common.py:683-697 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/treatment-plans/scripts/_common.py"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"870cea177e60af21bdf86573db5bcc0d7ee37b1f7af1049b67f669842a711651"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/exploratory-data-analysis/scripts/_common.py:76-91 | skills/hypogenic/scripts/_common.py:89-97 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_common.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"144d92deda929c4c07b975b33486c0a09481f296cadfe7ef807c5848495d90fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): skills/exploratory-data-analysis/scripts/_common.py:405-420 | skills/fluidsim/scripts/_common.py:356-370 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_common.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9888b4e29aa8d393ead7b2e2d4bee11559686dc45b831de3b5ba6a207d69c68a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): skills/citation-management/scripts/extract_metadata.py:432-446 | skills/citation-management/scripts/validate_citations.py:576-590 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/extract_metadata.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d48676c156b28c73d26a6f089d3cdd3cae3cdcc88849449f264671cc40aae5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 31\u002B corresponding lines): skills/exploratory-data-analysis/scripts/distribution_sensitivity.py:73-109 | skills/exploratory-data-analysis/scripts/image_inspector.py:183-217 | skills/exploratory-data-analysis/scripts/missingness_leakage_audit.py:84-122 | skills/exploratory-data-analysis/scripts/sequence_inspector.py:217-247 | skills/exploratory-data-analysis/scripts/tabular_profile.py:69-101 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 31 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/distribution_sensitivity.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d8a2f5554d1795766bdd7ebcb4081cb07ba79b124f2c24b740d66ea071e2c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): skills/get-available-resources/scripts/accelerator_diagnostics.py:135-147 | skills/get-available-resources/scripts/detect_resources.py:1875-1884 \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":"skills/get-available-resources/scripts/accelerator_diagnostics.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde10e855c713879ede2d41b078861664c474a59cdafb68caddfda1a4770a6e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): skills/pathml/scripts/_common.py:365-374 | skills/scikit-survival/scripts/_common.py:81-92 | skills/scikit-survival/scripts/_common.py:96-106 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 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":"skills/pathml/scripts/_common.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dacab1a4d5c310daabcbc0b31702c3bea2926299654f63b9291df81d93f7c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): skills/medchem/scripts/filter_molecules.py:94-101 | skills/medchem/scripts/filter_molecules.py:105-115 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/medchem/scripts/filter_molecules.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a612ba610874b1a330b5638b1d7c424f6669a89cdaa066015d6cbcd35cc61f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): skills/protocolsio-integration/scripts/pagination_helper.py:93-99 | skills/protocolsio-integration/scripts/validate_protocol_json.py:103-109 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/protocolsio-integration/scripts/pagination_helper.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcda295ba8fc8d5843bb41fbb7124462a859d04ade16b44cf401c7439d810e11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): skills/pufferlib/scripts/train_template.py:251-292 | skills/pufferlib/scripts/validate_plan.py:550-573 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pufferlib/scripts/train_template.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e39c7d86c688d700855e1aed3faba0ee07ae9392694ca318acf2b9840863ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/pylabrobot/scripts/generate_simulation_plan.py:93-136 | skills/pylabrobot/scripts/plan_transfers.py:47-55 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pylabrobot/scripts/generate_simulation_plan.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df748496534c47ea38002b133fa942162b42f28132a0b80947e11542a715633"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): skills/scholar-evaluation/scripts/calculate_scores.py:44-53 | skills/scholar-evaluation/scripts/check_process.py:220-227 | skills/scholar-evaluation/scripts/check_traceability.py:218-229 | skills/scholar-evaluation/scripts/summarize_agreement.py:259-268 | skills/scholar-evaluation/scripts/weight_sensitivity.py:255-266 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/calculate_scores.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0511b686d22f0bbcb07551761652cc4311731408876860dbf5bcdf5310f2203"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): skills/scholar-evaluation/scripts/check_process.py:202-216 | skills/scholar-evaluation/scripts/validate_rubric.py:28-39 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/check_process.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8558abf8b86b8cff69d6537d6cd6d46b187971b275d44c734a1ba1dc28b8064b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): skills/fluidsim/scripts/_common.py:422-431 | skills/pathml/scripts/_common.py:378-387 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc74659909a043c527b2666ae76a2a1002b76527bb3317261dbb83c268637dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): skills/geniml/scripts/_common.py:207-221 | skills/gtars/scripts/_common.py:203-217 | skills/protocolsio-integration/scripts/plan_write_request.py:404-417 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"20429f4fa6c96493cd8663fe9fe1aff220d960657e8dda05ea65a2062961d608"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): skills/uncertainty-and-units/scripts/convert_units.py:294-301 | skills/uncertainty-and-units/scripts/format_result.py:311-323 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/convert_units.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c91fcc89dfa3022512be6421a6bead85ef42f429459c596f8a70075ff11e6d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): skills/fluidsim/scripts/_common.py:183-194 | skills/pydicom/scripts/_common.py:355-362 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ab341f1d7323b6f0fae24279f7a7e238b7abebde399cf8489453eafb56117e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): skills/alphagenome/scripts/atlas_query.py:256-267 | skills/alphagenome/scripts/score_variants.py:88-99 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/alphagenome/scripts/atlas_query.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"123557997ba2e50e157daa15f905a1af0b2cab3756e822d2b675f82a0f6ebd55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): skills/hypogenic/scripts/_common.py:411-416 | skills/uncertainty-and-units/scripts/_common.py:155-162 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab5ff0ac9245f0675bf6a7acbb15430c1bf5e00a8952ff6ca6e0cfef9a4a5b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): skills/hypothesis-generation/scripts/generate_preregistration_scaffold.py:370-379 | skills/peer-review/scripts/generate_review_scaffold.py:68-77 \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":"skills/hypothesis-generation/scripts/generate_preregistration_scaffold.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6033bf482bb00478fdfb502f2cbdf338fb0c9d824b759ceb7497b270e1b45e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): skills/rdkit/scripts/similarity_search.py:142-157 | skills/rdkit/scripts/substructure_filter.py:200-214 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/rdkit/scripts/similarity_search.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3b7cef7386a3c5ca7c6064a5a99271ea04e819d8005ff3066e344d21957f54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): skills/scientific-visualization/scripts/export_plan.py:20-26 | skills/scientific-visualization/scripts/figure_export.py:389-396 | skills/scientific-visualization/scripts/style_presets.py:275-283 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/export_plan.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecea59b4e4865fbc66d644b026e44a38f056f296ed71f1cdc5ae75bf7cce47e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/scientific-visualization/scripts/palette_audit.py:83-91 | skills/scientific-visualization/scripts/style_presets.py:144-152 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/palette_audit.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffc7b418d709cb227758f066a71834b13c7d1ac348fef9c78f09635761c0f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): skills/simpy/scripts/replication_runner.py:180-193 | skills/simpy/scripts/resource_monitor.py:468-485 | skills/simpy/scripts/validate_simulation_config.py:96-107 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/simpy/scripts/replication_runner.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5b86447c2321d5ac22f0fec164364d4643cc085ee4251050e1a630f41494cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/iso-standards-readiness/scripts/_common.py:169-178 | skills/peer-review/scripts/_common.py:106-114 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/_common.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"023f42edfed3a25f38f2a4e955634c34ed536b7bcead518dd40623990bf7163e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): skills/ontology-term-resolution/scripts/map_terms.py:99-132 | skills/ontology-term-resolution/scripts/resolve_terms.py:123-157 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/map_terms.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b7bae51a548581ffed795409219387c4fc33f542bc727d9307cf08fc518ba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 8\u002B corresponding lines): skills/hypothesis-generation/scripts/check_falsification_controls.py:442-451 | skills/hypothesis-generation/scripts/validate_hypothesis_schema.py:1067-1074 | skills/hypothesis-generation/scripts/validate_prediction_matrix.py:273-282 | skills/market-research-reports/scripts/audit_claim_citations.py:315-322 | skills/market-research-reports/scripts/validate_competitor_matrix.py:211-219 | skills/peer-review/scripts/audit_citations.py:194-203 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/check_falsification_controls.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dfbb8aaa76655ca91df4abebd80a8edb1933ceb7e3e9d451d8cb324e80273f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): skills/primer-design/scripts/_common.py:124-128 | skills/pycalphad/scripts/equilibrate.py:18-22 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/_common.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed131adfececf1db98bb2b5c7d6949446be4c0207b083062cb48eb4541104cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): skills/clinical-reports/scripts/_common.py:237-244 | skills/hypothesis-generation/scripts/_common.py:353-360 | skills/market-research-reports/scripts/_common.py:216-223 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/_common.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f26d58abeec553bb81966de5c2239b3a738f1333e26d475f8346060461efe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): skills/omero-integration/scripts/plan_transfer.py:291-300 | skills/treatment-plans/scripts/_common.py:651-662 \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":"skills/omero-integration/scripts/plan_transfer.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa625811d8d26f36c6a308895444fc64c0ff905171d3ed59ed27c2e5ecd323a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): skills/market-research-reports/scripts/calculate_market_sizing.py:379-385 | skills/market-research-reports/scripts/forecast_sensitivity.py:316-322 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/market-research-reports/scripts/calculate_market_sizing.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"76861ea0cfdf2c24320ee36078cc5f802d172e3980fcdf5052c5bc38d00b18c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): skills/pylabrobot/scripts/_common.py:485-493 | skills/geniml/scripts/_common.py:56-63 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pylabrobot/scripts/_common.py"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"539f461028bc239f4becf26ea48e6b448e58df67440e9246eaba6aaae24428d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): skills/geopandas/scripts/_common.py:86-93 | skills/pymatgen/scripts/_common.py:171-180 | skills/scientific-brainstorming/scripts/_common.py:108-118 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/_common.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55de8196b431586aa4ca22fdd04cc113d9629cebb909cbcf5a261f3b5a7a0ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): skills/pytdc/scripts/load_and_split_data.py:62-68 | skills/research-lookup/scripts/research_lookup.py:1038-1041 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pytdc/scripts/load_and_split_data.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59fc30c6fa7200a7e7b0872d0bf7721a8c644fc71de442be5ac1ebc052c0486"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): skills/hypogenic/scripts/_common.py:1225-1234 | skills/ncats-arax/scripts/arax_client.py:508-517 \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":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e15c1371e087faab587b40792743c3130d318cd42038aa9218241e69b1987fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): skills/hypogenic/scripts/_common.py:397-401 | skills/neurokit2/scripts/_common.py:318-322 | skills/pptx-posters/scripts/_common.py:271-275 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"728c4ff1e129785cb8b2a7f82cd4629981d38ce86802379ad97d286282dfbb6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): skills/hypothesis-generation/scripts/_common.py:315-319 | skills/peer-review/scripts/_common.py:287-291 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6291bcdd8cf88e42597263906897160561c2bcb9b0a88173012e9326615d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): skills/treatment-plans/scripts/validate_traceability.py:136-143 | skills/treatment-plans/scripts/validate_treatment_plan.py:85-91 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/treatment-plans/scripts/validate_traceability.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c82e28835f2cd61388597791097cb9ddb414af04e09f35482a21655e7ba8d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): skills/bulk-rnaseq/scripts/build_counts_matrix.py:82-86 | skills/lab-hardware-cad/scripts/_common.py:89-93 | skills/markitdown/scripts/convert_literature.py:58-63 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bulk-rnaseq/scripts/build_counts_matrix.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5544598a173341d10af4baf441365624ae93dd01fec9c5a5167c45ee1ca7126"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/scikit-survival/scripts/_common.py:51-59 | skills/uncertainty-and-units/scripts/_common.py:116-124 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scikit-survival/scripts/_common.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"782a9f5449fafd3ce253d07894c4cc177c9cd569963b2d336daac35479dc7cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/pylabrobot/scripts/generate_simulation_plan.py:38-46 | skills/pylabrobot/scripts/plan_transfers.py:34-43 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pylabrobot/scripts/generate_simulation_plan.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"906b187f0a622236f4a5d46b0dd2eda0c4ff87ffc8d2ff640b81dd111503b022"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): skills/geopandas/scripts/sensitive_coordinates_checklist.py:220-226 | skills/geopandas/scripts/spatial_join_audit.py:365-371 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/sensitive_coordinates_checklist.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4986ef3afc1c6b898957ae8c29b4cc91c04f841626873f3647f4ca1d91d26225"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): skills/iso-standards-readiness/scripts/_common.py:421-426 | skills/iso-standards-readiness/scripts/audit_document_records.py:29-32 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/_common.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dae18c11362522e47332af840c58300ee647943deff6d3c5db9cd3bdfd77c36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): skills/analytical-method-validation/scripts/_common.py:44-51 | skills/pptx-posters/scripts/check_layout.py:17-23 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/_common.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4cbfca1107f56aee4d30b5cf9ca39771a06f34fa02f81b88ab61370748365a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): skills/geopandas/scripts/_common.py:211-218 | skills/pymatgen/scripts/_common.py:195-202 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/_common.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cf9a8a946f73dc0c6e2f4ba5e0744db5c3996e4e53973f3192949a3f94654b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): skills/geopandas/scripts/_common.py:202-207 | skills/pymatgen/scripts/_common.py:206-211 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/_common.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd85ba27fc10f8ed4345d14950f208d6b27c74ade7e521a712b49a0553693a18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): skills/pathml/scripts/plan_inference.py:276-278 | skills/pathml/scripts/plan_pipeline.py:270-272 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathml/scripts/plan_inference.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"659f24e3ca0e3847ddbe080a51ed8ce0d2437c44d5d8492bffbed5d76698fbd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): skills/iso-standards-readiness/scripts/_common.py:93-98 | skills/scientific-writing/scripts/_common.py:62-67 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/_common.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a773ac4db97f259f44b83dd29d09f22cbef0a4dd31f32f8fbff1efdf996cbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): skills/onekgpd/scripts/onekgpd_api.py:835-840 | skills/onekgpd/scripts/onekgpd_meta.py:477-481 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/onekgpd/scripts/onekgpd_api.py"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39daff285025f4cb324df1f21efb70436f2513397d5fcf5b193ef54d58b54c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): skills/protocolsio-integration/scripts/_common.py:296-303 | skills/pylabrobot/scripts/_common.py:732-734 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/protocolsio-integration/scripts/_common.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17d8f0ffc55b6827d578d5d456e8d3d299e559247dec4a9ba8649ca5fdbea5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): skills/primer-design/scripts/_common.py:132-134 | skills/statistical-power/scripts/power.py:52-54 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/_common.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb31af009587acd03f41a7f9c1b3fe0e257120c02958598043d05fb2acd19f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): skills/geniml/scripts/consensus_plan.py:99-102 | skills/geniml/scripts/corpus_auditor.py:107-110 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/consensus_plan.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8c2d1449129132156341eb1e437644a998e54dc57cb5f7639c99fe50a64b8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): skills/hypothesis-generation/scripts/_common.py:288-291 | skills/peer-review/scripts/_common.py:261-264 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1e6c35ae6473777bf9991b8df0a518a007b651c85b6e0ee198ede6dcb704fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): skills/matlab/scripts/plan_python_compatibility.py:167-172 | skills/matlab/scripts/scan_m_code.py:424-429 | skills/matlab/scripts/validate_project_manifest.py:339-344 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/matlab/scripts/plan_python_compatibility.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26a661cb0a8342f99086d4e2c481a288f17b64be67238eac48b0e6f7a7658db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): skills/qutip/scripts/convergence_sweep.py:351-354 | skills/qutip/scripts/solver_config_planner.py:319-322 | skills/qutip/scripts/steady_state_spectrum_planner.py:238-241 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qutip/scripts/convergence_sweep.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d0c1c7bd60dfcef2119da3aec98a493b736bdfdad164fffc4e8a2fb8606287"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): skills/clinical-reports/scripts/validate_case_report.py:67-70 | skills/clinical-reports/scripts/validate_trial_report.py:329-331 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/validate_case_report.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"37360ead3a446f28dfbb8511f8ae3754e8066bf525a4e1679278ae91f002b662"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): skills/clinical-decision-support/scripts/_common.py:186-188 | skills/clinical-reports/scripts/_common.py:230-233 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/_common.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f7eb6e6a9f61a7bb4a837d3d6193cd636ad32b990a4d812e83739995e37b57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): skills/geniml/scripts/_common.py:245-247 | skills/gtars/scripts/_common.py:461-463 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"314274598894f763baf9aae3e05568ec80ebf1588b3e6fbd98971f7a8e46ff37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): skills/exploratory-data-analysis/scripts/_tabular.py:60-65 | skills/pysam/scripts/alignment_qc.py:84-91 | skills/pysam/scripts/inspect_hts.py:162-167 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_tabular.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"cace16abce7d32975bf3b24b1614da09f570bcd45fece9d62bda4f3900555d43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (95 lines \u00D7 4): skills/latex-posters/scripts/generate_schematic_ai.py:376-470 | skills/literature-review/scripts/generate_schematic_ai.py:376-470 | skills/scientific-schematics/scripts/generate_schematic_ai.py:376-470 | skills/scientific-slides/scripts/generate_schematic_ai.py:376-470 \u2014 before extracting anything, compare \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 and \u0060skills/literature-review/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 843 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/latex-posters/scripts/generate_schematic_ai.py:376\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":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddba607205501223bc3d9793dfba22d123157eb57cdb65a4f670752123aff64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (95 lines \u00D7 4): skills/latex-posters/scripts/generate_schematic_ai.py:758-852 | skills/literature-review/scripts/generate_schematic_ai.py:758-852 | skills/scientific-schematics/scripts/generate_schematic_ai.py:758-852 | skills/scientific-slides/scripts/generate_schematic_ai.py:758-852 \u2014 before extracting anything, compare \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 and \u0060skills/literature-review/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 843 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69b74d0d8aa4ecf74753499047ef3522b045094b10a224e88783bbc7d419d41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (176 lines \u00D7 4): skills/latex-posters/scripts/generate_schematic_ai.py:564-739 | skills/literature-review/scripts/generate_schematic_ai.py:564-739 | skills/scientific-schematics/scripts/generate_schematic_ai.py:564-739 | skills/scientific-slides/scripts/generate_schematic_ai.py:564-739 \u2014 before extracting anything, compare \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 and \u0060skills/literature-review/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 843 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"a079c1682700c01bea6deaa1d0ee87af0185172d6b7daed873b2801cc3d7981e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (61 lines \u00D7 5): skills/latex-posters/scripts/generate_schematic_ai.py:399-470 | skills/literature-review/scripts/generate_schematic_ai.py:399-470 | skills/scientific-schematics/scripts/generate_schematic_ai.py:399-470 | skills/scientific-slides/scripts/generate_schematic_ai.py:399-470 | skills/scientific-slides/scripts/generate_slide_image_ai.py:406-466 \u2014 before extracting anything, compare \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 and \u0060skills/literature-review/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 843 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/latex-posters/scripts/generate_schematic_ai.py:399\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":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37e950e889ccb54cc1088cecdb24d495f64008b6d33889752005f1020c65a44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (61 lines \u00D7 4): skills/latex-posters/scripts/generate_schematic.py:89-149 | skills/literature-review/scripts/generate_schematic.py:89-149 | skills/scientific-schematics/scripts/generate_schematic.py:89-149 | skills/scientific-slides/scripts/generate_schematic.py:89-149 \u2014 before extracting anything, compare \u0060skills/latex-posters/scripts/generate_schematic.py\u0060 and \u0060skills/literature-review/scripts/generate_schematic.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 164 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fcaf20c73a18d121fa9d338683a3d4bece09897d208d1daf1eb7724658b618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201355 lines \u00D7 2): skills/scientific-slides/scripts/generate_slide_image.py:92-146 | skills/scientific-slides/scripts/generate_slide_image_ai.py:739-777 \u2014 before extracting anything, compare \u0060skills/scientific-slides/scripts/generate_slide_image.py\u0060 and \u0060skills/scientific-slides/scripts/generate_slide_image_ai.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 88 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/generate_slide_image.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae7f0f89a7d7ea65e76619579e29a6bcc3f21fca19932b1700208758ea14ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): skills/clinical-reports/scripts/validate_trial_report.py:169-213 | skills/clinical-reports/scripts/validate_trial_report.py:214-258 \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 \u0060skills/clinical-reports/scripts/validate_trial_report.py:169\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/validate_trial_report.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5075e39673d38428c67370a46b9f90587b28187917df8eca1d637bb68524d880"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201338 lines \u00D7 6): skills/infographics/scripts/generate_infographic_ai.py:850-886 | skills/latex-posters/scripts/generate_schematic_ai.py:448-485 | skills/literature-review/scripts/generate_schematic_ai.py:448-485 | skills/scientific-schematics/scripts/generate_schematic_ai.py:448-485 | skills/scientific-slides/scripts/generate_schematic_ai.py:448-485 | skills/scientific-slides/scripts/generate_slide_image_ai.py:455-480 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic_ai.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d98a3e2183a3203738ae817672a44edc1f67439ace12527414ff817ebb911f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): skills/infographics/scripts/generate_infographic_ai.py:708-741 | skills/infographics/scripts/generate_infographic_ai.py:932-965 \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":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bd9b7b384a86480efeed26d5190f143abb78bb73c237c8d79cbc07b710a009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 6): skills/infographics/scripts/generate_infographic_ai.py:620-651 | skills/latex-posters/scripts/generate_schematic_ai.py:255-286 | skills/literature-review/scripts/generate_schematic_ai.py:255-286 | skills/scientific-schematics/scripts/generate_schematic_ai.py:255-286 | skills/scientific-slides/scripts/generate_schematic_ai.py:255-286 | skills/scientific-slides/scripts/generate_slide_image_ai.py:283-314 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic_ai.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e2c7fdab955b74e2300bc93db5a24a17d97a713f59a5533b26958dadd44cd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 5): skills/infographics/scripts/generate_infographic_ai.py:1138-1169 | skills/latex-posters/scripts/generate_schematic_ai.py:663-694 | skills/literature-review/scripts/generate_schematic_ai.py:663-694 | skills/scientific-schematics/scripts/generate_schematic_ai.py:663-694 | skills/scientific-slides/scripts/generate_schematic_ai.py:663-694 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic_ai.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/infographics/scripts/generate_infographic_ai.py:1138\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":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"adddc4e70c3b513b19f56a6bc9f1e84b2c4a2a25564e7c19ea2fa0ec29141805"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): skills/geniml/scripts/_common.py:113-143 | skills/gtars/scripts/_common.py:107-137 \u2014 before extracting anything, compare \u0060skills/geniml/scripts/_common.py\u0060 and \u0060skills/gtars/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b310f5f900e1d49a1428b3338e1b184b4a02743e80131c29c3141ff6f510bef3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 3): skills/hypothesis-generation/scripts/_common.py:178-207 | skills/market-research-reports/scripts/_common.py:118-147 | skills/peer-review/scripts/_common.py:151-180 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/market-research-reports/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d5ccbfddb95405c4795b01228063e53d4585383eb9dd3ee45219be95fab660"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201329 lines \u00D7 5): skills/latex-posters/scripts/generate_schematic.py:141-169 | skills/literature-review/scripts/generate_schematic.py:141-169 | skills/scientific-schematics/scripts/generate_schematic.py:141-169 | skills/scientific-slides/scripts/generate_schematic.py:141-169 | skills/scientific-slides/scripts/generate_slide_image.py:140-162 \u2014 before extracting anything, compare \u0060skills/latex-posters/scripts/generate_schematic.py\u0060 and \u0060skills/literature-review/scripts/generate_schematic.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 164 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/latex-posters/scripts/generate_schematic.py:141\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":"skills/latex-posters/scripts/generate_schematic.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d118ccaf436d944f2c6c54d4485b625586b979f0ab7ff1c6e9144d487a37a7b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201329 lines \u00D7 3): skills/arboreto/scripts/basic_grn_inference.py:94-97 | skills/citation-management/scripts/search_google_scholar.py:163-191 | skills/citation-management/scripts/search_openalex.py:266-276 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/arboreto/scripts/basic_grn_inference.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca6da1c728e6f01626adce0f57ee591a12ae11b7d6a7837d1acc9386846bcfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): skills/neurokit2/scripts/ecg_hrv_pipeline.py:126-154 | skills/neurokit2/scripts/eda_pipeline.py:126-154 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/ecg_hrv_pipeline.py\u0060 and \u0060skills/neurokit2/scripts/eda_pipeline.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/ecg_hrv_pipeline.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"031dd963e3bf8ec1a2774985e0e59ad4607570d8181e94adc31f63a7981251ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): skills/pytdc/scripts/load_and_split_data.py:307-334 | skills/pytdc/scripts/molecular_generation.py:323-349 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/pytdc/scripts/load_and_split_data.py:307\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":"skills/pytdc/scripts/load_and_split_data.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4ef7c5f4bfe0c3477fc74abfe54f77e34e3c6c88b7e312682845e154a2fbf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 13): skills/generate-image/scripts/generate_image.py:98-123 | skills/infographics/scripts/generate_infographic.py:57-81 | skills/infographics/scripts/generate_infographic_ai.py:116-141 | skills/latex-posters/scripts/generate_schematic.py:44-68 | skills/latex-posters/scripts/generate_schematic_ai.py:114-139 | skills/literature-review/scripts/generate_schematic.py:44-68 | skills/literature-review/scripts/generate_schematic_ai.py:114-139 | skills/scientific-schematics/scripts/generate_schematic.py:44-68 | skills/scientific-schematics/scripts/generate_schematic_ai.py:114-139 | skills/scientific-slides/scripts/generate_schematic.py:44-68 | skills/scientific-slides/scripts/generate_schematic_ai.py:114-139 | skills/scientific-slides/scripts/generate_slide_image.py:47-71 | skills/scientific-slides/scripts/generate_slide_image_ai.py:127-152 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 13 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 13 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060explicit\u0060 to \u0060str | None = None\u0060 in one and \u0060Optional[str] = None\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/generate-image/scripts/generate_image.py:124\u0060 calls \u0060startswith\u0060, \u0060strip\u0060 and \u0060skills/infographics/scripts/generate_infographic.py:82\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":"skills/generate-image/scripts/generate_image.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8919f3c805cae62f84236b890ae7ba5c5a45bc4c7891330482a486e3c696bad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 4): skills/latex-posters/scripts/generate_schematic_ai.py:346-371 | skills/literature-review/scripts/generate_schematic_ai.py:346-371 | skills/scientific-schematics/scripts/generate_schematic_ai.py:346-371 | skills/scientific-slides/scripts/generate_schematic_ai.py:346-371 \u2014 before extracting anything, compare \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 and \u0060skills/literature-review/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 843 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfeabeb43caa2a50183cd59e72fad396159be2c755a770758188ab83bfec2aa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): skills/onekgpd/scripts/onekgpd_api.py:368-392 | skills/onekgpd/scripts/onekgpd_api.py:498-522 \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 \u0060skills/onekgpd/scripts/onekgpd_api.py:368\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":"skills/onekgpd/scripts/onekgpd_api.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f76ad5f807349b4fe9c28c245b3d375e1415d25dc3baa92bb088606188d83c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 6): skills/infographics/scripts/generate_infographic.py:241-264 | skills/latex-posters/scripts/generate_schematic.py:157-180 | skills/literature-review/scripts/generate_schematic.py:157-180 | skills/scientific-schematics/scripts/generate_schematic.py:157-180 | skills/scientific-slides/scripts/generate_schematic.py:157-180 | skills/scientific-slides/scripts/generate_slide_image.py:150-173 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/infographics/scripts/generate_infographic.py:239\u0060 calls \u0060error\u0060 and \u0060skills/latex-posters/scripts/generate_schematic.py:156\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":"skills/infographics/scripts/generate_infographic.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c7f49bce75f0d567d99967e2e00be732da14ce5d33e922715c8a610ecf500b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 4): skills/latex-posters/scripts/generate_schematic_ai.py:320-343 | skills/literature-review/scripts/generate_schematic_ai.py:320-343 | skills/scientific-schematics/scripts/generate_schematic_ai.py:320-343 | skills/scientific-slides/scripts/generate_schematic_ai.py:320-343 \u2014 before extracting anything, compare \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 and \u0060skills/literature-review/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 843 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc1e11fe24c82a192ecf1f1723159988da82bcdafa693c56ab857b5093066e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): skills/exploratory-data-analysis/scripts/distribution_sensitivity.py:31-54 | skills/exploratory-data-analysis/scripts/missingness_leakage_audit.py:31-54 | skills/exploratory-data-analysis/scripts/tabular_profile.py:32-55 \u2014 before extracting anything, compare \u0060skills/exploratory-data-analysis/scripts/distribution_sensitivity.py\u0060 and \u0060skills/exploratory-data-analysis/scripts/missingness_leakage_audit.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/exploratory-data-analysis/scripts/distribution_sensitivity.py:31\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":"skills/exploratory-data-analysis/scripts/distribution_sensitivity.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"418c5c0e0546559c2654a1c7c17fcf22896e8239007ba0966ccdcb2a880baaaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 5): skills/infographics/scripts/generate_infographic_ai.py:1117-1136 | skills/latex-posters/scripts/generate_schematic_ai.py:640-662 | skills/literature-review/scripts/generate_schematic_ai.py:640-662 | skills/scientific-schematics/scripts/generate_schematic_ai.py:640-662 | skills/scientific-slides/scripts/generate_schematic_ai.py:640-662 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic_ai.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/infographics/scripts/generate_infographic_ai.py:1117\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da8cef18d0bc24799c73b3f67915427903c4389aa22fc0ec08a9b171bf546f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 3): skills/ontology-term-resolution/scripts/lookup_prefix.py:61-82 | skills/ontology-term-resolution/scripts/map_terms.py:53-74 | skills/ontology-term-resolution/scripts/resolve_terms.py:70-92 \u2014 before extracting anything, compare \u0060skills/ontology-term-resolution/scripts/map_terms.py\u0060 and \u0060skills/ontology-term-resolution/scripts/resolve_terms.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/lookup_prefix.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27608f10fe8b9da59596eb7eabd9565541216e46c526642a0a1b4e18b91c575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): skills/citation-management/scripts/search_google_scholar.py:237-259 | skills/citation-management/scripts/search_pubmed.py:409-429 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/citation-management/scripts/search_google_scholar.py:237\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":"skills/citation-management/scripts/search_google_scholar.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5119fa1db4885e627f0789d424e51e14908daa53f5c0568b1d45a2e5ce498cf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 5): skills/infographics/scripts/generate_infographic_ai.py:898-919 | skills/latex-posters/scripts/generate_schematic_ai.py:510-531 | skills/literature-review/scripts/generate_schematic_ai.py:510-531 | skills/scientific-schematics/scripts/generate_schematic_ai.py:510-531 | skills/scientific-slides/scripts/generate_schematic_ai.py:510-531 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic_ai.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/infographics/scripts/generate_infographic_ai.py:898\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6769995213eae4be16473f5206da6b715767168f8fbebe60c887a3ce7689df3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 5): skills/infographics/scripts/generate_infographic_ai.py:1203-1224 | skills/latex-posters/scripts/generate_schematic_ai.py:731-749 | skills/literature-review/scripts/generate_schematic_ai.py:731-749 | skills/scientific-schematics/scripts/generate_schematic_ai.py:731-749 | skills/scientific-slides/scripts/generate_schematic_ai.py:731-749 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic_ai.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/infographics/scripts/generate_infographic_ai.py:1203\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, \u0060skills/infographics/scripts/generate_infographic_ai.py:1226\u0060 calls \u0060get\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py:751\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":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85ab0d72c9f989219776a4d4b824d2a81add9900961d70dabed89a0eaad7091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): skills/neurokit2/scripts/_common.py:270-291 | skills/pathml/scripts/_common.py:284-305 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/_common.py\u0060 and \u0060skills/pathml/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb1dae5ceb3834a2444160c235ddf246b66d6db5043de3f65db120c9216ec20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): skills/opentrons-integration/scripts/pcr_setup_template.py:30-51 | skills/opentrons-integration/scripts/runtime_parameters_template.py:56-76 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/opentrons-integration/scripts/pcr_setup_template.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"036c26b70425219511477e88d1d80e0b7846312d079dfc227fcb8c376e3ae3ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): skills/pptx-posters/scripts/_manifest.py:211-232 | skills/pptx-posters/scripts/_manifest.py:423-444 \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 \u0060skills/pptx-posters/scripts/_manifest.py:211\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":"skills/pptx-posters/scripts/_manifest.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bfde4e559ccf222dc16986711bbc223bd6031b39b1e986d12ce22fca31e193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 6): skills/infographics/scripts/generate_infographic_ai.py:662-682 | skills/latex-posters/scripts/generate_schematic_ai.py:297-317 | skills/literature-review/scripts/generate_schematic_ai.py:297-317 | skills/scientific-schematics/scripts/generate_schematic_ai.py:297-317 | skills/scientific-slides/scripts/generate_schematic_ai.py:297-317 | skills/scientific-slides/scripts/generate_slide_image_ai.py:325-345 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic_ai.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8136b127a2b0bfebf0e269ea0d7631b7410e31fce2b7f6919e66cde4c0f76b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 5): skills/latex-posters/scripts/generate_schematic_ai.py:803-823 | skills/literature-review/scripts/generate_schematic_ai.py:803-823 | skills/scientific-schematics/scripts/generate_schematic_ai.py:803-823 | skills/scientific-slides/scripts/generate_schematic_ai.py:803-823 | skills/scientific-slides/scripts/generate_slide_image_ai.py:773-791 \u2014 before extracting anything, compare \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 and \u0060skills/literature-review/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 843 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/latex-posters/scripts/generate_schematic_ai.py:803\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":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1757295a35e65556e8b3c3fe9d1d5a0607c7376beadbbef921b899f9acde4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): skills/clinical-decision-support/scripts/survival_plan_validator.py:235-253 | skills/clinical-decision-support/scripts/validate_cds_artifact.py:182-202 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/clinical-decision-support/scripts/validate_cds_artifact.py:180\u0060 calls \u0060get\u0060 and \u0060skills/clinical-decision-support/scripts/survival_plan_validator.py:234\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":"skills/clinical-decision-support/scripts/survival_plan_validator.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a82345df08418c3581a120396c84904a9d21affb2f12a59c767e54e95d3322d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): skills/gtars/scripts/bed_validator.py:91-111 | skills/gtars/scripts/tokenizer_manifest.py:90-109 \u2014 before extracting anything, compare \u0060skills/gtars/scripts/bed_validator.py\u0060 and \u0060skills/gtars/scripts/tokenizer_manifest.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/gtars/scripts/bed_validator.py:91\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":"skills/gtars/scripts/bed_validator.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51f342248f32ae04bcfbfa1ccd7532899511dc5177aa3d1242119fcd8d7d866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): skills/pydicom/scripts/deidentification_audit.py:350-370 | skills/pydicom/scripts/dicom_inventory.py:378-398 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/pydicom/scripts/deidentification_audit.py:350\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":"skills/pydicom/scripts/deidentification_audit.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbd4d65271fbb10b83d2010af425bf2e27c4aa93e52c9cd3609662eef4d9324"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): skills/pysam/scripts/alignment_qc.py:51-71 | skills/pysam/scripts/variant_summary.py:59-78 \u2014 before extracting anything, compare \u0060skills/pysam/scripts/alignment_qc.py\u0060 and \u0060skills/pysam/scripts/variant_summary.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/pysam/scripts/alignment_qc.py:51\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":"skills/pysam/scripts/alignment_qc.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99988d27dfb94c7ad6f2842f786345a40069d05c06973319c722426ec41d784"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): skills/timesfm-forecasting/scripts/check_system.py:152-172 | skills/timesfm-forecasting/scripts/check_system.py:205-225 \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 \u0060skills/timesfm-forecasting/scripts/check_system.py:152\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":"skills/timesfm-forecasting/scripts/check_system.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4acdd344be86241d6f722efe05831ea1545442bc9b6bd66503e7499c8b217b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): skills/treatment-plans/scripts/check_completeness.py:56-76 | skills/treatment-plans/scripts/check_completeness.py:100-119 \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 \u0060skills/treatment-plans/scripts/check_completeness.py:56\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":"skills/treatment-plans/scripts/check_completeness.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e32c589325cd303800de886f4b5d39e94468aa54271bbf56e1dd226223e921"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 3): skills/geniml/scripts/consensus_plan.py:70-89 | skills/geniml/scripts/corpus_auditor.py:71-87 | skills/gtars/scripts/artifact_inspector.py:54-72 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/geniml/scripts/consensus_plan.py:70\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":"skills/geniml/scripts/consensus_plan.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"336f446cb93ba2a4d1bf1a6bb4de04d506a83e4020d41154616b42e7991a38c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): skills/gtars/scripts/bed_validator.py:85-104 | skills/gtars/scripts/execution_plan.py:131-150 | skills/gtars/scripts/tokenizer_manifest.py:84-102 \u2014 before extracting anything, compare \u0060skills/gtars/scripts/bed_validator.py\u0060 and \u0060skills/gtars/scripts/tokenizer_manifest.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/gtars/scripts/bed_validator.py:84\u0060 calls \u0060local_path\u0060 and \u0060skills/gtars/scripts/execution_plan.py:129\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":"skills/gtars/scripts/bed_validator.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4ae01896b11fd0d2ed17b10b8e6e5fff1b2a2c5d5a3e14951f8288b6b49b27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): skills/hypothesis-generation/scripts/_common.py:81-100 | skills/market-research-reports/scripts/_common.py:56-75 | skills/peer-review/scripts/_common.py:66-85 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/market-research-reports/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/hypothesis-generation/scripts/_common.py:80\u0060 calls \u0060_reject_url_like_path\u0060 and \u0060skills/market-research-reports/scripts/_common.py:54\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b047294bd505d44f539683c3b1f5d5ea49ff1eb5eed57c6435a6bd4e87e4a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): skills/clinical-decision-support/scripts/cohort_table_generator.py:251-270 | skills/clinical-decision-support/scripts/model_biomarker_evaluation.py:329-348 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/cohort_table_generator.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b533eddbd04ec943dd11651c4a89f84e1ce2031713ab61eeaa54d4c5cc5be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): skills/fluidsim/scripts/_common.py:257-276 | skills/pydicom/scripts/_common.py:420-437 \u2014 before extracting anything, compare \u0060skills/fluidsim/scripts/_common.py\u0060 and \u0060skills/pydicom/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"610fc8c2a9fdf3bb5f6a5bfb2cdf7767a08646e869928c3a5b3d6a64c1e12410"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): skills/hypothesis-generation/scripts/_common.py:389-408 | skills/peer-review/scripts/_common.py:350-369 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/peer-review/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f96c7c31428841b56d9416963075a092890abbf91e52a779f910d1bcfadb65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 6): skills/exploratory-data-analysis/scripts/distribution_sensitivity.py:21-39 | skills/exploratory-data-analysis/scripts/eda_analyzer.py:50-68 | skills/exploratory-data-analysis/scripts/image_inspector.py:29-46 | skills/exploratory-data-analysis/scripts/missingness_leakage_audit.py:21-39 | skills/exploratory-data-analysis/scripts/sequence_inspector.py:32-50 | skills/exploratory-data-analysis/scripts/tabular_profile.py:22-40 \u2014 before extracting anything, compare \u0060skills/exploratory-data-analysis/scripts/distribution_sensitivity.py\u0060 and \u0060skills/exploratory-data-analysis/scripts/missingness_leakage_audit.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/exploratory-data-analysis/scripts/distribution_sensitivity.py:21\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 after the matched lines, \u0060skills/exploratory-data-analysis/scripts/image_inspector.py:47\u0060 calls \u0060add_argument\u0060 and \u0060skills/exploratory-data-analysis/scripts/distribution_sensitivity.py:39\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":"skills/exploratory-data-analysis/scripts/distribution_sensitivity.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"659cbc2d778928cc9dd72d892ab3cbfb08cdbe0bba07e8b953d8ca81bdd45c79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): scripts/generate_skill_image.py:974-989 | skills/generate-image/scripts/generate_image.py:427-445 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \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":"scripts/generate_skill_image.py"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"1944616347dbd7239ba26628569a7f323c4f7af7f278d0b55da6a04e33c72c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): skills/clinical-reports/scripts/consistency_checker.py:93-111 | skills/clinical-reports/scripts/terminology_validator.py:165-183 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/clinical-reports/scripts/consistency_checker.py:90\u0060 calls \u0060set\u0060 and \u0060skills/clinical-reports/scripts/terminology_validator.py:164\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":"skills/clinical-reports/scripts/consistency_checker.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a963b2bb0782fff16c47590af4e9fe170db33419ed8bebef442f6f38bae17b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): skills/geniml/scripts/_common.py:185-203 | skills/gtars/scripts/_common.py:181-199 \u2014 before extracting anything, compare \u0060skills/geniml/scripts/_common.py\u0060 and \u0060skills/gtars/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"68da6be851033db00ba87a36991a5e2de8370199dbfedc7073df9b3d33f88371"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): skills/markitdown/scripts/batch_convert.py:224-243 | skills/markitdown/scripts/convert_literature.py:304-322 \u2014 before extracting anything, compare \u0060skills/markitdown/scripts/batch_convert.py\u0060 and \u0060skills/markitdown/scripts/convert_literature.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/markitdown/scripts/batch_convert.py:224\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":"skills/markitdown/scripts/batch_convert.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e89ed89c0c0066f4afaa0d26cc14b6715e2dc12d65fed5e4029d615dd1ef34c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): skills/pydicom/scripts/pixel_frame_planner.py:291-309 | skills/pydicom/scripts/transfer_syntax_inspector.py:223-241 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/pixel_frame_planner.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d7acc94a2eb5edf312e39dae663c350e749283e22973c46f0b9fa26147d621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): skills/scikit-survival/scripts/_common.py:143-160 | skills/simpy/scripts/_common.py:105-122 | skills/uncertainty-and-units/scripts/_common.py:228-245 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060str | None\u0060 in one and \u0060Any\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scikit-survival/scripts/_common.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2352e2c6478f084f65c9a809be4167bd4c0c4174f5bc29185119df330f454fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): skills/clinical-decision-support/scripts/cohort_table_generator.py:61-78 | skills/clinical-decision-support/scripts/model_biomarker_evaluation.py:181-198 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/clinical-decision-support/scripts/cohort_table_generator.py:61\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":"skills/clinical-decision-support/scripts/cohort_table_generator.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b431645410b5e810f7cf77d0e6be20845f0bfa4feb24ae8985a7ed30113c805"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): skills/labarchive-integration/scripts/entry_operations.py:365-382 | skills/labarchive-integration/scripts/setup_config.py:241-258 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/labarchive-integration/scripts/entry_operations.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"191d85e4115bb428c3fd9666a9de07b41547296a375ef8a5f17da08947a3173d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): skills/markitdown/scripts/batch_convert.py:101-118 | skills/markitdown/scripts/convert_literature.py:72-89 \u2014 before extracting anything, compare \u0060skills/markitdown/scripts/batch_convert.py\u0060 and \u0060skills/markitdown/scripts/convert_literature.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/markitdown/scripts/batch_convert.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fbd7b1dbf7c9fce4479ac01e477254978f8a0c0ac514ae8407cd3e79bbbba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): skills/pymc/assets/hierarchical_model_template.py:65-82 | skills/pymc/assets/linear_regression_template.py:47-64 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymc/assets/hierarchical_model_template.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dbea7f2906fe526a1ceebff531aa72f27f432bd3afd5c90c3e81bd088a1f7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): skills/pytdc/scripts/cache_audit.py:109-126 | skills/pytdc/scripts/discover_metadata.py:131-147 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/pytdc/scripts/cache_audit.py:109\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/pytdc/scripts/discover_metadata.py:130\u0060 calls \u0060add_argument\u0060 and \u0060skills/pytdc/scripts/cache_audit.py:109\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":"skills/pytdc/scripts/cache_audit.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25a5118b1a1f0ebdbd0bacda61464f57b8a5ee485815ce23aa9c945a0fbeef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 6): skills/infographics/scripts/generate_infographic_ai.py:889-905 | skills/latex-posters/scripts/generate_schematic_ai.py:501-517 | skills/literature-review/scripts/generate_schematic_ai.py:501-517 | skills/scientific-schematics/scripts/generate_schematic_ai.py:501-517 | skills/scientific-slides/scripts/generate_schematic_ai.py:501-517 | skills/scientific-slides/scripts/generate_slide_image_ai.py:494-510 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic_ai.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/infographics/scripts/generate_infographic_ai.py:907\u0060 calls \u0060_log\u0060 and \u0060skills/scientific-slides/scripts/generate_slide_image_ai.py:513\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":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04e0dc8774dd50d5ab44c7de6fb00481bef095f441cc16de4b556a1b3411bae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): skills/etetoolkit/scripts/quick_visualize.py:58-73 | skills/etetoolkit/scripts/tree_operations.py:49-65 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/etetoolkit/scripts/quick_visualize.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a368128bba823fc7d7d7b797c4e5db037b7b602d4b8225315da4a5de1831ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): skills/gtars/scripts/execution_plan.py:97-113 | skills/gtars/scripts/tokenizer_manifest.py:47-63 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/gtars/scripts/execution_plan.py:97\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":"skills/gtars/scripts/execution_plan.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dc08f388087ad09852ac91ac505ac268ab4ed6b5bf89d9aafd8165ff806248"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/clinical-decision-support/scripts/decision_logic_traceability.py:94-109 | skills/clinical-decision-support/scripts/model_biomarker_evaluation.py:142-157 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/clinical-decision-support/scripts/decision_logic_traceability.py:94\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":"skills/clinical-decision-support/scripts/decision_logic_traceability.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b22f94e50bb5acb798ff1ae8bff8c5d35e8039763d215824fe7744c715fff78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/fluidsim/scripts/_common.py:324-339 | skills/pydicom/scripts/_common.py:630-645 \u2014 before extracting anything, compare \u0060skills/fluidsim/scripts/_common.py\u0060 and \u0060skills/pydicom/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc00529cbf07c9ed111e0da9ad237274708d652d5416d64157d123a828afd4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/fluidsim/scripts/_common.py:387-402 | skills/pydicom/scripts/_common.py:583-598 \u2014 before extracting anything, compare \u0060skills/fluidsim/scripts/_common.py\u0060 and \u0060skills/pydicom/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00df7d9bb6ea01d2b55fb7898adbff0c1d5c8aa316a8fefaa7e1bf9426f6dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/fluidsim/scripts/_common.py:448-463 | skills/pydicom/scripts/_common.py:518-533 \u2014 before extracting anything, compare \u0060skills/fluidsim/scripts/_common.py\u0060 and \u0060skills/pydicom/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9a213049c9fcd6b52a50b31a2da653d39eca81b4d5538a53d949ad30df3ea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/geniml/scripts/_common.py:309-324 | skills/gtars/scripts/_common.py:270-285 \u2014 before extracting anything, compare \u0060skills/geniml/scripts/_common.py\u0060 and \u0060skills/gtars/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35cb38f67c08c79fb090311a002f0541b6d02b80ef644d753d68f8be7a64ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/market-research-reports/scripts/_common.py:101-116 | skills/peer-review/scripts/_common.py:128-143 \u2014 before extracting anything, compare \u0060skills/market-research-reports/scripts/_common.py\u0060 and \u0060skills/peer-review/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/peer-review/scripts/_common.py:127\u0060 calls \u0060set\u0060 and \u0060skills/market-research-reports/scripts/_common.py:100\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/market-research-reports/scripts/_common.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab7ce472b0910f3d698fb25bf203cf568eebfd9b4da7757975e6b5210bd9e6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): skills/market-research-reports/scripts/check_unit_consistency.py:93-107 | skills/market-research-reports/scripts/validate_evidence_ledger.py:195-210 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/market-research-reports/scripts/check_unit_consistency.py:93\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":"skills/market-research-reports/scripts/check_unit_consistency.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b194871c6b1603b11db12e811f3125aa9b37ae1c0041b7740f7adb7c7dda08e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/neurokit2/scripts/_common.py:76-91 | skills/pathml/scripts/_common.py:76-91 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/_common.py\u0060 and \u0060skills/pathml/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d213b4020ef8746ce08566de29900c5a2592337727a01df947e3b3aa4ac5af57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/opentrons-integration/scripts/basic_protocol_template.py:40-55 | skills/opentrons-integration/scripts/ot2_basic_protocol_template.py:37-55 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/opentrons-integration/scripts/ot2_basic_protocol_template.py:37\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 before the matched lines, \u0060skills/opentrons-integration/scripts/basic_protocol_template.py:38\u0060 calls \u0060load_trash_bin\u0060, \u0060load_instrument\u0060 and \u0060skills/opentrons-integration/scripts/ot2_basic_protocol_template.py:37\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/opentrons-integration/scripts/basic_protocol_template.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ab5de64239b61083d216eb7aba86259cb1ba419f901f9eb18a17a3b4c0a951"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/pydicom/scripts/_common.py:447-462 | skills/pydicom/scripts/_common.py:475-490 \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":"skills/pydicom/scripts/_common.py"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1ba0095ebba2e693874d417f9f9bdb19ba37173102d922047e05176042402d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/pymatgen/scripts/structure_analyzer.py:275-290 | skills/pymatgen/scripts/symmetry_sensitivity_report.py:193-208 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/pymatgen/scripts/structure_analyzer.py:275\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymatgen/scripts/structure_analyzer.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7fc63723721aa78c7a66f2403b704624f554af1384141369afbae56e45babc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/pytorch-lightning/scripts/template_lightning_module.py:91-106 | skills/pytorch-lightning/scripts/template_lightning_module.py:113-128 \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":"skills/pytorch-lightning/scripts/template_lightning_module.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e0a6be4303e80e14d6f6f4f727176d3a7c0f58bd372050c55f9305db40019e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/uncertainty-and-units/scripts/audit_units.py:554-569 | skills/uncertainty-and-units/scripts/propagate_uncertainty.py:681-696 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/uncertainty-and-units/scripts/audit_units.py"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb5f75b574bb99c6edb465e89eb9ce1187de2221e6ff04e95d78cc4c3b49f7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 7): skills/exploratory-data-analysis/scripts/capability_manifest.py:52-66 | skills/exploratory-data-analysis/scripts/distribution_sensitivity.py:26-40 | skills/exploratory-data-analysis/scripts/eda_analyzer.py:55-69 | skills/exploratory-data-analysis/scripts/image_inspector.py:34-46 | skills/exploratory-data-analysis/scripts/missingness_leakage_audit.py:26-40 | skills/exploratory-data-analysis/scripts/sequence_inspector.py:37-51 | skills/exploratory-data-analysis/scripts/tabular_profile.py:27-41 \u2014 before extracting anything, compare \u0060skills/exploratory-data-analysis/scripts/distribution_sensitivity.py\u0060 and \u0060skills/exploratory-data-analysis/scripts/missingness_leakage_audit.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/exploratory-data-analysis/scripts/capability_manifest.py:52\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/exploratory-data-analysis/scripts/image_inspector.py:47\u0060 calls \u0060add_argument\u0060 and \u0060skills/exploratory-data-analysis/scripts/capability_manifest.py:66\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":"skills/exploratory-data-analysis/scripts/capability_manifest.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d9ceeaa8afbab084f8f39b6504f36db619db76161b78e137f9d55a85c1dcc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 6): skills/infographics/scripts/generate_infographic_ai.py:908-922 | skills/latex-posters/scripts/generate_schematic_ai.py:520-534 | skills/literature-review/scripts/generate_schematic_ai.py:520-534 | skills/scientific-schematics/scripts/generate_schematic_ai.py:520-534 | skills/scientific-slides/scripts/generate_schematic_ai.py:520-534 | skills/scientific-slides/scripts/generate_slide_image_ai.py:512-526 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic_ai.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/infographics/scripts/generate_infographic_ai.py:908\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/infographics/scripts/generate_infographic_ai.py:906\u0060 calls \u0060_log\u0060 and \u0060skills/scientific-slides/scripts/generate_slide_image_ai.py:510\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"52918497ef0c55c4cd53b3645245f8c2021864f7398f872ae49c06cafa9b09cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): skills/neurokit2/scripts/_common.py:222-236 | skills/pathml/scripts/_common.py:203-217 | skills/scikit-survival/scripts/_common.py:189-203 | skills/simpy/scripts/_common.py:151-165 | skills/uncertainty-and-units/scripts/_common.py:274-288 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/_common.py\u0060 and \u0060skills/pathml/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed834a61920f912ed6968b26580218f2dc88c007538444ead85d5227fbc0b2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 4): skills/clinical-decision-support/scripts/cohort_table_generator.py:68-80 | skills/clinical-decision-support/scripts/survival_plan_validator.py:182-196 | skills/clinical-decision-support/scripts/survival_plan_validator.py:242-254 | skills/clinical-decision-support/scripts/validate_cds_artifact.py:191-203 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/clinical-decision-support/scripts/survival_plan_validator.py:240\u0060 calls \u0060require_nonempty_text\u0060, \u0060get\u0060 and \u0060skills/clinical-decision-support/scripts/cohort_table_generator.py:66\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":"skills/clinical-decision-support/scripts/cohort_table_generator.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d378dba62f1fa144977e3c532e9ae11549500d7ca61c2adf30b996dea7606c99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): skills/clinical-decision-support/scripts/decision_logic_traceability.py:282-296 | skills/clinical-decision-support/scripts/survival_plan_validator.py:266-280 | skills/clinical-decision-support/scripts/validate_cds_artifact.py:240-254 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/decision_logic_traceability.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"872e48a79e9b26bd6272c8985c70652a3b2d63f91ce5231050bdce70ca28fb69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): skills/hypothesis-generation/scripts/check_falsification_controls.py:424-438 | skills/hypothesis-generation/scripts/validate_prediction_matrix.py:255-269 | skills/peer-review/scripts/audit_citations.py:178-190 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. 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":"skills/hypothesis-generation/scripts/check_falsification_controls.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"345fa2767f4a86d7384a96ff3c679e2534ead8a2c9b7cf7f91746c7974f0fb57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): skills/geniml/scripts/corpus_auditor.py:85-99 | skills/geniml/scripts/model_artifact_inspector.py:71-85 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/geniml/scripts/corpus_auditor.py:85\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":"skills/geniml/scripts/corpus_auditor.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6832053e79cc5f6822be280fddfb822f8d3d83ca62227a2735f97d8bf7ad60e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): skills/pydicom/scripts/anonymize_dicom.py:64-78 | skills/pydicom/scripts/uid_mapping_validator.py:40-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/anonymize_dicom.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fca08f12a4a15105fa54e9fa976e23621b452d72ccf8a72ef5039298422a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 4): skills/scientific-brainstorming/scripts/validate_register.py:251-260 | skills/scientific-brainstorming/scripts/validate_register.py:313-322 | skills/scientific-brainstorming/scripts/validate_register.py:485-494 | skills/scientific-brainstorming/scripts/validate_register.py:518-531 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-brainstorming/scripts/validate_register.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d25431a56414160df0f7e6fd2baf29ab37f9006c7564dad10252fa3eaa8ad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): skills/geniml/scripts/tokenizer_compatibility.py:57-70 | skills/gtars/scripts/coverage_preflight.py:83-96 | skills/gtars/scripts/refget_digest_plan.py:44-56 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/geniml/scripts/tokenizer_compatibility.py:57\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":"skills/geniml/scripts/tokenizer_compatibility.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7baaacca07cce313ac7ba0296506af20607beb73f7c12195eb64f347ed2946d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): skills/clinical-decision-support/scripts/deidentification_checklist.py:200-212 | skills/clinical-decision-support/scripts/evidence_profile_check.py:81-94 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/clinical-decision-support/scripts/evidence_profile_check.py:80\u0060 calls \u0060_profile_has_recommendation_key\u0060 and \u0060skills/clinical-decision-support/scripts/deidentification_checklist.py:200\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":"skills/clinical-decision-support/scripts/deidentification_checklist.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d53a02d98f8f550d3cc4ff674945027836a0cc81230265f4219aa9d9a46247b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): skills/exa-search/scripts/exa_extract.py:119-132 | skills/exa-search/scripts/exa_search.py:164-177 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exa-search/scripts/exa_extract.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41aad2331c3cfd8ddf9ba2cd45813ab0576a3b4a3fdc9b61c1054ff9daab2ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): skills/iso-standards-readiness/scripts/audit_document_records.py:40-53 | skills/iso-standards-readiness/scripts/check_traceability.py:68-81 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/iso-standards-readiness/scripts/check_traceability.py:82\u0060 calls \u0060choice\u0060 and \u0060skills/iso-standards-readiness/scripts/audit_document_records.py:54\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/audit_document_records.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8289bb35a3725afd6894686c5164d003a13843a364ac92d65e67fb9cea43bff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): skills/market-research-reports/scripts/_common.py:294-307 | skills/pytdc/scripts/_common.py:190-203 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/market-research-reports/scripts/_common.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"08984bd3bf5f7d1d6705ad9fbbc1bdcfcc5633269de6865bf5070510f5609284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): skills/market-research-reports/scripts/audit_claim_citations.py:201-214 | skills/market-research-reports/scripts/check_unit_consistency.py:85-98 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/market-research-reports/scripts/audit_claim_citations.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"aceedcd162949de3781432ad3eac9f392780dde87c3ccd4466b70b58f588d41a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): skills/markitdown/scripts/batch_convert.py:334-347 | skills/markitdown/scripts/convert_literature.py:388-398 \u2014 before extracting anything, compare \u0060skills/markitdown/scripts/batch_convert.py\u0060 and \u0060skills/markitdown/scripts/convert_literature.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/markitdown/scripts/batch_convert.py:334\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":"skills/markitdown/scripts/batch_convert.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"a249bebf7ef72503004396ffd3504b4289ee245e52ccb35fdd86a42cf07e69e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): skills/neurokit2/scripts/_common.py:150-163 | skills/pathml/scripts/_common.py:165-178 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/_common.py\u0060 and \u0060skills/pathml/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e4dc33c7a71d60b9ae09e241fb71f9bb8072d7861e68c6ea5a2134b2199048"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): skills/neurokit2/scripts/ecg_hrv_pipeline.py:305-318 | skills/neurokit2/scripts/eda_pipeline.py:284-297 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/ecg_hrv_pipeline.py\u0060 and \u0060skills/neurokit2/scripts/eda_pipeline.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/neurokit2/scripts/ecg_hrv_pipeline.py:305\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":"skills/neurokit2/scripts/ecg_hrv_pipeline.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8f7ac8ebd213e65f0f907cf834afe0eebf6504365c65fedf2c50e225f8a8a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): skills/neuropixels-analysis/assets/analysis_template.py:180-192 | skills/neuropixels-analysis/scripts/compute_metrics.py:92-105 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neuropixels-analysis/assets/analysis_template.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9ee6fa6a8ec1a7dc62841cba5f5838cff04eaa320ede9dfd64b06d6906361c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): skills/pathml/scripts/slide_manifest.py:116-129 | skills/pathml/scripts/validate_spatial_schema.py:247-260 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/pathml/scripts/slide_manifest.py:116\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":"skills/pathml/scripts/slide_manifest.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b22451a40017843326363460bb7664c03178deaa0652a6b218ee833b397b06b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): skills/pydicom/scripts/dicom_inventory.py:388-401 | skills/pydicom/scripts/uid_mapping_validator.py:225-238 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/dicom_inventory.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dafa969dad23f30bfa75085b380be7c12ef3cf2c901a575de24725680b5857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): skills/qutip/scripts/_common.py:132-145 | skills/simpy/scripts/_common.py:214-227 \u2014 before extracting anything, compare \u0060skills/qutip/scripts/_common.py\u0060 and \u0060skills/simpy/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"skills/qutip/scripts/_common.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab5492d82eac6259a0875d36ca4c10178610afd7cb6ef6e7b9841bb40e33022"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): skills/scikit-survival/scripts/_common.py:34-47 | skills/uncertainty-and-units/scripts/_common.py:99-112 \u2014 before extracting anything, compare \u0060skills/scikit-survival/scripts/_common.py\u0060 and \u0060skills/uncertainty-and-units/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 148 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scikit-survival/scripts/_common.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"732ff41ce93ef54975cc569e5a20455c5529bf36cee56d975de4546698e2a8fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 7): skills/hypogenic/scripts/_common.py:1276-1288 | skills/neurokit2/scripts/_common.py:224-236 | skills/pathml/scripts/_common.py:205-217 | skills/qutip/scripts/_common.py:296-308 | skills/scikit-survival/scripts/_common.py:191-203 | skills/simpy/scripts/_common.py:153-165 | skills/uncertainty-and-units/scripts/_common.py:276-288 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"204a15200e04a41557720444a1aa7f432d4c42b4cb73630f6374a4ce410ac7fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): skills/exploratory-data-analysis/scripts/_common.py:262-274 | skills/neurokit2/scripts/_common.py:198-210 | skills/qutip/scripts/_common.py:329-340 | skills/scientific-visualization/scripts/_common.py:75-86 \u2014 before extracting anything, compare \u0060skills/exploratory-data-analysis/scripts/_common.py\u0060 and \u0060skills/neurokit2/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/exploratory-data-analysis/scripts/_common.py:262\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":"skills/exploratory-data-analysis/scripts/_common.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5314d62a305d3ac515b51315ef0061a8d0b847301b4374179d9182f1d7446c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): skills/flowio/scripts/inspect_fcs.py:414-426 | skills/pysam/scripts/alignment_qc.py:293-305 | skills/pysam/scripts/inspect_hts.py:453-465 | skills/pysam/scripts/variant_summary.py:333-345 \u2014 before extracting anything, compare \u0060skills/pysam/scripts/alignment_qc.py\u0060 and \u0060skills/pysam/scripts/inspect_hts.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/flowio/scripts/inspect_fcs.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f7aa34ecef817dbc9916c261354ea48a43c4ddf604fbc531da86ce941fb08a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 4): skills/geniml/scripts/consensus_plan.py:51-61 | skills/geniml/scripts/embedding_plan.py:66-78 | skills/gtars/scripts/coverage_preflight.py:52-64 | skills/gtars/scripts/execution_plan.py:66-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/geniml/scripts/consensus_plan.py:51\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":"skills/geniml/scripts/consensus_plan.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb249717dde74106168c4208ac2a923f0c05bbd8bd1f0b8003e8b9c04b3ed549"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): skills/pydicom/scripts/deidentification_audit.py:348-360 | skills/pydicom/scripts/dicom_inventory.py:376-388 | skills/pydicom/scripts/extract_metadata.py:309-321 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/deidentification_audit.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"19afac8b25ee316ee0205533d5a580d34f5d629ddd8f1f6878906a0a5ae95c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): skills/clinical-decision-support/scripts/evidence_profile_check.py:220-232 | skills/clinical-decision-support/scripts/validate_cds_artifact.py:224-236 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/clinical-decision-support/scripts/validate_cds_artifact.py:224\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. 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":"skills/clinical-decision-support/scripts/evidence_profile_check.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f3bb058c7238af2df2622be438a26ae217275fbce63d72694ed4376f4f1e52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): skills/fluidsim/scripts/_common.py:358-370 | skills/pydicom/scripts/_common.py:567-579 \u2014 before extracting anything, compare \u0060skills/fluidsim/scripts/_common.py\u0060 and \u0060skills/pydicom/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d752f59a61b91b9d68279962523f070e3eaee7e09f747deaf29453e4244c7e9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): skills/geniml/scripts/_common.py:209-221 | skills/gtars/scripts/_common.py:205-217 \u2014 before extracting anything, compare \u0060skills/geniml/scripts/_common.py\u0060 and \u0060skills/gtars/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29dea0c8654a43d39caa7c2a38d84e0471bf23272a1a85c36ff9a605cc6df97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): skills/geniml/scripts/bed_validator.py:48-58 | skills/gtars/scripts/bed_validator.py:53-65 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/geniml/scripts/bed_validator.py:48\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":"skills/geniml/scripts/bed_validator.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10863154ffab6d1871ed327fe3b7da181a499b67383008acc7613ce3b6d6932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): skills/geniml/scripts/bed_validator.py:243-255 | skills/gtars/scripts/_common.py:392-401 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/geniml/scripts/bed_validator.py:243\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":"skills/geniml/scripts/bed_validator.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb937894cbf639b2f6ec966fdfca29ed5ad43ef55a4782b4a38275ec66b4596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): skills/neurokit2/scripts/_common.py:124-136 | skills/pathml/scripts/_common.py:139-151 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/_common.py\u0060 and \u0060skills/pathml/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/pathml/scripts/_common.py:138\u0060 calls \u0060_reject_links_below_root\u0060 and \u0060skills/neurokit2/scripts/_common.py:123\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a77e5a470e0deccc36d30dedf54ed14e0b8bd445d971aeb968e2866e629e3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): skills/neurokit2/scripts/_common.py:206-218 | skills/pathml/scripts/_common.py:243-253 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/_common.py\u0060 and \u0060skills/pathml/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0932479d9ce33e42a9517cd96a55b966f2469a03098a8e514e1ff027fd5ccdb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): skills/ontology-term-resolution/scripts/lookup_prefix.py:149-161 | skills/ontology-term-resolution/scripts/validate_terms.py:220-232 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/lookup_prefix.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"459eea72d045721dc947107c2b5353f0fb08afbb8d923556193a4baed2a7d5d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): skills/ontology-term-resolution/scripts/map_terms.py:137-149 | skills/ontology-term-resolution/scripts/resolve_terms.py:163-175 \u2014 before extracting anything, compare \u0060skills/ontology-term-resolution/scripts/map_terms.py\u0060 and \u0060skills/ontology-term-resolution/scripts/resolve_terms.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/map_terms.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c347d09c6d7026860a2ac9632442d71b4b26289a3c8f2897a5ee8c20f12f1c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): skills/ontology-term-resolution/scripts/map_terms.py:218-229 | skills/ontology-term-resolution/scripts/resolve_terms.py:248-260 \u2014 before extracting anything, compare \u0060skills/ontology-term-resolution/scripts/map_terms.py\u0060 and \u0060skills/ontology-term-resolution/scripts/resolve_terms.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/map_terms.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc50bcfc229a0bcd4421e8c79b1470501a2ced502027d4d6e8f36fd8eea9e8ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): skills/latex-posters/scripts/generate_schematic.py:185-196 | skills/literature-review/scripts/generate_schematic.py:185-196 | skills/scientific-schematics/scripts/generate_schematic.py:185-196 | skills/scientific-slides/scripts/generate_schematic.py:185-196 | skills/scientific-slides/scripts/generate_slide_image.py:183-194 \u2014 before extracting anything, compare \u0060skills/latex-posters/scripts/generate_schematic.py\u0060 and \u0060skills/literature-review/scripts/generate_schematic.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 164 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f07af2873d23e62332839d841bedbccb64b82a978416282dac49b2aa073423"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): skills/hypothesis-generation/scripts/_common.py:390-401 | skills/market-research-reports/scripts/_common.py:294-305 | skills/peer-review/scripts/_common.py:351-362 | skills/pytdc/scripts/_common.py:190-201 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/market-research-reports/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbe7e1d6ffde355290d8e3668ca3863c41af650b8088dccfc37f7f05f4ad874"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): skills/pydicom/scripts/deidentification_audit.py:347-358 | skills/pydicom/scripts/dicom_inventory.py:375-386 | skills/pydicom/scripts/extract_metadata.py:308-319 | skills/pydicom/scripts/pixel_frame_planner.py:289-300 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/deidentification_audit.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd43495443bbd53bad3c4fd46f0a6f39a08fb0a28c970e6b9f136c6d3867847"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): skills/qutip/scripts/_common.py:80-91 | skills/scikit-survival/scripts/_common.py:115-126 | skills/simpy/scripts/_common.py:77-88 | skills/uncertainty-and-units/scripts/_common.py:200-211 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060str | None\u0060 in one and \u0060Any\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qutip/scripts/_common.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d6b79de05f5fe3f096321ba7fa835cb0ed98255a8c74821ea9a9d462ce4e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): skills/clinical-decision-support/scripts/cohort_table_generator.py:55-66 | skills/clinical-decision-support/scripts/model_biomarker_evaluation.py:177-186 | skills/clinical-decision-support/scripts/validate_cds_artifact.py:177-186 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/clinical-decision-support/scripts/cohort_table_generator.py:55\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, \u0060skills/clinical-decision-support/scripts/validate_cds_artifact.py:187\u0060 calls \u0060require_nonempty_text\u0060, \u0060get\u0060 and \u0060skills/clinical-decision-support/scripts/cohort_table_generator.py:67\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":"skills/clinical-decision-support/scripts/cohort_table_generator.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85f4a1a13ef555ae025a471fc4bbb95215cbe1bf416a37373e15fbf1a20d7bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): skills/hypothesis-generation/scripts/_common.py:55-66 | skills/market-research-reports/scripts/_common.py:31-42 | skills/peer-review/scripts/_common.py:41-52 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/market-research-reports/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8023a01f387f31f0b73c4b68707922afd5ffbe5442a17e0137c544f98587b9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): skills/uncertainty-and-units/scripts/audit_units.py:558-569 | skills/uncertainty-and-units/scripts/check_plausibility.py:895-904 | skills/uncertainty-and-units/scripts/propagate_uncertainty.py:685-696 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The \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":"skills/uncertainty-and-units/scripts/audit_units.py"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad96ba95cd3d154977cced41e615819947501a423988cdcb0984096b72f2900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/fluidsim/scripts/_common.py:304-315 | skills/pydicom/scripts/_common.py:456-467 \u2014 before extracting anything, compare \u0060skills/fluidsim/scripts/_common.py\u0060 and \u0060skills/pydicom/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3f29f581e2c0a5b8268af4d614a981777d03081945d3862e01331cd920e6e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/hypogenic/scripts/plan_run.py:224-235 | skills/hypogenic/scripts/validate_config.py:85-96 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/plan_run.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e367d1ceb7caa3e602cfec3c7c1a5b3f2ce9833d5c1fa52394308aaf7ed7d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/hypothesis-generation/scripts/_common.py:257-268 | skills/peer-review/scripts/_common.py:230-241 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/peer-review/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5e80972a8f4ff1477351704eb0b6ccc724ddd1509d808427d8c016854b3b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/infographics/scripts/generate_infographic_ai.py:1219-1230 | skills/scientific-slides/scripts/generate_slide_image_ai.py:724-735 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic_ai.py\u0060 and \u0060skills/scientific-slides/scripts/generate_slide_image_ai.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0add51b8b8ac27a22545e4d655e53862706a2ff562283a7a36d273e2701707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/neurokit2/scripts/ecg_hrv_pipeline.py:68-79 | skills/neurokit2/scripts/eda_pipeline.py:54-65 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/ecg_hrv_pipeline.py\u0060 and \u0060skills/neurokit2/scripts/eda_pipeline.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/neurokit2/scripts/eda_pipeline.py:67\u0060 calls \u0060add_argument\u0060 and \u0060skills/neurokit2/scripts/ecg_hrv_pipeline.py:81\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":"skills/neurokit2/scripts/ecg_hrv_pipeline.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5625a91a118eb928cde7404d417450cb570043bedf4613aa6e19a32a24fec4bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/neurokit2/scripts/ecg_hrv_pipeline.py:90-101 | skills/neurokit2/scripts/eda_pipeline.py:85-96 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/ecg_hrv_pipeline.py\u0060 and \u0060skills/neurokit2/scripts/eda_pipeline.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/ecg_hrv_pipeline.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f2b33c4165088373fedcafbb4456154b2c00467406a45cdd8728d1577f02b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/qutip/scripts/_common.py:194-205 | skills/simpy/scripts/_common.py:294-305 \u2014 before extracting anything, compare \u0060skills/qutip/scripts/_common.py\u0060 and \u0060skills/simpy/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 154 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"skills/qutip/scripts/_common.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacbe982e28e27c70420ea7af4f2b5eecec5ee15b7ec8ceaa18f410ffcff26a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/scikit-survival/scripts/_common.py:233-244 | skills/uncertainty-and-units/scripts/_common.py:318-329 \u2014 before extracting anything, compare \u0060skills/scikit-survival/scripts/_common.py\u0060 and \u0060skills/uncertainty-and-units/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 148 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scikit-survival/scripts/_common.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"609408dcae3acd92e106b83622a257e5292e8a6d14dd90f23433664c605aa090"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): skills/timesfm-forecasting/scripts/check_system.py:135-145 | skills/timesfm-forecasting/scripts/check_system.py:181-192 \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 \u0060skills/timesfm-forecasting/scripts/check_system.py:135\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/timesfm-forecasting/scripts/check_system.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f0794e85d284331b28f5639fc1b46255b8ff2a504ada9910ce91c45f245434"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 6): skills/fluidsim/scripts/_common.py:325-334 | skills/pathml/scripts/_common.py:237-247 | skills/pydicom/scripts/_common.py:631-640 | skills/scikit-survival/scripts/_common.py:171-180 | skills/simpy/scripts/_common.py:133-142 | skills/uncertainty-and-units/scripts/_common.py:256-265 \u2014 before extracting anything, compare \u0060skills/fluidsim/scripts/_common.py\u0060 and \u0060skills/pydicom/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/pathml/scripts/_common.py:237\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":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dadba208d6b3d141bb31b20221822c5e14c22a5c2d218c8935d5bf16fe660c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): skills/geniml/scripts/corpus_auditor.py:85-95 | skills/geniml/scripts/embedding_plan.py:90-99 | skills/geniml/scripts/model_artifact_inspector.py:71-81 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/geniml/scripts/corpus_auditor.py:85\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":"skills/geniml/scripts/corpus_auditor.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0432138bd3b40158a11e300c324b9074948e8b7692f7d9d7de5c5a43713d9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): skills/pysam/scripts/alignment_qc.py:309-319 | skills/pysam/scripts/inspect_hts.py:469-479 | skills/pysam/scripts/variant_summary.py:349-359 \u2014 before extracting anything, compare \u0060skills/pysam/scripts/alignment_qc.py\u0060 and \u0060skills/pysam/scripts/inspect_hts.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pysam/scripts/alignment_qc.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad393e013b1e663e2d8e01122645c4196cdf7767d23dbd0dd4e1dd41f275cda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): skills/scholar-evaluation/scripts/calculate_scores.py:31-40 | skills/scholar-evaluation/scripts/check_traceability.py:204-214 | skills/scholar-evaluation/scripts/summarize_agreement.py:246-255 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/scholar-evaluation/scripts/calculate_scores.py:31\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/scholar-evaluation/scripts/check_traceability.py:203\u0060 calls \u0060add_argument\u0060 and \u0060skills/scholar-evaluation/scripts/calculate_scores.py:31\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scholar-evaluation/scripts/calculate_scores.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"622fa5b72a953e7729a38040f38cc881618b95c5dcd28a00829524b06f72871a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/clinical-decision-support/scripts/cohort_table_generator.py:70-80 | skills/clinical-decision-support/scripts/deidentification_checklist.py:202-212 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/cohort_table_generator.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae4d62122fbf857ff6ac00175f2e01babf173297e475f473e5243865f773967"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): skills/exa-search/scripts/exa_extract.py:81-90 | skills/exa-search/scripts/exa_search.py:94-104 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exa-search/scripts/exa_extract.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d64139e5d74a2a62b6ea58fb1e597e003a50f9c4647462d9b1a9d43a56707f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/flowio/scripts/inspect_fcs.py:435-445 | skills/pysam/scripts/inspect_hts.py:472-482 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/flowio/scripts/inspect_fcs.py:435\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/flowio/scripts/inspect_fcs.py:433\u0060 calls \u0060error\u0060 and \u0060skills/pysam/scripts/inspect_hts.py:470\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":"skills/flowio/scripts/inspect_fcs.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd49cba34d6869f5272c21a135a8c5f1afbb20d8d4347535f3ed403383ca3ed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/fluidsim/scripts/_common.py:203-213 | skills/pydicom/scripts/_common.py:371-381 \u2014 before extracting anything, compare \u0060skills/fluidsim/scripts/_common.py\u0060 and \u0060skills/pydicom/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a70223467338c82722b46105572d9ed472af662839b97a66423c53947b6677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): skills/hypogenic/scripts/_common.py:105-113 | skills/neurokit2/scripts/_common.py:62-72 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abbf0f496ebb5c41c7210e4c12d732966346cc9e93960287cff64526883995b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/neurokit2/scripts/_common.py:113-123 | skills/pathml/scripts/_common.py:127-137 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/_common.py\u0060 and \u0060skills/pathml/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/pathml/scripts/_common.py:138\u0060 calls \u0060_reject_links_below_root\u0060 and \u0060skills/neurokit2/scripts/_common.py:124\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a63a2d26959dd9dec15f9569388037bc6d9f968011f773e54797dc685d0866a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/pathml/scripts/slide_manifest.py:100-110 | skills/pathml/scripts/validate_spatial_schema.py:217-227 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/pathml/scripts/validate_spatial_schema.py:216\u0060 calls \u0060set\u0060 and \u0060skills/pathml/scripts/slide_manifest.py:99\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":"skills/pathml/scripts/slide_manifest.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0446037d240f0409710cc24a3d1f7e4cc4d0cc5a1442897f6f006c45bfad4e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/pkpd-modeling/scripts/_models.py:529-539 | skills/pkpd-modeling/scripts/_models.py:554-564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/_models.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"a206cae7a2c9e2951e30b28a489b3d7bde872ae77177b60bb1083ae07436e8fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/pptx-posters/scripts/_common.py:149-159 | skills/scientific-visualization/scripts/_common.py:109-119 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \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":"skills/pptx-posters/scripts/_common.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1e3caaf085de049c9397623653076191fb802976821ea89cfb05ad61adf9d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/protocolsio-integration/scripts/_common.py:347-357 | skills/protocolsio-integration/scripts/_common.py:377-387 \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 \u0060skills/protocolsio-integration/scripts/_common.py:347\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":"skills/protocolsio-integration/scripts/_common.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e984641d89d387feea6d82045ffea7b58440cae1520af771ef225a9ce9b6800"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 6): skills/pptx-posters/scripts/_common.py:54-63 | skills/qutip/scripts/_common.py:86-94 | skills/scientific-visualization/scripts/_common.py:28-37 | skills/scikit-survival/scripts/_common.py:121-129 | skills/simpy/scripts/_common.py:83-91 | skills/uncertainty-and-units/scripts/_common.py:206-214 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 6 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/pptx-posters/scripts/_common.py:54\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"skills/pptx-posters/scripts/_common.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46716fc83d135c9dfb9233f0b0e404c8f269156a196d56ec7717a64608a1c20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): skills/infographics/scripts/generate_infographic_ai.py:1174-1183 | skills/latex-posters/scripts/generate_schematic_ai.py:700-709 | skills/literature-review/scripts/generate_schematic_ai.py:700-709 | skills/scientific-schematics/scripts/generate_schematic_ai.py:700-709 | skills/scientific-slides/scripts/generate_schematic_ai.py:700-709 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic_ai.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/infographics/scripts/generate_infographic_ai.py:1174\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":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a2c87b4afe4f0bd8434848370af79a831e128280d2bee129955f12941d8cfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): skills/neurokit2/scripts/_common.py:277-287 | skills/pathml/scripts/_common.py:291-301 | skills/qutip/scripts/_common.py:132-141 | skills/simpy/scripts/_common.py:213-223 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/_common.py\u0060 and \u0060skills/pathml/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/neurokit2/scripts/_common.py:277\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":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb03bec009cfb7a77152dfdb861be6ee585d93ebb37ce40bf2ab0164f2f1e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): skills/ontology-term-resolution/scripts/lookup_prefix.py:148-157 | skills/ontology-term-resolution/scripts/map_terms.py:136-145 | skills/ontology-term-resolution/scripts/resolve_terms.py:162-171 | skills/ontology-term-resolution/scripts/validate_terms.py:219-228 \u2014 before extracting anything, compare \u0060skills/ontology-term-resolution/scripts/map_terms.py\u0060 and \u0060skills/ontology-term-resolution/scripts/resolve_terms.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/lookup_prefix.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4aa516b358e8132a116e6ef33f3d98a77dcfdfc2522909ab6b156e024d81d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): skills/qutip/scripts/_common.py:336-345 | skills/scikit-survival/scripts/_common.py:176-185 | skills/simpy/scripts/_common.py:138-147 | skills/uncertainty-and-units/scripts/_common.py:261-270 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qutip/scripts/_common.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"defdfa226f8c54c4fc6edba4a7b4a3d003b1d8277e66e9ff456d59e3f0709904"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): skills/clinical-decision-support/scripts/deidentification_checklist.py:53-62 | skills/clinical-decision-support/scripts/evidence_profile_check.py:53-62 | skills/clinical-decision-support/scripts/validate_cds_artifact.py:76-85 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The \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":"skills/clinical-decision-support/scripts/deidentification_checklist.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5e61308f8e02dc179cd3f93f2f931aae565716c2ad6e8a92d76dcd2bedb3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): skills/clinical-reports/scripts/check_deidentification.py:93-102 | skills/clinical-reports/scripts/provenance_validator.py:70-79 | skills/clinical-reports/scripts/terminology_validator.py:162-171 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/check_deidentification.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c15a0d7961f51beef3feac29ae3ca35bda65ce6923ff9f796ac02327ca7dc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): skills/hypothesis-generation/scripts/_common.py:295-304 | skills/market-research-reports/scripts/_common.py:203-212 | skills/peer-review/scripts/_common.py:268-277 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/market-research-reports/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"41132c020d3b4e83e0326502504ecb8a7f7bfdf11edf952463aaaebfe84d4ff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): skills/scholar-evaluation/scripts/calculate_scores.py:28-37 | skills/scholar-evaluation/scripts/generate_report_scaffold.py:190-201 | skills/scholar-evaluation/scripts/summarize_agreement.py:243-252 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/scholar-evaluation/scripts/calculate_scores.py:28\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":"skills/scholar-evaluation/scripts/calculate_scores.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d7d1d340641a2cf6b4d077acfeca0d20639099f45a9f4fe8626f34f35777e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): skills/iso-standards-readiness/scripts/_common.py:334-342 | skills/iso-standards-readiness/scripts/_common.py:389-398 \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 \u0060skills/iso-standards-readiness/scripts/_common.py:389\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/iso-standards-readiness/scripts/_common.py:343\u0060 calls \u0060choice\u0060 and \u0060skills/iso-standards-readiness/scripts/_common.py:399\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":"skills/iso-standards-readiness/scripts/_common.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3eca07f93a99deb4b5d285afc17184242542ebd197ad49b7545766f0b290b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): skills/onekgpd/scripts/onekgpd_api.py:102-111 | skills/onekgpd/scripts/onekgpd_meta.py:70-79 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/onekgpd/scripts/onekgpd_api.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7099d7d4d448cf9ef9973d649265f3f854ce72fbc1b410285cafb78cba6d44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/pyopenms/scripts/detect_features_centroided.py:71-81 | skills/pyopenms/scripts/detect_features_metabo.py:99-109 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/detect_features_centroided.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9748969c827af176650ede9058cb8263a1834519a0aceb2cd141c4e031f8033"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): skills/scikit-survival/scripts/train_survival_model.py:62-71 | skills/scikit-survival/scripts/validate_survival_csv.py:52-61 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scikit-survival/scripts/train_survival_model.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d273493f95ad0ba272ccd7f9bbb6e78b001e250437440aea339f9b0ab1f8f851"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): skills/simpy/scripts/_common.py:344-353 | skills/simpy/scripts/_common.py:358-367 \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 \u0060skills/simpy/scripts/_common.py:344\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":"skills/simpy/scripts/_common.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ac70f62506e618b599f408da190ade44301ea89e677feb625d0e27a732a690"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9): skills/exploratory-data-analysis/scripts/_common.py:267-275 | skills/fluidsim/scripts/_common.py:327-335 | skills/neurokit2/scripts/_common.py:203-211 | skills/pathml/scripts/_common.py:240-248 | skills/pydicom/scripts/_common.py:633-641 | skills/qutip/scripts/_common.py:333-341 | skills/scikit-survival/scripts/_common.py:173-181 | skills/simpy/scripts/_common.py:135-143 | skills/uncertainty-and-units/scripts/_common.py:258-266 \u2014 before extracting anything, compare \u0060skills/exploratory-data-analysis/scripts/_common.py\u0060 and \u0060skills/neurokit2/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/exploratory-data-analysis/scripts/_common.py:267\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":"skills/exploratory-data-analysis/scripts/_common.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce568f3bf8f33576986eda54aeb8f002130bb304ec55e3b7a5a25926cdf1ea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): skills/infographics/scripts/generate_infographic_ai.py:1217-1225 | skills/latex-posters/scripts/generate_schematic_ai.py:742-750 | skills/literature-review/scripts/generate_schematic_ai.py:742-750 | skills/scientific-schematics/scripts/generate_schematic_ai.py:742-750 | skills/scientific-slides/scripts/generate_schematic_ai.py:742-750 | skills/scientific-slides/scripts/generate_slide_image_ai.py:722-730 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic_ai.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/infographics/scripts/generate_infographic_ai.py:1226\u0060 calls \u0060get\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py:751\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75b30f4c8b6952794364ec5ab401b0ed0b8e06f27a0c97f2edf5bd45c16631a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): skills/gtars/scripts/bed_validator.py:90-98 | skills/gtars/scripts/coverage_preflight.py:123-131 | skills/gtars/scripts/execution_plan.py:136-144 | skills/gtars/scripts/tokenizer_manifest.py:89-97 \u2014 before extracting anything, compare \u0060skills/gtars/scripts/bed_validator.py\u0060 and \u0060skills/gtars/scripts/tokenizer_manifest.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gtars/scripts/bed_validator.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddbde13881494103b7dc7dea2940c78de50871ad241348a633fdbb8e68c4be3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): skills/neurokit2/scripts/_common.py:333-341 | skills/pathml/scripts/_common.py:353-361 | skills/pptx-posters/scripts/_common.py:259-267 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/_common.py\u0060 and \u0060skills/pathml/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d759db0b9eb8452cb68ef36a9b15e2ad02ea73ac141d225e51ee81677308aa9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 3): skills/ontology-term-resolution/scripts/id_client.py:68-73 | skills/ontology-term-resolution/scripts/ols_client.py:79-87 | skills/ontology-term-resolution/scripts/zooma_client.py:78-84 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ontology-term-resolution/scripts/id_client.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc0fa1c745a06535d203c100bf22f9f50e316c829870f9c791da8a3fb8f59a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): skills/pathml/scripts/_common.py:315-323 | skills/qutip/scripts/_common.py:155-163 | skills/simpy/scripts/_common.py:255-263 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathml/scripts/_common.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84dbb0c70ee1a9aa8d073e68accefed50f19d7ac519f7024abb2e5700da2bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): skills/uncertainty-and-units/scripts/audit_units.py:501-509 | skills/uncertainty-and-units/scripts/check_plausibility.py:710-718 | skills/uncertainty-and-units/scripts/format_result.py:258-266 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/uncertainty-and-units/scripts/audit_units.py:501\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":"skills/uncertainty-and-units/scripts/audit_units.py"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5903908c568194e5fdcca92a76fa84a315176b2cf230ae4b23544c66e1d8ff7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/analytical-method-validation/scripts/_common.py:100-108 | skills/simpy/scripts/_common.py:380-388 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/_common.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c50a945802d6bdb3f98fff00daf040676504cef59f3e0904f0c09486bf11544"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/clinical-decision-support/scripts/deidentification_checklist.py:248-256 | skills/clinical-decision-support/scripts/model_biomarker_evaluation.py:350-358 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/deidentification_checklist.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c9df911309ed077214d8288c7031d994ab9c233f4108651022baac92d880d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/dnanexus-integration/scripts/inspect_dxpy.py:288-296 | skills/latchbio-integration/scripts/inspect_latch_sdk.py:222-230 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/dnanexus-integration/scripts/inspect_dxpy.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"262a825865f063068a84faef0d0e600307075b4cd6209c739a650aba697ae9ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/exploratory-data-analysis/scripts/distribution_sensitivity.py:73-81 | skills/exploratory-data-analysis/scripts/missingness_leakage_audit.py:84-92 \u2014 before extracting anything, compare \u0060skills/exploratory-data-analysis/scripts/distribution_sensitivity.py\u0060 and \u0060skills/exploratory-data-analysis/scripts/missingness_leakage_audit.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 67 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/exploratory-data-analysis/scripts/distribution_sensitivity.py:73\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":"skills/exploratory-data-analysis/scripts/distribution_sensitivity.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d217d32fafe54c356bc4cc85efee723bee48819b4bc2b8e6a42fa9673b42a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/geniml/scripts/_common.py:84-92 | skills/gtars/scripts/_common.py:78-86 \u2014 before extracting anything, compare \u0060skills/geniml/scripts/_common.py\u0060 and \u0060skills/gtars/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24ee933ec0d96a8057ef77196913acb0e0c6e5836195ff5355989058eb8d567"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/geniml/scripts/_common.py:147-155 | skills/gtars/scripts/_common.py:141-149 \u2014 before extracting anything, compare \u0060skills/geniml/scripts/_common.py\u0060 and \u0060skills/gtars/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"520e7c9251fcc39744f5253db7e4c578aa8194a8c5b0ba24bc3aab99ffe6c0b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/geniml/scripts/consensus_plan.py:132-140 | skills/geniml/scripts/corpus_auditor.py:115-123 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/consensus_plan.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a35966c83eec866a92cdeb45811b55879c72eebde10777894c18e2c24d1f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/hypothesis-generation/scripts/_common.py:159-167 | skills/market-research-reports/scripts/_common.py:98-106 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/market-research-reports/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"919e57f5014c601e906cd8e9de27718f7bab4940844623f150eaaa997894aa46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/hypothesis-generation/scripts/_common.py:341-349 | skills/peer-review/scripts/_common.py:313-321 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/peer-review/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d55dd616e9f085b6889975183c75c37b8256d64adda62b7b40ba9777b4d7f9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): skills/infographics/scripts/generate_infographic.py:211-219 | skills/infographics/scripts/generate_infographic_ai.py:1306-1313 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/infographics/scripts/generate_infographic.py:211\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":"skills/infographics/scripts/generate_infographic.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a68736006da38db76ab87229f290851ec258faff7d278794ec3e819b9c70e27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): skills/market-research-reports/scripts/audit_claim_citations.py:200-207 | skills/market-research-reports/scripts/validate_evidence_ledger.py:186-194 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/market-research-reports/scripts/audit_claim_citations.py:200\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":"skills/market-research-reports/scripts/audit_claim_citations.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd694d9f194e4eb6d985ecbad50f6816662c093dd58891b783f0166c43bccbba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/pytdc/scripts/benchmark_evaluation.py:369-377 | skills/pytdc/scripts/load_and_split_data.py:387-395 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/pytdc/scripts/benchmark_evaluation.py:369\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pytdc/scripts/benchmark_evaluation.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b88ec4192ac9a370861b7c3f2c813e7d7c93c56f5b8fef6d31155854360219"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/scientific-brainstorming/scripts/_common.py:177-185 | skills/uncertainty-and-units/scripts/_common.py:340-348 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-brainstorming/scripts/_common.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"344d9bcbcb037157afb9e4b9204b22c80ea8e935052cad586cc3a1bdd897524b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): skills/qutip/scripts/_common.py:117-124 | skills/scikit-survival/scripts/_common.py:156-163 | skills/simpy/scripts/_common.py:118-125 | skills/uncertainty-and-units/scripts/_common.py:241-248 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qutip/scripts/_common.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9054454e1cf8af222f0f45e8a2661fb598af005f00ade3b7b9d7de0df0dc0ebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): skills/hypothesis-generation/scripts/_common.py:223-230 | skills/peer-review/scripts/_common.py:196-203 | skills/pylabrobot/scripts/_common.py:171-178 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/peer-review/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe5e8fecaba533822d21b334d96a3c79ff3b7b3f097ffb8d8d9426fd8ca6761"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): skills/iso-standards-readiness/scripts/audit_document_records.py:46-53 | skills/iso-standards-readiness/scripts/check_qmsr_transition.py:79-86 | skills/iso-standards-readiness/scripts/check_traceability.py:74-81 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/iso-standards-readiness/scripts/check_traceability.py:82\u0060 calls \u0060choice\u0060 and \u0060skills/iso-standards-readiness/scripts/audit_document_records.py:54\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/audit_document_records.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"626b63e15ad8f364f9772b5f281c9b257990541a9153eb69c543b7da4c1f3a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): skills/pyopenms/scripts/detect_features_centroided.py:58-65 | skills/pyopenms/scripts/detect_features_metabo.py:82-89 | skills/pyopenms/scripts/process_spectra.py:47-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/detect_features_centroided.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ca2f8759428dbecbd3754861e8fe59d4ffaacdef67b0391bb7be1dc6c0a063"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/clinical-decision-support/scripts/decision_logic_traceability.py:231-240 | skills/clinical-decision-support/scripts/deidentification_checklist.py:188-195 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/decision_logic_traceability.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b34f71ca985d9cd816b23cc0d1c05610090fd90c01107b8b319b1bb25cd1cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/clinical-decision-support/scripts/deidentification_checklist.py:187-194 | skills/clinical-decision-support/scripts/model_biomarker_evaluation.py:174-181 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/deidentification_checklist.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9936b60431e0454958bac82696d1ff16866aa2e3a5b5e10f820d7f5ad0155d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/clinical-reports/scripts/consistency_checker.py:57-64 | skills/pylabrobot/scripts/_common.py:196-203 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/consistency_checker.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1affa5d049c6a9198c6512faeb17ec85f707a97f839c5b5887a90415fec39f58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/dnanexus-integration/scripts/inspect_dxpy.py:300-307 | skills/latchbio-integration/scripts/inspect_latch_sdk.py:237-244 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/dnanexus-integration/scripts/inspect_dxpy.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbcdc139fd8c1dd28d97fee592cd6e9fe65c4e3a9a74439a7c214c645f373de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/hypogenic/scripts/_common.py:159-166 | skills/neurokit2/scripts/_common.py:122-129 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/neurokit2/scripts/_common.py:130\u0060 calls \u0060_reject_symlink_components\u0060 and \u0060skills/hypogenic/scripts/_common.py:167\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":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"257bb383ab217d3011ed68a31933fd513bb6097f68948956bdcbd1f23d88ec23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/iso-standards-readiness/scripts/check_qmsr_transition.py:76-83 | skills/iso-standards-readiness/scripts/validate_evidence_manifest.py:124-131 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/check_qmsr_transition.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14d21aef7a509408cb9b44bc6757409368f360b5ca8b72b8c51322024bddf76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/lab-hardware-cad/scripts/check.py:234-242 | skills/lab-hardware-cad/scripts/check.py:340-348 \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 \u0060skills/lab-hardware-cad/scripts/check.py:234\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":"skills/lab-hardware-cad/scripts/check.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"6606204a2b6524cc83f9f6b8ea9b626e4bff7df2ca04a3426ceb71e40436d6c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/neurokit2/scripts/_common.py:345-352 | skills/pathml/scripts/_common.py:367-374 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/_common.py\u0060 and \u0060skills/pathml/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e958de0219add05fbc8d0bc7c90145f303c01aaa281413cf11ef5501e79b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/neurokit2/scripts/_common.py:403-410 | skills/neurokit2/scripts/inspect_signal.py:190-197 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adf0ac97af89e018252905acd3969f75b11bb3193a9cd8f72033de2ee3011f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/scientific-visualization/scripts/export_plan.py:38-45 | skills/scientific-visualization/scripts/style_presets.py:296-303 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/export_plan.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"10855027865349e56169f7eee51f2c4a8aadb7fbd6800e07aa6d678b47e2d375"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 14): scripts/generate_skill_image.py:410-416 | skills/generate-image/scripts/generate_image.py:126-132 | skills/infographics/scripts/generate_infographic.py:82-88 | skills/infographics/scripts/generate_infographic_ai.py:142-148 | skills/latex-posters/scripts/generate_schematic.py:69-75 | skills/latex-posters/scripts/generate_schematic_ai.py:140-146 | skills/literature-review/scripts/generate_schematic.py:69-75 | skills/literature-review/scripts/generate_schematic_ai.py:140-146 | skills/scientific-schematics/scripts/generate_schematic.py:69-75 | skills/scientific-schematics/scripts/generate_schematic_ai.py:140-146 | skills/scientific-slides/scripts/generate_schematic.py:69-75 | skills/scientific-slides/scripts/generate_schematic_ai.py:140-146 | skills/scientific-slides/scripts/generate_slide_image.py:72-78 | skills/scientific-slides/scripts/generate_slide_image_ai.py:153-159 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 14 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 14 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/generate-image/scripts/generate_image.py:124\u0060 calls \u0060startswith\u0060, \u0060strip\u0060 and \u0060skills/infographics/scripts/generate_infographic.py:81\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":"scripts/generate_skill_image.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdb9c23581a55eb1622a1210d6d8a4565e26b171048af95b2ffc212d67b88c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): skills/clinical-reports/scripts/check_deidentification.py:293-299 | skills/clinical-reports/scripts/consistency_checker.py:377-383 | skills/clinical-reports/scripts/provenance_validator.py:255-261 | skills/clinical-reports/scripts/terminology_validator.py:266-272 | skills/clinical-reports/scripts/validate_case_report.py:267-273 | skills/clinical-reports/scripts/validate_trial_report.py:523-529 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 6 call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/check_deidentification.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3ef8c613de855fe7bcad7bff72d7a9d97f6d6c646ac1560eb41ad10f2bb6ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 5): skills/iso-standards-readiness/scripts/audit_document_records.py:36-42 | skills/iso-standards-readiness/scripts/check_capa.py:53-58 | skills/iso-standards-readiness/scripts/check_qmsr_transition.py:27-32 | skills/iso-standards-readiness/scripts/check_supplier_controls.py:60-65 | skills/iso-standards-readiness/scripts/check_traceability.py:65-70 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/audit_document_records.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec1a74112339b1ee10aa17e7bb4e30e47219be3a7ed86afbe958e271658e9a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): skills/qutip/scripts/_common.py:119-125 | skills/scientific-visualization/scripts/_common.py:62-69 | skills/scikit-survival/scripts/_common.py:158-164 | skills/simpy/scripts/_common.py:120-126 | skills/uncertainty-and-units/scripts/_common.py:243-249 \u2014 before extracting anything, compare \u0060skills/qutip/scripts/_common.py\u0060 and \u0060skills/scientific-visualization/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qutip/scripts/_common.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf33ed8faaad151d5a918a45d724506f37d83ec1b06b0ce950e93a13526a026"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): skills/neurokit2/scripts/_common.py:301-307 | skills/pathml/scripts/_common.py:317-323 | skills/qutip/scripts/_common.py:157-163 | skills/simpy/scripts/_common.py:257-263 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/_common.py\u0060 and \u0060skills/pathml/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da6505a2b511e58340d63698949090b72ba97554fa64bc5e5a6e97116e79e50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): skills/iso-standards-readiness/scripts/check_qmsr_transition.py:29-35 | skills/iso-standards-readiness/scripts/check_supplier_controls.py:62-68 | skills/iso-standards-readiness/scripts/validate_evidence_manifest.py:97-103 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/check_qmsr_transition.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab4929f564b5dad4338ffd2881d5a9557fbcf50b6d0d5033d7b1ead1b2ece98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scan_pr_skills.py:93-99 | scan_skills.py:520-526 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scan_pr_skills.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d569de2cd1f21718c38ad98b7f14e40e31f4474c593b6b35f38fcbedd657ef81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/analytical-method-validation/scripts/_common.py:71-77 | skills/analytical-method-validation/scripts/_common.py:80-86 \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":"skills/analytical-method-validation/scripts/_common.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3747a9b768b6042a8dcc60d6300f3a52725f49701de03650042ce0d86e5145"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/citation-management/scripts/extract_metadata.py:469-475 | skills/citation-management/scripts/validate_citations.py:567-573 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/extract_metadata.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"387bb01d9c8401979f325e9b6ab245db9e4aa7f697c37e58cd3d961876ec62e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/exploratory-data-analysis/scripts/_common.py:205-211 | skills/neurokit2/scripts/_common.py:163-169 \u2014 before extracting anything, compare \u0060skills/exploratory-data-analysis/scripts/_common.py\u0060 and \u0060skills/neurokit2/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_common.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"837027224179a362fd9165e64c12813fb12704a78df4a915fb5dcefe59a44400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/onekgpd/scripts/onekgpd_meta.py:305-312 | skills/onekgpd/scripts/onekgpd_meta.py:334-341 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/onekgpd/scripts/onekgpd_meta.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"342d6b1b56313d0c103a95df42a0f6d089683c77f0990bcf588a10a005a44228"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/pkpd-modeling/scripts/bioequivalence.py:127-133 | skills/pkpd-modeling/scripts/bioequivalence.py:152-158 \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 \u0060skills/pkpd-modeling/scripts/bioequivalence.py:127\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/bioequivalence.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"82734f5acf2a0c0581c18ac559342076e2e81159eee9107890e1d833e043651f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/pkpd-modeling/scripts/nca.py:282-288 | skills/pkpd-modeling/scripts/nca.py:306-312 \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":"skills/pkpd-modeling/scripts/nca.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"04309f9b76badff728d022323b6963588e5bb27217d7fde2e9f75e3a0ff847a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/relsa-severity-assessment/scripts/kde_thresholds.py:348-354 | skills/relsa-severity-assessment/scripts/relsa_score.py:352-358 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/kde_thresholds.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e57df94153fde63eabb2b2db74bcc621fb53e3d1114baa4516bf804a8ab2881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/research-lookup/scripts/research_lookup.py:774-780 | skills/research-lookup/scripts/research_lookup.py:845-851 \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 \u0060skills/research-lookup/scripts/research_lookup.py:774\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":"skills/research-lookup/scripts/research_lookup.py"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"a256c78b7d0c425124a06ea0c0625282d065df6b6ebffac3e405cc040e4bef93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/scanpy/scripts/preprocess.py:39-46 | skills/scanpy/scripts/score_genes.py:43-49 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/scanpy/scripts/preprocess.py:39\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scanpy/scripts/preprocess.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2119bf2486e6b4d0519a89e04a2175f5a51a4b6a7f01d4c064096da8ad60ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/scanpy/scripts/preprocess.py:41-47 | skills/scanpy/scripts/reduce_dimensions.py:32-38 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/scanpy/scripts/preprocess.py:41\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":"skills/scanpy/scripts/preprocess.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6863251a0b001c186b7362d4dd8401e22fe04e1ae860d5438bcb8487e73bf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/scientific-visualization/scripts/_common.py:56-62 | skills/scientific-visualization/scripts/figure_export.py:202-208 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/_common.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"181de78686bf62f0f7d391ab0aee4ca91ed9d11967abab679a49fe419414c8e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): skills/iso-standards-readiness/scripts/_common.py:395-400 | skills/iso-standards-readiness/scripts/audit_document_records.py:111-116 | skills/iso-standards-readiness/scripts/check_supplier_controls.py:95-100 | skills/iso-standards-readiness/scripts/check_traceability.py:102-107 | skills/iso-standards-readiness/scripts/validate_evidence_manifest.py:189-194 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/_common.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98ec35f177d483b3ee968166a48db6cbc446a328125d24b5cbd6367fe338e0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): skills/neurokit2/scripts/_common.py:303-308 | skills/pathml/scripts/_common.py:319-324 | skills/pptx-posters/scripts/_common.py:214-219 | skills/qutip/scripts/_common.py:159-164 | skills/simpy/scripts/_common.py:259-264 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/_common.py\u0060 and \u0060skills/pathml/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1406a493af185ad48c114f4f5bc44e23403822090dae86f764e2aa60bacbca9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): skills/pathml/scripts/_common.py:350-356 | skills/pptx-posters/scripts/_common.py:257-262 | skills/qutip/scripts/_common.py:191-197 | skills/simpy/scripts/_common.py:291-297 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060Any\u0060 in one and \u0060str | os.PathLike[str]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pathml/scripts/_common.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab3df9c1414ad2e6a98f5169868f4a3abfc4a13aa9f07e01a51f30bb2c2822f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): skills/citation-management/scripts/search_google_scholar.py:255-260 | skills/citation-management/scripts/search_openalex.py:316-321 | skills/citation-management/scripts/search_pubmed.py:425-430 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/search_google_scholar.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"1214603219919800d8da9d4550ae026d609f5a73ecb58d3e656cf4303b1d5b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): skills/hypothesis-generation/scripts/_common.py:342-347 | skills/market-research-reports/scripts/_common.py:275-280 | skills/peer-review/scripts/_common.py:314-319 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/market-research-reports/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1ec210bbb5dc42b0531eb63195800ac535f99d62b61d09ec6f08a5bd45f3eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/citation-management/scripts/extract_metadata.py:730-735 | skills/citation-management/scripts/search_google_scholar.py:255-260 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/citation-management/scripts/search_google_scholar.py:251\u0060 calls \u0060metadata_to_bibtex\u0060, \u0060join\u0060 and \u0060skills/citation-management/scripts/extract_metadata.py:727\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":"skills/citation-management/scripts/extract_metadata.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3ab40f0c5952afedcd1d82fe8470d7e10cde370f21a99e25d40026446c05e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/etetoolkit/scripts/tree_operations.py:388-393 | skills/etetoolkit/scripts/tree_operations.py:409-414 \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":"skills/etetoolkit/scripts/tree_operations.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e4ca0aa812f24e703a692c27ac49b98958b8376463deed364dd28205bffd83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/geniml/scripts/bed_validator.py:149-155 | skills/gtars/scripts/_common.py:356-361 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/geniml/scripts/bed_validator.py:149\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/bed_validator.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdae98a646d3f3bb0b4ac88724c4b9af5d93ff2960163275a248a08bade38c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/iso-standards-readiness/scripts/check_traceability.py:43-48 | skills/iso-standards-readiness/scripts/validate_evidence_manifest.py:68-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/check_traceability.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d83dcd01097ae91d2af72cb7d3b17c7c1e2325d97c980ad56e1418680fc8f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): skills/iso-standards-readiness/scripts/audit_document_records.py:38-42 | skills/iso-standards-readiness/scripts/check_capa.py:54-58 | skills/iso-standards-readiness/scripts/check_qmsr_transition.py:28-32 | skills/iso-standards-readiness/scripts/check_supplier_controls.py:61-65 | skills/iso-standards-readiness/scripts/check_traceability.py:66-70 | skills/iso-standards-readiness/scripts/validate_evidence_manifest.py:96-100 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 6 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/audit_document_records.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2486f6bdb6609a14238409585f46653663111a20c3e0fc4252c759778ca6623"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): skills/neurokit2/scripts/_common.py:332-336 | skills/pathml/scripts/_common.py:352-356 | skills/pptx-posters/scripts/_common.py:258-262 | skills/qutip/scripts/_common.py:193-197 | skills/simpy/scripts/_common.py:293-297 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/_common.py\u0060 and \u0060skills/pathml/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060Any\u0060 in one and \u0060str | os.PathLike[str]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1e446c2391096eaff84bf3d5cf555765c8998f4247f530f3f7e4c0bc9e858f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): skills/clinical-decision-support/scripts/decision_logic_traceability.py:128-133 | skills/clinical-decision-support/scripts/deidentification_checklist.py:102-107 | skills/clinical-decision-support/scripts/evidence_profile_check.py:107-111 | skills/clinical-decision-support/scripts/model_biomarker_evaluation.py:209-213 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/clinical-decision-support/scripts/decision_logic_traceability.py:128\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":"skills/clinical-decision-support/scripts/decision_logic_traceability.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb2dea4b396fa0c767f0afd40c32430ed773702c9bc54e891b472d6773cf893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): skills/clinical-decision-support/scripts/cohort_table_generator.py:62-66 | skills/clinical-decision-support/scripts/model_biomarker_evaluation.py:182-186 | skills/clinical-decision-support/scripts/validate_cds_artifact.py:118-124 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/cohort_table_generator.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb23cc0d67bcd14e65b9dbf5c1bc41a7405b6ccdf9c971913123e32087ad3db6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): skills/clinical-decision-support/scripts/cohort_table_generator.py:89-95 | skills/clinical-decision-support/scripts/decision_logic_traceability.py:129-135 | skills/clinical-decision-support/scripts/model_biomarker_evaluation.py:210-214 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. 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":"skills/clinical-decision-support/scripts/cohort_table_generator.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd20231b0f2fbf38522a61fadd15488783fed79899c12a7028db7661952f5b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/genomic-coordinates/scripts/audit_intervals.py:85-90 | skills/genomic-coordinates/scripts/check_contigs.py:73-78 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060path\u0060 to \u0060Path | None\u0060 in one and \u0060Path\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/audit_intervals.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fe538f69fd979951e14ec0fac5cadbfdf84f87b4b3690441f86df5a3411d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/hugging-science/scripts/fetch_catalog.py:296-300 | skills/hugging-science/scripts/fetch_catalog.py:318-322 \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":"skills/hugging-science/scripts/fetch_catalog.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ef57163cc1d9edb10062f0608af912f491b217407a9febf2f99f9e66b98376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/neuropixels-analysis/scripts/export_to_phy.py:65-69 | skills/neuropixels-analysis/scripts/preprocess_recording.py:114-118 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neuropixels-analysis/scripts/export_to_phy.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e106f137b41146268d8aea0110cbc966ccca59d35f59cd45a539ccdec14acb31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/pyopenms/scripts/detect_features_centroided.py:49-53 | skills/pyopenms/scripts/detect_features_metabo.py:69-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/pyopenms/scripts/detect_features_centroided.py:54\u0060 calls \u0060add_argument\u0060 and \u0060skills/pyopenms/scripts/detect_features_metabo.py:74\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":"skills/pyopenms/scripts/detect_features_centroided.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2af961bfaad1c664b7039de81650e6c7725dd94ad07b5b5395693595db133ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/qutip/scripts/convergence_sweep.py:319-323 | skills/qutip/scripts/two_level_simulation.py:372-376 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/qutip/scripts/convergence_sweep.py:319\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":"skills/qutip/scripts/convergence_sweep.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9b556573272c862ae3dc3660aafc9b809da2342e78875b1c6ac0a5fc8b0567"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): skills/cellprofiler/scripts/nuclei_assay.py:17-21 | skills/flowio/scripts/inspect_fcs.py:134-138 | skills/qiime2-amplicon/scripts/amplicon_workflow.py:228-232 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/cellprofiler/scripts/nuclei_assay.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2439045ff978a2dcfd4fa01f53893c89bb7e10c74bdf931720f8f4a9196b3216"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/citation-management/scripts/extract_metadata.py:246-256 | skills/citation-management/scripts/search_pubmed.py:188-196 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/citation-management/scripts/extract_metadata.py:246\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/citation-management/scripts/extract_metadata.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"622cc03a2b52632b29a641f6d182b267771c603fb64e8e252de4f29bb13574e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): skills/clinical-reports/scripts/_common.py:94-99 | skills/hypothesis-generation/scripts/_common.py:35-40 | skills/peer-review/scripts/_common.py:31-36 | skills/pylabrobot/scripts/_common.py:60-65 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/peer-review/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/_common.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e903e28101bc5ffb5d12fd8d8f54fe0e511f808068dc6eaec45b21aa61ba716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): skills/clinical-reports/scripts/check_deidentification.py:276-285 | skills/clinical-reports/scripts/consistency_checker.py:360-369 | skills/clinical-reports/scripts/provenance_validator.py:238-247 | skills/clinical-reports/scripts/validate_trial_report.py:506-515 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/check_deidentification.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfffc8cfb938eab6f7ddbbe5add9780daad343f48ca949fa6c0a1af26d34c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/etetoolkit/scripts/quick_visualize.py:31-38 | skills/etetoolkit/scripts/tree_operations.py:33-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/etetoolkit/scripts/quick_visualize.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6797bbe006e8806cd2e3d2f5550f11674ec0142865bb9fbe846315d888607a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): skills/exploratory-data-analysis/scripts/_common.py:45-51 | skills/pathml/scripts/_common.py:334-340 | skills/qutip/scripts/_common.py:174-180 | skills/simpy/scripts/_common.py:274-280 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. 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":"skills/exploratory-data-analysis/scripts/_common.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2729e967c6894dcc59e0a8be4c6ce3fefa1a0ec10942dd466d25b6add3e1e52c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/exploratory-data-analysis/scripts/_common.py:392-397 | skills/hypogenic/scripts/_common.py:80-85 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"skills/exploratory-data-analysis/scripts/_common.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2aece8082625f7f35825ae60847864bac91a6282ea7603094e1d0624f25495"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/exploratory-data-analysis/scripts/_common.py:458-468 | skills/pathml/scripts/_common.py:391-401 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_common.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12560338b8373bd22291d896c8976e8d6d1e06a61d75e536df536ac8ffb57e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/fluidsim/scripts/_common.py:347-352 | skills/pydicom/scripts/_common.py:558-563 \u2014 before extracting anything, compare \u0060skills/fluidsim/scripts/_common.py\u0060 and \u0060skills/pydicom/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f6b3103d9dc8f335238aaa5d904471426dc5ea4b2f431a3fc405e5529b2d13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/geniml/scripts/_common.py:96-104 | skills/gtars/scripts/_common.py:90-98 \u2014 before extracting anything, compare \u0060skills/geniml/scripts/_common.py\u0060 and \u0060skills/gtars/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"30da918e4b16c980529848ca7b51b159df56e848577e59c7a40282b901bfa314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/geniml/scripts/_common.py:225-232 | skills/gtars/scripts/_common.py:450-457 \u2014 before extracting anything, compare \u0060skills/geniml/scripts/_common.py\u0060 and \u0060skills/gtars/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 114 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5e27bb0dea971585a84b1bd4a0bc56193e259493825560e23ccf3360ce37c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/geniml/scripts/consensus_plan.py:406-412 | skills/geniml/scripts/embedding_plan.py:472-478 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/consensus_plan.py"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eac84079dddd03878ce384c758bef7fdaa3cec57bf3daf81c57ea23bd1f199d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): skills/geniml/scripts/model_artifact_inspector.py:367-373 | skills/geniml/scripts/tokenizer_compatibility.py:311-317 | skills/gtars/scripts/artifact_inspector.py:318-324 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/model_artifact_inspector.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef357424ea5fb89b2244092e3a8540c8b3a46ff8e4a360572c32092f67a31c04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/geopandas/scripts/_common.py:66-73 | skills/pymatgen/scripts/_common.py:184-191 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \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":"skills/geopandas/scripts/_common.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe674f87da43bfc42a018aa1865178c3cdddb1562d47ee44a8461a146261075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): skills/geopandas/scripts/_common.py:302-307 | skills/matlab/scripts/_common.py:148-153 | skills/neurokit2/scripts/_common.py:39-44 | skills/pathml/scripts/_common.py:37-42 | skills/pptx-posters/scripts/_common.py:164-169 | skills/pymatgen/scripts/_common.py:89-94 | skills/qutip/scripts/_common.py:66-71 | skills/simpy/scripts/_common.py:63-68 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/_common.py\u0060 and \u0060skills/pathml/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/_common.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16261e8cc8524cd6c53f7fd9b17156f6aed14ad75b8e9dea92daf7e5788dbc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/geopandas/scripts/crs_reprojection_plan.py:213-219 | skills/geopandas/scripts/export_plan.py:295-301 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/crs_reprojection_plan.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"29afacbfe5c0557c72790445aa9f9b160a72aa748a839cdf2c56d19995a8317a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/gtars/scripts/bed_validator.py:173-179 | skills/gtars/scripts/refget_digest_plan.py:301-307 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/gtars/scripts/bed_validator.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"5602dfe17431cdf3752ad95fa651e1e2670b99ff7a8688e9444ea72daaff409a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): skills/hypothesis-generation/scripts/_common.py:240-246 | skills/market-research-reports/scripts/_common.py:163-169 | skills/peer-review/scripts/_common.py:213-219 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/market-research-reports/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b25f1f2d10e4d28b820a644aa9799251614d03469fdaafb4d929b4bedc51824"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/hypothesis-generation/scripts/_common.py:278-284 | skills/peer-review/scripts/_common.py:251-257 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/peer-review/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8323c0bd1ed8dae82b152c010d7f9c558c4361aa11ccd8ee83e016c038369f51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/hypothesis-generation/scripts/_common.py:329-335 | skills/peer-review/scripts/_common.py:301-307 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/peer-review/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"736feebde0391e69c829a2508408d4e86d5f4ec8ee45749dd61a0929734d8a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/hypothesis-generation/scripts/_common.py:414-420 | skills/peer-review/scripts/_common.py:375-381 \u2014 before extracting anything, compare \u0060skills/hypothesis-generation/scripts/_common.py\u0060 and \u0060skills/peer-review/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"80867bee4fa8cbc223ea7f4dda70b0bd42c578988f4b3b6a9b100a5141af4ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 7): skills/hypothesis-generation/scripts/check_operationalization.py:212-223 | skills/hypothesis-generation/scripts/lint_causal_claims.py:164-175 | skills/hypothesis-generation/scripts/validate_hypothesis_schema.py:1052-1063 | skills/peer-review/scripts/audit_statistics_reproducibility.py:280-291 | skills/peer-review/scripts/lint_review.py:229-240 | skills/peer-review/scripts/validate_claim_evidence.py:196-207 | skills/peer-review/scripts/validate_review_intake.py:428-439 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 7 times. 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":"skills/hypothesis-generation/scripts/check_operationalization.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab80902a4574a116df1c2184a5fbcd68e4f9ccfcde413e2cf1392aac9f483ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/hypothesis-generation/scripts/check_operationalization.py:227-233 | skills/peer-review/scripts/audit_statistics_reproducibility.py:295-301 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/check_operationalization.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9f144c3eb1d4f8b2823f867d3fd1dd8823a3b9b1c0d10b6a5e492b69c980e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/hypothesis-generation/scripts/generate_preregistration_scaffold.py:355-366 | skills/peer-review/scripts/generate_review_scaffold.py:53-64 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \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":"skills/hypothesis-generation/scripts/generate_preregistration_scaffold.py"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e7c08b673339eba1c67d1e6dcdd5fd6b7d401ef0fb8837f655ffab7442c42f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): skills/infographics/scripts/generate_infographic.py:94-98 | skills/latex-posters/scripts/generate_schematic.py:81-85 | skills/literature-review/scripts/generate_schematic.py:81-85 | skills/scientific-schematics/scripts/generate_schematic.py:81-85 | skills/scientific-slides/scripts/generate_schematic.py:81-85 | skills/scientific-slides/scripts/generate_slide_image.py:84-88 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f63dafec9cbdad513aa2ea31321ae9b3162b914259617f4cf09b23d0bc10345"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): skills/infographics/scripts/generate_infographic_ai.py:84-97 | skills/latex-posters/scripts/generate_schematic_ai.py:82-95 | skills/literature-review/scripts/generate_schematic_ai.py:82-95 | skills/scientific-schematics/scripts/generate_schematic_ai.py:82-95 | skills/scientific-slides/scripts/generate_schematic_ai.py:82-95 | skills/scientific-slides/scripts/generate_slide_image_ai.py:95-108 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic_ai.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"173d748a96ddf59a45bc049a9104ace2c3655c93af8bdeededf3410fec5b0c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): skills/infographics/scripts/generate_infographic_ai.py:101-112 | skills/latex-posters/scripts/generate_schematic_ai.py:99-110 | skills/literature-review/scripts/generate_schematic_ai.py:99-110 | skills/scientific-schematics/scripts/generate_schematic_ai.py:99-110 | skills/scientific-slides/scripts/generate_schematic_ai.py:99-110 | skills/scientific-slides/scripts/generate_slide_image_ai.py:112-123 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic_ai.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a413882976948af3a8602b258c659647536d536781d5c8cf66608703d177a731"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): skills/infographics/scripts/generate_infographic_ai.py:655-659 | skills/latex-posters/scripts/generate_schematic_ai.py:290-294 | skills/literature-review/scripts/generate_schematic_ai.py:290-294 | skills/scientific-schematics/scripts/generate_schematic_ai.py:290-294 | skills/scientific-slides/scripts/generate_schematic_ai.py:290-294 | skills/scientific-slides/scripts/generate_slide_image_ai.py:318-322 \u2014 before extracting anything, compare \u0060skills/infographics/scripts/generate_infographic_ai.py\u0060 and \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 305 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"72eac235ad3b42eebd5a2df688d51f4e160acf41d641ba4f1bb8ea1787b37328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/labarchive-integration/scripts/entry_operations.py:190-194 | skills/labarchive-integration/scripts/setup_config.py:102-106 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/labarchive-integration/scripts/entry_operations.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"133fbe1dcfad9fb3a2f5dc81536ae8dc01271cb83e442765d428db53dcae5eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 5): skills/latex-posters/scripts/generate_schematic_ai.py:219-247 | skills/literature-review/scripts/generate_schematic_ai.py:219-247 | skills/scientific-schematics/scripts/generate_schematic_ai.py:219-247 | skills/scientific-slides/scripts/generate_schematic_ai.py:219-247 | skills/scientific-slides/scripts/generate_slide_image_ai.py:248-275 \u2014 before extracting anything, compare \u0060skills/latex-posters/scripts/generate_schematic_ai.py\u0060 and \u0060skills/literature-review/scripts/generate_schematic_ai.py\u0060 as WHOLE FILES: this scan already matched 24 separate duplicated blocks between them, totalling at least 843 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c401abafb7283800f01dd27d7667bf6b53f87cfb6e8e359fd4076af473eed419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/market-research-reports/scripts/calculate_market_sizing.py:35-41 | skills/market-research-reports/scripts/forecast_sensitivity.py:31-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/market-research-reports/scripts/calculate_market_sizing.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e0f13fb472ab03c07faa7fad3079c7eebee66e0d71ce90f1a55f967c18e2e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): skills/market-research-reports/scripts/calculate_market_sizing.py:364-375 | skills/market-research-reports/scripts/forecast_sensitivity.py:301-312 | skills/market-research-reports/scripts/validate_evidence_ledger.py:266-277 | skills/simpy/scripts/resource_monitor.py:455-464 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. 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":"skills/market-research-reports/scripts/calculate_market_sizing.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"932cd11079e4ffb6db009fccfaccbbe7cb4fa707ea1ebf8e46e604e054a6b128"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/neurokit2/scripts/_common.py:48-54 | skills/pathml/scripts/_common.py:46-52 \u2014 before extracting anything, compare \u0060skills/neurokit2/scripts/_common.py\u0060 and \u0060skills/pathml/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 185 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neurokit2/scripts/_common.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"942c763e0ad0bf09da79f5132fc7f86f8ccf4f52bf009ab92c667fbc6af3d89a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/nwb-conversion/scripts/convert_session.py:14-18 | skills/primer-design/scripts/_common.py:81-85 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nwb-conversion/scripts/convert_session.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d021fd3d5e5231f6dea04ccefd7762845f6d7d56ed42fe3e2b7132100e9451a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): skills/omero-integration/scripts/export_image_metadata.py:41-47 | skills/omero-integration/scripts/inventory.py:38-44 | skills/omero-integration/scripts/plan_transfer.py:27-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/omero-integration/scripts/export_image_metadata.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e3207abfc008f635c7fb7d9f1fd688eaa5a1eed483905dea731f4cc97ae6ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/pptx-posters/scripts/_common.py:392-397 | skills/scientific-visualization/scripts/palette_audit.py:63-68 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060first\u0060 to \u0060str\u0060 in one and \u0060tuple[int, int, int]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_common.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"084ee09aaad323650e430bff00bde60c859eafa3627052e46701d901c5366f4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): skills/pysam/scripts/alignment_qc.py:75-80 | skills/pysam/scripts/filter_alignments.py:119-124 | skills/pysam/scripts/inspect_hts.py:135-140 | skills/pysam/scripts/variant_summary.py:82-87 \u2014 before extracting anything, compare \u0060skills/pysam/scripts/alignment_qc.py\u0060 and \u0060skills/pysam/scripts/inspect_hts.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pysam/scripts/alignment_qc.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0078eaf6813710350c9738fc96d73c23b69a5e80394193d726d28645fbed408"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/scholar-evaluation/scripts/_common.py:107-112 | skills/treatment-plans/scripts/_common.py:703-708 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \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":"skills/scholar-evaluation/scripts/_common.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7db1ccf8dabc8ff4a2e1856ade6098e1c57eb69041ab169100464980ef706c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/scikit-survival/scripts/_common.py:217-224 | skills/uncertainty-and-units/scripts/_common.py:302-309 \u2014 before extracting anything, compare \u0060skills/scikit-survival/scripts/_common.py\u0060 and \u0060skills/uncertainty-and-units/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 148 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scikit-survival/scripts/_common.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a9cb700cc63fa6211c7a49699b873b3b1fd2efe090677faa9aa86249b098ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): skills/exploratory-data-analysis/scripts/_common.py:290-302 | skills/neurokit2/scripts/_common.py:249-261 \u2014 before extracting anything, compare \u0060skills/exploratory-data-analysis/scripts/_common.py\u0060 and \u0060skills/neurokit2/scripts/_common.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_common.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a268d0fd5683a389a4817f7f1b496ce02a693d9e2a56037fa790ca536a5672"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): skills/treatment-plans/scripts/check_completeness.py:562-569 | skills/treatment-plans/scripts/check_consistency.py:375-382 | skills/treatment-plans/scripts/privacy_process_check.py:202-209 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The \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":"skills/treatment-plans/scripts/check_completeness.py"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"2922b56e11cd5b3c4a4e5ce0d738aaf163579d436fa56ce7c144f9f10f3a04e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/alphagenome/scripts/atlas_query.py:476-480 | skills/alphagenome/scripts/score_variants.py:215-219 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/alphagenome/scripts/atlas_query.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e774e6912dc0b0af893b5189c15fac670dc7bf1185fbc918c1e4e86f8ea4fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/alphagenome/scripts/score_variants.py:120-124 | skills/alphagenome/scripts/score_variants.py:186-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \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":"skills/alphagenome/scripts/score_variants.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"768e9ef6dd469ffa458390584394ba82a707f2183aa83a18a0937ae77ac7f603"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/clinical-decision-support/scripts/cohort_table_generator.py:43-47 | skills/clinical-decision-support/scripts/model_biomarker_evaluation.py:163-167 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/cohort_table_generator.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5be4d7dd0b4b2e6251ba8f81179597f837802c5a537f80d8a18320e83ac1dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/marine-carbonate-chemistry/scripts/solve_carbonate.py:51-55 | skills/primer-design/scripts/_common.py:63-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/marine-carbonate-chemistry/scripts/solve_carbonate.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c361b62b59dcd91338ef8602fc5702cb6ffd97c95720aa90d21db5c6e165ac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/pkpd-modeling/scripts/exposure_response.py:85-89 | skills/pkpd-modeling/scripts/fit_compartmental.py:275-279 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/exposure_response.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c9b3254b1ea6d41818f0424e8698b64645a80d3b0e723784e397b2617c21e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): skills/timesfm-forecasting/examples/global-temperature/generate_animation_data.py:49-53 | skills/timesfm-forecasting/examples/global-temperature/run_forecast.py:49-53 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/timesfm-forecasting/examples/global-temperature/generate_animation_data.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b42c033d13492cf722461e29a7c2bfe972f97ee5d86180baf25454438d39f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): skills/timesfm-forecasting/examples/global-temperature/generate_gif.py:163-177 | skills/timesfm-forecasting/examples/global-temperature/generate_html.py:522-536 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/timesfm-forecasting/examples/global-temperature/generate_gif.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f249600fedb72faa4d06322e6483bb0686dbc4f90fedf945006dc9f477630b88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/timesfm-forecasting/examples/covariates-forecasting/demo_covariates.py:197-207 | skills/timesfm-forecasting/examples/covariates-forecasting/demo_covariates.py:281-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/timesfm-forecasting/examples/covariates-forecasting/demo_covariates.py:197\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":"skills/timesfm-forecasting/examples/covariates-forecasting/demo_covariates.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"420765458ae7ea491a2fd459a0197c246d69ab3349ecb74fe7e808295387d854"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): skills/timesfm-forecasting/examples/anomaly-detection/detect_anomalies.py:506-515 | skills/timesfm-forecasting/examples/covariates-forecasting/demo_covariates.py:519-529 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/timesfm-forecasting/examples/anomaly-detection/detect_anomalies.py:506\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":"skills/timesfm-forecasting/examples/anomaly-detection/detect_anomalies.py"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3f357a760833621ce6f33d7700b423cc19b48a2c8922db5637e7917c4f7c67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): skills/timesfm-forecasting/examples/covariates-forecasting/demo_covariates.py:198-207 | skills/timesfm-forecasting/examples/covariates-forecasting/demo_covariates.py:310-322 \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 \u0060skills/timesfm-forecasting/examples/covariates-forecasting/demo_covariates.py:198\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":"skills/timesfm-forecasting/examples/covariates-forecasting/demo_covariates.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4700a9aa91f73d863981aec5f6e6d51173fa3cfe8c0c38510d839bccc7d368a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/timesfm-forecasting/examples/covariates-forecasting/demo_covariates.py:300-307 | skills/timesfm-forecasting/examples/covariates-forecasting/demo_covariates.py:356-362 \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 \u0060skills/timesfm-forecasting/examples/covariates-forecasting/demo_covariates.py:300\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":"skills/timesfm-forecasting/examples/covariates-forecasting/demo_covariates.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"91367c66e4dbf13b5dfd2f0295ccf4267699acd9287b9763b1f90b54cdcfd3a7"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: primer3-py: \u0060primer3-py\u0060 2.4.0 is published on PyPI under \u0060GPL-2.0-or-later\u0060, which this policy bans, and it is in the SHIPPED closure of this repository \u2014 so it is installed by everything that depends on this repository, not just by its test environment. A distribution offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1c0e822622fa2b61d003112d443160ec0c2099fe3be99cf1c4dc06f391fdd5dd"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: zipstream-ng: \u0060zipstream-ng\u0060 1.9.3 is published on PyPI under \u0060LGPL-3.0-only\u0060, which this policy bans, and it is in the SHIPPED closure of this repository \u2014 so it is installed by everything that depends on this repository, not just by its test environment. A distribution offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package, or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9ff98d749948caad713a85f4bfd3a318bc053a13c4d7074942b9125ed9688a67"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: pcodedmp: \u0060pcodedmp\u0060 1.2.6 is published on PyPI under \u0060GPL-3.0\u0060, which this policy bans, and it is in the SHIPPED closure of this repository \u2014 so it is installed by everything that depends on this repository, not just by its test environment. A distribution offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0e2ed46feb1a9bba3ccae36828ff98dd3479d72def91eabb751785777642e3d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/infographics/scripts/generate_infographic_ai.py: skills/infographics/scripts/generate_infographic_ai.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in InfographicGenerator.generate_iterative at line 981. 1 of those changes was a fix/bug commit, and the other 2 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/infographics/scripts/generate_infographic_ai.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3f202dbc24981d3ebc695fa48db3cd27ccaf3142ff5595c9d8221487a98f02"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/scientific-slides/scripts/generate_slide_image_ai.py: skills/scientific-slides/scripts/generate_slide_image_ai.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in SlideImageGenerator.generate_slide at line 543. 1 of those changes was a fix/bug commit, and the other 2 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/scientific-slides/scripts/generate_slide_image_ai.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/generate_slide_image_ai.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b767431cf72e062404902874387712ae91a566bf21e857ffa7c91daca8a47b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/bioservices/scripts/compound_cross_reference.py: skills/bioservices/scripts/compound_cross_reference.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in compound_cross_reference.get_kegg_info at line 79. 1 of those changes was a fix/bug commit, and the other 2 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/bioservices/scripts/compound_cross_reference.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bioservices/scripts/compound_cross_reference.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c9412529ba2f96f29c3b7c3079923aa8bf5759fbebedb438be7f3cbfe3949a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/latex-posters/scripts/generate_schematic_ai.py: skills/latex-posters/scripts/generate_schematic_ai.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ScientificSchematicGenerator.generate_iterative at line 561. 1 of those changes was a fix/bug commit, and the other 2 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/latex-posters/scripts/generate_schematic_ai.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3bff75225df6457d19c0639e087c39348e9c7ced7fa993304d3aa3606fe90c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/literature-review/scripts/generate_schematic_ai.py: skills/literature-review/scripts/generate_schematic_ai.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ScientificSchematicGenerator.generate_iterative at line 561. 1 of those changes was a fix/bug commit, and the other 2 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/literature-review/scripts/generate_schematic_ai.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/literature-review/scripts/generate_schematic_ai.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5df0c1e4fa2a18d73f3ed72266f8f0f1d8b776e167510367a80bae2969848f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/scientific-schematics/scripts/generate_schematic_ai.py: skills/scientific-schematics/scripts/generate_schematic_ai.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ScientificSchematicGenerator.generate_iterative at line 561. 1 of those changes was a fix/bug commit, and the other 2 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/scientific-schematics/scripts/generate_schematic_ai.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-schematics/scripts/generate_schematic_ai.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c86811c2546666fb21af87cb50fdeacab7e624a0f410dbf033c7c5fdd72c17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/scientific-slides/scripts/generate_schematic_ai.py: skills/scientific-slides/scripts/generate_schematic_ai.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ScientificSchematicGenerator.generate_iterative at line 561. 1 of those changes was a fix/bug commit, and the other 2 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/scientific-slides/scripts/generate_schematic_ai.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/generate_schematic_ai.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c71118e65d778fc3a633c5a17efdb1fae975eecf0eab1199bda28b640f4277b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/diffdock/scripts/prepare_batch_csv.py: skills/diffdock/scripts/prepare_batch_csv.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in prepare_batch_csv.validate_csv at line 63. 1 of those changes was a fix/bug commit, and the other 1 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/diffdock/scripts/prepare_batch_csv.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/diffdock/scripts/prepare_batch_csv.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"723f1b46493d4865c2283b594498a98ffc38e114f47e78ab69baf4e6d1e76b8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/analytical-method-validation/scripts/_common.py: skills/analytical-method-validation/scripts/_common.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in _common.parse_rows at line 844. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/analytical-method-validation/scripts/_common.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/analytical-method-validation/scripts/_common.py"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9b74379518472ecc2a811f666fd278a6d5793dfb812bf07695320491957a54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/lab-hardware-cad/scripts/gen.py: skills/lab-hardware-cad/scripts/gen.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in gen.main at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/lab-hardware-cad/scripts/gen.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/lab-hardware-cad/scripts/gen.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf4e4524d92744b5a9f6b24678df17fa842e36fdd37418152ecef382d15a138"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/lab-hardware-cad/scripts/_common.py: skills/lab-hardware-cad/scripts/_common.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in _common._normalise_region at line 275. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/lab-hardware-cad/scripts/_common.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/lab-hardware-cad/scripts/_common.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca44fa8bc8a9ce6d215f4e102e2d646df79082026240d9cf7acfa99570739a48"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/arbor/scripts/tree.py: skills/arbor/scripts/tree.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in tree.cmd_observe at line 391. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/arbor/scripts/tree.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/arbor/scripts/tree.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"4854b9dbab3d667238eec4662298f86ee25d6f79fc9484771ae14f64b5754f1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/neuropixels-analysis/assets/analysis_template.py: skills/neuropixels-analysis/assets/analysis_template.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in analysis_template.main at line 69. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/neuropixels-analysis/assets/analysis_template.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/neuropixels-analysis/assets/analysis_template.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc90fe3d0489ecf51aef5c69d2f21acc29aa04f9b66776812bfc4998578a48f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/scientific-slides/scripts/slides_to_pdf.py: skills/scientific-slides/scripts/slides_to_pdf.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in slides_to_pdf.combine_images_to_pdf at line 69. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/scientific-slides/scripts/slides_to_pdf.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/slides_to_pdf.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2415b0db6973a9f1df35fe51d3b9bb8b688cb5b72c85aa1a399d2c09af00db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/pkpd-modeling/scripts/nca.py: skills/pkpd-modeling/scripts/nca.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in nca.estimate_lambda_z at line 248. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/pkpd-modeling/scripts/nca.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/nca.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"181ebecafc0484798c987d8eae7df0578247b78b5b286418ce3faa9cb0e0889b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/simpy/scripts/event_trace_summary.py: skills/simpy/scripts/event_trace_summary.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in event_trace_summary.summarize_resource_csv at line 135. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 09:17:47 \u002B00:00\u0027 --until=\u00272026-11-09 09:17:47 \u002B00:00\u0027 --full-history --no-merges -- skills/simpy/scripts/event_trace_summary.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/simpy/scripts/event_trace_summary.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"802b4832de541ac81ba0671fbd6ddf8cac6bfc64f6b1cca7a1f53961152c9a79"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 36 significant file(s) lose their only recent owner: skills/get-available-resources/scripts/detect_resources.py, scripts/generate_skill_image.py, skills/scientific-slides/scripts/generate_schematic_ai.py, skills/literature-review/scripts/generate_schematic_ai.py, skills/latex-posters/scripts/generate_schematic_ai.py, skills/analytical-method-validation/scripts/_common.py, skills/scientific-slides/scripts/generate_slide_image_ai.py, skills/generate-image/scripts/generate_image.py (\u002B28 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c6a77df1cb7512f58e2f35aec27f1d7cdb05108766b6ed2af295766c4dc9c20"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (42 single-owned of 493 analysed files in total, 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; 493 of the 526 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (2 file(s)), anonymized user #4 (2 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: skills/onekgpd/scripts/onekgpd_api.py, skills/onekgpd/scripts/onekgpd_meta.py, skills/ontology-term-resolution/scripts/id_client.py, skills/ontology-term-resolution/scripts/zooma_client.py, skills/openpiv/scripts/runner.py, skills/openpiv/scripts/run_example.py."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dcc51444303343901bad1644477d24f64816397f17e052ae5032212f3c7bd572"},"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":"61ffdb167dcf8b372f3658cb85a3205cb8cea475b2ed14649ffe79d8458fcb44"},"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":"fdedab8385c96193d8811e434f59485f4b9cca0581541d5ffac44b2e5ae505b6"},"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":"b32d8c45112a29cf9fd73ebf43f1f5aa103efb2db26243318c00bd1b96570281"},"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":"31e15292ee7781495cff3025f3779e23aded0d07be93120b45c65e1d6518c389"},"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":"957b150e90b8de065e3fab913d6db8aa84cc38085b4826b482eaabde0c4cf347"},"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":"865c1256b0af6cac7fabd52ec1703a6840a81e82c2cc09619e5e78e47af02756"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"90091b7a88475e87c4b68788859204b792f6bc9dd6064ec583335de6d681fab2"},"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":"4bc3612d4f601df895ae7501318f183cd2f9537442e20ab9e4611bfce35a4b99"},"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":"b1f7633438059a763a229bf71ef56ce4f62072695b6f4362214865382bb92d55"},"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":"48aa78bf25e84c499422bb1a6c44361d52df8d6cfd34563cf6205fc50a70db2d"},"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":"0825c5459ea29046768085cdef0871fa9d5a19f9a985c1bf7ed9cc8557c28c59"},"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":"37e3ebfe56f180a79674ef70a08138b300d1b2655ebdd1c557cebbaad9409cdd"},"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":"8c191b8213cc255831a8d283f51f13fec6886e7c06324494e4f57e4cc7380775"},"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":"714f0270adfcffc2b105a2894e72334f52c8cd9e1c0369085b28dac9c816f4a6"},"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":"c396816de116b24b9ef6a53595f01a59b94b891f23050367519400a35a59452e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f240660d62b9b3daf93342266b8c42ea52e9cc0f985d223d3d63cc632793f18e"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 13 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: skills/timesfm-forecasting/scripts/check_system.py, skills/neuropixels-analysis/scripts/neuropixels_pipeline.py, skills/neuropixels-analysis/assets/analysis_template.py, skills/autoskill/scripts/run.py, skills/exa-search/scripts/exa_search.py, skills/neuropixels-analysis/scripts/explore_recording.py, skills/imaging-data-commons/scripts/check_version.py, skills/neuropixels-analysis/scripts/preprocess_recording.py (and 5 more) (14 orphaned of 493 analysed files in total, 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; 493 of the 526 production source files in this repository met that bar). 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":"skills/timesfm-forecasting/scripts/check_system.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bd8f254e7de4723945e704035f11a9788c57feecb6b24052c3a002db5a3b76"}},{"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":"skills/neuropixels-analysis/scripts/neuropixels_pipeline.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a93724e69e0d625c81d51587aa43bbaaa3ed1657ca9d0aef814ccc1c431069b"}},{"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":"skills/neuropixels-analysis/assets/analysis_template.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d447626a4f2986d7a2cbffc2ef7fce06fa567e44d69aee4e29406efb42ef205"}},{"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":"skills/autoskill/scripts/run.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d105f1e831afe7a720bce296dacb2efbe8a122acf4ee4450896fb3be2e724f1"}},{"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":"skills/exa-search/scripts/exa_search.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93df09621380dad9f69f8a5c2b29601e6e1a967a90e3399a07b320d4132345a5"}},{"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":"skills/neuropixels-analysis/scripts/explore_recording.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cc781fca3403207d4222009cc90b76820a1aff0ad7c8b3563a6edeefb8b635"}},{"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":"skills/imaging-data-commons/scripts/check_version.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47b0f034e1de535420f7ddc24a4496310781a89480bf4ab4400b056cb40b0d9"}},{"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":"skills/neuropixels-analysis/scripts/preprocess_recording.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06fd45be4b37d049b8e5b86d086a3779e8c95b9e77edfd26ee365067ccbe082"}},{"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":"skills/autoskill/scripts/doctor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d5c8b1796ff4bba4f4e1ae3d25702df9b154f56821542f5d974258a7d7e11f"}},{"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":"skills/exa-search/scripts/exa_extract.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25ae72d78d8eacbc33530a43e32b108fa8f5ee570ca61fb53b4e29db370320e"}},{"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":"skills/autoskill/scripts/synthesize.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37233d6b6706a1bb8a93e1a7b5dc6adba29bf3d05f433883760f58f9d068cfb5"}},{"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":"skills/neuropixels-analysis/scripts/run_sorting.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ab66b16df778e8b863c49887ec45d5146147e81453c36c12edf5d213a38244"}},{"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":"skills/neuropixels-analysis/scripts/export_to_phy.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e89f895c4de0f102e9979938d919004fb17d1090a2f63de51dcca6f027e027b"}},{"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":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 1 ADR-shaped document(s) detected by content \u2014 \u0060skills/markdown-mermaid-writing/templates/decision_record.md\u0060. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live \u2014 so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea921cf64dae701abd877090b3279ff10d03c2e3250e26c8c299d7c5665e0d3f"}},{"ruleId":"M3","level":"note","message":{"text":"No src/ separation: Most of the production code is in directories of its own, but 2 application file(s) sit at the repository root beside the build and tooling files (\u0060scan_pr_skills.py\u0060, \u0060scan_skills.py\u0060)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/arboreto.md names Python 3.11, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/arboreto.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b4ea37b4b428f4d67481675f3ea6cf7e15468b5c4833a2ca50d494cf782ec6"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/astropy.md names Python 3.11 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/astropy.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7c9f4bcb756ef2c81742dbff0b1e54c88c087bc80dc6dbf1c7c28271acd31a"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/autoskill.md names Python 3.10 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/autoskill.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6da10b95488e4715d0db01d6e19e3038769e6d31d8c31bd478e476127cb778"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/biopython.md names Python 3.10 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/biopython.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be53ebf3b56ee30d3f221aaac6d8adb672e0f342c36d680f1b3371880f21a5e"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/bioservices.md names Python 3.9 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.9. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/bioservices.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f8373ca6aac9d738427a822e99d82f6e9f8874babca26e9bccab472fcdf0d4"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/bulk-rnaseq.md names Python 3.11 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/bulk-rnaseq.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05a3d6e8b4bec762323566d5b518b54070ef5522b8fb9c54593fad9a1d2d71e"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/cantera.md names Python 3.12, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.12. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/cantera.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7054408d909bd1bf7c0ffb3fe655df1fa71b2c131a762276c4d0aa492c6529e0"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/cellxgene-census.md names Python 3.10 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/cellxgene-census.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f604bdcbc9257b5e07bec53b01ed7bc2047aa4bcfb15bee27a2582158f667029"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/citation-management.md names Python 3.9 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.9. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/citation-management.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a8322f4faafa42e3b87a5247bd42c344c0211b7a7d9f949d02c74193e4c15b"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/dask.md names Python 3.10 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/dask.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99b39018b1e24d890fa9a527c8d35d1c41861300b3906d41886af7b7e581001"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/deepspot-m.md names Python 3.10 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/deepspot-m.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c926468a252997ea9086090b99fc68d5ec57eab34042f6950e4274b06d0dce4d"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/deeptools.md names Python 3.12 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.12. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/deeptools.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54ff630120effc27f8cd2ff2a8482ec6b8248fd0759eb476756d4698690a48e"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/depmap.md names Python 3.10 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/depmap.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c9bb643568474eba2347c0fe3010cf7642ac8b104994c256df74482d7412a0"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/dnanexus-integration.md names Python 3.11 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/dnanexus-integration.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2667fe6315f410f74704049b6ef9d8a87ebd705a013ecf374347686019a3fe2"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/esm.md names Python 3.12 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.12. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/esm.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0396032565824f1857f0ed4a8e5b105ee1c461732e92c0b0810b7b58dc624467"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/exa-search.md names Python 3.11 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/exa-search.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05949e08ad7a886e715f893049446060228efcb3e4ad5d9f883017647c6aae5"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/exploratory-data-analysis.md names Python 3.11 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/exploratory-data-analysis.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"733351dc8438f1c3ff7e4f18e59e02ff00bbea499ba72a6da121d78d093e9db1"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/exploratory-data-analysis.md names Python 3.12 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.12. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/exploratory-data-analysis.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"835777834be80000fd378bbb93787b422466268eb8422a087b7895b7680bb67f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/fluidsim.md names Python 3.11 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/fluidsim.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"96450473f04b269e32f405ef5a1efa9ebe8a9656ee872863f9336c99b0d375cd"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/geniml.md names Python 3.12, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.12. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/geniml.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"408daa7b885e58e646ecef4d7053453a4367f8474ada768b3f587c86098c036b"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/gget.md names Python 3.12 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.12. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/gget.md"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5940430f450b8d55fbb28ba2021ee9fe15626fc567a7721644cc5744de5fc39"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/glycoengineering.md names Python 3.10 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/glycoengineering.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb0737cf436ad80c19cb9e4c4928984efebf112b648975987fb511536640553"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/infographics.md names Python 3.10 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/infographics.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f74ba8569bd4b908973b95995d40ee80e06cdd0db4f9f35938048fc1e2e4ab9"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/iso-standards-readiness.md names Python 3.11 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/iso-standards-readiness.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0681444237efabb818cc54711614980d8bc0a720414697b2b3235f179259ebe0"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/lab-hardware-cad.md names Python 3.11, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/lab-hardware-cad.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6323e6bb6caeb93d8cbb88514cd5298a8059969fa878931fc78e5370e1da35"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/labarchive-integration.md names Python 3.11 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/labarchive-integration.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b542bf2de03575a6653a1aa2da22f0bac59d2550b1ab9daf41817f303359910"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/latchbio-integration.md names Python 3.12, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.12. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/latchbio-integration.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c62dacf90621f59409842f9c45531d9c35e04daea11769d7d9da780de8fab3f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/literature-review.md names Python 3.10 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/literature-review.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"080a1435a795fb467d632097f28385b56dc8d59baf7cc83ef8820cf180d22541"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/matchms.md names Python 3.10, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/matchms.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d3ce534b7f779da9e89d473ae9c3f590c6c8cfc995f4b205324d1c425181f9"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/modal.md names Python 3.10, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/modal.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccd98fc75fc1cfbe5fb17631728414188e459f96bbd208db5f9e13acb6a5930"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/molfeat.md names Python 3.11 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/molfeat.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8f921acfdf1285a1cf3767552828f1f0afb9df73236dec154c69731d737280"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/networkx.md names Python 3.12 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.12. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/networkx.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedbeb2b80cec5b59f646f8648e63b3cb87cb74ff4e06dcecc9cb8aa5a1523fd"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/neurokit2.md names Python 3.10 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/neurokit2.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ffd50e91d2954f03af6262b78434aed996a1e1e8d5a39b5735c85fde7e64b2"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/neuropixels-analysis.md names Python 3.10 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/neuropixels-analysis.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"437e2486ed10f1a85e7021d37bfa9a8ee27b5ea593b7bc05b5ee41d5d7c66cc8"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/nmrglue.md names Python 3.12 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.12. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/nmrglue.md"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9e84a677bebaebbe73dd90d45513892b13c8dcbd1b0626a2910ee2bed060c0"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/nwb-conversion.md names Python 3.12, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.12. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/nwb-conversion.md"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9b0a2bc8fbf1e27c9373b8dec4c5aacddb7306559810e979abd97480f55317"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/omero-integration.md names Python 3.10, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/omero-integration.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d109b1b6bc879135b7d265e51f5d352cdf77cf8742f45aa081ad6cafef668c1"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/ontology-term-resolution.md names Python 3.11 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/ontology-term-resolution.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbf689a629a8541e3ef07f3ba06e19ff61a73c938dc4c3b085e22fb9185152f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/opentrons-integration.md names Python 3.10 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/opentrons-integration.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8febb691aec4798e5ca947220f1b6d92f24cc2153b6d768772d51d1583294bc4"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/paperclip.md names Python 3.8 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.8. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/paperclip.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c49877002fbae61f2647bb1e3105e789d24edfd1a75fac7ced19ea4a2eecd3"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/parallel-web.md names Python 3.10 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/parallel-web.md"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fbd7a6634b85446411092875f4ae5e390b5a5e49e1e60a0736054e8b8bc547"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/primekg.md names Python 3.11 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/primekg.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"154bd41b886c939e5149dd2d7686ca9c479ba2ad37363b6c2e7c1da87c4f092f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/primer-design.md names Python 3.11 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/primer-design.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69d184e2c2b010bfd468ee516c68fc3d2219cebccf77825eec840b388c99dae"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/protocolsio-integration.md names Python 3.11 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/protocolsio-integration.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"02489efd5f75e79b4cc349927b17bcb5236a80795247b999d9d6cc0c0a48705c"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/pufferlib.md names Python 3.10 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/pufferlib.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3210ab5651eca5ab167c3c0a8181b88c6893e28f2109bc8d77f5a41eed4bad"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/pytdc.md names Python 3.11, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.11. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/pytdc.md"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a17b59804f0a06b4e02c120eeefa72e11bdb9afd0f48d63f535c256c98f67e8"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/uncertainty-and-units.md names Python 3.12 or later, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.12. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/uncertainty-and-units.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e71882001df9dcff03ac0a48275fa9da85e19f35c03f657e60c02ecefbdf085"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: docs/skill-guides/vaex.md names Python 3.9, but pyproject.toml:6 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.9. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill-guides/vaex.md"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abc98500a3dc6cae150ef9bb09b219bca918bcf693d268333a88bde55a2e74d"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"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 5 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/pr-skill-scan.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060pyproject.toml\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":"pyproject.toml"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cb10b4cecf1ff8954b4572fe00acd990e1e486a213ddb60c937a99b3b59c61"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/release.yml"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022://\u0022 in lowered or lowered.startswith( (\u0022http:\u0022, \u0022https:\u0022, \u0022ftp:\u0022, \u0022s3:\u0022, \u0022gs:\u0022, \u0022file:\u0022) )\u0060 appears character-identically in 3 files \u2014 skills/hypogenic/scripts/_common.py, skills/neurokit2/scripts/_common.py, skills/pathml/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b529305014fa24359690f901d40ddd3c89d3956be9aa47ac933eadcd546377ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022ModalityLUTSequence\u0022 in dataset or \u0022RescaleSlope\u0022 in dataset or \u0022RescaleIntercept\u0022 in dataset\u0060 appears character-identically in 3 files \u2014 skills/pydicom/scripts/dicom_to_image.py, skills/pydicom/scripts/extract_metadata.py, skills/pydicom/scripts/pixel_frame_planner.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/dicom_to_image.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c384963192dd1f408e33f00e4876b25be55ce079b71eb273255406f6a71cae7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022WindowCenter\u0022 in dataset and \u0022WindowWidth\u0022 in dataset\u0060 appears character-identically in 2 files \u2014 skills/pydicom/scripts/dicom_to_image.py, skills/pydicom/scripts/pixel_frame_planner.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/dicom_to_image.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"709b8d073fdc147161f246db51df1acb0083ae3fc4b82a8bdab83ad722131922"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u00600x5000 \u003C= group \u003C= 0x50FF or 0x6000 \u003C= group \u003C= 0x60FF\u0060 appears character-identically in 2 files \u2014 skills/pydicom/scripts/anonymize_dicom.py, skills/pydicom/scripts/deidentification_audit.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/anonymize_dicom.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"868883bf8b0f09f023da1182d4e3fab31b2577d9df1dd1f029dca190d8d70930"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_SCORE_PATTERN.search(normalized) or _LOOSE_SCORE_PATTERN.search(normalized)\u0060 appears character-identically in 6 files \u2014 skills/infographics/scripts/generate_infographic_ai.py, skills/latex-posters/scripts/generate_schematic_ai.py, skills/literature-review/scripts/generate_schematic_ai.py, skills/scientific-schematics/scripts/generate_schematic_ai.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"560bfe9a106ba8d7a70cf355e7b8e0ce4b3aac8d4df4f0d2185b13454af61d94"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.interval is not None and args.interval \u003C= 0\u0060 appears character-identically in 2 files \u2014 skills/pkpd-modeling/scripts/fit_compartmental.py, skills/pkpd-modeling/scripts/simulate_regimen.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pkpd-modeling/scripts/fit_compartmental.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84a57582e55659eb755812e00061863de2c4e835184e668158a22a3da731f05"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.iterations \u003C 1 or args.iterations \u003E 2\u0060 appears character-identically in 5 files \u2014 skills/latex-posters/scripts/generate_schematic_ai.py, skills/literature-review/scripts/generate_schematic_ai.py, skills/scientific-schematics/scripts/generate_schematic_ai.py, skills/scientific-slides/scripts/generate_schematic_ai.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a6bbf9f66846c0e1559a5281719dfef96fe2a8105807fdb0b351702426c94c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.out_features or os.path.splitext(args.input)[0] \u002B \u0022.featureXML\u0022\u0060 appears character-identically in 2 files \u2014 skills/pyopenms/scripts/detect_features_centroided.py, skills/pyopenms/scripts/detect_features_metabo.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/detect_features_centroided.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"30995d082ed458b164a2f32df598e5d26bc4ab1ba6ac000af74af30241ab9f0d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.output_compression is not None and not 0 \u003C= args.output_compression \u003C= 100\u0060 appears character-identically in 2 files \u2014 scripts/generate_skill_image.py, skills/generate-image/scripts/generate_image.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate_skill_image.py"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"851476b2c709837c4328e4c916b1fa9e03042e6323c95918a1438c25584d27ef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.output_format == \u0022poscar\u0022 and args.coordinate_mode == \u0022not-applicable\u0022\u0060 appears character-identically in 2 files \u2014 skills/pymatgen/scripts/io_conversion_plan.py, skills/pymatgen/scripts/structure_converter.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pymatgen/scripts/io_conversion_plan.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c35932856805c4c38cbbf17c003ca3090b2490d7295c4e6a9b75ffdb914e4f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060builder is None or not callable(builder)\u0060 appears character-identically in 2 files \u2014 skills/lab-hardware-cad/scripts/_common.py, skills/lab-hardware-cad/scripts/gen.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/lab-hardware-cad/scripts/_common.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4b82821b77ae5c17bca8034315e107418f056b751b5194e0a7f9f72acf3c49"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate.exists() or candidate.is_symlink()\u0060 appears character-identically in 2 files \u2014 skills/geopandas/scripts/_common.py, skills/pysam/scripts/filter_alignments.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/_common.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"4804364684660a4bc2e6a02225f66c3d9dee38f0c5db2b81612ad73f91cba9da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060character.isspace() or ord(character) \u003C 32\u0060 appears character-identically in 4 files \u2014 skills/geniml/scripts/bed_validator.py, skills/gtars/scripts/_common.py, skills/protocolsio-integration/scripts/_common.py, skills/protocolsio-integration/scripts/validate_auth_config.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/bed_validator.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed29d6515e6ab667e6d6b5ba243cd76a3519a3e46d9d3cfb54bc01e1d4463399"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060declared is not None and declared \u003E max_features\u0060 appears character-identically in 2 files \u2014 skills/geopandas/scripts/_common.py, skills/geopandas/scripts/export_plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geopandas/scripts/_common.py"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cde94ca1b0c4e645968d890c90090bf635875c7b686c542046e4259a32adac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060destination.exists() or destination.is_symlink()\u0060 appears character-identically in 2 files \u2014 skills/omero-integration/scripts/plan_transfer.py, skills/treatment-plans/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/omero-integration/scripts/plan_transfer.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa56f5ea19e37995f852eacae40d06ad10941f65e62f40079a2a53f0b6d9276b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060destination.is_symlink() or not destination.is_file()\u0060 appears character-identically in 3 files \u2014 skills/exploratory-data-analysis/scripts/_common.py, skills/fluidsim/scripts/_common.py, skills/pydicom/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_common.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d371fd5d08213b815f40303d55e5b13810d94d844c1c49288988800f8b3e18"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(os, \u0022getuid\u0022) and info.st_uid != os.getuid()\u0060 appears character-identically in 2 files \u2014 skills/pydicom/scripts/anonymize_dicom.py, skills/pydicom/scripts/uid_mapping_validator.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/anonymize_dicom.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5bd82c70a22ef148cce596d1f4d2b48e200ee3c35b51f9b826d9828973df0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hermitian and abs(trace - 1.0) \u003C= tolerance and minimum_eigenvalue is not None and minimum_eigenvalue \u003E= -tolerance\u0060 appears character-identically in 2 files \u2014 skills/qutip/scripts/qobj_model_validator.py, skills/qutip/scripts/two_level_simulation.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qutip/scripts/qobj_model_validator.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a121adc91d8221ce3557b53525310471f9e15440f8758cc514e759431c1afc48"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(block, dict) and block.get(\u0022type\u0022) == \u0022text\u0022\u0060 appears character-identically in 5 files \u2014 skills/latex-posters/scripts/generate_schematic_ai.py, skills/literature-review/scripts/generate_schematic_ai.py, skills/scientific-schematics/scripts/generate_schematic_ai.py, skills/scientific-slides/scripts/generate_schematic_ai.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb6f8c58a2de9c0b124411b7b28e253e51f1ab1e51ef70a5f372a02f937eeb1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(current, float) and not math.isfinite(current)\u0060 appears character-identically in 2 files \u2014 skills/iso-standards-readiness/scripts/_common.py, skills/scholar-evaluation/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/_common.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22a5c8fd748cb7c3e98d9059ea50984783b2c7ae82fb682abceaa75c6b19317"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(current, str) and len(current) \u003E MAX_TEXT_CHARS\u0060 appears character-identically in 2 files \u2014 skills/iso-standards-readiness/scripts/_common.py, skills/scholar-evaluation/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/_common.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"568c42eff70ebf6f49bf63a253ad068c4f31e6d2c11df7d27952505b8b238307"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(excerpt, str) and excerpt.strip()\u0060 appears character-identically in 2 files \u2014 skills/research-lookup/scripts/manuscript_packet.py, skills/research-lookup/scripts/research_lookup.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/research-lookup/scripts/manuscript_packet.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8690a06b1cd1947c9f96c52e4e173bef9002495b5440ed6e4b7a18d1e00f536"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(iterations, bool) or not isinstance(iterations, int) or not 1 \u003C= iterations \u003C= 2\u0060 appears character-identically in 5 files \u2014 skills/latex-posters/scripts/generate_schematic_ai.py, skills/literature-review/scripts/generate_schematic_ai.py, skills/scientific-schematics/scripts/generate_schematic_ai.py, skills/scientific-slides/scripts/generate_schematic_ai.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/latex-posters/scripts/generate_schematic_ai.py"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"29def814d5fdc310edda70dde2dab3d70fc2cb54235e9a257729cdaa0bd1ebf3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, (int, float)) and not isinstance(value, bool)\u0060 appears character-identically in 3 files \u2014 skills/fluidsim/scripts/_schema.py, skills/fluidsim/scripts/restart_compatibility.py, skills/get-available-resources/scripts/snapshot_tools.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_schema.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce51d41795099211415d21a038b9a4aa008a6e1ea254ae38f2d617352992442"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, (int, float)) and not isinstance(value, bool) and math.isfinite(value)\u0060 appears character-identically in 2 files \u2014 skills/13c-metabolic-flux/scripts/_mfa_model.py, skills/scientific-writing/scripts/check_consistency.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/13c-metabolic-flux/scripts/_mfa_model.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9abf5cf51c6dbf748b55db7f9232bfb9204fec5277fbb38bd9f1000ca34d11"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, bool) or not isinstance(value, (int, float))\u0060 appears character-identically in 15 files \u2014 skills/clinical-decision-support/scripts/_common.py, skills/clinical-reports/scripts/consistency_checker.py, skills/fluidsim/scripts/_common.py, skills/fluidsim/scripts/budget_summary.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/_common.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56ea13dbde368bd4cf2f88d3e8b20232e01f197e10fbc1df1c9f9383c916577"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, bool) or not isinstance(value, (int, float)) or not math.isfinite(value)\u0060 appears character-identically in 3 files \u2014 skills/primer-design/scripts/_common.py, skills/pybamm/scripts/simulate_battery.py, skills/tellurium/scripts/kinetic_experiment.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/_common.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba44fce88da67b7080d6ba3aadc6639e27986b3cb93982f0774cdca2e49915a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, bool) or not isinstance(value, int)\u0060 appears character-identically in 13 files \u2014 skills/exploratory-data-analysis/scripts/_common.py, skills/fluidsim/scripts/_common.py, skills/hypogenic/scripts/_common.py, skills/neurokit2/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_common.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a85fc74d0842054a7438a0579cffd58f50f8ce2928e6664c9e1ec52d7c6e7b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, bool) or not isinstance(value, int) or value \u003C 0\u0060 appears character-identically in 2 files \u2014 skills/clinical-decision-support/scripts/_common.py, skills/clinical-reports/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/_common.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed6d76cf2ee7251a05a7aad0d0fa6eced88699421a988e6e0344250486a157c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, float) and not math.isfinite(value)\u0060 appears character-identically in 3 files \u2014 skills/clinical-reports/scripts/_common.py, skills/pufferlib/scripts/_common.py, skills/pymatgen/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/_common.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84f17919f105f8350fe3d547523f049a3b6583b9f1c52f55b822225e0cda5a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item in getattr(response, \u0022results\u0022, []) or []\u0060 appears character-identically in 2 files \u2014 skills/exa-search/scripts/exa_extract.py, skills/exa-search/scripts/exa_search.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exa-search/scripts/exa_extract.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dac2bcd91c92efe664bfb20563e3ff050825f0cd2e6c335cb59d9316dd58f6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key not in adata.obs or adata.obs[key].isna().any()\u0060 appears character-identically in 2 files \u2014 skills/scanpy/scripts/_common.py, skills/scanpy/scripts/pseudobulk.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scanpy/scripts/_common.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5263a39e889c405fd061a66f30f9e9361cae9e49d8e51939dcf9c29269bc5caf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060keyword in UID_REMAP_KEYWORDS or keyword.endswith( (\u0022InstanceUID\u0022, \u0022FrameOfReferenceUID\u0022) )\u0060 appears character-identically in 2 files \u2014 skills/pydicom/scripts/anonymize_dicom.py, skills/pydicom/scripts/deidentification_audit.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/anonymize_dicom.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf13dfde93fa611b15691718a0bab4a6671ff2bb77217f1cc23fdcd658edc7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind == \u0022dir\u0022 and not stat.S_ISDIR(info.st_mode)\u0060 appears character-identically in 2 files \u2014 skills/fluidsim/scripts/_common.py, skills/pydicom/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3245d6f3ec0c2e0030864d91bbeed16bf3e31f36a957bc35d55efd682f70094a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind == \u0022dir\u0022 and not stat.S_ISDIR(mode)\u0060 appears character-identically in 2 files \u2014 skills/geniml/scripts/_common.py, skills/gtars/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f86b1a3677db9dbd7b29cacfdebade69ef48dace94ccd34dfb7f64c884aaf4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind == \u0022file\u0022 and not stat.S_ISREG(info.st_mode)\u0060 appears character-identically in 2 files \u2014 skills/fluidsim/scripts/_common.py, skills/pydicom/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b31ea9d66466879a14fbbabd46ecb24abfabdc8fb2980454a98707614db9060"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind == \u0022file\u0022 and not stat.S_ISREG(mode)\u0060 appears character-identically in 2 files \u2014 skills/geniml/scripts/_common.py, skills/gtars/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"804a2ade1933e03a076bf9fc682490282e9d8fa1f85b0f3b42149865207acb8b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060layer is not None and layer not in adata.layers\u0060 appears character-identically in 2 files \u2014 skills/scanpy/scripts/_common.py, skills/scanpy/scripts/pseudobulk.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scanpy/scripts/_common.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0351516f81f4b391cd23e0b055bd0163871b86871c3ac069045111eb428be24"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lowered.startswith(_SCHEMES) or \u0022://\u0022 in lowered\u0060 appears character-identically in 2 files \u2014 skills/geniml/scripts/_common.py, skills/gtars/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f874ad512273b1806bee754d04dfcefe77b7a6dd8bf639def002f9647436967f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060maximum is not None and number \u003E maximum\u0060 appears character-identically in 4 files \u2014 skills/fluidsim/scripts/_common.py, skills/neurokit2/scripts/_common.py, skills/pathml/scripts/_common.py, skills/pptx-posters/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5e3e57e258e17955e5bb4d33d30d3129198f202a78e12ab871ba67d7fca64e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060maximum is not None and result \u003E maximum\u0060 appears character-identically in 2 files \u2014 skills/qutip/scripts/_common.py, skills/simpy/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qutip/scripts/_common.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"516979fed5cb00842192682b7d969cd32d77bbb2d23a8148b234867edf26a87c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060minimum is not None and number \u003C minimum\u0060 appears character-identically in 4 files \u2014 skills/fluidsim/scripts/_common.py, skills/neurokit2/scripts/_common.py, skills/pathml/scripts/_common.py, skills/pptx-posters/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"934c526d609372cc090998bb6975911e35b0d71d450bb2f923c130824dc6691d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not args.assembly.strip() or len(args.assembly) \u003E 200\u0060 appears character-identically in 4 files \u2014 skills/geniml/scripts/bed_validator.py, skills/geniml/scripts/consensus_plan.py, skills/geniml/scripts/embedding_plan.py, skills/geniml/scripts/tokenizer_compatibility.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/bed_validator.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bff4a575fbffbff9da79f79bb6bfb994e992b4d620a4966ab17a07a097d9127"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not args.output and len(rows) \u003E 200 and not args.force_stdout\u0060 appears character-identically in 2 files \u2014 skills/alphagenome/scripts/atlas_query.py, skills/alphagenome/scripts/score_variants.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/alphagenome/scripts/atlas_query.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29fb4441774cd36f11068ba0ee9c937917f7d466e6d88a56ef4d2083010c522"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not base_year or price_basis == \u0022not-applicable\u0022\u0060 appears character-identically in 2 files \u2014 skills/market-research-reports/scripts/audit_claim_citations.py, skills/market-research-reports/scripts/check_unit_consistency.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/market-research-reports/scripts/audit_claim_citations.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15dd5acc8719a4cbbb491637f2f5fe7010b887ecc238184af0cb5943b13a8f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not is_nonempty_string(value) or is_placeholder(value)\u0060 appears character-identically in 2 files \u2014 skills/scientific-writing/scripts/check_consistency.py, skills/scientific-writing/scripts/validate_manifest.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/check_consistency.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfec95703f5685f5e93ac1b96d8ed331c8c8b04ea8df1ddcfd02c81fa0ee87ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(data, list) or not data or not isinstance(data[0], dict)\u0060 appears character-identically in 6 files \u2014 skills/infographics/scripts/generate_infographic_ai.py, skills/latex-posters/scripts/generate_schematic_ai.py, skills/literature-review/scripts/generate_schematic_ai.py, skills/scientific-schematics/scripts/generate_schematic_ai.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"913a7b01c41c0ac92997838ef2302df2f8370baaa1dd67834d45cd25572b2ee4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(encoded, str) or not encoded\u0060 appears character-identically in 6 files \u2014 skills/infographics/scripts/generate_infographic_ai.py, skills/latex-posters/scripts/generate_schematic_ai.py, skills/literature-review/scripts/generate_schematic_ai.py, skills/scientific-schematics/scripts/generate_schematic_ai.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13ea7e2ef80cdaa9a952ae61ae48b28964e782d76eda70e8ea9e730359f37f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(evidence_id, str) or not EVIDENCE_ID_RE.fullmatch( evidence_id )\u0060 appears character-identically in 3 files \u2014 skills/scientific-writing/scripts/audit_claims.py, skills/scientific-writing/scripts/check_references.py, skills/scientific-writing/scripts/validate_manifest.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/audit_claims.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2217030281184f85379ab5d487ed94e2ce361603794a62105dfc296fe822b759"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(item, str) or not item.strip()\u0060 appears character-identically in 3 files \u2014 skills/iso-standards-readiness/scripts/check_capa.py, skills/iso-standards-readiness/scripts/check_traceability.py, skills/iso-standards-readiness/scripts/validate_scope_intake.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/iso-standards-readiness/scripts/check_capa.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"1771d8e763754dbaeb33d9f829e652ea1c6263f560aec3cc04f82520afabacee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(key, str) or len(key) \u003E 128\u0060 appears character-identically in 2 files \u2014 skills/clinical-reports/scripts/_common.py, skills/treatment-plans/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-reports/scripts/_common.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"cace9e8034c15da86b05278885229fc507f75c67e80838692231019e7dc358aa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(split, dict) or not expected.issubset(split)\u0060 appears character-identically in 2 files \u2014 skills/pytdc/scripts/load_and_split_data.py, skills/pytdc/scripts/molecular_generation.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pytdc/scripts/load_and_split_data.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"21dd6be24e59e87ebd6379f6b91ac61c65151ee8a1fe518cc832f507e417f08b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(text, str) or not text.strip()\u0060 appears character-identically in 3 files \u2014 skills/autoskill/scripts/backends.py, skills/uncertainty-and-units/scripts/_common.py, skills/uncertainty-and-units/scripts/convert_units.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/autoskill/scripts/backends.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b064354ec0aed429683081506ad22dfcdb3c4fff630fa57a6fa0304b0503deea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, list) or not value\u0060 appears character-identically in 3 files \u2014 skills/primer-design/scripts/design_primers.py, skills/qutip/scripts/_common.py, skills/qutip/scripts/qobj_model_validator.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/primer-design/scripts/design_primers.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3eeca2ae097d4e9e814ec4e5199c7f4e75587e43544a8cd110462351f632559"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, str) or not value.strip()\u0060 appears character-identically in 3 files \u2014 skills/clinical-decision-support/scripts/_common.py, skills/iso-standards-readiness/scripts/_common.py, skills/treatment-plans/scripts/check_completeness.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clinical-decision-support/scripts/_common.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ec7f96621cc616086f6ac6ec7ffffe557b55a462488138af0c70b406d6d039"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(values, list) or not values\u0060 appears character-identically in 2 files \u2014 skills/ncats-arax/scripts/arax_client.py, skills/pytdc/scripts/benchmark_evaluation.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"2482de4e7b5303811921d7e0252e5c4e4564d9bee3798fba6c37b0ad626588ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not line.strip() or line.startswith(\u0022#\u0022)\u0060 appears character-identically in 4 files \u2014 skills/alphagenome/scripts/_common.py, skills/genomic-coordinates/scripts/audit_intervals.py, skills/genomic-coordinates/scripts/check_contigs.py, skills/waypoint-bio/scripts/profiler_to_waypoint.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/alphagenome/scripts/_common.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d92da0df0c0cbf2f28c6dcb81ee7bc976035b7d084d0ab7fa76fad33a8d802"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not math.isfinite(number) or not minimum \u003C= number \u003C= maximum\u0060 appears character-identically in 2 files \u2014 skills/get-available-resources/scripts/_common.py, skills/hypogenic/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/_common.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"42843c3ffc200066f3ac143ea4c932d49d6e85bcc2e0bb803ed327aeddfead04"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not math.isfinite(number) or number \u003C= 0\u0060 appears character-identically in 4 files \u2014 skills/onekgpd/scripts/onekgpd_api.py, skills/pptx-posters/scripts/check_layout.py, skills/pymatgen/scripts/symmetry_sensitivity_report.py, skills/scientific-visualization/scripts/image_metadata.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/onekgpd/scripts/onekgpd_api.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d074dd99738650482fd979f705e44e8788745c291c3e337a2b4083c380387b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not math.isfinite(threshold) or not 0 \u003C= threshold \u003C= 1\u0060 appears character-identically in 2 files \u2014 skills/pyopenms/scripts/process_identifications.py, skills/rdkit/scripts/similarity_search.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/process_identifications.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca77d237a56d1ce9eacdb66182f89aa563f079aaa8e238c6d690cf2f8441fa6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not np.isfinite(alpha) or not 0 \u003C alpha \u003C 1\u0060 appears character-identically in 4 files \u2014 skills/pydeseq2/scripts/run_deseq2_analysis.py, skills/relsa-severity-assessment/scripts/forecast_relsa.py, skills/statistical-analysis/scripts/assumption_checks.py, skills/statistical-power/scripts/simulate_power.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydeseq2/scripts/run_deseq2_analysis.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e0c6be8488d2fbc9d106a2cfac7667f4b580861d5554c6185ad6eb74328c96"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not np.isfinite(values).all() or (values \u003C 0).any()\u0060 appears character-identically in 2 files \u2014 skills/bulk-rnaseq/scripts/build_counts_matrix.py, skills/scvelo/scripts/rna_velocity_workflow.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bulk-rnaseq/scripts/build_counts_matrix.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a8b75eb9563d2063367dc4e85d8f86c176da73e5c27ef85932c90f99bc3409"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not parent.exists() or not parent.is_dir()\u0060 appears character-identically in 3 files \u2014 skills/pptx-posters/scripts/_common.py, skills/scientific-visualization/scripts/_common.py, skills/scientific-visualization/scripts/figure_export.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_common.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e1162f729b8b573caf984aeec7f5df48c39bd19ae648f29d3717b511829b24"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not parent.exists() or not parent.is_dir() or parent.is_symlink()\u0060 appears character-identically in 6 files \u2014 skills/protocolsio-integration/scripts/_common.py, skills/pymatgen/scripts/_common.py, skills/qutip/scripts/_common.py, skills/scikit-survival/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/protocolsio-integration/scripts/_common.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b44a1cfc312576cf7ac16bebae2538d1073402cff19d6f5b9f1a88bfe0f54e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not parent.is_dir() or parent.is_symlink()\u0060 appears character-identically in 2 files \u2014 skills/scientific-writing/scripts/_common.py, skills/scientific-writing/scripts/scaffold_manuscript.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-writing/scripts/_common.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd196c0bb2873cc4de1068b6998117d11f7efffd9762974042bb24eb1e94f134"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not raw.strip() or raw.startswith((\u0022#\u0022, \u0022track \u0022, \u0022browser \u0022))\u0060 appears character-identically in 2 files \u2014 skills/genomic-coordinates/scripts/audit_intervals.py, skills/primer-design/scripts/design_primers.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/genomic-coordinates/scripts/audit_intervals.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f6bfc72c0a9931fc340500f094f67e9998efdf43b609b238be2e069781ab52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not result.markdown.strip() and not allow_empty\u0060 appears character-identically in 2 files \u2014 skills/markitdown/scripts/batch_convert.py, skills/markitdown/scripts/convert_literature.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/markitdown/scripts/batch_convert.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5413cbc39cc1e528feea86a12c6a5b7b4549ff55f2ab9093fe068de7928219"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output.exists() and any(output.iterdir())\u0060 appears character-identically in 3 files \u2014 skills/cellprofiler/scripts/nuclei_assay.py, skills/qiime2-amplicon/scripts/amplicon_workflow.py, skills/relion/scripts/spa_workflow.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/cellprofiler/scripts/nuclei_assay.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa87674bb602b202789e78ec6d1cf52e5dc79d38900025915a04b4dc97bd556"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.is_absolute() or \u0022..\u0022 in path.parts\u0060 appears character-identically in 2 files \u2014 skills/hypogenic/scripts/_common.py, skills/market-research-reports/scripts/validate_evidence_ledger.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypogenic/scripts/_common.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f493b32aabfb5bb9a128fa300e634db57a54bb00a20ea4a0e54753409e5f4e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.is_symlink() or path.parent.is_symlink()\u0060 appears character-identically in 2 files \u2014 skills/exploratory-data-analysis/scripts/_common.py, skills/neurokit2/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/exploratory-data-analysis/scripts/_common.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1654533a4d30ad5be41ebfec166d1f4936a99550926ec4dde012bcb2ab8bdc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060payload.startswith(\u0022data:\u0022) and \u0022,\u0022 in payload\u0060 appears character-identically in 2 files \u2014 scripts/generate_skill_image.py, skills/generate-image/scripts/generate_image.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate_skill_image.py"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f74356d77b5a182518ac1815ae9de8874cc919f74edcda2824c99460724a5e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prior_end is not None and start \u003C prior_end\u0060 appears character-identically in 2 files \u2014 skills/geniml/scripts/bed_validator.py, skills/gtars/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/bed_validator.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e46a3394197d2f6acb52203268499fac2f3a38281ebb83e5d6e9aef92d37ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.status_code != 200 or \u0022error\u0022 in response_json\u0060 appears character-identically in 6 files \u2014 skills/infographics/scripts/generate_infographic_ai.py, skills/latex-posters/scripts/generate_schematic_ai.py, skills/literature-review/scripts/generate_schematic_ai.py, skills/scientific-schematics/scripts/generate_schematic_ai.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac38d987388f48b9f6ce3c672d3b1e664b3a1375425c70d9df4cd3b0e26fa79d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060results[\u0022final_reviewed\u0022] and review.score \u003E= threshold and not review.needs_improvement\u0060 appears character-identically in 5 files \u2014 skills/infographics/scripts/generate_infographic_ai.py, skills/latex-posters/scripts/generate_schematic_ai.py, skills/literature-review/scripts/generate_schematic_ai.py, skills/scientific-schematics/scripts/generate_schematic_ai.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ae4b449f550c62c3b125dc7666ecd7296ff46c8a05b1e52e3edc4e69d2f259"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060results[\u0022success\u0022] and results[\u0022final_image\u0022]\u0060 appears character-identically in 5 files \u2014 skills/infographics/scripts/generate_infographic_ai.py, skills/latex-posters/scripts/generate_schematic_ai.py, skills/literature-review/scripts/generate_schematic_ai.py, skills/scientific-schematics/scripts/generate_schematic_ai.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbee0c0418004d5cbe13a2b9c50a2bf27f4c55471283f9e54d4fbfa0f8a753e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060review.reviewed and review.score is not None\u0060 appears character-identically in 6 files \u2014 skills/infographics/scripts/generate_infographic_ai.py, skills/latex-posters/scripts/generate_schematic_ai.py, skills/literature-review/scripts/generate_schematic_ai.py, skills/scientific-schematics/scripts/generate_schematic_ai.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/infographics/scripts/generate_infographic_ai.py"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99971b958dab25e7022ac56abdf2383df550f20bf74f6821475c76f6a7ae5e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source.is_file() and paths_overlap(source, destination)\u0060 appears character-identically in 3 files \u2014 skills/pydicom/scripts/deidentification_audit.py, skills/pydicom/scripts/dicom_inventory.py, skills/pydicom/scripts/extract_metadata.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pydicom/scripts/deidentification_audit.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9b6a4a8aa44e08f6b5188e51afabff262065626105774e898faf546bd18003"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start \u003E MAX_COORDINATE or end \u003E MAX_COORDINATE\u0060 appears character-identically in 2 files \u2014 skills/geniml/scripts/bed_validator.py, skills/gtars/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/bed_validator.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"789274b610b0b67b25bb1018142fb4617c0ca935cbe1c761bd39d646871a7e8d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.S_ISREG(info.st_mode) or stat.S_ISDIR(info.st_mode)\u0060 appears character-identically in 2 files \u2014 skills/fluidsim/scripts/_common.py, skills/pydicom/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"070538c3532146eb601ce83d514ccda989ab33c9bb8cef70e85727a9ffd656a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stat.S_ISREG(mode) or stat.S_ISDIR(mode)\u0060 appears character-identically in 2 files \u2014 skills/geniml/scripts/_common.py, skills/gtars/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/_common.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf029c6df63cef53be67c3747d01364b1e7890f3840f568435f9967ac6bad63a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060temporary_name and Path(temporary_name).exists()\u0060 appears character-identically in 3 files \u2014 skills/hypothesis-generation/scripts/_common.py, skills/market-research-reports/scripts/_common.py, skills/peer-review/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/hypothesis-generation/scripts/_common.py"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2670c515cbc6e864702373658bbab8ccd145e33da8b3a91cd0b4ecbf0e27db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060temporary_path is not None and temporary_path.exists()\u0060 appears character-identically in 2 files \u2014 skills/markitdown/scripts/batch_convert.py, skills/markitdown/scripts/convert_literature.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/markitdown/scripts/batch_convert.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"010e553b1124d321c73f7b68fddb3097183c5d47af3cc2fb563e2d515dd5502c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type(embedding_dim) is not int or embedding_dim \u003C= 0\u0060 appears character-identically in 2 files \u2014 skills/geniml/scripts/model_artifact_inspector.py, skills/geniml/scripts/tokenizer_compatibility.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/model_artifact_inspector.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"840fd7ece4192822347aeb98641e971e0538823d145bb19145ae182547ddca89"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type(vocab_size) is not int or vocab_size \u003C= 0\u0060 appears character-identically in 2 files \u2014 skills/geniml/scripts/model_artifact_inspector.py, skills/geniml/scripts/tokenizer_compatibility.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/geniml/scripts/model_artifact_inspector.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde1e2ebefa7f647e57022cbac03fe1bcf8d3a0d37536680767e95c9de31c940"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value is None or isinstance(value, (bool, int))\u0060 appears character-identically in 2 files \u2014 skills/omero-integration/scripts/omero_common.py, skills/protocolsio-integration/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/omero-integration/scripts/omero_common.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e3131f4803d759cd030ba0de493c64cc2cf7979443888db6b725a23f61f7e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value is None or isinstance(value, (bool, int, float))\u0060 appears character-identically in 2 files \u2014 skills/fluidsim/scripts/output_inventory.py, skills/ncats-arax/scripts/arax_client.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/output_inventory.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23946a3d6c371f048461e5caf883a3c86dd31c45bb0a1b851411711c4af2583"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value is None or isinstance(value, (bool, int, float, str))\u0060 appears character-identically in 3 files \u2014 skills/fluidsim/scripts/restart_compatibility.py, skills/fluidsim/scripts/simulation_dry_run.py, skills/matlab/scripts/_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/restart_compatibility.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a5b812819e6590f91e028a75373ecc8cb26b4c427602d20655e3be59131326"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value is not None and not math.isfinite(float(value))\u0060 appears character-identically in 2 files \u2014 skills/etetoolkit/scripts/quick_visualize.py, skills/etetoolkit/scripts/tree_operations.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/etetoolkit/scripts/quick_visualize.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe32da4b509ebd777b614f521428b1d11cce001ec2cf3aa074a6ad9e4623253"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060to_jsonable\u0060 is public and takes \u0060value: Any\u0060 from its caller, and it calls itself at line 282 (\u0060to_jsonable\u0060) with a piece of \u0060value\u0060 (and at line 284, line 286, line 288) \u2014 and nowhere in \u0060to_jsonable\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060to_jsonable\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/qutip/scripts/_common.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0060e174b7c744ec5be2553296968ef8e22e808149f905592d50d48d5177442"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060truncate_value\u0060 is public and takes \u0060value: Any\u0060 from its caller, and it calls itself at line 141 (\u0060truncate_value\u0060) with a piece of \u0060value\u0060 (and at line 145, line 147, line 150, line 155) \u2014 and nowhere in \u0060truncate_value\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060truncate_value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pytdc/scripts/_common.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58b98cd93cb4d9a0da28a718d752a0efe5d4f8cda3081444e4a99954a8e8b17"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060strict_json_dumps\u0060 is public, takes a document from its caller (line 111) and hands it to \u0060_assert_finite_json\u0060, which calls itself at line 89 (\u0060_assert_finite_json\u0060) with a piece of \u0060value\u0060 (and at line 92) \u2014 and nowhere in \u0060_assert_finite_json\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_assert_finite_json\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pufferlib/scripts/_common.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda5d52a51c0a107fd4cbc31c04cda9f92ea6316b4d0fa5314d82fd03748dc8e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060secret_key_paths\u0060 is public and takes \u0060value: Any\u0060 from its caller, and it calls itself at line 182 (\u0060secret_key_paths\u0060) with a piece of \u0060value\u0060 (and at line 185) \u2014 and nowhere in \u0060secret_key_paths\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060secret_key_paths\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pufferlib/scripts/_common.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaccd54b87fee272780476bb57bc13d20016a9abe9195a501e59b39892188841"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060build_plan\u0060 is public, takes a document from its caller (line 475) and hands it to \u0060_sensitive_paths\u0060, which calls itself at line 170 (\u0060_sensitive_paths\u0060) with a piece of \u0060value\u0060 (and at line 173) \u2014 and nowhere in \u0060_sensitive_paths\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_sensitive_paths\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/protocolsio-integration/scripts/plan_write_request.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4d9db4ec55623f48621901f8f00efcdf1da80b8428c70fd287e1d61c07fe3d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060build_plan\u0060 is public, takes a document from its caller (line 475) and hands it to \u0060_drop_sensitive\u0060, which calls itself at line 184 (\u0060_drop_sensitive\u0060) with a piece of \u0060value\u0060 (and at line 187) \u2014 and nowhere in \u0060_drop_sensitive\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_drop_sensitive\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/protocolsio-integration/scripts/plan_write_request.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"812cf948fcf27654d01f946c3f74dbb7de1e5b162ceb7d2a5ca9b6c34df19d81"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060has_placeholder\u0060 is public, takes a document from its caller (line 332) and hands it to \u0060walk\u0060, which calls itself at line 343 (\u0060walk\u0060) with a piece of \u0060item\u0060 (and at line 349) \u2014 and nowhere in \u0060walk\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pptx-posters/scripts/_common.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4455c57ef32f1e220f33ff645e77fc830f596145847b0a5fe29d673aed77b0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060element_text\u0060 is public, takes a document from its caller (line 99) and hands it to \u0060walk\u0060, which calls itself at line 115 (\u0060walk\u0060) with a piece of \u0060node\u0060 \u2014 and nowhere in \u0060walk\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/paper-lookup/scripts/jats_to_text.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fc7a75a5262b7998ce5dafeda713f07b37e5260bf54be46eae3e0f6861127c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060flatten_parameters\u0060 is public and takes \u0060parameters: Mapping[str, Any]\u0060 from its caller, and it calls itself at line 891 (\u0060flatten_parameters\u0060) with a piece of \u0060parameters\u0060 \u2014 and nowhere in \u0060flatten_parameters\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060flatten_parameters\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_schema.py"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ecf841c2013808c70d18fbc497b15a12788c9a85dd2f909253f22866a414b3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060scan_for_embedded_secrets\u0060 is public and takes \u0060value: Any\u0060 from its caller, and it calls itself at line 683 (\u0060self.scan_for_embedded_secrets\u0060) with a piece of \u0060value\u0060 (and at line 686) \u2014 and nowhere in \u0060scan_for_embedded_secrets\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060scan_for_embedded_secrets\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/dnanexus-integration/scripts/validate_dxapp.py"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"4802fc6660dded4799b1c21f17cc85ff5e4ba4997a9f729ac38ad1a1a37551bc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/timesfm-forecasting/scripts/check_system.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6218d23caad478f1ff489db28f26b84193f985193595ebc7cfc6dcc7e67be2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/timesfm-forecasting/scripts/check_system.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0397226bd2c04dacb7fdcd26f7709a4bae10668abee79cd75cf68fe1e5cbbf9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/image_metadata.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53f0218b029eb068774902bbc6e0a2916d1c572a64f7cc1a50ee125d5f2ff0d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/image_metadata.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"5647763358df2e6753a773ef463f5e3c1afc804b82e6d880562432620041acdd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-visualization/scripts/image_metadata.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"7377b9f9e2e8df262430cd76c763f3f64d0b2d547a9641f8d03dddfcf5d2092d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/scientific-slides/scripts/generate_slide_image_ai.py"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffabfd482370e90b364600d369a17afe9e12cccfd879f5fd9e2f119fc791308"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/forecast_relsa.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b32f2505a14b4d6ec9b31f7a8ce6ceb80d79f9e0468993fa6886408ee1ffec"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/relsa-severity-assessment/scripts/forecast_relsa.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f103303e1a92d20ecc8c789d982c8fc7128c277d6cc7134bf0c151b0af734f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/pyopenms/scripts/accurate_mass_search.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3716151180cb3545aa5df4123f3535574a070b3907aa9f45439f264efeb3a114"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/imaging-data-commons/scripts/check_version.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"484767ef9b5d224da107439ad0d3c8c240aa9fe2fe345bf55565987ca0d6d4f9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/dnanexus-integration/scripts/inspect_dxpy.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76d03a69996b2aca4921c576bf4a2f2f60e93f16b89505820d1887e73e3716f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/diffdock/scripts/analyze_results.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9660f2edb8774e035b6846d0dc7ce17a54779018747b1d0e53ec9fa15d8380f5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/diffdock/scripts/analyze_results.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"874c42114f03131d196ba53a14f5d60dd8238ddabfebb1651659a4e85085a55d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bioservices/scripts/pathway_analysis.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2634004e76d5f3f235a92de74b3e914bb7e6c0cdee0c9e0e18ad687245fcdffb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/bioservices/scripts/protein_analysis_workflow.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cda8bde48b10b7e662b50faebfab41421599fdc4d03c41a7c2e57a401f05e8f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060relative_display\u0060 returns \u0060\u0027\u003Coutside-root\u003E\u0027\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/fluidsim/scripts/_common.py"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1b41255cefe90d360c785a4a2e809afac92dd97d0f7a04236548fb77a0a55b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060parse_amd_json\u0060 returns \u0060[]\u0060 when \u0060(json.JSONDecodeError, RecursionError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6384fbc10d76ce25135cf2efef5ccb0242a5211d5d618a73a98fea6649c720"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060parse_apple_profiler_json\u0060 returns \u0060[]\u0060 when \u0060(json.JSONDecodeError, RecursionError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/get-available-resources/scripts/detect_resources.py"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe58cf5978c81daf4972761628c4c484ebee51fb735a2ffb5f775972a682cc2f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_edge_polylines\u0060 returns \u0060[]\u0060 when \u0060(AttributeError, TypeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/lab-hardware-cad/scripts/snapshot.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc5cf9ac96e3086e2854525982a538d7c437adafefc90c61139c351c5e52038"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_retry_delay\u0060 returns \u00601.0\u0060 when \u0060(TypeError, ValueError, OverflowError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ncats-arax/scripts/arax_client.py"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9d50ce40cc9c84072da914d839db19a0ddb4c075a0c4fdfd8b9c607da3999b"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":21,"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."]}]}