{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","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-1032","CWE-732","CWE-16"],"owasp":"A02: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":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AXA1","name":"Runtime unauthenticated reachability","shortDescription":{"text":"Runtime unauthenticated reachability"},"helpUri":"https://codehealth.canine.dev/dimensions/AXA1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"AXH1","name":"Runtime security headers","shortDescription":{"text":"Runtime security headers"},"helpUri":"https://codehealth.canine.dev/dimensions/AXH1"},{"id":"AXI1","name":"Runtime container hardening","shortDescription":{"text":"Runtime container hardening"},"helpUri":"https://codehealth.canine.dev/dimensions/AXI1"},{"id":"AXO1","name":"Runtime API surface","shortDescription":{"text":"Runtime API surface"},"helpUri":"https://codehealth.canine.dev/dimensions/AXO1"},{"id":"AXR1","name":"Runtime accessibility (rendered)","shortDescription":{"text":"Runtime accessibility (rendered)"},"helpUri":"https://codehealth.canine.dev/dimensions/AXR1"},{"id":"AXS1","name":"Runtime exposed surface","shortDescription":{"text":"Runtime exposed surface"},"helpUri":"https://codehealth.canine.dev/dimensions/AXS1"},{"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":"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":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"bench_synthid_text.main (cyclomatic 70): bench_synthid_text.main 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":3397}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc3c7b242393147ce1e65d47215995d417a1cdb8d3e43c8cfbcec06f478a22a"}},{"ruleId":"D1","level":"warning","message":{"text":"clean_file.main (cyclomatic 69): clean_file.main has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/clean_file.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a118fe71a2a3767b53d1454c7aa107dc40483eb06ad1584982e3e25e8dbab839"}},{"ruleId":"D1","level":"warning","message":{"text":"rewrite_text.rewrite (cyclomatic 55): rewrite_text.rewrite has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/rewrite_text.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ba65b5e2eb0e624a49c64c9d12c097d02f9a2e3c04ed16e6ca90e2042c3a19"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta._scrub_ooxml_zip (cyclomatic 50): container_meta._scrub_ooxml_zip has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":2709}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa104448aa34e0506cfd29fce7d17b568f5dbbee43dde581774ed82236da0ae"}},{"ruleId":"D1","level":"warning","message":{"text":"bench_synthid_text.aggregate (cyclomatic 45): bench_synthid_text.aggregate 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"0471d3efa2c6a3f9564f19c8e98821f42087c32642aa191a793cc8b7981466f9"}},{"ruleId":"D1","level":"warning","message":{"text":"text_unicode._decide (cyclomatic 45): text_unicode._decide 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":"service/scripts/text_unicode.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1216b09c07379332b3d319918db218673422617b5ece030b4b0c0d055ebc9d"}},{"ruleId":"D1","level":"warning","message":{"text":"text_unicode._decide (cyclomatic 45): text_unicode._decide 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/clean-user-facing-text/scripts/text_unicode.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cde7b0d52d02b3cdfe396c6e40797cbc0bcb9ef4a0dff9b7231d40f6b338fe8"}},{"ruleId":"D1","level":"warning","message":{"text":"text_watermark.parse_watermark_options (cyclomatic 42): text_watermark.parse_watermark_options has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_watermark.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c98a49c3fe13796bd01ba3c9bcb815d16335ea386f9188fa263893b61b14183"}},{"ruleId":"D1","level":"warning","message":{"text":"image_meta.strip_tiff (cyclomatic 40): image_meta.strip_tiff 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":"service/scripts/image_meta.py"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d78cef60318d4ca6fdde5bef7759f0962bbe58714a9f32d26b78912be3c749"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_website.guess_kind (cyclomatic 37): audit_website.guess_kind has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/audit_website.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f81c558cf21d6487066f89091fb06ef1ca71071df26b6db41e61a6c6115b255"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta.clean_epub (cyclomatic 37): container_meta.clean_epub 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":"service/scripts/container_meta.py"},"region":{"startLine":3224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e170cf42d78a660772066697342caf7e439c5d33268103a39ebff89914061153"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta._inspect_ooxml_zip (cyclomatic 36): container_meta._inspect_ooxml_zip 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":"service/scripts/container_meta.py"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23159b9d267c819f9c96efd07a4602d306b2c4d7ed3ff6daa86b90a8dd85c6c"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta.detect_container_format (cyclomatic 33): container_meta.detect_container_format has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"90273b6fa63e5fe191d5aa58cea8fa29fc4188bc83168065b87672ee7a2d2fb6"}},{"ruleId":"D1","level":"warning","message":{"text":"Benchmark._adaptive_apply_strategy (cyclomatic 32): Benchmark._adaptive_apply_strategy 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffafc2aed04d4157ae927774bae2b5dabe63570fb36b001372a6b13c0acc4b9c"}},{"ruleId":"D1","level":"warning","message":{"text":"image_meta.inspect_isobmff (cyclomatic 32): image_meta.inspect_isobmff 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":"service/scripts/image_meta.py"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c16ca58bbbdc7f5e93d4ce442eb66be2d6277f90212bf51c7899c507a8f82c9"}},{"ruleId":"D1","level":"warning","message":{"text":"server._clean_payload (cyclomatic 32): server._clean_payload 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":"service/scripts/server.py"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7835d09f7afa6d7a5d59c8da3ab6c9f9ca0ca85283206cd1f47e21673397955a"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta.inspect_container (cyclomatic 31): container_meta.inspect_container has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":4514}}}],"partialFingerprints":{"codehealthFindingId/v1":"9802b94088ef8de5c68bddc747b16cdc1ac18ec146294eceedced677b03c4c9d"}},{"ruleId":"D1","level":"warning","message":{"text":"Benchmark.minimal_search (cyclomatic 29): Benchmark.minimal_search 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ca1587dc1c1a9044621f1199fe4fd24fa49ead9f712f37262fecf6bab6fb16"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta._latex_pdfinfo_items (cyclomatic 27): container_meta._latex_pdfinfo_items 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":"service/scripts/container_meta.py"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb23811e9fbe248efd3d47fa76386638ee47a7fc5561906c91d6658e65f38b9"}},{"ruleId":"D1","level":"warning","message":{"text":"bench_synthid_text.render_markdown_strategy (cyclomatic 26): bench_synthid_text.render_markdown_strategy 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":2794}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6d42ed8a9fbf0cf0becb40035118a8013fdb13b5c3c02067878741423bb485"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta._script_tag_is_jsonld (cyclomatic 26): container_meta._script_tag_is_jsonld has cyclomatic complexity 26 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"571d02392f54c2072619df240bc8a2bd8769d79914f1db81a07aceadd50e3386"}},{"ruleId":"D1","level":"warning","message":{"text":"image_meta.strip_jpeg (cyclomatic 26): image_meta.strip_jpeg 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":"service/scripts/image_meta.py"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7328eb882fd6dbd97f1936cce84e5fc1a99bcfaef9ce9773520cc637e842f6"}},{"ruleId":"D1","level":"warning","message":{"text":"image_meta.strip_isobmff (cyclomatic 26): image_meta.strip_isobmff 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":"service/scripts/image_meta.py"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b971198e5672d920cd2bd86924236ccb753022b6904ae6f7ec62b3d3e8e4c2"}},{"ruleId":"D1","level":"warning","message":{"text":"Benchmark.strategy_search (cyclomatic 25): Benchmark.strategy_search 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4651351c1269115f5083537e98e761008631e5929b3ac364ab0cdbe9a6637c6"}},{"ruleId":"D1","level":"warning","message":{"text":"bench_synthid_text.aggregate_minimal (cyclomatic 25): bench_synthid_text.aggregate_minimal 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":2500}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcb251183bedfbba67206deec83c1d484e2f9fe5c12cd958fe6b6da50dc5351"}},{"ruleId":"D1","level":"warning","message":{"text":"clean_image.main (cyclomatic 25): clean_image.main has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/clean_image.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cae83e61a6ff3d521674f0dc74cd1617d5582bde865df9cb3748fbe0ee53d62"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect_file.main (cyclomatic 25): inspect_file.main has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/inspect_file.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49aebf85005188a92c471778bc4a931d4693612101133550a495457d312ac18"}},{"ruleId":"D1","level":"warning","message":{"text":"Benchmark._eval_strategy (cyclomatic 24): Benchmark._eval_strategy 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1a5ebd3b30bdef177d2269dd00ad5a2b2c732c637abc467ef1236f311b2ada"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta.clean_pdf (cyclomatic 24): container_meta.clean_pdf 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":"service/scripts/container_meta.py"},"region":{"startLine":4294}}}],"partialFingerprints":{"codehealthFindingId/v1":"56be4181343f518dec27eaf0fbe4c176109e2319bb23dd504bbf7dfe46f13877"}},{"ruleId":"D1","level":"warning","message":{"text":"image_meta.inspect_jpeg (cyclomatic 24): image_meta.inspect_jpeg 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":"service/scripts/image_meta.py"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff856a88692f5332127972b620991a351bdb7d428f4d85a832546eeef4b63974"}},{"ruleId":"D1","level":"warning","message":{"text":"score_stylometry.score_text_stylometry (cyclomatic 24): score_stylometry.score_text_stylometry has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/score_stylometry.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebf0d5f0e60d74ecb54eec0ab7c51acb162e0633909a51740c0b638d8c83056"}},{"ruleId":"D1","level":"warning","message":{"text":"score_stylometry.score_text_stylometry (cyclomatic 24): score_stylometry.score_text_stylometry has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clean-user-facing-text/scripts/score_stylometry.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b234b70c8213a5ad194757a416473d6de8671ac41ad5d63558a85a8ec2ac00"}},{"ruleId":"D1","level":"warning","message":{"text":"download_prompts.main (cyclomatic 24): download_prompts.main 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":"stealer/download_prompts.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6743469fb00d06d6c16a58173d77874764c8313fc5a1a25681ff89055a3de503"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta._pdf_clean_attachments (cyclomatic 23): container_meta._pdf_clean_attachments 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":"service/scripts/container_meta.py"},"region":{"startLine":4069}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab6190a765a24cf2c8a2d8e0da798bfe9cb55d529e0ddb9d670e4e6e202c85c"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta.clean_container (cyclomatic 23): container_meta.clean_container 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":"service/scripts/container_meta.py"},"region":{"startLine":4664}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afa350f1185b21aa9b55a0d6d282d7c59d2b83313434fe233c77099289f9d7d"}},{"ruleId":"D1","level":"warning","message":{"text":"image_meta._parse_tiff_ifds (cyclomatic 23): image_meta._parse_tiff_ifds 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":"service/scripts/image_meta.py"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"23db67fc055cd73d883e8a0b264e70f667c71195b8256aae1b52b6530abbeb3f"}},{"ruleId":"D1","level":"warning","message":{"text":"Benchmark.run_variants (cyclomatic 21): Benchmark.run_variants 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd16b746b168269666e6066c11540e8fa5cb804b59c663c4c828aee2285f21d"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta.inspect_epub (cyclomatic 21): container_meta.inspect_epub 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":"service/scripts/container_meta.py"},"region":{"startLine":3092}}}],"partialFingerprints":{"codehealthFindingId/v1":"288296abb2921175b098ff7d8665ce6a89feefb552f0e24fce148d19f0bd7687"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_lib.scan_file (cyclomatic 20): audit_lib.scan_file 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":"service/scripts/audit_lib.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fe4b23c01f8257109b4ae0e58faa80272f202cba7bc01d566eb74613a02fc5"}},{"ruleId":"D1","level":"warning","message":{"text":"bench_deepseek_smoke.run (cyclomatic 20): bench_deepseek_smoke.run has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/bench_deepseek_smoke.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ba65f207361eac9c13eccc3e2d09fba1fff17c00eac245c6cb3e3c13d6ecb0"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta.clean_odt (cyclomatic 20): container_meta.clean_odt 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":"service/scripts/container_meta.py"},"region":{"startLine":2954}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98f7feb2b282effc8945cc99dbf9442e78a2e1d93b075b0a370a44cf59c8c62"}},{"ruleId":"D1","level":"warning","message":{"text":"image_meta.inspect_gif (cyclomatic 20): image_meta.inspect_gif 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":"service/scripts/image_meta.py"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"5292e27d308a4ea249ada53222fb8815fa98fa7bda8148ef28f0c43ee035a09b"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect_image.main (cyclomatic 20): inspect_image.main has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/inspect_image.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1a7170f5637bae51c977dd1b075541968d234412a72bd3855ed951adecbf33"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkLLMTextDetector.detect (cyclomatic 20): MarkLLMTextDetector.detect 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":"service/scripts/text_detectors.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"60938575e0d15f8f9aee1b1e8551d820381e8922ff150c23d20c704e56089f97"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta.clean_markdown (cyclomatic 19): container_meta.clean_markdown 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":"service/scripts/container_meta.py"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e70288db062b8893c7bfc7576e60f794cbe599bb4c788b4841c020910e5dc3"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta._strip_root_svg_attrs (cyclomatic 19): container_meta._strip_root_svg_attrs 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":"service/scripts/container_meta.py"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"8053035b7aa72c4bbb1f539e93b24a3a4155baeb1987fc59c94024e2dc3f4b4b"}},{"ruleId":"D1","level":"warning","message":{"text":"image_meta.strip_gif (cyclomatic 19): image_meta.strip_gif 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":"service/scripts/image_meta.py"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"280041358f1be6824b3e6efd3cc173aee0947e51aa0668af8ea9914ce075e6df"}},{"ruleId":"D1","level":"warning","message":{"text":"image_meta.inspect_image (cyclomatic 19): image_meta.inspect_image 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":"service/scripts/image_meta.py"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa82b12c1b254125dae022d967519b94f9b295eff3a0249be37ea9dd3204e5e"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_dir.main (cyclomatic 18): audit_dir.main has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/audit_dir.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"827c815615a51aaa4f97427c2dfc41d9c06dc1f4a6a5e3536e6403b53e6620da"}},{"ruleId":"D1","level":"warning","message":{"text":"image_meta.inspect_png (cyclomatic 18): image_meta.inspect_png 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":"service/scripts/image_meta.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1ea98effac18a6af43b92687f239c82c3733f3d18b7ac24554fd9a160a0c25"}},{"ruleId":"D1","level":"warning","message":{"text":"image_meta.clean_image (cyclomatic 18): image_meta.clean_image has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/image_meta.py"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"047f4b01338e4d54e3fff5fbf8f27a02149d4ba07289dc17b1e4430ea70bc163"}},{"ruleId":"D1","level":"warning","message":{"text":"server._apply_layer_b (cyclomatic 18): server._apply_layer_b 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":"service/scripts/server.py"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb577e10d58459e38eddc07cedea31a00414169f216f95ee7d79f22864ab879"}},{"ruleId":"D1","level":"warning","message":{"text":"text_watermark.normalize_keys (cyclomatic 18): text_watermark.normalize_keys 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":"service/scripts/text_watermark.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9dab29c305a605da0810af8b4569c4988a943eee262661f991a350e1174dbb"}},{"ruleId":"D1","level":"warning","message":{"text":"HumanLikeness._pangram_batch (cyclomatic 17): HumanLikeness._pangram_batch 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ac933423ce5db9ea4d1c858fd8cc69fa867ebb88ed497dd0a90842b7ef59a9"}},{"ruleId":"D1","level":"warning","message":{"text":"bench_synthid_text.render_markdown (cyclomatic 17): bench_synthid_text.render_markdown 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":2553}}}],"partialFingerprints":{"codehealthFindingId/v1":"524b24856d4c2817843faa663d4e55594d62716d8290a5368ff71e10e5d8e6e7"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta._latex_verbatim_ranges (cyclomatic 17): container_meta._latex_verbatim_ranges 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":"service/scripts/container_meta.py"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b8f26b51f5abe5fd32a682720bce68d48d78862802a603192fc477297a87ef"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta.inspect_latex (cyclomatic 17): container_meta.inspect_latex 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":"service/scripts/container_meta.py"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"057279ce42ae0ab4dd8497c840d3ffd6cb11966ab4b2745cd7f3f0ee3fd4e77c"}},{"ruleId":"D1","level":"warning","message":{"text":"rewrite_text.main (cyclomatic 17): rewrite_text.main 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":"service/scripts/rewrite_text.py"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d569e79fd6e95c93b5ba32aef0cca8aaa975a0140ba4a65aed72470205c3fab"}},{"ruleId":"D1","level":"warning","message":{"text":"steal.cmd_query (cyclomatic 17): steal.cmd_query 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":"stealer/steal.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57bea26a596b9198e38025bdb706c4720756a4ce84f93261bf47402cc6e14c7"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_website.main (cyclomatic 16): audit_website.main has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/audit_website.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"693d9a4c6ce8b8a3e5d97bc7437e4775d5f7b0e936d95b935edf2525e67b495f"}},{"ruleId":"D1","level":"warning","message":{"text":"av_meta._parse_id3v2_frames (cyclomatic 16): av_meta._parse_id3v2_frames 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":"service/scripts/av_meta.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7cccaa05c8fc9d3b4286fa6e6a562f4c2be9dcadad6b8a5290d82d0d7e9fb2"}},{"ruleId":"D1","level":"warning","message":{"text":"av_meta._strip_id3v2 (cyclomatic 16): av_meta._strip_id3v2 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":"service/scripts/av_meta.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dc7f3e3c616e64016348451aa00f54a435f1d5199f9b0f7df5ed3823b08d50"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta._iter_data_uris (cyclomatic 16): container_meta._iter_data_uris has cyclomatic complexity 16 (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":"service/scripts/container_meta.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"449a1fe85823714469f6cd1419aa37bab7f6e823617257a23117dd0af2df86ac"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta._inspect_embedded_data_uris (cyclomatic 16): container_meta._inspect_embedded_data_uris 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":"service/scripts/container_meta.py"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df608f7fc43195b158d335b3e4358d969da520a5bf4b221dbeaa83486134e20"}},{"ruleId":"D1","level":"warning","message":{"text":"container_meta._pdf_attachment_list (cyclomatic 16): container_meta._pdf_attachment_list 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":"service/scripts/container_meta.py"},"region":{"startLine":3825}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0eadf5036636b24e549c0b509f68ab6aad4269b8fea4a26be9a479016a4bdc"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect_text.main (cyclomatic 16): inspect_text.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/inspect_text.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5b399bab9024b3e12567d7e7bc58d5e307bbf17501e9ecb0ead69bce085e9e"}},{"ruleId":"D1","level":"warning","message":{"text":"Handler._handle_watermark_batch (cyclomatic 16): Handler._handle_watermark_batch 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":"service/scripts/server.py"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"684b67a7cb8c5410566cc03fd13d544f58cf17a27b73d4987557298b0ba2af03"}},{"ruleId":"D1","level":"warning","message":{"text":"text_watermark._watermark_local_markllm (cyclomatic 16): text_watermark._watermark_local_markllm 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":"service/scripts/text_watermark.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"821701f0a56a0ec03f06ffb06604fe2c84527b94511d3e8513c1bb39aee6019c"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect_text.main (cyclomatic 16): inspect_text.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clean-user-facing-text/scripts/inspect_text.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab9860b17bfb23a5fb710e18815dde61e2bf8b4569b14206275ce1de2d65705"}},{"ruleId":"D2","level":"warning","message":{"text":"clean_file.main (cognitive 130): clean_file.main has cognitive complexity 130 (threshold 15). Drivers by points: if/else 38 (71 pts), boolean chains 20, loops 5 (20 pts), ternaries 9 (14 pts), error handling 3 (5 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/clean_file.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dc8b38add7aa33c4ae23710c5f3c64a66a667f1efe004399400c4c95859f7b"}},{"ruleId":"D2","level":"warning","message":{"text":"bench_synthid_text.main (cognitive 108): bench_synthid_text.main has cognitive complexity 108 (threshold 15). Drivers by points: if/else 34 (58 pts), ternaries 20 (30 pts), boolean chains 14, loops 3 (6 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/bench_synthid_text.py"},"region":{"startLine":3397}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0202765dc6373e7acbe07bef2b6be290d827033b709f611ad75df8ee34fc4bd"}},{"ruleId":"D2","level":"warning","message":{"text":"rewrite_text.rewrite (cognitive 89): rewrite_text.rewrite has cognitive complexity 89 (threshold 15). Drivers by points: if/else 39 (60 pts), boolean chains 13, ternaries 5 (12 pts), loops 3 (4 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":"service/scripts/rewrite_text.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"937a7881a21d4c8d05fb476514a1c5ee0a59b03a1c0cd75a0e8ada957765e1d7"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._scrub_ooxml_zip (cognitive 88): container_meta._scrub_ooxml_zip has cognitive complexity 88 (threshold 15). Drivers by points: if/else 23 (64 pts), boolean chains 11, loops 5 (10 pts), error handling 1 (3 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":"service/scripts/container_meta.py"},"region":{"startLine":2709}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ba87d1a00ec3b8e9ec94329c059cb57ec669c146bfe076999a20f74175cbb2"}},{"ruleId":"D2","level":"warning","message":{"text":"bench_synthid_text.aggregate (cognitive 81): bench_synthid_text.aggregate has cognitive complexity 81 (threshold 15). Drivers by points: ternaries 20 (40 pts), if/else 18 (35 pts), boolean chains 4, loops 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/bench_synthid_text.py"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"624413a440a130d9fc8de65923e399ebe4488b0674c7405f051dfd4f794e2015"}},{"ruleId":"D2","level":"warning","message":{"text":"image_meta.inspect_isobmff (cognitive 78): image_meta.inspect_isobmff has cognitive complexity 78 (threshold 15). Drivers by points: if/else 20 (68 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 50). 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":"service/scripts/image_meta.py"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e716be160bc912f6df0a7b41c62f207e48e666e13dfad2b42ff22a39d26656"}},{"ruleId":"D2","level":"warning","message":{"text":"image_meta.strip_tiff (cognitive 74): image_meta.strip_tiff has cognitive complexity 74 (threshold 15). Drivers by points: if/else 15 (43 pts), loops 10 (17 pts), boolean chains 7, ternaries 5 (7 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/image_meta.py"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cc9e3356f718fb122dd2a6289d9b35981dc4588a9ecc2f457a3be89ace2243"}},{"ruleId":"D2","level":"warning","message":{"text":"Benchmark.strategy_search (cognitive 66): Benchmark.strategy_search has cognitive complexity 66 (threshold 15). Drivers by points: if/else 9 (35 pts), loops 12 (28 pts), boolean chains 3 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/bench_synthid_text.py"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"817e8d1c8e63bb6ed2f5f99512318c3312d4f99d7b7d0d558ffa76475f411503"}},{"ruleId":"D2","level":"warning","message":{"text":"image_meta.strip_isobmff (cognitive 60): image_meta.strip_isobmff has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (47 pts), boolean chains 6, loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/image_meta.py"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebfb03824590d327fa898edc4efc368c59bdc07e4765e56a20eec82d496b366"}},{"ruleId":"D2","level":"warning","message":{"text":"text_watermark.parse_watermark_options (cognitive 60): text_watermark.parse_watermark_options has cognitive complexity 60 (threshold 15). Drivers by points: if/else 28 (43 pts), boolean chains 9, error handling 4 (8 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_watermark.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d30283541146ef39a839853717c562b3f54f8e71d547da8b2a510b4a206e0ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Benchmark.minimal_search (cognitive 58): Benchmark.minimal_search has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (34 pts), boolean chains 9, loops 4 (7 pts), error handling 1 (4 pts), ternaries 1 (4 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d57258a3ad1540ac0890ad64d0639ed87f36b835b8910694f910540c072919"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta.detect_container_format (cognitive 58): container_meta.detect_container_format has cognitive complexity 58 (threshold 15). Drivers by points: if/else 22 (43 pts), boolean chains 8, error handling 2 (7 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ceaf1980c6dc1ba558bb9bbfc908afbd6132301aecf92d202994fbc7e7e111"}},{"ruleId":"D2","level":"warning","message":{"text":"text_unicode._decide (cognitive 58): text_unicode._decide has cognitive complexity 58 (threshold 15). Drivers by points: if/else 22 (36 pts), boolean chains 22 (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":"service/scripts/text_unicode.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a1d968197b43149ebbd27c3a568701ab5045b595a8848b0d53b6c0d0af455b"}},{"ruleId":"D2","level":"warning","message":{"text":"text_unicode._decide (cognitive 58): text_unicode._decide has cognitive complexity 58 (threshold 15). Drivers by points: if/else 22 (36 pts), boolean chains 22 (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/clean-user-facing-text/scripts/text_unicode.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"645c577790264c23463e42cdbe512c2f27f6b58066c7164376b81774d0bbe5e6"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta.clean_epub (cognitive 56): container_meta.clean_epub has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (41 pts), boolean chains 8, loops 3 (4 pts), error handling 1 (3 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":3224}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20ffae897dc924c62047bf6358176f96844aad45891a38f911bd2368513b43e"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._inspect_ooxml_zip (cognitive 55): container_meta._inspect_ooxml_zip has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (43 pts), boolean chains 7, loops 2 (4 pts), error handling 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":"service/scripts/container_meta.py"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbb11c4fc7dc8e6d2020768c4b7f381525b6f9391179bd24f726efc00f0ad3a"}},{"ruleId":"D2","level":"warning","message":{"text":"server._clean_payload (cognitive 53): server._clean_payload has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 8, ternaries 2 (6 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/server.py"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a362e3e16c9821c0d0a59a2a20ac9437515195a936bd5b8c9300e3f825b036d"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._latex_pdfinfo_items (cognitive 51): container_meta._latex_pdfinfo_items has cognitive complexity 51 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 7 (16 pts), boolean chains 9, ternaries 1 (3 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":"service/scripts/container_meta.py"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb29773e27be4dae19374efccaca02ba1214660afadd1ee05a2c3edb67069cd"}},{"ruleId":"D2","level":"warning","message":{"text":"Benchmark._adaptive_apply_strategy (cognitive 50): Benchmark._adaptive_apply_strategy has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 10, ternaries 6 (8 pts), error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/bench_synthid_text.py"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc134bc577b0a03027152954929313a1a4a9fda18ee01203d057a3eee41694ee"}},{"ruleId":"D2","level":"warning","message":{"text":"clean_image.main (cognitive 48): clean_image.main has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 5 (15 pts), boolean chains 7, loops 2 (5 pts), error handling 1 (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":"service/scripts/clean_image.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8132b3d68845449106880b9a0ab38650899c40b5ea011957d36aa047adb944e"}},{"ruleId":"D2","level":"warning","message":{"text":"image_meta.inspect_jpeg (cognitive 44): image_meta.inspect_jpeg has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/image_meta.py"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb95ecb43bf2004acac5daf577272e2747a58f4edc2bc34a570bca803fe83408"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect_file.main (cognitive 44): inspect_file.main has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (25 pts), loops 3 (8 pts), ternaries 4 (7 pts), boolean chains 4 (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":"service/scripts/inspect_file.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d5b145371bb45fa7ad258a69f9e407e469e22bc08b9e23b0420ca07ed86952"}},{"ruleId":"D2","level":"warning","message":{"text":"bench_synthid_text.render_markdown_strategy (cognitive 43): bench_synthid_text.render_markdown_strategy has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 7 (13 pts), loops 4 (9 pts), boolean chains 7 (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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":2794}}}],"partialFingerprints":{"codehealthFindingId/v1":"864a5afebce16e7a4c6dfd1fd1e0cac3c2c0316c55218c0076e2bf98d4b80770"}},{"ruleId":"D2","level":"warning","message":{"text":"Benchmark.run_variants (cognitive 42): Benchmark.run_variants has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 7, error handling 2 (7 pts), loops 3 (6 pts), ternaries 1 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/bench_synthid_text.py"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b3502dddf0f86ceb613fa95db9a5ede53b21519bc108b0ec7eeef8347f1ee0"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._script_tag_is_jsonld (cognitive 42): container_meta._script_tag_is_jsonld has cognitive complexity 42 (threshold 15). Drivers by points: loops 8 (19 pts), boolean chains 12, if/else 6 (11 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3536ce6cf746d1110ef4aff5d8cb764c68c3900f5be6f9b547c259282c4b8e"}},{"ruleId":"D2","level":"warning","message":{"text":"image_meta.strip_jpeg (cognitive 42): image_meta.strip_jpeg has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/image_meta.py"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a00e9803066dbad4333b1b7116e33948fd49f67a19dab9e2ee64ab9d2a1f6a"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_website.guess_kind (cognitive 39): audit_website.guess_kind has cognitive complexity 39 (threshold 15). Drivers by points: if/else 29 (32 pts), boolean chains 6, 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":"service/scripts/audit_website.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"576ffcce5fbd77a092b9f59ea8e2bf9075744bc32046273c102bed9f8e58e96d"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta.clean_markdown (cognitive 39): container_meta.clean_markdown has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (2 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":"service/scripts/container_meta.py"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"436ef7f344a9efd6d2e37168c4cbfe3a6747557eb14b465d667e72dc0937b06b"}},{"ruleId":"D2","level":"warning","message":{"text":"image_meta.inspect_png (cognitive 38): image_meta.inspect_png has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 4, error handling 1 (4 pts), ternaries 1 (4 pts), loops 1 (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":"service/scripts/image_meta.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"be085b386395317d39fd30dcc2dbc97934a208e0bf8cf943ae4de7d707b7849e"}},{"ruleId":"D2","level":"warning","message":{"text":"download_prompts.main (cognitive 38): download_prompts.main has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, loops 3 (5 pts), error handling 2 (4 pts), ternaries 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stealer/download_prompts.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70ca6680013ce5b11d51ac47200e4d50846fce9b0948716fd3cbbc6cf83eebb"}},{"ruleId":"D2","level":"warning","message":{"text":"image_meta._parse_tiff_ifds (cognitive 37): image_meta._parse_tiff_ifds has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (23 pts), ternaries 6, loops 3 (5 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/image_meta.py"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8dfdffac952a00d0cdd2b50f6d0ac09c3660e350504c5edb6ddae4dadf8ff1"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta.clean_odt (cognitive 36): container_meta.clean_odt has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 5, 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":"service/scripts/container_meta.py"},"region":{"startLine":2954}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e925bd747676462de7fe8ebd9b1216abb5f96383a9f30efafc3ca68ad3d7e3"}},{"ruleId":"D2","level":"warning","message":{"text":"text_watermark.normalize_keys (cognitive 36): text_watermark.normalize_keys has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (20 pts), error handling 4 (10 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_watermark.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4568eb7066bad2094dcf8bf2e61f6b6cbb0a002cec4d92fb433eb612ab3e20c8"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._strip_root_svg_attrs (cognitive 35): container_meta._strip_root_svg_attrs has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 2, 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":"service/scripts/container_meta.py"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5b1fb1ee5b5767a3ec32688a310a9f39e4d57c31db06abdcc8e3bbc277412c"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta.inspect_epub (cognitive 35): container_meta.inspect_epub has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 8, loops 2 (4 pts), error handling 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":3092}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d805785064c8106f409ce9480512acc6728206c223a19bc81cafaf850a9d60"}},{"ruleId":"D2","level":"warning","message":{"text":"image_meta.inspect_gif (cognitive 35): image_meta.inspect_gif has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 2, loops 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/image_meta.py"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fd4a04777b88a2c256753a43985f0d031193683240edf124bf966c9f7a4ae7"}},{"ruleId":"D2","level":"warning","message":{"text":"Benchmark._eval_strategy (cognitive 33): Benchmark._eval_strategy has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 4 (6 pts), boolean chains 5, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/bench_synthid_text.py"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"326fc84179437e186b797e9e78d4a275b4bc968614576f6cfb75b769ed2ed5a4"}},{"ruleId":"D2","level":"warning","message":{"text":"bench_deepseek_smoke.run (cognitive 32): bench_deepseek_smoke.run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 5, error handling 2 (4 pts), 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":"service/scripts/bench_deepseek_smoke.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fd625e9977d5ab70c2c0140c614e4db32c80e8041ba98c4741a0da31354875"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta.clean_pdf (cognitive 32): container_meta.clean_pdf has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 8 (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":"service/scripts/container_meta.py"},"region":{"startLine":4294}}}],"partialFingerprints":{"codehealthFindingId/v1":"94baf021ba4ee368fb7122d182ae188ed03cbb9c90bae34799c63e05f9072a2a"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect_image.main (cognitive 32): inspect_image.main has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 4 (8 pts), boolean chains 6, loops 2 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/inspect_image.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06dfcaa6e369cb13a973bda2ba299eef9e831e3c0ae0c73c14511a9f96d0c64"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta.inspect_latex (cognitive 31): container_meta.inspect_latex has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 2 (6 pts), boolean chains 5, loops 3 (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":"service/scripts/container_meta.py"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"5701f15cf4df5c5bd58ed3a92c8038d8693066bb0d2052d679e47c8554ff4cc2"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._pdf_clean_attachments (cognitive 31): container_meta._pdf_clean_attachments has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":4069}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2990e8590a6db28ac4dc1692c8a35cfb4ddcadf8185e4908bd9eb403fa6892"}},{"ruleId":"D2","level":"warning","message":{"text":"image_meta.strip_gif (cognitive 31): image_meta.strip_gif has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (27 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":"service/scripts/image_meta.py"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ed3be68b56e0d68221e93f1d214e1a2d1e58dd73db95c202f92c53e222d45c"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta.inspect_container (cognitive 30): container_meta.inspect_container has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 5 (13 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":4514}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b39d39a232c5b817c47a64600453a0ca2647717b1a97eb248cc8c51b9764c2"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_dir.main (cognitive 28): audit_dir.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 3 (5 pts), ternaries 2, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/audit_dir.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"758dfa48d9779480bb9a454b24296d11a7b54d7821ac03ef5e4206eb1574a89c"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._latex_verbatim_ranges (cognitive 28): container_meta._latex_verbatim_ranges has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"be27c18d589874d6fb4cb4968791f8ac97d39185a89b3433a315021471c4d6e2"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._strip_xml_declarations (cognitive 28): container_meta._strip_xml_declarations has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2aa10a8af3aaba40395f266202df9d61828be41d45a57b807499a6494ff4d2e"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_lib.scan_file (cognitive 27): audit_lib.scan_file has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 7, error handling 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/audit_lib.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4664c97b092450603f5716050cfdafd85e1775dab7e8f5a04bd10f79b1a586"}},{"ruleId":"D2","level":"warning","message":{"text":"steal.cmd_query (cognitive 27): steal.cmd_query has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stealer/steal.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"22586f59e98c435383a4b596cb47317421ebc95485a4699821cb7d0d16c8320e"}},{"ruleId":"D2","level":"warning","message":{"text":"av_meta._strip_id3v2 (cognitive 26): av_meta._strip_id3v2 has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (4 pts), boolean chains 2, 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":"service/scripts/av_meta.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"8251037ce6ac12e75248175fc785af933e8d00229ab78087153526805dafd4b8"}},{"ruleId":"D2","level":"warning","message":{"text":"bench_synthid_text.aggregate_minimal (cognitive 26): bench_synthid_text.aggregate_minimal has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 7, boolean chains 5, loops 3 (4 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/bench_synthid_text.py"},"region":{"startLine":2500}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3a2cb23f353762b6cff127f1b5abde64ae7c76b4581b969dde9cd87795d1c0"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta.inspect_pdf (cognitive 25): container_meta.inspect_pdf has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":3387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4929d1824076d201e11297c923e8d9c2763036a9c68a4eb74f4b90114695cc7f"}},{"ruleId":"D2","level":"warning","message":{"text":"HumanLikeness._pangram_batch (cognitive 24): HumanLikeness._pangram_batch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (5 pts), boolean chains 3, 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde9d69fde500ed5613e1299d463117ffeb92658fe16ab885c1c39144b8045d2"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._iter_data_uris (cognitive 24): container_meta._iter_data_uris has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 4 (8 pts), boolean chains 6 (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":"service/scripts/container_meta.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc0166b6bf6b07d9308662be9397850222d44ab471712ad11a9f87fdd5ee3b0"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta.clean_container (cognitive 24): container_meta.clean_container has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 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":"service/scripts/container_meta.py"},"region":{"startLine":4664}}}],"partialFingerprints":{"codehealthFindingId/v1":"2017a5b28c9d364dd12f8b0929619473fe4f027c7ea4b8c292cb5906d54383fb"}},{"ruleId":"D2","level":"warning","message":{"text":"image_meta.inspect_tiff (cognitive 24): image_meta.inspect_tiff has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (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":"service/scripts/image_meta.py"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a903c0ce0c08bc89183eee5ed42fe53ef2c1fe47343d57148995e32179b8e6"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect_text.main (cognitive 24): inspect_text.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (5 pts), ternaries 2 (4 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":"service/scripts/inspect_text.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"58014a806108c0615d5fbb3fb65050da5c26b68db4cacb89d705b54a3a6fdd81"}},{"ruleId":"D2","level":"warning","message":{"text":"Handler._handle_watermark_batch (cognitive 24): Handler._handle_watermark_batch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 2 (4 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/server.py"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c522b88042f64d078c3eb1f456bad04dfc964080bb57ee27c294eb58bbdacaa"}},{"ruleId":"D2","level":"warning","message":{"text":"server._apply_layer_b (cognitive 24): server._apply_layer_b has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 6, error handling 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":"service/scripts/server.py"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"c633be51eed59c7720b3f528e7e59d7858db6c48443fdc443ff64957e34d721d"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect_text.main (cognitive 24): inspect_text.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (5 pts), ternaries 2 (4 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/clean-user-facing-text/scripts/inspect_text.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a7097c7978d355b76ab128803a9465abfbc618064c27bf5a9a95c910dd0046"}},{"ruleId":"D2","level":"warning","message":{"text":"HumanLikeness._load (cognitive 23): HumanLikeness._load has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (6 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/bench_synthid_text.py"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffe588c39d10f84f8d4ef2c6491b1ca5a7f588dcc3b13ee79f1302cfabd3ef5"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._meta_attrs (cognitive 23): container_meta._meta_attrs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (7 pts), boolean chains 5 (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":"service/scripts/container_meta.py"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"262b783a0f36fc96292cc1758213c8c8a8506fb1d6fb40f54cf3b6ec79ce55c8"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._xml_decl_end (cognitive 23): container_meta._xml_decl_end has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 1, 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":"service/scripts/container_meta.py"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"d089e527a3c74b49b3ec2cb9af1eab1ea2b1c2e01de209289eff1479a61ba583"}},{"ruleId":"D2","level":"warning","message":{"text":"install_skill.parse_frontmatter (cognitive 22): install_skill.parse_frontmatter has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"install_skill.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dbf22e4e92ff984900f9b2600bae18990bc148a89cca22044adb8eac614ebe"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_website.fetch (cognitive 22): audit_website.fetch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/audit_website.py"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44cef1149f1d1b510ebee29ed4b2f58aa162d5efa2fdc8521a6df4848ef56cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Benchmark.generate_samples (cognitive 22): Benchmark.generate_samples has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts), ternaries 1 (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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddf5052cf6599de50ac09280ed2ba5b066ffa1ee424bda414a9ee7cbe6d9101"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._inspect_embedded_data_uris (cognitive 22): container_meta._inspect_embedded_data_uris has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 2, 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":"service/scripts/container_meta.py"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"f945cf59c8528058ceb943d465e9177c8fdd5e407013c44b6251f83d03c3a6f1"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta.inspect_html (cognitive 22): container_meta.inspect_html has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4, 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":"service/scripts/container_meta.py"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"595fa991d067da126f154eb94fb6ece58d881a13937111c47ccebd445a1f693f"}},{"ruleId":"D2","level":"warning","message":{"text":"text_watermark._watermark_local_markllm (cognitive 22): text_watermark._watermark_local_markllm has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 4 (6 pts), boolean chains 2, ternaries 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"service/scripts/text_watermark.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9117f98c090d64c35fc1461428cbadec705341f9736c4c042f4ebe218781e49d"}},{"ruleId":"D2","level":"warning","message":{"text":"image_meta.clean_image (cognitive 21): image_meta.clean_image has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/image_meta.py"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"867b6e1b8c022059ade646428489ff8caeb63651adbd3a49a352021997e5bcc8"}},{"ruleId":"D2","level":"warning","message":{"text":"rewrite_text.main (cognitive 21): rewrite_text.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (5 pts), boolean chains 4, error handling 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":"service/scripts/rewrite_text.py"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d8f9e6c85a2e9f2f32d383ff63238a8edda1143a591204bce9b709ecdc8365"}},{"ruleId":"D2","level":"warning","message":{"text":"score_stylometry.score_text_stylometry (cognitive 21): score_stylometry.score_text_stylometry has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, loops 2 (4 pts), ternaries 2, boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/score_stylometry.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c56f82fb05fe323ea13ee3b7531b9a437df12820769f3626313ee27097225d3"}},{"ruleId":"D2","level":"warning","message":{"text":"score_stylometry.score_text_stylometry (cognitive 21): score_stylometry.score_text_stylometry has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, loops 2 (4 pts), ternaries 2, boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clean-user-facing-text/scripts/score_stylometry.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0842a7ebc9dbf30e00c5fe8b7ef49d497cf4fa3642b5d6d68a2c494fc8e8ca"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_lib.format_sarif (cognitive 20): audit_lib.format_sarif has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 1 (4 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/audit_lib.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29cde9a55a73194d68a65e07de23c0bf35e65011ae57d925edad4e08f34ea1d"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_website.main (cognitive 20): audit_website.main has cognitive complexity 20 (threshold 15). Drivers by points: error handling 4 (7 pts), if/else 6 (7 pts), loops 2 (3 pts), ternaries 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/audit_website.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"4735f2d0801a24984dea4c7b5167cb982f046097df9f47aa11d8819a8f1dccb6"}},{"ruleId":"D2","level":"warning","message":{"text":"bench_synthid_text.render_markdown (cognitive 20): bench_synthid_text.render_markdown has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, loops 2 (3 pts), ternaries 3 (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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":2553}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dff72f109e3a622a379fe8406ed43f522fc9ab23101d574dbd061d37187fcb"}},{"ruleId":"D2","level":"warning","message":{"text":"check_staged.main (cognitive 20): check_staged.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (6 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":"service/scripts/check_staged.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c6182dec7ddf72bc003d7de176dddb97a6342a53d79146421a955c8ce751ee"}},{"ruleId":"D2","level":"warning","message":{"text":"image_meta._png_text_entries (cognitive 20): image_meta._png_text_entries has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 2 (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":"service/scripts/image_meta.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d586645f3c2c30a8e8cc831c8f20c1a0189b0bd78aef20256ab65c0e35ce37"}},{"ruleId":"D2","level":"warning","message":{"text":"image_meta.run_optional_tools (cognitive 20): image_meta.run_optional_tools has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, error handling 2 (4 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":"service/scripts/image_meta.py"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"732b077174fe425c3ba8805ca90383db639d84669e182cac2690263b4ef5c883"}},{"ruleId":"D2","level":"warning","message":{"text":"image_meta.strip_png (cognitive 20): image_meta.strip_png has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 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":"service/scripts/image_meta.py"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff3f1abc528fc95044d576a07b6767211a2ed2b30ec501c2d902398053e0b96"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkLLMTextDetector.detect (cognitive 20): MarkLLMTextDetector.detect has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 7, if/else 7, error handling 3 (4 pts), ternaries 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_detectors.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dcba21645009ba7bd1b852a82c7aaa9ee6f083274e06659835685c6c67f519"}},{"ruleId":"D2","level":"warning","message":{"text":"download_prompts.fetch_rows_retrying (cognitive 20): download_prompts.fetch_rows_retrying has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), error handling 2 (4 pts), ternaries 1 (3 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":"stealer/download_prompts.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79128bea36fb803cf19ca05326fbdc4ebd7e91470774ceba8efe9678fcd8c29"}},{"ruleId":"D2","level":"warning","message":{"text":"av_meta._strip_wav (cognitive 19): av_meta._strip_wav has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (6 pts), boolean chains 5, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/av_meta.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"05df9cd1ec529eb785a7f69c2648a3489e65cb291a9aeb5e6e25a8f803a6e69b"}},{"ruleId":"D2","level":"warning","message":{"text":"bench_synthid_text._strategy_csv (cognitive 19): bench_synthid_text._strategy_csv has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (12 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":2984}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbd1ecb096f714c48fea8536a5ee67de437df7b2799f7ea34d0a80179266d07"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta.clean_latex (cognitive 19): container_meta.clean_latex has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (5 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aaeed962b4ec9ff7c784966b87bd24eb004cffcfe456e531f4abacc823d5d0f"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_lib.aggregate (cognitive 18): audit_lib.aggregate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 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":"service/scripts/audit_lib.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"509560c224d0113a7b4bf5b234a4643fa3b5a88ffd9c8b082a5d73384ffa5268"}},{"ruleId":"D2","level":"warning","message":{"text":"av_meta._parse_id3v2_frames (cognitive 18): av_meta._parse_id3v2_frames has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 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":"service/scripts/av_meta.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d7ebfdeea9dc4a0a8c59ddd448e84da0297dd7212bbce95df877f25ea3dff6"}},{"ruleId":"D2","level":"warning","message":{"text":"Benchmark._pick_humanized_recommendation (cognitive 18): Benchmark._pick_humanized_recommendation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":2017}}}],"partialFingerprints":{"codehealthFindingId/v1":"3480ac57b88040901f79b881770cec172243ac1e989904c871ea6aab25fce14e"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._scrub_odt_text (cognitive 18): container_meta._scrub_odt_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, 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":"service/scripts/container_meta.py"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"85eedc29f7482d3dcbac7910b4c6fed5e3f2b18835a0fdc1590f824ccb8004f1"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta.inspect_odt (cognitive 18): container_meta.inspect_odt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, 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":"service/scripts/container_meta.py"},"region":{"startLine":2919}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd4926b6cec9defe7713de9c4a340fc518ff30c959ecb7400a0da282d2d20a4"}},{"ruleId":"D2","level":"warning","message":{"text":"rewrite_text._mlm_infill (cognitive 18): rewrite_text._mlm_infill has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), ternaries 3 (4 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":"service/scripts/rewrite_text.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dadd8d9c33ae8a2ccac4e85fc7ab6052cebfbf48d57be4d9e3c20896a030a9b"}},{"ruleId":"D2","level":"warning","message":{"text":"score_stylometry.print_human_stylometry_report (cognitive 18): score_stylometry.print_human_stylometry_report has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/score_stylometry.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a6d589dc2368de7ae0b78a3926e7d5b6cd104dd8fb8037224107b78c864bc7"}},{"ruleId":"D2","level":"warning","message":{"text":"text_unicode.clean_text (cognitive 18): text_unicode.clean_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_unicode.py"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bac1e151c70d4d782f8b5d716c91b1f9bf434d9bc8f52ed025dd969e0eda322"}},{"ruleId":"D2","level":"warning","message":{"text":"score_stylometry.print_human_stylometry_report (cognitive 18): score_stylometry.print_human_stylometry_report has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clean-user-facing-text/scripts/score_stylometry.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a30647b6c23e8729e15914f1432fdfd91e695658c81d9a1c4786ded6007c816"}},{"ruleId":"D2","level":"warning","message":{"text":"text_unicode.clean_text (cognitive 18): text_unicode.clean_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/clean-user-facing-text/scripts/text_unicode.py"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae12fd91ce190cde6c6746bfaefde4318dfe9af3a645124b57e2071b9ae9694"}},{"ruleId":"D2","level":"warning","message":{"text":"install_skill.main (cognitive 17): install_skill.main has cognitive complexity 17 (threshold 15). Drivers by points: error handling 4 (6 pts), if/else 5 (6 pts), ternaries 2 (3 pts), loops 1 (2 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":"install_skill.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12e87a96e6e0f6dac0de6fe802945d0f372ef92bc9add44407762baeefe6594"}},{"ruleId":"D2","level":"warning","message":{"text":"av_meta._inspect_id3v2 (cognitive 17): av_meta._inspect_id3v2 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 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":"service/scripts/av_meta.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa089d60fae43b844bba8a5964e620d3c68f457b49eb73e9c10097919f84be4c"}},{"ruleId":"D2","level":"warning","message":{"text":"av_meta._inspect_wav (cognitive 17): av_meta._inspect_wav has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/av_meta.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27000991dda8dbefaa1aef3df2cafc68bb292cd94c10bfd604991f683a43c31"}},{"ruleId":"D2","level":"warning","message":{"text":"bench_deepseek_smoke.load_fixture (cognitive 17): bench_deepseek_smoke.load_fixture has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/bench_deepseek_smoke.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b413f7b550406fe7fa715e77d8bef905129a9ecd0265b24746ee8d2bcba0e0"}},{"ruleId":"D2","level":"warning","message":{"text":"clean_video.video_purify (cognitive 17): clean_video.video_purify has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/clean_video.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e24f71472f5fc1ced018d7a166b7766975bc0b94fb84e1baee3cc351fdc14d"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._pdf_attachment_list (cognitive 17): container_meta._pdf_attachment_list has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (5 pts), ternaries 2 (3 pts), error handling 2, loops 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":3825}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded35f981d23fc8bb87e669f30b31d56f0bf753b1d15eab0200471a07fb64ed0"}},{"ruleId":"D2","level":"warning","message":{"text":"image_meta.strip_webp (cognitive 17): image_meta.strip_webp has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/image_meta.py"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2e037a864c314c57d26a0fd47777c8e64ae4ac21e9829cb03de3768c493c64"}},{"ruleId":"D2","level":"warning","message":{"text":"install_skill.install_directory (cognitive 16): install_skill.install_directory has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"install_skill.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"051faaa6565505af5d44c8c1e534253d8f783f236ba3f89787fe2a847d883692"}},{"ruleId":"D2","level":"warning","message":{"text":"Benchmark._persist_strategy_outputs (cognitive 16): Benchmark._persist_strategy_outputs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/bench_synthid_text.py"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"d984bac18d6c638aad8b27676f8b30a41023977d99c05df02d08a606f7400139"}},{"ruleId":"D2","level":"warning","message":{"text":"bench_synthid_text.render_markdown_minimal (cognitive 16): bench_synthid_text.render_markdown_minimal has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 5, if/else 3, 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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":2690}}}],"partialFingerprints":{"codehealthFindingId/v1":"5277c1559f8e783fc41c387c638854e41c8434f4172ae01e5fadfeab4a4b7b30"}},{"ruleId":"D2","level":"warning","message":{"text":"clean_staged.main (cognitive 16): clean_staged.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), ternaries 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":"service/scripts/clean_staged.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7072e58fbcf9c308dcb64fbccdfb7d18d940b288a346e0aeddb4b7af7b11d691"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta.inspect_markdown (cognitive 16): container_meta.inspect_markdown has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf12c8d8c0b592153816abf0b0dc40a77595c32df8a82611e148f27a8b1231c"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._latex_split_items (cognitive 16): container_meta._latex_split_items has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 1 (3 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":"service/scripts/container_meta.py"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"699979756d848065bdbc5318f42e3566de6e0f9bb12803af34fa5ea1a7258c97"}},{"ruleId":"D2","level":"warning","message":{"text":"container_meta._iter_jpeg_segments (cognitive 16): container_meta._iter_jpeg_segments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 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":"service/scripts/container_meta.py"},"region":{"startLine":3527}}}],"partialFingerprints":{"codehealthFindingId/v1":"a410f44d9df1ae7c9988af55b3c70952bebe86886857d7605387cd2c563af19b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/container_meta.py: FileTooLong \u2014 3031 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2531 over it, 6.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":"service/scripts/container_meta.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d20d1972c43608ba50942c50bc367d404c95e26daee139afc2f63d0670ae9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/bench_synthid_text.py: FileTooLong \u2014 2967 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2467 over it, 5.93\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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05edd7a733e92ef35969e87a57cea482faf0635abeaf12ade702f8f49c00448"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/image_meta.py: FileTooLong \u2014 1760 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1260 over it, 3.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/image_meta.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65096936e97738d62bbf1a194f7b247588dbf46ed7ce627430ca3e4764d92a58"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/server.py: FileTooLong \u2014 1227 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 727 over it, 2.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/server.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5b2d81a1a5b35b77c6b5cf25e7a3f7b95748f8d0e81f009840621ec81021d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/rewrite_text.py: FileTooLong \u2014 985 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 485 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":"service/scripts/rewrite_text.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16b3da010832d17b7992d83cd00d962db0f7bdb69179b7dc0c30aca509d71d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/audit_website.py: FileTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 12 over it, 1.02\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":"service/scripts/audit_website.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff868821c8bad408e32213b0ed820b5f01236db84144ffa852c224fc4acdf86"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (34 shared lines): service/scripts/container_meta.py:2712-2883 | service/scripts/container_meta.py:3227-3349 \u2014 These two members are variants of one another: 34 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":"service/scripts/container_meta.py"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"7490534a8463f5e966bebb612d19a3bfd0b0ef8f3b88b2fe98ee1c79437f1e57"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): service/scripts/clean_text.py:24-94 | service/scripts/inspect_text.py:20-133 | skills/clean-user-facing-text/scripts/clean_text.py:24-94 | skills/clean-user-facing-text/scripts/inspect_text.py:20-133 \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":"service/scripts/clean_text.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5f93788dfbf13b3580870f7a148c4142dfbc9d2335310827a8b70ef1229d35"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): service/scripts/text_unicode.py:584-640 | service/scripts/text_unicode.py:652-714 | skills/clean-user-facing-text/scripts/text_unicode.py:584-640 | skills/clean-user-facing-text/scripts/text_unicode.py:652-714 \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":"service/scripts/text_unicode.py"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b3e432d3c53bfe110867492a7e3743bc7e9d32f8dc278ca26879fb1b25a78b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): service/scripts/image_meta.py:1703-1770 | service/scripts/image_meta.py:1784-1844 \u2014 These two members are one piece of code written twice and then edited apart: 61 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":"service/scripts/image_meta.py"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"335ee3d1c14ea6d33d489bc749039c3fd22b4597fe872a62d666d887549d7b54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): service/scripts/synthid_score_server.py:152-172 | service/scripts/synthid_text_server.py:297-325 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/synthid_score_server.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a0f3a100dd5010bcd343d3fa1ff68b503a2863dedb0371ba55a9ce04ca7359"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): service/scripts/server.py:1523-1536 | service/scripts/server.py:1542-1554 | service/scripts/server.py:1561-1573 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/server.py"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac75ecced6ff7ef48ae14a5db10c33d11f3cc44200da1e8206bcab417f07d32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): service/scripts/format_dispatch.py:130-157 | service/scripts/format_dispatch.py:161-189 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/format_dispatch.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e129c4b006f314aa217f7fe3fb303d24ec0d3ae084d882a5441e08ffd785ea82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): service/scripts/container_meta.py:1208-1234 | service/scripts/container_meta.py:1238-1256 \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":"service/scripts/container_meta.py"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"321ce0efc0240a4ec7eec3152cc8d78caaff803584de16a74a3fa8755cc9aeeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): service/scripts/detect_text_watermark.py:210-224 | service/scripts/markdiffusion_harness.py:149-162 \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":"service/scripts/detect_text_watermark.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f7bf8dd91e63f2f1c6190882c1841bcaabdf1d40c2495a18f451e7c434e662"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): service/scripts/bench_synthid_text.py:204-221 | service/scripts/bench_synthid_text.py:225-243 \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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"126726d99d42ab054c21792aa5d4fbdafc1ed6a5a0aecbec91295a22844ce5ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): service/scripts/server.py:1428-1440 | service/scripts/synthid_text_server.py:147-157 \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":"service/scripts/server.py"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd6592eab0369808b11e6d6a6e8cd12cd3d8defc2ce968e97eda8ddc570353b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): service/scripts/container_meta.py:590-601 | service/scripts/container_meta.py:605-623 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9bbf6fde34bca1c6dd827d626df460e35c8c69b177a13b67b8db61303c418e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): service/scripts/clean_audio.py:124-154 | service/scripts/clean_audio.py:158-190 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/clean_audio.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1212731ca0509b979b417aac491a8cb7aedca46b3c5839b388431982eb8ac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): service/scripts/text_unicode.py:531-534 | skills/clean-user-facing-text/scripts/text_unicode.py:531-534 \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":"service/scripts/text_unicode.py"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24b653774dbb67be62659ea0d99a27fe0c6d7edc2c7dc0a80d331ef52f2c183"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (138 lines \u00D7 2): service/scripts/score_stylometry.py:319-456 | skills/clean-user-facing-text/scripts/score_stylometry.py:319-456 \u2014 before extracting anything, compare \u0060service/scripts/score_stylometry.py\u0060 and \u0060skills/clean-user-facing-text/scripts/score_stylometry.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 294 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/score_stylometry.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7280c2b1c0c0118c392d007622ed05ebebf91bc2bff45c0f4b90b668f3dd2b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (114 lines \u00D7 2): service/scripts/inspect_text.py:20-133 | skills/clean-user-facing-text/scripts/inspect_text.py:20-133 \u2014 before extracting anything, compare \u0060service/scripts/inspect_text.py\u0060 and \u0060skills/clean-user-facing-text/scripts/inspect_text.py\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/inspect_text.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d751fa7c4b161cfa1caee64e9cb4d5f6cf02809adc04fc6b5667c4d2708d64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (90 lines \u00D7 2): service/scripts/common.py:427-516 | skills/clean-user-facing-text/scripts/common.py:427-516 \u2014 before extracting anything, compare \u0060service/scripts/common.py\u0060 and \u0060skills/clean-user-facing-text/scripts/common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea930f42ecb66c8c6930d5dc1fefdff6fdce3fd2e05a7cd392cb3a0a840eca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (71 lines \u00D7 2): service/scripts/clean_text.py:24-94 | skills/clean-user-facing-text/scripts/clean_text.py:24-94 \u2014 before extracting anything, compare \u0060service/scripts/clean_text.py\u0060 and \u0060skills/clean-user-facing-text/scripts/clean_text.py\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/clean_text.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e51fc8cb542e50729e10b9e35401c08d94772fd28f941b907425a4acab5609"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (63 lines \u00D7 2): service/scripts/text_unicode.py:652-714 | skills/clean-user-facing-text/scripts/text_unicode.py:652-714 \u2014 before extracting anything, compare \u0060service/scripts/text_unicode.py\u0060 and \u0060skills/clean-user-facing-text/scripts/text_unicode.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 301 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_unicode.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"61265510bdc562301d17352fea1a4bca8e29626d5ae53a6f1a35258671382529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (61 lines \u00D7 2): service/scripts/text_unicode.py:467-527 | skills/clean-user-facing-text/scripts/text_unicode.py:467-527 \u2014 before extracting anything, compare \u0060service/scripts/text_unicode.py\u0060 and \u0060skills/clean-user-facing-text/scripts/text_unicode.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 301 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_unicode.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fe8b6aaeaa411e35a745ee5c45e6923c8ae24531254a0cb81c6c270d864d2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57 lines \u00D7 2): service/scripts/text_unicode.py:584-640 | skills/clean-user-facing-text/scripts/text_unicode.py:584-640 \u2014 before extracting anything, compare \u0060service/scripts/text_unicode.py\u0060 and \u0060skills/clean-user-facing-text/scripts/text_unicode.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 301 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_unicode.py"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3e40b3ecd9fa2793a274f2f44ecdc0b6f9c7067914c4679850eafa665894fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): service/scripts/common.py:200-243 | skills/clean-user-facing-text/scripts/common.py:200-243 \u2014 before extracting anything, compare \u0060service/scripts/common.py\u0060 and \u0060skills/clean-user-facing-text/scripts/common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"02218d9ceb16a77a691565d18804fcadf30ba07f14d88b0a5abfafc04bc931c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): service/scripts/score_stylometry.py:460-499 | skills/clean-user-facing-text/scripts/score_stylometry.py:460-499 \u2014 before extracting anything, compare \u0060service/scripts/score_stylometry.py\u0060 and \u0060skills/clean-user-facing-text/scripts/score_stylometry.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 294 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/score_stylometry.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"935d8fd97efae20c6ee6a4bcab3bafedef44d0c240b059c0fdc5814b30f33666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): service/scripts/common.py:343-381 | skills/clean-user-facing-text/scripts/common.py:343-381 \u2014 before extracting anything, compare \u0060service/scripts/common.py\u0060 and \u0060skills/clean-user-facing-text/scripts/common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060service/scripts/common.py:343\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":"service/scripts/common.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc5b96c430d8328b4380115f1ea6b7c86678be619c6db8025ef30de2104b91c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): service/scripts/clean_file.py:182-213 | service/scripts/clean_file.py:218-249 \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 \u0060service/scripts/clean_file.py:182\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/clean_file.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fb757acf8cbcca042c5d17cfe64c696436c15205a0d51f634bb431971623b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): service/scripts/score_stylometry.py:503-534 | skills/clean-user-facing-text/scripts/score_stylometry.py:503-534 \u2014 before extracting anything, compare \u0060service/scripts/score_stylometry.py\u0060 and \u0060skills/clean-user-facing-text/scripts/score_stylometry.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 294 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/score_stylometry.py"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0e221593796bdd2d6290bfbfdb920baae28656ddff9c777b2a214a2df22eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): service/scripts/common.py:163-192 | skills/clean-user-facing-text/scripts/common.py:163-192 \u2014 before extracting anything, compare \u0060service/scripts/common.py\u0060 and \u0060skills/clean-user-facing-text/scripts/common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f7f5ad9494bb4b19ecc1f4c7dda575a66feed6fce17161b91a0ca05eee9ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): service/scripts/common.py:263-291 | skills/clean-user-facing-text/scripts/common.py:263-291 \u2014 before extracting anything, compare \u0060service/scripts/common.py\u0060 and \u0060skills/clean-user-facing-text/scripts/common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc8747fe3cf47a5c1a3305b10830f45eca00ada8625920eefc637df02c4f8d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): service/scripts/common.py:520-544 | skills/clean-user-facing-text/scripts/common.py:520-544 \u2014 before extracting anything, compare \u0060service/scripts/common.py\u0060 and \u0060skills/clean-user-facing-text/scripts/common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"1157767539f12130191f8daf80ba2f965514dce8f7ca5a2469ef7a3d45340ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): service/scripts/score_stylometry.py:252-276 | skills/clean-user-facing-text/scripts/score_stylometry.py:252-276 \u2014 before extracting anything, compare \u0060service/scripts/score_stylometry.py\u0060 and \u0060skills/clean-user-facing-text/scripts/score_stylometry.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 294 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/score_stylometry.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddb241741c146d62d1df758d9152724ea5a3dc30ab1abd601b318fab236ee03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): service/scripts/image_meta.py:2142-2163 | service/scripts/image_meta.py:2168-2189 \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":"service/scripts/image_meta.py"},"region":{"startLine":2142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecc18a24ef61f2f738c2c61245c8604e0b30494644e5c113ae2043483cd2de8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): service/scripts/container_meta.py:2736-2756 | service/scripts/container_meta.py:3260-3277 \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 \u0060service/scripts/container_meta.py:2736\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":"service/scripts/container_meta.py"},"region":{"startLine":2736}}}],"partialFingerprints":{"codehealthFindingId/v1":"a178de3bbf034dc2ba6079bdbe904ba4977cc5a64a01dcb7e0ebbf0db42f67d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): service/scripts/common.py:320-339 | skills/clean-user-facing-text/scripts/common.py:320-339 \u2014 before extracting anything, compare \u0060service/scripts/common.py\u0060 and \u0060skills/clean-user-facing-text/scripts/common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd1ad4a5a91958726394afac3599881d2b3aa2fec9380e537f83dc153da6a8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): service/scripts/score_stylometry.py:201-219 | skills/clean-user-facing-text/scripts/score_stylometry.py:201-219 \u2014 before extracting anything, compare \u0060service/scripts/score_stylometry.py\u0060 and \u0060skills/clean-user-facing-text/scripts/score_stylometry.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 294 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/score_stylometry.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"017615f01a43e8c9495c38766c750c1b96f9371b685498d3d3d77107d7d8df1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): service/scripts/score_stylometry.py:228-248 | skills/clean-user-facing-text/scripts/score_stylometry.py:228-248 \u2014 before extracting anything, compare \u0060service/scripts/score_stylometry.py\u0060 and \u0060skills/clean-user-facing-text/scripts/score_stylometry.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 294 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060service/scripts/score_stylometry.py:228\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":"service/scripts/score_stylometry.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"021f2575dbd2a1784d5971c178f34c2fc0d1764f4d75bc3869cf3241c05129e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): service/scripts/score_stylometry.py:280-298 | skills/clean-user-facing-text/scripts/score_stylometry.py:280-298 \u2014 before extracting anything, compare \u0060service/scripts/score_stylometry.py\u0060 and \u0060skills/clean-user-facing-text/scripts/score_stylometry.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 294 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/score_stylometry.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a098e47240b9663057da4fb658749b21f9cc8a05337c6b700a817cec097953a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): service/scripts/text_unicode.py:315-333 | skills/clean-user-facing-text/scripts/text_unicode.py:315-333 \u2014 before extracting anything, compare \u0060service/scripts/text_unicode.py\u0060 and \u0060skills/clean-user-facing-text/scripts/text_unicode.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 301 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_unicode.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86a5f6327d39bc8a76c34252d9a8686117b04dbcfa2de874521d65a288b5a45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): service/scripts/clean_text.py:27-44 | service/scripts/inspect_text.py:22-39 | skills/clean-user-facing-text/scripts/clean_text.py:27-44 | skills/clean-user-facing-text/scripts/inspect_text.py:22-39 \u2014 before extracting anything, compare \u0060service/scripts/clean_text.py\u0060 and \u0060skills/clean-user-facing-text/scripts/clean_text.py\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060service/scripts/clean_text.py:27\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, \u0060service/scripts/clean_text.py:26\u0060 calls \u0060add_argument\u0060 and \u0060service/scripts/inspect_text.py:21\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":"service/scripts/clean_text.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"649ab2911148b73942284a4316b2d05be5da4ae34b8ac640a92417d1d22731ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): service/scripts/common.py:299-316 | skills/clean-user-facing-text/scripts/common.py:299-316 \u2014 before extracting anything, compare \u0060service/scripts/common.py\u0060 and \u0060skills/clean-user-facing-text/scripts/common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6d37d10649f1e55f88645f56cfa30c1ca17eb0fba654e9246d66848bcbe3f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): service/scripts/common.py:104-120 | skills/clean-user-facing-text/scripts/common.py:104-120 \u2014 before extracting anything, compare \u0060service/scripts/common.py\u0060 and \u0060skills/clean-user-facing-text/scripts/common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1efc8d701e5561e9e584c9d05ed7e763556840b775ad638c5a64ed9e8d06721"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): service/scripts/container_meta.py:3018-3032 | service/scripts/container_meta.py:3334-3349 \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":"service/scripts/container_meta.py"},"region":{"startLine":3018}}}],"partialFingerprints":{"codehealthFindingId/v1":"1864cb7fbdf4c999cc3b8ebfe160f3c269fffaef378aca2eac301aa7a788e185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): service/scripts/rewrite_text.py:1008-1023 | service/scripts/rewrite_text.py:1039-1054 \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":"service/scripts/rewrite_text.py"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cbc24072b57dd6b567975f2c0a1d523e15c9ccd5fac3de74d388e169b0791e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): service/scripts/text_unicode.py:285-300 | skills/clean-user-facing-text/scripts/text_unicode.py:285-300 \u2014 before extracting anything, compare \u0060service/scripts/text_unicode.py\u0060 and \u0060skills/clean-user-facing-text/scripts/text_unicode.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 301 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_unicode.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2560dc8032ac98a3c611528919e75efe37a95516b0b7893429a788bc8a1c4b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): service/scripts/text_unicode.py:386-401 | skills/clean-user-facing-text/scripts/text_unicode.py:386-401 \u2014 before extracting anything, compare \u0060service/scripts/text_unicode.py\u0060 and \u0060skills/clean-user-facing-text/scripts/text_unicode.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 301 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_unicode.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa9e9e9653a4328d30b884bb093d1a7ac62067bd409aec0472d6d426e82c2a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): service/scripts/clean_file.py:81-94 | service/scripts/inspect_file.py:39-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060service/scripts/clean_file.py:81\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060service/scripts/inspect_file.py:54\u0060 calls \u0060str\u0060, \u0060resolve\u0060 and \u0060service/scripts/clean_file.py:100\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/clean_file.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"63dd4207d92a89b8431b2fb884168065150e42a0b9c3aafb583d8535594cca1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): service/scripts/detect_text_watermark.py:269-283 | service/scripts/detect_text_watermark.py:443-456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060service/scripts/detect_text_watermark.py:284\u0060 calls \u0060_detect_payload\u0060 and \u0060service/scripts/detect_text_watermark.py:457\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":"service/scripts/detect_text_watermark.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3967bf3f67aed750395fce7a8b6cd06874f377cc30073a19932c56d302e832"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): service/scripts/detect_text_watermark.py:577-591 | service/scripts/markdiffusion_harness.py:425-439 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060service/scripts/detect_text_watermark.py:577\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/detect_text_watermark.py"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab696ea4c846d44be5a3ac06be39e5f0e69e5868686db45ad2a3d5937d3a35ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): service/scripts/markdiffusion_harness.py:241-255 | service/scripts/markdiffusion_harness.py:317-331 \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":"service/scripts/markdiffusion_harness.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cf466916f41ce5f7ecbf43b88d6094c3b3dc00fdb7d0da926f4eee96e7e304"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): service/scripts/text_unicode.py:405-418 | skills/clean-user-facing-text/scripts/text_unicode.py:405-418 \u2014 before extracting anything, compare \u0060service/scripts/text_unicode.py\u0060 and \u0060skills/clean-user-facing-text/scripts/text_unicode.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 301 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_unicode.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baeb05522745d227543ffeef380b047f9d0468fb075fa7ce7030c41295e1d88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): service/scripts/bench_synthid_text.py:209-221 | service/scripts/bench_synthid_text.py:231-243 \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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64f41961af448e8720b96805df92f79960e4ea1fefb4801af81d7fd54e64550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): service/scripts/text_unicode.py:585-595 | service/scripts/text_unicode.py:656-667 | skills/clean-user-facing-text/scripts/text_unicode.py:585-595 | skills/clean-user-facing-text/scripts/text_unicode.py:656-667 \u2014 before extracting anything, compare \u0060service/scripts/text_unicode.py\u0060 and \u0060skills/clean-user-facing-text/scripts/text_unicode.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 301 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060service/scripts/text_unicode.py:585\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":"service/scripts/text_unicode.py"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"9984e6e4a26fb5928129cd1dba3d0a9704b8a498a2b0ac0d876d908b30846656"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): service/scripts/server.py:1480-1490 | service/scripts/synthid_score_server.py:100-110 | service/scripts/synthid_text_server.py:184-195 \u2014 before extracting anything, compare \u0060service/scripts/server.py\u0060 and \u0060service/scripts/synthid_score_server.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/server.py"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe592ee4847683e292fad5a18796afba13f021eea399c3d91a2dd3c7700202c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): service/scripts/container_meta.py:2599-2610 | service/scripts/container_meta.py:2641-2649 \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":"service/scripts/container_meta.py"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ca001acc4e7b2e4324ee189b118826245f663893d8d47f52965bc6f91d5a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): service/scripts/clean_file.py:185-195 | service/scripts/clean_file.py:221-231 | service/scripts/clean_file.py:258-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060service/scripts/clean_file.py:185\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/clean_file.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73664d4fbbc7791c584d33621ec877a718ab57bf1ba3715a14e838b46d3bf66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): service/scripts/inspect_file.py:90-100 | service/scripts/inspect_file.py:105-115 | service/scripts/inspect_file.py:119-129 \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":"service/scripts/inspect_file.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16a8425120232fcd5f5293d2a4d88320121a8da302bdeb788a07d153f262979"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): service/scripts/text_unicode.py:355-365 | skills/clean-user-facing-text/scripts/text_unicode.py:355-365 \u2014 before extracting anything, compare \u0060service/scripts/text_unicode.py\u0060 and \u0060skills/clean-user-facing-text/scripts/text_unicode.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 301 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_unicode.py"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd44ae03400d1c90c3e0b6f4377b59dda3f61915acead773fc09588f3b555aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): service/scripts/text_unicode.py:718-730 | skills/clean-user-facing-text/scripts/text_unicode.py:718-730 \u2014 before extracting anything, compare \u0060service/scripts/text_unicode.py\u0060 and \u0060skills/clean-user-facing-text/scripts/text_unicode.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 301 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_unicode.py"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81db17a5f5a172bd6b997e5da655304f6365ee69d88855c1b15a289df70e1ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): service/scripts/detect_text_watermark.py:198-205 | service/scripts/detect_text_watermark.py:213-222 | service/scripts/markdiffusion_harness.py:152-161 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. 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":"service/scripts/detect_text_watermark.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"844acf27a577baf4fcdf90885e19dbf993f6ba9492ae5ca2b96e0305edcca2f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): service/scripts/container_meta.py:448-457 | service/scripts/container_meta.py:496-505 \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":"service/scripts/container_meta.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"3406f081131d5a6db11649a54b64e2df32fc1b2730e690d86db1cdd600d01c94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): service/scripts/container_meta.py:516-525 | service/scripts/image_meta.py:2243-2250 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d67afd2881b3042a415043078219c0fd4c9746972aaa52dc149d83aaa3619f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): service/scripts/container_meta.py:4736-4745 | service/scripts/container_meta.py:4747-4756 | service/scripts/container_meta.py:4757-4765 \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. 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":"service/scripts/container_meta.py"},"region":{"startLine":4736}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e55c5fb4ff19bd8bf05e010bd4243f99f959003fd03361133f0d0944071a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): service/scripts/server.py:1337-1346 | service/scripts/server.py:1359-1367 \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":"service/scripts/server.py"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc486858ad6bc839172582537be07fc4e6dfed0f689532bf3fb6b79718b8512"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): service/scripts/server.py:1428-1437 | service/scripts/synthid_score_server.py:65-74 \u2014 before extracting anything, compare \u0060service/scripts/server.py\u0060 and \u0060service/scripts/synthid_score_server.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/server.py"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef61fe0b6a20f8ed2cbc26522ecb77f6f775b8b6ce98a191a30d5f30d6f098e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): service/scripts/image_meta.py:1757-1765 | service/scripts/image_meta.py:1834-1841 \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 \u0060service/scripts/image_meta.py:1757\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":"service/scripts/image_meta.py"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a26c71f142be175560d2ed349b111008bb744dc0e39c0ffa0eb8471c7ebc3c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): service/scripts/markdiffusion_harness.py:314-322 | service/scripts/markdiffusion_harness.py:376-384 \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 \u0060service/scripts/markdiffusion_harness.py:314\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":"service/scripts/markdiffusion_harness.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a63e5e9c93465b21a698844ad22c9327fb4fc47bc4568b4240dfb0fd56668ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): service/scripts/server.py:1145-1153 | service/scripts/server.py:1180-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/server.py"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0839eb084b69c1f5cafa59555a94fa8ab9b6335986cd71bacffb32db00fd7edf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): service/scripts/synthid_score_server.py:67-75 | service/scripts/synthid_text_server.py:149-157 \u2014 before extracting anything, compare \u0060service/scripts/synthid_score_server.py\u0060 and \u0060service/scripts/synthid_text_server.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/synthid_score_server.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"620d95dcf245d1ddc3e9052854c23bf33688ee4c80e474a99bb5f9d9aea113de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): service/scripts/container_meta.py:464-471 | service/scripts/container_meta.py:2219-2226 | service/scripts/image_meta.py:1872-1879 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060service/scripts/image_meta.py:1881\u0060 calls \u0060inspect_bmp\u0060 and \u0060service/scripts/container_meta.py:2228\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":"service/scripts/container_meta.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"239a5a6179c304cc3f5daef9e68f02b53362fb5c8915737c5576d632a03367ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): service/scripts/container_meta.py:2875-2881 | service/scripts/container_meta.py:3024-3030 | service/scripts/container_meta.py:3340-3347 \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":"service/scripts/container_meta.py"},"region":{"startLine":2875}}}],"partialFingerprints":{"codehealthFindingId/v1":"67058431da94f02b75b527a6528281ec3909b6a6c15b638ce06958dd861c5776"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): service/scripts/markdiffusion_harness.py:240-247 | service/scripts/markdiffusion_harness.py:316-323 | service/scripts/markdiffusion_harness.py:378-385 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060service/scripts/markdiffusion_harness.py:240\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":"service/scripts/markdiffusion_harness.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bf56db1b59d78d4c26fa6a305d4498376500692711d6852a8c5a3a7deb9974"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): service/scripts/container_meta.py:2758-2765 | service/scripts/container_meta.py:3279-3286 \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":"service/scripts/container_meta.py"},"region":{"startLine":2758}}}],"partialFingerprints":{"codehealthFindingId/v1":"345882060203233eb0fda3c3e3093830dc5a66190ec9da5e9ebb0d70a32e13af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): service/scripts/server.py:1659-1665 | service/scripts/synthid_text_server.py:286-293 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060service/scripts/synthid_text_server.py:286\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":"service/scripts/server.py"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97033f5189e3b7342c99a6022958ca01c03cdf2502c143c54d7916b6ace2f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): service/scripts/av_meta.py:430-436 | service/scripts/av_meta.py:462-468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060service/scripts/av_meta.py:469\u0060 calls \u0060extend\u0060 and \u0060service/scripts/av_meta.py:437\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":"service/scripts/av_meta.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa26542ef676815d35f6813ebae977ff538ef164358e29ded7f51804251d37f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): service/scripts/container_meta.py:2961-2967 | service/scripts/container_meta.py:3244-3250 \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, \u0060service/scripts/container_meta.py:3243\u0060 calls \u0060_epub_encrypted_parts\u0060 and \u0060service/scripts/container_meta.py:2960\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":"service/scripts/container_meta.py"},"region":{"startLine":2961}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa88af4696c60480cd716397170b9ef123a49bb029b331b3c6d2b1f07045f0ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): service/scripts/image_meta.py:382-388 | service/scripts/image_meta.py:1945-1951 \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":"service/scripts/image_meta.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"6195f8347723a068e7c9a205208873bc12bf165e91c7bb68d1448630fa0f747a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): service/scripts/image_meta.py:652-659 | service/scripts/image_meta.py:685-692 \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":"service/scripts/image_meta.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"454a252acb9b3b71d26551abf9622bd6f09bce2377fe5b6b562403cf65f82d88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): service/scripts/server.py:1669-1675 | service/scripts/synthid_score_server.py:152-158 \u2014 before extracting anything, compare \u0060service/scripts/server.py\u0060 and \u0060service/scripts/synthid_score_server.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 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":"service/scripts/server.py"},"region":{"startLine":1669}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60f283306202e92ce8763fcca6e52f456ce94356b787bec36d4016a4af5977d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): service/scripts/synthid_score_server.py:87-93 | service/scripts/synthid_text_server.py:169-175 \u2014 before extracting anything, compare \u0060service/scripts/synthid_score_server.py\u0060 and \u0060service/scripts/synthid_text_server.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/synthid_score_server.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c97657a7c9c7ec7f9ae3af74a7d91b152555be5c87ee9bbfb14400dc2596c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): service/scripts/clean_image.py:178-183 | service/scripts/clean_image.py:185-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/clean_image.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ef5f0f0d28e6b8b6c30863096bb4c13fa9567c04c840e516e7df275a01f3d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): service/scripts/bench_synthid_text.py:2560-2564 | service/scripts/bench_synthid_text.py:2696-2700 | service/scripts/bench_synthid_text.py:2797-2801 \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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":2560}}}],"partialFingerprints":{"codehealthFindingId/v1":"703800fe91708517290f9dcbb0c7c68e5162ebd426583af33847c168b9d1d8c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): service/scripts/server.py:1532-1536 | service/scripts/server.py:1550-1554 | service/scripts/server.py:1569-1573 \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":"service/scripts/server.py"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"40663dfa196622c7f1bb99cbae69b9d7ec3f900109f028b4223567a6f1a55cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): service/scripts/bench_synthid_text.py:1717-1721 | service/scripts/bench_synthid_text.py:1802-1806 \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 \u0060service/scripts/bench_synthid_text.py:1717\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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdf5e39ad21bb6a3d97aa7385cd746f069c0da3fb40acd76825a59c42cb59e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): service/scripts/bench_synthid_text.py:195-200 | service/scripts/text_detectors.py:106-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 \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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24466e329941df55d253bfec41e381ce607401559996ffacbcd6200ac6e7fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): service/scripts/clean_ctrlregen.py:35-40 | service/scripts/detect_text_watermark.py:68-73 | service/scripts/markdiffusion_harness.py:75-80 | service/scripts/score_synthid.py:31-36 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. The 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":"service/scripts/clean_ctrlregen.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"869ad500f61fb8489bf53c7a0935793231b303ea9f9baf08a84775a20a8e7168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): service/scripts/clean_ctrlregen.py:44-57 | service/scripts/markdiffusion_harness.py:84-97 \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":"service/scripts/clean_ctrlregen.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e16178b23f882ec1bda3cfef0fad497ae2a7b9ce824430e17c06327fa4eb10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): service/scripts/common.py:39-49 | skills/clean-user-facing-text/scripts/common.py:39-49 \u2014 before extracting anything, compare \u0060service/scripts/common.py\u0060 and \u0060skills/clean-user-facing-text/scripts/common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"129cee277bb8cde4d9ed0460ca2f1edd067010ec66d7ce040f0099ee4225d9be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): service/scripts/common.py:145-154 | skills/clean-user-facing-text/scripts/common.py:145-154 \u2014 before extracting anything, compare \u0060service/scripts/common.py\u0060 and \u0060skills/clean-user-facing-text/scripts/common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97fc0b6f412f6623e47f7cc441956de68a81f670e2d60ab0dbafacc718194bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): service/scripts/common.py:247-252 | skills/clean-user-facing-text/scripts/common.py:247-252 \u2014 before extracting anything, compare \u0060service/scripts/common.py\u0060 and \u0060skills/clean-user-facing-text/scripts/common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4cf4a513c14d02edff4bc25ae50d40024ab065527113a8ef93d5e786344e03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): service/scripts/common.py:385-396 | skills/clean-user-facing-text/scripts/common.py:385-396 \u2014 before extracting anything, compare \u0060service/scripts/common.py\u0060 and \u0060skills/clean-user-facing-text/scripts/common.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"2969984e8096473ea1e77ba2e1f7bea42d91d3ce2fb35134bdfb5f107faef6e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): service/scripts/server.py:1443-1449 | service/scripts/synthid_score_server.py:78-84 | service/scripts/synthid_text_server.py:160-166 \u2014 before extracting anything, compare \u0060service/scripts/server.py\u0060 and \u0060service/scripts/synthid_score_server.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 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, \u0060service/scripts/server.py:1452\u0060 calls \u0060urlparse\u0060 and \u0060service/scripts/synthid_score_server.py:87\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":"service/scripts/server.py"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd87207ddfcfcf2a3752ff9a8d4b92638a11e4d93c7865dbf35bfe8f3c3ae1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): service/scripts/text_unicode.py:270-281 | skills/clean-user-facing-text/scripts/text_unicode.py:270-281 \u2014 before extracting anything, compare \u0060service/scripts/text_unicode.py\u0060 and \u0060skills/clean-user-facing-text/scripts/text_unicode.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 301 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_unicode.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b07cda972b21d0e10d06eea42b1382e1bd9e1348234837c00acce70cf5ab79a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): service/scripts/text_unicode.py:433-439 | skills/clean-user-facing-text/scripts/text_unicode.py:433-439 \u2014 before extracting anything, compare \u0060service/scripts/text_unicode.py\u0060 and \u0060skills/clean-user-facing-text/scripts/text_unicode.py\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 301 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/text_unicode.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"34908ab1f69b16c8e712ceabab0269a7386789c43bb28f9ccb89f11a585eaaa2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: install_skill.py: 36.8% line coverage (95/258)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"install_skill.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea464ff4ec57c4a69a41d6e24aeaa747c640a77fff3f4aabd530e9250643fd87"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: service/scripts/clean_audio.py: 49.6% line coverage (59/119)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/clean_audio.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1608a4974e564cf58617c3390c145dc475870c426d78bed5f6a7490d14741cd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: service/scripts/clean_file.py: 43.2% line coverage (64/148)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/clean_file.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec44248d275e336402d8f9219cbc4d945797781cf82c5bf8980c7487f4d3baf"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: service/scripts/clean_video.py: 37.6% line coverage (76/202)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/clean_video.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c2661e634a7f2be37c2d7b02626002aae9a94ab67bff16098e5102a4b63c0a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: service/scripts/detect_text_watermark.py: 29.7% line coverage (98/330)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/detect_text_watermark.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b67ebbb3cc7b118eee17d2950af1ba0005ba3ee4b590149eaacabdc03d1435"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: service/scripts/hook_written_file.py: 43.1% line coverage (62/144)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/hook_written_file.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4d286b66e04e26e6bb006fa2b6ccb5466de3cfe85580f5e313fe8027741253"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: service/scripts/markdiffusion_harness.py: 47.0% line coverage (131/279)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/markdiffusion_harness.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b31ef28aac2d88c6967b3c5333bf2bbd01cb285adf8970e47cfa32ac88ae55"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: stealer/__init__.py: 0.0% line coverage (0/3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stealer/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61301da17870a0faada3aca33e76e8be129ba606a91717ed92b058a47d398580"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: stealer/steal.py: 22.8% line coverage (33/145)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stealer/steal.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b9db691e1c8f4fd4f5fb04ef961c87ebdaae2eadda7b7977ab74972e2f5aa2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/container_meta.py: service/scripts/container_meta.py changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in container_meta._scrub_ooxml_zip at line 2709. 34 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/container_meta.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":"service/scripts/container_meta.py"},"region":{"startLine":2709}}}],"partialFingerprints":{"codehealthFindingId/v1":"5289d099b4793c97bad8f452a868b85fc2e9bca01bfed25f91dc347a07744541"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/clean_file.py: service/scripts/clean_file.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in clean_file.main at line 30. 4 of those changes were fix/bug commits, and the other 13 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/clean_file.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":"service/scripts/clean_file.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"86440401af79be79e5970ca1ccb1d0fd2eb0541be505a768bc3bded5420e09e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/rewrite_text.py: service/scripts/rewrite_text.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in rewrite_text.rewrite at line 730. 3 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/rewrite_text.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":"service/scripts/rewrite_text.py"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25955e8479a5dcd6611ecda58ced3617a3ddc00f889214bd27614e66616f3cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/image_meta.py: service/scripts/image_meta.py changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in image_meta.inspect_isobmff at line 633. 13 of those changes were fix/bug commits, and the other 20 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/image_meta.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":"service/scripts/image_meta.py"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"efeb0b3beb442b63794005f942ef8fd92f090996b05cb368891c73a312a6a08b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/server.py: service/scripts/server.py changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in server._clean_payload at line 1226. 12 of those changes were fix/bug commits, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/server.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":"service/scripts/server.py"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcaf74767d49a37edd39b66e5148e66996cd314d9e9d990f2a4df77250770059"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/bench_synthid_text.py: service/scripts/bench_synthid_text.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in bench_synthid_text.main at line 3397. 3 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/bench_synthid_text.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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":3397}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0bed59ca2de824c11cbd3cfca7ab8ca7110870efe287a957cfd1fc1d5b1831"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/text_unicode.py: service/scripts/text_unicode.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in text_unicode._decide at line 454. 3 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/text_unicode.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":"service/scripts/text_unicode.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dec188a40ff400dec2118bb1c7ca4fae2d2697667995bb9642a44befbdbb5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/inspect_file.py: service/scripts/inspect_file.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in inspect_file.main at line 27. 2 of those changes were fix/bug commits, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/inspect_file.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":"service/scripts/inspect_file.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a141ea71e674f91c095d1fe584e116160b8ac1ca51d6446c60a5288e6e58232"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/clean_image.py: service/scripts/clean_image.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in clean_image.main at line 17. 1 of those changes was a fix/bug commit, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/clean_image.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":"service/scripts/clean_image.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5044293095a1e4f375b077958382257b037d2e7bf5558487488f9d2b36935d1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/audit_website.py: service/scripts/audit_website.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in audit_website.guess_kind at line 100. 3 of those changes were fix/bug commits, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/audit_website.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":"service/scripts/audit_website.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f69e990dfd6b3482950aa8d20e91e2b0bf4f8aac09a667ece84a7a1fe65adc1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/audit_lib.py: service/scripts/audit_lib.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in audit_lib.scan_file at line 38. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/audit_lib.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":"service/scripts/audit_lib.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ff0be68d1c87c7aa2b5df8e5cba48226fb02cfb04a816dc0dd75e24a2db6d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/av_meta.py: service/scripts/av_meta.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in av_meta._parse_id3v2_frames at line 186. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/av_meta.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":"service/scripts/av_meta.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"67387bfdefbb77964f92a5bfb516dd0fbe9e601dcb11a1a1e0c4b34cfe703bc3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/inspect_image.py: service/scripts/inspect_image.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in inspect_image.main at line 16. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/inspect_image.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":"service/scripts/inspect_image.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f5479a3f6e543aa43555e04f28105c7e11664db1ad8a46c91ca917dfc5b02b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/clean-user-facing-text/scripts/text_unicode.py: skills/clean-user-facing-text/scripts/text_unicode.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in text_unicode._decide at line 454. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- skills/clean-user-facing-text/scripts/text_unicode.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/clean-user-facing-text/scripts/text_unicode.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a097e8b149d4a215a40822bfaeaeb5104b12e41d759819ed20e0303de648f19c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/inspect_text.py: service/scripts/inspect_text.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in inspect_text.main at line 19. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/inspect_text.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":"service/scripts/inspect_text.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"222c2ae84df22973cc6a0af1bead10ca90d1febec93032ed6525499c1a759fe5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/audit_dir.py: service/scripts/audit_dir.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in audit_dir.main at line 58. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/audit_dir.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":"service/scripts/audit_dir.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"605fed54679e2954f02dd7b53bb641229f96fa52f2e0024f9d2c1ee84f762536"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: service/scripts/text_detectors.py: service/scripts/text_detectors.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in MarkLLMTextDetector.detect at line 166. 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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/text_detectors.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":"service/scripts/text_detectors.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"540e79be104c8358bc4de09623ac175bf694946ba170a690310f655e77670bc1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: service/scripts/clean_staged.py: service/scripts/clean_staged.py changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is clean_staged.main at line 135), 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: harden in-place backups, clean-file status, synthid verdict, truncated ID3v2, and zip routing (#201)\u201D; \u201Cfix: clean pre-commit hook treats byte-identical clean non-text files as changed (#173) (#238)\u201D; \u201Cfix: stop child processes from opening a console window on Windows\u201D; \u201Cfix: distinguish a failed cleaner from an already-clean file (#159) (#161)\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-03..2026-11-01, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-03 18:16:06 \u002B05:30\u0027 --until=\u00272026-11-01 18:16:06 \u002B05:30\u0027 --full-history --no-merges -- service/scripts/clean_staged.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":"service/scripts/clean_staged.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f19cee6a2d87b925a2492602203df1a28909bf78030f600500d8adbb14d44c7"}},{"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: service/scripts/bench_synthid_text.py, service/scripts/markdiffusion_harness.py, service/scripts/clean_video.py, service/scripts/detect_gumbel.py, service/scripts/clean_audio.py, stealer/steal.py, service/scripts/clean_ctrlregen.py, stealer/scorer.py (\u002B1 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"70b159740c7f0a0f66d657914b35b28cb76b3fb0ca8157d34e584119220f936a"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (12 single-owned of 44 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; 44 of the 46 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (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: service/scripts/text_watermark.py, service/scripts/synthid_text_server.py, service/scripts/bench_deepseek_smoke.py."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f00127374c38ec6b890b6fbeae310e83df26fc0e77e2a73695c7daae3afc7b6e"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"afd98769eb8d58af48779b2ae0aace6e4fca558ed7047003e2b7c7f0c3a26d50"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"894d3e884d06f50c3b6f159373fe588c3cf71a5666c2b7c7358163d5fa280686"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dca8c31a3bd802553375b3cfb3e273433f19ad4fdb293a41dae91ad45aae0d65"},"properties":{"dependency":{"package":"diffusers","version":"0.27.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-2446","PYSEC-2026-40","PYSEC-2026-41"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68b04b390a9e723ec402518d652264c05782acf1ffaa73dc8e0f210c27c2892a"},"properties":{"dependency":{"package":"transformers","version":"4.37.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2024-227","PYSEC-2024-228","PYSEC-2024-229","PYSEC-2025-211","PYSEC-2025-212","PYSEC-2025-213","PYSEC-2025-214","PYSEC-2025-215","PYSEC-2025-216","PYSEC-2025-217","PYSEC-2025-218","PYSEC-2025-40","PYSEC-2026-1977","PYSEC-2026-1978","PYSEC-2026-1980","PYSEC-2026-1981","PYSEC-2026-1982","PYSEC-2026-1983","PYSEC-2026-1984","PYSEC-2026-1985","PYSEC-2026-1986","PYSEC-2026-1987","PYSEC-2026-1988","PYSEC-2026-2288","PYSEC-2026-2289","PYSEC-2026-2290","PYSEC-2026-3929"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e70dd65f45d9678210652a219fb99c42f3702951b17bfb338a74144944c84f1c"},"properties":{"dependency":{"package":"nltk","version":"3.10.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-3740"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D31","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":"80e3b3bd6b6cf33d172b46aa34a06724bc50e2387645a03aba477dbceb59e352"}},{"ruleId":"D31","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":"7cc569946bd57980e1829d31dffe3c9990145facf6ad26a3a79651326526ee0f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","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":"3df8045c8a97856ff10ee90925ad1fa3ad1dee743b139199ba0620e83aa2eb39"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","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":"26d07c7aef9d12b0abf7432bceabecb1034fc0be82e24928f8de662ac93f8075"}},{"ruleId":"D31","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":"16b769f04f4c1f50c4f1f7cbed1d5ac693e899385d538d0c181777e8f0cafcd0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","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":"07e9deb4e3ed7f86fe280d4b41c551d13dd1f149a15a4e784bff5481e53e7b00"}},{"ruleId":"D31","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":"0b1c2d4d80691fb352a79bc9b37f99d1c53c1719795a01bf16859a3d08afdc28"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: content-security-policy: The live app\u0027s responses did not include content-security-policy (restricts the sources a page may load \u2014 mitigates XSS/injection). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b142e47096a32517bde0bb9b78f7e564119c7f87e22fba4dccc0d1e3645d74c5"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-embedder-policy: The live app\u0027s responses did not include cross-origin-embedder-policy (recommended by the OWASP Secure Headers Project (value: require-corp)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"153214bb9c80f7d66cba8eb6a7715e9609e84c3979c9b641cd6bedaa8be6930b"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-opener-policy: The live app\u0027s responses did not include cross-origin-opener-policy (recommended by the OWASP Secure Headers Project (value: same-origin)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8cdbe5cdec6a55c732bf9a9975c0e40f81ddfa4ad583a4a50bfb0895531607f7"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-resource-policy: The live app\u0027s responses did not include cross-origin-resource-policy (recommended by the OWASP Secure Headers Project (value: same-origin)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ba35c34991db9965777a53477c2d497c4c6606f78d133bbaa3bc99c71648c2a"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: permissions-policy: The live app\u0027s responses did not include permissions-policy (restricts powerful browser features (camera, geolocation, \u2026)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac8a111f0bb913829dc090833718dca5ab8e5fba7350f9dcf68f1971010745"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: referrer-policy: The live app\u0027s responses did not include referrer-policy (limits referrer leakage to third parties). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"364ee3f006b552b8fee33710a1fbfb0c4fac59e927af9c4396e51940d9069f01"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: strict-transport-security: The live app\u0027s responses did not include strict-transport-security (forces HTTPS on subsequent requests \u2014 mitigates downgrade/MITM). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"567d3eeb50a5678c0139a1d316c614c44cd4c4fb5db6fffa7795bc73d035966f"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-content-type-options: The live app\u0027s responses did not include x-content-type-options (stops MIME-sniffing (expects \u0027nosniff\u0027)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e7f2638203ac91f5b64c739d090b339c00a90f1007c83652152b402a6eb0cdeb"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-dns-prefetch-control: The live app\u0027s responses did not include x-dns-prefetch-control (recommended by the OWASP Secure Headers Project (value: off)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"50e54b8511264dd930857e4620bda8ba4053661b439218ed047812bcab0e3a44"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-frame-options: The live app\u0027s responses did not include x-frame-options (blocks clickjacking via framing (or use CSP frame-ancestors)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0e84499d19780ca121fad65e0f3bd2fc17b1268ce3079a5f40495749c54dc87e"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-permitted-cross-domain-policies: The live app\u0027s responses did not include x-permitted-cross-domain-policies (recommended by the OWASP Secure Headers Project (value: none)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"55366a3d9fb1c5952ebc54aab272eb775bf2c1b056d6d399652365c26cc2375b"}},{"ruleId":"AXO1","level":"warning","message":{"text":"API operation answered with no credentials: GET /health: http://127.0.0.1:8765/health returned HTTP 200 to two GET requests carrying nothing. Observed on the live app. We do not decide whether this operation is meant to be public. Advisory evidence for CRA Annex I (2)(d) and NIS2 IR.4.1."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"268f40d588f3249380117a4882ad8bc5ad08cc667c5911278b2740072624e6c8"}},{"ruleId":"AXO1","level":"warning","message":{"text":"API operation answered with no credentials: GET /capabilities: http://127.0.0.1:8765/capabilities returned HTTP 200 to two GET requests carrying nothing. Observed on the live app. We do not decide whether this operation is meant to be public. Advisory evidence for CRA Annex I (2)(d) and NIS2 IR.4.1."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"29e9f1792183b5511c9658218951879595c11c04788c352059e44c9a304a231d"}},{"ruleId":"AXO1","level":"warning","message":{"text":"API operation answered with no credentials: GET /openapi.json: http://127.0.0.1:8765/openapi.json returned HTTP 200 to two GET requests carrying nothing. Observed on the live app. We do not decide whether this operation is meant to be public. Advisory evidence for CRA Annex I (2)(d) and NIS2 IR.4.1."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9e088929a9a4c90dc3f3fb5d34d1e8014f52d2dd3e19229bbe6a5a26d2378f34"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 2.4.2 reproducibly failed in a rendered surface: axe-core rule(s) document-title failed on: html. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a152f745c16f064aeb9932e5d52584f548c37c248ac45bacf96a1a6ffc2e49e7"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 3.1.1 reproducibly failed in a rendered surface: axe-core rule(s) html-has-lang failed on: html. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e2d0e1d2bf07ce04d82230fe7847e003479b78cd188efe60cc79686fb8ba8420"}},{"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":"M3","level":"note","message":{"text":"No src/ separation: Most of the production code is in directories of its own, but 1 application file(s) sit at the repository root beside the build and tooling files (\u0060install_skill.py\u0060)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging call was found in the 6 Python production file(s) this check read across 1 module(s). Each was searched for its ecosystem\u0027s logging libraries (Python: logging, structlog, loguru) and for a call on a receiver named \u0060log\u0060/\u0060logger\u0060 (or ending in \u0060Logger\u0060/\u0060_logger\u0060) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read \u2014 this is \u0027no logging found by this walk\u0027, not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P4","level":"note","message":{"text":"No rollback/health safety: Deployment is orchestrated by compose, but no service declares a \u0060healthcheck:\u0060 and nothing pins a previous image to fall back to \u2014 the runtime can tell that the container is up, not that it is serving, so a bad release is harder to detect and reverse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/release-images.yml"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6bab8a28a2145f47e5a4e6683cda39d2ba0296c723238e8057da979ae1c706"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022bytes_in\u0022 in result and \u0022bytes_out\u0022 in result and result[\u0022bytes_in\u0022] != result[\u0022bytes_out\u0022]\u0060 appears character-identically in 2 files \u2014 service/scripts/common.py, skills/clean-user-facing-text/scripts/common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa8b7087b283c43b5e6c38729c83ba772dec0ce31259287a16f1fd6a7b0d798"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060action_lower.startswith(\u0022no \u0022) or action_lower.startswith(\u0022warning:\u0022) or \u0022not needed\u0022 in action_lower or \u0022skipped\u0022 in action_lower or \u0022prese\u2026\u0060 appears character-identically in 2 files \u2014 service/scripts/common.py, skills/clean-user-facing-text/scripts/common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"0931b2057484e2397cad4d7dc9a32d2d9ee7002cbb16fbc68dc40d5393a0b0df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.force_type == \u0022text\u0022 or args.force_text\u0060 appears character-identically in 2 files \u2014 service/scripts/clean_file.py, service/scripts/inspect_file.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":"service/scripts/clean_file.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b85df5f9f0765eba9e1d1e8ae87c7f13b682ee3df17878484ae4de9a6af7d69"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.path != \u0022-\u0022 and not Path(args.path).is_file()\u0060 appears character-identically in 2 files \u2014 service/scripts/detect_text_watermark.py, service/scripts/markdiffusion_harness.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":"service/scripts/detect_text_watermark.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e37e31e2ce844d065c6dd91a0cfe50e3c28df024c731cc122435c717baa6688"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060clean != config.strip() or clean in (\u0022..\u0022, \u0022.\u0022, \u0022\u0022)\u0060 appears character-identically in 2 files \u2014 service/scripts/detect_text_watermark.py, service/scripts/text_watermark.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":"service/scripts/detect_text_watermark.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57c8373f73000d2599e178a05858f37a37506671bc42a09f3e0b0821a801b24"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cv is not None and cv \u003C 0.35 and sentence_count \u003E= 3\u0060 appears character-identically in 2 files \u2014 service/scripts/score_stylometry.py, skills/clean-user-facing-text/scripts/score_stylometry.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":"service/scripts/score_stylometry.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38b1146f0b1eafa66d978f036b287d5b337888c6b12b1f89e89f5f728ad70ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data[:100].lstrip().startswith(b\u0022\u003C\u0022) and b\u0022svg\u0022 in data[:500].lower()\u0060 appears character-identically in 2 files \u2014 service/scripts/audit_website.py, service/scripts/container_meta.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":"service/scripts/audit_website.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a30250d786e6d12ac0af92b495e767094016d39aa12b6c58d9e65959a4fd594"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host not in (\u0022127.0.0.1\u0022, \u0022localhost\u0022, \u0022::1\u0022) and not allow_remote\u0060 appears character-identically in 2 files \u2014 service/scripts/server.py, stealer/steal.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":"service/scripts/server.py"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b6c729b3d9d3380054e81c5c1a09de36122dc30d1fba301ad98472a7e1d78c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(score, (int, float)) and isinstance(threshold, (int, float))\u0060 appears character-identically in 2 files \u2014 service/scripts/bench_synthid_text.py, service/scripts/rewrite_text.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":"service/scripts/bench_synthid_text.py"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"415e080d61715ec9a2eeb2a378bcb9048e077eac338358a9404d2dba26a10788"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(data) \u003E= 12 and data[4:8] == b\u0022ftyp\u0022\u0060 appears character-identically in 2 files \u2014 service/scripts/av_meta.py, service/scripts/image_meta.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":"service/scripts/av_meta.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"969880faa9021465fd5a27ab225ac9394818d4c47c973de1024e61f4c4a53a36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(text, str) or not text.strip()\u0060 appears character-identically in 2 files \u2014 service/scripts/synthid_text_server.py, service/scripts/text_watermark.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":"service/scripts/synthid_text_server.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e14df9438b3b5d09859c5d9ba7f7602174c65bc0549d6f3564e65f8227d9a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060out is None and args.path not in (None, \u0022-\u0022)\u0060 appears character-identically in 2 files \u2014 service/scripts/clean_text.py, skills/clean-user-facing-text/scripts/clean_text.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":"service/scripts/clean_text.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bd10720966aa2f0cb42ac37de28bab5eb35fd4de28dcbeca3a209a15a56436"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw_len is not None and raw_len.isdigit() and int(raw_len) \u003E MAX_BODY_BYTES\u0060 appears character-identically in 3 files \u2014 service/scripts/server.py, service/scripts/synthid_score_server.py, service/scripts/synthid_text_server.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":"service/scripts/server.py"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2fef3839a8c591df7940b2346f6cc4071e71be346565b2fdf1466621c88e5a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060report.status == \u0022ok\u0022 and report.score is not None and report.score \u003E= args.threshold\u0060 appears character-identically in 2 files \u2014 service/scripts/score_stylometry.py, skills/clean-user-facing-text/scripts/score_stylometry.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":"service/scripts/score_stylometry.py"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"c424d80369e79f06a20a58244beeebfd32615a7391196c0218b8c65d3bab47d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result[\u0022still_has_c2pa\u0022] or result[\u0022still_has_ai_metadata\u0022]\u0060 appears character-identically in 2 files \u2014 service/scripts/clean_file.py, service/scripts/clean_image.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/clean_file.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d558fe362f10e73f3222cdc4a42244370efc313a8d5fff2ad367f064727f686"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stats.get(\u0022removed_count\u0022) or stats.get(\u0022replaced_count\u0022)\u0060 appears character-identically in 2 files \u2014 service/scripts/common.py, skills/clean-user-facing-text/scripts/common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"2821e3f7d3c7c807d70374090f3281d9ed16cb5a33a9a747ec6ef2059e9d46d2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stats[\u0022removed_count\u0022] or stats[\u0022replaced_count\u0022]\u0060 appears character-identically in 2 files \u2014 service/scripts/clean_file.py, service/scripts/container_meta.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":"service/scripts/clean_file.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8789c349030157f643205c21ecccc0bbaffbe0a7afe2c3a19efed1c01a4541c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stylometry_report and stylometry_report.status == \u0022ok\u0022 and stylometry_report.score is not None and stylometry_report.score \u003E= args.threshold\u0060 appears character-identically in 2 files \u2014 service/scripts/inspect_text.py, skills/clean-user-facing-text/scripts/inspect_text.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":"service/scripts/inspect_text.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e95c24b5c151e6b377f4b8057e9d8a8f1f3851dc88a4f7dbde5f71b32a1ec1b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t.startswith(\u0022layer-a\u0022) and t.endswith(\u0022(space)\u0022)\u0060 appears character-identically in 2 files \u2014 service/scripts/common.py, skills/clean-user-facing-text/scripts/common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/common.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"20aec08bf09340bf0b484b937527ba9edf23e77614f7dfc296f7cca1e2bc39ba"}},{"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":"service/scripts/clean_audio.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae78b3324c8e1991e194b7b0a0eb0b310ebdf3eb22f6ed0b34beb2452d0f85f"}},{"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":"service/scripts/container_meta.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7401ae90cd6ec0df3b2d5f3994f4f65cc30614f696fe0fa10dba3b62339c66b"}},{"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":"service/scripts/container_meta.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c117f731ca3bc3f69853659671e05a19b69f3c5cdf0038a8374ac11e742a91"}},{"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":"service/scripts/container_meta.py"},"region":{"startLine":3849}}}],"partialFingerprints":{"codehealthFindingId/v1":"319057e2828a261236b73fcad635be793881d0ffa43c3323c69e9a1f4d8783db"}},{"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":"service/scripts/container_meta.py"},"region":{"startLine":3855}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c3fb5dbe56e7b767e37b8a8ad1a05a0f97de90a854d5464eb25dc013cd13b1"}},{"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":"service/scripts/container_meta.py"},"region":{"startLine":3949}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0a06e1d37d9c3b47ae717edc38a97727780806e8ed8afa96efacb4cdcf192e"}},{"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":"service/scripts/container_meta.py"},"region":{"startLine":4238}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bd009f6cd39df3ac4e02fda0fa11d3bc7b4c501b99736a6051c63718635fcf"}},{"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":"service/scripts/server.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"424047bfedba37ae28b878d3e09edfa5f65f646c7a3713814b4acabf74974da7"}},{"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":"service/scripts/server.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b29a0775e4624ce918893af1e146facaa1ae07f33371fe4649f776469759198"}},{"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":"service/scripts/container_meta.py"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80f785fd87da3902df20830db1b0bbeaa4a57d32372d76c0659cf4470fa2616"}},{"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":"service/scripts/container_meta.py"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"5535bce7e3fdc936a739aea739fc23ae587fcb9a7e6de0a422e38c99002e4648"}},{"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":"service/scripts/container_meta.py"},"region":{"startLine":2571}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7228b008dcd433158d883588f671835a76db9a2f907005f188a9d28c299e680"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_probe_sample_rate\u0060 returns \u006044100\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":"service/scripts/clean_audio.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8394952f428196a97a9d07bbbe34f73b4e7c71d6047d59ee33e0c23d7c94a2ff"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_frame_durations\u0060 returns \u0060[]\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":"service/scripts/clean_video.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0c1be5c3d6866508344b631178c0ec9510ff94611f2e71b1e995341b5674df"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_pdf_attachment_list\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"service/scripts/container_meta.py"},"region":{"startLine":3849}}}],"partialFingerprints":{"codehealthFindingId/v1":"c670cd2f3c1dc94a6e076583462012406e1f9144f78d1c22c1c8b9465966a31b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_retry_after\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":"stealer/download_prompts.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef4e30fbc607243a335080fa22306567730e4d5f52551dfb2303fd90b6f2e33"}}],"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-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.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-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"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":17,"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."]}]}