{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"last30days._main (cyclomatic 273): last30days._main has cyclomatic complexity 273 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":3727}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7bf2f2b8d27744d68a4c6eeeb9ee23206720af6af9244cbf87afb1efc6c0de"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline.run (cyclomatic 207): pipeline.run has cyclomatic complexity 207 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c21c064283104a826bed9fdd6daf1af91f39727c50fd065ba01cf9a2d92145b"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._retrieve_stream_impl (cyclomatic 165): pipeline._retrieve_stream_impl has cyclomatic complexity 165 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":6424}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d6df6d7a8a9ed4edbe7ba510499d64a0156c1c106df53f3d78be3d3e28c41d"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._run_supplemental_searches (cyclomatic 77): pipeline._run_supplemental_searches has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":5051}}}],"partialFingerprints":{"codehealthFindingId/v1":"476f617550ae8fca06cb11415d4fec7b7136a067a903a392be1905e01db82929"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline.available_sources (cyclomatic 70): pipeline.available_sources has cyclomatic complexity 70 (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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"379ebcb00156bbd625852a47ed649a04e2989e8739ff724fe37c3e5a0a38e0a0"}},{"ruleId":"D1","level":"warning","message":{"text":"x_envelope.read (cyclomatic 70): x_envelope.read has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/x_envelope.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3960a0ce6e2913349f8c2f41defb37cbaf91c52292aa84aa15828089b17b47"}},{"ruleId":"D1","level":"warning","message":{"text":"subproc.run_with_timeout (cyclomatic 65): subproc.run_with_timeout has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/subproc.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a764ac16df49696e2e0855e2b441e1683be2a0447d665d139abaf77580af6c89"}},{"ruleId":"D1","level":"warning","message":{"text":"http.request (cyclomatic 59): http.request has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/http.py"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79a44970eae8e5f72d81779e9ce70edc7864579056a6f6caf11da093da9f8ec"}},{"ruleId":"D1","level":"warning","message":{"text":"polymarket.parse_polymarket_response (cyclomatic 58): polymarket.parse_polymarket_response has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/polymarket.py"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"346b23cbc31a58f2198e716f5f67319a429fef24245f6a988318f0071e623865"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._fetch_youtube_stream_live (cyclomatic 56): pipeline._fetch_youtube_stream_live has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":6265}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f6c0bcc8492cff7f3762335867d810d45a37732a762048fffdfac5c070ff33"}},{"ruleId":"D1","level":"warning","message":{"text":"render.render_full (cyclomatic 56): render.render_full has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4e77c1e36f79bd05058e800663119f01f123cdf33528fc4425c656c68f7909"}},{"ruleId":"D1","level":"warning","message":{"text":"planner._sanitize_plan (cyclomatic 51): planner._sanitize_plan has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/planner.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4de00ed6dc809c93986a64e27bed26e6314e83548ef46bedaed953dad8ee544"}},{"ruleId":"D1","level":"warning","message":{"text":"quality_nudge._build_nudge_text (cyclomatic 47): quality_nudge._build_nudge_text 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/last30days/scripts/lib/quality_nudge.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5df48954df345eaaaa2b7dacd6fadff7b539b754baaf5dd59148bc32d962276"}},{"ruleId":"D1","level":"warning","message":{"text":"env.get_config (cyclomatic 45): env.get_config has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/env.py"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4e3b2e4c249e4f4a8f478c8a59ebd4a7245bf304f81f36c707d2792aac2630"}},{"ruleId":"D1","level":"warning","message":{"text":"render._render_hiring_signals (cyclomatic 44): render._render_hiring_signals has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7853cf85d340824072a971c7bdd3c6ea0680b12db4f0ac0c783bda03b69f80d"}},{"ruleId":"D1","level":"warning","message":{"text":"instagram._google_reel_fallback (cyclomatic 41): instagram._google_reel_fallback 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/last30days/scripts/lib/instagram.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"56104a0d14dad3c6e2aa00557069b10bc6b189796ea398a3c566961f505d29c4"}},{"ruleId":"D1","level":"warning","message":{"text":"render._meta_ads_footer_line (cyclomatic 41): render._meta_ads_footer_line 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/last30days/scripts/lib/render.py"},"region":{"startLine":3715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea700f1d6de373dc744e618a262a939a8f687aebfd2ae4ab0bc68da85f07ad93"}},{"ruleId":"D1","level":"warning","message":{"text":"last30days._run_drill (cyclomatic 40): last30days._run_drill has cyclomatic complexity 40 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec8cbe928a76b2b4ac769d56a39df4d89a7cd38002a0e06bd0fbc055177c0d6"}},{"ruleId":"D1","level":"warning","message":{"text":"github.search_github_person (cyclomatic 40): github.search_github_person 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/last30days/scripts/lib/github.py"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09124a4c160c6d8dcfef46d01e19ad8c26406e4ba048322ee4e39d97edaf9d3"}},{"ruleId":"D1","level":"warning","message":{"text":"polymarket.refetch_datum (cyclomatic 40): polymarket.refetch_datum 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/last30days/scripts/lib/polymarket.py"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b7cdf3dac82502fa3086cdcf370fe6035ec291bb89b870ed04cb3e0672bb78"}},{"ruleId":"D1","level":"warning","message":{"text":"render._render_top_comments (cyclomatic 39): render._render_top_comments 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/last30days/scripts/lib/render.py"},"region":{"startLine":4988}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e65f85d44a1e85fb6dd5bac0c5983996bdcc2d363973d5cebb32efa152bcc51"}},{"ruleId":"D1","level":"warning","message":{"text":"reddit_arctic.fetch_listings (cyclomatic 37): reddit_arctic.fetch_listings has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit_arctic.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34325f8b4b181381dd5aefdf5fdc9a4da35c5650ae8e2db942572fcdb07d48d"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._fetch_discovery_source (cyclomatic 36): pipeline._fetch_discovery_source has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe6e6ae1630f5cd150c5871eadaa4870339a5949236453ad66cbdfd6a4dab92"}},{"ruleId":"D1","level":"warning","message":{"text":"render.render_brief (cyclomatic 36): render.render_brief has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff04b0f5666c8a1b4e50e5a6f1863f4591954fbeef8dcd59b01a917a1e4e285"}},{"ruleId":"D1","level":"warning","message":{"text":"x_api.parse_v2_response (cyclomatic 36): x_api.parse_v2_response has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/x_api.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c7a2236bbd9b0bb9628938e57f1ace36c062ed0ec238bd3fa743374ade7d5e"}},{"ruleId":"D1","level":"warning","message":{"text":"youtube_yt.search_youtube_sc (cyclomatic 36): youtube_yt.search_youtube_sc has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d662f0ed41b96a3fb52ced673f14621f2e712c270688590ace15caec0f57b6"}},{"ruleId":"D1","level":"warning","message":{"text":"setup_wizard.get_setup_status_text (cyclomatic 35): setup_wizard.get_setup_status_text has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"90db0fbb1fb376239af41f83cc19658f6c59140d419eeb6e48287efb714ed42a"}},{"ruleId":"D1","level":"warning","message":{"text":"xai_x.parse_x_response (cyclomatic 35): xai_x.parse_x_response has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/xai_x.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1aa71338443b339d80fafbe8e1aebef0e2917d2bba1157dad57d38ad066b0e7"}},{"ruleId":"D1","level":"warning","message":{"text":"render._render_best_takes (cyclomatic 34): render._render_best_takes 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/last30days/scripts/lib/render.py"},"region":{"startLine":4435}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4c7868dd1d5dbf222ac77c276428d2972492da6d0aec1fa4135765279d35ab"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor._x_record (cyclomatic 32): doctor._x_record 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/last30days/scripts/lib/doctor.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1567051dd402bf21ab86cff3956b33fde8fc4d13ac144c256bf3c163e902a7"}},{"ruleId":"D1","level":"warning","message":{"text":"permission_preflight.render_text (cyclomatic 32): permission_preflight.render_text has cyclomatic complexity 32 (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/last30days/scripts/lib/permission_preflight.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f145e1729e10d01be8bd959dc3303303972b0aa72ad1fda204c7b571ebdd3041"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._finalize_items_by_source (cyclomatic 32): pipeline._finalize_items_by_source 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":3870}}}],"partialFingerprints":{"codehealthFindingId/v1":"895791a4adee1cc151ae4529e396ea0cdd69775900a6dbf12b412c9173e69b1f"}},{"ruleId":"D1","level":"warning","message":{"text":"last30days._render_save_and_print (cyclomatic 31): last30days._render_save_and_print has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":2821}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf49327ebd399a6a9afa169141ed30343747421568eb2904b29bbf2e567e0152"}},{"ruleId":"D1","level":"warning","message":{"text":"linkedin.search_linkedin (cyclomatic 31): linkedin.search_linkedin has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/linkedin.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2263114f253b59e94e71bc87e0eb873a7fe36726eb64f854c148a7bf69db37"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._retrieve_stream (cyclomatic 31): pipeline._retrieve_stream has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":5922}}}],"partialFingerprints":{"codehealthFindingId/v1":"2231dc1f602f0fceebca30531b7ede6acf1b42a47b8834e0a1e41b98d0987582"}},{"ruleId":"D1","level":"warning","message":{"text":"render._jobs_digest_block (cyclomatic 31): render._jobs_digest_block has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":2481}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f841809973739f962cb770366823a766f017ea7dc360173fe198f7c97732fa3"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.render_text (cyclomatic 30): doctor.render_text has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/doctor.py"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bea1c01d9f9744e56b645bf13025cf7762bb62e1e9d06d4587abc431671b46"}},{"ruleId":"D1","level":"warning","message":{"text":"grok_x.search_x (cyclomatic 30): grok_x.search_x has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/grok_x.py"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0df8c99f4b659e317fe9e91e116e21f43c17737d7d8c089c617ed51080d8ec"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._search_jobs_lane (cyclomatic 30): pipeline._search_jobs_lane has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":4121}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fc113c447d45bb608f15ab436ffd6c918c7518ca3292e9e5c26cab3ad636fc"}},{"ruleId":"D1","level":"warning","message":{"text":"reddit.search_reddit (cyclomatic 30): reddit.search_reddit has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"929fa3cd145512036992ddaf8abfd77d0031969f880ff23087e11afcd5afaa6a"}},{"ruleId":"D1","level":"warning","message":{"text":"render._build_source_footer_lines (cyclomatic 30): render._build_source_footer_lines has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":3319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0be5fcb147ed1e8f1ed217938c59ee4f5add16829829c848878266145b51aa"}},{"ruleId":"D1","level":"warning","message":{"text":"trustpilot.parse_trustpilot_response (cyclomatic 30): trustpilot.parse_trustpilot_response has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/trustpilot.py"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07ff0190f9202251689be6c6c1aaa36e6da74289ad26f9c32b044f7d2ca31a4"}},{"ruleId":"D1","level":"warning","message":{"text":"last30days._load_last_report_cache (cyclomatic 29): last30days._load_last_report_cache has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6412c250789b93b2ebb8e5ed25b3972a20879035042606d2447c57ceec5b6c1"}},{"ruleId":"D1","level":"warning","message":{"text":"github._person_recent_pushes (cyclomatic 29): github._person_recent_pushes has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/github.py"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb874cfa183bfd2e640e19ea20d6c3d706622125856be6d5bbd9d9ecf5f9b3f"}},{"ruleId":"D1","level":"warning","message":{"text":"instagram.search_instagram (cyclomatic 29): instagram.search_instagram has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/instagram.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f964e5f76f18942dce18abd329268d5760698fcc775a9af169cb518b6d5cbc"}},{"ruleId":"D1","level":"warning","message":{"text":"permission_preflight.build (cyclomatic 29): permission_preflight.build has cyclomatic complexity 29 (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/last30days/scripts/lib/permission_preflight.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"79be0fe9754ef89766c63e53c02e336bb3cd90c9629e042573815477f3934545"}},{"ruleId":"D1","level":"warning","message":{"text":"render._polymarket_top_markets (cyclomatic 29): render._polymarket_top_markets has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":2864}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb75d22e605d9daf9a706a4ed9663be18fe7c739c46b5ea25631b7a521479a0"}},{"ruleId":"D1","level":"warning","message":{"text":"render._amazon_footer_line (cyclomatic 29): render._amazon_footer_line has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":3577}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a46285339a22c8baa5e8a908f84ae0ee01f388018a355980eba0828a52119d0"}},{"ruleId":"D1","level":"warning","message":{"text":"freshness.verify_report (cyclomatic 28): freshness.verify_report has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/freshness.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cc208ecdac308e2f311ce3e1531b1a0dd79f7953ed51cb9648e3de8a03059e"}},{"ruleId":"D1","level":"warning","message":{"text":"jobs._read_board (cyclomatic 28): jobs._read_board has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc50894873924dee2868b2f2f480805ee6b3a14111c4839d2ae2866e7a14911"}},{"ruleId":"D1","level":"warning","message":{"text":"planner.validate_external_plan (cyclomatic 28): planner.validate_external_plan has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/planner.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dea343ae0deb1e889ce954f129ee9331ecc8b3a2b80e4e950d9b293a85897c5"}},{"ruleId":"D1","level":"warning","message":{"text":"render._render_candidate (cyclomatic 28): render._render_candidate has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":2620}}}],"partialFingerprints":{"codehealthFindingId/v1":"82be4a70f003bd136bbcd65b89d551c7874030095ed4501292fab87bf700207e"}},{"ruleId":"D1","level":"warning","message":{"text":"youtube_yt.search_youtube (cyclomatic 28): youtube_yt.search_youtube has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"f983cd759d81b9828f8035454df6f17b48d94fdfff59b1fd8e2adeccb71bb214"}},{"ruleId":"D1","level":"warning","message":{"text":"last30days._cache_research_options (cyclomatic 27): last30days._cache_research_options 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/last30days/scripts/last30days.py"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae794f5f78e9d75c019fd1754451739ce20295bf70470658ac8ef83eb4a8d952"}},{"ruleId":"D1","level":"warning","message":{"text":"chrome_cookies._extract_chromium_cookies_macos (cyclomatic 27): chrome_cookies._extract_chromium_cookies_macos 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/last30days/scripts/lib/chrome_cookies.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0f0eba247325d946afc0da23cedd6282f2c6a0fdad25f1ee15fd0e472ac0ef"}},{"ruleId":"D1","level":"warning","message":{"text":"normalize._normalize_amazon (cyclomatic 27): normalize._normalize_amazon has cyclomatic complexity 27 (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/last30days/scripts/lib/normalize.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff803c68f53210acba7830d69f5863c71c499d6abc3c7ff315627eecbcdfcba"}},{"ruleId":"D1","level":"warning","message":{"text":"parallel_mcp.search (cyclomatic 27): parallel_mcp.search 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/last30days/scripts/lib/parallel_mcp.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5179da037d2ab5fdb808f423e01269de18d21947d6bc2af635aa8b721a406850"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline.merge_drill_report (cyclomatic 27): pipeline.merge_drill_report 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":3391}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b580b9c217f42d259bea100dff8b107872f59c4580f35dacfa80b9602edeb4b"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._retry_thin_sources (cyclomatic 27): pipeline._retry_thin_sources 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":5580}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4d2247390080cbb450f5559a7b44f78c16baf04fb1870d9c6ebf06b58a506c"}},{"ruleId":"D1","level":"warning","message":{"text":"youtube_yt._search_and_transcribe (cyclomatic 27): youtube_yt._search_and_transcribe 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/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dcce1638913e83038a59065f180a52d325f9638588ce349df54dd3b3784904"}},{"ruleId":"D1","level":"warning","message":{"text":"bird_x.search_x (cyclomatic 26): bird_x.search_x 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/last30days/scripts/lib/bird_x.py"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e0b16d92fb3a518e5cc2c6e915358d4ec893cff9e75242d7b76a5df3958d44"}},{"ruleId":"D1","level":"warning","message":{"text":"bird_x.parse_bird_response (cyclomatic 26): bird_x.parse_bird_response 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/last30days/scripts/lib/bird_x.py"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"383c285be86bffe35677baf4d3e54831820de22f69258525d4c7beb098eb50e1"}},{"ruleId":"D1","level":"warning","message":{"text":"cluster._merge_entity_clusters (cyclomatic 26): cluster._merge_entity_clusters 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/last30days/scripts/lib/cluster.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8263995ace96b2c24928637ad33c1704a019181caeb745ff7328c6e7d2efb2ee"}},{"ruleId":"D1","level":"warning","message":{"text":"discovery_handoff._parse_bundle_file (cyclomatic 26): discovery_handoff._parse_bundle_file has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/discovery_handoff.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a1364f8a4c21afb1b24f61ac2c9d33676862bbf57ab2f14da468a89c9cf7d1"}},{"ruleId":"D1","level":"warning","message":{"text":"freshness.extract_claims (cyclomatic 26): freshness.extract_claims 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/last30days/scripts/lib/freshness.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b3a030ac737aa9fbca8f50f31fde144671712bd71b3ae2895b5a76e2383d86"}},{"ruleId":"D1","level":"warning","message":{"text":"github.parse_github_response (cyclomatic 26): github.parse_github_response 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/last30days/scripts/lib/github.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd967720c42f380e8f376399f09f63abf8c99a63bc52857ff2da55b4c8c5046"}},{"ruleId":"D1","level":"warning","message":{"text":"normalize._normalize_meta_ads (cyclomatic 26): normalize._normalize_meta_ads has cyclomatic complexity 26 (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/last30days/scripts/lib/normalize.py"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11cd9e6145236c6704d5cd46b6ee9f971179150ea677717766a63df97e6a74b"}},{"ruleId":"D1","level":"warning","message":{"text":"render.render_compact (cyclomatic 26): render.render_compact has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5167c72c9511e77b1fe1d4f090214eba78ce672054fd7e160ad51f9301998d"}},{"ruleId":"D1","level":"warning","message":{"text":"ui.show_diagnostic_banner (cyclomatic 26): ui.show_diagnostic_banner 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/last30days/scripts/lib/ui.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"751d8b00a9b71b9c0970a77405edb5fae8e897232436f448e582051572ff9a71"}},{"ruleId":"D1","level":"warning","message":{"text":"cookie_extract._find_default_profile (cyclomatic 25): cookie_extract._find_default_profile 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/last30days/scripts/lib/cookie_extract.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddea9f7b66c87f027753cafec0637c08f3c62f2c9ea81c13e559ea8532857cf9"}},{"ruleId":"D1","level":"warning","message":{"text":"instagram.search_and_enrich (cyclomatic 25): instagram.search_and_enrich 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/last30days/scripts/lib/instagram.py"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"318e74a0b17cc9725bd869a08023e5e5819a54e756f51a12d31c1a7060bfd504"}},{"ruleId":"D1","level":"warning","message":{"text":"planner._fallback_plan (cyclomatic 25): planner._fallback_plan 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/last30days/scripts/lib/planner.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"9697ec7b13f1ad1ac972e2eca145180ec559253a332ba10a0b728fc22b7ba00a"}},{"ruleId":"D1","level":"warning","message":{"text":"setup_wizard.run_auto_setup (cyclomatic 25): setup_wizard.run_auto_setup has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e13c49ebd2a9dfbf4dbe319cfd56feb0bd8537118251627f469483c6ccd342c"}},{"ruleId":"D1","level":"warning","message":{"text":"x_envelope._ingest_row (cyclomatic 25): x_envelope._ingest_row has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/x_envelope.py"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c3e4fd7f36101ca4c91ac497b7ffd0c899f4c2095ae111514df7cc23497676"}},{"ruleId":"D1","level":"warning","message":{"text":"youtube_yt.fetch_transcript (cyclomatic 25): youtube_yt.fetch_transcript 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/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf306c7b0331a9229adaeb88411f97a2ddaaf48e3928381bb7551f80c627296c"}},{"ruleId":"D1","level":"warning","message":{"text":"fusion.merge_source_items (cyclomatic 24): fusion.merge_source_items 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/last30days/scripts/lib/fusion.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8e5cb1f63484daed335996c88455c24734ffcb0c8c40d332a258cf9b311ad2"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline.run_discover_resume (cyclomatic 24): pipeline.run_discover_resume 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da2d623259b080032c8823b54817d9766bd75fbb2d0670f071b48f572b52fdb"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._load_library_context (cyclomatic 24): pipeline._load_library_context 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":2160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab5bebcceee38bd1f7628815646337fc0078402a0049ffdc5c7b3fd95543acc"}},{"ruleId":"D1","level":"warning","message":{"text":"schema.without_sources (cyclomatic 24): schema.without_sources 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/last30days/scripts/lib/schema.py"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"502ba82c2f454c7b1111edf5cb920393d615802ee18a2d2da54077f79c99ebc5"}},{"ruleId":"D1","level":"warning","message":{"text":"backends._resolve_alternative (cyclomatic 23): backends._resolve_alternative 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/last30days/scripts/lib/backends.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e97d8832dcfe803223e8d0bb16d9fa1787daad236c3d69a8798b3736fc5e515"}},{"ruleId":"D1","level":"warning","message":{"text":"env.extract_browser_credentials (cyclomatic 23): env.extract_browser_credentials 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/last30days/scripts/lib/env.py"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8019b98b1fc3d3e7b4c0c4057bcae707d5291abc85f6aede1d84c087d367344"}},{"ruleId":"D1","level":"warning","message":{"text":"grok_x.parse_x_response (cyclomatic 23): grok_x.parse_x_response 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/last30days/scripts/lib/grok_x.py"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f552cef130f501d0cc79ca2c6d0ebd89839104137b5464288721009872e8904"}},{"ruleId":"D1","level":"warning","message":{"text":"html_render._markdown_to_html (cyclomatic 23): html_render._markdown_to_html 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/last30days/scripts/lib/html_render.py"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b1a112fc3f601dec1c76985c509c279d6204d1b92c69d4942b52a2ded67c32"}},{"ruleId":"D1","level":"warning","message":{"text":"jobs.parse_workable_response (cyclomatic 23): jobs.parse_workable_response has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs.py"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ba5cff10fe5719c118693924a7ff6d5732e8698268cea634c75acec68d9542"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline.nominate_topic_pool (cyclomatic 23): pipeline.nominate_topic_pool 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0216424bb4fa5349e96a746d86746f64cf7190392391a86e80b6025244d828e"}},{"ruleId":"D1","level":"warning","message":{"text":"render._render_resolved_entities_block (cyclomatic 23): render._render_resolved_entities_block 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/last30days/scripts/lib/render.py"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2036a669d4f035031cd671364de72b71bd096aef370f64c0d7c74a5a8a421930"}},{"ruleId":"D1","level":"warning","message":{"text":"trustpilot.search_trustpilot (cyclomatic 23): trustpilot.search_trustpilot 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/last30days/scripts/lib/trustpilot.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"75544d859a9c89d59d126a119fe3a73c6bdcf5ed89bbe80fdd96f8fd3857bdbc"}},{"ruleId":"D1","level":"warning","message":{"text":"amazon.enrich_source_items (cyclomatic 22): amazon.enrich_source_items 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/last30days/scripts/lib/amazon.py"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f8d825eb5bbe2e584de059ae56de39e5e04a1999b7ee1e02f883a29d06427a"}},{"ruleId":"D1","level":"warning","message":{"text":"arxiv.parse_arxiv_response (cyclomatic 22): arxiv.parse_arxiv_response 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/last30days/scripts/lib/arxiv.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d305d82bf8aad42846145e4f03f393bcfa27ed3faef1726251300f22183284e"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.render_postmortem_text (cyclomatic 22): doctor.render_postmortem_text 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/last30days/scripts/lib/doctor.py"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bf6c39f2b8324e2531a69cf5a7e033160c2b9fb141df627c1d68555f1fc2d2"}},{"ruleId":"D1","level":"warning","message":{"text":"fusion.weighted_rrf (cyclomatic 22): fusion.weighted_rrf 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/last30days/scripts/lib/fusion.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08ab943b416ef99e31d07d7d21aef26edbe479cc3cf5f139062b57ad154d13e"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._fetch_x_backend (cyclomatic 22): pipeline._fetch_x_backend has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":5788}}}],"partialFingerprints":{"codehealthFindingId/v1":"8490d61da5ccdfcb65171950d5bcff95bd4f60a9f4c20ec09db61867df6678ff"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._serve_envelope_lanes (cyclomatic 22): pipeline._serve_envelope_lanes 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":6048}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2aff2536836f6c90d552986564e0993a3697fd980b4293dc601eb13a91074f2"}},{"ruleId":"D1","level":"warning","message":{"text":"planner._trim_subqueries_for_depth (cyclomatic 22): planner._trim_subqueries_for_depth 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/last30days/scripts/lib/planner.py"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f8e73fe746c23fe95f02228d5a567cf384a7391e818ebb9d74ff770bd62643"}},{"ruleId":"D1","level":"warning","message":{"text":"reddit.enrich_with_comments (cyclomatic 22): reddit.enrich_with_comments 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/last30days/scripts/lib/reddit.py"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"c347a3bcd5f1b52b17ac34f4156891fa697cfa37e01a5876e27b5a1feeec6499"}},{"ruleId":"D1","level":"warning","message":{"text":"reddit_keyless._discover (cyclomatic 22): reddit_keyless._discover 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/last30days/scripts/lib/reddit_keyless.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da098363d75e076169d5b4d1af0730a9b8ab77305eb6536fa4c764663e552f4"}},{"ruleId":"D1","level":"warning","message":{"text":"tiktok.search_and_enrich (cyclomatic 22): tiktok.search_and_enrich has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/tiktok.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"247781dcba011e6f15a0e5089cb26f225d72ff0bf2383b2b396edbc9097e9bde"}},{"ruleId":"D1","level":"warning","message":{"text":"x_api._search_pages (cyclomatic 22): x_api._search_pages 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/last30days/scripts/lib/x_api.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd5d67314685e4cad399d7bb7a23ae35a8806379b73cd897d8a63e8dc39732f"}},{"ruleId":"D1","level":"warning","message":{"text":"xiaohongshu_api.search_feeds (cyclomatic 22): xiaohongshu_api.search_feeds 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/last30days/scripts/lib/xiaohongshu_api.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"171fb7e137719f90e205e113299e7a76e3254b3f42babeeaf1a05d282a5c83da"}},{"ruleId":"D1","level":"warning","message":{"text":"corpus.search (cyclomatic 21): corpus.search 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/last30days/scripts/lib/corpus.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5299234f41674af39aaaae11e84bf75b497fdafddc519fba309322a22a40b4"}},{"ruleId":"D1","level":"warning","message":{"text":"grok_x._fields_from_json_obj (cyclomatic 21): grok_x._fields_from_json_obj has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/grok_x.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"66977c7c81b03926bf8bda9d8841d1b731e7487ddd1413f3f7b1f8adc2565021"}},{"ruleId":"D1","level":"warning","message":{"text":"jobs._search_jobs (cyclomatic 21): jobs._search_jobs 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/last30days/scripts/lib/jobs.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03229bca89e206ef776602e2bd70e3c285eaa11ccac1514560b38e11faff1cd"}},{"ruleId":"D1","level":"warning","message":{"text":"jobs.search_board_url (cyclomatic 21): jobs.search_board_url 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/last30days/scripts/lib/jobs.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde43be5089c9425e49eb9ae76c2da1fe9a2153024b47052afca644966484be5"}},{"ruleId":"D1","level":"warning","message":{"text":"jobs._greenhouse_job_to_item (cyclomatic 21): jobs._greenhouse_job_to_item has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs.py"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"652fcbf187645b378267f22d302638c68b7653cf6b98262067b379ad68505782"}},{"ruleId":"D1","level":"warning","message":{"text":"linkedin.parse_linkedin_response (cyclomatic 21): linkedin.parse_linkedin_response 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/last30days/scripts/lib/linkedin.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d615c8430154801c6a6708fa74a885d514601cc03eef159a6ca981a197939271"}},{"ruleId":"D1","level":"warning","message":{"text":"meta_ads.search_meta_ads (cyclomatic 21): meta_ads.search_meta_ads 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/last30days/scripts/lib/meta_ads.py"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"7126c6030e13aac7ffd233822460c06152fcb0e64f2801d09964162c765ec9b3"}},{"ruleId":"D1","level":"warning","message":{"text":"quality_nudge.compute_quality_score (cyclomatic 21): quality_nudge.compute_quality_score 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/last30days/scripts/lib/quality_nudge.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"8736fc9204dc888b42e52901232c7142d6803e80dea194fe174894262be62b4d"}},{"ruleId":"D1","level":"warning","message":{"text":"render._render_stats (cyclomatic 21): render._render_stats 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/last30days/scripts/lib/render.py"},"region":{"startLine":3920}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1c0fe7fa92de745a79c11222aeb898862876cac09b1a4e43fb80fac7960c67"}},{"ruleId":"D1","level":"warning","message":{"text":"stocktwits.parse_stocktwits_response (cyclomatic 21): stocktwits.parse_stocktwits_response has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/stocktwits.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"74406d4ede504677817448805a367b875cfa3b6a0a683fb14a37e74593d4b52d"}},{"ruleId":"D1","level":"warning","message":{"text":"threads._parse_items (cyclomatic 21): threads._parse_items has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/threads.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c402a48078fffe01f0ccddafbbe2d97951309c853b673929e1b89ff0874b3a5"}},{"ruleId":"D1","level":"warning","message":{"text":"youtube_yt._fetch_transcript_ytdlp (cyclomatic 21): youtube_yt._fetch_transcript_ytdlp 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/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ba0e5433169605d8530b652dd7f02529cf3aecda4e9adc917cf0c4780e4f7b"}},{"ruleId":"D1","level":"warning","message":{"text":"last30days.save_output (cyclomatic 20): last30days.save_output 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/last30days/scripts/last30days.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8708293f1a39f55e56c43141f06bedb585b38890af4a85fedfa26f270f81b6fc"}},{"ruleId":"D1","level":"warning","message":{"text":"last30days._company_for_jobs (cyclomatic 20): last30days._company_for_jobs 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/last30days/scripts/last30days.py"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"19837c70fdad4ba3e609454f1ed4b7c09224328f48a8f72d5f4170a7e371128f"}},{"ruleId":"D1","level":"warning","message":{"text":"devto.search_devto (cyclomatic 20): devto.search_devto 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/last30days/scripts/lib/devto.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af783ce7f726fa36e7ed2a5713ef03871de5ba4acfe9aa7b346976118a1b317"}},{"ruleId":"D1","level":"warning","message":{"text":"digg.parse_digg_response (cyclomatic 20): digg.parse_digg_response 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/last30days/scripts/lib/digg.py"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3b04c2f21641305f47da8dc67e20cc76a1442e40d4c24d30af6b016c2f7df7"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor._chained_record (cyclomatic 20): doctor._chained_record 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/last30days/scripts/lib/doctor.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd12aeb5b1b92056b480e003cf4c0b68f82cfdb995c11a12810cd2a4db2bc84"}},{"ruleId":"D1","level":"warning","message":{"text":"instagram._normalize_google_post (cyclomatic 20): instagram._normalize_google_post has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/instagram.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe109000f87f1e1d4477d074cf8cf379f827654bb6a7536b18a471ae0a8d563"}},{"ruleId":"D1","level":"warning","message":{"text":"normalize._normalize_jobs (cyclomatic 20): normalize._normalize_jobs has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/normalize.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0a30cf99ac8ac8c81988c6a93900275d789dd3e5b8990f2f45cd30b4a3e1be"}},{"ruleId":"D1","level":"warning","message":{"text":"patent_digest.digest_lines (cyclomatic 20): patent_digest.digest_lines has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/patent_digest.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"551a47d60be109c4995cd64d390360913ac584ca6c697dc03bccfdac20eb1676"}},{"ruleId":"D1","level":"warning","message":{"text":"perplexity.search (cyclomatic 20): perplexity.search 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/last30days/scripts/lib/perplexity.py"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd241be5540c1f372c13b0f3fe9840d6dbb6c897637d1820e04e366982faf62c"}},{"ruleId":"D1","level":"warning","message":{"text":"planner.build_drill_plan (cyclomatic 20): planner.build_drill_plan 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/last30days/scripts/lib/planner.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa3695470f3a3378d5ccd1b97a4a80354da1d67bb9b36dde773cfbc33049b31"}},{"ruleId":"D1","level":"warning","message":{"text":"reddit_arctic.fetch_scores (cyclomatic 20): reddit_arctic.fetch_scores 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/last30days/scripts/lib/reddit_arctic.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c3dca1e546ce72db169771555ff8e04a083c3e8aa5a8188270a66541795f59"}},{"ruleId":"D1","level":"warning","message":{"text":"reddit_arctic.fetch_post_comments (cyclomatic 20): reddit_arctic.fetch_post_comments 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/last30days/scripts/lib/reddit_arctic.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c8608cb070b8e7f4864631b1282c6f51b2545306036a787bea5cf18c99a905"}},{"ruleId":"D1","level":"warning","message":{"text":"reddit_listing.fetch_discovery_listings (cyclomatic 20): reddit_listing.fetch_discovery_listings 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/last30days/scripts/lib/reddit_listing.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbc024b36c58c798467a2c9be1baac43ac402a7dc98b58eddbcd344c01a972c"}},{"ruleId":"D1","level":"warning","message":{"text":"render._render_polymarket_markets (cyclomatic 20): render._render_polymarket_markets 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/last30days/scripts/lib/render.py"},"region":{"startLine":4852}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ccb9f39a68c5f28ce1f25a940edf89107517f58cbb944d4df03d8ddf1bcd6e"}},{"ruleId":"D1","level":"warning","message":{"text":"topic_shape._entity_phrase (cyclomatic 20): topic_shape._entity_phrase 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/last30days/scripts/lib/topic_shape.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17bfda1af5337e71a6a604576433924a1d034ec65fc55093277ec099e286f70"}},{"ruleId":"D1","level":"warning","message":{"text":"last30days.subrun_kwargs_for (cyclomatic 19): last30days.subrun_kwargs_for 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/last30days/scripts/last30days.py"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf9b1c835545cee95accdc130778bb0dcee7d462050d7fee0c51927f8995dd6"}},{"ruleId":"D1","level":"warning","message":{"text":"dripstack.parse_dripstack_response (cyclomatic 19): dripstack.parse_dripstack_response has cyclomatic complexity 19 (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/last30days/scripts/lib/dripstack.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4602ffe5e22d0d417c22691a8db5c7143e60b2c93f28d2f2ea009fab59d2fc"}},{"ruleId":"D1","level":"warning","message":{"text":"entity_extract.matches_person_identity (cyclomatic 19): entity_extract.matches_person_identity 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/last30days/scripts/lib/entity_extract.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e741291be8b94348c68e349fd3c64fc3fe0d5df9c71a4eadb9ec7ca56c5218e"}},{"ruleId":"D1","level":"warning","message":{"text":"github.search_github (cyclomatic 19): github.search_github 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/last30days/scripts/lib/github.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7f36f18353ced6d8b9407401ec00b35bf2201d77a8b0bfbe703649100dd606"}},{"ruleId":"D1","level":"warning","message":{"text":"jobs_digest.add_engine_roles (cyclomatic 19): jobs_digest.add_engine_roles 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/last30days/scripts/lib/jobs_digest.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"391116e541b16de44daebcffac38e5f5cf1b0845add670bf3c31301a397c405d"}},{"ruleId":"D1","level":"warning","message":{"text":"patents._fetch (cyclomatic 19): patents._fetch 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/last30days/scripts/lib/patents.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"185ad1973310b0e630dc3026e866e72d7bb9652b98598bf76bc9f6d98037a921"}},{"ruleId":"D1","level":"warning","message":{"text":"perplexity._poll_agent_background (cyclomatic 19): perplexity._poll_agent_background 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/last30days/scripts/lib/perplexity.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"684724ede8eda6fcaa4e83f1119af4a73847998fca95ed9096d8d37886eba04b"}},{"ruleId":"D1","level":"warning","message":{"text":"rerank._candidate_haystack (cyclomatic 19): rerank._candidate_haystack has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/rerank.py"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"2255b56bf698805b4e2bcdafc85d6073a2f7bfa926de6f720dc1cb24ab20676f"}},{"ruleId":"D1","level":"warning","message":{"text":"yahoo_finance._fetch_window_uncached (cyclomatic 19): yahoo_finance._fetch_window_uncached has cyclomatic complexity 19 (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/last30days/scripts/lib/yahoo_finance.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"04902bf1f308fcd87733ed8a779fc8c4d672496109fb1784bdacad9c7c09cb26"}},{"ruleId":"D1","level":"warning","message":{"text":"store.findings_from_report (cyclomatic 19): store.findings_from_report has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/store.py"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"57026356622b3a70433de82f8293c163544a950c7a6f617c28ea0f5a79786215"}},{"ruleId":"D1","level":"warning","message":{"text":"cookie_extract._try_firefox_dir (cyclomatic 18): cookie_extract._try_firefox_dir 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/last30days/scripts/lib/cookie_extract.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6119b8ca0b52e46bb8109f4336931a63c970415c56b2ff305c97e87c670e7c5"}},{"ruleId":"D1","level":"warning","message":{"text":"env.get_x_source_status (cyclomatic 18): env.get_x_source_status 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/last30days/scripts/lib/env.py"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbac5b6ff06ecb4b811dc5778cc65e424d773ca3745e1b8677446640912e554"}},{"ruleId":"D1","level":"warning","message":{"text":"instagram.fetch_captions (cyclomatic 18): instagram.fetch_captions 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/last30days/scripts/lib/instagram.py"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"678605860acdd9e7e2d679e594e99d02ecd90e69cf3adedb9321c7131fb927a5"}},{"ruleId":"D1","level":"warning","message":{"text":"instagram._fetch_post_comments (cyclomatic 18): instagram._fetch_post_comments 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/last30days/scripts/lib/instagram.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a8a7d0346cca849ece17ff409d4a541855530c4711602ab017fb377b4b796d"}},{"ruleId":"D1","level":"warning","message":{"text":"jobs.parse_smartrecruiters_response (cyclomatic 18): jobs.parse_smartrecruiters_response 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/last30days/scripts/lib/jobs.py"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bc81c3bb135b1daffe5c330c731822a2edac103b257801936e83b2b5937c86"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._apply_reddit_stream_keepers (cyclomatic 18): pipeline._apply_reddit_stream_keepers 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":3594}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6480d0ecf2e5f3f81a03cbadbcf3310808e166a65044b2895a5116eeb360cbf"}},{"ruleId":"D1","level":"warning","message":{"text":"providers.resolve_runtime (cyclomatic 18): providers.resolve_runtime 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/last30days/scripts/lib/providers.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34c74560830efb6c4c4f53de8778a13dff0fcb6f795070294f7fa7b3adb4cde"}},{"ruleId":"D1","level":"warning","message":{"text":"providers.extract_openai_text (cyclomatic 18): providers.extract_openai_text 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/last30days/scripts/lib/providers.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"0633bb023f132c30560eae209865434e16f598e28466c997609526019dee6ff6"}},{"ruleId":"D1","level":"warning","message":{"text":"reddit_keyless.enrich_source_items (cyclomatic 18): reddit_keyless.enrich_source_items 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/last30days/scripts/lib/reddit_keyless.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1629de5493448e5c498004bfe0cbee7a954d7e1fbbd7cd4fec4bebe046fbf5"}},{"ruleId":"D1","level":"warning","message":{"text":"render.render_context (cyclomatic 18): render.render_context 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/last30days/scripts/lib/render.py"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80a9f5994b7bfcda080f47a9574702711359c0ee5a0eb2c44997b6b0f18041d"}},{"ruleId":"D1","level":"warning","message":{"text":"schema.report_from_dict (cyclomatic 18): schema.report_from_dict has cyclomatic complexity 18 (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/last30days/scripts/lib/schema.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"b140cd229cc4d4ada4bb874a32d8b9af429f3449c7a3f6e339c9bf4562ee57b6"}},{"ruleId":"D1","level":"warning","message":{"text":"x_api._run_handle_lanes (cyclomatic 18): x_api._run_handle_lanes has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/x_api.py"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"10acbde0bbd1ef7922f35cf5014119760db6221baf0b8f4bbc2ba2efd28df92c"}},{"ruleId":"D1","level":"warning","message":{"text":"youtube_yt._fetch_transcript_direct (cyclomatic 18): youtube_yt._fetch_transcript_direct 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/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbb82b806fee5ecedf955cf63ce7fdff1af3006cde24326f48a9140c8409a78"}},{"ruleId":"D1","level":"warning","message":{"text":"youtube_yt._fetch_video_comments (cyclomatic 18): youtube_yt._fetch_video_comments 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/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"848f911450cbd6a13d3bdb4ebd3d8a663c28aef4ca3880447695f5407ac673a3"}},{"ruleId":"D1","level":"warning","message":{"text":"last30days._run_library_feed (cyclomatic 17): last30days._run_library_feed 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/last30days/scripts/last30days.py"},"region":{"startLine":3419}}}],"partialFingerprints":{"codehealthFindingId/v1":"762bdfd1e5a7a37ad8572faf60f990a67b3570fb2ed34cfcf6354d3bce410c46"}},{"ruleId":"D1","level":"warning","message":{"text":"amazon.parse_search_response (cyclomatic 17): amazon.parse_search_response 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/last30days/scripts/lib/amazon.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8d81b9bfae6cb87ffad521713dce7c6b9acc8a5ae5237325c08abc3692882c"}},{"ruleId":"D1","level":"warning","message":{"text":"amazon.select_enrichment_targets (cyclomatic 17): amazon.select_enrichment_targets 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/last30days/scripts/lib/amazon.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca29df9c25b8a91a47e60e8f95ba46b2584ba37abbd0d5d84d8c53420372669"}},{"ruleId":"D1","level":"warning","message":{"text":"bird_x._run_bird_search (cyclomatic 17): bird_x._run_bird_search 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/last30days/scripts/lib/bird_x.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"3054ec109a6e800e626cd5838e2576f7aac7da571fdfb1a3fd19897cc9544e63"}},{"ruleId":"D1","level":"warning","message":{"text":"bird_x._run_bird_search_once (cyclomatic 17): bird_x._run_bird_search_once 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/last30days/scripts/lib/bird_x.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1714aa99566db7cfae956551e127c0750083e32fb63b8228852c8aef8a16809"}},{"ruleId":"D1","level":"warning","message":{"text":"bluesky.parse_bluesky_response (cyclomatic 17): bluesky.parse_bluesky_response has cyclomatic complexity 17 (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/last30days/scripts/lib/bluesky.py"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad717502909857c6464cd2b299d0049cb8f43c960ac5bd90ab099f0285c010b"}},{"ruleId":"D1","level":"warning","message":{"text":"_WSConn.recv_message (cyclomatic 17): _WSConn.recv_message 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/last30days/scripts/lib/chrome_cdp.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"228a9ead914c0520f6a35367d8f5e392e26bf1d2be422364408c8fe87eb562c1"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor.load_run_evidence (cyclomatic 17): doctor.load_run_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/last30days/scripts/lib/doctor.py"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2344a091f6b999d433ad82c242e4a39ad326c51f8639021bdad0b0103a39be16"}},{"ruleId":"D1","level":"warning","message":{"text":"doctor._probe_source (cyclomatic 17): doctor._probe_source 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/last30days/scripts/lib/doctor.py"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"19763ddbac9a97623014b9bab5ad048311aadf18534993049219e5d2a52bb3ee"}},{"ruleId":"D1","level":"warning","message":{"text":"fusion._diversify_pool (cyclomatic 17): fusion._diversify_pool 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/last30days/scripts/lib/fusion.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2aa0acb56a9c3ce2e5caf88ba77f6d688ad305f21aec3603ceb9a3ddad8287"}},{"ruleId":"D1","level":"warning","message":{"text":"grok_x._invoke (cyclomatic 17): grok_x._invoke 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/last30days/scripts/lib/grok_x.py"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21b4cb1de97a773da075900910a5ee8e3b8cc3147c2412d30c9edf15bca6ba9"}},{"ruleId":"D1","level":"warning","message":{"text":"grounding.web_search (cyclomatic 17): grounding.web_search 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/last30days/scripts/lib/grounding.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"9541efbcaf269654b169dd0a81329074a2bf40134c7dba1edb3ff84ea1597e68"}},{"ruleId":"D1","level":"warning","message":{"text":"library._briefing_public_headline (cyclomatic 17): library._briefing_public_headline 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/last30days/scripts/lib/library.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b98259d255222c4debe11f181874aad44d11fafbe571d366e685e5f920d3b16"}},{"ruleId":"D1","level":"warning","message":{"text":"normalize.normalize_source_items (cyclomatic 17): normalize.normalize_source_items 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/last30days/scripts/lib/normalize.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9fd9c5cf7a8da86de07229d0ac85565aca9626184287b286c7ddbaecd15192"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._floor_survivor_records (cyclomatic 17): pipeline._floor_survivor_records 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a04cfa8aa6c0fe286d46d011ef90115e598812694938d43c09698d46fef7c1"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._engine_ranked_job_urls (cyclomatic 17): pipeline._engine_ranked_job_urls has cyclomatic complexity 17 (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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":4284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72fb1ef9130f82a28b36851132d85d3c888293f86c4cb9e0c9403385d645ec1"}},{"ruleId":"D1","level":"warning","message":{"text":"relevance.token_overlap_relevance (cyclomatic 17): relevance.token_overlap_relevance 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/last30days/scripts/lib/relevance.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc159655e0aca4bda29a982cbf3eede9a3489728f76f3f8b6562846f430096ef"}},{"ruleId":"D1","level":"warning","message":{"text":"setup_wizard.write_setup_config (cyclomatic 17): setup_wizard.write_setup_config 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/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"c540569fb96b7a63eddc33ea84135b2a63b3e64a2355b29efa9e415cf094e725"}},{"ruleId":"D1","level":"warning","message":{"text":"stocktwits.detect_symbols (cyclomatic 17): stocktwits.detect_symbols 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/last30days/scripts/lib/stocktwits.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"966728fb38cfacfa5a3c13820aa26896c8f798b89e2e392756cfaec57c5a8fa3"}},{"ruleId":"D1","level":"warning","message":{"text":"stocktwits.refetch_datum (cyclomatic 17): stocktwits.refetch_datum 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/last30days/scripts/lib/stocktwits.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"275e12b1a1289da1ee947d572156ecc6e7e1e2ad9928f60333cd098328394f74"}},{"ruleId":"D1","level":"warning","message":{"text":"tiktok._parse_items (cyclomatic 17): tiktok._parse_items 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/last30days/scripts/lib/tiktok.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a61cbcf0205794f781d9c2bdfa70078ce911dfd3cba127b2bb080d77d2d6b42"}},{"ruleId":"D1","level":"warning","message":{"text":"tiktok._fetch_post_comments (cyclomatic 17): tiktok._fetch_post_comments has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/tiktok.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ed080a5f29802241a8016d8ba6a51125a9ca04d40cb9a35046e4c2b8dd9860"}},{"ruleId":"D1","level":"warning","message":{"text":"trustpilot._select_search_hit (cyclomatic 17): trustpilot._select_search_hit 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/last30days/scripts/lib/trustpilot.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf731b247a416199481cf79ee4718f38dbce1c2fa0fcf2721f4d3a90eae3486"}},{"ruleId":"D1","level":"warning","message":{"text":"youtube_yt._ytdlp_comments_result (cyclomatic 17): youtube_yt._ytdlp_comments_result has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce4c4c9c7ecb24cae1f5a8e11a45f3a32849e7b5669b3654c2ec8eefb4d27aa"}},{"ruleId":"D1","level":"warning","message":{"text":"chrome_cdp._pair_from_cookies (cyclomatic 16): chrome_cdp._pair_from_cookies 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/last30days/scripts/lib/chrome_cdp.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f0458195a71cb281e1986f79db26bf1bba312ed072f19098f9a08c31ad38c0"}},{"ruleId":"D1","level":"warning","message":{"text":"devto.parse_devto_response (cyclomatic 16): devto.parse_devto_response has cyclomatic complexity 16 (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/last30days/scripts/lib/devto.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2143285661f93e57a6805d6d024fbdce87613253d65c730bac7f30f652c348"}},{"ruleId":"D1","level":"warning","message":{"text":"digg._invoke_cli (cyclomatic 16): digg._invoke_cli 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/last30days/scripts/lib/digg.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce42983607a0e9aeb87146d0dff84cb0c1952fe1bd30a2a9c400cc3acabf807"}},{"ruleId":"D1","level":"warning","message":{"text":"freshness._newer_status_contradiction (cyclomatic 16): freshness._newer_status_contradiction 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/last30days/scripts/lib/freshness.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d8bfcd6cf3a0225c06bcea5d77c72218e5a503e28a6eff500699489554346e"}},{"ruleId":"D1","level":"warning","message":{"text":"grok_x._posts_from_json_value (cyclomatic 16): grok_x._posts_from_json_value 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/last30days/scripts/lib/grok_x.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ce6d1f243b26907b3f1d48761a8d2bc61ed578ebab5adfead924269f53622d"}},{"ruleId":"D1","level":"warning","message":{"text":"grok_x._run_query (cyclomatic 16): grok_x._run_query 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/last30days/scripts/lib/grok_x.py"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"231c0cbc1e73af18662b672801720e9171968ba31a300cac8cc200937b14b349"}},{"ruleId":"D1","level":"warning","message":{"text":"normalize._normalize_digg (cyclomatic 16): normalize._normalize_digg has cyclomatic complexity 16 (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/last30days/scripts/lib/normalize.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91179143f170be309244acfcc26ada3826a9b65ce3e90836625e8086cc60346"}},{"ruleId":"D1","level":"warning","message":{"text":"perplexity._openrouter_sonar_search (cyclomatic 16): perplexity._openrouter_sonar_search has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/perplexity.py"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"2724c6b3e909f603a62403d6469687d7cfdeda7be6ed5604ea6a00818bd7d2d7"}},{"ruleId":"D1","level":"warning","message":{"text":"pinterest._parse_items (cyclomatic 16): pinterest._parse_items 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/last30days/scripts/lib/pinterest.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1433edc426e21340b36e1de579ec7e8921a9ff24882beddda568058480385e39"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline.diagnose (cyclomatic 16): pipeline.diagnose 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa2b2eb2f7380c80ae95e8ad062e263a4009613354b4d1bbce59a2d10aa4088"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline._legacy_artifact_outcome (cyclomatic 16): pipeline._legacy_artifact_outcome 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":4790}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8acee2b771772ba7c55995aa65d9b3c6aa7799db4a5ef305f48369d7998b7c"}},{"ruleId":"D1","level":"warning","message":{"text":"planner.build_discovery_plan (cyclomatic 16): planner.build_discovery_plan 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/last30days/scripts/lib/planner.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc17a62dec9d9ac9e730d84ac82faff11508ddae2b8e669043f874e7fb9c138"}},{"ruleId":"D1","level":"warning","message":{"text":"planner._default_source_weights (cyclomatic 16): planner._default_source_weights 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/last30days/scripts/lib/planner.py"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0ca0ac9b65ef8a4fae1abe793b3aba346dea3a0e9d82d59b02c452494dfd96"}},{"ruleId":"D1","level":"warning","message":{"text":"reddit_keyless.search_and_enrich (cyclomatic 16): reddit_keyless.search_and_enrich 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/last30days/scripts/lib/reddit_keyless.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65f2b78c3d01cbb668afbd9c36ad5044d65f9873911cf10adb5f2d1104948fd"}},{"ruleId":"D1","level":"warning","message":{"text":"reddit_search.search (cyclomatic 16): reddit_search.search 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/last30days/scripts/lib/reddit_search.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bea5cd8cda2d19ddc00c6977c56854f1d40834fc1c5311df5d9083b2cd2724"}},{"ruleId":"D1","level":"warning","message":{"text":"render.render_discovery (cyclomatic 16): render.render_discovery 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/last30days/scripts/lib/render.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bd0efcf31072194ac7cb2cd41f9d2f5dde0257a926ff55780de76ba8ebd5b5"}},{"ruleId":"D1","level":"warning","message":{"text":"render._polymarket_odds_line (cyclomatic 16): render._polymarket_odds_line 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/last30days/scripts/lib/render.py"},"region":{"startLine":4811}}}],"partialFingerprints":{"codehealthFindingId/v1":"f695033eac42f2a3e03ca230488719a3123530508a5f54c8b2d212fd31357817"}},{"ruleId":"D1","level":"warning","message":{"text":"youtube_yt._fetch_transcripts_parallel (cyclomatic 16): youtube_yt._fetch_transcripts_parallel 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/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"1221906373bed5135ca0169e96f2f5026e47191c967946d11cb2e867450578ab"}},{"ruleId":"D1","level":"warning","message":{"text":"engine.resolvePythonWithCandidates (cyclomatic 16): engine.resolvePythonWithCandidates 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":"mcp/internal/engine/python.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07a0f0509420c5abe12af679ef9ade1ed0a422e6d1562dc36cd47b5f35618d6"}},{"ruleId":"D2","level":"warning","message":{"text":"last30days._main (cognitive 381): last30days._main has cognitive complexity 381 (threshold 15). Drivers by points: if/else 156 (239 pts), boolean chains 76, ternaries 28 (39 pts), error handling 12 (22 pts), loops 3 (5 pts) (nesting depth added 106). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":3727}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9af51d37582b5a1e97b734fde83dd07c9dfa5c8160c6e838f7f6434e46201d2"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.run (cognitive 332): pipeline.run has cognitive complexity 332 (threshold 15). Drivers by points: if/else 114 (207 pts), boolean chains 67, loops 15 (24 pts), ternaries 13 (24 pts), error handling 4 (10 pts) (nesting depth added 119). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e2207f6dc2ec9f7459769f11dd189dca4acac4693e50d8216dba973c56f0e8"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._retrieve_stream_impl (cognitive 329): pipeline._retrieve_stream_impl has cognitive complexity 329 (threshold 15). Drivers by points: if/else 83 (199 pts), boolean chains 60, ternaries 15 (51 pts), error handling 4 (10 pts), loops 3 (9 pts) (nesting depth added 164). 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":6424}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52540314678bf04c3f9531e87aee4a7b15b43bc570acd88a3efb8e3fb16da84"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._run_supplemental_searches (cognitive 135): pipeline._run_supplemental_searches has cognitive complexity 135 (threshold 15). Drivers by points: if/else 48 (95 pts), boolean chains 14, error handling 5 (13 pts), loops 3 (8 pts), ternaries 4 (5 pts) (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":5051}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f8e5a094858f1966bc3ba010a1a24190a4c991d9bad08655f042eefc90be8d"}},{"ruleId":"D2","level":"warning","message":{"text":"render.render_full (cognitive 126): render.render_full has cognitive complexity 126 (threshold 15). Drivers by points: if/else 30 (71 pts), loops 7 (22 pts), ternaries 6 (21 pts), boolean chains 12 (nesting depth added 71). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3882c25980091b095fda799e1e74270447b7e877ac54aaa8909727d860a0fa5"}},{"ruleId":"D2","level":"warning","message":{"text":"http.request (cognitive 124): http.request has cognitive complexity 124 (threshold 15). Drivers by points: if/else 36 (84 pts), boolean chains 13, error handling 6 (13 pts), ternaries 5 (13 pts), loops 1 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/http.py"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac74525a41f669ffa462ab851e93a58ae4af01db9af1be4b8de745802646e153"}},{"ruleId":"D2","level":"warning","message":{"text":"polymarket.parse_polymarket_response (cognitive 122): polymarket.parse_polymarket_response has cognitive complexity 122 (threshold 15). Drivers by points: if/else 29 (76 pts), boolean chains 17, loops 6 (14 pts), error handling 3 (9 pts), ternaries 3 (6 pts) (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/polymarket.py"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"82eb6ffa0b9adbb06e577fc971641951c6267768a37d2bb813e568e89b7fd09c"}},{"ruleId":"D2","level":"warning","message":{"text":"subproc.run_with_timeout (cognitive 107): subproc.run_with_timeout has cognitive complexity 107 (threshold 15). Drivers by points: if/else 27 (50 pts), error handling 14 (30 pts), boolean chains 12, ternaries 8 (10 pts), loops 3 (5 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/subproc.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b705de2ecf076c49653d4934b2dd90ee75b1fa64f36779c886b47655567bd5c7"}},{"ruleId":"D2","level":"warning","message":{"text":"x_envelope.read (cognitive 92): x_envelope.read has cognitive complexity 92 (threshold 15). Drivers by points: if/else 36 (58 pts), boolean chains 22, error handling 5, loops 4 (5 pts), ternaries 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/x_envelope.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76393852e53bd0b8d33bfa50e59f8e4b294702c21bce3c8f636a4c0a2681ca5"}},{"ruleId":"D2","level":"warning","message":{"text":"instagram._google_reel_fallback (cognitive 88): instagram._google_reel_fallback has cognitive complexity 88 (threshold 15). Drivers by points: if/else 19 (52 pts), ternaries 5 (13 pts), boolean chains 9, loops 5 (9 pts), error handling 2 (5 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/instagram.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8541347a9bc040300fefbfce5554f72b2a2e6fbbba694de4fb12fedb8bf8b6"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._fetch_youtube_stream_live (cognitive 80): pipeline._fetch_youtube_stream_live has cognitive complexity 80 (threshold 15). Drivers by points: if/else 24 (43 pts), boolean chains 25, ternaries 4 (8 pts), error handling 2 (4 pts) (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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":6265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81095266733421dfc144bf96593d2dc3a0e9aaa6f437c29073e71dba7aa58fe"}},{"ruleId":"D2","level":"warning","message":{"text":"quality_nudge._build_nudge_text (cognitive 78): quality_nudge._build_nudge_text has cognitive complexity 78 (threshold 15). Drivers by points: if/else 31 (48 pts), ternaries 5 (13 pts), boolean chains 12, loops 3 (5 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/quality_nudge.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6031a47d7eee4398b284aac15c9a101fa8148e77a842473aa21e56369a4d4e"}},{"ruleId":"D2","level":"warning","message":{"text":"linkedin.search_linkedin (cognitive 77): linkedin.search_linkedin has cognitive complexity 77 (threshold 15). Drivers by points: if/else 18 (50 pts), ternaries 4 (12 pts), error handling 2 (6 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/linkedin.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ca7aee7a5b4004b6dece9278ff9a3d8ee559833397ff618f15e452b3dfbec9"}},{"ruleId":"D2","level":"warning","message":{"text":"xai_x.parse_x_response (cognitive 75): xai_x.parse_x_response has cognitive complexity 75 (threshold 15). Drivers by points: if/else 17 (43 pts), ternaries 6 (16 pts), loops 4 (12 pts), boolean chains 3, error handling 1 (nesting depth added 44). 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/last30days/scripts/lib/xai_x.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0770d04aa1e3dd0103b7d7b923be1ba06f4d28a49131a9373427fd3a1ac05127"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.available_sources (cognitive 73): pipeline.available_sources has cognitive complexity 73 (threshold 15). Drivers by points: boolean chains 38, if/else 31 (35 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5311fccb3748fabd5bd9f7394b65ac71896f1fbf1948b904253430b1bc2368d8"}},{"ruleId":"D2","level":"warning","message":{"text":"render._render_hiring_signals (cognitive 72): render._render_hiring_signals has cognitive complexity 72 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 19, ternaries 5 (15 pts), loops 5 (10 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7395e4cedc98ef6e6eb800ab255b7b428af3130b456062bb80f9f3f1777508b"}},{"ruleId":"D2","level":"warning","message":{"text":"github.search_github_person (cognitive 67): github.search_github_person has cognitive complexity 67 (threshold 15). Drivers by points: if/else 14 (25 pts), ternaries 9 (19 pts), loops 8 (13 pts), boolean chains 6, error handling 2 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/github.py"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c41593c13057d68ac505bd5c2d8421aefa4d0d83e496616cb286c7ebf3566cf"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie_extract._find_default_profile (cognitive 64): cookie_extract._find_default_profile has cognitive complexity 64 (threshold 15). Drivers by points: if/else 11 (38 pts), error handling 6 (17 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 41). 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/last30days/scripts/lib/cookie_extract.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5ddb49985e1df13f0474f33bf0b2669e49110e659ad042771949bb1548d3aa"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_arctic.fetch_listings (cognitive 64): reddit_arctic.fetch_listings has cognitive complexity 64 (threshold 15). Drivers by points: if/else 14 (34 pts), boolean chains 9, loops 6 (9 pts), ternaries 5 (7 pts), error handling 2 (5 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit_arctic.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6100c4662067b5d14fa0261454a94d44f44723b54c96234403e44fd8903d54"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._finalize_items_by_source (cognitive 63): pipeline._finalize_items_by_source has cognitive complexity 63 (threshold 15). Drivers by points: if/else 20 (42 pts), boolean chains 13, ternaries 2 (7 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":3870}}}],"partialFingerprints":{"codehealthFindingId/v1":"a241b1659599eefff1e439b0d44cdb8ae976c46214e53612d67067b978292f80"}},{"ruleId":"D2","level":"warning","message":{"text":"planner._sanitize_plan (cognitive 62): planner._sanitize_plan has cognitive complexity 62 (threshold 15). Drivers by points: if/else 25 (36 pts), boolean chains 21, loops 3 (4 pts), ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/planner.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"8692e2b3aaf0464734e362487d7d82e3013a59e0c00afcb756a2317d01f07b4e"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._fetch_discovery_source (cognitive 61): pipeline._fetch_discovery_source has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (43 pts), boolean chains 14, loops 2 (4 pts) (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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"799268f94d18ca9644d410f105f37388de99c195917f9ebfc4687929c63edb17"}},{"ruleId":"D2","level":"warning","message":{"text":"render.render_brief (cognitive 60): render.render_brief has cognitive complexity 60 (threshold 15). Drivers by points: if/else 17 (25 pts), ternaries 7 (20 pts), loops 6 (10 pts), boolean chains 5 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"980762291e45b2b068a97e92404dd57594041c6abba4b3cf6c48b41a4cbff971"}},{"ruleId":"D2","level":"warning","message":{"text":"render._render_best_takes (cognitive 59): render._render_best_takes has cognitive complexity 59 (threshold 15). Drivers by points: ternaries 11 (27 pts), if/else 7 (15 pts), boolean chains 11, loops 3 (6 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":4435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e827a90cdb4ccc0c5edc9cf0c3741a097674fd6d4a3eb2c0e5c92cf62abcc1f6"}},{"ruleId":"D2","level":"warning","message":{"text":"env.get_config (cognitive 55): env.get_config has cognitive complexity 55 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 11, ternaries 6 (9 pts), loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/env.py"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6df9083d55e7f50abb88dad5613b11e543d161fef512ec686df7db737e252e"}},{"ruleId":"D2","level":"warning","message":{"text":"fusion.weighted_rrf (cognitive 55): fusion.weighted_rrf has cognitive complexity 55 (threshold 15). Drivers by points: if/else 11 (33 pts), ternaries 6 (17 pts), loops 3 (4 pts), boolean chains 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/last30days/scripts/lib/fusion.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f18239465748cd6cbd90c78024cc0ff20313621d158180da89a63b43cdb68a"}},{"ruleId":"D2","level":"warning","message":{"text":"render._render_top_comments (cognitive 55): render._render_top_comments has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 11, ternaries 4 (8 pts), loops 6 (7 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":4988}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78d4657ef570c3af544928379fdab32d9a605357da52111662ab47b646f71f5"}},{"ruleId":"D2","level":"warning","message":{"text":"github._person_recent_pushes (cognitive 54): github._person_recent_pushes has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (27 pts), ternaries 3 (9 pts), loops 6 (8 pts), boolean chains 6, error handling 2 (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/last30days/scripts/lib/github.py"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34c788bb02d123703a624e95396d5661c5ae385db63558c4ec575343dfb54ea"}},{"ruleId":"D2","level":"warning","message":{"text":"render._polymarket_top_markets (cognitive 54): render._polymarket_top_markets has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (29 pts), ternaries 5 (15 pts), boolean chains 6, loops 4 (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/last30days/scripts/lib/render.py"},"region":{"startLine":2864}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff4e301fc06810c38cc16e2b222cac3ecbc4fb876a40bf7a7f9baa8f330a6e4"}},{"ruleId":"D2","level":"warning","message":{"text":"x_api.parse_v2_response (cognitive 54): x_api.parse_v2_response has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 15, ternaries 2 (3 pts), loops 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/x_api.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8275f7e60eafbeb741942adf3adc2dc52a85a63a57dcc8e7858b821c04fa62f"}},{"ruleId":"D2","level":"warning","message":{"text":"render._build_source_footer_lines (cognitive 53): render._build_source_footer_lines has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (29 pts), ternaries 8 (17 pts), boolean chains 4, loops 2 (3 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/last30days/scripts/lib/render.py"},"region":{"startLine":3319}}}],"partialFingerprints":{"codehealthFindingId/v1":"0087680ffd6b26bd47ad9d4226f25b3ce3edcbcd7309012826447350edfe8224"}},{"ruleId":"D2","level":"warning","message":{"text":"chrome_cookies._extract_chromium_cookies_macos (cognitive 52): chrome_cookies._extract_chromium_cookies_macos has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (34 pts), error handling 7 (9 pts), ternaries 1 (5 pts), boolean chains 3, loops 1 (nesting depth added 24). 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/last30days/scripts/lib/chrome_cookies.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b689afa2ee366d56fca04868c258dc375b8701cebef717dee7848b39cae5329"}},{"ruleId":"D2","level":"warning","message":{"text":"polymarket.refetch_datum (cognitive 51): polymarket.refetch_datum has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 14, ternaries 6 (9 pts), loops 4 (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/last30days/scripts/lib/polymarket.py"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e20ed2658df9769f51f12bb7537b929aad183af5f6e587ace36be8c3485d070"}},{"ruleId":"D2","level":"warning","message":{"text":"freshness.extract_claims (cognitive 50): freshness.extract_claims has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (30 pts), boolean chains 9, ternaries 2 (7 pts), loops 2 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/freshness.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b531886347b984d14977a8790f1c939d7380a567c4297b641557d1c57990476c"}},{"ruleId":"D2","level":"warning","message":{"text":"freshness.verify_report (cognitive 50): freshness.verify_report has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (34 pts), boolean chains 6, error handling 2 (5 pts), loops 3 (4 pts), ternaries 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/freshness.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafb4f312cd801a6642da89cb53dde5f2c1e9d01a6094f4a149154b5890d8cdf"}},{"ruleId":"D2","level":"warning","message":{"text":"ui.show_diagnostic_banner (cognitive 50): ui.show_diagnostic_banner has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (39 pts), boolean chains 8, ternaries 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/ui.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecba1e5d5cf716173d005aaf4a54312c87f2560df9ae58cd952ab2adeb147164"}},{"ruleId":"D2","level":"warning","message":{"text":"youtube_yt.search_youtube_sc (cognitive 50): youtube_yt.search_youtube_sc has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 18, loops 3 (5 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/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d5ac745a6dea20365d63bdd00f60d368f07d23b97bd6dc512f9079142d2514"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor._x_record (cognitive 49): doctor._x_record has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (35 pts), boolean chains 12, ternaries 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/last30days/scripts/lib/doctor.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"b544c0d0c0d8ab6be4dd9286cd26ea6a03c6e77ad10066e7ad2dedb2a5e570b7"}},{"ruleId":"D2","level":"warning","message":{"text":"instagram.search_instagram (cognitive 48): instagram.search_instagram has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (37 pts), boolean chains 6, error handling 3 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/instagram.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74bc3477a97f4d3efd63a176a7b0925f70ee388d01f7c1762fe05419c34c686"}},{"ruleId":"D2","level":"warning","message":{"text":"render._meta_ads_footer_line (cognitive 48): render._meta_ads_footer_line has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 20, ternaries 3 (5 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/last30days/scripts/lib/render.py"},"region":{"startLine":3715}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17d08a47c4ada6463631c922d840fcbc6ebb85181b30dc97693094b6cba13b9"}},{"ruleId":"D2","level":"warning","message":{"text":"cluster._merge_entity_clusters (cognitive 47): cluster._merge_entity_clusters has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 7 (11 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/cluster.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b799fcab54df82cf37a07c1e59339f75d77b6b25bf05e4f775def977f6431de"}},{"ruleId":"D2","level":"warning","message":{"text":"env.extract_browser_credentials (cognitive 47): env.extract_browser_credentials has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (27 pts), error handling 4 (11 pts), loops 3 (5 pts), boolean chains 4 (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/last30days/scripts/lib/env.py"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"36436bb3002c1ce3698f0f78e3f7a20585accb748faf34a3afcc1c6b7a260504"}},{"ruleId":"D2","level":"warning","message":{"text":"last30days._cache_research_options (cognitive 46): last30days._cache_research_options has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 10, ternaries 1 (4 pts), error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"882a1d2008c2f0fb29086b86fba49caa52724f72ebfe242e63db0dffa5c5740d"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus.search (cognitive 46): corpus.search has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (28 pts), error handling 2 (7 pts), boolean chains 4, loops 3 (4 pts), ternaries 2 (3 pts) (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/last30days/scripts/lib/corpus.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a062a62b19e6424088a271825f894e17bcfba13fddcfb7e6110b554ce1c13f3"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit.enrich_with_comments (cognitive 46): reddit.enrich_with_comments has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 4 (10 pts), ternaries 2 (6 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit.py"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0e8051d67a67c05122092b48a3fd0056986cfd7d0b410691d0358dbc3cdc4d"}},{"ruleId":"D2","level":"warning","message":{"text":"last30days._render_save_and_print (cognitive 45): last30days._render_save_and_print has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 10, loops 2 (5 pts), ternaries 2 (4 pts), error handling 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/last30days/scripts/last30days.py"},"region":{"startLine":2821}}}],"partialFingerprints":{"codehealthFindingId/v1":"044874fb1c19606ca9564fd6813d7d011e58a738aa01f3c0a9c81d5376765b03"}},{"ruleId":"D2","level":"warning","message":{"text":"grok_x.search_x (cognitive 45): grok_x.search_x has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 11, loops 3 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/grok_x.py"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"4648aa69cfe27bbde51d0176a3dfc88d563408e3405f01677503628150082200"}},{"ruleId":"D2","level":"warning","message":{"text":"html_render._markdown_to_html (cognitive 45): html_render._markdown_to_html has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 3 (7 pts), ternaries 2 (6 pts), boolean chains 4 (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/last30days/scripts/lib/html_render.py"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"8956f355d39db0b034513a6d5db179317bf8a0a2af1a7ced5b0e8c1125555ede"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._search_jobs_lane (cognitive 45): pipeline._search_jobs_lane has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 13, loops 2 (5 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":4121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd165dc178462f9a5fc6bccdb127f730db1977d8df8497bfc914ec6ba068a940"}},{"ruleId":"D2","level":"warning","message":{"text":"bird_x.parse_bird_response (cognitive 44): bird_x.parse_bird_response has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 9, error handling 2 (7 pts), ternaries 3 (5 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/last30days/scripts/lib/bird_x.py"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"095e7bcbcfbc98962534b1853e77dac5d54c9d61ddd95565e4e3a0b004e8a384"}},{"ruleId":"D2","level":"warning","message":{"text":"last30days._run_drill (cognitive 43): last30days._run_drill has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 12, ternaries 11, error handling 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6a81f1bd029875c1a96c847a9c53c1667755ebf1cf14d4c2d4a8be3975de14"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit.search_reddit (cognitive 43): reddit.search_reddit has cognitive complexity 43 (threshold 15). Drivers by points: loops 11 (19 pts), if/else 12 (15 pts), ternaries 3 (5 pts), boolean chains 4 (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/last30days/scripts/lib/reddit.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d29498c3828963ec685f0a37a8b86be8c1e92f64c2e222388415f13647965d"}},{"ruleId":"D2","level":"warning","message":{"text":"render._render_stats (cognitive 43): render._render_stats has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (23 pts), ternaries 7 (19 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":3920}}}],"partialFingerprints":{"codehealthFindingId/v1":"b243232faf2ca6b3c186166db9fbffa7179d138e987ba328440dc713d83f522e"}},{"ruleId":"D2","level":"warning","message":{"text":"instagram.search_and_enrich (cognitive 42): instagram.search_and_enrich has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 5 (9 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/instagram.py"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f40643bfbd37cc25d6e70e723cd6bb5436f6b34c90e71deb5e9c3be2e68a74"}},{"ruleId":"D2","level":"warning","message":{"text":"planner._trim_subqueries_for_depth (cognitive 42): planner._trim_subqueries_for_depth has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 4 (8 pts), boolean chains 4 (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/last30days/scripts/lib/planner.py"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0c3d25d564abfbb44f13fb6c2cc919f830cd668b3bd5ecc3e5cac8bdb297af"}},{"ruleId":"D2","level":"warning","message":{"text":"youtube_yt.fetch_transcript (cognitive 41): youtube_yt.fetch_transcript has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 6, error handling 2 (4 pts), ternaries 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/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0da8dc03fd05725692136e54a4543a4c7eac7b3c09942742f8fe714877d548"}},{"ruleId":"D2","level":"warning","message":{"text":"bird_x.search_x (cognitive 40): bird_x.search_x has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (28 pts), ternaries 5 (7 pts), boolean chains 5 (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/last30days/scripts/lib/bird_x.py"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"051808b498b821aa23391bf75f845161e0ccbf0105c035a431fcddd558f8d2a4"}},{"ruleId":"D2","level":"warning","message":{"text":"permission_preflight.render_text (cognitive 40): permission_preflight.render_text has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 16, loops 3 (5 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/permission_preflight.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"862d336bc24e43ae762c9ebcc5eba8961b416dd6c317c537df66cc50fda4c11a"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._retry_thin_sources (cognitive 40): pipeline._retry_thin_sources has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 5, loops 4 (5 pts), error handling 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":5580}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e1c0ef768ff9554f032d1b51d2aedf3f78534c9a5b0aa1597f5653fac951f4"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._retrieve_stream (cognitive 40): pipeline._retrieve_stream has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 16, ternaries 1 (3 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":5922}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1004679dc97d4a2b6de9a5174a071315b071349099a36adf024a68c5cf8594"}},{"ruleId":"D2","level":"warning","message":{"text":"render._amazon_footer_line (cognitive 40): render._amazon_footer_line has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 12, ternaries 2 (4 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":3577}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c0e4e49ec29824d6354c5894dd81e48a67681684008ecd01f6ad8b458307ab"}},{"ruleId":"D2","level":"warning","message":{"text":"parallel_mcp.search (cognitive 39): parallel_mcp.search has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 8, error handling 3 (6 pts), ternaries 3 (6 pts), loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/parallel_mcp.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c006b589c83459a457f08ddf36fd6271374f382dbc795b84e9440af5171bda3d"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.nominate_topic_pool (cognitive 39): pipeline.nominate_topic_pool has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 7 (14 pts), loops 5 (6 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"1440f25df22ac10e99d0f391995911f55eec4cb504cbe7c6696620bcdbfebecb"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.merge_drill_report (cognitive 39): pipeline.merge_drill_report has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 6 (7 pts), boolean chains 5, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":3391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cfa8a2832a382e165aafb7d3a9bfb7244316b966966c529ff9564d0f97ddf8"}},{"ruleId":"D2","level":"warning","message":{"text":"setup_wizard.run_auto_setup (cognitive 39): setup_wizard.run_auto_setup has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (18 pts), error handling 3 (10 pts), boolean chains 5, loops 2 (5 pts), ternaries 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ec0c055cd959cfcbdf43c9939569eb363e0d014c861dcfaafde7c23501425f"}},{"ruleId":"D2","level":"warning","message":{"text":"tiktok.search_and_enrich (cognitive 38): tiktok.search_and_enrich has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 6 (13 pts), boolean chains 5, error handling 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/tiktok.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"9904303b09221d83616963e121116fc18feb07d154b7ae50b1b037b859b7d8cb"}},{"ruleId":"D2","level":"warning","message":{"text":"youtube_yt._fetch_transcript_ytdlp (cognitive 38): youtube_yt._fetch_transcript_ytdlp has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (26 pts), error handling 2 (4 pts), ternaries 3 (4 pts), boolean chains 3, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"8766ece84c2fbac93f22072411613945c6ed1c4980ef2e9838df2ef3cdb9b5f8"}},{"ruleId":"D2","level":"warning","message":{"text":"grok_x.parse_x_response (cognitive 37): grok_x.parse_x_response has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 4 (8 pts), boolean chains 5, loops 2 (4 pts), 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/last30days/scripts/lib/grok_x.py"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb7a4625ed0afe45e50ab516df8a9b53f3b60a5137a280f44cd19f55d1350a5"}},{"ruleId":"D2","level":"warning","message":{"text":"jobs._probe_boards (cognitive 37): jobs._probe_boards has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (26 pts), error handling 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs.py"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5274af5afc70a993aa573ef7375858d138329fa7af833265f37130fd68f89366"}},{"ruleId":"D2","level":"warning","message":{"text":"youtube_yt._search_and_transcribe (cognitive 37): youtube_yt._search_and_transcribe has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 7, loops 3 (4 pts), ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9afde09728d2dfe12d10e0b59004258f26442be8b9006a1352477c4644a7ba3"}},{"ruleId":"D2","level":"warning","message":{"text":"bird_x._run_bird_search_once (cognitive 36): bird_x._run_bird_search_once has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/bird_x.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e3ffbe8ce842ce563cac56ddf64d73ddbc03c144ce1e829b74ed9d1b06de56"}},{"ruleId":"D2","level":"warning","message":{"text":"planner.validate_external_plan (cognitive 36): planner.validate_external_plan has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 11, loops 5 (6 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/last30days/scripts/lib/planner.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"555e4f5773c53093b6999bf7f45030c8db8b18cfaf49768a55e06b572d1e7658"}},{"ruleId":"D2","level":"warning","message":{"text":"providers.extract_openai_text (cognitive 36): providers.extract_openai_text has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (25 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/providers.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a08d1e532b005322d694fe8318a39f13592fec251d03f22001dc5f78530655"}},{"ruleId":"D2","level":"warning","message":{"text":"render._jobs_digest_block (cognitive 36): render._jobs_digest_block has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 13, ternaries 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":2481}}}],"partialFingerprints":{"codehealthFindingId/v1":"6117870a964dbda7db89d20dd2846f3916e1dd8bcf9c44dbe06b72234cad689d"}},{"ruleId":"D2","level":"warning","message":{"text":"x_api._search_pages (cognitive 36): x_api._search_pages has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 9, loops 2 (3 pts), error handling 1 (2 pts), ternaries 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/last30days/scripts/lib/x_api.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a914f4d15c1f4098145f47d5821de86bdddb1e503ebc547e464818ec1f42a40"}},{"ruleId":"D2","level":"warning","message":{"text":"planner.build_drill_plan (cognitive 35): planner.build_drill_plan has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 7 (12 pts), boolean chains 4, ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/planner.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"24777b109744637ddf265d12335567a39f5cf36d113a5251d640c5f8b0bd4538"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_arctic.fetch_scores (cognitive 35): reddit_arctic.fetch_scores has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (22 pts), error handling 2 (5 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit_arctic.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a89b2e0428698a8a765e4ae20fa4e7fa17ca6a4d2ab775be82b18de94e6e8d"}},{"ruleId":"D2","level":"warning","message":{"text":"jobs._read_board (cognitive 34): jobs._read_board has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 6, ternaries 2, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee398b73f00eee6a8275b121460b4c6639eaeeca783008b67b8e846c4fdfb80"}},{"ruleId":"D2","level":"warning","message":{"text":"render.render_compact (cognitive 34): render.render_compact has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20 (26 pts), loops 1 (3 pts), ternaries 3, boolean chains 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea0ab2563d4b93b22d878177e4a22a0bb831b965294c062ed88b1ed17904ac3"}},{"ruleId":"D2","level":"warning","message":{"text":"render._render_candidate (cognitive 34): render._render_candidate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 6 (11 pts), boolean chains 7, loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":2620}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d73d2639926ee1570a04c27884d7bf9e0f960f4de36e25f77176347748722f"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.without_sources (cognitive 34): schema.without_sources has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (28 pts), loops 4, 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/last30days/scripts/lib/schema.py"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6f92d229a77c38ff2079316f001b9b846ba0795aebb39a20695e8b2be25267"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie_extract._try_firefox_dir (cognitive 33): cookie_extract._try_firefox_dir has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (25 pts), error handling 4 (6 pts), boolean chains 1, 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/last30days/scripts/lib/cookie_extract.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"671c071dd7efd9f4f2289936b142929b048a05122e6efa39230143369d6049d4"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.render_text (cognitive 33): doctor.render_text has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 13, ternaries 3 (4 pts), loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/last30days/scripts/lib/doctor.py"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04deda50c233dd332a604e38f42e7149a7858a22add4015a69f2e9b80f39be9"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_keyless._discover (cognitive 33): reddit_keyless._discover has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 5 (7 pts), boolean chains 2, ternaries 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit_keyless.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8feed62c760253e0927dae99a29133e40b40638c18d48d7594f1b77b0f3f2cae"}},{"ruleId":"D2","level":"warning","message":{"text":"last30days.save_output (cognitive 32): last30days.save_output has cognitive complexity 32 (threshold 15). Drivers by points: error handling 4 (10 pts), if/else 6 (10 pts), ternaries 6 (8 pts), boolean chains 2, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d8367e40925fe6b119ad59922a42ddc7a070ba551af77927fa281a5ed0d1c2"}},{"ruleId":"D2","level":"warning","message":{"text":"github.parse_github_response (cognitive 32): github.parse_github_response has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 13, if/else 7 (10 pts), ternaries 4 (8 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/github.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2aafc44f63cf4dd6c87cc36ba3e1d9102f998f6767ac61a85512803424c5484"}},{"ruleId":"D2","level":"warning","message":{"text":"permission_preflight.build (cognitive 32): permission_preflight.build has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 16, if/else 12 (14 pts), loops 1, ternaries 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/permission_preflight.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"453674349c46e98b8bb076ea828f727ba163e64365b3d606a884dd5cdc71e68d"}},{"ruleId":"D2","level":"warning","message":{"text":"youtube_yt.search_youtube (cognitive 32): youtube_yt.search_youtube has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 10, error handling 3, loops 1 (2 pts), ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bc211cb7dd386d1670b2baaa5e11f42f657dc5d5f03a6c0796aece51945ed5"}},{"ruleId":"D2","level":"warning","message":{"text":"arxiv.parse_arxiv_response (cognitive 31): arxiv.parse_arxiv_response has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 7, ternaries 4 (6 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/arxiv.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9088fe5d9d0e1706cfa0eab3da35c57108245e3946757d9cb4e7e7c673a8bc9"}},{"ruleId":"D2","level":"warning","message":{"text":"bird_x._run_bird_search (cognitive 31): bird_x._run_bird_search has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 3 (7 pts), boolean chains 4, 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/last30days/scripts/lib/bird_x.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa0a682354c43899eff2e70caae259b06e6b88640ab4c3838c126b76d7abae4"}},{"ruleId":"D2","level":"warning","message":{"text":"devto.search_devto (cognitive 31): devto.search_devto has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (7 pts), boolean chains 5, error handling 2 (4 pts), ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/devto.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cbc7edd5a8b6fcb70587664742ef7fcbb499b420847da33bd11653e51c9a13"}},{"ruleId":"D2","level":"warning","message":{"text":"instagram.fetch_captions (cognitive 31): instagram.fetch_captions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 4, error handling 1 (2 pts), loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/instagram.py"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bfc11702bb57ff88e2495402d1d69dacdd3d261ebc76155ed055f93952b4b5"}},{"ruleId":"D2","level":"warning","message":{"text":"parallel_mcp._read_response (cognitive 31): parallel_mcp._read_response has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (21 pts), ternaries 2 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/parallel_mcp.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e29280bb0ed03aaa08df0aaf1469d2ddbc9fee45595d4cb7b40ee91d9e7b78"}},{"ruleId":"D2","level":"warning","message":{"text":"perplexity.search (cognitive 31): perplexity.search has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (24 pts), error handling 5 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/perplexity.py"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfbc803633c4abcf4c9fb24a04dd4bcffa5feb38c092ae1a2d44be802380ed7"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._legacy_artifact_outcome (cognitive 31): pipeline._legacy_artifact_outcome has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":4790}}}],"partialFingerprints":{"codehealthFindingId/v1":"389e4152eee4cd51d3a909448aa6b3a5da53d7f20ab5ea415240ff223eb119d6"}},{"ruleId":"D2","level":"warning","message":{"text":"planner._fallback_plan (cognitive 31): planner._fallback_plan has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 10, loops 1 (3 pts), ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/planner.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26156a24adaaaf5a62a6c9bf2dea61d5c6b9658a8a416188d4f670770a084a2"}},{"ruleId":"D2","level":"warning","message":{"text":"render._render_resolved_entities_block (cognitive 31): render._render_resolved_entities_block has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 6 (13 pts), boolean chains 9, if/else 4 (8 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1542e8511aa06f48fa4934688ea14bd3788f326da62ea94cbab47f7eed7b54"}},{"ruleId":"D2","level":"warning","message":{"text":"x_api._run_handle_lanes (cognitive 31): x_api._run_handle_lanes has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (11 pts), boolean chains 7 (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/last30days/scripts/lib/x_api.py"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab95cde42adec33f8219cf456ef2d3ba8b4fbfd0f9b427e239da1483565152f"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.pythonCandidates (cognitive 31): engine.pythonCandidates has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 17). Of this number, 27 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/internal/engine/python.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc10221e5f5c53424e37a8c02a251e1aa9c3708a5adad262c1c160349f283520"}},{"ruleId":"D2","level":"warning","message":{"text":"last30days._load_last_report_cache (cognitive 30): last30days._load_last_report_cache has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 12, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"659b2bebc930f490e6ee8fae15e929648bca8d2efd91f2ef74d3cf811941d974"}},{"ruleId":"D2","level":"warning","message":{"text":"amazon.enrich_source_items (cognitive 30): amazon.enrich_source_items has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 10, loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/amazon.py"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88498503121d80e1ead50f480eec37f5ecf17c988980f344ffe957023cfae6e"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor._probe_source (cognitive 30): doctor._probe_source has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/doctor.py"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a981bea4b932d3146a7c6da9fa605f866e760924cb0f1694b11a8874f0a040"}},{"ruleId":"D2","level":"warning","message":{"text":"github.search_github (cognitive 30): github.search_github has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (5 pts), ternaries 2 (5 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/github.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2e51fcab3cb54250c79426d240e9842ccebdf4e95442a946e628481fdc3933"}},{"ruleId":"D2","level":"warning","message":{"text":"digg.parse_digg_response (cognitive 29): digg.parse_digg_response has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 5 (9 pts), boolean chains 7, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/digg.py"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c2ff5c9a037300df78b377a2b5dbd40435391941daff9de97591a960049882"}},{"ruleId":"D2","level":"warning","message":{"text":"discovery_handoff._parse_bundle_file (cognitive 29): discovery_handoff._parse_bundle_file has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 13, if/else 5 (7 pts), error handling 3 (4 pts), ternaries 3 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/discovery_handoff.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"827dff6ea30b4918edafa0c23f8b6c3e2532e8480253629feb7f2b37f2110ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor._chained_record (cognitive 29): doctor._chained_record has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 8 (15 pts), if/else 8 (11 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/doctor.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a1d90560f3fd2bb5aa13a00e75f4e0100f2025f17960de376b08dbbb71d6ad"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.render_postmortem_text (cognitive 29): doctor.render_postmortem_text has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, loops 3 (5 pts), ternaries 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/doctor.py"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"336f7a450488d4595e52bd72cbf91e87e92623f269d3d564430d238264977f61"}},{"ruleId":"D2","level":"warning","message":{"text":"fusion.merge_source_items (cognitive 29): fusion.merge_source_items has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 12, loops 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/last30days/scripts/lib/fusion.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a0057a11b1d74296c594fb3a5baa9756577e06247dff85e27cf3c3a1db9509"}},{"ruleId":"D2","level":"warning","message":{"text":"library._briefing_public_headline (cognitive 29): library._briefing_public_headline has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (6 pts), ternaries 3 (5 pts), boolean chains 4 (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/last30days/scripts/lib/library.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"9945cd1c7994f996b616529e9b6ce3ae5f65a5af374efdc07f013f8cfb27e5b2"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._floor_survivor_records (cognitive 29): pipeline._floor_survivor_records has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 5 (10 pts), boolean chains 3, 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7be45fac5439a6e18b94907c3d58fb3fd62b679d38497a3dba8327c1eea157"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.run_discover_resume (cognitive 29): pipeline.run_discover_resume has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (9 pts), ternaries 6 (8 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44194882cd721384124a948f9960efc88fe0454673794d74e45d3ce22006dab"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_listing.fetch_discovery_listings (cognitive 29): reddit_listing.fetch_discovery_listings has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit_listing.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"777df7626d8d14953845848979d826778bdaf6c45655ba2630f0b2b7fff27ce1"}},{"ruleId":"D2","level":"warning","message":{"text":"topic_shape._entity_phrase (cognitive 29): topic_shape._entity_phrase has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 7, loops 4 (6 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/topic_shape.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0184b802d45bf452e220f44bad72653ae0c93d84ddb65ed55b0a98cc241aa350"}},{"ruleId":"D2","level":"warning","message":{"text":"trustpilot.search_trustpilot (cognitive 29): trustpilot.search_trustpilot has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 10, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/trustpilot.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd74a8870f6af5f77a6570b79d741a2aba18faab5254a0c71a498203de228fa"}},{"ruleId":"D2","level":"warning","message":{"text":"trustpilot.parse_trustpilot_response (cognitive 29): trustpilot.parse_trustpilot_response has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 14, if/else 9, ternaries 5 (6 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/trustpilot.py"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"631028d3a0a997260dc2ad0548f4da52c726bcaa527c9d0c0397a9598c7c84db"}},{"ruleId":"D2","level":"warning","message":{"text":"backends._resolve_alternative (cognitive 28): backends._resolve_alternative has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 6, loops 2, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/backends.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cd3cd959df28b3cf60e2ebb722973a74d55aea83bdc4dbe97047042c25cdbe"}},{"ruleId":"D2","level":"warning","message":{"text":"_WSConn.recv_message (cognitive 28): _WSConn.recv_message has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/chrome_cdp.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d0599fb1c7d48db5a9d5c1a8c6ea2721dc7c8c7f1d08366eaaa415bf2d3b8e"}},{"ruleId":"D2","level":"warning","message":{"text":"linkedin.parse_linkedin_response (cognitive 28): linkedin.parse_linkedin_response has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 10, ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/linkedin.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"420b22c3d1534853fc69c1fcb6e18757eb04d2fd9a09581cfc39a081a9bc7766"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._serve_envelope_lanes (cognitive 28): pipeline._serve_envelope_lanes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, ternaries 3, 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":6048}}}],"partialFingerprints":{"codehealthFindingId/v1":"5728c201af62f8eb86f4fb2e67c8d2c5a13893541a51c54659cdfb83a8c7a073"}},{"ruleId":"D2","level":"warning","message":{"text":"tiktok.fetch_captions (cognitive 28): tiktok.fetch_captions has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 pts), error handling 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/tiktok.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"2252fb09b8a64f5931a036f85cfb1bd29124831b42669bd9167dd336672f1cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"x_envelope._ingest_row (cognitive 28): x_envelope._ingest_row has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 10, ternaries 3 (4 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/last30days/scripts/lib/x_envelope.py"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e60acf93ac3da865af344f29a93ac62ed5cbe0fa368b4ee9704f4f69c9693b1"}},{"ruleId":"D2","level":"warning","message":{"text":"store.findings_from_report (cognitive 28): store.findings_from_report has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 7, ternaries 3 (5 pts), loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/store.py"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e029d8744218c12693ceb6fb6183390d43911588f81eaa1cee30b40a3a1d97"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.resolvePythonWithCandidates (cognitive 28): engine.resolvePythonWithCandidates has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/internal/engine/python.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4d244fb025166f5024636e724f3f3f3aabb7f6710e60b4cff4e83405a365d3"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie_extract.extract_firefox_cookies (cognitive 27): cookie_extract.extract_firefox_cookies has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), error handling 4 (8 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/cookie_extract.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec01d4dab086d0a4ccdf2c748304eaa9563c1db454d3c80a9f0a6e4afb49646"}},{"ruleId":"D2","level":"warning","message":{"text":"grok_x._posts_from_json_value (cognitive 27): grok_x._posts_from_json_value has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/grok_x.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bb0d3bdbeb80b29cece2f7eb7153ee577fa6a280198d591375c8a60de24b0f"}},{"ruleId":"D2","level":"warning","message":{"text":"grok_x._run_query (cognitive 27): grok_x._run_query has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/grok_x.py"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3d1dcac6eedcf1b28696a26db849ddc663ec56dc65f00bbccf1842c84a6eb9"}},{"ruleId":"D2","level":"warning","message":{"text":"jobs.parse_workable_response (cognitive 27): jobs.parse_workable_response has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 15, if/else 6 (9 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs.py"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee97df3e29947359798367eb2054ce7e179854d8d0f68c8facda53ae64ce1b27"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize._normalize_amazon (cognitive 27): normalize._normalize_amazon has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 19, if/else 5, ternaries 3. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/normalize.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"639c5b694a2514b3084a0fc55756587617babe03a32801dae6a887abb9c541cc"}},{"ruleId":"D2","level":"warning","message":{"text":"perplexity._extract_agent_citations (cognitive 27): perplexity._extract_agent_citations has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/perplexity.py"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"5239ed11b48e8c3581ecc95c8e6c19853f5d5c7e99cea1e0aa9d24304bd7bf0c"}},{"ruleId":"D2","level":"warning","message":{"text":"perplexity._poll_agent_background (cognitive 27): perplexity._poll_agent_background has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 5, error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/perplexity.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"4421695ff2c4c79e0ce5ae1f4f70f9b6e99cf55e1b6eb8271b6893fa30668dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._load_library_context (cognitive 27): pipeline._load_library_context has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (9 pts), ternaries 4 (6 pts), loops 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":2160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f91489a746941bf4239488971f7a694055c0d94bec3f5ec4cfb290416559b5a"}},{"ruleId":"D2","level":"warning","message":{"text":"render.render_discovery (cognitive 27): render.render_discovery has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 3 (5 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"535aa87eff10e3d7e2d5ad356d46cfd5ed1e4abf5413f47675c88a5f259e60ba"}},{"ruleId":"D2","level":"warning","message":{"text":"rerank._candidate_haystack (cognitive 27): rerank._candidate_haystack has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 9, loops 4 (7 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/last30days/scripts/lib/rerank.py"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de99ab9c7414df8b528907c36f06efd0c559e6239eaf7ed40b27f7d238fd124"}},{"ruleId":"D2","level":"warning","message":{"text":"rerank._extract_comment_text_scored (cognitive 27): rerank._extract_comment_text_scored has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (5 pts), ternaries 2 (5 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/rerank.py"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"9593fea32139f8e107359144127a799e96fc5daa4e82b773bde1df66ea55819c"}},{"ruleId":"D2","level":"warning","message":{"text":"setup_wizard.get_setup_status_text (cognitive 27): setup_wizard.get_setup_status_text has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e89df42e37a0da53b5f34f0c7d11f112f5406af63b3537cd8100ff725bacc4"}},{"ruleId":"D2","level":"warning","message":{"text":"tiktok._parse_items (cognitive 27): tiktok._parse_items has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 4 (7 pts), boolean chains 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/last30days/scripts/lib/tiktok.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"be269f55d04ec0ca72358cc2c0fc4f0f5b3fb5778077852e438837675fe0abe1"}},{"ruleId":"D2","level":"warning","message":{"text":"xiaohongshu_api.search_feeds (cognitive 27): xiaohongshu_api.search_feeds has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 6 (8 pts), boolean chains 7, 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/last30days/scripts/lib/xiaohongshu_api.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fc18ed3650b70d0d1d48c4943ef65e43bf1dabd5d14da387cd4895fda75efc"}},{"ruleId":"D2","level":"warning","message":{"text":"last30days._company_for_jobs (cognitive 26): last30days._company_for_jobs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 7, loops 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b66ca46468566f44dd10880a8589b5b6a8e0ef879959f24d7344539bbac102"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie_extract._extract_firefox_with_source (cognitive 26): cookie_extract._extract_firefox_with_source has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), error handling 4 (8 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/cookie_extract.py"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"06674784cc38aab80270c796d3291e7dc29768e1e514773b1c107e36daa529e7"}},{"ruleId":"D2","level":"warning","message":{"text":"env._load_keychain (cognitive 26): env._load_keychain has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 2 (5 pts), loops 2 (4 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/last30days/scripts/lib/env.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"a964182e2313e1360b40ac6b1798f4edbac2a30ad4b11b55bf451ca87fe89129"}},{"ruleId":"D2","level":"warning","message":{"text":"freshness._newer_status_contradiction (cognitive 26): freshness._newer_status_contradiction has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/freshness.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"599d8e6d69c992bb11d5453d22ef294d3e93d28adafc960b3e3b569c81887335"}},{"ruleId":"D2","level":"warning","message":{"text":"jobs._search_jobs (cognitive 26): jobs._search_jobs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 8, ternaries 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/last30days/scripts/lib/jobs.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"4042d18ab1d155420f2795e2ffae8825c626626e25e56f140451657af43bd0d4"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize.normalize_source_items (cognitive 26): normalize.normalize_source_items has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4 (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/last30days/scripts/lib/normalize.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ff83137679ba52b25a18d93334e4a4dee945292271e4e2988d3f6d1f39afc0"}},{"ruleId":"D2","level":"warning","message":{"text":"patents._fetch (cognitive 26): patents._fetch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (5 pts), ternaries 3 (5 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/last30days/scripts/lib/patents.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f56eb47cb358cf1f6f96ee330f29ebb1b229172945df3df7dc54d15639ab14"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._apply_reddit_stream_keepers (cognitive 26): pipeline._apply_reddit_stream_keepers has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":3594}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c015cbc32a8ac1c5bc73464dbe72c0ba019a2dbb3cada72e6b4a6440eb8eb1b"}},{"ruleId":"D2","level":"warning","message":{"text":"planner._default_source_weights (cognitive 26): planner._default_source_weights has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (10 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/last30days/scripts/lib/planner.py"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3af758fb8f61ff48977d783e9367f6823799c90535709d416bcad5aa3ed752"}},{"ruleId":"D2","level":"warning","message":{"text":"relevance.token_overlap_relevance (cognitive 26): relevance.token_overlap_relevance has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (5 pts), boolean chains 4, ternaries 1 (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/last30days/scripts/lib/relevance.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d443816645809792cf24ece060706846027ec4f5ff5eb8b4c81f272dd7d4d6a2"}},{"ruleId":"D2","level":"warning","message":{"text":"render._render_polymarket_markets (cognitive 26): render._render_polymarket_markets has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 10, ternaries 2 (4 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":4852}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4a11370e15d3c38627195d9789d2b933af68fbaed00068507cd7edeaf27053"}},{"ruleId":"D2","level":"warning","message":{"text":"chrome_cdp._pair_from_cookies (cognitive 25): chrome_cdp._pair_from_cookies has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (7 pts), boolean chains 4 (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/last30days/scripts/lib/chrome_cdp.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f30b64ff80042bf07449b03abe183940d750e5f7079711948864595ebea39ed"}},{"ruleId":"D2","level":"warning","message":{"text":"fusion._diversify_pool (cognitive 25): fusion._diversify_pool has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/fusion.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f8119dabf4ff72c5a661aea442dbfbf3e07654c8fe7f0ada883e03b3c42f32"}},{"ruleId":"D2","level":"warning","message":{"text":"github.apply_star_map (cognitive 25): github.apply_star_map has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 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/last30days/scripts/lib/github.py"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"701581a02c0acb8c8b0f582e32c5f8af488de45f628468609d7f06cd9925f108"}},{"ruleId":"D2","level":"warning","message":{"text":"meta_ads.search_meta_ads (cognitive 25): meta_ads.search_meta_ads has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 9, loops 2 (3 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/meta_ads.py"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fbf77f57de86c1fe30a1522e3adfaa3f92fd79a2c445e3162dc1b5c73f0db6"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize._normalize_meta_ads (cognitive 25): normalize._normalize_meta_ads has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 19, if/else 4, ternaries 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/normalize.py"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee86072dc8db10718690644faf8835f5cdf487cc4cd2bc3b84f4038cbcd20372"}},{"ruleId":"D2","level":"warning","message":{"text":"resolve._extract_official_domain (cognitive 25): resolve._extract_official_domain has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/resolve.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3788ea1d6a2adf1f985f7166b8abc1a50f3431e3dffdcf2c75ae87b35bb161b"}},{"ruleId":"D2","level":"warning","message":{"text":"stocktwits.parse_stocktwits_response (cognitive 25): stocktwits.parse_stocktwits_response has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 14, ternaries 5 (10 pts), loops 1 (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/stocktwits.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1a59c5188aeeaae8a7258d99fbad92b934de969e5ffece1fa8729c408142e5"}},{"ruleId":"D2","level":"warning","message":{"text":"jobs_digest.add_engine_roles (cognitive 24): jobs_digest.add_engine_roles has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 3, ternaries 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs_digest.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1a3569031f8f43820998f3113e9c441ec083e12cec5131f55b8330bdc9e556"}},{"ruleId":"D2","level":"warning","message":{"text":"patent_digest.digest_lines (cognitive 24): patent_digest.digest_lines has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 4 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/patent_digest.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77417b2e9900a48f75d4ca200044bc801745715fe7f1a5544abab4f5fbd62ab"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_arctic.fetch_post_comments (cognitive 24): reddit_arctic.fetch_post_comments has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 8, error handling 2 (3 pts), ternaries 2 (3 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/last30days/scripts/lib/reddit_arctic.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b7fe8b82409fe3e947d482e567f06f58983d58c78766c99346a0d5a1445de7"}},{"ruleId":"D2","level":"warning","message":{"text":"youtube_yt._fetch_video_comments (cognitive 24): youtube_yt._fetch_video_comments has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 6, ternaries 1 (3 pts), error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"0441e802a45eae38919690fbc4ad6bed032058694d24d893803b626cb0c10e5f"}},{"ruleId":"D2","level":"warning","message":{"text":"last30days._run_library_feed (cognitive 23): last30days._run_library_feed has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 2 (4 pts), loops 3, boolean chains 2, ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":3419}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee95b895574bf218f22358ded06377443f58602b4bf19d421267e3b02dba91b"}},{"ruleId":"D2","level":"warning","message":{"text":"arxiv._extract_entries (cognitive 23): arxiv._extract_entries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (23 pts) (nesting depth added 13). 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/last30days/scripts/lib/arxiv.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ed21f69d98eeb60ce0a56c3f1691d33d39d71c499d96ea270b89e970db79f0"}},{"ruleId":"D2","level":"warning","message":{"text":"dripstack.parse_dripstack_response (cognitive 23): dripstack.parse_dripstack_response has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 13, if/else 3 (5 pts), error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/dripstack.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e33b4e8514deb78fad9b723577a2f8c814ebd2819136e59bf8a41709ac636be"}},{"ruleId":"D2","level":"warning","message":{"text":"env.get_x_source_status (cognitive 23): env.get_x_source_status has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/env.py"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"0972b3f0504751f54078337321dc55ec480171de4da94abc574990cdc2f5b47d"}},{"ruleId":"D2","level":"warning","message":{"text":"github.search_github_project (cognitive 23): github.search_github_project has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), ternaries 1 (4 pts), error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/github.py"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a960af703f0adb7167913c22ebfa47a72d3018a63b919c0bc86bbbb74a98b1e"}},{"ruleId":"D2","level":"warning","message":{"text":"jobs.search_board_url (cognitive 23): jobs.search_board_url has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, ternaries 5 (7 pts), error handling 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/last30days/scripts/lib/jobs.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47a182555dcb312b46e50d043f2309b775bd890495230454a63dcc26363a8c9"}},{"ruleId":"D2","level":"warning","message":{"text":"jobs.parse_smartrecruiters_response (cognitive 23): jobs.parse_smartrecruiters_response has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, ternaries 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs.py"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e04d72363ff7fe8d74c1670584848d0fd3179299baf8a80edf4e38003a1c909"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_enrich.parse_thread_data (cognitive 23): reddit_enrich.parse_thread_data has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit_enrich.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdbbf5610bb1254d7ccbb6038d7f670e6510e6ba242089cc5adf4cde14f9c69"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_search.parse_page (cognitive 23): reddit_search.parse_page has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 5, if/else 3 (5 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit_search.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4643ab1ad88a7ea87838c04db0e8e422cd09edc2894c8a3f493ee30180710703"}},{"ruleId":"D2","level":"warning","message":{"text":"telegram._fetch_channel_posts (cognitive 23): telegram._fetch_channel_posts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/telegram.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"013fdebf931aa041b16f28d4941ef17b4341d2f215ca57420d9d238759eb3702"}},{"ruleId":"D2","level":"warning","message":{"text":"threads._parse_items (cognitive 23): threads._parse_items has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 13, if/else 4 (7 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/threads.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"547bcac0e97f73c8dabe2b39fc106d0d7fbc8f88b40984e87902537701c9e66f"}},{"ruleId":"D2","level":"warning","message":{"text":"last30days.subrun_kwargs_for (cognitive 22): last30days.subrun_kwargs_for has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 9 (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/last30days/scripts/last30days.py"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8cf97e8e64058e21eeaf0db0f392c10a57514ce1f65cb3cdf2677ae95abbcb"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch_memo.fetch_once (cognitive 22): fetch_memo.fetch_once has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, error handling 1, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/fetch_memo.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a54239be0e6188b80ebf48d346ad7255d0e8987d152c49fa64c56794de1433d"}},{"ruleId":"D2","level":"warning","message":{"text":"instagram._fetch_post_comments (cognitive 22): instagram._fetch_post_comments has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (7 pts), ternaries 2 (4 pts), error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/instagram.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4e5dedc46912df9f23f90a4ba23b8133d8e90bf46d61fee13a17447c55d3b9"}},{"ruleId":"D2","level":"warning","message":{"text":"perplexity._output_text (cognitive 22): perplexity._output_text has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/perplexity.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"30eac0ba107ca265a85be7ddaefdd3894a753f97dfe81bec1085625ba1374082"}},{"ruleId":"D2","level":"warning","message":{"text":"planner._how_to_sources (cognitive 22): planner._how_to_sources has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/planner.py"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1caa712f5ef5197253c04ef4fed25da2ae23b02c5e817eec65a711aab15a6d3"}},{"ruleId":"D2","level":"warning","message":{"text":"polymarket._compute_text_similarity (cognitive 22): polymarket._compute_text_similarity has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (8 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/polymarket.py"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5f2f2a1cc6fe032509b7e6912d33da286de898b4a204118dd4f68967c3dbed"}},{"ruleId":"D2","level":"warning","message":{"text":"quality_nudge.compute_quality_score (cognitive 22): quality_nudge.compute_quality_score has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 9, ternaries 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/last30days/scripts/lib/quality_nudge.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c18b59fdeb2480fdcc5644e3625184a6c6e5faad3a55ffff2bc5f605010a614"}},{"ruleId":"D2","level":"warning","message":{"text":"render._render_registered_sections (cognitive 22): render._render_registered_sections has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"6569821f45eddda0b7c5ea57849893e469997ae3819c7ef25841afa1028ef6d8"}},{"ruleId":"D2","level":"warning","message":{"text":"render.render_context (cognitive 22): render.render_context has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, loops 2 (3 pts), ternaries 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/last30days/scripts/lib/render.py"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4914b068e65a173b7a13254c3e253769123d438d7e9b227fec82d092363ceee"}},{"ruleId":"D2","level":"warning","message":{"text":"setup_wizard.write_setup_config (cognitive 22): setup_wizard.write_setup_config has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, loops 1 (2 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88845d54cac555a393f5f369e12da7ee1a14215ca60c2856c6936970425bfcf"}},{"ruleId":"D2","level":"warning","message":{"text":"setup_wizard.poll_device_auth (cognitive 22): setup_wizard.poll_device_auth has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 2 (4 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef15480c492906134b054b18dbafe2e627fb50ab47f227e27e930de992e9e78"}},{"ruleId":"D2","level":"warning","message":{"text":"tiktok._fetch_post_comments (cognitive 22): tiktok._fetch_post_comments has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 8, if/else 3 (6 pts), error handling 3 (5 pts), 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/last30days/scripts/lib/tiktok.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20df4b43e7afbb5b3f6c0a79b4c7c66b7337d217344f0e8b2276797673b1027"}},{"ruleId":"D2","level":"warning","message":{"text":"youtube_yt._fetch_transcript_direct (cognitive 22): youtube_yt._fetch_transcript_direct has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), error handling 3, loops 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4f7fc143778ca534a78685751e867405998fd85af09a52f28ebe56a009fc6b"}},{"ruleId":"D2","level":"warning","message":{"text":"youtube_yt._fetch_transcripts_parallel (cognitive 22): youtube_yt._fetch_transcripts_parallel has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 3 (5 pts), loops 2 (3 pts), ternaries 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7c48646cb3e81618eda16d29eacf86773d986780aab73a2957f54c01e8df37"}},{"ruleId":"D2","level":"warning","message":{"text":"amazon.parse_search_response (cognitive 21): amazon.parse_search_response has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/amazon.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c47835d8aa569df38c5d7f9716d388ab81a70ecac66e769b15a80e48ac8a16f"}},{"ruleId":"D2","level":"warning","message":{"text":"chrome_cdp.read_x_cookies (cognitive 21): chrome_cdp.read_x_cookies has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/chrome_cdp.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75b1e0efa470a168168243e8900f644b8596031433e4730f8d64e6734f85e55"}},{"ruleId":"D2","level":"warning","message":{"text":"corpus._iter_files (cognitive 21): corpus._iter_files has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/corpus.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc6fc0cbbc2b7da01b8a1e6977bca88e59bdd9816a5b50a15b4ab7cf15f3ddb"}},{"ruleId":"D2","level":"warning","message":{"text":"digg.enrich_source_items (cognitive 21): digg.enrich_source_items has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, 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/last30days/scripts/lib/digg.py"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8a93a97c3ab8e7c2ae0e60864c7c578312d9a853f8a08e083f04a9ba03c897"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.load_run_evidence (cognitive 21): doctor.load_run_evidence has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, loops 1 (2 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/doctor.py"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a762ea1975d720578ce4782e9b9f94f9a2b1a3a50dd5f863b9ac3ec417ae5765"}},{"ruleId":"D2","level":"warning","message":{"text":"entity_extract.matches_person_identity (cognitive 21): entity_extract.matches_person_identity has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 8, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/entity_extract.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90ba9f6c9462b7ec0721440a1b58e1a672bc24ced11e3b6f1942647911834a6"}},{"ruleId":"D2","level":"warning","message":{"text":"jobs._resolve_careers_page (cognitive 21): jobs._resolve_careers_page has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs.py"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"7711641420926409abe6510cec4287fa4fdc072b8237dc105ef9109a7d199e14"}},{"ruleId":"D2","level":"warning","message":{"text":"jobs.extract_jsonld_jobs (cognitive 21): jobs.extract_jsonld_jobs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs.py"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4dcd738bab111d795072e33df3fd791fdf12540ba4d05549f179d74b78009f"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._fetch_x_backend (cognitive 21): pipeline._fetch_x_backend has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, ternaries 4 (6 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":5788}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ff6d9f8109eebb596cb81d1b5de8c0f357389d342801faaad100a69d0b6b51"}},{"ruleId":"D2","level":"warning","message":{"text":"render._polymarket_odds_line (cognitive 21): render._polymarket_odds_line has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":4811}}}],"partialFingerprints":{"codehealthFindingId/v1":"625eadd03d969a312a547721213ac4f1c99fb85a407429c94dfbb080dbb6955c"}},{"ruleId":"D2","level":"warning","message":{"text":"setup_wizard.write_api_key (cognitive 21): setup_wizard.write_api_key has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, loops 1 (2 pts), error handling 1 (nesting depth added 10). 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/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"c410ba1f7551b9ee4d866379c9fd3e84999dddc9822d6499ad05c1b1d2202f97"}},{"ruleId":"D2","level":"warning","message":{"text":"trustpilot._select_search_hit (cognitive 21): trustpilot._select_search_hit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, 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/last30days/scripts/lib/trustpilot.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d449980cc359c6aae822b95bc6f04c50163e54510cbedc429751b2c8428104bc"}},{"ruleId":"D2","level":"warning","message":{"text":"x_judge.judge_x_corpus (cognitive 21): x_judge.judge_x_corpus has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, ternaries 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/x_judge.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac57af40e660e281b88d65f0077f15458238ffa62664a6ad98785e6f5e588a45"}},{"ruleId":"D2","level":"warning","message":{"text":"yahoo_finance.attach_host_tickers (cognitive 21): yahoo_finance.attach_host_tickers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 1 (3 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/yahoo_finance.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"41676a750866f7110eabc3ca9736e3267eb257f8613d8e67af6312fd8307312d"}},{"ruleId":"D2","level":"warning","message":{"text":"youtube_yt._sc_fetch_transcript (cognitive 21): youtube_yt._sc_fetch_transcript has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 1 (2 pts), boolean chains 1, loops 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":2452}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fb3fdd819657c276f52280a708b8e73c236ff308a3de25b247c13598478b69"}},{"ruleId":"D2","level":"warning","message":{"text":"briefing.generate_daily (cognitive 20): briefing.generate_daily has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 3 (4 pts), error handling 1 (3 pts), ternaries 2 (3 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/briefing.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fef5f08d4ebfa857fd45cd803fb8635bd66bce105a7d437db39b4045ca46ffe"}},{"ruleId":"D2","level":"warning","message":{"text":"last30days._resolved_company (cognitive 20): last30days._resolved_company has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 3 (6 pts), boolean chains 4 (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/last30days/scripts/last30days.py"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13853a9e6cce879fc41472f017aba76e2de56e79cfa1737c593b5ad4a7e2af2"}},{"ruleId":"D2","level":"warning","message":{"text":"amazon.select_enrichment_targets (cognitive 20): amazon.select_enrichment_targets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 9, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/amazon.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d7c7321dcf23fd8b251ea3efeb7cd1eb0eccacdc0eb4d7a4fa7c5db7c52254"}},{"ruleId":"D2","level":"warning","message":{"text":"amazon.enrich_with_reviews (cognitive 20): amazon.enrich_with_reviews has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 2 (3 pts), loops 2, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/amazon.py"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ee49679434c5f9c8e1f2305b3c607b231d52d97029ec1b6f8f0b998fc0a21c"}},{"ruleId":"D2","level":"warning","message":{"text":"dedupe.dedupe_items (cognitive 20): dedupe.dedupe_items has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/dedupe.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f969497fa78f395aa234c3b641ec57e71bc28020544484c8c0a0bb5f91936b"}},{"ruleId":"D2","level":"warning","message":{"text":"digg.apply_story_sources (cognitive 20): digg.apply_story_sources has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/digg.py"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e4c1948765c09a1804d75651dd6654a637df79fb44e6d8bd6f9a7ab938d7c5"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor._http_ok (cognitive 20): doctor._http_ok has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, error handling 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/doctor.py"},"region":{"startLine":1987}}}],"partialFingerprints":{"codehealthFindingId/v1":"3797de3c51aa555feb1667ce84522d2f677966492f3512526f2f892d446c0897"}},{"ruleId":"D2","level":"warning","message":{"text":"grok_x._fields_from_json_obj (cognitive 20): grok_x._fields_from_json_obj has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 13, if/else 5, ternaries 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/grok_x.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"9528e95cfa41d548d852c16fa270b133db3fd2bef174cc1a2604e254f847a980"}},{"ruleId":"D2","level":"warning","message":{"text":"instagram._normalize_google_post (cognitive 20): instagram._normalize_google_post has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 13, if/else 6 (7 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/instagram.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db46b50b8611e776772b21c96fa7b6e974a35913b962c817219d99b00cff48d"}},{"ruleId":"D2","level":"warning","message":{"text":"jobs._greenhouse_job_to_item (cognitive 20): jobs._greenhouse_job_to_item has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 15, if/else 3, ternaries 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs.py"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c937906e7ed426417fd7ac76ad4bb1dc9944d42e6d0f4c3665522dee9830fcc"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize._remap_comments (cognitive 20): normalize._remap_comments has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, error handling 1 (3 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/normalize.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c855868daca6f8784b5753bd343d83aea1443815acba611340733873b59566"}},{"ruleId":"D2","level":"warning","message":{"text":"pinterest._parse_items (cognitive 20): pinterest._parse_items has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (7 pts), ternaries 2 (4 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/last30days/scripts/lib/pinterest.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6456557389ccc1a87a61c25b2469bf0979c299019b7356220bb02a659f08d0"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._best_community_comment (cognitive 20): pipeline._best_community_comment has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c5db48c982bbe5643feea55da9df76da5f27526dd9f69f9bf7a3e14c59e563"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._engine_ranked_job_urls (cognitive 20): pipeline._engine_ranked_job_urls has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 3 (5 pts), loops 3 (5 pts), ternaries 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":4284}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff05090834c21f459dc1fa29222926040fbc471edabd2a17aeebb534413bb41"}},{"ruleId":"D2","level":"warning","message":{"text":"planner.build_discovery_plan (cognitive 20): planner.build_discovery_plan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, ternaries 2 (3 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/last30days/scripts/lib/planner.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf77734b4b52a704af6c6917de4ec54ce976d76160b1f7dbcc86a5e1e947b88"}},{"ruleId":"D2","level":"warning","message":{"text":"providers.resolve_runtime (cognitive 20): providers.resolve_runtime has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4 (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/last30days/scripts/lib/providers.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9398fb5574b06d7aca0c6eee7b985e66f3c66b7ea768b02e402c81f12d3918"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_keyless.enrich_source_items (cognitive 20): reddit_keyless.enrich_source_items has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, error handling 2 (3 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit_keyless.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0b543f93354ace2241d686e023f6e2cd9bfcb6cdbd4124f0053638acd7e0a3"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_public._fetch_json (cognitive 20): reddit_public._fetch_json has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit_public.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f023692cad4f0735812fb98e1e0ca4f8d38466fbc6f5d3a9ce055daa62ee7dce"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_public._parse_posts (cognitive 20): reddit_public._parse_posts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (6 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit_public.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"188830415b5ccb0a3fc4c236cff3393b6b411eda04fa4ce074685c191158fb49"}},{"ruleId":"D2","level":"warning","message":{"text":"stocktwits.detect_symbols (cognitive 20): stocktwits.detect_symbols has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 3, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/stocktwits.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cf82946c419afed1162bb02a0e3b053b738175695421b8ad124ff8d317e5be"}},{"ruleId":"D2","level":"warning","message":{"text":"stocktwits.refetch_datum (cognitive 20): stocktwits.refetch_datum has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 8, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/stocktwits.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"839081326093c79580c7fe8ffdfba072e2a657f1c2573eccf35b4f0ba54bf247"}},{"ruleId":"D2","level":"warning","message":{"text":"x_judge.promotable_handles (cognitive 20): x_judge.promotable_handles has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, 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/last30days/scripts/lib/x_judge.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fb23b60d5995239408f79593f19f5abf49e2f754d641ac2c9092cbaec5da9f"}},{"ruleId":"D2","level":"warning","message":{"text":"xquik._execute_search (cognitive 20): xquik._execute_search has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/xquik.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"129ac44f69fa0fcfa28a9ce500925855d447259bf13fa540921b443c073f142a"}},{"ruleId":"D2","level":"warning","message":{"text":"xquik.search_mentions (cognitive 20): xquik.search_mentions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, 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/last30days/scripts/lib/xquik.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfeb023f8fd91cdeff0b3d9d95d58996da42d0c4c7a9e18234fa061988a9cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"yahoo_finance._fetch_window_uncached (cognitive 20): yahoo_finance._fetch_window_uncached has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (6 pts), error handling 1, loops 1, ternaries 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/yahoo_finance.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1abcb558fc4cf76d3f49df3539145e9260f5c3eb8a0119159b9f7e773fa889"}},{"ruleId":"D2","level":"warning","message":{"text":"engine.reclaimCacheStages (cognitive 20): engine.reclaimCacheStages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/internal/engine/cache_staging.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81b131c6cc46ebf2c020aa2ed3ba3c026fe9e268da3b7f3a58068268584495b"}},{"ruleId":"D2","level":"warning","message":{"text":"bluesky.parse_bluesky_response (cognitive 19): bluesky.parse_bluesky_response has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 12, ternaries 3 (6 pts), loops 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/bluesky.py"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4ed2c27a32cd97a582b1fba63793da75788d2a15b03dec0f1c07df85361e8b"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie_extract.extract_cookies_with_source (cognitive 19): cookie_extract.extract_cookies_with_source has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/cookie_extract.py"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b44938eefc532ab9be6f285d8a74a40488715cb1d77a6ea048cfaf6deccf1af"}},{"ruleId":"D2","level":"warning","message":{"text":"devto.parse_devto_response (cognitive 19): devto.parse_devto_response has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 2 (5 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/devto.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcee225fbbeb3f87f8c7835d1216e145dc28a51527e9bdb64bce4fa29a764344"}},{"ruleId":"D2","level":"warning","message":{"text":"digg.tag_confirmed_candidates (cognitive 19): digg.tag_confirmed_candidates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/digg.py"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83ec8923be576f59235bf5c902a723a833cb6c2097494c1f116889ef89a21e2"}},{"ruleId":"D2","level":"warning","message":{"text":"env._parse_keychain_aliases (cognitive 19): env._parse_keychain_aliases has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), ternaries 1 (2 pts), error handling 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/last30days/scripts/lib/env.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b803025a606e971e54d0d888d3189cb7693c99482a1248a91c8d2b62094858"}},{"ruleId":"D2","level":"warning","message":{"text":"env.next_x_browser_pair (cognitive 19): env.next_x_browser_pair has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, ternaries 1 (2 pts), error handling 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/last30days/scripts/lib/env.py"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"2302d877df2a301dc5a67a2ce950e67bbb43e30d13da064d8d4e0351167f44de"}},{"ruleId":"D2","level":"warning","message":{"text":"hosted.run_hosted (cognitive 19): hosted.run_hosted has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, error handling 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/last30days/scripts/lib/hosted.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca2a6eab7ef09206aedda00a2d673b517f53002cccca9d16a2bc9b65f2d771f"}},{"ruleId":"D2","level":"warning","message":{"text":"normalize._normalize_jobs (cognitive 19): normalize._normalize_jobs has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 17, if/else 1, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/normalize.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7288bb16f43ddd18ecd4caf2ebef0f6a00001e31117c147c2a0f82c5c2780a"}},{"ruleId":"D2","level":"warning","message":{"text":"parallel_mcp._search_rows (cognitive 19): parallel_mcp._search_rows has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, error handling 1 (2 pts), loops 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/last30days/scripts/lib/parallel_mcp.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b7000962196ec60dc5bdf88b2db8ead8b79378a1b9bae99ce8379e1ef3c89f"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._normalize_score_dedupe (cognitive 19): pipeline._normalize_score_dedupe has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":3772}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc06bbcb2bbc961e6a26fcc55d02be6679b1098e22be04d3803f70a5c2c6761"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_search.search (cognitive 19): reddit_search.search has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, loops 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit_search.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2750cd1c3d2574d60a7b6763242ca6335b5809185de28fffb8149727faf6510a"}},{"ruleId":"D2","level":"warning","message":{"text":"render.render_library_search (cognitive 19): render.render_library_search has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (4 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58fd80afadcc38ed037cd793edc81c4922f8fbfd16bebb2e166f49572db1a27"}},{"ruleId":"D2","level":"warning","message":{"text":"report_checklist.build (cognitive 19): report_checklist.build has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/report_checklist.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d61c08bf2f80d352e5ef9c429d8d9dbd004200666066c4a1d87d6a586ed85f"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.to_agent_export (cognitive 19): schema.to_agent_export has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (6 pts), loops 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/last30days/scripts/lib/schema.py"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5bef7046e85aa08e06e13740957b59a45be452115a56f3c40dba813b8eb497"}},{"ruleId":"D2","level":"warning","message":{"text":"last30days.resolve_competitors_args (cognitive 18): last30days.resolve_competitors_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 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/last30days/scripts/last30days.py"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"454880b4c2befaaf33f070ea4489fefd4ce76e5a80990e1f6dd98027f2e6d235"}},{"ruleId":"D2","level":"warning","message":{"text":"cookie_extract._get_wsl_firefox_profiles_dir (cognitive 18): cookie_extract._get_wsl_firefox_profiles_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 3 (4 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/cookie_extract.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd20ee740f3d138cd389a46974ff1e1a18d6d6476c4020930c615cde14afd04a"}},{"ruleId":"D2","level":"warning","message":{"text":"discovery_handoff.build_host_digest (cognitive 18): discovery_handoff.build_host_digest has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/discovery_handoff.py"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f16dc20d06cfd952d65192dede7e2e6efaae4968164f2f9fc18c29845d27240"}},{"ruleId":"D2","level":"warning","message":{"text":"env.load_env_file (cognitive 18): env.load_env_file has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 5, error handling 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/last30days/scripts/lib/env.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0a00da702209c238ec5095e67a6c6576cde2deb857b0ac0b3590553284e0a3"}},{"ruleId":"D2","level":"warning","message":{"text":"freshness._candidate_star_claims (cognitive 18): freshness._candidate_star_claims has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/freshness.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3b225702879ebfcb4e3b68996a2bc2419c8201d027b89637a2ee9240535577"}},{"ruleId":"D2","level":"warning","message":{"text":"github._fetch_top_issues (cognitive 18): github._fetch_top_issues has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, ternaries 3 (7 pts), if/else 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/github.py"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2b14d858281d7439d61181ccc5b76706803df1df919476528648292c223a4f"}},{"ruleId":"D2","level":"warning","message":{"text":"github.extract_repo_refs (cognitive 18): github.extract_repo_refs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/github.py"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"6656a74cab387d7dc1e89b0dcec4d9c89ee7027ed83e5eb3254e50f4344e2580"}},{"ruleId":"D2","level":"warning","message":{"text":"grok_audit.resolve_native (cognitive 18): grok_audit.resolve_native has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (4 pts), boolean chains 3, error handling 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/last30days/scripts/lib/grok_audit.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12bdd7f5ad74f959634d3bbc78633e1fdc0af8cb449ac9cef7f61c77452cd1c"}},{"ruleId":"D2","level":"warning","message":{"text":"instagram._parse_items (cognitive 18): instagram._parse_items has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/instagram.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"288f4a4563f55114765fa77ada1f93c259aa1056c6764ccdca7b2c1509caf9a7"}},{"ruleId":"D2","level":"warning","message":{"text":"linkedin.parse_profile_articles (cognitive 18): linkedin.parse_profile_articles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/linkedin.py"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b52f6cb4d6e05e36fb73f047f314e7c1d0c5489a3cc4b652865a1f0fe033cdf"}},{"ruleId":"D2","level":"warning","message":{"text":"perplexity._append_citation (cognitive 18): perplexity._append_citation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 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/last30days/scripts/lib/perplexity.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21aa639b1f684b07c68cc8e48eb3748e8477ecc05bb1924974a664032add012"}},{"ruleId":"D2","level":"warning","message":{"text":"planner._comparison_entities (cognitive 18): planner._comparison_entities has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/planner.py"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8f98f04a34b050b2a5c81f8720c1bf65f53180b66636df47f7936dd564d09c"}},{"ruleId":"D2","level":"warning","message":{"text":"query.extract_core_subject (cognitive 18): query.extract_core_subject has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 3, loops 2 (3 pts), ternaries 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/query.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dba50717dcc0acd7bd28d4a10b1f3b07e14fb6d279f9fcaab1018869fa867f6"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_enrich.extract_comment_insights (cognitive 18): reddit_enrich.extract_comment_insights has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit_enrich.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e44ab6b2e81a1d883d51b783bc1bc445cab0c5a019728e500699a40fa0fe243"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_keyless.search_and_enrich (cognitive 18): reddit_keyless.search_and_enrich has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, ternaries 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, 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/last30days/scripts/lib/reddit_keyless.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ef46c67554b01b267a751521048e5f438cad33f59a4ddd9468884048748f5d"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_listing.parse_cards (cognitive 18): reddit_listing.parse_cards has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, error handling 2 (4 pts), ternaries 2 (4 pts), if/else 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/last30days/scripts/lib/reddit_listing.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"80aec2537f41bf395ccf1068caee36660a9422b84194505e5a49cfb446cfe214"}},{"ruleId":"D2","level":"warning","message":{"text":"render._render_entity_evidence_block (cognitive 18): render._render_entity_evidence_block has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a3c231940b88f632b6025abd033b0609252d028bbaa016148b814f545c838b"}},{"ruleId":"D2","level":"warning","message":{"text":"safari_cookies.extract_safari_cookies_macos (cognitive 18): safari_cookies.extract_safari_cookies_macos has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/safari_cookies.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"836c4377d8af43b7a8b56b4f3083e7e57371f9592525bb825fe084382cf4ab4b"}},{"ruleId":"D2","level":"warning","message":{"text":"safari_cookies._parse_binary_cookies (cognitive 18): safari_cookies._parse_binary_cookies has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (4 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/safari_cookies.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad063f7ea7d2e7cb6c7ca98d38f081d1162b56ef20e2f2e8b54c772f24f4e986"}},{"ruleId":"D2","level":"warning","message":{"text":"xquik.search_handles (cognitive 18): xquik.search_handles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, 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/last30days/scripts/lib/xquik.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c12df56e508fcb6f22b4b561e9cabf09c5b43051b5c83742f9b5b316a6ae139"}},{"ruleId":"D2","level":"warning","message":{"text":"youtube_yt.extract_transcript_highlights (cognitive 18): youtube_yt.extract_transcript_highlights has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc725b6421645e412df8b9df80a8b018b796aaa5d85c1bd95e8637ba23ab63d"}},{"ruleId":"D2","level":"warning","message":{"text":"store.store_findings (cognitive 18): store.store_findings has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 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/last30days/scripts/store.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcb06d9e53312b4364f840afab63a97e0def9a8fa2d04e945cf905142502d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"evaluate_search_quality.build_ranked_items (cognitive 17): evaluate_search_quality.build_ranked_items has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, loops 3 (5 pts), if/else 2 (4 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/evaluate_search_quality.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51c78e4471d51d5e947c54d3f33c32218d0838b5a056549f519f04f3a7fcea2"}},{"ruleId":"D2","level":"warning","message":{"text":"last30days._host_companies (cognitive 17): last30days._host_companies has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6d769c88b459c9b770ee620d222266b1f33883d71da21658341f983f634aca"}},{"ruleId":"D2","level":"warning","message":{"text":"cluster.cluster_candidates (cognitive 17): cluster.cluster_candidates has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 3 (6 pts), ternaries 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/cluster.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d590ecbf82cdec17928fdf39ec990650044ac0bd2948a4be21de5876d54601"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.run (cognitive 17): doctor.run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), error handling 3 (6 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/last30days/scripts/lib/doctor.py"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e76d5b4136a446c12032f950b7d40b040570cbf0cfbe746cdba6163eb2b6b5"}},{"ruleId":"D2","level":"warning","message":{"text":"dripstack.search_dripstack (cognitive 17): dripstack.search_dripstack has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 5, loops 1 (2 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/dripstack.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9177b6e332d741866a7b617dac64131d2c181ee68d03bb79bac8fa2e1c53ca05"}},{"ruleId":"D2","level":"warning","message":{"text":"github.refetch_datum (cognitive 17): github.refetch_datum has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (4 pts), boolean chains 3 (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/last30days/scripts/lib/github.py"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c0fad764e1f8b52de2c48a055b57c86a59fc9f53dbd04662e7373a7fac8043"}},{"ruleId":"D2","level":"warning","message":{"text":"grok_audit._check_restricted (cognitive 17): grok_audit._check_restricted has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/grok_audit.py"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb9ed11cef12323031854ff0d55f3f51aebafbd3c7fe183f086668905f86415"}},{"ruleId":"D2","level":"warning","message":{"text":"grok_x._invoke (cognitive 17): grok_x._invoke has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 5, boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/grok_x.py"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bacfe264f2a040befc0e6c68445b78edc9c275f5feb612321c2c9b010b7b4df"}},{"ruleId":"D2","level":"warning","message":{"text":"grounding.parallel_search (cognitive 17): grounding.parallel_search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 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/last30days/scripts/lib/grounding.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"689beaade09086f384fb084733a25aaceb1b982c1011bed26a22759e8b502969"}},{"ruleId":"D2","level":"warning","message":{"text":"perplexity._agent_result (cognitive 17): perplexity._agent_result has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, ternaries 2, 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/last30days/scripts/lib/perplexity.py"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"72808aff1bd6ccc80e079f41c375a93871ce19006dce219111dcdfdaa3b0e9da"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.nominate_candidates (cognitive 17): pipeline.nominate_candidates has cognitive complexity 17 (threshold 15). Drivers by points: error handling 2 (4 pts), loops 3 (4 pts), boolean chains 3, if/else 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"5010c38ebf86cf3485c18b0275fe5ea91c9079b0053ab53af2b56c95a52e3335"}},{"ruleId":"D2","level":"warning","message":{"text":"polymarket._extract_domain_queries (cognitive 17): polymarket._extract_domain_queries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/polymarket.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df931f7f9c3874ad6b56ffaef28624375d35c42015f4d910e63f5fdd10a7c5d"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_search._search_uncached (cognitive 17): reddit_search._search_uncached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), error handling 2 (3 pts), loops 3, ternaries 1 (3 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/last30days/scripts/lib/reddit_search.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"658094ea1930b890f08d31f8b966938f6c5c81c8e98cabea874dee15efdf41d9"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.report_from_dict (cognitive 17): schema.report_from_dict has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 14, if/else 2, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/schema.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2ce4fd20f2e45679a88b4da8e1389730fc943dd0884552986f13095f3cfa6e"}},{"ruleId":"D2","level":"warning","message":{"text":"techmeme.search_techmeme (cognitive 17): techmeme.search_techmeme has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/techmeme.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff1ab46579620b5bb5ef42d389a2f77cd4f564ced581b99093ededce6588121"}},{"ruleId":"D2","level":"warning","message":{"text":"x_api._run_search (cognitive 17): x_api._run_search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 3, error handling 2 (3 pts), ternaries 2 (3 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/last30days/scripts/lib/x_api.py"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3338f3d00cbe6164190a8bb33872adef8c9bc8acec786c9fc122ce44a8767ea"}},{"ruleId":"D2","level":"warning","message":{"text":"yahoo_finance._confirmed_symbol (cognitive 17): yahoo_finance._confirmed_symbol has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7 (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/last30days/scripts/lib/yahoo_finance.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abccf5308d226df974f75526fe754132cbdedc1296245a73c57a46cce301a72"}},{"ruleId":"D2","level":"warning","message":{"text":"youtube_yt.backfill_transcripts (cognitive 17): youtube_yt.backfill_transcripts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"451ae43d8af0de8c87d3c885b5334fe1dd02c6c7b3744ae042da249067dd0db7"}},{"ruleId":"D2","level":"warning","message":{"text":"youtube_yt._ytdlp_comments_result (cognitive 17): youtube_yt._ytdlp_comments_result has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (6 pts), error handling 2, loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe6c47fc0102e0cb9b045d5bb799c0c1580784849ce313f2e20828a85acee5a"}},{"ruleId":"D2","level":"warning","message":{"text":"last30days._validate_extra_argv (cognitive 16): last30days._validate_extra_argv has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 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/last30days/scripts/last30days.py"},"region":{"startLine":3343}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e613a70f33a8095cc9e991056b191a5758d7a2a6938068fd1a1730adb541dbc"}},{"ruleId":"D2","level":"warning","message":{"text":"bluesky.search_bluesky (cognitive 16): bluesky.search_bluesky has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/bluesky.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e69ea088bad6473778e8e6ae107c8eb73cb9047567967b2956f4ba9dd727f4"}},{"ruleId":"D2","level":"warning","message":{"text":"digg._invoke_cli (cognitive 16): digg._invoke_cli has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, error handling 4, boolean chains 2, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/digg.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca627bc2397a8163647823a6b89899571609712a909993383f093dbb7f24cf39"}},{"ruleId":"D2","level":"warning","message":{"text":"digg.apply_bar (cognitive 16): digg.apply_bar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/digg.py"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea11c15396dbac92bc198fa979324b8f1d8065ca942be1ef0e44549ae1baf0d"}},{"ruleId":"D2","level":"warning","message":{"text":"doctor.build_report (cognitive 16): doctor.build_report has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), error handling 2 (3 pts), loops 3, ternaries 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/doctor.py"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8380d63e410930f358c1fe211b6305d6b3dbfb3e7579cc289f2eedd029b3812"}},{"ruleId":"D2","level":"warning","message":{"text":"env.cookie_extraction_browsers (cognitive 16): env.cookie_extraction_browsers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/env.py"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c33e89ebb836933f735a425807102a4b59f7f7e92f151dbf9286bdc26155f32"}},{"ruleId":"D2","level":"warning","message":{"text":"grok_x._extract_json_values (cognitive 16): grok_x._extract_json_values has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 3 (5 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/grok_x.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"d524442bb927da50377f4b8e72f62465eef688fd69d52c09dd28f779f15754c7"}},{"ruleId":"D2","level":"warning","message":{"text":"grok_x.search_handles (cognitive 16): grok_x.search_handles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/grok_x.py"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"678e540bed9df1f97867558afdfabece032fce048520be13849f723dd9fb22c9"}},{"ruleId":"D2","level":"warning","message":{"text":"grounding.web_search (cognitive 16): grounding.web_search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/grounding.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67adeb87fcd3b5e7573f4b7e44b80b329c545bf626dbb2deb1b5a4d61fda2f6"}},{"ruleId":"D2","level":"warning","message":{"text":"grounding._enrich_reddit_items (cognitive 16): grounding._enrich_reddit_items has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/grounding.py"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"0922e85aefde1da457221e60840c21e83dc0e21e900edde7c63c2a72fd1c6556"}},{"ruleId":"D2","level":"warning","message":{"text":"jobs.parse_workday_response (cognitive 16): jobs.parse_workday_response has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, if/else 3 (5 pts), ternaries 3 (5 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs.py"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e862b58344b5119a912a60b8584df47b96ac494f7e56e2b65b1b1e4810369cf8"}},{"ruleId":"D2","level":"warning","message":{"text":"jobs_digest.build_digest (cognitive 16): jobs_digest.build_digest has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, if/else 2 (4 pts), ternaries 2 (4 pts), loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs_digest.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"5727980484dda2b29e07301620c92bafc4b93bb3bb3d894cb78642df360add05"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline._disambiguated_topic_name (cognitive 16): pipeline._disambiguated_topic_name has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"57762b7b9e604d8fa1f101e273f6783369085c6705d9501ed8345f2f08b16be0"}},{"ruleId":"D2","level":"warning","message":{"text":"polymarket._run_queries_parallel (cognitive 16): polymarket._run_queries_parallel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (6 pts), error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/polymarket.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a514676a611426bed8417aa71d314af71ede4ea584cba730f12b791a490802b"}},{"ruleId":"D2","level":"warning","message":{"text":"reddit_keyless._scored_listings (cognitive 16): reddit_keyless._scored_listings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 1 (3 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/last30days/scripts/lib/reddit_keyless.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa69853984e70165ffaa25a517c51ddefb861d55ab73fc265d95c1353107888"}},{"ruleId":"D2","level":"warning","message":{"text":"render._top_voices_footer_line (cognitive 16): render._top_voices_footer_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 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/last30days/scripts/lib/render.py"},"region":{"startLine":3822}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e9655dc97a072cb23b6e8e2efa45cbeaa9f98c2466b2ba78b347625b25fb62"}},{"ruleId":"D2","level":"warning","message":{"text":"render._render_subject_posts (cognitive 16): render._render_subject_posts has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (5 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":4683}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dfb319419f85fa9aff7a8888052b9d06ec75f68ac6faae7a1cda7d2699e774"}},{"ruleId":"D2","level":"warning","message":{"text":"render._polymarket_odds (cognitive 16): render._polymarket_odds has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 5, ternaries 2 (4 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":4771}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a3ea544a201f1989d0e1f1da102b75282f2cd35cc2d8760c0ff2cb705fe586"}},{"ruleId":"D2","level":"warning","message":{"text":"rerank._spelled_from_word_prefixes (cognitive 16): rerank._spelled_from_word_prefixes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/rerank.py"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"5581aa799feb81d0cca9bb94a5cb337d4a4f6a31d27e25f807c60e3bfa0c4604"}},{"ruleId":"D2","level":"warning","message":{"text":"rerank._extract_comment_text (cognitive 16): rerank._extract_comment_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 3 (5 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/rerank.py"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9db135cf591a5e333c27f085421f65c43e99a026db7e8695fc663dd70a85a76"}},{"ruleId":"D2","level":"warning","message":{"text":"techmeme.parse_techmeme_response (cognitive 16): techmeme.parse_techmeme_response has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/techmeme.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"beaae4ad4194acadb1885a2823eac556592e00886ee549281d7aa6159cfd7c0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/pipeline.py: FileTooLong \u2014 5180 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 4680 over it, 10.36\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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df55bad82521ef0c097f441a10458207e6757b834c79348afd8e08e4de5c9a7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/last30days.py: FileTooLong \u2014 3585 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3085 over it, 7.17\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/last30days/scripts/last30days.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"254ddad5ce8eead2c7879e5fe4acf32dd4bf6f190e1ca0a35e7c343ef0f04131"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/render.py: FileTooLong \u2014 3507 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3007 over it, 7.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/last30days/scripts/lib/render.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fc0b215c0fff912ab0ee37c3fb097f3b0b5b43100aebb0b7cb96dd0348057d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/youtube_yt.py: FileTooLong \u2014 1524 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1024 over it, 3.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f1fdeb768c018f8904dc815a4e92ba5ab1f7516a2c32cde886b8b73952787a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/doctor.py: FileTooLong \u2014 1423 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 923 over it, 2.85\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/last30days/scripts/lib/doctor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66bb3717c897b7b0c9dcdc33e73439b15cf04db3dc43012a18d7dd75820ffd76"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/jobs.py: FileTooLong \u2014 1418 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 918 over it, 2.84\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/last30days/scripts/lib/jobs.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef729af55c4cac2296365a3af4b6d0f25c5415ef373a324ec911e42459125988"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/env.py: FileTooLong \u2014 1121 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 621 over it, 2.24\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/last30days/scripts/lib/env.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"581a2dae07a045816ceea7165fecd4cca37dce9860f70709c8fb3b7c5cb079eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/perplexity.py: FileTooLong \u2014 1097 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 597 over it, 2.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/perplexity.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2e515a70e3e1e85dd9b7e6ff778ed05c8f10c2cbbb12a9838a3e9903fc5ace"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/http.py: FileTooLong \u2014 1057 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 557 over it, 2.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/http.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f459ca0389245884fec8626ab88c851170a81cf4f5fa4a89664efd52aadfa8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/github.py: FileTooLong \u2014 983 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 483 over it, 1.97\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/last30days/scripts/lib/github.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0791ab5a7d67678361b8178f652c95251b600e146dff1c47e0a2508c996944"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/store.py: FileTooLong \u2014 924 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 424 over it, 1.85\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/last30days/scripts/store.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06934d01c14f015e911aa85e381051536079e6e250a5754ad2e051b8f08599f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/polymarket.py: FileTooLong \u2014 903 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 403 over it, 1.81\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/last30days/scripts/lib/polymarket.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7281eea88a0aef1f982b6404eec7acf3d5bbf6aed8e67d68159208470c21b869"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/setup_wizard.py: FileTooLong \u2014 889 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 389 over it, 1.78\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/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f307f8ce665e58b46534ecb7a6edf089d6648c671fcfc217897220025afaf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/normalize.py: FileTooLong \u2014 880 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 380 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/normalize.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c1c75446e463d236d524b1899945acdf0927604339ba43405de21a199db3d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/digg.py: FileTooLong \u2014 839 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 339 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/digg.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0799df31cd5a4a858d3575b5f07761b9b26f1c9202206a37600eed1f09fa57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/grok_x.py: FileTooLong \u2014 836 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 336 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/grok_x.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa2e819e75155a3f9c6a66e9d2d22ea7fef05be811c6b1f3b3d369c92c555c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/schema.py: FileTooLong \u2014 779 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 279 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/last30days/scripts/lib/schema.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b91db826e48a2234e1e8e656b44f438d97abecc49c6be1d401611d669a62bad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/rerank.py: FileTooLong \u2014 743 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 243 over it, 1.49\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/last30days/scripts/lib/rerank.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7da4cd29a4fa4a9e8bba162f9f207dc537bc32245a4134eb8d89604d5f405a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/instagram.py: FileTooLong \u2014 708 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 208 over it, 1.42\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/last30days/scripts/lib/instagram.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a8818af08c3c15b7e4f017d65e9242c10fefb079736be77272f7f30a0b2daf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/discovery_handoff.py: FileTooLong \u2014 639 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 139 over it, 1.28\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/last30days/scripts/lib/discovery_handoff.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fb2732f79acdce99bd137c3b234ed49846ad79d1789228c41b63b01cbca9ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/planner.py: FileTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 137 over it, 1.27\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/last30days/scripts/lib/planner.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2baf40de4ff3dfb498a531ce04479a29b75248b5c0dca974a310c72ffa888e1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/html_render.py: FileTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 110 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/html_render.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6fdc98d057ee3833090e057125d9878e5adca3e0ada4a6e7b54bcb6c6cea2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/bird_x.py: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 109 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/bird_x.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd725d7d395127a6ba6ae543b628e0a859c24c0aef2fc68fe07079b613531ba9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/meta_ads.py: FileTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 66 over it, 1.13\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/last30days/scripts/lib/meta_ads.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b182e62b27e7b27bd1fb0ffbb06fcc93b58655d6fa7e166b3b2081ecd3cb32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/patents.py: FileTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 35 over it, 1.07\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/last30days/scripts/lib/patents.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15f985c7e6f870ed4f27fe4da646f41a8838d9e4f6f373cdcde50c0104328bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/x_envelope.py: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 30 over it, 1.06\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/last30days/scripts/lib/x_envelope.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2111a925e8e7937b58f2446463dbb6a374dad9ce8c1d63a55ee94b6fb173826b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/reddit.py: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 20 over it, 1.04\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/last30days/scripts/lib/reddit.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0579f68724fa36452f8cea77d022d929474852405d31a180cbc0f3940b1a9e4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/amazon.py: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2 over it, 1.00\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/last30days/scripts/lib/amazon.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"764df80065ebfa375662ef380ccd68a5c82bd4e96283ba570341e65d89857dbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/x_api.py: FileTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1 over it, 1.00\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/last30days/scripts/lib/x_api.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7666ff0b9146a8b1459b170a5b865cac17bf128197fd8c6878d43fabd7c5a284"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (46 shared lines): skills/last30days/scripts/lib/bird_x.py:770-860 | skills/last30days/scripts/lib/bird_x.py:873-957 \u2014 These two members are variants of one another: 46 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/bird_x.py"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40505823a2e6daed3a2c94525d340b1362f4814f7150583dbcfaee420604247"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): skills/last30days/scripts/lib/instagram.py:139-180 | skills/last30days/scripts/lib/reddit.py:101-138 | skills/last30days/scripts/lib/tiktok.py:50-89 | skills/last30days/scripts/lib/youtube_yt.py:715-755 \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/last30days/scripts/lib/instagram.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd34f02761f9ad642732e14305280205dc859cd0dee24bf6269eb49e5d2c776"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (79 corresponding lines): skills/last30days/scripts/lib/instagram.py:715-794 | skills/last30days/scripts/lib/tiktok.py:354-432 \u2014 These two members are one piece of code written twice and then edited apart: 79 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/last30days/scripts/lib/instagram.py"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72820b6963c9d58e2069724b1c55696d705419593fb4a27ca24dd44b639f899"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): skills/last30days/scripts/lib/threads.py:136-198 | skills/last30days/scripts/lib/tiktok.py:278-343 \u2014 These two members are one piece of code written twice and then edited apart: 63 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/last30days/scripts/lib/threads.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c80022e893b8608090236482e0f37ca4cbea36399bfc9452ad99bcfccd4a9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): skills/last30days/scripts/lib/instagram.py:990-1046 | skills/last30days/scripts/lib/tiktok.py:614-681 \u2014 These two members are one piece of code written twice and then edited apart: 57 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/last30days/scripts/lib/instagram.py"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffdf0a8bb69d9992a4ab6d10f0086eafd0c2df707cff8071c7afc6518a8e7db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 36\u002B corresponding lines): skills/last30days/scripts/lib/arxiv.py:101-141 | skills/last30days/scripts/lib/digg.py:460-511 | skills/last30days/scripts/lib/techmeme.py:108-143 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 36 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/last30days/scripts/lib/arxiv.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"83556b0e5402c48b0691508d1d9b4b3a7e17798d20c03379cbba793e480707f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): mcp/internal/tools/preflight.go:30-62 | mcp/internal/tools/research.go:83-132 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/internal/tools/preflight.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"587f58d2970d4daa2e96040e08ea458fa551f9866812039cfecf958fd813402f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): skills/last30days/scripts/lib/jobs.py:1619-1643 | skills/last30days/scripts/lib/jobs.py:1647-1670 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs.py"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"066ec4170d687b3f3c754097a878eeb8645b7961bf9849af84745bdf8b0abe0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): skills/last30days/scripts/lib/github.py:528-562 | skills/last30days/scripts/lib/hackernews.py:438-486 \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/last30days/scripts/lib/github.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"3276c2e62914ad4bcf549e1ae0ae2c9e0031a58e978970e0edf908178c762397"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): skills/last30days/scripts/lib/tiktok.py:550-602 | skills/last30days/scripts/lib/youtube_yt.py:2024-2074 \u2014 These two members are one piece of code written twice and then edited apart: 51 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/last30days/scripts/lib/tiktok.py"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cebe80e82700f0c1f4efcf6c610ef385f99c2e7cbc6b30450cae02740d4b8c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 26\u002B corresponding lines): skills/last30days/scripts/lib/normalize.py:552-577 | skills/last30days/scripts/lib/normalize.py:591-623 | skills/last30days/scripts/lib/normalize.py:714-745 | skills/last30days/scripts/lib/normalize.py:876-906 | skills/last30days/scripts/lib/normalize.py:1045-1072 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 26 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/last30days/scripts/lib/normalize.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a19f2c8942e0fd406dd41f4ee614ea26f0ff9de1226840946fbf50c06f51d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): skills/last30days/scripts/lib/resolve.py:92-111 | skills/last30days/scripts/lib/resolve.py:115-132 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/resolve.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abb6dc615e67800683f214ba00ebf1eda760ff534321839e1e138b48288accd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): skills/last30days/scripts/lib/perplexity.py:249-304 | skills/last30days/scripts/lib/perplexity.py:311-376 \u2014 These two members are one piece of code written twice and then edited apart: 56 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/last30days/scripts/lib/perplexity.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"b183658677e5f9c7764151f51bf35c97a06ad053a1377fa143059d1c7c613eea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): skills/last30days/scripts/lib/bluesky.py:367-417 | skills/last30days/scripts/lib/truthsocial.py:126-170 \u2014 These two members are one piece of code written twice and then edited apart: 45 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/last30days/scripts/lib/bluesky.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efe1ba7bbd39fe5cb57ee73da060cb8f7fae0f9997292287d1226e863242300"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): skills/last30days/scripts/lib/web_search_keyless.py:135-157 | skills/last30days/scripts/lib/web_search_keyless.py:161-185 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/web_search_keyless.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e507c85f33947d80029d78cd88a95f3507b1cbf09cbf0ba509f41842621a001"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): skills/last30days/scripts/last30days.py:191-224 | skills/last30days/scripts/last30days.py:233-267 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b037ad6a06e09955b1cb0deaa18cd8493da42c35bbf2e6acba26ceb17eda9bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): skills/last30days/scripts/lib/normalize.py:265-281 | skills/last30days/scripts/lib/normalize.py:291-319 | skills/last30days/scripts/lib/normalize.py:329-358 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/normalize.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bbfe414327faf8ed92fee39a3a6e949f5151866a1bdca08e10ac988da36149"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): skills/last30days/scripts/lib/cookie_extract.py:373-426 | skills/last30days/scripts/lib/cookie_extract.py:580-620 \u2014 These two members are one piece of code written twice and then edited apart: 41 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/last30days/scripts/lib/cookie_extract.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75c77cc5347af42776448212ef04164a2dd8ec5fde483f2330fbd0827bca4dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): skills/last30days/scripts/lib/grok_x.py:1160-1199 | skills/last30days/scripts/lib/grok_x.py:1212-1238 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/grok_x.py"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6578b45f6eaa9f57fc048d240a67f25077336cd69b3d275bc3ab84b5985ffcc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 16\u002B corresponding lines): skills/last30days/scripts/lib/normalize.py:370-385 | skills/last30days/scripts/lib/normalize.py:483-513 | skills/last30days/scripts/lib/normalize.py:523-542 | skills/last30days/scripts/lib/normalize.py:635-650 | skills/last30days/scripts/lib/normalize.py:755-780 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/normalize.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"76afdba89b8bb6d404885e023929f028ea80f2c743e5e874744bba99f51a6b3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): skills/last30days/scripts/lib/doctor.py:708-727 | skills/last30days/scripts/lib/doctor.py:794-823 \u2014 These two members are one piece of code written twice and then edited apart: 20 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/last30days/scripts/lib/doctor.py"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6b922105790cee86d53944af6585968690a44e82dc8a4465267cc4e750e7f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): skills/last30days/scripts/lib/polymarket.py:229-280 | skills/last30days/scripts/lib/polymarket.py:284-310 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/polymarket.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fb0c6d7a5dc50dfbe37c70f89f45027ace967b8f4748c3df2373fa363cb465"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): skills/last30days/scripts/lib/discovery_handoff.py:761-793 | skills/last30days/scripts/lib/discovery_handoff.py:812-848 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/discovery_handoff.py"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9dbb3241b39b32a14b9a181037a10dff73b28f884dcbf868009b58621dd17e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): skills/last30days/scripts/lib/rerank.py:473-495 | skills/last30days/scripts/lib/rerank.py:1289-1304 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/rerank.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"168977203f270d3640efae0f87c2d55eb843a983bfdb6431f08579d500ae2b3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): skills/last30days/scripts/lib/x_api.py:771-788 | skills/last30days/scripts/lib/x_api.py:803-824 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/x_api.py"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ca66e60fe1a988ffdda4150fcea9ded1428faf7400cc9b6a7598e28b7ff575"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): skills/last30days/scripts/lib/setup_wizard.py:328-362 | skills/last30days/scripts/lib/setup_wizard.py:486-514 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ac9e872fb15578b964f924b674183dcb978a176e3ddd53d90bd029cadb15e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): skills/last30days/scripts/lib/grounding.py:53-82 | skills/last30days/scripts/lib/grounding.py:92-128 | skills/last30days/scripts/lib/grounding.py:138-168 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 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/last30days/scripts/lib/grounding.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9559350f92bd7c2779db167d5ce845a20c3f1b24d80583cd35ea2dceb0dd6960"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): skills/last30days/scripts/lib/reddit.py:332-359 | skills/last30days/scripts/lib/reddit.py:369-402 | skills/last30days/scripts/lib/reddit.py:412-440 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8ca352b0729487dd39e5447ad89cc3f316be1cfc24f97026489b59a21a6fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): skills/last30days/scripts/last30days.py:2249-2267 | skills/last30days/scripts/last30days.py:2762-2785 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cd20da90227b957096cc67d39a2f45c536593aa8d842fdea510e2a19ff4874"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): skills/last30days/scripts/last30days.py:494-520 | skills/last30days/scripts/last30days.py:531-563 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"1958c2d139e52a3b2d07dfcdbf210786678a80fafe77a4881b93ed6b0451dc79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): skills/last30days/scripts/lib/pipeline.py:617-632 | skills/last30days/scripts/lib/reddit_listing.py:66-82 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/pipeline.py"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bca53f77b27367949299c8c6445ebc178d7680d37be07801dae2c0936e3bcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): skills/last30days/scripts/store.py:522-535 | skills/last30days/scripts/store.py:909-922 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/store.py"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"37922c332b7bbf3f5795acb2982f8811646a533656ad9771f42f5418ab683182"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): skills/last30days/scripts/lib/jobs.py:733-743 | skills/last30days/scripts/lib/jobs.py:1139-1151 \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/last30days/scripts/lib/jobs.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"1234e38862ae1f2c008f2c20d6304f4572f0c885f2816c5a01d6c65ee9f8ff2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): skills/last30days/scripts/lib/doctor.py:408-426 | skills/last30days/scripts/lib/doctor.py:844-867 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/doctor.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"6806dd35a92c42e56a8ed186bfc3859ca88ed3f01fbbab8132b66c9a79ca321f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): skills/last30days/scripts/lib/html_render.py:414-428 | skills/last30days/scripts/lib/html_render.py:438-452 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/html_render.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e5bf9171bd4f3f4a5a1ea08bc470b1200bd2e4a09bd5031dad5dfee57eccec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): skills/last30days/scripts/lib/providers.py:301-326 | skills/last30days/scripts/lib/providers.py:344-369 | skills/last30days/scripts/lib/providers.py:387-411 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 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/last30days/scripts/lib/providers.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee01477556c3f17fab0e400c50c2870a0f5502b5cb16666901c812e0e16b7f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): skills/last30days/scripts/watchlist.py:131-135 | skills/last30days/scripts/watchlist.py:139-143 \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/last30days/scripts/watchlist.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9a2c4466d608b0b053b367df2566fec3033d5ecd70777a30f860048c965f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): skills/last30days/scripts/last30days.py:1604-1612 | skills/last30days/scripts/lib/doctor.py:1768-1777 | skills/last30days/scripts/lib/doctor.py:1965-1974 \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/last30days/scripts/last30days.py"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f184dd10b4759ad040605788ec8e454d098882bafb1fd74d1de6e9dd4fb7e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/last30days/scripts/lib/render.py:1199-1207 | skills/last30days/scripts/lib/render.py:2323-2335 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e299242cf07bcfb9298d91ab32a550a3f950ddc6f9adb036fafd5f05ccc6e26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): skills/last30days/scripts/lib/brightdata.py:205-219 | skills/last30days/scripts/lib/meta_ads.py:419-426 | skills/last30days/scripts/lib/techmeme.py:84-92 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/brightdata.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"534db305f2e42251b961e3187239c26275eb41bf79dd3c8a96313828c79d4cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): skills/last30days/scripts/lib/fusion.py:255-269 | skills/last30days/scripts/lib/pipeline.py:3586-3591 \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/last30days/scripts/lib/fusion.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a925a03b9c6cefa53892eab93b5680f0d70473351c7abc6d6b4b8cf4df642a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/last30days/scripts/lib/telegram.py:123-131 | skills/last30days/scripts/lib/threads.py:46-59 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/telegram.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a96acfe819f4405cfcaf25932841ff3c79e8166b5fa1665f85f4b0669711945"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): skills/last30days/scripts/lib/reddit.py:248-256 | skills/last30days/scripts/lib/youtube_yt.py:2009-2014 \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/last30days/scripts/lib/reddit.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a162aeaf284a9a9a6ca268664c4417ca27edf64cc848507e6591db81a7525c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): skills/last30days/scripts/lib/meta_ads.py:460-463 | skills/last30days/scripts/lib/perplexity.py:594-601 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/meta_ads.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"6160cce21d89841fd215ec63026fac3c7436d262378c57fa7f85ec2d26a7e695"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): skills/last30days/scripts/evaluate_search_quality.py:138-143 | skills/last30days/scripts/lib/dedupe.py:53-58 \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/last30days/scripts/evaluate_search_quality.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2d69eea9aeb647a8ca96ca79530364f056e6d82abae9b83aa37b16a67bf3a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): skills/last30days/scripts/lib/fetch_memo.py:63-70 | skills/last30days/scripts/lib/reddit.py:829-839 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/fetch_memo.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d131b50db530d039d6b5718aea4f15f7a765359c2ebb7cf9354f1041f7bb91d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): skills/last30days/scripts/lib/hackernews.py:69-74 | skills/last30days/scripts/lib/truthsocial.py:28-31 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/hackernews.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b45001302470a2099f8eee6482d7ef2bb2d1d7975e1672eeb5deebb1b53100"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): skills/last30days/scripts/lib/env.py:130-132 | skills/last30days/scripts/lib/permission_preflight.py:36-38 \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/last30days/scripts/lib/env.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a3cba73ec6e5f2636a40cdbe601619677e430ede3d2f72097865a34aa57ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201340 lines \u00D7 2): skills/last30days/scripts/lib/xquik.py:237-276 | skills/last30days/scripts/lib/xquik.py:293-328 \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/last30days/scripts/lib/xquik.py:237\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/xquik.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9ef69f7a558dae4230bc86857f7e898393c6a3580b9a470d93d65d848eb4a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201332 lines \u00D7 2): skills/last30days/scripts/lib/bird_x.py:792-823 | skills/last30days/scripts/lib/bird_x.py:892-920 \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/last30days/scripts/lib/bird_x.py:791\u0060 calls \u0060_extract_core_subject\u0060 and \u0060skills/last30days/scripts/lib/bird_x.py:890\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/last30days/scripts/lib/bird_x.py"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc66fcc29e514dc4794d4b20fabb57f320e3d49da419fa69cac1185741ebe91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): skills/last30days/scripts/lib/pinterest.py:109-139 | skills/last30days/scripts/lib/threads.py:136-166 \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/last30days/scripts/lib/pinterest.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6730eda5f03a7167f1c1d34c2fbdf326f60b8445815a17177600e8f6c5770f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201328 lines \u00D7 2): skills/last30days/scripts/lib/arxiv.py:101-128 | skills/last30days/scripts/lib/techmeme.py:108-131 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/arxiv.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c28f42f633aa7395a60e27d8b7890c76ef384a451c23aa4117a9d78a35c67d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201324 lines \u00D7 2): skills/last30days/scripts/lib/polymarket.py:229-252 | skills/last30days/scripts/lib/polymarket.py:284-302 \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/last30days/scripts/lib/polymarket.py:284\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/last30days/scripts/lib/polymarket.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00fdefa21f14c2df71e4b1596744161994b94813c138aa62d9c8d41d5168fd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): skills/last30days/scripts/lib/perplexity.py:249-271 | skills/last30days/scripts/lib/perplexity.py:311-333 \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/last30days/scripts/lib/perplexity.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"78536526f5c6955efaab9366016e2095d90db037e3154298ba36c4176e0a970e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201323 lines \u00D7 2): skills/last30days/scripts/lib/pipeline.py:2783-2805 | skills/last30days/scripts/lib/pipeline.py:2855-2871 \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/last30days/scripts/lib/pipeline.py:2855\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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":2783}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabe50c3ce8510357d5236129454710ba618c889c6964e971a1d36398a18fe02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): skills/last30days/scripts/lib/perplexity.py:281-302 | skills/last30days/scripts/lib/perplexity.py:337-356 \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/last30days/scripts/lib/perplexity.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefa88d921e8528f71ccb8af8cd4002148878aeaf5e7aed49e7e656b6411e169"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 2): skills/last30days/scripts/lib/reddit.py:728-749 | skills/last30days/scripts/lib/reddit_enrich.py:303-319 \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/last30days/scripts/lib/reddit.py"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"998b29572b90c9fec37b01c9ea830f6f578f58d96202d374df0ca6949a08be35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): skills/last30days/scripts/last30days.py:2848-2868 | skills/last30days/scripts/last30days.py:2892-2910 \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/last30days/scripts/last30days.py:2848\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/last30days/scripts/last30days.py"},"region":{"startLine":2848}}}],"partialFingerprints":{"codehealthFindingId/v1":"38486355e9c441644864955a14f09693d697ef3423819994f0413d37a21b3fb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201321 lines \u00D7 2): skills/last30days/scripts/lib/grok_x.py:1160-1180 | skills/last30days/scripts/lib/grok_x.py:1212-1224 \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/last30days/scripts/lib/grok_x.py"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c8675716ab60120fbb30bf4ebef3304c940c8af1a0f959f9f342a35c080782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): skills/last30days/scripts/lib/instagram.py:139-157 | skills/last30days/scripts/lib/reddit.py:101-119 | skills/last30days/scripts/lib/tiktok.py:50-68 | skills/last30days/scripts/lib/youtube_yt.py:715-733 \u2014 before extracting anything, compare \u0060skills/last30days/scripts/lib/instagram.py\u0060 and \u0060skills/last30days/scripts/lib/tiktok.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/instagram.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f35df3ae8e6cbeb4ceeedb8c75140d71ba7904f79eb374631f625f149aae244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): skills/last30days/scripts/last30days.py:191-210 | skills/last30days/scripts/last30days.py:233-251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d99a2d9364fcf01361200d027f69374896be7729637718a8e9e94ef1c9e5ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): skills/last30days/scripts/lib/render.py:833-851 | skills/last30days/scripts/lib/render.py:2182-2199 \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/last30days/scripts/lib/render.py"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2ab2ed388e2be215af55aef3320c907a1fbe1d407cc5adeb97ededd02d5ff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 3): skills/last30days/scripts/lib/instagram.py:161-178 | skills/last30days/scripts/lib/tiktok.py:72-87 | skills/last30days/scripts/lib/youtube_yt.py:737-753 \u2014 before extracting anything, compare \u0060skills/last30days/scripts/lib/instagram.py\u0060 and \u0060skills/last30days/scripts/lib/tiktok.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/instagram.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d056ccdcfef2bea8156458b661ad7d45dd76a5782cdb1f35a5058fe657aff1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): skills/last30days/scripts/lib/instagram.py:739-755 | skills/last30days/scripts/lib/tiktok.py:373-389 \u2014 before extracting anything, compare \u0060skills/last30days/scripts/lib/instagram.py\u0060 and \u0060skills/last30days/scripts/lib/tiktok.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/last30days/scripts/lib/instagram.py:737\u0060 calls \u0060_resolve_transcript_timeout\u0060 and \u0060skills/last30days/scripts/lib/tiktok.py:371\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/last30days/scripts/lib/instagram.py"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab62888c9c5fdfe5f27e4bf7579c040e489261ae1a74d8004c876701bbdcaae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): skills/last30days/scripts/lib/pipeline.py:5554-5570 | skills/last30days/scripts/lib/pipeline.py:6121-6133 \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/last30days/scripts/lib/pipeline.py:5554\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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":5554}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e653dea90877a610521b6113ecaf2c64ddfa3b868361e7310657eab13e25ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 5): skills/last30days/scripts/lib/pipeline.py:5413-5425 | skills/last30days/scripts/lib/pipeline.py:5432-5444 | skills/last30days/scripts/lib/pipeline.py:5450-5465 | skills/last30days/scripts/lib/pipeline.py:5470-5482 | skills/last30days/scripts/lib/pipeline.py:5536-5551 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/last30days/scripts/lib/pipeline.py:5412\u0060 calls \u0060extend\u0060 and \u0060skills/last30days/scripts/lib/pipeline.py:5535\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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":5413}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af2bff47b03b8357f6c3d291f5918841153933ccfd4dd288ba80eb28c67e79e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/last30days/scripts/lib/cookie_extract.py:404-419 | skills/last30days/scripts/lib/cookie_extract.py:600-615 \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/last30days/scripts/lib/cookie_extract.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"934efb9b1cb4ce205a3c1a00d0f24e9ce32322c463f794d25d4c28d3bf573ad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): skills/last30days/scripts/lib/render.py:422-450 | skills/last30days/scripts/lib/render.py:1609-1637 \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/last30days/scripts/lib/render.py:422\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/render.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"388d9395311df9a1dd30e13de4b0b4c27491520af82c2c70ea0bda095418aac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): skills/last30days/scripts/lib/normalize.py:660-674 | skills/last30days/scripts/lib/normalize.py:714-725 \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/last30days/scripts/lib/normalize.py"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae2c62251e63d9172e905719b65c1b0d17940bfda25c92e1e0966e63b56b61a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): skills/last30days/scripts/lib/tiktok.py:209-223 | skills/last30days/scripts/lib/tiktok.py:251-264 \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/last30days/scripts/lib/tiktok.py:209\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/tiktok.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"121f4e2bde0cd1f5b86e38a3a38098805c4fde7b6be70979674f4c5b88bb49da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): skills/last30days/scripts/lib/instagram.py:761-773 | skills/last30days/scripts/lib/tiktok.py:395-407 \u2014 before extracting anything, compare \u0060skills/last30days/scripts/lib/instagram.py\u0060 and \u0060skills/last30days/scripts/lib/tiktok.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/last30days/scripts/lib/instagram.py:761\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/instagram.py"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb591a1afa95ba2adc9e6ff00e1abc563b594dc739a22114285fad3fd8f6f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): skills/last30days/scripts/lib/instagram.py:1010-1022 | skills/last30days/scripts/lib/tiktok.py:641-653 \u2014 before extracting anything, compare \u0060skills/last30days/scripts/lib/instagram.py\u0060 and \u0060skills/last30days/scripts/lib/tiktok.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/last30days/scripts/lib/instagram.py:1023\u0060 calls \u0060isinstance\u0060 and \u0060skills/last30days/scripts/lib/tiktok.py:654\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/last30days/scripts/lib/instagram.py"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b8621b60b0e5db8833304549eeff7123d88c9a8b52fd52c4be99700d59584d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): skills/last30days/scripts/lib/rerank.py:474-486 | skills/last30days/scripts/lib/rerank.py:1289-1301 \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/last30days/scripts/lib/rerank.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba42ff0deae2341d3b8f6ca13f9bbb9a90db638598f6886883299dd24607578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): skills/last30days/scripts/lib/tiktok.py:590-602 | skills/last30days/scripts/lib/youtube_yt.py:2062-2074 \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/last30days/scripts/lib/tiktok.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"138c65aee2c040f327a1827226020cc2500d3eb6919496e0d4ad430a8c48958c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): skills/last30days/scripts/lib/instagram.py:674-685 | skills/last30days/scripts/lib/threads.py:179-190 | skills/last30days/scripts/lib/tiktok.py:324-335 \u2014 before extracting anything, compare \u0060skills/last30days/scripts/lib/instagram.py\u0060 and \u0060skills/last30days/scripts/lib/tiktok.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/instagram.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"627b188c4a2fa7b2a3be1a42256c7a9537b358d18f5c7f4c7d1267c33a89515d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): skills/last30days/scripts/lib/bird_x.py:849-860 | skills/last30days/scripts/lib/bird_x.py:947-957 \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/last30days/scripts/lib/bird_x.py"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd39c79c27b0810f0f81e0cf9951c7d9a4018754c3cb50444a141b92481d4ef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): skills/last30days/scripts/lib/bird_x.py:1002-1013 | skills/last30days/scripts/lib/xquik.py:426-434 \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/last30days/scripts/lib/bird_x.py"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9ae078d07a9662fc6f4ed00c227ceeda486c342bdaeb363a69bea48b356e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): skills/last30days/scripts/lib/instagram.py:1033-1046 | skills/last30days/scripts/lib/tiktok.py:668-681 \u2014 before extracting anything, compare \u0060skills/last30days/scripts/lib/instagram.py\u0060 and \u0060skills/last30days/scripts/lib/tiktok.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/instagram.py"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"a275aa07c89bbaebd804146088606514053eaa8877565c843718a88b77cc48dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): skills/last30days/scripts/last30days.py:2084-2092 | skills/last30days/scripts/lib/hosted.py:229-239 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/last30days/scripts/lib/hosted.py:229\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/last30days.py"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb19a9f563f7d930cf3b6ca71519796dacaa6b07e2ce29490a50162dfb5564d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): skills/last30days/scripts/lib/normalize.py:735-745 | skills/last30days/scripts/lib/normalize.py:771-780 \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/last30days/scripts/lib/normalize.py:735\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/last30days/scripts/lib/normalize.py"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5beb5f604627f572465ca627bbbf40457866e601b2fdb12e01640da0e98fc13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): skills/last30days/scripts/lib/reddit.py:752-760 | skills/last30days/scripts/lib/reddit_enrich.py:203-213 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from 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/last30days/scripts/lib/reddit.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad18403275a26fdec5c295fed1559ec0a48c8d9ff23d8a87386ecb20eb36d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): skills/last30days/scripts/lib/github.py:670-680 | skills/last30days/scripts/lib/github.py:683-693 | skills/last30days/scripts/lib/github.py:696-706 \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/last30days/scripts/lib/github.py:681\u0060 calls \u0060get\u0060 and \u0060skills/last30days/scripts/lib/github.py:696\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/last30days/scripts/lib/github.py"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddcc3884f28118b2ae4cb6cc456bc23aa6d652efe8ea5d53e240c8477b50143"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 3): skills/last30days/scripts/lib/signals.py:236-245 | skills/last30days/scripts/lib/signals.py:249-255 | skills/last30days/scripts/lib/signals.py:262-268 \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. 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/last30days/scripts/lib/signals.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb61e03aa67c0a919b3904fd427e123e90a43e1fa593ec53ad8e1dd55640676f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): skills/last30days/scripts/store.py:526-535 | skills/last30days/scripts/store.py:913-922 \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/last30days/scripts/store.py"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"3035767610cc5821565a8c60d75233e9bc2eb465978824a0d1e0fb00e3792be3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): skills/last30days/scripts/lib/arxiv.py:111-119 | skills/last30days/scripts/lib/brightdata.py:260-268 | skills/last30days/scripts/lib/techmeme.py:114-122 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/arxiv.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"de69fd9642fcb49baa8e423c5b68a528961ba302ba87b3bc76485d019636d0f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/last30days/scripts/lib/pipeline.py:5744-5752 | skills/last30days/scripts/lib/pipeline.py:5777-5785 \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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":5744}}}],"partialFingerprints":{"codehealthFindingId/v1":"d759c1f767ff6e40ee1b44c57c23239904eaa08ddc7b2cab16128449da4f40ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): skills/last30days/scripts/lib/pinterest.py:124-131 | skills/last30days/scripts/lib/threads.py:151-158 | skills/last30days/scripts/lib/tiktok.py:294-301 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/last30days/scripts/lib/pinterest.py:124\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/last30days/scripts/lib/tiktok.py:293\u0060 calls \u0060_check_budget\u0060 and \u0060skills/last30days/scripts/lib/pinterest.py:122\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/last30days/scripts/lib/pinterest.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c737923390efb70f06202cab60d55e5506eac2b52d0b9718eb6327903b16cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/last30days/scripts/lib/instagram.py:870-877 | skills/last30days/scripts/lib/youtube_yt.py:1910-1917 \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/last30days/scripts/lib/instagram.py"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd969975af97e8d4305292813b62fd8de1213241ec21dcbf03e4242a7634ae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/last30days/scripts/lib/pipeline.py:625-632 | skills/last30days/scripts/lib/reddit_listing.py:75-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. 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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bd07707a296e9ca32fd3d43537309d52f457bcfa97608c7ba47eac8c859195"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): skills/last30days/scripts/lib/reddit.py:552-561 | skills/last30days/scripts/lib/reddit.py:598-607 \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/last30days/scripts/lib/reddit.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ad77f9b42f7e2693e976df3fb081eaaa862a21aaef0d24ce8d48ee56333fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/last30days/scripts/last30days.py:1012-1018 | skills/last30days/scripts/last30days.py:3821-3827 \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/last30days/scripts/last30days.py"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c59ce98e405712b0e670012dddb1d3700605dbfe5cec03ffe3ca19cf7991102"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/last30days/scripts/lib/bird_x.py:703-709 | skills/last30days/scripts/lib/bird_x.py:716-722 \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/last30days/scripts/lib/bird_x.py"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f086fce36ba9afeaff1083278f87ed3e806557793efd1af593061bef413099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 3): skills/last30days/scripts/lib/github.py:931-933 | skills/last30days/scripts/lib/github.py:980-986 | skills/last30days/scripts/lib/github.py:1286-1292 \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/last30days/scripts/lib/github.py"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"268baf649e6a8c296145b96aba362729a941674b899779e391faaf82a05abbe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/last30days/scripts/lib/instagram.py:540-546 | skills/last30days/scripts/lib/instagram.py:963-969 \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/last30days/scripts/lib/instagram.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed0ccf563afe78c3469cc41af87ceebd9af6f5baae030dd2cef9d07b00ec358"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/last30days/scripts/lib/jobs.py:1619-1625 | skills/last30days/scripts/lib/jobs.py:1714-1720 \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/last30days/scripts/lib/jobs.py"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"012bc3e41c32503984da547432c9ff4dc7082cb23e6bc0467c5d0901dc85bd02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): skills/last30days/scripts/lib/resolve.py:99-105 | skills/last30days/scripts/lib/resolve.py:121-126 \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/last30days/scripts/lib/resolve.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0877bb3e16f215f566a9dfc6831f3fb78e30037a5041f74a2c5dbc8e5d5387"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): skills/last30days/scripts/lib/normalize.py:403-408 | skills/last30days/scripts/lib/normalize.py:562-567 | skills/last30days/scripts/lib/normalize.py:951-956 | skills/last30days/scripts/lib/normalize.py:1051-1056 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/last30days/scripts/lib/normalize.py:403\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/normalize.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b9d200edcdacab04adcdad4d6db0520c7e5a96d7bf2665fd04db2bf8eaab08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/last30days/scripts/lib/bird_x.py:828-833 | skills/last30days/scripts/lib/bird_x.py:922-927 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/last30days/scripts/lib/bird_x.py:928\u0060 calls \u0060strip\u0060 and \u0060skills/last30days/scripts/lib/bird_x.py:837\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/last30days/scripts/lib/bird_x.py"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2a248ae1ea7b711e26e16b8b60ef50002478b3e6715048ed7844c64d85064b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/last30days/scripts/lib/freshness.py:513-519 | skills/last30days/scripts/lib/freshness.py:569-574 \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/last30days/scripts/lib/freshness.py:513\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/last30days/scripts/lib/freshness.py"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b38ffeda48e42c1773a1354272afe0d847531289fa6e72c66468fad1b48637e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/last30days/scripts/lib/jobs.py:735-740 | skills/last30days/scripts/lib/jobs.py:1142-1147 \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/last30days/scripts/lib/jobs.py"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f65bb9394753386d1b40da04d5b331bd11d5dd317990424f27e39f2e5966c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/last30days/scripts/lib/normalize.py:568-573 | skills/last30days/scripts/lib/normalize.py:610-615 \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/last30days/scripts/lib/normalize.py"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c75b0c9fac2478c198350a1ad86975ea546ee51f3a2dcc8f99fcc7fb55e3a26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/last30days/scripts/lib/normalize.py:890-895 | skills/last30days/scripts/lib/normalize.py:955-960 \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/last30days/scripts/lib/normalize.py"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"d121c958fb91a3536896ac437bc924da7992c294c2616e5d70a25fec9e0abdaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/last30days/scripts/lib/rerank.py:1250-1256 | skills/last30days/scripts/lib/rerank.py:1280-1285 \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/last30days/scripts/lib/rerank.py:1250\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/rerank.py"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"425fb31d41cd5b44622fa7e33e95436ee916be56c68465606d0b42865751bf63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/last30days/scripts/lib/youtube_yt.py:1120-1125 | skills/last30days/scripts/lib/youtube_yt.py:1183-1188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54574d3c7f9d25d43bb9932bc6f85fb2539618ab4958d90867544686ed70ff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): skills/last30days/scripts/lib/normalize.py:569-573 | skills/last30days/scripts/lib/normalize.py:611-615 | skills/last30days/scripts/lib/normalize.py:696-700 | skills/last30days/scripts/lib/normalize.py:893-897 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/normalize.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3e5cb705db89239df3ead1d9c09a7d4d31c9826a35afdcd9a18eae8a743c38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): skills/last30days/scripts/lib/normalize.py:348-352 | skills/last30days/scripts/lib/normalize.py:379-383 | skills/last30days/scripts/lib/normalize.py:1093-1097 \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/last30days/scripts/lib/normalize.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"478b853ce9c151b3453c711303a812855d445e4859af0636ba64dcbc9f1896c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 5): skills/last30days/scripts/lib/normalize.py:465-469 | skills/last30days/scripts/lib/normalize.py:494-498 | skills/last30days/scripts/lib/normalize.py:613-617 | skills/last30days/scripts/lib/normalize.py:644-647 | skills/last30days/scripts/lib/normalize.py:1059-1062 \u2014 all 5 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. 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/last30days/scripts/lib/normalize.py:465\u0060 calls \u0060_date_confidence\u0060 and \u0060skills/last30days/scripts/lib/normalize.py:1059\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/last30days/scripts/lib/normalize.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff88040fb2643d2f17a7052b2299677f3f1325a646ba03e46837331f7258831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): skills/last30days/scripts/lib/normalize.py:537-541 | skills/last30days/scripts/lib/normalize.py:698-702 | skills/last30days/scripts/lib/normalize.py:895-899 \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/last30days/scripts/lib/normalize.py"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78fcd8eb46e6cc77af24d7e8a98ffe246455ef5d4098a1ae038431a2d4ae2fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/last30days/scripts/lib/arxiv.py:278-282 | skills/last30days/scripts/lib/techmeme.py:233-237 \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/last30days/scripts/lib/arxiv.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3ad13ef8bd365067fe85f5ab7fe8b263d9171706e3513f6261999900507ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/last30days/scripts/lib/github.py:982-993 | skills/last30days/scripts/lib/github.py:1288-1299 \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/last30days/scripts/lib/github.py"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"16814b40d74b20db33d3ac313d01efbf5c3f108caaede3eee034251b52267164"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/last30days/scripts/lib/normalize.py:265-269 | skills/last30days/scripts/lib/normalize.py:298-302 \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/last30days/scripts/lib/normalize.py:265\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/normalize.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fbcc7264090063f1018e7332f96f7cd9680c5205e3d2b1a64f7abecf554642"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/last30days/scripts/lib/quality_nudge.py:426-432 | skills/last30days/scripts/lib/quality_nudge.py:446-450 \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/last30days/scripts/lib/quality_nudge.py:426\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/last30days/scripts/lib/quality_nudge.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9d5d516fafa704d965bcc140d7fe276813bb7e99ecfcef1d1e11183746e271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/last30days/scripts/lib/corpus.py:432-439 | skills/last30days/scripts/lib/library_index.py:412-419 \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/last30days/scripts/lib/corpus.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"8400a066ed6cb483e820c5e588059bec51fce9a3ef2d4fc6787937cf9e1a5f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/last30days/scripts/lib/dripstack.py:44-48 | skills/last30days/scripts/lib/stocktwits.py:72-76 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/dripstack.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ab08a281acfd687e011e377769e87e88a8dac23e519cd7a207d9d7e6e42f4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/last30days/scripts/lib/reddit_listing.py:91-96 | skills/last30days/scripts/lib/reddit_shreddit.py:111-116 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060Optional[str]\u0060 in one and \u0060str\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/reddit_listing.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24c65323be798bb139f0c29cd0881a21e927250a3637be0427c3a6a9e828e2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/last30days/scripts/last30days.py:338-342 | skills/last30days/scripts/last30days.py:590-594 \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/last30days/scripts/last30days.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2526a7cd5880be91a6fbd4fe5fea40239c24f5b7b3d8cb0a2b6adc6040346f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/last30days/scripts/lib/normalize.py:271-275 | skills/last30days/scripts/lib/normalize.py:306-310 \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/last30days/scripts/lib/normalize.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4498fa9b98c367c9c3fb29091308b81904a18512b8e70e022acf290a8101a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/last30days/scripts/lib/normalize.py:761-765 | skills/last30days/scripts/lib/normalize.py:1083-1087 \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/last30days/scripts/lib/normalize.py:761\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/normalize.py"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cb20bbdabc1a78daa9f8f9c9d205724726b50a30345eecca91ba1bbc84570c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): mcp/internal/tools/preflight.go:33-47 | mcp/internal/tools/research.go:97-111 \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":"mcp/internal/tools/preflight.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"214f4d2284957731ef368b8fb235dc393b1f4342f8c22ec0ebbb6e6046740bb9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/pipeline.py: skills/last30days/scripts/lib/pipeline.py changed 56 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 207 in pipeline.run at line 2244. 44 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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/pipeline.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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"40318ce82072e8f03ad4f4616d08049e823429a317cacbbfd3bdfc130a6f1959"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/last30days.py: skills/last30days/scripts/last30days.py changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 273 in last30days._main at line 3727. 27 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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/last30days.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/last30days/scripts/last30days.py"},"region":{"startLine":3727}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f27a3b550deca4e8383d2a58b3a479a5fcba2b104a3b9ea11cb2163fab8179"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/render.py: skills/last30days/scripts/lib/render.py changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in render.render_full at line 1794. 20 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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/render.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/last30days/scripts/lib/render.py"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f5b2a05a56ad2dc2f4f0c274af0ccdc6131fa919bc5d06b53d115af2a60dbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/env.py: skills/last30days/scripts/lib/env.py changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in env.get_config at line 547. 16 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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/env.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/last30days/scripts/lib/env.py"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbf9641122038b0074ab46fecfb4e81a830dfa71e8862554e11993f3985813b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/http.py: skills/last30days/scripts/lib/http.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in http.request at line 848. 11 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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/http.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/last30days/scripts/lib/http.py"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"58de9717bb2926a143567908ca9fecb239b87d1e976402566bf2849caf46db0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/planner.py: skills/last30days/scripts/lib/planner.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in planner._sanitize_plan at line 493. 8 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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/planner.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/last30days/scripts/lib/planner.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f48e4fe70f3d025d629128e4bfadc488ffc69991c39c25900538f3236567dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/doctor.py: skills/last30days/scripts/lib/doctor.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in doctor._x_record at line 464. 10 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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/doctor.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/last30days/scripts/lib/doctor.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"814325e848b4cbeba12436098b2492a6dd94b977a1c57f70f2a306f54c233ab6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/youtube_yt.py: skills/last30days/scripts/lib/youtube_yt.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in youtube_yt.search_youtube_sc at line 2263. 14 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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/youtube_yt.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/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcd8bb58943375e7b59234a4f83ce4c61e2b454a3dc809c881e3675be12ad09"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/setup_wizard.py: skills/last30days/scripts/lib/setup_wizard.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in setup_wizard.get_setup_status_text at line 777. 10 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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/setup_wizard.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/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"36387aa4a83cc79e92cfcdc50f7a353af35f2fa71b0ab017aebbe8451401dc2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/github.py: skills/last30days/scripts/lib/github.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in github.search_github_person at line 774. 10 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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/github.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/last30days/scripts/lib/github.py"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"e736f7f949649da2d4484efc4db1cbca3e4ff20618da4184836d2bdc3665399d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/instagram.py: skills/last30days/scripts/lib/instagram.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in instagram._google_reel_fallback at line 395. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/instagram.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/last30days/scripts/lib/instagram.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cb76c9a38381c67ac821e22cb0b6813a96abf5be05572b34f5348adbca4819"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/normalize.py: skills/last30days/scripts/lib/normalize.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in normalize.normalize_source_items at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/normalize.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/last30days/scripts/lib/normalize.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"243d11757da017b454d096c87dcb0a7ae30d8b35ac55a24512c460814eb042bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/grok_x.py: skills/last30days/scripts/lib/grok_x.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in grok_x.search_x at line 1059. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/grok_x.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/last30days/scripts/lib/grok_x.py"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"490a0b66b5abe4f511f465d878df2c3397c7f6b1fee0b32dd13f9048e3e06284"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/quality_nudge.py: skills/last30days/scripts/lib/quality_nudge.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in quality_nudge._build_nudge_text at line 325. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/quality_nudge.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/last30days/scripts/lib/quality_nudge.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5a9cbb9428e0c5002ecc9109a6efad7362a5dbeddffd5a49845c983ab4f0a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/polymarket.py: skills/last30days/scripts/lib/polymarket.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in polymarket.parse_polymarket_response at line 1069. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/polymarket.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/last30days/scripts/lib/polymarket.py"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c26b8b8804e9458d51cb683ceae666cafd883f543d3e6083e744d9b613f785c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/reddit.py: skills/last30days/scripts/lib/reddit.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in reddit.search_reddit at line 508. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/reddit.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/last30days/scripts/lib/reddit.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50f04e22a5d5fd05bcb4038bc3cf18fe440273e63873a98d195c8c811f31306"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/subproc.py: skills/last30days/scripts/lib/subproc.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in subproc.run_with_timeout at line 165. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/subproc.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/last30days/scripts/lib/subproc.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b0e7ae6b05d11aa5ad854ddac1ceefd1ed0aef49b84e48535de7909c72fe4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/reddit_arctic.py: skills/last30days/scripts/lib/reddit_arctic.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in reddit_arctic.fetch_listings at line 292. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/reddit_arctic.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/last30days/scripts/lib/reddit_arctic.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc8f4a0c06f83447890367bc901fe4b78409f1dd346183146430500e1a16adb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/fusion.py: skills/last30days/scripts/lib/fusion.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in fusion.merge_source_items at line 79. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/fusion.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/last30days/scripts/lib/fusion.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d893e132715aa016f5ca64061dccbda561dbe764ee69442561f8e9c88c8641be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/bird_x.py: skills/last30days/scripts/lib/bird_x.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in bird_x.search_x at line 650. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/bird_x.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/last30days/scripts/lib/bird_x.py"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2b8715998be07dbc20a3752fd524e5e840db008b2ce55f3d63243d7bf772b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/reddit_keyless.py: skills/last30days/scripts/lib/reddit_keyless.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in reddit_keyless._discover at line 192. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/reddit_keyless.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/last30days/scripts/lib/reddit_keyless.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e41994c2e626f58d75472650f85f22b84f310bf16b6ef2fbf6ed91e37317dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/cookie_extract.py: skills/last30days/scripts/lib/cookie_extract.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in cookie_extract._find_default_profile at line 138. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/cookie_extract.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/last30days/scripts/lib/cookie_extract.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"443dbb302fa812b46a7ea9a8d281b1145f2b7e6fa928b87b7f572c1ddfb1b7b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/permission_preflight.py: skills/last30days/scripts/lib/permission_preflight.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in permission_preflight.build at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/permission_preflight.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/last30days/scripts/lib/permission_preflight.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a0523daa72586ff6cf0a6ae59851511f213c4081ff4e361ed8bc2b762ef99c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/perplexity.py: skills/last30days/scripts/lib/perplexity.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in perplexity.search at line 1229. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/perplexity.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/last30days/scripts/lib/perplexity.py"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"513f436e358d8c3d18a7e1e4e1ae43516c98b3da7551991f9acf694977c150df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/digg.py: skills/last30days/scripts/lib/digg.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in digg._invoke_cli at line 453. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/digg.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/last30days/scripts/lib/digg.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"3784ae609f7b548d5c2312efa04848bfbb5b4e5e6f917f0b5366fb9c0059b333"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/backends.py: skills/last30days/scripts/lib/backends.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in backends._resolve_alternative at line 679. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/backends.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/last30days/scripts/lib/backends.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"deada840caae44c23c2b600ef4a87f3d8873c4773865524f4a1feb453bb568a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/jobs.py: skills/last30days/scripts/lib/jobs.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in jobs._search_jobs at line 348. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/jobs.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/last30days/scripts/lib/jobs.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56a6a42567c04a026c2afb294cf79eafe1c1746caef2f9489dd83ff7ac82e61"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/chrome_cookies.py: skills/last30days/scripts/lib/chrome_cookies.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in chrome_cookies._extract_chromium_cookies_macos at line 205. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/chrome_cookies.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/last30days/scripts/lib/chrome_cookies.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec2602c30fdda275222b9dcec3b79e22fc69d269c9004a1e839f050a9a11765"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/trustpilot.py: skills/last30days/scripts/lib/trustpilot.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in trustpilot.search_trustpilot at line 403. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/trustpilot.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/last30days/scripts/lib/trustpilot.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0729eabc6513209b23c7192a319d60000dfcbe24ff4c83cbd85991583c2184"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/grounding.py: skills/last30days/scripts/lib/grounding.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in grounding.web_search at line 310. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/grounding.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/last30days/scripts/lib/grounding.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec668201a74a6b9105ab9dda35a5886c6df8289079f0b0fb0ee954318f99757b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/last30days/scripts/lib/tiktok.py: skills/last30days/scripts/lib/tiktok.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in tiktok._fetch_post_comments at line 605. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/tiktok.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/last30days/scripts/lib/tiktok.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa60c2e03877ec2f69385e61462dd61771a14bd635f4056fd231ecec8fa258dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/last30days/scripts/lib/signals.py: skills/last30days/scripts/lib/signals.py changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is signals.local_relevance at line 44), 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: Reddit under a blocked search, footer accuracy, and doctor postmortem (#1408)\u201D; \u201Cfix(github): keep pinned repos whose newest release predates the window (#1264)\u201D; \u201Cfix(rerank): weigh real engagement in fallback ranking (#1270)\u201D; \u201Cfix: named creator accounts (--ig-creators / --creators) count as first-party provenance (#1104)\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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/signals.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/last30days/scripts/lib/signals.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b7f6443b74d71d8b7506a70e53a25f28181c5dcd39eef6fc1bfbdee661280a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/last30days/scripts/lib/reddit_shreddit.py: skills/last30days/scripts/lib/reddit_shreddit.py changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is reddit_shreddit.parse_comments at line 154), 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: Reddit under a blocked search, footer accuracy, and doctor postmortem (#1408)\u201D; \u201Cfix(reddit): stop the arctic comment fallback at the enrichment budget (#1340)\u201D; \u201Cfix(reddit): match shreddit attribute names case-insensitively (#1256)\u201D; \u201Cfix(reddit): restore the keyless Reddit lane (comments, ranking, pacing) (#1083)\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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/reddit_shreddit.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/last30days/scripts/lib/reddit_shreddit.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e5b85ac2ddc6de784f19c17d4279f157c8d30a8665d7ce0abdb1b9893c4124"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/last30days/scripts/lib/xurl_x.py: skills/last30days/scripts/lib/xurl_x.py changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is xurl_x.stored_auth_status at line 164), 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(x): sanitize the xurl search query and name invalid-request failures (#1179)\u201D; \u201Cfix(pipeline): bound X-chain and stream waits with deadlines (#1165)\u201D; \u201Cfix: account for watchlist spending before scheduling more topics (#1214)\u201D; \u201Cfix(xurl): recognize the ~/.xurl/auth.yml directory layout (#1027)\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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/xurl_x.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/last30days/scripts/lib/xurl_x.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"198733a765a006cc2913ee570bbac707efd59caa942eb44214ae5fb8543b005b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: mcp/internal/engine/run.go: mcp/internal/engine/run.go changed 5 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 15 (its worst body is engine.Run at line 75), 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(mcp): discover and verify compatible Python interpreters (#1140)\u201D; \u201Cfix(pipeline): bound X-chain and stream waits with deadlines (#1165)\u201D; \u201Cfix(mcp): preserve cancellation and clean up descendant groups (#1166)\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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- mcp/internal/engine/run.go\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":"mcp/internal/engine/run.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d7960ddef848451db94dd5262f1550e2bdadac0fb6d9f6797f3686cb44a724"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/last30days/scripts/lib/brightdata.py: skills/last30days/scripts/lib/brightdata.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 13 (its worst body is brightdata.run_pipeline at line 222), 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(brightdata): restrict child process environment (#1389)\u201D; \u201Cfix(amazon): make Amazon search work again on Bright Data CLI 0.4\u002B (#1345)\u201D; \u201Cfix: account for watchlist spending before scheduling more topics (#1214)\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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/brightdata.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/last30days/scripts/lib/brightdata.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e15a0fdac514d7fb781cb2d4d6e5d55fb55139ed56e52cdc74bd8d86218853c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/last30days/scripts/lib/xquik.py: skills/last30days/scripts/lib/xquik.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 13 (its worst body is xquik._execute_search at line 136), 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: resolve 20 repository review findings (#1326)\u201D; \u201Cfix(pipeline): bound X-chain and stream waits with deadlines (#1165)\u201D; \u201Cfix(x): report handle-lane failures instead of silent no-results (#1116)\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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/xquik.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/last30days/scripts/lib/xquik.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f33af99398580e5d1943c1982db23fe2b348cd11f83e16c5797d3a0490e6e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/last30days/scripts/lib/hackernews.py: skills/last30days/scripts/lib/hackernews.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is hackernews.parse_hackernews_response at line 247), 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(hackernews): order top comments by HN kids, not Algolia id order (#1288)\u201D; \u201Cfix(hackernews): link HN comment quotes to the comment, not the article (#1259)\u201D; \u201Cfix(hackernews): attach top comments by calling enrich_top_stories (#1170)\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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/hackernews.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/last30days/scripts/lib/hackernews.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0b3bba8d08faab33ad51c0ccd5e776a5b4ac9b709c1c63d36b82bfd753427c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/last30days/scripts/lib/transcribe.py: skills/last30days/scripts/lib/transcribe.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is transcribe.transcribe_media at line 59), 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(http): strip credentials from direct request redirects (#1154)\u201D; \u201Cfix: account for watchlist spending before scheduling more topics (#1214)\u201D; \u201Cfix(transcribe): send the skill User-Agent in _post_audio so Groq\u0027s Cloudflare edge stops returning 403 (#983) (#1036)\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 15:02:16 -08:00\u0027 --until=\u00272026-11-13 15:02:16 -08:00\u0027 --full-history --no-merges -- skills/last30days/scripts/lib/transcribe.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/last30days/scripts/lib/transcribe.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"97429603880a8242fb20d044ac639d2a7262868e925ffce5361de367c9235647"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 9 significant file(s) lose their only recent owner: skills/last30days/scripts/lib/backends.py, skills/last30days/scripts/lib/x_envelope.py, skills/last30days/scripts/lib/library_index.py, skills/last30days/scripts/lib/reddit_search.py, skills/last30days/scripts/lib/techmeme.py, skills/last30days/scripts/lib/reddit_enrich.py, skills/last30days/scripts/box_chrome_login.py, skills/last30days/scripts/lib/fetch_memo.py (\u002B1 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9cc078d0457166660209f3ff47fe75adefe9a0a8d2e515bbb8f4cdade3cc675d"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (12 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 136 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), 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/last30days/scripts/lib/hiring_signals.py, skills/last30days/scripts/lib/windows_job.py, skills/last30days/scripts/lib/cjk.py."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060mcp/cmd/last30days-pp-mcp/main.go\u0060 makes this repository a deployable product (line 5)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mcp/cmd/last30days-pp-mcp/main.go"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"74170493c3d5e695ec34872e7600b3ffc9551648a680317bc083d671fb1d90bb"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (71514 LoC, 233 module-visible types across 3 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"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":"7bec0bb72e37269f67497ab79189fd6658be5e7d2063b1b26336263ebb8c42bb"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"a6b12b48b65ce184cbce20a2d8071ab976769ba95d5bf6d396c28f898470a63b"},"properties":{"dependency":{"package":"stdlib","version":"1.25.5","advisory":"GO-2026-6599","aliases":["BIT-golang-2026-111943","BIT-golang-2026-56857","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[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]","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"mcp/cmd/last30days-pp-mcp/main.go","line":9}}}},{"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":"1b3978fb37127cffd3ae378764f9d4d5ba5ab70ede4c3ee13b663caaf9388f4d"},"properties":{"dependency":{"package":"github.com/mark3labs/mcp-go","version":"1.5.0","advisory":"GO-2026-6911","reachability":{"kind":"not-imported"}}}},{"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":"6cc0242b082db86aa0b510a6e4fb548bbe3bbc05dcc5859fbe045501ddfbd3b7"},"properties":{"dependency":{"package":"golang.org/x/text","version":"0.39.0","advisory":"GO-2026-6629","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 119 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 119 of the 136 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: skills/last30days/scripts/lib/xiaohongshu_api.py. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/xiaohongshu_api.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"614f5cc84197770ed70c455daae4a449a46cdd1e884c4eebb0a4c99419240221"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: instagram.py \u2194 tiktok.py: \u0060skills/last30days/scripts/lib/instagram.py\u0060 and \u0060skills/last30days/scripts/lib/tiktok.py\u0060 change together 65% of the time (11 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u00604f2cc42e\u0060 fix(render): quote what videos said, not only the comments on them (#\u2026; \u0060cb44afeb\u0060 fix: guard all .get(key, 0) patterns that can return None (7 files, 1\u2026; \u00605c4fe1ed\u0060 fix: isolate ScrapeCreators transcript HTTP errors from pipeline fail\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/instagram.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dcb2cf804c9fbb4fc32b672eb4231519299646fe1552d9ac7b9322af35cf3a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: dedupe.py \u2194 normalize.py: \u0060skills/last30days/scripts/lib/dedupe.py\u0060 and \u0060skills/last30days/scripts/lib/normalize.py\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060b1b9b8a7\u0060 fix: refine hiring signals job-source behavior; \u0060b38703e5\u0060 feat(truthsocial): Add Truth Social as opt-in source (at that commit the files were still \u0060scripts/lib/dedupe.py\u0060 and \u0060scripts/lib/normalize.py\u0060); \u00609a1059ee\u0060 feat(bluesky): add Bluesky/AT Protocol as social source (at that commit the files were still \u0060scripts/lib/dedupe.py\u0060 and \u0060scripts/lib/normalize.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/dedupe.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b9b8bea4f8389d8400c538fdb565ac4a59f073ae2e6f2d3a73e8c7d4dc4555"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022error\u0022 in response and response[\u0022error\u0022]\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/bird_x.py, skills/last30days/scripts/lib/xai_x.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/last30days/scripts/lib/bird_x.py"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"87373f60dbebd754d11e91c87c0c38a44bdfef6974b828096cf3fea8f0bf109c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate.is_file() and os.access(candidate, os.X_OK)\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/health.py, skills/last30days/scripts/lib/setup_wizard.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/last30days/scripts/lib/health.py"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60f1c8872688d3f1bb1eeda3b5cd1347218a010ea8ebfd22bd5e93407c36b21"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060company.get(\u0022ticker\u0022) or company.get(\u0022ticker_candidates\u0022)\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/last30days.py, skills/last30days/scripts/lib/yahoo_finance.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/last30days/scripts/last30days.py"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7d5472d6b0e3512e13a4d34841c5bbab2bc454a797ac1957e95cfeea90d0f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.get(\u0022AUTH_TOKEN\u0022) and config.get(\u0022CT0\u0022)\u0060 appears character-identically in 4 files \u2014 skills/last30days/scripts/lib/backends.py, skills/last30days/scripts/lib/doctor.py, skills/last30days/scripts/lib/env.py, skills/last30days/scripts/lib/setup_wizard.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/last30days/scripts/lib/backends.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c0c8ece2683215a8ba013ff43a7ed72b2b1ea2405b027e29e3593a3aec7577"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.get(\u0022GOOGLE_API_KEY\u0022) or config.get(\u0022GEMINI_API_KEY\u0022) or config.get(\u0022GOOGLE_GENAI_API_KEY\u0022)\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/pipeline.py, skills/last30days/scripts/lib/providers.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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":7278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4843c40cd2f69915f0b093c9ee26ee87cc5db825b2bda9eff704184acf9f039"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.get(\u0022LAST30DAYS_MEMORY_DIR\u0022) or library.DEFAULT_MEMORY_DIR\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/doctor.py, skills/last30days/scripts/lib/pipeline.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/last30days/scripts/lib/doctor.py"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"760d3543b34e463ea1d1e45b16a15aac4120d2dacbb43369a31ea83978c20476"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.get(\u0022LAST30DAYS_REASONING_PROVIDER\u0022) or \u0022auto\u0022\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/pipeline.py, skills/last30days/scripts/lib/providers.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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9879742a062db49a65097ff9fb72013db24468eb0fa6caee1406f42978b82ae8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.get(\u0022PERPLEXITY_API_KEY\u0022) or config.get(\u0022OPENROUTER_API_KEY\u0022)\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/last30days.py, skills/last30days/scripts/lib/pipeline.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/last30days/scripts/last30days.py"},"region":{"startLine":4114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfcf463d563a62ed4492326142981cfe730f9710649e2c7e8f8960e924382e7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060core.lower() != original_clean.lower() and len(original_clean.split()) \u003C= 8\u0060 appears character-identically in 4 files \u2014 skills/last30days/scripts/lib/instagram.py, skills/last30days/scripts/lib/reddit.py, skills/last30days/scripts/lib/tiktok.py, skills/last30days/scripts/lib/youtube_yt.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/last30days/scripts/lib/instagram.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a49264cf34195c0b0396a3b3cd2d72478daf7291469376e4b7025c5d9136825"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.get(\u0022comments\u0022) or data.get(\u0022data\u0022) or []\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/instagram.py, skills/last30days/scripts/lib/tiktok.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/last30days/scripts/lib/instagram.py"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"88477f773a00daf231f06f422448b495f22bf27a62cbd50acd7743db62ad0163"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060deadline is not None and time.monotonic() \u003E= deadline\u0060 appears character-identically in 6 files \u2014 skills/last30days/scripts/lib/grok_x.py, skills/last30days/scripts/lib/instagram.py, skills/last30days/scripts/lib/pipeline.py, skills/last30days/scripts/lib/tiktok.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/last30days/scripts/lib/grok_x.py"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab6fc73a24dc1205291e04b055bc8bf6fde8e6cc16e28246e6b4b68017a784a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060deadline_monotonic is not None and time.monotonic() \u003E= deadline_monotonic\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/http.py, skills/last30days/scripts/lib/subproc.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/last30days/scripts/lib/http.py"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66525610505817d311de9b649f85e7889b2cbbcd425d6d0899e55a6c0507da4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i[\u0022date\u0022] and from_date \u003C= i[\u0022date\u0022] \u003C= to_date\u0060 appears character-identically in 5 files \u2014 skills/last30days/scripts/lib/instagram.py, skills/last30days/scripts/lib/linkedin.py, skills/last30days/scripts/lib/threads.py, skills/last30days/scripts/lib/tiktok.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/last30days/scripts/lib/instagram.py"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"c959c62390f57be0a576ba64c3399fb946bdb62515c628b9cc8c2232a38cc424"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(item.metadata, dict) and item.metadata.get(\u0022grounding_exempt\u0022)\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/rerank.py, skills/last30days/scripts/lib/signals.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/last30days/scripts/lib/rerank.py"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"82127250e218503e370e4bfad01fba01a0369e758db1e48982e7293565205142"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(pair, (list, tuple)) and len(pair) == 2\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/freshness.py, skills/last30days/scripts/lib/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/last30days/scripts/lib/freshness.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c473d1e600d9f03b49d267679a6f5c3a8fc257ee8da52c380d07630bd3ad57e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(score, (int, float)) and not isinstance(score, bool)\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/digg.py, skills/last30days/scripts/lib/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/last30days/scripts/lib/digg.py"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd57a931eab3e8599e6ba7f9d298f0c81faabe3849a749eaff93bd3df237d6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.metadata.get(\u0022transcript_highlights\u0022) or it.metadata.get(\u0022transcript_snippet\u0022)\u0060 appears character-identically in 3 files \u2014 skills/last30days/scripts/last30days.py, skills/last30days/scripts/lib/render.py, skills/last30days/scripts/lib/youtube_yt.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/last30days/scripts/last30days.py"},"region":{"startLine":3712}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6fbd8a0ffebe34f7c07f0e92c2a44f63c284b4d0f160059bbd42264faea840"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.metadata.get(\u0022outcome_prices\u0022) or []\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/freshness.py, skills/last30days/scripts/lib/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/last30days/scripts/lib/freshness.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ca5bcb5973228e3f48586da05d0143cf8ea4d5b61a8982a05d91ee730acd42"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.metadata.get(\u0022symbol\u0022) or item.container or \u0022\u0022\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/freshness.py, skills/last30days/scripts/lib/stocktwits.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/last30days/scripts/lib/freshness.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c399c8cb5b3d8829bc2e7a7b90cff8dd7b7bcbd9e2ea8986ab234f7826659fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item[\u0022date\u0022] and from_date \u003C= item[\u0022date\u0022] \u003C= to_date\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/reddit.py, skills/last30days/scripts/lib/telegram.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/last30days/scripts/lib/reddit.py"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"2beb626897515de299327d8e97333243555601c04f67d29b3bf3ca7f26046211"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(created_at) \u003E 10 and created_at[10] == \u0022T\u0022\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/bird_x.py, skills/last30days/scripts/lib/xquik.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/last30days/scripts/lib/bird_x.py"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc850009d33b18a61a21f741de42db21099261c05c9e3b69f758f7d19c427a92"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(word) \u003E 4 and word.endswith(\u0022s\u0022) and not word.endswith(\u0022ss\u0022)\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/pipeline.py, skills/last30days/scripts/lib/reddit_listing.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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"b757625474449d08ab390bc6072a1e676d57120845a12a44ec147528e7229838"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not body or body in (\u0022[deleted]\u0022, \u0022[removed]\u0022)\u0060 appears character-identically in 3 files \u2014 skills/last30days/scripts/lib/reddit.py, skills/last30days/scripts/lib/reddit_enrich.py, skills/last30days/scripts/lib/reddit_shreddit.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/last30days/scripts/lib/reddit.py"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c5c073718dae09a86bf70fa9841a758b3cc5a23f80833e05a070ac14c3d712"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not comments or not isinstance(comments[0], dict)\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/render.py, skills/last30days/scripts/lib/signals.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/last30days/scripts/lib/render.py"},"region":{"startLine":4349}}}],"partialFingerprints":{"codehealthFindingId/v1":"84492d849cc5d79eb43147f6c88a2468b2fec1fd034c88c8fc947d588c217996"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(data, dict) or \u0022error\u0022 in data\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/company_resolve.py, skills/last30days/scripts/lib/trustpilot.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/last30days/scripts/lib/company_resolve.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad106df2871776590879582fb292f78654d08b276d52750bd1a341eca36162f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, (int, float)) or isinstance(value, bool)\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/freshness.py, skills/last30days/scripts/lib/pipeline.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/last30days/scripts/lib/freshness.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"449fe7f55683170817da9adff89f09f2fbd5b716cb0e12915295f903f1d4b37d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.environ.get(\u0022LOCALAPPDATA\u0022) or os.environ.get(\u0022LocalAppData\u0022)\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/health.py, skills/last30days/scripts/lib/setup_wizard.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/last30days/scripts/lib/health.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c29b93f725b83e3ee9f7278911c6c83550d9fd8118346e660a7ea6883fde954"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060requested_sources and \u0022amazon\u0022 in requested_sources\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/last30days.py, skills/last30days/scripts/lib/pipeline.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/last30days/scripts/last30days.py"},"region":{"startLine":4580}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dc4e0d5f2fdb20b4dff46e5bce3270ee84031f283c6b0f23529bc6a2357d32"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060requested_sources and \u0022meta_ads\u0022 in requested_sources\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/last30days.py, skills/last30days/scripts/lib/pipeline.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/last30days/scripts/last30days.py"},"region":{"startLine":4604}}}],"partialFingerprints":{"codehealthFindingId/v1":"47884b0d7ee8b9d1e20a6b798db06b2572e4dd873283f005dd3e0383d3f7482b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.returncode == 0 and result.stdout.strip()\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/env.py, skills/last30days/scripts/lib/github.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/last30days/scripts/lib/env.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2d032cea51282b1ff53ba790843584e52ec4c566bbb44428b1a3459ecb7e78"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060summary.get(\u0022strategic_candidates\u0022) or []\u0060 appears character-identically in 2 files \u2014 skills/last30days/scripts/lib/pipeline.py, skills/last30days/scripts/lib/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/last30days/scripts/lib/pipeline.py"},"region":{"startLine":4306}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3ced8f0b10d74baea1bb9bc51e241f380ac9e18f58a8e8e357a852405dcdcc"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060request\u0060 is public, takes a document from its caller (line 848) and hands it to \u0060_scrub_fixture_value\u0060, which calls itself at line 214 (\u0060_scrub_fixture_value\u0060) with a piece of \u0060value\u0060 (and at line 222) \u2014 and nowhere in \u0060_scrub_fixture_value\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_scrub_fixture_value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/http.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91789ea31fde5b3a4644bdeffeaeb77444194f05c4ad98f45bf9b0af5d94337"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060request\u0060 is public, takes a document from its caller (line 848) and hands it to \u0060_collect_secret_values\u0060, which calls itself at line 248 (\u0060_collect_secret_values\u0060) with a piece of \u0060value\u0060 (and at line 251) \u2014 and nowhere in \u0060_collect_secret_values\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_collect_secret_values\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/http.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d792847bd883b6d1cd08bbf98107feadbd6f711175658d91f711f8479bf40082"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060to_dict\u0060 is public, takes a document from its caller (line 466) and hands it to \u0060_drop_none\u0060, which calls itself at line 19 (\u0060_drop_none\u0060) with a piece of \u0060value\u0060 (and at line 24) \u2014 and nowhere in \u0060_drop_none\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_drop_none\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/schema.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce4e28e1c44d0afc656b240c944d881c77a722e773ae3ec8b9df24a7e6e0ab9"}},{"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/last30days/scripts/last30days.py"},"region":{"startLine":5036}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3fbdfed32cb429c4c8800584aed9b67894ecd57525de0f126109ed99be89ab"}},{"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/last30days/scripts/lib/chrome_cookies.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1949613d08ec7e28a34acad300bc8dffef69b4926a391c4fa2656e2fdd0f11ac"}},{"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/last30days/scripts/lib/chrome_cookies.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b6a553a2f575177be4ed2b88bb702cebcc625c170bfda7f52ef7bd48e594a4"}},{"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/last30days/scripts/lib/chrome_cookies.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d78c3b4584dcb5f62c391a2857cef24c57a77c88acf2b4f70e12eadac49874"}},{"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/last30days/scripts/lib/cjk.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8095bd9e40a04861521ed6111619c101fee99511d2ec97bbb1d3869c8ace4a2b"}},{"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/last30days/scripts/lib/doctor.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6891be7409c2f611b139d491ae05c6df25f11259ed6e92f3084e1adc962ae8d8"}},{"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/last30days/scripts/lib/doctor.py"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a109d864df7d2a39792597b0d62068697b85a6ecb86ba827dbcaa5b055e8d190"}},{"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/last30days/scripts/lib/doctor.py"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"647f8f5bf1cc289cc2c88947aeb8f76df5a71751dba1db7a1c61ca9095b777ab"}},{"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/last30days/scripts/lib/doctor.py"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"26eda9f22cade4fa17ff69c008149d0bd4b4d19741096429273ef700b11dee3d"}},{"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/last30days/scripts/lib/doctor.py"},"region":{"startLine":2215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2ba8a5a30f0c44ea9e484fcebc62aa6a9c3ffd41bc8c40627710706e0ee3b3"}},{"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/last30days/scripts/lib/doctor.py"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfeb8321841924e46662f3177df2de4e37ee343918bb8975473d685e246f651"}},{"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/last30days/scripts/lib/env.py"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a439726ba6c33d04781ffd5ab61c58b36524d83baf12afd9bb2bd8d050b8f09e"}},{"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/last30days/scripts/lib/env.py"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fafc447447e73494aba910c9c7d54f67182da1f2871522f4eec8449e613af8"}},{"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/last30days/scripts/lib/env.py"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fff4bd73cbceddd90e738c12de6d8a1f7d8951526b2e6cdb56e708bb2cddca"}},{"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/last30days/scripts/lib/github.py"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a56779aea2ce078ed20598982ebc09b813b21a8250f7e27a1b799ae48f23ff3"}},{"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/last30days/scripts/lib/jobs.py"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"78716d902f1f813238940646d646342a43445f45630d46caf7e1c6df88a9566a"}},{"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/last30days/scripts/lib/quality_nudge.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cf6c809e251e5f58606de16068887bfac22de9ea3dc2494ed2b289bd1084d9"}},{"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/last30days/scripts/lib/reddit.py"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a455044c525e18205aed88ddedf7e0911a82ca5a1e4837fc198cc608b8c3b8a"}},{"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/last30days/scripts/lib/reddit_keyless.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"92780fc18370eebc48b9218d97b1f23ef8d6de5e86e1ed7514a6d03a76e02995"}},{"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/last30days/scripts/lib/reddit_keyless.py"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"51117d49cf9ded579479aa08a9736b02fc9ca4b51ad7e716601068cd4d5fd306"}},{"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/last30days/scripts/lib/reddit_keyless.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c25f44dc575ccb68c348ba3f29103de39b7294c116f36ae4cdf9241ff1413eb"}},{"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/last30days/scripts/lib/reddit_keyless.py"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"0943c085410e4b8722ca38e5871674eb0a927fa6ae410a3ce169b2dff138f8ea"}},{"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/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2828987f389a7d5726ee2678b3717d4141865483255c303336eea4260ed564b"}},{"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/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"793bf79a8dc5341423171b523ffd4734af811a69acb62969c0949dcc6116a63f"}},{"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/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"283c7fe94fe2eb2aa020927fe2722ed88e48534b48c145000f65ea0401eed76d"}},{"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/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"049ce1b81a2f2eaadcb1039d25c24c748b03d1291622bc6c2b91b0d84f80b9c7"}},{"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/last30days/scripts/lib/subproc.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b409fec6a2b8f781778f8130b945058f190b9cb40e433c55cfad37d0a29ae1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"mcp/internal/engine/extract.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e5869b71424c977dcce7d19965eecbdde76cfcb0abdf242c723fc99ad854d2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"mcp/internal/engine/python.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d7374185e54cd93561fa96dfcf1c930e03df0daf2cbd1ad673a3496ab9289e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\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":"mcp/internal/engine/python.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee157cea2f0912a53d5855f2e812e0f00a151777ad09d74294519ae4a4db6b1"}},{"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/last30days/scripts/lib/jobs.py"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b3a964611b4a6c9b0b37fe64ef80f0fb3aa0f508f5ea5516fdcb1a0347e74d"}},{"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/last30days/scripts/lib/patents.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bd04832911f8c2c578990bea4251cbac82718274aea987aa5e300205152b27"}},{"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/last30days/scripts/lib/patents.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"39635a7631a82e78845a93029e4fc12b3ac6d9aec7b9ced74cf393c2563edcba"}},{"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/last30days/scripts/lib/reddit_search.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba265ce3434dd7896aa5570811fc755b5023814e22de598ea9d426237573106d"}},{"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/last30days/scripts/lib/reddit_shreddit.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"757977bc6769373eb39ea773567ea80e998d184bb6eee44b69985b94931801bf"}},{"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/last30days/scripts/lib/web_search_keyless.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff196b75f5983a193433d9e7e60b1f7545556e2db5740bf20aac88aa773ca92"}},{"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/last30days/scripts/lib/web_search_keyless.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"263e979a77022eb37455dfc9d61a60d4761dc0dd2bfa980b7da629eac447051b"}},{"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/last30days/scripts/lib/web_search_keyless.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9285897b9d8b14a5ce634a3202bfa174ca4daf3c59cb43407d79f244ed1db7b"}},{"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/last30days/scripts/lib/web_search_keyless.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"880357053ffb4c5bd3f41fd88c04b905073e2e05b1b8fdc374c381ceefa5b821"}},{"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/last30days/scripts/lib/web_search_keyless.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa00c4b2895543f7d9cc95f1602856b83eb9ec9dad9c477171d077a2994fedf"}},{"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/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1aea4b3351ed26b6244c4785fd1b3cc659dd83f180a9831c911e97c49e23c5b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_as_int\u0060 returns \u00600\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/last30days/scripts/lib/amazon.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"8577a9684833bbc5e7c2ea8dad6b84b54192cc22d0a984fec8e85aa4aa53d4ff"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060get_date_confidence\u0060 returns \u0060\u0027low\u0027\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/dates.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"db81fa13a5ae4e7619e7cb2dfc2f756d6cd648fb147ca8e6f8825f64d07d1101"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_window_days\u0060 returns \u006030\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/devto.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bdcdd8db0d5a87c686aa2631d6d20aebd86f9d28d9813f29c616173a8ceeee"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_rank_score\u0060 returns \u00600.0\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/last30days/scripts/lib/digg.py"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f90b86f0f5d0358e473966e7d770844c904a0bc444ab9d7114127fbb7264126"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_age_label\u0060 returns \u0060\u0027\u0027\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/last30days/scripts/lib/doctor.py"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6ac689ab1b3553bf027f6815ed082147567b1a0227ce7885f703488d308918"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060reddit_sc_min_items\u0060 returns \u00600\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/last30days/scripts/lib/env.py"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa3cf969051063ba31118a33dd64b88ffa2f601166dd15e0efe0e571e86ded3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060youtube_sc_min_items\u0060 returns \u00600\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/last30days/scripts/lib/env.py"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"9005ded910199c1b7da4a93fb7516246afcebf6527d61776a6cda0d8d8505d95"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_read_cache\u0060 returns \u0060{}\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/grok_audit.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5c8039bab7d0e3fca6dd78bebe26f67d890627697088bf355eeeae5da8312b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_parse_error_body\u0060 returns \u0060{}\u0060 when \u0060(json.JSONDecodeError, 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/last30days/scripts/lib/hosted.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2092a3184ae155b2428a55af6287e5dd60fa13a151bb554962742941217e3a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_posting_board\u0060 returns \u0060\u0027\u0027\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs.py"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"62df85db3e3ae0a0aab3fdada3968913b550a679f8d534dd2d110089fb501d41"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_host\u0060 returns \u0060\u0027\u0027\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs.py"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f651a5317193d9a39586dc46570f669038424acc17cbac2a8503051764a4c0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_reported_total\u0060 returns \u00600\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/last30days/scripts/lib/jobs.py"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e00c5f845ea7cab31a8702662ee1028bf5567a9f9fc2e98064e4efeed1caff"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_walk_jsonld\u0060 returns \u0060[]\u0060 when \u0060(json.JSONDecodeError, 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/last30days/scripts/lib/jobs.py"},"region":{"startLine":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"586040b1b7e26f73427aa6ce383aadcac109c5271f4dacd86dfa0fa78d5f399e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_domain\u0060 returns \u0060\u0027\u0027\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/jobs.py"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72aa5b9d407c6c0a838704b1f8a1fd7b6a7c8a3840b8becbf99fa3745488c37"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_envelope_total\u0060 returns \u00600\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/last30days/scripts/lib/meta_ads.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9f1d530516cca9dd1940c5c731f9f3bff8a0103eacd51141fc4375299f59a2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_parse_outcome_prices\u0060 returns \u0060[]\u0060 when \u0060(json.JSONDecodeError, 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/last30days/scripts/lib/polymarket.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd939c009781edab3b486b2e6d4f9a89a828debc61a875108e5cabdfc7cb1250"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060market_volume\u0060 (in \u0060parse_polymarket_response\u0060) returns \u00600\u0060 when \u0060(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/last30days/scripts/lib/polymarket.py"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39fcf75a9ed2823268aa8d0ac09c2d5406ae0550b81d1e1112aee10566b88ce"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_window_to_time_filter\u0060 returns \u0060\u0027month\u0027\u0060 when \u0060(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/last30days/scripts/lib/reddit.py"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"df09882f2800531712f067d89d6509420e85ee41395aa0e4d37a91073a8dfb60"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_clamp_device_interval\u0060 returns \u00605\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/last30days/scripts/lib/setup_wizard.py"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52ff677bcb130ca67325cb4e76f41c96ef981ef2d749826dfbfb3fb2df2dd36"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060log1p_safe\u0060 returns \u00600.0\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/last30days/scripts/lib/signals.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e58db0caff2c3ca76442225856c455bfc6a5b12db7038bf2dd7f690f0443fb4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_domain\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(ValueError, AttributeError)\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/last30days/scripts/lib/web_search_keyless.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bbfbfb7901093604ab22bf0b12359719f1315b95e168d5b12b2c3d30a1fd43"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_int\u0060 returns \u00600\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/last30days/scripts/lib/x_envelope.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd12e79e7395285572845f4857813ac7c5f08f692dba2b60f6be8317480383b6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_to_int\u0060 returns \u00600\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/last30days/scripts/lib/xiaohongshu_api.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7540dcf5b3bf2ded09191402e4efc74e192a96cdff0658f606a554f305d3314"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_transcript_fast_attempts\u0060 returns \u00601\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/youtube_yt.py"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"53371f269ca6a00ec76ef805ba493b7e477dfac2aac9a7ab3e4e657abe05643e"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060word.endswith(\u0022s\u0022)\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060word.endswith(\u0022es\u0022)\u0060 also satisfies \u0060word.endswith(\u0022s\u0022)\u0060, so the \u0060\u0026\u0026\u0060 chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/last30days/scripts/lib/polymarket.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0ad0922aa300d0d236a4426233b18de332dc1fd7e58e8154ae546dbeb95cab"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-242","guid":"5c147e5c-be37-b051-9928-764ef5a8f3d3","name":"CWE-242","shortDescription":{"text":"CWE-242"},"helpUri":"https://cwe.mitre.org/data/definitions/242.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-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"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-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":7,"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."]}]}