{"$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":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"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":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D32","name":"Data Compliance (PII/GDPR)","shortDescription":{"text":"Data Compliance (PII/GDPR)"},"helpUri":"https://codehealth.canine.dev/dimensions/D32","relationships":[{"target":{"id":"CWE-359","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-312","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-359","CWE-312","CWE-200"],"owasp":"A01:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"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":"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":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"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":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"inspect_region_decomposition.validate_manifest (cyclomatic 100): inspect_region_decomposition.validate_manifest has cyclomatic complexity 100 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-image2ppt/scripts/inspect_region_decomposition.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e3f0b2515375c0ba6f5d265435a8c66ac98557f5a49d1933329fe638e9c6bf"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_patent_draft.validate (cyclomatic 91): validate_patent_draft.validate has cyclomatic complexity 91 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-paper-to-patent/scripts/validate_patent_draft.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7670f04d25d9832d6972390f699155242c6fb2caea8a71e38182e9a80fed22e1"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_panel_alignment.audit_layout_manifest (cyclomatic 60): audit_panel_alignment.audit_layout_manifest has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-figure/scripts/audit_panel_alignment.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca3a235ddce61e621e71169767537d236082a438e6c156b9cd63bf9ff837cb5"}},{"ruleId":"D1","level":"warning","message":{"text":"batch_download.downloadDoi (cyclomatic 57): batch_download.downloadDoi 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/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab09c1a132acecb0254926d6f04a07b532ed184ce20cded07529295d10e9362"}},{"ruleId":"D1","level":"warning","message":{"text":"md_to_docx.convert_md_to_docx (cyclomatic 49): md_to_docx.convert_md_to_docx 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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"de737410c33509672d021044abb3493580c3ebb8733ecc408c879b322aa1bbf6"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_pptx.main (cyclomatic 47): validate_pptx.main 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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe123f3df9c417982436b1b692e83a0e34388afa5f82897ed34ef91aa54b0a4"}},{"ruleId":"D1","level":"warning","message":{"text":"batch_download.main (cyclomatic 47): batch_download.main has cyclomatic complexity 47 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1caf294926640e685d6e520c8eb9281538e90804708f823fcd8a8a25b62815"}},{"ruleId":"D1","level":"warning","message":{"text":"batch_download.routeDoiDownload (cyclomatic 42): batch_download.routeDoiDownload has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f9e897b3661bde3232a87bb547cd23dbc6b6ee3e52c6ef1ae6f3ddf2b31559"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_panel_alignment._validated_layout (cyclomatic 41): audit_panel_alignment._validated_layout 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/nature-figure/scripts/audit_panel_alignment.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"47eebf9a680dda62af7bb4caea12e87ac624a34aa4a0141d1cb74dbefff5a9eb"}},{"ruleId":"D1","level":"warning","message":{"text":"render_flowchart_svg.validate_figure (cyclomatic 41): render_flowchart_svg.validate_figure 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/nature-paper-to-patent/scripts/render_flowchart_svg.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2bace1d35a9fa889af49665c75c210a823370d721f1424b38b1ab2dc8b01f6"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_paper_card.audit (cyclomatic 40): audit_paper_card.audit 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/nature-paper-card/scripts/audit_paper_card.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f3163979ef0c59458ac8d32f64a10faeba4fba72030d43ddd6ee38f3504b1c"}},{"ruleId":"D1","level":"warning","message":{"text":"math_render.render_markdown_math (cyclomatic 40): math_render.render_markdown_math 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/nature-paper-to-patent/scripts/disclosure/math_render.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f220e6f40589533e3835e1942b4cbe3396b577bc143bca3656f6688102421730"}},{"ruleId":"D1","level":"warning","message":{"text":"academic_search.main (cyclomatic 39): academic_search.main 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/nature-academic-search/scripts/academic_search.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d838eb5abfbc2d177b098bb1904067c2809934facabafccca9674968418c2a"}},{"ruleId":"D1","level":"warning","message":{"text":"batch_download.parseArgs (cyclomatic 37): batch_download.parseArgs 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/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adbb64c5899f38981422f6d77d62cf15f08a714a43f32c8e18d13aa28696f36"}},{"ruleId":"D1","level":"warning","message":{"text":"pubmed._parse_article (cyclomatic 34): pubmed._parse_article 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/nature-academic-search/mcp-server/sources/pubmed.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d980ec307477e71c4f665f4e5cb414515249d399d407e66132d0a4ecf204ac45"}},{"ruleId":"D1","level":"warning","message":{"text":"run_image2ppt_qa.main (cyclomatic 33): run_image2ppt_qa.main 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/nature-image2ppt/scripts/run_image2ppt_qa.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4439b44ef3e1d0e0121d26cfdad1426161dc25fc3520fd4281166523fee3f4"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_figure_collisions.extract_pdf_geometry (cyclomatic 32): audit_figure_collisions.extract_pdf_geometry 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/nature-figure/scripts/audit_figure_collisions.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1bb8620a7a6a86e1aa831060c4697caa9a4872513fc4a6f7d82cfceff87751"}},{"ruleId":"D1","level":"warning","message":{"text":"run_final_image2ppt_qa.main (cyclomatic 32): run_final_image2ppt_qa.main 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/nature-image2ppt/scripts/run_final_image2ppt_qa.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"93699402c3b3b3ba738f72d09cfeecdc49387edc26e2469a3ba4cda78c8ae5a1"}},{"ruleId":"D1","level":"warning","message":{"text":"cnki.downloadCnkiTitle (cyclomatic 32): cnki.downloadCnkiTitle 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/nature-downloader/scripts/lib/cnki.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b2038bade3de398b7b2a131c65e1fff1701edd15b35a206deef25ccf39934f"}},{"ruleId":"D1","level":"warning","message":{"text":"record_imagegen_result.main (cyclomatic 27): record_imagegen_result.main 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/nature-image2ppt/cli/image2ppt/runtime/record_imagegen_result.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a37ab77967896e6d53ec44caa8117db989e8781e9fb3a00d2b0a2f77099c4bb"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_pptx.quality_contract_violations (cyclomatic 26): validate_pptx.quality_contract_violations 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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10f240af2e754a71af1a9ca77208b40d787ddaa2fa84dbe24f079cdc89dbc72"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_pptx.formula_contract_violations (cyclomatic 26): validate_pptx.formula_contract_violations 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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"540aba94972bba0074d09a1757735e1d2758403473694b80931cae4f632fee00"}},{"ruleId":"D1","level":"warning","message":{"text":"format-converter.main (cyclomatic 26): format-converter.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/nature-academic-search/scripts/format-converter.py"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"79603dc103f6bd94441bb13fbb8d3fa7723063179410939e809aeef25e95167f"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_panel_alignment.matplotlib_layout_manifest (cyclomatic 26): audit_panel_alignment.matplotlib_layout_manifest 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/nature-figure/scripts/audit_panel_alignment.py"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"14967bfc76257b5f20211b39543459fb6acc15fbe9857eba69612b9aff1946c6"}},{"ruleId":"D1","level":"warning","message":{"text":"prepare_paper.validate_bundle (cyclomatic 26): prepare_paper.validate_bundle 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/nature-paper-card/scripts/prepare_paper.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"36937599f22a50a620b7824064a62ad5e994a56716cfdcdbca4f54b068b95287"}},{"ruleId":"D1","level":"warning","message":{"text":"md_to_docx._image_pixel_size (cyclomatic 26): md_to_docx._image_pixel_size 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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06f99475479ee0d8c06177528492b923454d7a95a670cb9a983f1bb56d242ca"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_pptx.foreground_asset_contract_violations (cyclomatic 25): validate_pptx.foreground_asset_contract_violations 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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5defbecade3c84b580cb55cae5274f6879bcac44589f8494f929e6aba779d7"}},{"ruleId":"D1","level":"warning","message":{"text":"academic_search.search (cyclomatic 24): academic_search.search 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/nature-academic-search/scripts/academic_search.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"809397457f4ad3e24f888dab9849fc14cf84ec2af96751b03aed1b8b470df0cd"}},{"ruleId":"D1","level":"warning","message":{"text":"nature_citation.main (cyclomatic 24): nature_citation.main 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/nature-citation/scripts/nature_citation.py"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e29a55f0ae09b8f93ca67dfbff640bca3b86f7a4cdb306a56a948b626a13779"}},{"ruleId":"D1","level":"warning","message":{"text":"wos-supporting-information.selectSupportingInformationLinks (cyclomatic 24): wos-supporting-information.selectSupportingInformationLinks has cyclomatic complexity 24 (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/nature-downloader/scripts/lib/wos-supporting-information.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"873f2ff806ce1d39f1d88f6c33b0c99b48e6f96c1bb675f37960e45006f533b8"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_pptx.validate_deck (cyclomatic 23): validate_pptx.validate_deck 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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b38e8b1f6a8fd811913127641097993b8503ac47ee15af16278f525b892bf6"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_pdf_text.scan_text_runs (cyclomatic 23): audit_pdf_text.scan_text_runs 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/nature-figure/scripts/audit_pdf_text.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"21673ad57b62c210535b78856d425fd0d6d106dfc7980d5cc273be027ea24e9a"}},{"ruleId":"D1","level":"warning","message":{"text":"cnipa_epub_parse._parse_overview_card_layout (cyclomatic 23): cnipa_epub_parse._parse_overview_card_layout 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/nature-paper-to-patent/scripts/disclosure/cnipa_epub_parse.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dd7f6b67f85831a6e6df25e2d3c28624474c3627abb604b9db205eee40584e"}},{"ruleId":"D1","level":"warning","message":{"text":"academic_search_server._format_basic_citation (cyclomatic 22): academic_search_server._format_basic_citation 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/nature-academic-search/mcp-server/academic_search_server.py"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f13ce03d795c3daa77b0b81a742bb34bb3cb9b75eac1527e46a5be2b9a61135"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_figure.check_rotation_anchor (cyclomatic 22): validate_figure.check_rotation_anchor 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/nature-figure/scripts/validate_figure.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e72f4a37100567c084da6b299b76648f9f0a02f0f0cec9fbacd9728541449c"}},{"ruleId":"D1","level":"warning","message":{"text":"pages.check_assets (cyclomatic 22): pages.check_assets 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/nature-paper-trans/scripts/pages.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbab896e5dc0d13b4bad8d57a4474e2878f65ff14b6ad5e4654057cab4ad1894"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_reader_math.validate_source_map (cyclomatic 22): validate_reader_math.validate_source_map 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/nature-reader/scripts/validate_reader_math.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3fb028e45a8bf95ce6dedd8fc1dfa3ed9a500185fffaada619b8ab6c35cb1b"}},{"ruleId":"D1","level":"warning","message":{"text":"converters.arxiv_to_bib (cyclomatic 21): converters.arxiv_to_bib 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/nature-academic-search/scripts/converters.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16eb39263e78fd6f825a4d3877779d4785b2ef947bc7e83f21fa1ef219500b4"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_claims.audit (cyclomatic 21): audit_claims.audit 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/nature-paper-to-patent/scripts/audit_claims.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6269a81ca4c879d9a79da74f588f713b77612e0743deb23b71058bd98449d5f9"}},{"ruleId":"D1","level":"warning","message":{"text":"math_to_omml._append_mathml (cyclomatic 21): math_to_omml._append_mathml 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/nature-paper-to-patent/scripts/math_to_omml.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4105b17232677b9b75f1f83d23eaaa3423e3d640b7710cc52f1818aafe68778"}},{"ruleId":"D1","level":"warning","message":{"text":"PubMedSource.lookup_mesh (cyclomatic 20): PubMedSource.lookup_mesh 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/nature-academic-search/mcp-server/sources/pubmed.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5ae81021cf11775109fb131a2f9aabd0394fb87757fafffeb06943750f3a63"}},{"ruleId":"D1","level":"warning","message":{"text":"open-access-provider.downloadOpenAccessArticle (cyclomatic 20): open-access-provider.downloadOpenAccessArticle has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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/nature-downloader/scripts/lib/open-access-provider.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"56268c5c0a6cf539f1f98256b91f3968fdcb4d7a1b0c441adf36ee885472fa7e"}},{"ruleId":"D1","level":"warning","message":{"text":"converters.arxiv_to_ris (cyclomatic 19): converters.arxiv_to_ris 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/nature-academic-search/scripts/converters.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"90394057ffe094ff5cd1a50eb96905ee2c48443b909721f5c8357cf1cbeef829"}},{"ruleId":"D1","level":"warning","message":{"text":"converters.arxiv_to_enw (cyclomatic 19): converters.arxiv_to_enw 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/nature-academic-search/scripts/converters.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b33900563cb26f7cb1b4f6dc79784d3e60758ddbef42a39ba586f6c9e1e547"}},{"ruleId":"D1","level":"warning","message":{"text":"plot_comparison_radar.plot_radar (cyclomatic 19): plot_comparison_radar.plot_radar 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/nature-figure/assets/figures4papers/figure_VIGIL/plot_comparison_radar.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a955a33f18bb18133755d325d64350f17a0734a08f81c171e8b80915244cc130"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_figure_collisions.audit_page_geometry (cyclomatic 19): audit_figure_collisions.audit_page_geometry 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/nature-figure/scripts/audit_figure_collisions.py"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dfae6869f6c8869e55ef7889d0ddae19abd1168006bfe0de422079b0f082c0"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_figure.check_syntax (cyclomatic 19): validate_figure.check_syntax 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/nature-figure/scripts/validate_figure.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bd6b6e77d4e8b46a0783b95921942161cc0e77cd88abe28892647ed441574e"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_figure._python_multipanel_signals (cyclomatic 19): validate_figure._python_multipanel_signals 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/nature-figure/scripts/validate_figure.py"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2032601b889ca94066843edcfe8af95b6e192e0f1afed8c003053a30f123ba"}},{"ruleId":"D1","level":"warning","message":{"text":"postprocess_manifest_arrows.postprocess_pptx (cyclomatic 19): postprocess_manifest_arrows.postprocess_pptx 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/nature-image2ppt/scripts/postprocess_manifest_arrows.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe30adad6b2e75fb66d4f70955cdc89abe36f85b38d02f721774fc177a5a64e"}},{"ruleId":"D1","level":"warning","message":{"text":"render_image2ppt_qa.main (cyclomatic 19): render_image2ppt_qa.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/nature-image2ppt/scripts/render_image2ppt_qa.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8a9009f0b6b3abc9e83a83d78aed57bd8a433276f1dce8220e72506433b043"}},{"ruleId":"D1","level":"warning","message":{"text":"md_to_docx._split_table_cells (cyclomatic 19): md_to_docx._split_table_cells 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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"7935561c477d3a65e7abfba0030fca18fd058236195c74ad9013947aae2d5d12"}},{"ruleId":"D1","level":"warning","message":{"text":"pages.publish_export (cyclomatic 19): pages.publish_export 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/nature-paper-trans/scripts/pages.py"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"242ee331e995f98c2d61a96254cd3eb07aff0447032ac97d72bb4ffcfd7b6e7b"}},{"ruleId":"D1","level":"warning","message":{"text":"publisher-providers.downloadPublisherRequest (cyclomatic 19): publisher-providers.downloadPublisherRequest 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/nature-downloader/scripts/lib/publisher-providers.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ab88afa11c62ac4f3c22611d2ea50e98db62200672ba7852016de5bb27111f"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_env.config (cyclomatic 18): runtime_env.config 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/nature-image2ppt/cli/image2ppt/runtime/runtime_env.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"9923d970662f29d42e9280834ac02ec9872317235b11a793b20c959c14a7f0ae"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect_arrow_atomicity.inspect_arrow (cyclomatic 18): inspect_arrow_atomicity.inspect_arrow 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/nature-image2ppt/scripts/inspect_arrow_atomicity.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ec324a44efd4c9faf85f1b9549fbebec18db79aadfc465c26127e7540f452e"}},{"ruleId":"D1","level":"warning","message":{"text":"build_patent_package.validate (cyclomatic 18): build_patent_package.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/nature-paper-to-patent/scripts/build_patent_package.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b7b212a73ef73b4b19278a78d86b4682b2ba82088c2d8c7623de0abea83276"}},{"ruleId":"D1","level":"warning","message":{"text":"cnipa_epub_parse.parse_search_result_html (cyclomatic 18): cnipa_epub_parse.parse_search_result_html 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/nature-paper-to-patent/scripts/disclosure/cnipa_epub_parse.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2c81b05a9fc9274315044d2ad8b67e004cf54b8b7a48f512330c8fe6797fac"}},{"ruleId":"D1","level":"warning","message":{"text":"cnipa_epub_parse._parse_search_result_fallback_links (cyclomatic 18): cnipa_epub_parse._parse_search_result_fallback_links 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/nature-paper-to-patent/scripts/disclosure/cnipa_epub_parse.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"018b8e6506ba3918675216479bd6a8135f8c2d166b69ed3f0b3e7a589bbdf145"}},{"ruleId":"D1","level":"warning","message":{"text":"reference_layout.build_reference (cyclomatic 18): reference_layout.build_reference 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/nature-paper2word/scripts/reference_layout.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a76b81053a781c5fd3adafdf276406abbe3962835464a583e20096166566a3f"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_reader_math.validate_markdown (cyclomatic 18): validate_reader_math.validate_markdown 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/nature-reader/scripts/validate_reader_math.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce37a511644f738ed6cab233af056214f31ce24163522687ff4ae0765377cda"}},{"ruleId":"D1","level":"warning","message":{"text":"anti-bot.handleVerification (cyclomatic 18): anti-bot.handleVerification 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/nature-downloader/scripts/lib/anti-bot.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f377fa063eb1bf98f76de84bd7b84e0d08746f826f2120235475d4047c93b949"}},{"ruleId":"D1","level":"warning","message":{"text":"wos-supporting-information.downloadWosSupportingInformation (cyclomatic 18): wos-supporting-information.downloadWosSupportingInformation 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/nature-downloader/scripts/lib/wos-supporting-information.mjs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a0aa2c991a68a2bbb7dbde322452dcfa0ca85c84fd080bc45c7dbcdc575d30"}},{"ruleId":"D1","level":"warning","message":{"text":"_page_artifacts.process_asset_sheet (cyclomatic 17): _page_artifacts.process_asset_sheet 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/nature-image2ppt/cli/image2ppt/runtime/_page_artifacts.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4d5758b61bd205f761f080126065d967231a212419b10e79c5c69c9eeb22b8"}},{"ruleId":"D1","level":"warning","message":{"text":"build_pptx_from_manifest.normalize_position_item (cyclomatic 17): build_pptx_from_manifest.normalize_position_item 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/nature-image2ppt/cli/image2ppt/runtime/build_pptx_from_manifest.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"26de80e13e04558e1b8546483d3d6a8942fae451355da120f29f1f562f4311b6"}},{"ruleId":"D1","level":"warning","message":{"text":"remove_chroma_key._validate_args (cyclomatic 17): remove_chroma_key._validate_args 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/nature-image2ppt/cli/image2ppt/runtime/remove_chroma_key.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5615610f141893a00e59c53593ec775f93d0b43fc7ad82a435bc52341d09b525"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_env.doctor (cyclomatic 17): runtime_env.doctor 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/nature-image2ppt/cli/image2ppt/runtime/runtime_env.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b10e6aecacb6e749faacf47cb20c390e715314481bf25778aa7eb77dcf62bc7"}},{"ruleId":"D1","level":"warning","message":{"text":"wizard.infer_access_from_url (cyclomatic 17): wizard.infer_access_from_url 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/nature-downloader/src/wizard.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2faa1da676341db410656acfecbd06d82adf576fcc2451342b54840f09105aa7"}},{"ruleId":"D1","level":"warning","message":{"text":"visual_review_evidence.validate_evidence (cyclomatic 17): visual_review_evidence.validate_evidence 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/nature-image2ppt/scripts/visual_review_evidence.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca446bfb09ff1ab0c7a79d0431864048f4b77f1427b650c9665c3e06d2f75c39"}},{"ruleId":"D1","level":"warning","message":{"text":"mermaid_render.render_markdown_mermaid (cyclomatic 17): mermaid_render.render_markdown_mermaid 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/nature-paper-to-patent/scripts/disclosure/mermaid_render.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"717f5edb280dc94377bc7244ced381c480abe2345e1ae521bb4bee2365187903"}},{"ruleId":"D1","level":"warning","message":{"text":"mermaid_render.main (cyclomatic 17): mermaid_render.main 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/nature-paper-to-patent/scripts/disclosure/mermaid_render.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f55777717672b1b786de55d53ce23e2c4caef1fe5e282e3f34bee33c9528d44"}},{"ruleId":"D1","level":"warning","message":{"text":"converters.crossref_to_ris (cyclomatic 16): converters.crossref_to_ris 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/nature-academic-search/scripts/converters.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aef4a0bd32edf595cf902783f7163783c53ed62f3ba8d855832eefa05f7c1ee"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_to_md._run (cyclomatic 16): pptx_to_md._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/nature-paper-to-patent/scripts/disclosure/pptx_to_md.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d674544390f5dd709c95d1ad8d325fd5f4795d3ded95dbbf2c9ff1584b95e26"}},{"ruleId":"D1","level":"warning","message":{"text":"anti-bot.simulateDrag (cyclomatic 16): anti-bot.simulateDrag has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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/nature-downloader/scripts/lib/anti-bot.mjs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e6442a5b9033f1853d7fc6fed5ed5fdee454a253e97a0bcd542d3acc175b5d"}},{"ruleId":"D1","level":"warning","message":{"text":"browser_pdf_downloader.main (cyclomatic 16): browser_pdf_downloader.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/nature-downloader/scripts/browser_pdf_downloader.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"78eef6de3372ae60b914ace324e085be98e64a248252f2dcbdd8aa680ed38154"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect_region_decomposition.validate_manifest (cognitive 216): inspect_region_decomposition.validate_manifest has cognitive complexity 216 (threshold 15). Drivers by points: if/else 60 (170 pts), boolean chains 32, loops 6 (14 pts) (nesting depth added 118). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-image2ppt/scripts/inspect_region_decomposition.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e3e3fefc627e6dd140783c1c92e9b00f5e96834fcb3c1f6776cfbb605e1463"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_panel_alignment.audit_layout_manifest (cognitive 146): audit_panel_alignment.audit_layout_manifest has cognitive complexity 146 (threshold 15). Drivers by points: if/else 35 (97 pts), ternaries 9 (22 pts), loops 5 (12 pts), boolean chains 10, error handling 1 (5 pts) (nesting depth added 86). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-figure/scripts/audit_panel_alignment.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7de6fb0ed676958a230dd7cd66c812b78df0855d06c2b60d0baaf9a760cd01"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_patent_draft.validate (cognitive 136): validate_patent_draft.validate has cognitive complexity 136 (threshold 15). Drivers by points: if/else 49 (93 pts), loops 23 (31 pts), boolean chains 12 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-paper-to-patent/scripts/validate_patent_draft.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a878d39f7617a73cf13b4ae9971cf7924a666ac91eeb7f016f0bc6578e9785c"}},{"ruleId":"D2","level":"warning","message":{"text":"md_to_docx.convert_md_to_docx (cognitive 114): md_to_docx.convert_md_to_docx has cognitive complexity 114 (threshold 15). Drivers by points: if/else 30 (82 pts), loops 7 (20 pts), boolean chains 11, error handling 1 (nesting depth added 65). 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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"0600290ef0f4ac9ed5113911e4bff5dac79d681a9729987f00fa5d4d9d3900ce"}},{"ruleId":"D2","level":"warning","message":{"text":"math_render.render_markdown_math (cognitive 98): math_render.render_markdown_math has cognitive complexity 98 (threshold 15). Drivers by points: if/else 23 (60 pts), ternaries 5 (17 pts), boolean chains 11, loops 4 (10 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/nature-paper-to-patent/scripts/disclosure/math_render.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe13541bd4416fce245bca50236c999d438e598b4a0f859fdc8069e0f66eeb2"}},{"ruleId":"D2","level":"warning","message":{"text":"batch_download.downloadDoi (cognitive 91): batch_download.downloadDoi has cognitive complexity 91 (threshold 15). Drivers by points: if/else 20 (43 pts), boolean chains 23, ternaries 9 (23 pts), loops 2 (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/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3d5b9a45e2f320722d9f6ca21bdf3ccb03b4de1c21a481778bac63d45c3a94"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_figure_collisions.extract_pdf_geometry (cognitive 82): audit_figure_collisions.extract_pdf_geometry has cognitive complexity 82 (threshold 15). Drivers by points: if/else 15 (51 pts), loops 9 (22 pts), boolean chains 6, error handling 2 (3 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-figure/scripts/audit_figure_collisions.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2b6994fd83117d810c3b905bd88ed76caa4a099a3b1d2f1ae413bb4f9ea411"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_pptx.main (cognitive 73): validate_pptx.main has cognitive complexity 73 (threshold 15). Drivers by points: if/else 29 (52 pts), loops 9 (10 pts), boolean chains 5, error handling 3 (5 pts), ternaries 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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d0eb22b5b3096bf76b401b7c8b0255f31d5869432ab1173d52b3cc4581f36a"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_paper_card.audit (cognitive 69): audit_paper_card.audit has cognitive complexity 69 (threshold 15). Drivers by points: if/else 33 (42 pts), ternaries 8 (18 pts), boolean chains 5, loops 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":"skills/nature-paper-card/scripts/audit_paper_card.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ce1b7995a5c48949246dfc9bc06312756f265d46d4330db448ea1dfdcc6f8b"}},{"ruleId":"D2","level":"warning","message":{"text":"batch_download.main (cognitive 68): batch_download.main has cognitive complexity 68 (threshold 15). Drivers by points: if/else 21 (37 pts), boolean chains 18, ternaries 4 (10 pts), loops 2 (3 pts) (nesting depth added 23). Of this number, 64 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc1b1de6942c939e961a2575fb1c1f76bafaee81cebed8c302249a1fe92281d"}},{"ruleId":"D2","level":"warning","message":{"text":"cnki.downloadCnkiTitle (cognitive 67): cnki.downloadCnkiTitle has cognitive complexity 67 (threshold 15). Drivers by points: if/else 21 (42 pts), ternaries 8 (21 pts), boolean chains 3, loops 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/cnki.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2e29d546913c267c82691688ff39b93923120fc134b4eb9faa00e1088670d6"}},{"ruleId":"D2","level":"warning","message":{"text":"render_flowchart_svg.validate_figure (cognitive 65): render_flowchart_svg.validate_figure has cognitive complexity 65 (threshold 15). Drivers by points: if/else 28 (49 pts), loops 6 (10 pts), boolean chains 6 (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/nature-paper-to-patent/scripts/render_flowchart_svg.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"953f6ec2fb4a0c0209318222daf57d6cfde0555d639120e2321d08a1f34a0266"}},{"ruleId":"D2","level":"warning","message":{"text":"pubmed._parse_article (cognitive 64): pubmed._parse_article has cognitive complexity 64 (threshold 15). Drivers by points: if/else 16 (43 pts), boolean chains 9, error handling 1 (5 pts), loops 3 (5 pts), ternaries 2 (nesting depth added 33). 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/nature-academic-search/mcp-server/sources/pubmed.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4764e3209c1c846fe6cc5d5c4836a3d09f3832b769e6ca5deffe98aaff004796"}},{"ruleId":"D2","level":"warning","message":{"text":"academic_search.main (cognitive 61): academic_search.main has cognitive complexity 61 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 12, error handling 6 (9 pts), loops 3 (8 pts), ternaries 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-academic-search/scripts/academic_search.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97502cacaf0b0cc0694bf2bdcb70b64b61e730bfc837e7324c39566535026c5"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_panel_alignment._validated_layout (cognitive 57): audit_panel_alignment._validated_layout has cognitive complexity 57 (threshold 15). Drivers by points: if/else 23 (37 pts), boolean chains 10, error handling 4 (7 pts), loops 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/nature-figure/scripts/audit_panel_alignment.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff78ac63197527601cbbd09afdea11185d5cd04cf30c7620afb2d8aae6867fc"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_pptx.foreground_asset_contract_violations (cognitive 54): validate_pptx.foreground_asset_contract_violations has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (49 pts), boolean chains 3, loops 2 (nesting depth added 29). 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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c028038e8f3d35b5d761626a518b1c06486065dab1e5c4f197c08653890a508e"}},{"ruleId":"D2","level":"warning","message":{"text":"batch_download.routeDoiDownload (cognitive 54): batch_download.routeDoiDownload has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (22 pts), ternaries 12 (20 pts), boolean chains 11, error handling 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"8285de967df363ba331d6ffeb357cfd9da5239d69e3ecdcd863982bd536ab2b0"}},{"ruleId":"D2","level":"warning","message":{"text":"md_to_docx._image_pixel_size (cognitive 49): md_to_docx._image_pixel_size has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (35 pts), boolean chains 8, loops 2 (5 pts), error handling 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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b497fe8f01b527e1ff2581eacd5cf7ac39a11eb8aae1aa5620cb181dc0c561bb"}},{"ruleId":"D2","level":"warning","message":{"text":"format-converter.main (cognitive 45): format-converter.main has cognitive complexity 45 (threshold 15). Drivers by points: if/else 22 (34 pts), ternaries 2 (6 pts), loops 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/nature-academic-search/scripts/format-converter.py"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e48b2e282abfd6c3e5cf7337f5239feeac51cdd7f871c4687eb9cd195d3d0f"}},{"ruleId":"D2","level":"warning","message":{"text":"mermaid_render.render_markdown_mermaid (cognitive 45): mermaid_render.render_markdown_mermaid has cognitive complexity 45 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 4 (12 pts), boolean chains 3, error handling 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 29). 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/nature-paper-to-patent/scripts/disclosure/mermaid_render.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3a84bda1003d625e9f9d4cf729619fcfd12dbd9bca062580c6efa607dd4616"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_pptx.quality_contract_violations (cognitive 44): validate_pptx.quality_contract_violations has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 7, loops 4 (7 pts), ternaries 1 (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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27d05de70b0a0d7d87cfde1d77f92b5b439479292f42edbb45e69b4b99970d4"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_figure_collisions.audit_page_geometry (cognitive 44): audit_figure_collisions.audit_page_geometry has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 7 (11 pts), ternaries 1 (4 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/nature-figure/scripts/audit_figure_collisions.py"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c87bb322ae3b4b41f2757cbd39404199e979729a94762c08e5908651f885ef"}},{"ruleId":"D2","level":"warning","message":{"text":"run_image2ppt_qa.main (cognitive 43): run_image2ppt_qa.main has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 9, error handling 2 (5 pts), ternaries 3, 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/nature-image2ppt/scripts/run_image2ppt_qa.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc6b9fd9fc2d6a797c78e6ceb2c093f450123cc5a0f0ef62e8aca91927a41f8"}},{"ruleId":"D2","level":"warning","message":{"text":"run_final_image2ppt_qa.main (cognitive 41): run_final_image2ppt_qa.main has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 10, error handling 2 (3 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/nature-image2ppt/scripts/run_final_image2ppt_qa.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fb5919069f9e5f8c2dafb51cb5e87ca9588d0d1cbb6ca673bdb4f23a107be3"}},{"ruleId":"D2","level":"warning","message":{"text":"plot_comparison_radar.plot_radar (cognitive 40): plot_comparison_radar.plot_radar has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 9 (12 pts), ternaries 3 (9 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/nature-figure/assets/figures4papers/figure_VIGIL/plot_comparison_radar.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"203e656c26426b47fcf320310a9c2787d3d360463f6ac7b76074605a2490956a"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_panel_alignment.matplotlib_layout_manifest (cognitive 40): audit_panel_alignment.matplotlib_layout_manifest has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 6, error handling 2 (4 pts), loops 3 (4 pts), ternaries 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/nature-figure/scripts/audit_panel_alignment.py"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"106e60515f911c9482c8a6426fdde7355e3d2d677f5cb0bd9ec063dd60f10455"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_pptx.validate_deck (cognitive 38): validate_pptx.validate_deck has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (21 pts), error handling 5 (11 pts), loops 3, ternaries 2, boolean chains 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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c6119262b06a11949b23f75afcc373e5d3a78d26f2f8170fe98928bf2d2559"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_claims.audit (cognitive 38): audit_claims.audit has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 3 (5 pts), boolean chains 3, 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/nature-paper-to-patent/scripts/audit_claims.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6ff45d98090e51a09b78300bf86ee54d7ab7af5158ce52fc131dc2ffb2d604"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare_paper.validate_bundle (cognitive 37): prepare_paper.validate_bundle has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 8, ternaries 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/nature-paper-card/scripts/prepare_paper.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"40979f6d110f2feecd8587a4a3cacc6d0f67cf0e6ad75c1775897e33ef471a57"}},{"ruleId":"D2","level":"warning","message":{"text":"md_to_docx._split_table_cells (cognitive 37): md_to_docx._split_table_cells has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 4, loops 2 (4 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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c25bf3e99e21ea11436166ab9990e88b9e76abc1cfbc820c4a304bc46b409a"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_pptx.formula_contract_violations (cognitive 36): validate_pptx.formula_contract_violations has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 10, 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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"632e7f228af64a3bbc5280e4b6e0f85d639a6e4b21f01a78799e827607de397c"}},{"ruleId":"D2","level":"warning","message":{"text":"batch_download.parseArgs (cognitive 36): batch_download.parseArgs has cognitive complexity 36 (threshold 15). Drivers by points: if/else 28 (29 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/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b20a197421ea0c76662bd9ac4ecbbdc40d295155960d14b16c5b7fdfca3c24"}},{"ruleId":"D2","level":"warning","message":{"text":"academic_search.search (cognitive 35): academic_search.search has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 3 (8 pts), boolean chains 5, ternaries 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/nature-academic-search/scripts/academic_search.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"b613e037de1a137a416ae307d59aee291d941c5b4a6b798733231796663cbb37"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_figure.check_rotation_anchor (cognitive 34): validate_figure.check_rotation_anchor has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 5, loops 2, error handling 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-figure/scripts/validate_figure.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"49073ae4421e03be074042be6676f44c5cc742d3a48ed80819603fb0e22c3314"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_figure._python_multipanel_signals (cognitive 34): validate_figure._python_multipanel_signals has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 4 (6 pts), ternaries 1 (4 pts), boolean chains 2, 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/nature-figure/scripts/validate_figure.py"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1875a63f48ef0db7f48956ec5723748396f1413d9ade11a23d89811e94e795e"}},{"ruleId":"D2","level":"warning","message":{"text":"cnipa_epub_parse._parse_overview_card_layout (cognitive 34): cnipa_epub_parse._parse_overview_card_layout has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 7, ternaries 2 (4 pts), loops 3 (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/nature-paper-to-patent/scripts/disclosure/cnipa_epub_parse.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4db5ca27c199daeb51ae78f905dda6edbae83f1bacbe20ad2c77ba0acc1de9c"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_pdf_text.scan_text_runs (cognitive 32): audit_pdf_text.scan_text_runs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (17 pts), error handling 3 (9 pts), boolean chains 5, 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/nature-figure/scripts/audit_pdf_text.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb14fa7ed5d052828b0f92b81095050f643584cf354d2628676c7064b3ccb8c"}},{"ruleId":"D2","level":"warning","message":{"text":"pages.check_assets (cognitive 32): pages.check_assets has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 12, loops 2 (3 pts), ternaries 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/nature-paper-trans/scripts/pages.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96e27d83b3c0a72d010ac757d6f204956f99510170509680b92213d234ac567"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_reader_math.validate_source_map (cognitive 32): validate_reader_math.validate_source_map has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 6, loops 3, 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/nature-reader/scripts/validate_reader_math.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"728356755769fad9a26972b1846a9812f11af5f572539b374520700a9339b784"}},{"ruleId":"D2","level":"warning","message":{"text":"anti-bot.handleVerification (cognitive 32): anti-bot.handleVerification has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 5, error handling 1 (3 pts), 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/nature-downloader/scripts/lib/anti-bot.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3b14330c8b5347586d56811fdd67ab47ba683b68835e89e1e870a633a22f66"}},{"ruleId":"D2","level":"warning","message":{"text":"record_imagegen_result.main (cognitive 30): record_imagegen_result.main has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 6, error handling 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/nature-image2ppt/cli/image2ppt/runtime/record_imagegen_result.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"462d0be5031da290b062749d75db3d4b7635243ef475deea17a2b69fb4f08272"}},{"ruleId":"D2","level":"warning","message":{"text":"split_alpha_components.component_boxes (cognitive 30): split_alpha_components.component_boxes has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (17 pts), loops 4 (10 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/nature-image2ppt/cli/image2ppt/runtime/split_alpha_components.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d644083ca1e9df6f316c98f69d92b62abf4c94221598d6dcb195caf523de871"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_to_md._run (cognitive 30): pptx_to_md._run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 3 (7 pts), loops 2 (3 pts), boolean chains 2, 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/nature-paper-to-patent/scripts/disclosure/pptx_to_md.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c136e0da37c0cba57dd6efc1cc41cb774120bdae59e9ec9788a62267b1b12e6b"}},{"ruleId":"D2","level":"warning","message":{"text":"_input_normalization.collect_notes_from_pptx (cognitive 29): _input_normalization.collect_notes_from_pptx has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 17). 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/nature-image2ppt/cli/image2ppt/runtime/_input_normalization.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b14b8949d422b22e08924abda6acaf3b9cae11ce5bc7e03c5e7fce4df034170"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_figure.check_syntax (cognitive 29): validate_figure.check_syntax has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 pts), 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/nature-figure/scripts/validate_figure.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4750f3fa1ff6640c79c2697e8916d75a20cce9ed487b5ee1b3b1dc4c5ff24c80"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect_arrow_atomicity.inspect_arrow (cognitive 29): inspect_arrow_atomicity.inspect_arrow has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 5 (9 pts), boolean chains 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/nature-image2ppt/scripts/inspect_arrow_atomicity.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"603f6cd13c395a7c36ea19b4eb87de36f73c4e03a410a68c85c694bf3ae01534"}},{"ruleId":"D2","level":"warning","message":{"text":"visual_review_evidence.validate_evidence (cognitive 28): visual_review_evidence.validate_evidence has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (7 pts), boolean chains 1, 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/nature-image2ppt/scripts/visual_review_evidence.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f33fa729c3dc0c886d6a67be48d70166e71d6163bdcb8fba1fa88927fa4693"}},{"ruleId":"D2","level":"warning","message":{"text":"pages.compose_pages (cognitive 28): pages.compose_pages has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 3 (8 pts), boolean chains 4, 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/nature-paper-trans/scripts/pages.py"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"1102d90127ab5720aef0ad2b1984ebe14e512337521b3b3734a91e195d988bec"}},{"ruleId":"D2","level":"warning","message":{"text":"wos-supporting-information.downloadWosSupportingInformation (cognitive 28): wos-supporting-information.downloadWosSupportingInformation has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 3 (5 pts), boolean chains 4, loops 3 (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/nature-downloader/scripts/lib/wos-supporting-information.mjs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3faefcff4c1ec8725e645ecfb8707bcb2d5d54b49d2f8859b7501095f1b9732f"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_figure.literal_legend_labels (cognitive 27): validate_figure.literal_legend_labels has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (6 pts), boolean chains 3, error handling 1 (2 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/nature-figure/scripts/validate_figure.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8cdc0e5b55800f1390e1ba98780d74a3399dc937fcdea793ce38c58b7490f2"}},{"ruleId":"D2","level":"warning","message":{"text":"PubMedSource.lookup_mesh (cognitive 26): PubMedSource.lookup_mesh has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, ternaries 2 (3 pts), error handling 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/nature-academic-search/mcp-server/sources/pubmed.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d468a1270e44ca8347c5ce9d6beffdd7601f29042c096f83f1a217fd2e9907"}},{"ruleId":"D2","level":"warning","message":{"text":"nature_citation.main (cognitive 26): nature_citation.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10, ternaries 5 (7 pts), boolean chains 5, error handling 2, loops 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, 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/nature-citation/scripts/nature_citation.py"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a518725592d336ed649504e231770ea6843454cffcbce1b190febb0a481bb7"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare_paper.evidence_from_pages (cognitive 26): prepare_paper.evidence_from_pages has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (14 pts), ternaries 2 (9 pts), loops 2 (3 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/nature-paper-card/scripts/prepare_paper.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3698a8e544535c634f63bcc77f929748c2f359dd06b671f264883029b1a31c3a"}},{"ruleId":"D2","level":"warning","message":{"text":"academic_search_server._format_basic_citation (cognitive 25): academic_search_server._format_basic_citation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 7 (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/nature-academic-search/mcp-server/academic_search_server.py"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"715b7b86c6924ff4e2a552ad12554734d85da82eb71d5e96694d5f20fd9f3ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"cnipa_epub_parse.parse_search_result_html (cognitive 25): cnipa_epub_parse.parse_search_result_html has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 5 (8 pts), boolean chains 5, 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/nature-paper-to-patent/scripts/disclosure/cnipa_epub_parse.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5909d52cf2b478b64530d77500171b7ea6f38ffea1a85da63de4b279fd6a42ed"}},{"ruleId":"D2","level":"warning","message":{"text":"pages.publish_export (cognitive 25): pages.publish_export has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 7, 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/nature-paper-trans/scripts/pages.py"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"0588d8f0eb642b121da9122de494d42e92f5c13a164fc827188b44e8711c60cb"}},{"ruleId":"D2","level":"warning","message":{"text":"build_pptx_from_manifest.normalize_position_item (cognitive 24): build_pptx_from_manifest.normalize_position_item has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (5 pts), boolean chains 4 (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/nature-image2ppt/cli/image2ppt/runtime/build_pptx_from_manifest.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2660d690a14554fa669434e075d21f9ae3bec14817413d0df48650fb7ecb1ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"converters.arxiv_to_bib (cognitive 24): converters.arxiv_to_bib has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, ternaries 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, 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/nature-academic-search/scripts/converters.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a36fdd5ddea9df0f0624ac9e5c8442aea660c95baa7b8e4bd481fe946a7bea"}},{"ruleId":"D2","level":"warning","message":{"text":"cnipa_epub_parse._parse_search_result_fallback_links (cognitive 24): cnipa_epub_parse._parse_search_result_fallback_links has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 8, loops 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/nature-paper-to-patent/scripts/disclosure/cnipa_epub_parse.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"9591a188be78f5add7281fb529df8cac6b10c3ca28cfcba2c0afe4075403b03d"}},{"ruleId":"D2","level":"warning","message":{"text":"md_to_docx._add_rich_content_to_paragraph (cognitive 24): md_to_docx._add_rich_content_to_paragraph has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 6 (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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be03f31404029849e48b8d1b78626e814cab529caa25f71b140d3c088a8a2a3"}},{"ruleId":"D2","level":"warning","message":{"text":"reference_layout.merge_properties (cognitive 24): reference_layout.merge_properties has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 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/nature-paper2word/scripts/reference_layout.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"43080345500fa42b1e14200764bbe709a58a6d6b6cb3b16fe42cd7085d86db00"}},{"ruleId":"D2","level":"warning","message":{"text":"reference_layout.build_reference (cognitive 24): reference_layout.build_reference has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 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/nature-paper2word/scripts/reference_layout.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab8d84a33862e0bc6864c4ce71b9d1eaeb8d75e90986ff60111c34416adccd8"}},{"ruleId":"D2","level":"warning","message":{"text":"wos-supporting-information.selectSupportingInformationLinks (cognitive 24): wos-supporting-information.selectSupportingInformationLinks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 10, error handling 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/nature-downloader/scripts/lib/wos-supporting-information.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7267e0090ea8b4a6cefbe828af73f9a793c48b1113ea713155cda9941f502df5"}},{"ruleId":"D2","level":"warning","message":{"text":"_input_normalization.normalize_inputs (cognitive 22): _input_normalization.normalize_inputs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (4 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-image2ppt/cli/image2ppt/runtime/_input_normalization.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e63c39cfd1ca38d67f50237993233272db68e6781b24ba73578f8889006e957"}},{"ruleId":"D2","level":"warning","message":{"text":"remove_chroma_key._sample_border_key (cognitive 22): remove_chroma_key._sample_border_key has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (19 pts), if/else 3 (nesting depth added 12). 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/nature-image2ppt/cli/image2ppt/runtime/remove_chroma_key.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dc508780e4f9b7a6da5e6b83e33f5ef920219bb850cd9e17bd6fb8a834d20d"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_pptx.pixel_authoring_violations (cognitive 22): validate_pptx.pixel_authoring_violations has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bbe9102eb325a8010fb7d619f4e38130e683153689bcc7706d256ab4a3e523"}},{"ruleId":"D2","level":"warning","message":{"text":"converters.arxiv_to_ris (cognitive 22): converters.arxiv_to_ris has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, ternaries 4, 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/nature-academic-search/scripts/converters.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"683fb06a912f0b0b9aaef9b74f2cab79a12a756f3d1beaf118ff17e3a26d0bea"}},{"ruleId":"D2","level":"warning","message":{"text":"converters.arxiv_to_enw (cognitive 22): converters.arxiv_to_enw has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, ternaries 4, 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/nature-academic-search/scripts/converters.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba8379f38d94cd0883a0d82cf5e365fb95be93e2fa1a5ceccfb41a207a090b8"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_reader_math.validate_markdown (cognitive 22): validate_reader_math.validate_markdown has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 6 (7 pts), boolean chains 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/nature-reader/scripts/validate_reader_math.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bb46fca070af51b460aa565bdad25535035ab38f37dfa589233992e21e2226"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_env.config (cognitive 21): runtime_env.config has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 2 (3 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, 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/nature-image2ppt/cli/image2ppt/runtime/runtime_env.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fda727a0fa74d70cd54897808b2f2979bb849bd098d3ccce178c4494c18a30"}},{"ruleId":"D2","level":"warning","message":{"text":"schools_loader._load_schools_without_yaml (cognitive 21): schools_loader._load_schools_without_yaml has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 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/nature-downloader/src/schools_loader.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38a66e629c4bf0fdb4a1c41e8ec54d83abdfd7070659187a61ece78e871cad3"}},{"ruleId":"D2","level":"warning","message":{"text":"plot_templates.demo_rows (cognitive 21): plot_templates.demo_rows has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 6 (8 pts) (nesting depth added 9). 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/nature-figure/scripts/plot_templates.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ac3dafaf6b9c0ca8c052e0a917df798043192c3e6524b717c9d4bdc1b94543"}},{"ruleId":"D2","level":"warning","message":{"text":"plot_templates.plot_volcano (cognitive 21): plot_templates.plot_volcano has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 2 (8 pts), if/else 5 (7 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-figure/scripts/plot_templates.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"1627f272a2984f4c9d7737fb755debe9e83fa34c1b3c26f64a5159ced366fbfe"}},{"ruleId":"D2","level":"warning","message":{"text":"mermaid_render.main (cognitive 21): mermaid_render.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, error handling 2 (3 pts), ternaries 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/nature-paper-to-patent/scripts/disclosure/mermaid_render.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89bda82b56d6dcf829bcbdc96944803e7623166b0f48a1f6db4c5e2acc35411"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.draw (cognitive 21): index.html.draw has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 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":"index.html"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"0571c99444a12bb68249836780a39cfb5c2e520e8b72e4381f5ce7d43cfe32fe"}},{"ruleId":"D2","level":"warning","message":{"text":"open-access-provider.downloadOpenAccessArticle (cognitive 21): open-access-provider.downloadOpenAccessArticle has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (5 pts), ternaries 4 (5 pts), error handling 1 (2 pts) (nesting depth added 3). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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/nature-downloader/scripts/lib/open-access-provider.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c2af5e374b4fa93c474d4e87f671ed768898fad2959c43936a713a6e037c61"}},{"ruleId":"D2","level":"warning","message":{"text":"publisher-providers.downloadPublisherRequest (cognitive 21): publisher-providers.downloadPublisherRequest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, ternaries 3 (4 pts), 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/nature-downloader/scripts/lib/publisher-providers.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abd2c157bc94f3a74970eed441696818b8e7e1649edf5e6183962f3c8d72382"}},{"ruleId":"D2","level":"warning","message":{"text":"_page_artifacts.process_asset_sheet (cognitive 20): _page_artifacts.process_asset_sheet has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 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/nature-image2ppt/cli/image2ppt/runtime/_page_artifacts.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4403f826e2bdf874ad5c83d2333a15dbffb01c766d5eb73bb99c5830a182bd1"}},{"ruleId":"D2","level":"warning","message":{"text":"remove_chroma_key._apply_alpha_to_image (cognitive 20): remove_chroma_key._apply_alpha_to_image has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), ternaries 2 (6 pts), loops 2 (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/nature-image2ppt/cli/image2ppt/runtime/remove_chroma_key.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"afadc6df7f41f5586027a3084381b778cd51bfc9ec58f24bb24244e4a4f32855"}},{"ruleId":"D2","level":"warning","message":{"text":"schools_loader.match_school (cognitive 20): schools_loader.match_school has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6 (8 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/nature-downloader/src/schools_loader.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8051d3b8fae9e4a70c12ee1b50fc232b6454321e9aca13bb6324907a23ed8bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"postprocess_manifest_arrows.postprocess_pptx (cognitive 20): postprocess_manifest_arrows.postprocess_pptx has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, error handling 1, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-image2ppt/scripts/postprocess_manifest_arrows.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0429e60c1802c138ea701b682f5783ac5ac69064a260e78f005797bc08e1bf"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_paper_card.invalid_page_pointers (cognitive 20): audit_paper_card.invalid_page_pointers has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 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/nature-paper-card/scripts/audit_paper_card.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d9bb9c00e3e4717bd2d89c20f84c91a3b23088dd0cf87eb4324e22bc1f336d"}},{"ruleId":"D2","level":"warning","message":{"text":"prepare_paper.page_locator (cognitive 20): prepare_paper.page_locator has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, ternaries 2 (4 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/nature-paper-card/scripts/prepare_paper.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb0e9b619a7d6c10cee4ff0e802ce84ccc63f3b77c25cce39fa42d55ad255f7"}},{"ruleId":"D2","level":"warning","message":{"text":"build_patent_package.validate (cognitive 20): build_patent_package.validate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (17 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/nature-paper-to-patent/scripts/build_patent_package.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"50170f8157465396ccdef4ecc31cf9f8e05906b741257d568d53b724d11745f0"}},{"ruleId":"D2","level":"warning","message":{"text":"render_image2ppt_qa.main (cognitive 19): render_image2ppt_qa.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 6, boolean chains 5, 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/nature-image2ppt/scripts/render_image2ppt_qa.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3237ffa43c141c7e42fdab6190d4bec1084b82b747bb7cf42158ffc929e968"}},{"ruleId":"D2","level":"warning","message":{"text":"pages.overview (cognitive 19): pages.overview has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-paper-trans/scripts/pages.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a09d57771b2de3aaa8bfbb40761a384d5c9b0926cf2db2f4bf424aff3675fe"}},{"ruleId":"D2","level":"warning","message":{"text":"configure_image_backend.main (cognitive 18): configure_image_backend.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 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/nature-image2ppt/cli/image2ppt/runtime/configure_image_backend.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8ee26b8b47556971d1eff838a5aa1c30bd04a6fa759a9a44622699cda247df"}},{"ruleId":"D2","level":"warning","message":{"text":"main.cmd_next (cognitive 18): main.cmd_next has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 5 (6 pts), boolean chains 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/nature-image2ppt/cli/image2ppt/runtime/main.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d66f44c1e6472b574053853f72ee46df837992a97c85541f1c6dda4d37aa73"}},{"ruleId":"D2","level":"warning","message":{"text":"main.cmd_formula_render_latex (cognitive 18): main.cmd_formula_render_latex has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), error handling 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/nature-image2ppt/cli/image2ppt/runtime/main.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09a8088747652caaa4eacba573abf677122f40ad2a0c2f876aa4f8f1b070bfc"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_env.doctor (cognitive 18): runtime_env.doctor has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 11 (13 pts), boolean chains 2, if/else 2, 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/nature-image2ppt/cli/image2ppt/runtime/runtime_env.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b454bb3e8297b807172b5e3d9f1dd97680251ec532ca07a24425f8a946e9f1c"}},{"ruleId":"D2","level":"warning","message":{"text":"academic_search.resolve_author (cognitive 18): academic_search.resolve_author has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 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/nature-academic-search/scripts/academic_search.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef347154e7733ddf898bffd52a4d30fee51d7da91f7a8f5b406abcab4aa6a307"}},{"ruleId":"D2","level":"warning","message":{"text":"nature_citation.pubmed_authors (cognitive 18): nature_citation.pubmed_authors has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, 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/nature-citation/scripts/nature_citation.py"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1438d01785407c1219ee244cb364af8866b8a4e606a7926f67ef67184b589a1"}},{"ruleId":"D2","level":"warning","message":{"text":"nature_citation.write_html (cognitive 18): nature_citation.write_html has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 2 (8 pts), loops 2 (4 pts), boolean chains 3, if/else 2 (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/nature-citation/scripts/nature_citation.py"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"13939a7a49a1e634ac6d25edb71f250417b51f764d5734b0c9a47e64df713055"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_svg_schematic.transform_matrix (cognitive 18): audit_svg_schematic.transform_matrix has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 2 (6 pts), boolean chains 5, 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/nature-figure/scripts/audit_svg_schematic.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1822a53c6e29030114551e4ee8c0338f864796c9e058b7b25f7f0ee40f8044"}},{"ruleId":"D2","level":"warning","message":{"text":"md_to_docx._add_inline_to_paragraph (cognitive 18): md_to_docx._add_inline_to_paragraph has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 5 (7 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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca85923c646daae35ee28c7a6c12b239eb8030a42daf77115d64166ccbec55c"}},{"ruleId":"D2","level":"warning","message":{"text":"render_patent_docx.add_review_appendix (cognitive 18): render_patent_docx.add_review_appendix has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (13 pts), if/else 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-paper-to-patent/scripts/render_patent_docx.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddbdba31fae048bd0ce368675737f39e9f3665fd9865f10919a190518a92ecd"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_pptx.flatten_required_text (cognitive 17): validate_pptx.flatten_required_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 1 (2 pts), 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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9c6c89e2b2c2e8cf76025c461697874e2bab8ec1c23ff2073f0e5e826341fc"}},{"ruleId":"D2","level":"warning","message":{"text":"nature_citation.candidate_from_pubmed (cognitive 17): nature_citation.candidate_from_pubmed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 2 (3 pts), 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/nature-citation/scripts/nature_citation.py"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"80865ff3b0dc451cd554ae8e42ca93fb74dff0015b93a044ee94c6f32f89447a"}},{"ruleId":"D2","level":"warning","message":{"text":"nature_citation.fetch_pubmed_candidates (cognitive 17): nature_citation.fetch_pubmed_candidates has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (5 pts), error handling 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/nature-citation/scripts/nature_citation.py"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"448f1bf638b532cd99b7b0b0b648a20ba91591388bcca364b7e1c24337941926"}},{"ruleId":"D2","level":"warning","message":{"text":"postprocess_manifest_arrows.transform_slide (cognitive 17): postprocess_manifest_arrows.transform_slide has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 2 (4 pts), error handling 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/nature-image2ppt/scripts/postprocess_manifest_arrows.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"578f56916e37f1696751bbb0076c401824afbd248bfa691d35048bba053caa15"}},{"ruleId":"D2","level":"warning","message":{"text":"init_patent_project.main (cognitive 17): init_patent_project.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-paper-to-patent/scripts/init_patent_project.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d745327daa1de3eb8825e5521810694d481df27b57d6732b174121640f8ea4"}},{"ruleId":"D2","level":"warning","message":{"text":"render_patent_docx.add_specification (cognitive 17): render_patent_docx.add_specification has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 4 (7 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-paper-to-patent/scripts/render_patent_docx.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3737efc46fc99ee4858d6d2ed3826634b0379472e32411ba69db3dbc4c759171"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_reader_math.fenced_ranges (cognitive 17): validate_reader_math.fenced_ranges has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 1 (3 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/nature-reader/scripts/validate_reader_math.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0a63b9bab94bf71453b26ac69f1136408e885b7e2c5badec68ceebd4180db7"}},{"ruleId":"D2","level":"warning","message":{"text":"batch_download.wosRecordUrls (cognitive 17): batch_download.wosRecordUrls has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, 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/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec732272793dc1e3c9e4a09839e575691ea0c5a9f48ed9fe648d8b5381bf46f3"}},{"ruleId":"D2","level":"warning","message":{"text":"build_pptx_from_manifest.shape_xml (cognitive 16): build_pptx_from_manifest.shape_xml has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 3 (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/nature-image2ppt/cli/image2ppt/runtime/build_pptx_from_manifest.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ed564649f9be58aca5b5e22049dbcb8ac19e24230545ca23a82f6633247c92"}},{"ruleId":"D2","level":"warning","message":{"text":"deck_text_hints.main (cognitive 16): deck_text_hints.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 2 (4 pts), boolean chains 2, 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/nature-image2ppt/cli/image2ppt/runtime/deck_text_hints.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5474bad1fed0814e7a9bc7e1ee8004c0e92e17e1ad1c7fbb8bf89a041981b444"}},{"ruleId":"D2","level":"warning","message":{"text":"image_gen._post_codex_image_json (cognitive 16): image_gen._post_codex_image_json has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 3 (5 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/nature-image2ppt/cli/image2ppt/runtime/image_gen.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"1097f77364c5e0ed9a6a1a1c0749cf79db050faecc128b6163053770d3ceb963"}},{"ruleId":"D2","level":"warning","message":{"text":"remove_chroma_key._validate_args (cognitive 16): remove_chroma_key._validate_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. 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/nature-image2ppt/cli/image2ppt/runtime/remove_chroma_key.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6012cadf1cf35ef451e2fa53506a7f045098ff410c01fcba310a046ff953f1"}},{"ruleId":"D2","level":"warning","message":{"text":"ArxivSource._parse_entry (cognitive 16): ArxivSource._parse_entry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, 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/nature-academic-search/mcp-server/sources/arxiv.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa556813221ecc5457070f448bdd6f20f0485cc5d9509631aa08b375eea3180"}},{"ruleId":"D2","level":"warning","message":{"text":"wizard.infer_access_from_url (cognitive 16): wizard.infer_access_from_url has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (6 pts), ternaries 3 (4 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/src/wizard.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75f077f2bb61f2c5543931ec156dae5c51110aabd3927eaaeb3c67d447a346e"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect_arrow_atomicity.inspect (cognitive 16): inspect_arrow_atomicity.inspect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 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/nature-image2ppt/scripts/inspect_arrow_atomicity.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c868e94cc413893ab609836fe3d0c8097f25bfbdcaeb51f2ce80d660acf4b4f0"}},{"ruleId":"D2","level":"warning","message":{"text":"iteration_dialog_log.main (cognitive 16): iteration_dialog_log.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, 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/nature-paper-to-patent/scripts/disclosure/iteration_dialog_log.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"730def5947e94276f54c8a4839f4fbfc5dc036ac29729f8f9683014b0821171d"}},{"ruleId":"D2","level":"warning","message":{"text":"md_to_docx._embed_from_image_ref (cognitive 16): md_to_docx._embed_from_image_ref has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, 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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a641cd08ac6290470bae508e8f3a58daabcfa3ecf6b84e7c2ebd26705ae322"}},{"ruleId":"D2","level":"warning","message":{"text":"anti-bot.simulateDrag (cognitive 16): anti-bot.simulateDrag has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (6 pts), boolean chains 4, if/else 4, loops 2 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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/nature-downloader/scripts/lib/anti-bot.mjs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebd21935ed52d5e5af73ab4643464d35f3c8ed2de6c16256391e75c49f99d3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/nature_citation.py: FileTooLong \u2014 1816 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1316 over it, 3.63\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/nature-citation/scripts/nature_citation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d61a98715f29e9c55face562437e4da49dbbe8e7dccd6dde1722cb502f4cae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/build_pptx_from_manifest.py: FileTooLong \u2014 978 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 478 over it, 1.96\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/nature-image2ppt/cli/image2ppt/runtime/build_pptx_from_manifest.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34d471017041e253b55292cd4e8c99cb0e0a7fb4ceaf8689fab61d349c7405a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: disclosure/md_to_docx.py: FileTooLong \u2014 824 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 324 over it, 1.65\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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5113a5e34e4dc9096847e7d495b9ebaf5703ceb5e46e7e9a3359d19cef40b0b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/validate_pptx.py: FileTooLong \u2014 802 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 302 over it, 1.60\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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37337dd7799194d620cbbd9cbf94ed4595d461b92af7c8d6575f34aca6ab8b39"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: index.html: FileTooLong \u2014 801 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 301 over it, 1.60\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":"index.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94f1a680b314a5affe883c5f3a9a2ffe77ec3b8fa72d150f88cb9f4be9902e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/pages.py: FileTooLong \u2014 780 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 280 over it, 1.56\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/nature-paper-trans/scripts/pages.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ada6ed992c43e8f51baf63b06f2f76f3d77b087580ea4db586d4727d97e6faa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/audit_panel_alignment.py: FileTooLong \u2014 762 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 262 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/nature-figure/scripts/audit_panel_alignment.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca485abe053036c00026dc53a694be9eb5f7981348ee65e3a9d72cd32e1e7ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/batch_download.mjs: FileTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 145 over it, 1.29\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/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29e9f33cac43efb948b6036d928fd03f2bd730b3c493da00427481d45957157"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/validate_figure.py: FileTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 113 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-figure/scripts/validate_figure.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4db33d91b3752dc5c416d4510370285da7cb545c8bf31f9b43c94c6ec00789"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: anti-bot.trySliderCaptcha: FunctionTooLong \u2014 trySliderCaptcha runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/anti-bot.mjs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"79526dcc711887ff0821af2633ea71cb91e9413eda1d492553e740618dc7c4eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/audit_figure_collisions.py: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 104 over it, 1.21\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/nature-figure/scripts/audit_figure_collisions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60774eaa1acd4a99881af35938e46e4ca76a02dd66c2e5e9151746d1a66eb539"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: batch_download.main: FunctionTooLong \u2014 main runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"3769bb07af635aa4db449c5a5ba1ce984b7dce8e0e042a5a6d94977f47badfbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: batch_download.downloadDoi: FunctionTooLong \u2014 downloadDoi runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6539c72a91762a56456000ed67c31dc99461eb20b336e0393e57a16f18f252"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: batch_download.routeDoiDownload: FunctionTooLong \u2014 routeDoiDownload runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"61823c8a48ee76b86a26ede2f0d5032c04b29987c2e1f87ffee479582c7c9990"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/plot_templates.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/nature-figure/scripts/plot_templates.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52f7cd24cd2c7b77886b203c99fea25b33b45a3f21ac3b0fd4718457347288d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_idea.py:16-50 | skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py:111-202 | skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py:205-257 | skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py:329-381 \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/nature-figure/assets/figures4papers/figure_Dispersion/plot_idea.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1576f3cb34f8c085ec82390bc452783e81add5cacae469d7dd81b304d31aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (172 corresponding lines): skills/nature-image2ppt/scripts/run_final_image2ppt_qa.py:53-224 | skills/nature-image2ppt/scripts/run_image2ppt_qa.py:40-233 \u2014 These two members are one piece of code written twice and then edited apart: 172 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/nature-image2ppt/scripts/run_final_image2ppt_qa.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb66fcc260af6468ff3e3d7aebae6333e2a20184ddd7dd205f0b3b1e5e5f84d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): skills/nature-academic-search/scripts/converters.py:309-358 | skills/nature-academic-search/scripts/converters.py:517-562 \u2014 These two members are one piece of code written twice and then edited apart: 46 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/nature-academic-search/scripts/converters.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f000273e635157af9d7617f04bede7b303f050a368e582f6813b26a76aac35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): skills/nature-shared/scripts/check_consistency.py:121-155 | skills/nature-shared/scripts/check_consistency.py:171-201 \u2014 These two members are one piece of code written twice and then edited apart: 31 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/nature-shared/scripts/check_consistency.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c9deb937fe9427f00c78a3b8bd13a607347243a1b1bd813867ca02fbff0b0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): skills/nature-downloader/src/validators.py:59-101 | skills/nature-downloader/src/validators.py:105-139 \u2014 These two members are one piece of code written twice and then edited apart: 35 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/nature-downloader/src/validators.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37143484d4cd1f96bb146c90c11994e3adbbdd0c6076fc7979f3347c02ee998"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): skills/nature-academic-search/mcp-server/academic_search_server.py:456-498 | skills/nature-academic-search/mcp-server/academic_search_server.py:503-553 \u2014 These two members are one piece of code written twice and then edited apart: 43 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/nature-academic-search/mcp-server/academic_search_server.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af9b858f8db7c1d0bdefa53b6364867ad471d55666e5f6fcdd5729b0dcd9219"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): skills/nature-figure/scripts/generate_openrouter_schematic.py:118-128 | skills/nature-image2ppt/cli/image2ppt/runtime/paddle_text_hints.py:52-63 \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/nature-figure/scripts/generate_openrouter_schematic.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33e20ff59d0fa91206a4640ea2d2194b0583cc028959ae997f4c0e39b8de967"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): skills/nature-paper-to-patent/scripts/disclosure/md_to_docx.py:454-474 | skills/nature-paper-to-patent/scripts/disclosure/md_to_docx.py:496-519 \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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"54287aa1d50de2488fa4ed10f7be3bbdc278386896a6b75b28f1af612bd36530"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): skills/nature-figure/scripts/audit_pdf_text.py:40-50 | skills/nature-figure/scripts/audit_svg_schematic.py:71-81 \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/nature-figure/scripts/audit_pdf_text.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4e5dde669efa8be107bb489d5e3a15536ba0928cc3a95e7378a1f6f5795c9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): skills/nature-downloader/scripts/extract_pdf_text.py:20-29 | skills/nature-downloader/scripts/extract_pdf_text.py:33-42 \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/nature-downloader/scripts/extract_pdf_text.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce475b6bd07cf327cc060a70b3a413ff9feb3dae2b778b847e925b50690af14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): skills/nature-image2ppt/cli/image2ppt/runtime/build_pptx_from_manifest.py:105-117 | skills/nature-image2ppt/cli/image2ppt/runtime/prepare_deck_run.py:49-63 \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/nature-image2ppt/cli/image2ppt/runtime/build_pptx_from_manifest.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"706422c5b34e0858ea76779328da19b65a847fc56998e2ff49ab697ef2b8103d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): skills/nature-image2ppt/cli/image2ppt/runtime/image_gen.py:632-642 | skills/nature-image2ppt/cli/image2ppt/runtime/image_gen.py:727-740 \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/nature-image2ppt/cli/image2ppt/runtime/image_gen.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1b77950d01c6e4d358ea4775412363c4ac4e7f0008dc4ae10b84e2ad2f4812"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 9\u002B corresponding lines): skills/nature-academic-search/mcp-server/academic_search_server.py:221-236 | skills/nature-academic-search/mcp-server/academic_search_server.py:245-259 | skills/nature-academic-search/mcp-server/academic_search_server.py:308-316 | skills/nature-academic-search/mcp-server/academic_search_server.py:334-342 | skills/nature-academic-search/mcp-server/academic_search_server.py:357-386 | skills/nature-academic-search/mcp-server/academic_search_server.py:395-403 | skills/nature-academic-search/mcp-server/academic_search_server.py:425-433 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 9 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-academic-search/mcp-server/academic_search_server.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53c3f93368c38a47370170ff9ab8bdc0d34021c899b0b9155daac0b5d268d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): skills/nature-academic-search/mcp-server/academic_search_server.py:295-303 | skills/nature-academic-search/mcp-server/academic_search_server.py:321-329 | skills/nature-academic-search/mcp-server/academic_search_server.py:408-416 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 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/nature-academic-search/mcp-server/academic_search_server.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b734331f30968bf35943ce0011ce7894eb7b7b8ff3311c2bc4e73ba31782b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): skills/nature-proposal-writer/scripts/build_proposal_docx.py:73-78 | skills/nature-proposal-writer/scripts/build_proposal_docx.py:82-87 \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/nature-proposal-writer/scripts/build_proposal_docx.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7bad9cde3992334fcdce7eaab01c2271150352c7ac777f18342d56184db435"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): skills/nature-image2ppt/cli/image2ppt/runtime/deck_run_state.py:127-136 | skills/nature-image2ppt/scripts/runtime_paths.py:18-29 \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/nature-image2ppt/cli/image2ppt/runtime/deck_run_state.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4fa6e3e61a75a6dd58450149ece6834a44cd73578da6a90d8dc8865702df72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): skills/nature-image2ppt/cli/image2ppt/runtime/_input_normalization.py:32-37 | skills/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py:607-616 | skills/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py:620-626 \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/nature-image2ppt/cli/image2ppt/runtime/_input_normalization.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73767ef56f1ac597253d50e1cf4ba7396c522c98f05d6749d53fb45b4671214"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): skills/nature-paper-to-patent/scripts/disclosure/md_to_docx.py:478-485 | skills/nature-paper-to-patent/scripts/disclosure/md_to_docx.py:629-634 \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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"da27ac1c29a9b5be460c65e6423265ff51265657ed97a51ad40b5730420ebdf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): skills/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py:764-770 | skills/nature-image2ppt/cli/image2ppt/runtime/_input_normalization.py:111-115 \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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"67240cdce6bede2ed80432e32101fac0171b83e9ed2607b3f81e7c580ecaa122"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): skills/nature-image2ppt/cli/image2ppt/runtime/deck_run_state.py:44-49 | skills/nature-image2ppt/scripts/build_page_worker_prompt.py:25-30 \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/nature-image2ppt/cli/image2ppt/runtime/deck_run_state.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f3968f28a7f526aa556ac60c87d25d8a13a8b064bd2892db20dbc355b7ad80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): skills/nature-image2ppt/cli/image2ppt/runtime/_page_artifacts.py:15-16 | skills/nature-image2ppt/cli/image2ppt/runtime/finalize_deck_run.py:15-16 \u2014 These two members are one piece of code written twice and then edited apart: 2 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/nature-image2ppt/cli/image2ppt/runtime/_page_artifacts.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"343598fb1a945254bc58c94ee9e25320c6421eb5d500ee9be9cd6e1e883f16f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 2\u002B corresponding lines): skills/nature-image2ppt/cli/image2ppt/runtime/deck_run_state.py:26-28 | skills/nature-image2ppt/scripts/inspect_region_decomposition.py:48-49 | skills/nature-image2ppt/scripts/postprocess_manifest_arrows.py:79-80 | skills/nature-image2ppt/scripts/render_image2ppt_qa.py:23-24 | skills/nature-image2ppt/scripts/run_image2ppt_qa.py:25-26 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 2 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/nature-image2ppt/cli/image2ppt/runtime/deck_run_state.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfae5c2d27432269ecd8d6ae159a33325322bcf29231427b54d8530e7b8cfcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): skills/nature-academic-search/scripts/converters.py:13-17 | skills/nature-citation/scripts/nature_citation.py:573-575 \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/nature-academic-search/scripts/converters.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff8e628e9719739883bfc98d0ef1a9bb4f08da168a8532124134a4d41f5d285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201340 lines \u00D7 2): skills/nature-image2ppt/scripts/run_final_image2ppt_qa.py:186-222 | skills/nature-image2ppt/scripts/run_image2ppt_qa.py:169-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/nature-image2ppt/scripts/run_final_image2ppt_qa.py:186\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/nature-image2ppt/scripts/run_final_image2ppt_qa.py:185\u0060 calls \u0060zip\u0060 and \u0060skills/nature-image2ppt/scripts/run_image2ppt_qa.py:168\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/nature-image2ppt/scripts/run_final_image2ppt_qa.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d164d37b141b152371312bef2f73ba392ce7ef131a12a6881f3c5e115c93ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): skills/nature-paper-to-patent/scripts/disclosure/md_to_docx.py:768-797 | skills/nature-paper-to-patent/scripts/disclosure/md_to_docx.py:799-828 \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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa9d08370818f4711d8c11903aeb1a2b25f589d263a34e2acefa60a237a4712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): skills/nature-academic-search/mcp-server/academic_search_server.py:456-483 | skills/nature-academic-search/mcp-server/academic_search_server.py:503-533 \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/nature-academic-search/mcp-server/academic_search_server.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09534f3e1427d8e33e77bc9fdd2edb919f73da91227a2c372a3ae704c5085c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): skills/nature-academic-search/mcp-server/sources/sciencedirect.py:29-53 | skills/nature-academic-search/mcp-server/sources/sciencedirect.py:62-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/nature-academic-search/mcp-server/sources/sciencedirect.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4688641e73e0bd843fec32459b3dc191be9beae3174a4698b4f274ba3742b0d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): skills/nature-downloader/src/validators.py:59-83 | skills/nature-downloader/src/validators.py:105-129 \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/nature-downloader/src/validators.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70b32cd4d7563869d256544cc23823cf65b783c2f99f31af686beb6c8824e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): skills/nature-shared/scripts/check_consistency.py:133-155 | skills/nature-shared/scripts/check_consistency.py:180-201 \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/nature-shared/scripts/check_consistency.py:133\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/nature-shared/scripts/check_consistency.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e87bbb51102a2881e83ae1b7f928573a7e142cf7dff250fe729403ac89b015a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): skills/nature-academic-search/mcp-server/sources/scopus.py:118-136 | skills/nature-academic-search/mcp-server/sources/scopus.py:179-197 \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/nature-academic-search/mcp-server/sources/scopus.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64ee06ed3e7fda215e186879eb0bb580d1f6a0948ac454429bb1803f944eddc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): skills/nature-academic-search/scripts/converters.py:336-353 | skills/nature-academic-search/scripts/converters.py:542-559 \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/nature-academic-search/scripts/converters.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f971d94951633e4fe3b2a69f7ce62ea449f779835dd117f8b3f0d167a31686b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): skills/nature-image2ppt/scripts/run_final_image2ppt_qa.py:97-113 | skills/nature-image2ppt/scripts/run_image2ppt_qa.py:84-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 both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-image2ppt/scripts/run_final_image2ppt_qa.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c4f0b81e480d446550c2ba21ac71264309d740a99225fecf3bfa6ce7042b8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/nature-paper-to-patent/scripts/disclosure/md_to_docx.py:457-472 | skills/nature-paper-to-patent/scripts/disclosure/md_to_docx.py:503-518 \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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"670c65e6caadd9c0f020e2304f29e6857be84c4f2e5d90299592dbc2cd948d44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): skills/nature-image2ppt/cli/image2ppt/runtime/_input_normalization.py:94-106 | skills/nature-image2ppt/scripts/render_image2ppt_qa.py:179-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-image2ppt/cli/image2ppt/runtime/_input_normalization.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa607e429a296d2fa033532e71f3931915b817b38764c5d408e7b5dd2be3c64a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): skills/nature-paper-to-patent/scripts/disclosure/math_render.py:242-254 | skills/nature-paper-to-patent/scripts/disclosure/math_render.py:259-271 \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/nature-paper-to-patent/scripts/disclosure/math_render.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a599830629d085e063811af6115c7fa8b8ef715fcee25f27d7983d2d7b4d62e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 4): skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_idea.py:16-32 | skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py:113-126 | skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py:205-221 | skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py:329-345 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. 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/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py:128\u0060 calls \u0060array\u0060 and \u0060skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_idea.py:32\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/nature-figure/assets/figures4papers/figure_Dispersion/plot_idea.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2186bd2c8ae82d47c12d96411ba42b2263dd3e87142980f89d4bf316877cfba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/nature-image2ppt/cli/image2ppt/runtime/build_pptx_from_manifest.py:105-116 | skills/nature-image2ppt/cli/image2ppt/runtime/prepare_deck_run.py:51-62 \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/nature-image2ppt/cli/image2ppt/runtime/build_pptx_from_manifest.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ee4e9f3f1ceccbc3dd42c4c5f2ee6881d9b77e32bffbe4f97b68d37c714989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/nature-image2ppt/cli/image2ppt/runtime/remove_chroma_key.py:111-122 | skills/nature-image2ppt/cli/image2ppt/runtime/remove_chroma_key.py:140-151 \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/nature-image2ppt/cli/image2ppt/runtime/remove_chroma_key.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8ec33893083c5d97699ff788dfbfbe7c39866cec33d2813936ded1e1ac6349"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/nature-response/scripts/check_package_consistency.py:93-104 | skills/nature-response/scripts/check_package_consistency.py:109-120 \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/nature-response/scripts/check_package_consistency.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aff015baffcca8efe2975e2feb76b272237a42b4295dc1e93c5407bb1112cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/nature-academic-search/scripts/converters.py:230-240 | skills/nature-academic-search/scripts/converters.py:499-509 \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/nature-academic-search/scripts/converters.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7364e039367a037e149988c521c5ffd1e29d0acd800ea1e27da2c3a0f1378f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/nature-paper-to-patent/scripts/disclosure/docx_to_md.py:107-117 | skills/nature-paper-to-patent/scripts/disclosure/pptx_to_md.py:139-149 \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/nature-paper-to-patent/scripts/disclosure/docx_to_md.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00d533644f7280a87898a6041c193503f7e8c461d91be37b51ac32b653f3b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py:220-239 | skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py:344-363 \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/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py:220\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/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"441605b095b39c48f4a0d61569b506a746ff56fef5cae301aac36c712b5d66b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): skills/nature-paper-to-patent/scripts/disclosure/docx_to_md.py:53-62 | skills/nature-paper-to-patent/scripts/disclosure/pptx_to_md.py:73-82 \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/nature-paper-to-patent/scripts/disclosure/docx_to_md.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d7cc56631bc5bfcd4892f933e281bbe4a167ca52e60a9c971a83406a053519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/nature-academic-search/scripts/converters.py:193-201 | skills/nature-academic-search/scripts/converters.py:473-481 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/nature-academic-search/scripts/converters.py:469\u0060 calls \u0060get\u0060 and \u0060skills/nature-academic-search/scripts/converters.py:191\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/nature-academic-search/scripts/converters.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a52aabfdf8c1c5abbf53ed3a681254c1f5ca2e49bfa66a354938606357ad0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/nature-image2ppt/cli/image2ppt/runtime/main.py:618-626 | skills/nature-image2ppt/cli/image2ppt/runtime/main.py:632-640 \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/nature-image2ppt/cli/image2ppt/runtime/main.py"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"271428accd99837072565208450f3037021115307cba139520c09cce1bb1bb12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): skills/nature-image2ppt/cli/image2ppt/runtime/main.py:618-625 | skills/nature-image2ppt/cli/image2ppt/runtime/main.py:632-639 | skills/nature-image2ppt/cli/image2ppt/runtime/main.py:644-651 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/nature-image2ppt/cli/image2ppt/runtime/main.py:626\u0060 calls \u0060add_argument\u0060 and \u0060skills/nature-image2ppt/cli/image2ppt/runtime/main.py:652\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/nature-image2ppt/cli/image2ppt/runtime/main.py"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda398a73adcdbe0045c82272653bb9814bc6e5b03637f03669a8998d5962cbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20138 lines \u00D7 4): skills/nature-figure/scripts/audit_pdf_text.py:43-50 | skills/nature-figure/scripts/audit_svg_schematic.py:74-81 | skills/nature-paper2ppt/scripts/audit_pptx_quality.py:140-142 | skills/nature-paper2ppt/scripts/audit_pptx_quality.py:143-143 \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. 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/nature-figure/scripts/audit_pdf_text.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"39baa2a9eac25d394adfc0c493f80df87c02ce4140009d9d780a671b89bf0fcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): skills/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py:754-760 | skills/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py:1013-1020 \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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py:754\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/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea6cafe6c7f8d321648d57f87439fb462eb641d17ee21516beeedc3950a7a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/nature-image2ppt/scripts/inspect_arrow_atomicity.py:110-117 | skills/nature-image2ppt/scripts/postprocess_manifest_arrows.py:321-328 \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/nature-image2ppt/scripts/inspect_arrow_atomicity.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b70beea92e3b84a53f22e7d5a50de710c29a4f93559c94d86ef397e60cb483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): skills/nature-image2ppt/scripts/inspect_arrow_atomicity.py:155-161 | skills/nature-image2ppt/scripts/inspect_region_decomposition.py:338-345 \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/nature-image2ppt/scripts/inspect_arrow_atomicity.py:154\u0060 calls \u0060add_argument\u0060 and \u0060skills/nature-image2ppt/scripts/inspect_region_decomposition.py:337\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/nature-image2ppt/scripts/inspect_arrow_atomicity.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"648ad4f8edd4d98debd5418dcc43aeccbff3e6c078a01b5dc6ffcc1190afab12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/nature-paper-to-patent/scripts/render_flowchart_svg.py:205-212 | skills/nature-paper-to-patent/scripts/render_flowchart_svg.py:279-286 \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/nature-paper-to-patent/scripts/render_flowchart_svg.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"56581621df89d091161139c276255c35a45222103506ca5c21475068d4997a53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): skills/nature-figure/assets/figures4papers/figure_CellSpliceNet/plot_ablation.py:20-26 | skills/nature-figure/assets/figures4papers/figure_CellSpliceNet/plot_comparison.py:54-60 | skills/nature-figure/assets/figures4papers/figure_CellSpliceNet/plot_comparison_cross_species.py:87-93 \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/nature-figure/assets/figures4papers/figure_CellSpliceNet/plot_ablation.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1d19287a70a752b980e61270ac4a5b3deccfeb0130e411144d0d71bcebe486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/nature-academic-search/scripts/converters.py:211-217 | skills/nature-academic-search/scripts/converters.py:495-501 \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/nature-academic-search/scripts/converters.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c7d1450fc944d32d427755850e092460361465bcfdec8544d5aa676b572553"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/nature-academic-search/scripts/converters.py:321-328 | skills/nature-academic-search/scripts/converters.py:533-540 \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/nature-academic-search/scripts/converters.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee962b8b87d8bf98519210120b947a0d30344538552bf761bf9452dd80a0f434"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): skills/nature-downloader/src/wizard.py:127-140 | skills/nature-downloader/src/wizard.py:520-533 \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/nature-downloader/src/wizard.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7168e4218a381c9fb8037ad2dcaf20963a434fb06ce9b14f037977bd6888ec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/nature-figure/scripts/audit_panel_alignment.py:174-180 | skills/nature-figure/scripts/audit_panel_alignment.py:232-238 \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/nature-figure/scripts/audit_panel_alignment.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29bb74729f33e18ca695d55965760530230d72a17e8275dcbe93b9f36f105ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/nature-image2ppt/cli/image2ppt/runtime/paddle_text_hints.py:192-198 | skills/nature-image2ppt/cli/image2ppt/runtime/text_hints.py:285-291 \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/nature-image2ppt/cli/image2ppt/runtime/paddle_text_hints.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1302688b7bc8e010a5a7237ba63807b6217484bf6f2ef6e33a7c44920d85832"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/nature-paper-to-patent/scripts/disclosure/md_to_docx.py:382-388 | skills/nature-paper-to-patent/scripts/disclosure/md_to_docx.py:425-431 \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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"001126622f9935f20a546010ef2d3f629ee01eaef0654064b2a2a2c6cfe2461f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/nature-academic-search/scripts/converters.py:99-104 | skills/nature-academic-search/scripts/converters.py:225-230 \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/nature-academic-search/scripts/converters.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7583719cb2d34286b87e3618965e95194fd74cbe8820005902ff3c9d6345f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/nature-academic-search/scripts/format-converter.py:108-113 | skills/nature-academic-search/scripts/format-converter.py:207-212 \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/nature-academic-search/scripts/format-converter.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f836d4be32c0f6e787b7a42d7ee93e112cc5dcc900e13bd51ee301f9fc97d11e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 3): skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_idea.py:36-37 | skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py:222-227 | skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py:346-351 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_idea.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04dc03a653eb2f07995233fcfe3aadbb0023d0c840297d5272a93c22026241e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/nature-figure/scripts/generate_openrouter_schematic.py:122-127 | skills/nature-image2ppt/cli/image2ppt/runtime/paddle_text_hints.py:57-62 \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/nature-figure/scripts/generate_openrouter_schematic.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb79cfb99a217697e3be1bd804dd5dd2bc275a961b375a8e6d2bdaf62014466e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/nature-figure/scripts/plot_templates.py:426-431 | skills/nature-figure/scripts/plot_templates.py:469-474 \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/nature-figure/scripts/plot_templates.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa1d8022159a6132128c3249d6faa4bc11b700a67bfe64e30407d967cf7f143"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/nature-image2ppt/cli/image2ppt/runtime/_input_normalization.py:138-146 | skills/nature-image2ppt/cli/image2ppt/runtime/_input_normalization.py:180-188 \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/nature-image2ppt/cli/image2ppt/runtime/_input_normalization.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c2780f2c4a7fd95a9be2259cc5420717f8e259a7fe8114fb1a26965c7bb8dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/nature-paper-to-patent/scripts/render_patent_docx.py:123-130 | skills/nature-paper-to-patent/scripts/render_patent_docx.py:152-159 \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/nature-paper-to-patent/scripts/render_patent_docx.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"64881150bb1eea86eb50b8cd9f6393d378a827f3d4550179d89e5c7787ea0049"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): skills/nature-paper-to-patent/scripts/disclosure/math_render.py:218-222 | skills/nature-paper-to-patent/scripts/disclosure/math_render.py:243-247 | skills/nature-paper-to-patent/scripts/disclosure/math_render.py:260-264 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-paper-to-patent/scripts/disclosure/math_render.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9a633050990f8d368d2627b0d4de92dd5b9b5ccca5ce4848e3ca80dd35eeb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/nature-figure/assets/figures4papers/figure_VIGIL/plot_ablation.py:89-94 | skills/nature-figure/assets/figures4papers/figure_VIGIL/plot_posttraining.py:61-66 \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/nature-figure/assets/figures4papers/figure_VIGIL/plot_ablation.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"336df1a26144cd2dce00d37dbce2a6435726d01153cc78d49bd8fe83aea05501"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/nature-paper-to-patent/scripts/validate_patent_draft.py:155-159 | skills/nature-paper-to-patent/scripts/validate_patent_draft.py:191-195 \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/nature-paper-to-patent/scripts/validate_patent_draft.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"07840912de2b880d211af4eb6b01b6de8a68d614aa3a42954e7d5484c9037849"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/nature-paper-trans/scripts/pages.py:729-739 | skills/nature-paper-trans/scripts/pages.py:786-796 \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/nature-paper-trans/scripts/pages.py"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"501a4b14f94b783252d1eb96f05d42daea0459fcb6f0d805b55d1d7ad7d3b4a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/nature-academic-search/mcp-server/sources/sciencedirect.py:89-99 | skills/nature-academic-search/mcp-server/sources/scopus.py:335-345 \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/nature-academic-search/mcp-server/sources/sciencedirect.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6739777368718c04d6a99f01e1593c917e54e041cc02523b1b6802e23f9071b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/nature-image2ppt/cli/image2ppt/runtime/deck_run_state.py:32-36 | skills/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py:802-806 \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/nature-image2ppt/cli/image2ppt/runtime/deck_run_state.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"98206794b9936a3bee9856b52ce5d4eb099d0f95acc464dcbda02f9cfe459bb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): skills/nature-image2ppt/scripts/postprocess_manifest_arrows.py:88-92 | skills/nature-image2ppt/scripts/render_image2ppt_qa.py:28-32 | skills/nature-image2ppt/scripts/visual_review_evidence.py:39-43 | skills/nature-paper-card/scripts/prepare_paper.py:47-51 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/nature-image2ppt/scripts/postprocess_manifest_arrows.py:83\u0060 calls \u0060sha256_bytes\u0060, \u0060sha256\u0060, \u0060hexdigest\u0060 and \u0060skills/nature-image2ppt/scripts/render_image2ppt_qa.py:24\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/nature-image2ppt/scripts/postprocess_manifest_arrows.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c932e8577906d351b5104ca33a2d4cec76e7ad159624e76994aaba13476d5bbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/nature-paper-to-patent/scripts/disclosure/cnipa_epub_crawler.py:56-62 | skills/nature-paper-to-patent/scripts/disclosure/cnipa_epub_search.py:45-51 \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/nature-paper-to-patent/scripts/disclosure/cnipa_epub_crawler.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14994dde70b8c63cf697c19d2f9bb3f5501cdff86d41752945fb6c02283a226"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py:247-255 | skills/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py:371-379 \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/nature-figure/assets/figures4papers/figure_Dispersion/plot_illustration.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8c0b5fc7d7187816447f0015615c3fe7bc0ac05323dce1f22ebc425544f1ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/nature-figure/assets/figures4papers/figure_RNAGenScape/plot_hole_manifold.py:7-15 | skills/nature-figure/assets/figures4papers/figure_RNAGenScape/plot_manifold.py:7-15 \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/nature-figure/assets/figures4papers/figure_RNAGenScape/plot_hole_manifold.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c415b7d8d63c039f4fb82161385f2aec6e854f531218fa253bd148e42870e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/nature-figure/assets/figures4papers/figure_VIGIL/plot_ablation.py:64-68 | skills/nature-figure/assets/figures4papers/figure_VIGIL/plot_ablation.py:84-88 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/nature-figure/assets/figures4papers/figure_VIGIL/plot_ablation.py:61\u0060 calls \u0060plot\u0060 and \u0060skills/nature-figure/assets/figures4papers/figure_VIGIL/plot_ablation.py:83\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/nature-figure/assets/figures4papers/figure_VIGIL/plot_ablation.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a4a0dc518e38728b02d55f4187740ed1fc6764b51ad4d40badfc6a99b2f1b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): skills/nature-figure/scripts/audit_figure_collisions.py:655-659 | skills/nature-figure/scripts/audit_figure_collisions.py:665-669 | skills/nature-figure/scripts/audit_figure_collisions.py:676-680 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/nature-figure/scripts/audit_figure_collisions.py:655\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/nature-figure/scripts/audit_figure_collisions.py"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"529d418c2e17140fb8c8bb5e8df3da85d523c74ed4d0c3763003ce1fbf1ed9b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): scripts/validate-workflows.py:51-68 | scripts/validate-workflows.py:72-91 \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":"scripts/validate-workflows.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2673a8072b3326aa0cfc4266ad78bfbede937e442af3c0990041a7ed9e9f06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): scripts/validate-repository.py:138-159 | scripts/validate-workflows.py:122-138 \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":"scripts/validate-repository.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e18ca88a42f4d202a26577474acbe7764fb86f49952286b513fb2cd44d12ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/nature-academic-search/mcp-server/sources/pubmed.py: skills/nature-academic-search/mcp-server/sources/pubmed.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in pubmed._parse_article at line 70. 4 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 02:24:20 \u002B00:00\u0027 --until=\u00272026-11-13 02:24:20 \u002B00:00\u0027 --full-history --no-merges -- skills/nature-academic-search/mcp-server/sources/pubmed.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/nature-academic-search/mcp-server/sources/pubmed.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0547b2c51f44559ead4c75b0748b61d8b1f47d961b10256fa5433fed5c6f576f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/generate-star-history.py: scripts/generate-star-history.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in generate-star-history.fetch_stargazers at line 233. 4 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 02:24:20 \u002B00:00\u0027 --until=\u00272026-11-13 02:24:20 \u002B00:00\u0027 --full-history --no-merges -- scripts/generate-star-history.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate-star-history.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f2bef2151723ebb9fae5f4f67c230e2d8c2401a62d81c3c3037dca1b8ada84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/nature-image2ppt/scripts/run_image2ppt_qa.py: skills/nature-image2ppt/scripts/run_image2ppt_qa.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in run_image2ppt_qa.main at line 39. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 02:24:20 \u002B00:00\u0027 --until=\u00272026-11-13 02:24:20 \u002B00:00\u0027 --full-history --no-merges -- skills/nature-image2ppt/scripts/run_image2ppt_qa.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/nature-image2ppt/scripts/run_image2ppt_qa.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c66d9e3060219701a4055dffc73bdce4f3155adbcf7b56e973c107be4de0522"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/nature-image2ppt/scripts/run_final_image2ppt_qa.py: skills/nature-image2ppt/scripts/run_final_image2ppt_qa.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in run_final_image2ppt_qa.main at line 52. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 02:24:20 \u002B00:00\u0027 --until=\u00272026-11-13 02:24:20 \u002B00:00\u0027 --full-history --no-merges -- skills/nature-image2ppt/scripts/run_final_image2ppt_qa.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/nature-image2ppt/scripts/run_final_image2ppt_qa.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e0982a34889e7fc2558688e416140d9777d04f70550df06e016384f69e9836"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/nature-academic-search/mcp-server/sources/arxiv.py: skills/nature-academic-search/mcp-server/sources/arxiv.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is ArxivSource._parse_entry at line 246), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(nature-academic-search): skip arXiv error entries instead of returning a paper\u201D; \u201Cfix: AttibuteError by adding annotations\u201D; \u201Cfix: audit input handling, PDF text matrix sizes, reviewer Contents (#246)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 02:24:20 \u002B00:00\u0027 --until=\u00272026-11-13 02:24:20 \u002B00:00\u0027 --full-history --no-merges -- skills/nature-academic-search/mcp-server/sources/arxiv.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/nature-academic-search/mcp-server/sources/arxiv.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f64d3f09c12fd46b7c65471dd64af1dabe386f072bae7d19ab48b6e97082e1c"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 12 significant file(s) lose their only recent owner: skills/nature-figure/scripts/audit_panel_alignment.py, skills/nature-figure/scripts/plot_templates.py, skills/nature-figure/scripts/audit_figure_collisions.py, skills/nature-academic-search/scripts/academic_search.py, skills/nature-paper-to-patent/scripts/disclosure/math_render.py, skills/nature-figure/scripts/audit_svg_schematic.py, skills/nature-response/scripts/check_package_consistency.py, skills/nature-shared/scripts/check_consistency.py (\u002B4 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"23fa1778aea8d2ff37777285068e58e1b6ccee06cc289ef4989240fac90c9841"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 3 significant file(s) lose their only recent owner: scripts/validate-skill-index.py, scripts/validate-readme-mirror.py, scripts/validate-readmes.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b008e6b5bfeacd2a69a73b27e9b96f7c4b520688f303049dcb8760bd8b974f78"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 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 (17 single-owned of 119 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; 119 of the 132 production source files in this repository met that bar). They are anonymized user #3 (1 file(s)), anonymized user #4 (1 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/nature-image2ppt/cli/image2ppt/runtime/split_alpha_components.py, skills/nature-downloader/scripts/configure_credentials.py."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: update! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-figure/assets/figures4papers/figure_CellSpliceNet/plot_comparison.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0474eda739feb9845a406515e6abf9b4134561f32cb0fcefb1b71b9f04ff02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: update! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-figure/assets/figures4papers/figure_CellSpliceNet/plot_comparison.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e1196456fa2dcd4a2930ffb62baba63bc9a9e7d96e976b6010d5b7f351a438"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: update! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-figure/assets/figures4papers/figure_CellSpliceNet/plot_comparison.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3b68c93bfcc610b88913b74816780a9c9af26fdd59e53039470dcaa3b9d23d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: update! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-figure/assets/figures4papers/figure_CellSpliceNet/plot_comparison.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5672b4829e015a55fc81c25e31e09c71847c13aa7cc2da21f6115300b299c8c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: update! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-figure/assets/figures4papers/figure_CellSpliceNet/plot_comparison.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80fddfaaaa14a5a295f4c8010981ee0adb0db170fe4aebed5f72a74d4ea3f1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: update! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-figure/assets/figures4papers/figure_CellSpliceNet/plot_comparison.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7dae78f46ef9b59d02530604110d4c75133be2d109eb5fad07aa3b0e1cd729"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022CNKI slider: look for the specific verification elements\u0022 repeats the code it sits on: 5 of its 6 words (cnki, slider, look, verification, elements) are already in \u0060const detection = await evalJs(proxy, target, \u0060(()=\u003E{\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/anti-bot.mjs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9eb99220e6b8f7d7896253e1ee82ebcc0b6c24f38abfedb7b7f4ffc7e35679"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if verification passed\u0022 repeats the code it sits on: 3 of its 3 words (check, verification, passed) are already in \u0060const verifyResult = await evalJs(proxy, target, \u0060(()=\u003E{\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/anti-bot.mjs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"400635f9b2f34f83c9571b04b70bf2870488b9a335ca09309594638d5daa9006"}},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70fcadbdecd58e394cdd476750dd476a7ff3cc9d4119ccac22159f5577a96029"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3bf1818586e3fd075bb04833cb83e72266e4e6bcecd880b653a348d66b0c88db"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa78d6648dd123882c66345e258c23d9b544fa4c8741adb5ca0c262a04c76695"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"15af5a3550cf4b520c0d1bec319f926f9c93e179cb6eaa638cb07a2dd75bb580"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"7c96e8292fabd54cdd5379447a1fb71715c14920a799c04b6ecd2d6fa34ac72b"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4901dc431ba00f27c3f9ebf2ae7c033237be4937de90aafce88cb6249dbb9b88"},"properties":{"dependency":{"package":"certifi","version":"2026.7.22","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"958eb86520e75a3522b64b680fae1c600312de92762fdfa27b503b35617f07ac"},"properties":{"dependency":{"package":"pillow","version":"12.3.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112396","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112405","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-114501","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96639","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96643","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4328","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4333","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4336","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343","PYSEC-2026-4363"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"469d21347b8b8159a7709ab9ce90f61d32212488efc71ffdf274fd988a8f017c"},"properties":{"dependency":{"package":"pyjwt","version":"2.13.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4140","PYSEC-2026-4141","PYSEC-2026-4142","PYSEC-2026-4143","PYSEC-2026-4144","PYSEC-2026-4145","PYSEC-2026-4146","PYSEC-2026-4147","PYSEC-2026-4148","PYSEC-2026-4149","PYSEC-2026-4150","PYSEC-2026-4151","PYSEC-2026-4152","PYSEC-2026-4183"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59c332e9ac17f41a84057c980564d058b512ddf834656654973326cf4e2dba94"},"properties":{"dependency":{"package":"lxml","version":"5.4.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-87"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3efe2a92831bd7f0e7cb979c45fb2bb09970349e5ddd035dd56502a092397d9"},"properties":{"dependency":{"package":"pypdf","version":"6.14.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-3655","PYSEC-2026-3656","PYSEC-2026-3910","PYSEC-2026-3911","PYSEC-2026-3912","PYSEC-2026-3913","PYSEC-2026-4153","PYSEC-2026-4154","PYSEC-2026-4155","PYSEC-2026-4156","PYSEC-2026-4157","PYSEC-2026-4158","PYSEC-2026-4159","PYSEC-2026-4160"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3c60d7c2f949a47911f8394986e1cdaa60640b1666175a90efe5a2000fbbba51"},"properties":{"dependency":{"package":"urllib3","version":"2.7.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4175","PYSEC-2026-4176","PYSEC-2026-4177"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb2a2a6c299aaf7d955d15c7f68ec352629154f398b9dc4ba3aefc36f7512e74"},"properties":{"dependency":{"package":"basic-ftp","version":"5.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba2f1709e71e368f3c77061a36c25ceccf8150cc565a4de820a4742b097bce1b"},"properties":{"dependency":{"package":"dompurify","version":"3.3.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e5c71a82036e67aa31f0885ab25198d4f21bbab4dad662517946b4c70f5d2f2"},"properties":{"dependency":{"package":"extract-zip","version":"2.0.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"009cede3a73e170a722df3989789c6bbc985b8b94f0414015ac410c2c49c67af"},"properties":{"dependency":{"package":"ip-address","version":"10.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d08a2d1aeb6158d1b84aaff6de2606bb7f8760fd7ae0fd0fff5a7b3235df67a"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62b95d305d98ce75a40ded155939b07a35a29e6ccce3167f94be270809f12fc2"},"properties":{"dependency":{"package":"nanoid","version":"3.3.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d0bce2de4a22476c2506b4dae5ff90a6e3385a6b80795cb7210fb50a61624b27"},"properties":{"dependency":{"package":"postcss","version":"8.5.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47c45787d665a9e7e81768730fa6d8a03a20f0555a32a074c5944ee92a76571b"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f8def63be45a20f86374de93c6419ce0fad82885aa2c31868128181ba4c9732"},"properties":{"dependency":{"package":"ws","version":"8.20.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e920cbc65a3011bb22d6cdc94da29b4abcba81b5c60437bb710456d0cc12d92a"},"properties":{"dependency":{"package":"zod","version":"3.23.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08604047b2fd2d947801451b7b79a11e3d8db4afb280daf9f26de12ba277a9d9"},"properties":{"dependency":{"package":"mcp","version":"1.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"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":"ebdc6c330cdb0fe10d0ce2927a15bd4628a8c9945dd69ef31cb71c99d226baa7"},"properties":{"dependency":{"package":"mermaid","version":"11.14.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e41895b23c64f854075e5efda51b7c93ff9bf532f4d6c7c370c4ac34b60fe115"},"properties":{"dependency":{"package":"postcss-selector-parser","version":"6.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e80e455b41acb96cba21fc7da0d832cf4802af5fd00d004c42bc77af6e225658"},"properties":{"dependency":{"package":"uuid","version":"11.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae2ab4dfeb3d21e309ed6f23128e4767d0f3b23b9f529b6dd826691910fb6607"},"properties":{"dependency":{"package":"katex","version":"0.16.45","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D32","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":"efd1963dc28d4ad8105c852dee46da22f39502578520109ba2ec6aead48caac3"}},{"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/nature-downloader/src/wizard.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc529f13226ffb1824f98f61045dec65bf541b2aefc813e7a1706bc63bb53a3"}},{"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/nature-paper-to-patent/scripts/render_flowchart_svg.py, skills/nature-paper-to-patent/scripts/render_patent_docx.py, skills/nature-academic-search/mcp-server/sources/crossref.py, skills/nature-academic-search/mcp-server/sources/sciencedirect.py, skills/nature-paper-to-patent/scripts/build_patent_package.py, skills/nature-downloader/src/validators.py, skills/nature-paper-to-patent/scripts/math_to_omml.py, skills/nature-downloader/src/health_check.py (and 5 more) (14 orphaned of 119 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; 119 of the 132 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/nature-paper-to-patent/scripts/render_flowchart_svg.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"380046c40aefd25e5815cb1c036b11d9dff8ed3c4dde64a88573c70a0a360a22"}},{"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/nature-paper-to-patent/scripts/render_patent_docx.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a36f67531144c606166aee97673579379d4793e0977c9980062c88514d4986"}},{"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/nature-academic-search/mcp-server/sources/crossref.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88224f1d7a04dcb752bea03e46210904f8c9fb7b7767147a892a73d7936968b"}},{"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/nature-academic-search/mcp-server/sources/sciencedirect.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2194f0e4171f1ed874109568fba53d76b2bc30b0cee4930866a567909a614351"}},{"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/nature-paper-to-patent/scripts/build_patent_package.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ff77d33b1c7d67f74851a18ba41005a5ceecccbf774165c31f7a2a98e2ec36"}},{"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/nature-downloader/src/validators.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b1afface01962238346c888b09ee8914ba2a24a3c5049d4eeb3c80f4d658f5"}},{"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/nature-downloader/src/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef853003d764c2371a86f79056a096ab6d42ba38329ef6581e5c80b8ed223fc4"}},{"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/nature-paper-to-patent/scripts/math_to_omml.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7834379ae9c6824cc290efc5cf3df46fed06bf32d2219a2ffcad2ce1713eb1a"}},{"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/nature-downloader/src/health_check.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e76d93666bb27ace89a2be427e254cfd3d9f4a0a0363efb757c51dabe65a3b"}},{"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/nature-academic-search/scripts/preflight.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e6fa825bcb4205b620c86bf53e4d15ea787b443a67e5845d66ecd0cdecd3cd"}},{"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/nature-paper-to-patent/scripts/init_patent_project.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18fa722016218d9e136c0057b6713bf3004c53c5875567f074bcb183121b426"}},{"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/nature-downloader/scripts/extract_pdf_text.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72645ddb644ccf67df3b004c783fbf459d1112ab6b3ccc909c8d31f74402878b"}},{"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/nature-academic-search/mcp-server/sources/elsevier_common.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8178b6cdd0d6ca6112f39d5c98605fba8f4aad375edacec46a07c9ee9b586e9b"}},{"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":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"732c4587b5831e9d9da4b05f6bb12d9a8a817ddcc0ff07809f91bca0b3a52697"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.8:1): \u0060.skills__cat-btn--active, .skills__cat-btn--active:hover, .skills__cat-btn--active:focus-visible\u0060 sets color: #FFFFFF on background-color: #5B8C7E \u2014 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"76203f4e051a3da0a62d441831f5336a2dbba14ee81b1dbe85890c256abd6182"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.6:1): \u0060.skill-card__tag\u0060 sets color: #6B7D8D on background-color: #F0EDE6 \u2014 3.6:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ef6b2e2c97349c001c9dac0ac702e7475626d12c978aca0fe172769a167e21"}},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 1 ADR-shaped document(s) detected by content \u2014 \u0060skills/nature-image2ppt/references/page-decision-tree.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":"M4","level":"note","message":{"text":"README/code drift: skills/nature-paper-trans/README_EN.md names Python 3.9 or later, but skills/nature-image2ppt/cli/pyproject.toml:5 requires \u0060requires-python = \u0022\u003E=3.10\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":"skills/nature-paper-trans/README_EN.md"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8c0e3001cafd7e5a344385ed5e121a88646be5dee5b42218488016247d4544"}},{"ruleId":"P1","level":"note","message":{"text":"CI build step not evidenced: A CI pipeline exists but no build step was matched \u2014 changes may merge without the build ever running. A build step may be invoked directly as a command, or declared as a task that a runner named in the pipeline resolves."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"251015acef1a259fcc13b7c60660cc8917ccb3ae8056cb5165ae03312dd586e8"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/4 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060skills/nature-downloader\u0060, \u0060skills/nature-figure\u0060, \u0060skills/nature-image2ppt/cli\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"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 9 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/test-content-contracts.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060skills/nature-paper-to-patent/scripts/disclosure/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-paper-to-patent/scripts/disclosure/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa99da948a62649ae318ec4e19dea2d96aa104cb3fc59b80fe662ad875b3c84b"}},{"ruleId":"P6","level":"note","message":{"text":"Changelog looks stale/thin: The changelog this check read carries 2 versioned entries, against a bar of 3. Counted as either the distinct \u0060x.y.z\u0060 versions it names (a link\u0027s target is not counted) or its version-shaped section headings (\u0060## [1.2.0]\u0060, \u0060## V14.x.x\u0060, \u0060## Updates in 8.0.x\u0060), whichever is the larger \u2014 so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read \u2014 release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository \u2014 are not counted here, and this row is about what is re-findable in the tree rather than about how often you release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9a74c249fe67853238d9c15085f7f97d31f51bb82455046aa10c2cef82f67b8"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 39 plain JS \u2014 the untyped files are skills/nature-downloader/scripts/batch_download.mjs, skills/nature-downloader/scripts/browser_pdf_downloader.mjs, skills/nature-downloader/scripts/cdp_open_url.mjs, skills/nature-downloader/scripts/lib/anti-bot.mjs, skills/nature-downloader/scripts/lib/cdp-utils.mjs, skills/nature-downloader/scripts/lib/cnki.mjs (\u002B33 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): skills/nature-downloader/scripts/lib/cnki.mjs:210 \u00B7 skills/nature-downloader/scripts/lib/cnki.mjs:252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/cnki.mjs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"031bb09592b8c090eae426590a925a034d8621c21d69b863c46f9d8ed7e060e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): skills/nature-downloader/scripts/browser_pdf_downloader.mjs:13 \u00B7 skills/nature-downloader/scripts/cdp_open_url.mjs:2 \u2014 the two spans are one implementation copied and then locally edited \u2014 92 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/browser_pdf_downloader.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e69462267dcabb55f09acebf063c7aa892fe23ece2cbbd5adc823782861963"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): skills/nature-downloader/scripts/batch_download.mjs:256 \u00B7 skills/nature-downloader/scripts/lib/cnki.mjs:219 \u00B7 skills/nature-downloader/scripts/lib/cnki.mjs:261 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"974979e6f3b00f2e729728a917b49be447f5d0b33a7504b75508f2aefca8485d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): skills/nature-downloader/scripts/lib/anti-bot.mjs:780 \u00B7 skills/nature-downloader/scripts/lib/cnki.mjs:86 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/anti-bot.mjs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0817fe784b1e6001e2d4c7acecf273b40e5745cb3de6d6febd99b8fb6fb3a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): skills/nature-downloader/scripts/lib/cnki.mjs:296 \u00B7 skills/nature-downloader/scripts/lib/cnki.mjs:332 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/cnki.mjs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc93818593d78ad1e2151ec3c0e4113af5a40f9512b4953775de4c7092f42a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): skills/nature-downloader/scripts/lib/credentials.mjs:6 \u00B7 skills/nature-downloader/scripts/lib/school-config.mjs:5 \u00B7 skills/nature-downloader/scripts/lib/settings.mjs:5 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/credentials.mjs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f84801f8182f52e627b7b6476f6698641fb23da909103208804d3bb187ebf88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): skills/nature-downloader/scripts/lib/anti-bot.mjs:225 \u00B7 skills/nature-downloader/scripts/lib/anti-bot.mjs:609 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/anti-bot.mjs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"79267065f1160000430d74b8e2001c8903c191e3c678839aee2c4b53ba324d54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): skills/nature-downloader/scripts/lib/cdp-utils.mjs:67 \u00B7 skills/nature-downloader/scripts/lib/cdp-utils.mjs:78 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/cdp-utils.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30ec25b10ce18c569495260bc50f468161485f57a63b62db041c3324e0c3806"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): skills/nature-downloader/scripts/batch_download.mjs:238 \u00B7 skills/nature-downloader/scripts/batch_download.mjs:285 \u00B7 skills/nature-downloader/scripts/lib/cnki.mjs:208 \u00B7 skills/nature-downloader/scripts/lib/cnki.mjs:250 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b10d045d09ca21c7a2ac315ade6fdd1626335a3ff9feeee9b8660fb0e453ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): skills/nature-downloader/scripts/batch_download.mjs:288 \u00B7 skills/nature-downloader/scripts/lib/cnki.mjs:210 \u00B7 skills/nature-downloader/scripts/lib/cnki.mjs:252 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9716bb7ab5daa89565b8e173630713641170af21c9d09182d8a037184d118c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): skills/nature-downloader/scripts/lib/anti-bot.mjs:99 \u00B7 skills/nature-downloader/scripts/lib/anti-bot.mjs:107 \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/nature-downloader/scripts/lib/anti-bot.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4582e5ffa04fdf84854e6751705d9de3603d3ae045f97c847968f0cada25d6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function downloadDoi (cyclomatic 57, cognitive 88): downloadDoi has cyclomatic complexity 57 and cognitive complexity 88; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"846faf9fc748733b99b1aaecb7348c8e15f61a8b7d67acbf739d4a60d25829c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 49, cognitive 78): main has cyclomatic complexity 49 and cognitive complexity 78; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"c338ef667f11ee443ffeb86aa6cf6b66a959bd52fbd5badb30695f0d80b3befe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function routeDoiDownload (cyclomatic 42, cognitive 53): routeDoiDownload has cyclomatic complexity 42 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b028ae56856a48ae4b6f4620c9fd121d8c63e17571c58b6ca6e92db27914eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 37, cognitive 36): parseArgs has cyclomatic complexity 37 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"448a991b0c3e2080606c721ba1e6bcd7688a884bf44653c27795471a652f9182"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function downloadCnkiTitle (cyclomatic 34, cognitive 72): downloadCnkiTitle has cyclomatic complexity 34 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/cnki.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a15c33ce630b907da12c6e37f4a5da835eb8cdaecef3c3470c1eae6564ed4be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectSupportingInformationLinks (cyclomatic 24, cognitive 21): selectSupportingInformationLinks has cyclomatic complexity 24 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/wos-supporting-information.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9870394b976a3285fed703ba058fcadc659204dc30f7bccc14e60f98e58f1a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function downloadOpenAccessArticle (cyclomatic 22, cognitive 23): downloadOpenAccessArticle has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/open-access-provider.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b71c34979df50a5c02ab509c9c3729aedb9e3830c3a05e1aaa68be41dbef9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function downloadWosSupportingInformation (cyclomatic 19, cognitive 29): downloadWosSupportingInformation has cyclomatic complexity 19 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/wos-supporting-information.mjs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a68ca3cae47f6379ae979fb16794c9dfe1e042e2380dbfa1d4df4ed8f1e5b5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function downloadPublisherRequest (cyclomatic 19, cognitive 24): downloadPublisherRequest has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/publisher-providers.mjs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c1df97a9d0b8622c69621e515205f3a02bc7ca663cd80150090913f1e8ec22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleVerification (cyclomatic 18, cognitive 32): handleVerification has cyclomatic complexity 18 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/anti-bot.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7af1e3143f504e0f8b467abfd444663af2cbb28ee588f408ded0f12fcc508a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 18, cognitive 18): main has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/browser_pdf_downloader.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa413d09eed4319e27f2fc9fa1509c4c2762d370dd5c81ad2cb5c53d1396233c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wosRecordUrls (cyclomatic 16, cognitive 20): wosRecordUrls has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d23f7fdc42b8eca0cd04de74e8e4b15ddc3e0a6bc00adb0a3884ba2ab4a848"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function simulateDrag (cyclomatic 14, cognitive 16): simulateDrag has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/anti-bot.mjs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba61e902f13e0ec0220b48c28df3960c22fc993a2c5b558770734028a5a3862"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseUnpaywallRecord (cyclomatic 14, cognitive 14): parseUnpaywallRecord has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/open-access.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7290b5f50e2479c72fee927bfa34198acd5f9027c3d10ff21367403c441cee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCrossrefWork (cyclomatic 14, cognitive 12): parseCrossrefWork has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/metadata.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30a5cb5c2936d744fc40daed6f427d03ac8d377eb8d0fbd9554acbf84bf063e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function downloadCnkiDirectUrl (cyclomatic 13, cognitive 14): downloadCnkiDirectUrl has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/cnki.mjs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aed355ab8218122ceae1677aae4485579907e18d9425b16ed6eef59440475e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trySliderCaptcha (cyclomatic 12, cognitive 13): trySliderCaptcha has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/anti-bot.mjs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a0eb38131fcf606cf4e557e95449e4d2a3e465a264bb1680234ca053e25aa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function providerRequest (cyclomatic 11, cognitive 15): providerRequest has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/publisher-providers.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"902a4942bf81df1649e79c582aaa66ca5f97e5569d76be9d4cefddedd9134844"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyFullTextContent (cyclomatic 11, cognitive 13): classifyFullTextContent has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/provider-utils.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19e86f5d53bc582cf295ba90c91211fc86e8d4791ff5d09fed5441cedba48e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 11, cognitive 12): parseArgs has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/browser_pdf_downloader.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c898ebc0b2225fd414035547cb74c7ce2f900c6237793579d23ae440bbf2685"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function outputAndManifest (cyclomatic 11, cognitive 10): outputAndManifest has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5df6ab9d32b26139f838b4f3d53d2cab3bb852ecd4158197b1593f0fb61890"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/browser_pdf_downloader.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71a6f24c042d75d2a8642e7296c633611c800d80b0210bab92d10566c2954fc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/cdp_open_url.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"369b30aa3f28b6cb98ab341f3bf7f4d8ad1a6b8b7c3eefdbc3e26822e2df33b8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/retry_elsevier_api.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce832e5d087de38ce3491535ecaeb5c85da5d31d731d0e9661bcc5ffbc0737c"}},{"ruleId":"R6","level":"warning","message":{"text":"No lint or typecheck script: test \u2713 \u00B7 lint \u2717 \u00B7 typecheck \u2717 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"658a995477a4f3b704a1d0c61d78cffb4c5cc1944c2f896c1bb70ee901a201cf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027findUnpaywallCandidates\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/open-access.mjs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1d304d8556a28129443606534188a722a7bb68441bb77eda99f2ddedcad220"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027providerDescriptor\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/provider-registry.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34c3de27873025f1b74dad902a8c880659a1c1167622b2a4fa0b1907c495027"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CNKI_LOGIN_RE\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/status-codes.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"affe9f275d0a7eaad6a730c1faf045ce4a97a6f4a9a7c8c5aaea065941c9e219"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@mermaid-js/mermaid-cli\u0027: Declared in skills/nature-paper-to-patent/scripts/disclosure/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-paper-to-patent/scripts/disclosure/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c617d1eedc317d934d4e65611367bbd8769b316c06c601434d09db470380e47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060env.LIT_DL_CONFIG_DIR || path.join(os.homedir(), \u0022.config\u0022, \u0022lit-dl\u0022)\u0060 appears character-identically in 3 files \u2014 skills/nature-downloader/scripts/lib/credentials.mjs, skills/nature-downloader/scripts/lib/school-config.mjs, skills/nature-downloader/scripts/lib/settings.mjs. 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/nature-downloader/scripts/lib/credentials.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6065655e24a897875cb3148381289e6f97bf2c053f4325e4b9ea7bd6ed6861c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.startswith(\u0022\u56FE\u793A\u0022) or a.startswith(\u0022\u56FE \u0022)\u0060 appears character-identically in 2 files \u2014 skills/nature-paper-to-patent/scripts/disclosure/md_to_docx.py, skills/nature-paper-to-patent/scripts/disclosure/mermaid_render.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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8728b7f6d40047cc9d7d439a1c15e1007a1ed6593098c6bfa61c41b31e0b853"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.visual_review_evidence or \u0022visual-review-evidence.json\u0022\u0060 appears character-identically in 2 files \u2014 skills/nature-image2ppt/scripts/run_final_image2ppt_qa.py, skills/nature-image2ppt/scripts/run_image2ppt_qa.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/nature-image2ppt/scripts/run_final_image2ppt_qa.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"675e32931a94032d163ab9b310be01cd1d45bcbea3f40489a3e42595e506b1a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060checks[\u0022arrow_inspection_command\u0022][\u0022returncode\u0022] != 0 or checks[\u0022arrow_inspection\u0022].get(\u0022passed\u0022) is not True\u0060 appears character-identically in 2 files \u2014 skills/nature-image2ppt/scripts/run_final_image2ppt_qa.py, skills/nature-image2ppt/scripts/run_image2ppt_qa.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/nature-image2ppt/scripts/run_final_image2ppt_qa.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"828a146abf1fd26732ec9dea5677044ef77ea32f1e034c52b98498df8ac773c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060checks[\u0022image2ppt_validation_command\u0022][\u0022returncode\u0022] != 0 or checks[\u0022image2ppt_validation\u0022].get(\u0022passed\u0022) is not True\u0060 appears character-identically in 2 files \u2014 skills/nature-image2ppt/scripts/run_final_image2ppt_qa.py, skills/nature-image2ppt/scripts/run_image2ppt_qa.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/nature-image2ppt/scripts/run_final_image2ppt_qa.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e9cf5274e9c14e9d29d99af1e138654b37f3c6d43b2c460a740b806156c263"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060checks[\u0022region_decomposition_command\u0022][\u0022returncode\u0022] != 0 or checks[\u0022region_decomposition\u0022].get(\u0022passed\u0022) is not True\u0060 appears character-identically in 2 files \u2014 skills/nature-image2ppt/scripts/run_final_image2ppt_qa.py, skills/nature-image2ppt/scripts/run_image2ppt_qa.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/nature-image2ppt/scripts/run_final_image2ppt_qa.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a7aecc67a9da91a78d7c90e5e27bc25ac7bc9187decd29ed07bf6f76a11fbc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060checks[\u0022render_command\u0022][\u0022returncode\u0022] != 0 or checks[\u0022render\u0022].get(\u0022status\u0022) != \u0022rendered\u0022\u0060 appears character-identically in 2 files \u2014 skills/nature-image2ppt/scripts/run_final_image2ppt_qa.py, skills/nature-image2ppt/scripts/run_image2ppt_qa.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/nature-image2ppt/scripts/run_final_image2ppt_qa.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dabe2737a01d1d6fa198026cbd6912006fce2b9f29af9df04a5fd8cab84e4ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060equation_numbers and equation_numbers != list(range(1, len(equation_numbers) \u002B 1))\u0060 appears character-identically in 2 files \u2014 skills/nature-paper-to-patent/scripts/build_patent_package.py, skills/nature-paper-to-patent/scripts/validate_patent_draft.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/nature-paper-to-patent/scripts/build_patent_package.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"329742fb5d12d121a3e78f881e550a98f4ca172184050ea4862526d1c58c1cb2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C len(lines) and lines[i].strip() != \u0022$$\u0022\u0060 appears character-identically in 2 files \u2014 skills/nature-paper-to-patent/scripts/disclosure/math_render.py, skills/nature-paper-to-patent/scripts/disclosure/md_to_docx.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/nature-paper-to-patent/scripts/disclosure/math_render.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad96a47f26c1bb7671c48079303ec404c955761cdcdf57c177c8769a7b176dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C len(lines) and not lines[i].strip().startswith(\u0022\u0060\u0060\u0060\u0022)\u0060 appears character-identically in 2 files \u2014 skills/nature-paper-to-patent/scripts/disclosure/math_render.py, skills/nature-paper-to-patent/scripts/disclosure/md_to_docx.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/nature-paper-to-patent/scripts/disclosure/math_render.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"13891b7184a0cae8a1067f21a09dfd790b9dab5a203b0919782dbca8fd04e012"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ip.is_private or ip.is_loopback or ip.is_link_local\u0060 appears character-identically in 2 files \u2014 skills/nature-figure/scripts/generate_openrouter_schematic.py, skills/nature-image2ppt/cli/image2ppt/runtime/paddle_text_hints.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/nature-figure/scripts/generate_openrouter_schematic.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10fe731c93c9efdfd44f2e140ce47d545bde510dd3061525c6a5cf42adde989"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, str) and value.strip()\u0060 appears character-identically in 3 files \u2014 skills/nature-academic-search/mcp-server/sources/pubmed.py, skills/nature-image2ppt/cli/image2ppt/runtime/image_gen.py, skills/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.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/nature-academic-search/mcp-server/sources/pubmed.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef108cf84d0c2669e3212a003132fe7eadd4d5c938d9359e2c022bc70334619c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060j \u003C len(lines) and lines[j].strip() == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 skills/nature-paper-to-patent/scripts/disclosure/md_to_docx.py, skills/nature-paper-to-patent/scripts/disclosure/mermaid_render.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/nature-paper-to-patent/scripts/disclosure/md_to_docx.py"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"0574b81f69a47fe62e972be123f606e7d5f958527357c954d21391179de77d9a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not errors and args.visual_review_status == \u0022reviewed\u0022\u0060 appears character-identically in 2 files \u2014 skills/nature-image2ppt/scripts/run_final_image2ppt_qa.py, skills/nature-image2ppt/scripts/run_image2ppt_qa.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/nature-image2ppt/scripts/run_final_image2ppt_qa.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9708e866d3543b0ddb5b1a98b10e4490802c5bdae5f861b3c00eb93db08b48eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060review_evidence_path and expected_review_pages\u0060 appears character-identically in 2 files \u2014 skills/nature-image2ppt/scripts/run_final_image2ppt_qa.py, skills/nature-image2ppt/scripts/run_image2ppt_qa.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/nature-image2ppt/scripts/run_final_image2ppt_qa.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"e803af7acc77170d27b0dbbacbda41fcd9649c28d0704b8fd683105391949ad8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060shutil.which(\u0022libreoffice\u0022) or shutil.which(\u0022soffice\u0022)\u0060 appears character-identically in 2 files \u2014 skills/nature-image2ppt/cli/image2ppt/runtime/runtime_env.py, skills/nature-image2ppt/scripts/render_image2ppt_qa.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/nature-image2ppt/cli/image2ppt/runtime/runtime_env.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f8c9eaba6d05aaa8aa07babbf66804a16ce64d7a81e2d230a536847f341e5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060shutil.which(\u0022magick\u0022) or shutil.which(\u0022convert\u0022)\u0060 appears character-identically in 2 files \u2014 skills/nature-image2ppt/cli/image2ppt/runtime/formula_renderer.py, skills/nature-image2ppt/cli/image2ppt/runtime/runtime_env.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/nature-image2ppt/cli/image2ppt/runtime/formula_renderer.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1208399df67116a2ac886e42a6110f77cc5987c56a6503c3c3bd1b0097ff32"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060shutil.which(\u0022powershell.exe\u0022) or shutil.which(\u0022powershell\u0022)\u0060 appears character-identically in 2 files \u2014 skills/nature-image2ppt/cli/image2ppt/runtime/runtime_env.py, skills/nature-image2ppt/scripts/render_image2ppt_qa.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/nature-image2ppt/cli/image2ppt/runtime/runtime_env.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5ba57dc12415be8675c6ec9d1bad924682c6fe2ccecbb7bd18f21e14eefeba"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060record_to_dict\u0060 is public and takes \u0060value: Any\u0060 from its caller, and it calls itself at line 52 (\u0060record_to_dict\u0060) with a piece of \u0060value\u0060 (and at line 54, line 56) \u2014 and nowhere in \u0060record_to_dict\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 \u0060record_to_dict\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-academic-search/mcp-server/sources/elsevier_common.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef69709cb7cbea0e9f0bfbf37f547e6814216bea3d6649d5b810f0ea676a7187"}},{"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/nature-paper-to-patent/scripts/disclosure/cnipa_epub_crawler.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b427d9feb543a25f29450d439441675ec4790edaf01eb94a0db38d76c64fa20f"}},{"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/nature-paper-to-patent/scripts/disclosure/cnipa_epub_crawler.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da0fda1c5983d8e201fae2d3a34651fc2a76259d7224dcc3f2bdc43ba2eb9d3"}},{"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/nature-paper-to-patent/scripts/disclosure/cnipa_epub_crawler.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"98744264c4a7bd4ce294dab6099b18cebc076523a447d531177721902540b503"}},{"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/nature-image2ppt/cli/image2ppt/runtime/build_pptx_from_manifest.py"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02fcd327aff32c29ce07b1f1950c06ddd3de95cfe7e9c6ad66cb676caae7689"}},{"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/nature-image2ppt/cli/image2ppt/runtime/deck_text_hints.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"401e0979caf205f8086673e91326aa6dfc0dcc70ebf12d248f0dcd14ac55cf37"}},{"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/nature-image2ppt/cli/image2ppt/runtime/image_gen.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d7eac9477967047dea9cbfd6454912fc60bbf7abb58db1b8addb447ba85a59"}},{"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/nature-image2ppt/cli/image2ppt/runtime/image_gen.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d97999462ae01d59c2dd55fd9f1e80c20e63376120fb4ba8de02c5dbc08f919"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of \u0060__exit__()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-image2ppt/cli/image2ppt/runtime/image_gen.py"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c45aaccb1693663dd5f798dd54120353064b1c41e1af0b9db0eed3da08cbf4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of \u0060__exit__()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-image2ppt/cli/image2ppt/runtime/image_gen.py"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9fbf315339e2a20800bf1af57d1469f474401483cc04d36cc85ba704edc643"}},{"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/nature-image2ppt/cli/image2ppt/runtime/runtime_env.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc49fdbf1f421bce207de75d147681bb6db58a28be509726819d6bb51d06550"}},{"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/nature-downloader/scripts/extract_pdf_text.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c213f0a80dda3cd6d631c2755951c243430556514028f0af56329d383281992"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/batch_download.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"b795d94eaf10e793c93e20ec30f17f338d86f6408dbc95bdb08634e0cca19773"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/browser_pdf_downloader.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40726d49696a70510b416d26ed5587c791643759d0c82c8c17a14e025bee365"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/browser_pdf_downloader.mjs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dc7d7bd134ca2610c97a75ac46d10ba2eba69bf286db1c8dbe1a0a166d31c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/anti-bot.mjs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7771f19c0d39b729c2a26f4187b9349b9926e838949fb102a9f78c37bb2f64"}},{"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/nature-downloader/scripts/lib/cdp-utils.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfed3bc6ba95529855fd1eafdc77daba6de90663b8e6bcd40f429259aa19bce7"}},{"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/nature-downloader/scripts/lib/cdp-utils.mjs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"070b7ad319d2179abab22bd772daaae9416c8d910d9c8d1d95e50277cb376780"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/pdf-utils.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee110e09698ab98f79ff9b4c62c943015c10c00b6aea7f039c50ab8896318973"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/pdf-utils.mjs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"c453d8579b49344969eacbc91aade41d9765063deb7f2a474abad853842b1b40"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/pdf-utils.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daa79cb67e0283f363e72f7ca8c4586586b612390624f72d406a9e498d29f0d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/pdf-utils.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f025afa9966f712620b9b073dafd41429f142bfa4d0f338dd9515d99712cfde1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/pdf-utils.mjs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e2d05fb5ac368150377a53da4ef28759888f2847f8c117d042b7d148c22389"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch\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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/wos-supporting-information.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae90c51c0194f12183d4e66e0fa5072fe46acb95d59631b20b2aaf311305122"}},{"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/nature-downloader/scripts/lib/wos-supporting-information.mjs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d8d8b911119e302c79fce0af0d1abb518a29e6dfa25e8e52d05f0a656adac4"}},{"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/nature-downloader/scripts/lib/wos-supporting-information.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ffc8f752ef85849845744d94492370bd0a22b53bc011aa09419866f0ec9cf3"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-reader/scripts/validate_reader_math.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f131ea5ee0a286014e1f81d10d92766e2616f7b187b37bb0d8890ffd2d9f01"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060paddle_token\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-image2ppt/cli/image2ppt/runtime/deck_text_hints.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"978e06be41fd0f0df4075f1a307a6406d9fd8f9948c68c41a6efd7a9d606fc7e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_decode_jwt_payload\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-image2ppt/cli/image2ppt/runtime/image_gen.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3786a6be45427b2b93797df0fe810bc9af7bd4711935e2c8360c577c619c4c6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060manifest_schema_version\u0060 returns \u00601\u0060 when \u0060(TypeError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-image2ppt/cli/image2ppt/runtime/validate_pptx.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb0f04c81d5949b7db3e24bcaa4a1615f8bb1c9c24d67a88bd9a5a2b3a4b2d4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_load\u0060 returns \u0060{}\u0060 when \u0060(json.JSONDecodeError, OSError)\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/nature-downloader/scripts/configure_credentials.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6eef0a283ff7ab4c42f877a5d6a4e995ab97c06f9a06e676a36428a1e51f06d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060safe_json\u0060 returns \u0060{}\u0060 when \u0060(OSError, ValueError, 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/nature-image2ppt/scripts/run_final_image2ppt_qa.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a58728ae89185c5979b1547e6609cdbe75a7eae2f2a9d6ba41a984ba1c740ba"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060read_json\u0060 returns \u0060{}\u0060 when \u0060(OSError, ValueError, 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/nature-image2ppt/scripts/run_image2ppt_qa.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea68768d5ffbbf463ef610f904111b786a6dbe9a301cefbaa731484b3cfe4de"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadCredentials\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/credentials.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fa25e641915d919bf6ce021fe19e6cf19417f738faaa91742613a7ae6efa1f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadSettings\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/nature-downloader/scripts/lib/settings.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7591c600804fd45b26a66b2a344025d9a8f2577b93ca0c55f6b97fc699a1a1c4"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-200","guid":"b0ce3b1d-7a29-fe50-8aab-9aba899d2988","name":"Exposure of Sensitive Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Sensitive Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/200.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-312","guid":"96724ece-b0b2-a45c-83f9-0869fa3f6bea","name":"Cleartext Storage of Sensitive Information","shortDescription":{"text":"Cleartext Storage of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/312.html"},{"id":"CWE-359","guid":"b7dfe5b0-0351-645b-a311-b936102c2929","name":"Exposure of Private Personal Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Private Personal Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/359.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-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.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":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":28,"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."]}]}