{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"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":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"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":"Main._render_audio_settings (cyclomatic 111): Main._render_audio_settings has cyclomatic complexity 111 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: webui/Main.py holds 14 of the 92 methods over the threshold \u2014 including the worst \u2014 and 415 of the 1095 points over it (38%), 3.2\u00D7 the next-largest file (app/services/voice.py at 130). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":7946}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fc284d3a0b411030fcd80cc1901166d6deaac7c4e7307b6cdf229a0be1d692"}},{"ruleId":"D1","level":"warning","message":{"text":"Main._render_generation_controls (cyclomatic 95): Main._render_generation_controls has cyclomatic complexity 95 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: webui/Main.py holds 14 of the 92 methods over the threshold \u2014 including the worst \u2014 and 415 of the 1095 points over it (38%), 3.2\u00D7 the next-largest file (app/services/voice.py at 130). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":8984}}}],"partialFingerprints":{"codehealthFindingId/v1":"c788536ee85b9ccb36d2cfa7b8d131c38ebf9128d3a1745585097f703882c4e8"}},{"ruleId":"D1","level":"warning","message":{"text":"llm._generate_response (cyclomatic 85): llm._generate_response has cyclomatic complexity 85 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/llm.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bcdb26f019cff4f9dd98e7a5fecadae0bbe32367ca0297ff452afcfd6f442b"}},{"ruleId":"D1","level":"warning","message":{"text":"task._run_pipeline (cyclomatic 79): task._run_pipeline has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/task.py"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9b77601045269765d3570f3e6e8fe0c9db0ca0098eacbbe4bc19d6f61f6137"}},{"ruleId":"D1","level":"warning","message":{"text":"Main._render_settings_dialog (cyclomatic 68): Main._render_settings_dialog has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: webui/Main.py holds 14 of the 92 methods over the threshold \u2014 including the worst \u2014 and 415 of the 1095 points over it (38%), 3.2\u00D7 the next-largest file (app/services/voice.py at 130). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":4208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3754ad3375ec8003371841a621b7b2e09314a9386b0cc0d70c7cbb78dae7ba"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._validate_batch_task_params (cyclomatic 58): cli._validate_batch_task_params has cyclomatic complexity 58 (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":"cli.py"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"843333a67899f39dc7e7094abfeb632b530a3f425e2ed43bd8569fd885d97dfb"}},{"ruleId":"D1","level":"warning","message":{"text":"Main._render_material_provider_settings (cyclomatic 57): Main._render_material_provider_settings has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: webui/Main.py holds 14 of the 92 methods over the threshold \u2014 including the worst \u2014 and 415 of the 1095 points over it (38%), 3.2\u00D7 the next-largest file (app/services/voice.py at 130). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":3607}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb3bc42e67c62379ebb05d964324d3dc721af661b03752dec8b669f4584d87b"}},{"ruleId":"D1","level":"warning","message":{"text":"mpt_agent.missing_config (cyclomatic 50): mpt_agent.missing_config 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":"docs/skill/mpt_agent.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d48c62307cc1a0b1f672923f282c27036ea32f5a55aeecbbb5c1a22d790bdd1"}},{"ruleId":"D1","level":"warning","message":{"text":"Main._render_background_music_settings (cyclomatic 49): Main._render_background_music_settings has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: webui/Main.py holds 14 of the 92 methods over the threshold \u2014 including the worst \u2014 and 415 of the 1095 points over it (38%), 3.2\u00D7 the next-largest file (app/services/voice.py at 130). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":7624}}}],"partialFingerprints":{"codehealthFindingId/v1":"582237c5e1ae53b9b0f6d564177c1e020eb2e66945a9c9c59717dcb146b2b02f"}},{"ruleId":"D1","level":"warning","message":{"text":"voice.voxcpm_tts (cyclomatic 42): voice.voxcpm_tts 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":"app/services/voice.py"},"region":{"startLine":3270}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e82f269066f6a96e881300ae37ff5cc340e8f2533582bec261b14b39ea803eb"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.parse_args (cyclomatic 41): cli.parse_args has cyclomatic complexity 41 (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":"cli.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f5677865c08ed444c0e05ba5487a87a2f80a669c78a708016d8936fda84e3d"}},{"ruleId":"D1","level":"warning","message":{"text":"voice.elevenlabs_tts (cyclomatic 39): voice.elevenlabs_tts has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":2533}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfc02a1f5c5771c270a2980092c209eea816e3d1bb688adf64070dd5b5c2d50"}},{"ruleId":"D1","level":"warning","message":{"text":"Main._render_generation_task_snapshot (cyclomatic 36): Main._render_generation_task_snapshot 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: webui/Main.py holds 14 of the 92 methods over the threshold \u2014 including the worst \u2014 and 415 of the 1095 points over it (38%), 3.2\u00D7 the next-largest file (app/services/voice.py at 130). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c87ce49432403d416e20b668438eda01b1e252b31986ac2b84ea53d49708274"}},{"ruleId":"D1","level":"warning","message":{"text":"voice.minimax_tts (cyclomatic 33): voice.minimax_tts 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":"app/services/voice.py"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad3bc73999f0d8b780c4cf3166d3cc6e1695029ce608a678ba76c2772a9a231"}},{"ruleId":"D1","level":"warning","message":{"text":"task.get_video_materials (cyclomatic 32): task.get_video_materials 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":"app/services/task.py"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff0ab85f8c8217a34cb8a34e768777c395174ce85f1cac4aa7d814cdb0da698"}},{"ruleId":"D1","level":"warning","message":{"text":"video.combine_videos (cyclomatic 32): video.combine_videos 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":"app/services/video.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9091bbe3c07cd61b1dcfcffdce30ffda804c1a7b02378e0a175bc700a01cad"}},{"ruleId":"D1","level":"warning","message":{"text":"Main._apply_restored_params (cyclomatic 32): Main._apply_restored_params has cyclomatic complexity 32 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: webui/Main.py holds 14 of the 92 methods over the threshold \u2014 including the worst \u2014 and 415 of the 1095 points over it (38%), 3.2\u00D7 the next-largest file (app/services/voice.py at 130). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c264c5f3db8651d473482f6dcaf774e1fc46c3409c2151d71d2330dd4beb41"}},{"ruleId":"D1","level":"warning","message":{"text":"Main._render_loomloom_video_settings (cyclomatic 32): Main._render_loomloom_video_settings 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: webui/Main.py holds 14 of the 92 methods over the threshold \u2014 including the worst \u2014 and 415 of the 1095 points over it (38%), 3.2\u00D7 the next-largest file (app/services/voice.py at 130). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":5240}}}],"partialFingerprints":{"codehealthFindingId/v1":"254ed87edc958111a9c0740e78f49a53332e46112f28123c7d5ea22f3f83ab23"}},{"ruleId":"D1","level":"warning","message":{"text":"Main._render_video_settings (cyclomatic 32): Main._render_video_settings has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: webui/Main.py holds 14 of the 92 methods over the threshold \u2014 including the worst \u2014 and 415 of the 1095 points over it (38%), 3.2\u00D7 the next-largest file (app/services/voice.py at 130). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":6030}}}],"partialFingerprints":{"codehealthFindingId/v1":"0836573ddc6822e40ed40cf2c8846b89023afc26739f3bc0210f2a0482b70669"}},{"ruleId":"D1","level":"warning","message":{"text":"material.download_videos (cyclomatic 31): material.download_videos has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a257789286e41446735f371c68ac78d55fd652a40e265d3947e97d4adbdcd5c"}},{"ruleId":"D1","level":"warning","message":{"text":"UploadPostService.upload_video (cyclomatic 31): UploadPostService.upload_video has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/upload_post.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"891b81dd53e6fc5ffb447d083024dca5fe75297310b0ad6217ab88bdd3f5fd94"}},{"ruleId":"D1","level":"warning","message":{"text":"voice._tts_with_pauses (cyclomatic 30): voice._tts_with_pauses has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d23c7badd42f151128a392de84366077651c5d2f577253a41e1f6e0d9768c50"}},{"ruleId":"D1","level":"warning","message":{"text":"voice.fish_audio_tts (cyclomatic 30): voice.fish_audio_tts has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":2922}}}],"partialFingerprints":{"codehealthFindingId/v1":"a906b44d28d28e3f95abf68a1a5169d4f07986c2a2551294e982e6cb2dc8f75d"}},{"ruleId":"D1","level":"warning","message":{"text":"volcengine_seedance.generate_videos (cyclomatic 30): volcengine_seedance.generate_videos has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/volcengine_seedance.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"296c0c7e1861b4d58c0dd02306dba42fadd0d267e9502d14a5e7660f67330930"}},{"ruleId":"D1","level":"warning","message":{"text":"material._download_videos_seedance_on_demand (cyclomatic 28): material._download_videos_seedance_on_demand has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fa74046e86a1070a5221b749d936372c4c1cca527375ed921c28a40e6f74bd"}},{"ruleId":"D1","level":"warning","message":{"text":"voice._single_tts (cyclomatic 28): voice._single_tts has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"708e051909ac521ea9b9d5994a8bf97cb3b79d11ae6abe2fbf758ba2359a5b77"}},{"ruleId":"D1","level":"warning","message":{"text":"material.search_videos_pixabay (cyclomatic 27): material.search_videos_pixabay 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":"app/services/material.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8496c4a508ae8954f183fe42b8d58e4a441c2ad73d992e5ebcabb8260f8d68b"}},{"ruleId":"D1","level":"warning","message":{"text":"Main._render_voice_preview (cyclomatic 27): Main._render_voice_preview 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: webui/Main.py holds 14 of the 92 methods over the threshold \u2014 including the worst \u2014 and 415 of the 1095 points over it (38%), 3.2\u00D7 the next-largest file (app/services/voice.py at 130). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":7182}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b36dff3e52550147ea3ea334e26723230d4495fac3e665a6152a14c9d623273"}},{"ruleId":"D1","level":"warning","message":{"text":"mpt_agent.report_missing_config (cyclomatic 25): mpt_agent.report_missing_config 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":"docs/skill/mpt_agent.py"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"8befe608ca6891f920cd7575bf8993985d9f25503d75d2868fca27560911b4f0"}},{"ruleId":"D1","level":"warning","message":{"text":"subtitle.create (cyclomatic 24): subtitle.create 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":"app/services/subtitle.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"850f084a1b2b299b2a1ac1c3c2bcffaade91a14bb94c870a6811e04f0c902fad"}},{"ruleId":"D1","level":"warning","message":{"text":"Main._render_loomloom_script_generation (cyclomatic 24): Main._render_loomloom_script_generation 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: webui/Main.py holds 14 of the 92 methods over the threshold \u2014 including the worst \u2014 and 415 of the 1095 points over it (38%), 3.2\u00D7 the next-largest file (app/services/voice.py at 130). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":5653}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e4d1f91e139a5b35b2aedfd9b661b298f5c7356558ebcb259ccecd3ab68cf1"}},{"ruleId":"D1","level":"warning","message":{"text":"Main._render_subtitle_settings (cyclomatic 24): Main._render_subtitle_settings 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: webui/Main.py holds 14 of the 92 methods over the threshold \u2014 including the worst \u2014 and 415 of the 1095 points over it (38%), 3.2\u00D7 the next-largest file (app/services/voice.py at 130). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":8645}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1206e2884b4368ed3b7bbec4399926871e04093288bc2e61eb0842c7e0da293"}},{"ruleId":"D1","level":"warning","message":{"text":"LoomLoomVideoBackend.resolve_video_capability (cyclomatic 23): LoomLoomVideoBackend.resolve_video_capability has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/loomloom.py"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"1177fce73f27dc184f78bd1a027bd89f1900ce371a80180014640145dbc8af5e"}},{"ruleId":"D1","level":"warning","message":{"text":"material.generate_videos_wavespeed (cyclomatic 23): material.generate_videos_wavespeed has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a1d9999949590c576951291d88b6f56711c80e330638391ee8820932b8400e"}},{"ruleId":"D1","level":"warning","message":{"text":"ofox.generate_videos (cyclomatic 23): ofox.generate_videos has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/ofox.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"950c5f7245f03704f370aca6878e5b28129eddfb2de26fbe487c49cf286ce3e8"}},{"ruleId":"D1","level":"warning","message":{"text":"video.wrap_text (cyclomatic 23): video.wrap_text 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":"app/services/video.py"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa01f68dc8e1d5eef556da191551855dfafa1c3e5c970720088c4efc2564846d"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.build_video_params (cyclomatic 23): cli.build_video_params 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":"cli.py"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7aca63b6d2e34e7801c80ff6bfa51528424a24aec9b0c3a018644f7c37624e6"}},{"ruleId":"D1","level":"warning","message":{"text":"material._download_videos_muapi_on_demand (cyclomatic 22): material._download_videos_muapi_on_demand has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":2994}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aef46e29a08376bd1d5da29cbcaa853caf2454accb6a9a24710bbb08c4c1807"}},{"ruleId":"D1","level":"warning","message":{"text":"material._download_videos_by_script_order (cyclomatic 22): material._download_videos_by_script_order has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":3228}}}],"partialFingerprints":{"codehealthFindingId/v1":"569504f071c853aa2a4ee65bcb982d2e597a26459a10172623eca7072f350681"}},{"ruleId":"D1","level":"warning","message":{"text":"muapi.generate_videos (cyclomatic 22): muapi.generate_videos has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/muapi.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"282d041524dbc6a68714f3a0d1a64b3bb28c6834de16cae5fe32f74a5ca4e8c9"}},{"ruleId":"D1","level":"warning","message":{"text":"settings_providers.configured_llm_providers (cyclomatic 22): settings_providers.configured_llm_providers has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/settings_providers.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42d11aa2a3b5d74efb4c3f0b4fd82b23acc22b3ceaf7b92b5e5b49651193675"}},{"ruleId":"D1","level":"warning","message":{"text":"material.save_video (cyclomatic 21): material.save_video 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":"app/services/material.py"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d2b03f0d680e03d8737b7bd05699951966e1817c7bdc2c5ff09e9ca174019d"}},{"ruleId":"D1","level":"warning","message":{"text":"task.generate_final_videos (cyclomatic 21): task.generate_final_videos 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":"app/services/task.py"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d81f0e44eb3520a705604e42ad3822275e4e414b23569cbd2b95229287dd7c"}},{"ruleId":"D1","level":"warning","message":{"text":"Main._collect_task_summaries (cyclomatic 21): Main._collect_task_summaries 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: webui/Main.py holds 14 of the 92 methods over the threshold \u2014 including the worst \u2014 and 415 of the 1095 points over it (38%), 3.2\u00D7 the next-largest file (app/services/voice.py at 130). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"930d630158e42d58f543acb3b56dc845a47ae1e21e43d34950922366fd7bfe26"}},{"ruleId":"D1","level":"warning","message":{"text":"material.search_videos_pexels (cyclomatic 20): material.search_videos_pexels 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":"app/services/material.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a28ead4e67b4bc4a21aa16a429f985d68a8019c49b1a5d395854da0ca2f397"}},{"ruleId":"D1","level":"warning","message":{"text":"material._wait_for_wavespeed_prediction (cyclomatic 20): material._wait_for_wavespeed_prediction 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":"app/services/material.py"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8b670afc102f67cfab80be9990fe38fa78664a7061cca46cb6e0a2b79f6c7d"}},{"ruleId":"D1","level":"warning","message":{"text":"task._run_cross_post (cyclomatic 20): task._run_cross_post 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":"app/services/task.py"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49925ded8caf31c1a9121ab7c34c46c18c0fe327384f624dc5145b16e9c1688"}},{"ruleId":"D1","level":"warning","message":{"text":"chatgpt_login._render_login_controls (cyclomatic 20): chatgpt_login._render_login_controls 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":"webui/chatgpt_login.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"27aa4f4993a7eb9375be021b0b824dc10e5a4e77037cc6bfc556e3dba091fe10"}},{"ruleId":"D1","level":"warning","message":{"text":"codex_login.render_codex_login (cyclomatic 20): codex_login.render_codex_login 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":"webui/codex_login.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a03914deca50651633cf7e916be1c90064a01ce19d011194c7d7bbfcb220dd"}},{"ruleId":"D1","level":"warning","message":{"text":"chatgpt_oauth._stream_event (cyclomatic 19): chatgpt_oauth._stream_event 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":"app/services/chatgpt_oauth.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f5af6dca27267b97e0ff4bb3955d41f30e48d7906219b5cd221bd1f7b62cd5"}},{"ruleId":"D1","level":"warning","message":{"text":"material._request_openai_image (cyclomatic 19): material._request_openai_image 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":"app/services/material.py"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fff794c726c0b43fabc87a86b63d58473d36cbc9de27d58802c401fbf77b2f"}},{"ruleId":"D1","level":"warning","message":{"text":"metaso_minimax.generate_videos (cyclomatic 19): metaso_minimax.generate_videos 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":"app/services/metaso_minimax.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd9994f3c0fb85927f81b762cb16fc2efc5eadb310fd74755cf5c8250b7e5ed"}},{"ruleId":"D1","level":"warning","message":{"text":"subtitle._end_of_script_line_in_cue (cyclomatic 19): subtitle._end_of_script_line_in_cue 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":"app/services/subtitle.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"40246c83c49c5140c5814181ec20e8311cbd9e05ee6d0b36d4426ad1493fdc60"}},{"ruleId":"D1","level":"warning","message":{"text":"VideoProject.create_revision (cyclomatic 19): VideoProject.create_revision 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":"app/services/video_project.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f87e40c32492097d657bdaad7df5c9c840a6d72dcbc9ff3fe834d89077a75c8"}},{"ruleId":"D1","level":"warning","message":{"text":"voice._concat_audio_files (cyclomatic 19): voice._concat_audio_files 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":"app/services/voice.py"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d2f21c5b90789756f4d925a6b75c37a0c4e2d28d9e06c29f545bb03a3e1458"}},{"ruleId":"D1","level":"warning","message":{"text":"voice.mimo_tts (cyclomatic 19): voice.mimo_tts 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":"app/services/voice.py"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e46dbd315af11eefbaa11c74082a1e6178a4c0303f4f5a77b5300dc8645607"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.split_string_by_punctuations (cyclomatic 19): utils.split_string_by_punctuations 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":"app/utils/utils.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0701ebcee84304a5bd68e394cb2cedb2445744f3af863e043a8743390974d95"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._validate_cli_files (cyclomatic 19): cli._validate_cli_files 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":"cli.py"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dc44fbea24e51e0460cc3acbbf4aac484bfb33d93bb2524b88f2ce4a5142ef"}},{"ruleId":"D1","level":"warning","message":{"text":"material._download_videos_openai_image_on_demand (cyclomatic 18): material._download_videos_openai_image_on_demand 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":"app/services/material.py"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1ddac865f4d126cae70e071a1e8b80901d90e43ade78bd84c4359af4b85ab3"}},{"ruleId":"D1","level":"warning","message":{"text":"material._download_videos_ofox_on_demand (cyclomatic 18): material._download_videos_ofox_on_demand 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. This shape REPEATS in the file: one other method here (material._download_videos_metaso_minimax_on_demand) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":2889}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a0f0bae19ab0f37448db9ee44c6b1b860dabed1e1ef1bd666e64f6a358fbff"}},{"ruleId":"D1","level":"warning","message":{"text":"material._download_videos_metaso_minimax_on_demand (cyclomatic 18): material._download_videos_metaso_minimax_on_demand 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. This shape REPEATS in the file: one other method here (material._download_videos_ofox_on_demand) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":3114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02db243caaea98a4002dcc978cb5e95db390b54c3a5ef1afcedb8e552d7b76d"}},{"ruleId":"D1","level":"warning","message":{"text":"sonilo._stream_audio (cyclomatic 18): sonilo._stream_audio 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":"app/services/sonilo.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"124365b935a6e8bf51b90b9ea6fe54b328ffc463a4819c60ba4deb0e86366c39"}},{"ruleId":"D1","level":"warning","message":{"text":"video.close_clip (cyclomatic 18): video.close_clip 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":"app/services/video.py"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd39cb73e02ac6cc00425b3e344873e01a7c2ef3d5520221b48e8857884814c"}},{"ruleId":"D1","level":"warning","message":{"text":"voice.siliconflow_tts (cyclomatic 18): voice.siliconflow_tts 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":"app/services/voice.py"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60fc2fc11f8cad1e6ce055335b1a528c07bcfcf777272e3c1623c921284d3b4"}},{"ruleId":"D1","level":"warning","message":{"text":"voice.get_minimax_voice_catalog (cyclomatic 18): voice.get_minimax_voice_catalog 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":"app/services/voice.py"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9de33b9856ba8c31b5f13769abeeb8cc5136c16745a496087d7d86ae85cecbe"}},{"ruleId":"D1","level":"warning","message":{"text":"volcengine_seedance._wait_for_task (cyclomatic 18): volcengine_seedance._wait_for_task 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":"app/services/volcengine_seedance.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f65ddf1e08da02f643d6420f0114fc3e1fc19093d1ceef1e12cb121360367a"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.parse_script_with_pauses (cyclomatic 18): utils.parse_script_with_pauses 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":"app/utils/utils.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9518e754d6d9085b43ee117ee121d6273771bed0f28daa8f485d729ca7b0b9"}},{"ruleId":"D1","level":"warning","message":{"text":"chatgpt_auth.credentials (cyclomatic 17): chatgpt_auth.credentials 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":"app/services/chatgpt_auth.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72ea5b545bab7c6d65938c13abb5fc6040ed1c7e0162f8de2ce311e7d7a862f"}},{"ruleId":"D1","level":"warning","message":{"text":"codex_image._event (cyclomatic 17): codex_image._event 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":"app/services/codex_image.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ec2f20dc859bc8aa3c4a13467feb8720a90f50aae6abec7f32879b56596ad7"}},{"ruleId":"D1","level":"warning","message":{"text":"generation_progress.remote (cyclomatic 17): generation_progress.remote 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":"app/services/generation_progress.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a55b0bba76790bca422b74d066990557498a89258fb94742e89e07a0b1815e"}},{"ruleId":"D1","level":"warning","message":{"text":"LoomLoomScriptBackend._parse_candidate (cyclomatic 17): LoomLoomScriptBackend._parse_candidate 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":"app/services/loomloom.py"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd9161308743b8a05bdb389d497bc42cd6c5621d889596c9fe56480e5136ce4"}},{"ruleId":"D1","level":"warning","message":{"text":"material.search_videos_coverr (cyclomatic 17): material.search_videos_coverr 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":"app/services/material.py"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8e2e576d115981aac35bc35c480c3826aec63f6da7f9b91fed6f1b70710fb4"}},{"ruleId":"D1","level":"warning","message":{"text":"material._download_videos_wavespeed_on_demand (cyclomatic 17): material._download_videos_wavespeed_on_demand 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":"app/services/material.py"},"region":{"startLine":2641}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b34f2f5b96b051dc45eb179de5c7aecd4f30960175691d2438eefa4b6a09af8"}},{"ruleId":"D1","level":"warning","message":{"text":"material_cache.load_material_search_cache (cyclomatic 17): material_cache.load_material_search_cache has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material_cache.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba671d5980eae5acf3b52581be95fbe445930c6d7c6fab7bd55d11708121f822"}},{"ruleId":"D1","level":"warning","message":{"text":"metaso_minimax._wait_for_task (cyclomatic 17): metaso_minimax._wait_for_task 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":"app/services/metaso_minimax.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c979ebec1b667eb633d5da9f55cf5e360b263fa5d14fcb4f849006f12df274a"}},{"ruleId":"D1","level":"warning","message":{"text":"muapi._wait_for_task (cyclomatic 17): muapi._wait_for_task 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":"app/services/muapi.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a3286ae9c5c6912eca32ed331139b24da956cff3cb5096d8af3675011aefa7"}},{"ruleId":"D1","level":"warning","message":{"text":"video.generate_video (cyclomatic 17): video.generate_video 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":"app/services/video.py"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"211de21a54cfcfbccb5e60c8469aad3d15dd990675df9132adb41d573c8cc84e"}},{"ruleId":"D1","level":"warning","message":{"text":"VideoProject.render (cyclomatic 17): VideoProject.render 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":"app/services/video_project.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"338789f58bd1d1b7e536ea09e24ec5bb3c32c69a36e0b1137408f980e10b8ff8"}},{"ruleId":"D1","level":"warning","message":{"text":"voice.prepare_voxcpm_reference_audio (cyclomatic 17): voice.prepare_voxcpm_reference_audio has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":3163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c261791e8a1bd1e364bd8436d85bbf70e0b9ee7ba9db1af0945bad9054aecbb7"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._load_batch_manifest (cyclomatic 17): cli._load_batch_manifest 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":"cli.py"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6142f2291252445fab6811b03ada804fd4f4930b0a0e845b120ff22ff83c69b"}},{"ruleId":"D1","level":"warning","message":{"text":"Main._render_general_settings (cyclomatic 17): Main._render_general_settings 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: webui/Main.py holds 14 of the 92 methods over the threshold \u2014 including the worst \u2014 and 415 of the 1095 points over it (38%), 3.2\u00D7 the next-largest file (app/services/voice.py at 130). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":3484}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a23e2f3985c978fa54f2683d8984c2546613ac47a0856a6d769c8479024c7a"}},{"ruleId":"D1","level":"warning","message":{"text":"RedisTaskManager._deserialize_task (cyclomatic 16): RedisTaskManager._deserialize_task 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":"app/controllers/manager/redis_manager.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9461cae1f6db4c43514860e4dfa0c060d83fe78acba4ab984cafa5e97ac3c7"}},{"ruleId":"D1","level":"warning","message":{"text":"video._parse_byte_range (cyclomatic 16): video._parse_byte_range 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":"app/controllers/v1/video.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bfa5991d459388c1b4a0ba71aa5c0611c95cafe759b3ebc689638b46b5beba"}},{"ruleId":"D1","level":"warning","message":{"text":"material_cache._cached_source_info (cyclomatic 16): material_cache._cached_source_info has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material_cache.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec18354fc376271ca3c2a904f1fd491afe75c15bdd614bcb0f498d73652d19b"}},{"ruleId":"D1","level":"warning","message":{"text":"material_cache.cleanup_expired_material_search_cache (cyclomatic 16): material_cache.cleanup_expired_material_search_cache 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":"app/services/material_cache.py"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1fcbb7ac7d8b880975928f7ea43a1ea3af516a908824c47c9c5d1bd95b199c"}},{"ruleId":"D1","level":"warning","message":{"text":"ofox._wait_for_task (cyclomatic 16): ofox._wait_for_task 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":"app/services/ofox.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b383954a9886916db86c070a91d498c9b3aa9f215baca96e3da05f81677010df"}},{"ruleId":"D1","level":"warning","message":{"text":"task._mark_task_failed (cyclomatic 16): task._mark_task_failed 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":"app/services/task.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9bb8893567b570dcb2492a0b9f0b22409d1cb248336ed7149cd8ab1750bec2"}},{"ruleId":"D1","level":"warning","message":{"text":"VideoProject._build (cyclomatic 16): VideoProject._build 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":"app/services/video_project.py"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"da270096ff13805335f0c65f7d295649ba0a5540cdc9b79c2b2900e8f42df1c2"}},{"ruleId":"D1","level":"warning","message":{"text":"voice.gemini_tts (cyclomatic 16): voice.gemini_tts 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":"app/services/voice.py"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f69289b08af1047258746f65e46978f77955ab0e8d2b08d5e488065b5566c9"}},{"ruleId":"D1","level":"warning","message":{"text":"voice._openai_compatible_tts (cyclomatic 16): voice._openai_compatible_tts 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":"app/services/voice.py"},"region":{"startLine":2714}}}],"partialFingerprints":{"codehealthFindingId/v1":"677f9fd59717c80359c6fd30879386821f3a37c5fe271f2478228a0768a80820"}},{"ruleId":"D1","level":"warning","message":{"text":"mpt_agent.apply_environment_config (cyclomatic 16): mpt_agent.apply_environment_config has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill/mpt_agent.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"276287b2f6e159c86b8eed7fa05dfd0d2ea1de0c0941ae447123573af60478d3"}},{"ruleId":"D1","level":"warning","message":{"text":"kimi_login.render_kimi_login (cyclomatic 16): kimi_login.render_kimi_login 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":"webui/kimi_login.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc7a894d1e15a958ee66e09a292e8172c8b8a9e9eab18204a9e3675ffee83e0"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._render_generation_controls (cognitive 172): Main._render_generation_controls has cognitive complexity 172 (threshold 15). Drivers by points: if/else 45 (95 pts), error handling 14 (41 pts), boolean chains 30, loops 1 (3 pts), ternaries 2 (3 pts) (nesting depth added 80). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":8984}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90ecc934b648b66df491dbdd10560def0acd7218632df423dfaf522b58dc290"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._render_audio_settings (cognitive 152): Main._render_audio_settings has cognitive complexity 152 (threshold 15). Drivers by points: if/else 49 (87 pts), boolean chains 49, ternaries 4 (7 pts), error handling 1 (5 pts), loops 2 (4 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":7946}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2e768e2e04ff7af06b460e0cb70c48ec599f6e4465f35ca5c4fc7fa613e501"}},{"ruleId":"D2","level":"warning","message":{"text":"llm._generate_response (cognitive 149): llm._generate_response has cognitive complexity 149 (threshold 15). Drivers by points: if/else 60 (105 pts), boolean chains 20, error handling 7 (14 pts), loops 3 (5 pts), ternaries 3 (5 pts) (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/llm.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec3f3dc2b18b136ce4bc978b0ab2e02a2df2c60cd3f48bb29b6aa109f071ba7"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._render_settings_dialog (cognitive 130): Main._render_settings_dialog has cognitive complexity 130 (threshold 15). Drivers by points: if/else 49 (97 pts), ternaries 5 (15 pts), boolean chains 14, loops 2 (4 pts) (nesting depth added 60). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":4208}}}],"partialFingerprints":{"codehealthFindingId/v1":"528abdc64c446c3a9e8ceca23bcc8aa39aab675ae1ce8ce9d2d51f43cc165ce7"}},{"ruleId":"D2","level":"warning","message":{"text":"task._run_pipeline (cognitive 105): task._run_pipeline has cognitive complexity 105 (threshold 15). Drivers by points: if/else 41 (57 pts), boolean chains 23, error handling 7 (16 pts), ternaries 7 (9 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":"app/services/task.py"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcefd1103e4b97051c7ea2152198bd82b3e0f44fea21fdb2ab526f02e3de134"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._render_background_music_settings (cognitive 92): Main._render_background_music_settings has cognitive complexity 92 (threshold 15). Drivers by points: if/else 25 (48 pts), error handling 8 (26 pts), boolean chains 12, ternaries 2 (6 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":7624}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d64aa7059228d3bea8a237c7d5d3c0985b0785b8665a579698bc7feb9903cbf"}},{"ruleId":"D2","level":"warning","message":{"text":"voice.voxcpm_tts (cognitive 73): voice.voxcpm_tts has cognitive complexity 73 (threshold 15). Drivers by points: if/else 21 (45 pts), error handling 6 (14 pts), boolean chains 11, loops 2 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":3270}}}],"partialFingerprints":{"codehealthFindingId/v1":"990adda23602692610bdbe39c30271adebcf4b857dfbb3158ad8de58be642d54"}},{"ruleId":"D2","level":"warning","message":{"text":"voice.elevenlabs_tts (cognitive 70): voice.elevenlabs_tts has cognitive complexity 70 (threshold 15). Drivers by points: if/else 18 (37 pts), error handling 6 (13 pts), boolean chains 8, loops 3 (6 pts), ternaries 3 (6 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":2533}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecde3c9ca23472777b4e6146628fd87b3a083a23831e860fd838dd83bb2f9e4d"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._validate_batch_task_params (cognitive 65): cli._validate_batch_task_params has cognitive complexity 65 (threshold 15). Drivers by points: if/else 27 (32 pts), boolean chains 23, ternaries 3 (6 pts), loops 4 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli.py"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7013501f7ada6acfff9061ee3450562a1cacd02c4b3dbacdf09e2021ef119413"}},{"ruleId":"D2","level":"warning","message":{"text":"mpt_agent.missing_config (cognitive 63): mpt_agent.missing_config has cognitive complexity 63 (threshold 15). Drivers by points: if/else 25 (46 pts), boolean chains 13, loops 2 (4 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill/mpt_agent.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"808bea53601725dd4fd4e64724b4d4414f712c5d336251224530064046a26523"}},{"ruleId":"D2","level":"warning","message":{"text":"task.get_video_materials (cognitive 61): task.get_video_materials has cognitive complexity 61 (threshold 15). Drivers by points: ternaries 10 (28 pts), error handling 8 (16 pts), if/else 6 (10 pts), boolean chains 7 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/task.py"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16cb6699062c4e1611933ebf2a900fb965bbd4ccca9e0f571c8937bd8623aa7"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._render_material_provider_settings (cognitive 60): Main._render_material_provider_settings has cognitive complexity 60 (threshold 15). Drivers by points: boolean chains 32, ternaries 8 (16 pts), if/else 7 (12 pts) (nesting depth added 13). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":3607}}}],"partialFingerprints":{"codehealthFindingId/v1":"30722cb71419f1bf188e54f75aa98a195b1a1995bc4a1006ff35fc2691be47df"}},{"ruleId":"D2","level":"warning","message":{"text":"voice._tts_with_pauses (cognitive 56): voice._tts_with_pauses has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 3 (9 pts), boolean chains 7, error handling 1 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"05048223ab4de81d5b4394b38544657581d6c615300f825eced26eb47385bfbb"}},{"ruleId":"D2","level":"warning","message":{"text":"video.combine_videos (cognitive 53): video.combine_videos has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 7 (12 pts), boolean chains 6, error handling 1 (2 pts), ternaries 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/video.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"964e6af297f58c6838b18b181e7364441ed326e1c6ef53570c8d5253ee4cc756"}},{"ruleId":"D2","level":"warning","message":{"text":"material.download_videos (cognitive 49): material.download_videos has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 6 (10 pts), error handling 2 (7 pts), boolean chains 3, ternaries 1 (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":"app/services/material.py"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4e60f4ee999e9b603143a924a43ffbdc3eeb414f7194d305a5c61304e4572e"}},{"ruleId":"D2","level":"warning","message":{"text":"material._download_videos_seedance_on_demand (cognitive 48): material._download_videos_seedance_on_demand has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 6 (13 pts), boolean chains 8, ternaries 3 (6 pts), 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":"app/services/material.py"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"947c02f57775a6fc9d988d0c53c983b4d4d345ae3151ab5c1713b5e573fb2725"}},{"ruleId":"D2","level":"warning","message":{"text":"material._download_videos_by_script_order (cognitive 47): material._download_videos_by_script_order has cognitive complexity 47 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 7 (13 pts), error handling 2 (7 pts), boolean chains 4, 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":"app/services/material.py"},"region":{"startLine":3228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c99e4754e0089e09cd8014c236aa6673ceff6a5ec2a9e672f894af7fe085cb9"}},{"ruleId":"D2","level":"warning","message":{"text":"subtitle.create (cognitive 47): subtitle.create has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (36 pts), loops 4 (8 pts), boolean chains 2, ternaries 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/subtitle.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1f2583dcbae2ed6d54a1780bbda8a7f6fb5f72edc48fed13b8ce6c7c452fc4"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._render_loomloom_video_settings (cognitive 47): Main._render_loomloom_video_settings has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 10, ternaries 2 (5 pts), error handling 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":5240}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5bda1c091f944c832f5ce1651c73605f95472af1566155581f805df01d002e"}},{"ruleId":"D2","level":"warning","message":{"text":"UploadPostService.upload_video (cognitive 45): UploadPostService.upload_video has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 8, error handling 3 (6 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":"app/services/upload_post.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ec38dcc230a38280ae593925e313433bb6d87718f9a18798886cff8d736c8b"}},{"ruleId":"D2","level":"warning","message":{"text":"voice.fish_audio_tts (cognitive 45): voice.fish_audio_tts has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (25 pts), error handling 6 (11 pts), boolean chains 8, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":2922}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb95a4bb701eac6cb834f742ff034401de52503dbce40701529c3ba55d55f2de"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._render_voice_preview (cognitive 45): Main._render_voice_preview has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (22 pts), ternaries 5 (12 pts), boolean chains 8, error handling 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":7182}}}],"partialFingerprints":{"codehealthFindingId/v1":"02af72728d7bd8f089bb484a2025e31ebd084e9b79453b2e6d09b1fd9275fae6"}},{"ruleId":"D2","level":"warning","message":{"text":"voice.minimax_tts (cognitive 44): voice.minimax_tts has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 15, error handling 4 (7 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":"app/services/voice.py"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"138efaa446d53eb1636c9a6bdd6a43f886ae656725bb7b21dd9ca468883f32a0"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._render_generation_task_snapshot (cognitive 44): Main._render_generation_task_snapshot has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 13, loops 3 (4 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dfca14d830b6a620c2e065c6c81769395a6fe633b87680ebd402cd698b9223"}},{"ruleId":"D2","level":"warning","message":{"text":"material.search_videos_pixabay (cognitive 41): material.search_videos_pixabay has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 10, error handling 3 (5 pts), ternaries 1 (4 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d1f61fbbb683f38803c24a20e71c12e99b1a6d04e3e9f6611ecd2189048f17"}},{"ruleId":"D2","level":"warning","message":{"text":"voice._single_tts (cognitive 41): voice._single_tts has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (37 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"233d309f15d1b92382116dfb3ffa460a09260cb583bf59ec4e91b8b56914908a"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.parse_args (cognitive 40): cli.parse_args has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 17, ternaries 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"26edf2374077942bb09bebc927fdfbd7c0098a82c3a116b67cffb50cd7cc6706"}},{"ruleId":"D2","level":"warning","message":{"text":"material._download_videos_muapi_on_demand (cognitive 39): material._download_videos_muapi_on_demand has cognitive complexity 39 (threshold 15). Drivers by points: error handling 6 (12 pts), if/else 6 (11 pts), ternaries 2 (8 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":2994}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebf05e44b496d184724340f0d48432d4953f71c2b3e21f44fcc7f8b658573f5"}},{"ruleId":"D2","level":"warning","message":{"text":"voice._concat_audio_files (cognitive 37): voice._concat_audio_files has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (26 pts), error handling 2 (7 pts), boolean chains 3, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5fcd18d554525da3fc2aad4035126c497ad0d58cfbda5975b51da71bc36757"}},{"ruleId":"D2","level":"warning","message":{"text":"material.search_videos_pexels (cognitive 36): material.search_videos_pexels has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 2 (6 pts), boolean chains 4, error handling 2 (4 pts), 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":"app/services/material.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"0327e1b1a23f2e2234f086ec412594a8bd21dea669a4f52a74262e62339393d7"}},{"ruleId":"D2","level":"warning","message":{"text":"material._download_videos_openai_image_on_demand (cognitive 36): material._download_videos_openai_image_on_demand has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 5 (12 pts), loops 2 (3 pts), ternaries 1 (2 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":"app/services/material.py"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c5604d5399720fff2eea86ef14b61f104d0b0b26b2c350f368fdacb060f74b"}},{"ruleId":"D2","level":"warning","message":{"text":"video.wrap_text (cognitive 35): video.wrap_text has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (26 pts), ternaries 3 (6 pts), loops 2, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/video.py"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f54f1449d60f6d8e7e3b587e6575d8d2204639537132b463fbfa478fb0c5c3"}},{"ruleId":"D2","level":"warning","message":{"text":"voice.siliconflow_tts (cognitive 35): voice.siliconflow_tts has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (20 pts), error handling 5 (12 pts), boolean chains 2, 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":"app/services/voice.py"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a059e0c14372d0ff42d16aa49870277eede9738020099c21a3182554fb96b9"}},{"ruleId":"D2","level":"warning","message":{"text":"material._wait_for_wavespeed_prediction (cognitive 34): material._wait_for_wavespeed_prediction has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 6, ternaries 2 (5 pts), error handling 2 (4 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2846b888ab7ab8c9ec023a0c60198ed5ac07e28d3f42b5c4ba1345cbf9024b"}},{"ruleId":"D2","level":"warning","message":{"text":"task.generate_final_videos (cognitive 34): task.generate_final_videos has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, ternaries 3 (5 pts), loops 2 (4 pts), error handling 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/task.py"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1c1ee44cc6f57cc9d4966c172ab03e7725e17ec4942f42726175e6782a7137"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._render_loomloom_script_generation (cognitive 34): Main._render_loomloom_script_generation has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 8, error handling 2 (6 pts), ternaries 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":5653}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eefd06016fb5cb88dcd3a12323f2de375144205736b22903e275169411537ab"}},{"ruleId":"D2","level":"warning","message":{"text":"material._openai_image_download_bytes (cognitive 33): material._openai_image_download_bytes has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (21 pts), error handling 3 (8 pts), loops 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96636936256f63ac5e921537800f529f461e7ae118db926cc0bb9296270362f"}},{"ruleId":"D2","level":"warning","message":{"text":"metaso_minimax._wait_for_task (cognitive 33): metaso_minimax._wait_for_task has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (25 pts), error handling 2 (4 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/metaso_minimax.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"331e4f7db36a49911d1b501282db57c80c7bfeed859116404f49e92d2fbef334"}},{"ruleId":"D2","level":"warning","message":{"text":"muapi._wait_for_task (cognitive 33): muapi._wait_for_task has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (27 pts), error handling 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/muapi.py"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6823ab10152378b2f925747f1ebe801b8318a4dfa45737b71740fc36f846cf"}},{"ruleId":"D2","level":"warning","message":{"text":"volcengine_seedance._wait_for_task (cognitive 33): volcengine_seedance._wait_for_task has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (25 pts), error handling 2 (4 pts), ternaries 2, boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/volcengine_seedance.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db7467682a4745509b55aa3b49997a4a10614ee2ddfd02565188cb45879da62"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.parse_script_with_pauses (cognitive 32): utils.parse_script_with_pauses has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 4, ternaries 1 (3 pts), 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":"app/utils/utils.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1ca047db684faea342e27014cf48820a4b3a6d8c71ce09488ae6c16250d8fe"}},{"ruleId":"D2","level":"warning","message":{"text":"material.save_video (cognitive 31): material.save_video has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (18 pts), error handling 6 (10 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cf7b045d1de55bb600622e9aaf1c041cc9307bc57de6b8ce207749c3def085"}},{"ruleId":"D2","level":"warning","message":{"text":"ofox._wait_for_task (cognitive 31): ofox._wait_for_task has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (25 pts), error handling 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/ofox.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e96eef85ed680fcc41df8f9efeb1fc3a7a21c0ef259d11d9a0b569442834d5"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._apply_restored_params (cognitive 31): Main._apply_restored_params has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 25, if/else 6. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd6bd2037844e812b9f17fede32da27efef9b9d3d023a930d5d2385a5abd75a"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._render_video_settings (cognitive 31): Main._render_video_settings has cognitive complexity 31 (threshold 15). Drivers by points: if/else 26, boolean chains 3, ternaries 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":6030}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ef30092593e1f13838f481bf3086eada3615a0714cf0b0afa5283dc9c0d3d8"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_login.render_codex_login (cognitive 31): codex_login.render_codex_login has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (20 pts), error handling 3 (6 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/codex_login.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e1d04df6563aecdc0fa1691d463000a0b4ed1bfa05f2480354fcb6b685fc02"}},{"ruleId":"D2","level":"warning","message":{"text":"material._download_videos_ofox_on_demand (cognitive 30): material._download_videos_ofox_on_demand has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 5 (9 pts), ternaries 1 (4 pts), boolean chains 3, 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. This shape REPEATS in the file: one other method here (material._download_videos_metaso_minimax_on_demand) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":2889}}}],"partialFingerprints":{"codehealthFindingId/v1":"125c9042247f34efb4279f077d342cee5fce8796a79957e3abc96d5ae2e0f86e"}},{"ruleId":"D2","level":"warning","message":{"text":"material._download_videos_metaso_minimax_on_demand (cognitive 30): material._download_videos_metaso_minimax_on_demand has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 5 (9 pts), ternaries 1 (4 pts), boolean chains 3, 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. This shape REPEATS in the file: one other method here (material._download_videos_ofox_on_demand) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":3114}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbb1cb786b1f49df5c303a04da09eca93cb0856919215d4a68d9684c0af3819"}},{"ruleId":"D2","level":"warning","message":{"text":"subtitle._align (cognitive 30): subtitle._align has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/subtitle.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4bb01fc242c47af569e59151219920302e3a719b0725c6060ea78822c3075a"}},{"ruleId":"D2","level":"warning","message":{"text":"volcengine_seedance.generate_videos (cognitive 30): volcengine_seedance.generate_videos has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 12 (13 pts), if/else 11, boolean chains 3, error handling 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/volcengine_seedance.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5428f2720261e4abdaf414649fe1a66808c0f7893333c22a3e80558e7acc24"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._collect_task_summaries (cognitive 30): Main._collect_task_summaries has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 7, error handling 3 (6 pts), ternaries 2 (4 pts), loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"754725871b935bf206f1bfadb58e45dfcd18cb6573f308648de13158acdce71b"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._render_general_settings (cognitive 30): Main._render_general_settings has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 6 (15 pts), if/else 6 (11 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":3484}}}],"partialFingerprints":{"codehealthFindingId/v1":"967a2fcf8c80dd9d85150716eb3adb0f730ae5f09e56a9aea4a5fac1d90055ef"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.split_string_by_punctuations (cognitive 29): utils.split_string_by_punctuations has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 6, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/utils/utils.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e8f2ae3aa44ebc6c7da5288fcd647c70db65fac640dacfe321088766afc428"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._render_subtitle_settings (cognitive 29): Main._render_subtitle_settings has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6, loops 3, ternaries 3, error handling 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":8645}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a4b98063e8b3920f5255bc5ba4b282f8f97ee44cdbef0f35ed661641aed901"}},{"ruleId":"D2","level":"warning","message":{"text":"settings_providers.configured_llm_providers (cognitive 29): settings_providers.configured_llm_providers has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 10, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/settings_providers.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30ae4502c336cf32be12453bbcaa7b3079ed04233087ba60cada36c02e3439e"}},{"ruleId":"D2","level":"warning","message":{"text":"material._download_videos_wavespeed_on_demand (cognitive 28): material._download_videos_wavespeed_on_demand has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 4 (7 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":2641}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f07459d4d6d9384e2dfef5ef11bbb2377557980a1b363fa154a0988012e6d6"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.build_video_params (cognitive 28): cli.build_video_params has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 3, loops 2, ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli.py"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b01fdb5b69f58f58ce2aae228a500ce39225e27d2bd70f89463e95872ea3a8"}},{"ruleId":"D2","level":"warning","message":{"text":"chatgpt_login._render_login_controls (cognitive 28): chatgpt_login._render_login_controls has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 4, 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":"webui/chatgpt_login.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"959cbce4ce78b95e4146b317c4eb2ac7938131fd9c1c769ba0bef6961e3a941f"}},{"ruleId":"D2","level":"warning","message":{"text":"chatgpt_oauth._stream_event (cognitive 27): chatgpt_oauth._stream_event has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, error handling 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/chatgpt_oauth.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1547499a554e08c317ffd7d52068422505aaa7817003689e84114c0c8ad198dd"}},{"ruleId":"D2","level":"warning","message":{"text":"llm.generate_terms (cognitive 27): llm.generate_terms has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), error handling 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/llm.py"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1f7c3a42b6afd6cc2b446ca24bcf37c59d1d3af0cfc15fafeda869d1b10a1c"}},{"ruleId":"D2","level":"warning","message":{"text":"material._request_openai_image (cognitive 27): material._request_openai_image has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, error handling 2 (4 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"944e1498d85fa8ffb509f761f6c2594eaa8381f5f41b194cb0913b4564843bbc"}},{"ruleId":"D2","level":"warning","message":{"text":"ofox.generate_videos (cognitive 27): ofox.generate_videos has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, error handling 3, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/ofox.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3392191a85f6fb014b58e44b332895a5c25cb5683db1fe32f6d876fc4564ac"}},{"ruleId":"D2","level":"warning","message":{"text":"sonilo._stream_audio (cognitive 27): sonilo._stream_audio has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/sonilo.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cc3b1b304876471760bfa27441f03df0db534a65fa2e8b936c6593137b40cc"}},{"ruleId":"D2","level":"warning","message":{"text":"task._run_cross_post (cognitive 27): task._run_cross_post has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 5, error handling 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/task.py"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8425cc750b9513bd28dd0305edfe0c80863176d0c41cef17ab29fa525601ca"}},{"ruleId":"D2","level":"warning","message":{"text":"voice._openai_compatible_tts (cognitive 27): voice._openai_compatible_tts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 4 (9 pts), boolean chains 3, 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":"app/services/voice.py"},"region":{"startLine":2714}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4d989640110ecd5935ad89825f182694f2735c913e6f88fa8c150c06f0d9b5"}},{"ruleId":"D2","level":"warning","message":{"text":"chatgpt_oauth._authorized_request (cognitive 26): chatgpt_oauth._authorized_request has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 3 (7 pts), ternaries 1 (2 pts), boolean chains 1, 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":"app/services/chatgpt_oauth.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe7ca6974c508be428b9f73e229e07268b518c7cd7fccc5992ef757bde9cf05"}},{"ruleId":"D2","level":"warning","message":{"text":"LoomLoomVideoBackend.resolve_video_capability (cognitive 26): LoomLoomVideoBackend.resolve_video_capability has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (18 pts), ternaries 4, boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/loomloom.py"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f765db5ea76c80b0bf82853abb1349b7b59f02f6e42ef2c02b2913198ad8407"}},{"ruleId":"D2","level":"warning","message":{"text":"material_cache._cached_source_info (cognitive 26): material_cache._cached_source_info has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 1 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material_cache.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4d128d451615fd3cab8bb0da56bd8ec350c4d1e1df67876d172c1bc5572d20"}},{"ruleId":"D2","level":"warning","message":{"text":"RedisState.list_task_ids (cognitive 26): RedisState.list_task_ids has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (7 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":"app/services/state.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f19398f7de87aa1dc408bf25da7f4cd33b6234aa6560988cb3c6519b2086cb6"}},{"ruleId":"D2","level":"warning","message":{"text":"material.generate_videos_wavespeed (cognitive 25): material.generate_videos_wavespeed has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, ternaries 4 (5 pts), error handling 3, 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":"app/services/material.py"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba171bba8ac0cde592fc60a13046742844d96880383d61533b92f50af292ee8"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._load_batch_manifest (cognitive 25): cli._load_batch_manifest has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), error handling 3 (6 pts), loops 2 (3 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli.py"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eff60bbfddc3ba69cb243a880a55276c2a2f92c7be94cfb10ca416d02d2a427"}},{"ruleId":"D2","level":"warning","message":{"text":"mpt_agent.report_missing_config (cognitive 25): mpt_agent.report_missing_config has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20, loops 2 (3 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill/mpt_agent.py"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cde5f231f00a3acec3e7588de35cf78941e173dd1e35bfd8eee229dbadb4d26"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_oauth.request_image (cognitive 24): codex_oauth.request_image has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/codex_oauth.py"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d29d714623c9b8d9e6d13130d87579f63188cf9d3c80c673e816ccdddfff338"}},{"ruleId":"D2","level":"warning","message":{"text":"voice.get_elevenlabs_voices (cognitive 24): voice.get_elevenlabs_voices has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ba29a814969581ea132e518a852ac7bb4640686c9c521e04f4aaddbd27ce8a"}},{"ruleId":"D2","level":"warning","message":{"text":"voice.get_kokoro_voices (cognitive 24): voice.get_kokoro_voices has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 2 (5 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"6517cdb9e6ac18aebd792a7ce20d66df7a2d387e6e680cec9ee72e1a254a03e7"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._validate_cli_files (cognitive 24): cli._validate_cli_files has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 7, error handling 1 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli.py"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"631adf07f881ba8eb55dd327bd42ef75b6d1c2f317015a2fc3a1f6744a088234"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._prepare_cli_materials (cognitive 24): cli._prepare_cli_materials has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 2 (9 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli.py"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"798803b6da36dae1bee02e4861440fee1c8593e823fa4ae7be7f47d11b98f6f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Policy.apply (cognitive 24): Policy.apply has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/local-image-server/policy.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92be837e52cd99463202b452d59c216c0828484e6f90c516424ead8c58b03e6"}},{"ruleId":"D2","level":"warning","message":{"text":"RedisTaskManager._deserialize_task (cognitive 23): RedisTaskManager._deserialize_task has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (4 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":"app/controllers/manager/redis_manager.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e72e8294fc193086943ebed3e722aac307ce4d821a3edd316145ff56a42ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_image._event (cognitive 23): codex_image._event has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/codex_image.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77e38626b9b731c1933a2d73ce9dc6ff89a6ea3fe4542c96f1bade9087d430b"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoProject.create_revision (cognitive 23): VideoProject.create_revision has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, ternaries 3 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/video_project.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec780d65c48d9800dee3a0948d556b1b000c13b2cb94bbd28aee906b1b97593c"}},{"ruleId":"D2","level":"warning","message":{"text":"voice.azure_tts_v2 (cognitive 23): voice.azure_tts_v2 has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 3 (8 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":"app/services/voice.py"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b177a740d79a18706c66e8ada809d279f0793f1a12740121d085644a65987e"}},{"ruleId":"D2","level":"warning","message":{"text":"LoomLoomScriptBackend.wait_for_run (cognitive 22): LoomLoomScriptBackend.wait_for_run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/loomloom.py"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a6d2de2f7417efc908697d8bc79033ec8f33e99d66a84ae20dc3fe364052ac"}},{"ruleId":"D2","level":"warning","message":{"text":"muapi.generate_videos (cognitive 22): muapi.generate_videos has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (11 pts), error handling 4, boolean chains 3, ternaries 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/muapi.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9c474394221b0cf2e55961dbb6d73b9ab247597f02e328a43dd7aefe633680"}},{"ruleId":"D2","level":"warning","message":{"text":"video.close_clip (cognitive 22): video.close_clip has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, loops 1 (2 pts), error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/video.py"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a73551be27863353724e766bbf8f2ac1264c53541684829a65edad41076b4d9"}},{"ruleId":"D2","level":"warning","message":{"text":"video.generate_video (cognitive 22): video.generate_video has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, ternaries 2 (3 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/video.py"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0eadc21c1e6c856bdffc77468c3ac2e49a8fc69e0ef218e6eaca2cfd169da09"}},{"ruleId":"D2","level":"warning","message":{"text":"llm.generate_script (cognitive 21): llm.generate_script has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/llm.py"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca26311bcecb9fd0690216021d0ea357278fb0c27c386b424216231775a8f2b"}},{"ruleId":"D2","level":"warning","message":{"text":"material.search_videos_coverr (cognitive 21): material.search_videos_coverr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, error handling 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"edded8978f32d09027b053229a0472ce2b9a3ca2b1f0ef8728f36ff1df6508cf"}},{"ruleId":"D2","level":"warning","message":{"text":"material_cache.cleanup_expired_material_search_cache (cognitive 21): material_cache.cleanup_expired_material_search_cache has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material_cache.py"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58153e5d6e10a3a7919ef3318a7503c031a0a343b5e55fa23e73ccd23235752"}},{"ruleId":"D2","level":"warning","message":{"text":"subtitle._end_of_script_line_in_cue (cognitive 21): subtitle._end_of_script_line_in_cue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 8 (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":"app/services/subtitle.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c594ca5a2bb7f5b451d0c90c4f7557352028ededa5357614eeb7cca78e0d4f4"}},{"ruleId":"D2","level":"warning","message":{"text":"task._mark_task_failed (cognitive 21): task._mark_task_failed has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, error handling 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/task.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bca8b2ef342b6321fddcb2f512f36b891d45da4635339f374625e975805ad45"}},{"ruleId":"D2","level":"warning","message":{"text":"video.preprocess_video (cognitive 21): video.preprocess_video has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 4 (9 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/video.py"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddec7c3526c1f618420d4905bd318e301e984d3949380e828a920166d78ce52c"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoProject.render (cognitive 21): VideoProject.render has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/video_project.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd4bf3277afc26cd85ce49e2773bf54c74db9cd43d6f1e94a0a968f7dc015c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._render_task_table (cognitive 21): Main._render_task_table has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (4 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca55dd0ae50ffa6509a9eb041f346775d9921d9c11c7941e956772ec10952c5"}},{"ruleId":"D2","level":"warning","message":{"text":"kimi_login.render_kimi_login (cognitive 21): kimi_login.render_kimi_login has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/kimi_login.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3955eb3c0ffa883a4a4dc8bd71057d23e6bce09ef11a8b0332086a3412a11acb"}},{"ruleId":"D2","level":"warning","message":{"text":"config.load_config (cognitive 20): config.load_config has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/config/config.py"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74a59a86769639c42109988b88237694fc03426522e9b059776d700de6f190a"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_models.parse_catalog (cognitive 20): codex_models.parse_catalog has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/codex_models.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"92075ffb745b215094b6442e246540be887659be1602880f0308d4d5b8cce80e"}},{"ruleId":"D2","level":"warning","message":{"text":"generation_progress.remote (cognitive 20): generation_progress.remote has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 9 (13 pts), boolean chains 5, if/else 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/generation_progress.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c55330f808f4d2a69d0f48c8474afadb1d05189d3a0e267b7ba28cf3690d19"}},{"ruleId":"D2","level":"warning","message":{"text":"voice.mimo_tts (cognitive 20): voice.mimo_tts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, error handling 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d40d91537ce0ca22c2bd7ea7420b0098ea0fef07a27756635b75bd57abca59b"}},{"ruleId":"D2","level":"warning","message":{"text":"voice.get_minimax_voice_catalog (cognitive 20): voice.get_minimax_voice_catalog has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (7 pts), loops 2 (3 pts), ternaries 2, error handling 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bea068cfa8d4fad2f4afbbee6ecedd9db37a531f896308fb909f668376f9b2"}},{"ruleId":"D2","level":"warning","message":{"text":"kimi_login._poll_login (cognitive 20): kimi_login._poll_login has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 3 (7 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":"webui/kimi_login.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b07041045ef4be1b04a23cda85e061857d907f29edc9c0fb9349f98c6424735"}},{"ruleId":"D2","level":"warning","message":{"text":"video._parse_byte_range (cognitive 19): video._parse_byte_range has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, ternaries 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/controllers/v1/video.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e183e394905cc2fe6d1eba6f895e58579a7a365c842b1bf5b4026cdee82269af"}},{"ruleId":"D2","level":"warning","message":{"text":"material._material_source_record (cognitive 19): material._material_source_record has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 2 (5 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b2d857a4763b76a728fe2d93a1eab0f7b71d5ac9b170d9c124ba6db27f1629"}},{"ruleId":"D2","level":"warning","message":{"text":"material_cache.load_material_search_cache (cognitive 19): material_cache.load_material_search_cache has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (7 pts), error handling 5 (6 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material_cache.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf141547b5ae7dcbbeea8782713b0da14dc59be63934c6d2e01433de2d447d5"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._parse_key_backup (cognitive 19): Main._parse_key_backup has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":3096}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2e4e4aa4e044c39a5e39ca5dc90e72ff053110c784a64bbffd872959b85a92"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_image._read_stream (cognitive 18): codex_image._read_stream has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/codex_image.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea1907418d13b50b55a9e76a58101760affe15fe63a911123a018a009ddd3b7"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_oauth.generate_text (cognitive 18): codex_oauth.generate_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 1 (2 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":"app/services/codex_oauth.py"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c077ee688e5797ac89656abbf45b676350b15d1d5c24541f962b7df2fa50e0e"}},{"ruleId":"D2","level":"warning","message":{"text":"infistar_video._wait (cognitive 18): infistar_video._wait has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/infistar_video.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"75aae69cc8792a6917b775f37280d5c56a5066d89af98c0b4c9c79ca029542c0"}},{"ruleId":"D2","level":"warning","message":{"text":"infistar_video._download (cognitive 18): infistar_video._download has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/infistar_video.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"954df21834fdbd872e410ddf748d6ddf57200d74673ca8d92bf2d38141ef6bc6"}},{"ruleId":"D2","level":"warning","message":{"text":"llm._normalize_hashtags (cognitive 18): llm._normalize_hashtags has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/llm.py"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbffae7f6b5d1c2419a1965d854936693f58e917a61a3fc0029e039d2e103d1"}},{"ruleId":"D2","level":"warning","message":{"text":"metaso_minimax.generate_videos (cognitive 18): metaso_minimax.generate_videos has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 3, error handling 3, ternaries 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/metaso_minimax.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1512ece42645dad8849cdbef7d0146e4ec1e94f17e47c7cb08e0b614eb07d40"}},{"ruleId":"D2","level":"warning","message":{"text":"voice.gemini_tts (cognitive 18): voice.gemini_tts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), error handling 4 (5 pts), boolean chains 3, loops 1, ternaries 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":"app/services/voice.py"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebff8313ab3034f360e5a2c7fc9da6ef8c4b0bc2688e65d623426759d91d53b"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._scan_history_tasks (cognitive 18): Main._scan_history_tasks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 2 (4 pts), error handling 2 (3 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"4797d58d2309c743c527ffc175f5222930b4bca20a643c585622b7ed52451be2"}},{"ruleId":"D2","level":"warning","message":{"text":"chatgpt_auth.credentials (cognitive 17): chatgpt_auth.credentials has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, error handling 2, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/chatgpt_auth.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"659f584eed827d6ad7e3e31bdc9ca91da08545680ecdb9d88ee6c0d2eb80f864"}},{"ruleId":"D2","level":"warning","message":{"text":"material_upload._stage_material_upload (cognitive 17): material_upload._stage_material_upload has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 4, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material_upload.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"532b53498acbaee5e946e6eeda70edf087ac6328ab7819aeadbb613eed2cc8b3"}},{"ruleId":"D2","level":"warning","message":{"text":"task.generate_audio (cognitive 17): task.generate_audio has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/task.py"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ca89b94c7d8a16ad42cdf6f3f480224d6627d8fc99ffc89b2d21fdb0d1c5a0"}},{"ruleId":"D2","level":"warning","message":{"text":"UploadPostService._wait_for_upload_completion (cognitive 17): UploadPostService._wait_for_upload_completion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 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":"app/services/upload_post.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb46942348d5137b4ac9e6f403fad8db402843ce30e3d35edf6747767dc928ea"}},{"ruleId":"D2","level":"warning","message":{"text":"video._prioritize_unique_source_clips (cognitive 17): video._prioritize_unique_source_clips has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/video.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2818593c7927aa64f4e37a52c7b48b61e60fab9ccff0abfbc0b5b07231662252"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoProject.plan (cognitive 17): VideoProject.plan has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 3 (5 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/video_project.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea29574faac6091231627d56ffffacb0cd4d59d26c29125c82129d010e53eb7"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._run_batch_tasks (cognitive 17): cli._run_batch_tasks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 3, ternaries 2 (3 pts), error handling 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli.py"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66b81bc6852dc25bde65ded3bd354184065488b26057b0e207966de320229cc"}},{"ruleId":"D2","level":"warning","message":{"text":"bgm._stage_bgm_upload (cognitive 16): bgm._stage_bgm_upload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/bgm.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"db00dd17ea5549bb6fd1d4bc6c337c1aa918a97c375dff10f1857c29b0be61c1"}},{"ruleId":"D2","level":"warning","message":{"text":"chatgpt_oauth._read_stream (cognitive 16): chatgpt_oauth._read_stream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 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":"app/services/chatgpt_oauth.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e936a664f28b55bbc3e5319e83d15fbfe24b719db46bdad3169b690c4b01e0"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_oauth._read_stream (cognitive 16): codex_oauth._read_stream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 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":"app/services/codex_oauth.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"e578f60abcaf1a2e3f5fff6c7a1320875b2719e82ecb9c872b293044d743c047"}},{"ruleId":"D2","level":"warning","message":{"text":"LoomLoomScriptBackend._parse_candidate (cognitive 16): LoomLoomScriptBackend._parse_candidate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/loomloom.py"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"3864a78bf1bb739f51295c9538b60bf4d09d13f92cb11d9f2163ec019bae3bc2"}},{"ruleId":"D2","level":"warning","message":{"text":"LoomLoomScriptBackend._request (cognitive 16): LoomLoomScriptBackend._request has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 3 (4 pts), boolean chains 2, ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/loomloom.py"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed3ee8a8a0098e4ef17394f9a2d09a65a5748aaa8ab299154a68696f20d1e46"}},{"ruleId":"D2","level":"warning","message":{"text":"LoomLoomVideoBackend._download_video_artifact (cognitive 16): LoomLoomVideoBackend._download_video_artifact has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), error handling 3 (4 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/loomloom.py"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bf3f83f6969dd28710210f318de6721249d9c4869ee34847a340039e2773c8"}},{"ruleId":"D2","level":"warning","message":{"text":"material._download_materials_in_parallel (cognitive 16): material._download_materials_in_parallel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 2 (5 pts), loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":2295}}}],"partialFingerprints":{"codehealthFindingId/v1":"08766594ad722a55a019ceb20046e52d284ad4afba42dedc5094c99c3ad72060"}},{"ruleId":"D2","level":"warning","message":{"text":"sonilo._iter_bounded_events (cognitive 16): sonilo._iter_bounded_events has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), 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":"app/services/sonilo.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f24e4688f06b959b1dc0fdb12c49a0f66659aad0dc260513a5953de7fad59a4"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoProject._cached (cognitive 16): VideoProject._cached has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 2, loops 1 (2 pts), ternaries 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/video_project.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"028c434cbb51cd20f64b291619cb521f4624e76f8eab84eae3396b9edfc112ff"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoProject._build (cognitive 16): VideoProject._build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 2, loops 1 (2 pts), ternaries 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/video_project.py"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f2a917ffab75ee9b7f5ee7e87ef5cf1a77ad6ac2313a85831cbfae50216116"}},{"ruleId":"D2","level":"warning","message":{"text":"voice.prepare_voxcpm_reference_audio (cognitive 16): voice.prepare_voxcpm_reference_audio has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, boolean chains 6, error handling 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":"app/services/voice.py"},"region":{"startLine":3163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1eccaaf29e0638bf68a13bdd70302b3fb1da8465e9f09ab96e5f964774b19b"}},{"ruleId":"D2","level":"warning","message":{"text":"utils._replace_emoji (cognitive 16): utils._replace_emoji has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (6 pts), boolean chains 5, if/else 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/utils/utils.py"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacc23151c1bb43dc8c03705081f5aac0fe3be053cf8372a6a75e839d42f9b6f"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._saved_ui_choice (cognitive 16): Main._saved_ui_choice has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6c38c7156b06d164251b994805df1f9db681533415852a80911b5cdee7d4c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Main._render_top_bar (cognitive 16): Main._render_top_bar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa0934075ba7e675e592dd60f596d8598ee1637542b2cb78f1ff0d2fb58783f"}},{"ruleId":"D2","level":"warning","message":{"text":"Main.format_llm_connection_error (cognitive 16): Main.format_llm_connection_error has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: webui/Main.py holds 20 of the 136 methods over the threshold \u2014 including the worst \u2014 and 733 of the 2430 points over it (30%), 2.2\u00D7 the next-largest file (app/services/voice.py at 333). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":2355}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ae00712201b466ba62d9a2b08418cf67faa136cab7534a610609bb25e62800"}},{"ruleId":"D2","level":"warning","message":{"text":"chatgpt_login._render_account_actions (cognitive 16): chatgpt_login._render_account_actions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, ternaries 1 (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":"webui/chatgpt_login.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f701d621e99628f813f09516d457e0ac7a3407a4ee9c6575cab510cff6c139d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: webui/Main.py: FileTooLong \u2014 7047 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 6547 over it, 14.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d1c9ef8967d18171e2474b6e01f2b6dda29db8fa8b89c7db9c3825052a98d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/voice.py: FileTooLong \u2014 2714 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2214 over it, 5.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7856ea3fb0fce7f5a7207a275d2477ed163d5aa227a91ca3b8b950f1c51f1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/material.py: FileTooLong \u2014 2415 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1915 over it, 4.83\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":"app/services/material.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b14b86a3e5aa2b28ddc34acd4011b693b818b93b95bcbec24f59639c8e704ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/video.py: FileTooLong \u2014 1478 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 978 over it, 2.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/video.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a25fd338713befdf52a9a722e43967e251c59e831b2ac2c814d94a0f5e964b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/task.py: FileTooLong \u2014 1458 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 958 over it, 2.92\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":"app/services/task.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1061385e722bc5e8881df4ca9ad4a979a0696a099ea09643e59b4aefc953c979"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/video_project.py: FileTooLong \u2014 785 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 285 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/video_project.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3b8d8eae6e935a3bc28ebfecd1f18dde9c37f81dd76a97b793ee08a5a79161"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/loomloom.py: FileTooLong \u2014 775 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 275 over it, 1.55\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":"app/services/loomloom.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d34ffd414b9f1bbc6e8ce25c83e52d59e0e97950d890bf3acfad0d56e6bccb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: skill/mpt_agent.py: FileTooLong \u2014 714 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 214 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/skill/mpt_agent.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab92237150853f2d9404fdd0714b82d68c488319131c5ba1e138f03c6d47bd55"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/llm.py: FileTooLong \u2014 713 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 213 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/llm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9f7443d8ca76804505920bc482fc95ef18c1c821846e813b7d15ce0bc0ee0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/chatgpt_auth.py: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 109 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/chatgpt_auth.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"319e0da859c7c9315a8b05d4215ef3c203b63cc32d2e763a3f8800f3e05b85de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/codex_oauth.py: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 83 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/codex_oauth.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e8faa186322e93190ff3fbcc0e20ee56dc4aa5351a7c18afa7632449818278"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/llm_provider.py: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/models/llm_provider.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc00b6723f3c2775a5816efab5ba89959319f69c563548a96d81eb0436c25c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): app/services/metaso_minimax.py:138-149 | app/services/muapi.py:151-161 | app/services/ofox.py:169-179 | app/services/volcengine_seedance.py:173-183 \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":"app/services/metaso_minimax.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bda790787bcc0609525cd2241bca481c48c3bee817e1d6a2ccdcbe2b3e9b2a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): app/services/metaso_minimax.py:153-173 | app/services/muapi.py:165-179 | app/services/ofox.py:183-197 | app/services/volcengine_seedance.py:187-201 \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":"app/services/metaso_minimax.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc73f252dc6ff36fcb0b18c1f6c56331ada232dbf1dcc57aa6e40fedcb5c9f54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 134\u002B corresponding lines): app/services/metaso_minimax.py:214-347 | app/services/muapi.py:201-336 | app/services/ofox.py:219-365 | app/services/volcengine_seedance.py:239-390 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 134 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/metaso_minimax.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"231ccfb3c4a0fdf7f2ee98f62e8f41f69592bac83bf4a0562abc5000e78faf56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): webui/Main.py:6915-6973 | webui/Main.py:6977-7024 \u2014 These two members are one piece of code written twice and then edited apart: 48 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":"webui/Main.py"},"region":{"startLine":6915}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62fc812f89405f0d13d49bb4d9a9e2343f91bfcba69f92d889b9ebb62d00d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): app/services/bgm.py:218-276 | app/services/material_upload.py:235-293 \u2014 These two members are one piece of code written twice and then edited apart: 59 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":"app/services/bgm.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"075e80e3c2d3f74044b093b7e3cdd5e7dc95b2c1c0fe39f78148cdd26c60a961"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): app/services/chatgpt_auth.py:91-123 | app/services/codex_oauth.py:198-230 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/chatgpt_auth.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4923f4a2b6701e3c003a0347648681614e76d0e2201c042a3e3de22ed46483bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): app/services/elevenlabs_music.py:211-287 | app/services/sonilo.py:174-241 \u2014 These two members are one piece of code written twice and then edited apart: 68 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":"app/services/elevenlabs_music.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9633fef18e0542c207eca966667631c4eec34ecd6dca214a46ae8566817ee0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): app/services/material.py:135-172 | app/services/material_cache.py:61-106 \u2014 These two members are one piece of code written twice and then edited apart: 38 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":"app/services/material.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8b23f1f402f7e13b42ffeaac3ddcb72ea19337591747e88c1ec538cf3ecfdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): app/services/utils/video_effects.py:18-44 | app/services/utils/video_effects.py:49-78 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/utils/video_effects.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"670d2b93e6b56cd1fb7aa2d9dd0b8d91b5e4efc83ddfe5078106e8ecd62d270c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): app/services/chatgpt_oauth.py:228-249 | app/services/codex_oauth.py:607-628 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/chatgpt_oauth.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"291d8a856ebea4cfe5e67313bf96503c8034fe005a0fb113d6d5cbe14a799b08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): app/controllers/v1/video.py:416-443 | app/controllers/v1/video.py:485-515 \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":"app/controllers/v1/video.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ddf4f136e10b92ea47955531c3b55c09e7c8ca6c79eea8c3cb6e946604e171"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): webui/Main.py:7411-7440 | webui/Main.py:7550-7585 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":7411}}}],"partialFingerprints":{"codehealthFindingId/v1":"4876810adea2ad85c766b0d66edb9dc1240d0f3eb34e505872bf85702585a1f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): app/services/bgm.py:116-142 | app/services/material_upload.py:115-136 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/bgm.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0ea23a0f612913a9c34ffdaf78f84a405bab7a180dc427857fd2114f3f49b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): webui/Main.py:471-509 | webui/Main.py:515-553 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c278a99da3050abaf347952d71bd29f25fc106674135262af171975b10db94c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): app/services/chatgpt_oauth.py:153-166 | app/services/codex_oauth.py:590-603 \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":"app/services/chatgpt_oauth.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"655686164299ce23648415eca2f78fa2fce211283d1804e8612698b6f79946d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): app/services/voice.py:2834-2865 | app/services/voice.py:2876-2914 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":2834}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba37908f99ab244e6187984a051dca343545fb3d594050161e3b40fe23bfda7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): app/services/chatgpt_auth.py:189-199 | app/services/codex_oauth.py:258-271 \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":"app/services/chatgpt_auth.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70085d5c8a27cf28296278113d666e6361ba3b40919b31a27c9b12bdee46e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): app/services/voice.py:271-290 | app/services/voice.py:351-379 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"742089278bf1a2eb32e54f2d6f078b10029d44091e923c3b99a1e5232294e60b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): app/services/codex_models.py:143-158 | app/services/video_project.py:62-71 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/codex_models.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d989e2392d819def759bdfd7ee88b21cefbe0f09203c8397e8dcb32c5cd3910"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): app/services/utils/video_effects.py:123-134 | app/services/utils/video_effects.py:138-148 \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":"app/services/utils/video_effects.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba5280a3da89369ce3fc1dcfb980bf0bc432404dd296e19c2ed854531b535ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): app/controllers/v1/llm.py:28-41 | app/controllers/v1/llm.py:50-62 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/controllers/v1/llm.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64f65391115eaebfdd123d0590b906e78f0bbed072774e66384d8833b64ed9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): app/services/elevenlabs_music.py:74-82 | app/services/sonilo.py:58-68 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/elevenlabs_music.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2daef4dd02c4eb7199fbc75426c24e304189f6fc1550209bf73af3c7d58879b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): webui/Main.py:799-805 | webui/Main.py:1965-1970 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfe35ea4cace3df6503e6b1cebbfac496ce1ce858c6f7ca78b0a58745de9d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): app/services/infistar_video.py:64-81 | app/services/metaso_minimax.py:82-95 \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":"app/services/infistar_video.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5789da6d991f526aa95bfcfc9ec2fdb8914fc805db10950a727696169ee7214b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): app/services/metaso_minimax.py:113-116 | app/services/muapi.py:108-111 | app/services/ofox.py:126-129 | app/services/volcengine_seedance.py:126-129 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/metaso_minimax.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28100f6b67d8e14c7deb78b9748686d2c1f234eccf7389f6e87258f826b006e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): app/services/jalapeno_video.py:26-31 | app/services/infistar_video.py:43-47 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/jalapeno_video.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"232530771629dd155a06601eb531d946672039e69683943d20ec9a35de3dadd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): app/services/bgm.py:101-112 | app/services/elevenlabs_music.py:198-207 | app/services/material_upload.py:88-96 | app/services/sonilo.py:162-170 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/bgm.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"967e30209a1889c348d0f4bf43d08b7acc23a4611c092565f6c5f0086e9dbe9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): app/services/codex_oauth.py:345-351 | app/services/infistar_video.py:118-126 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/codex_oauth.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a1ccb08f72a6c361c56fcb652aafe8b54d674eea17700f4192875048e74a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201331 lines \u00D7 2): app/services/material.py:474-504 | app/services/material.py:748-772 \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":"app/services/material.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e71e52d0078a6cbf79037d348f2842a4ab0a28ba6fe04453c4f926dc1029f22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): app/services/elevenlabs_music.py:86-109 | app/services/sonilo.py:83-106 \u2014 before extracting anything, compare \u0060app/services/elevenlabs_music.py\u0060 and \u0060app/services/sonilo.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/elevenlabs_music.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ef4f6a7c0b282970daa372c5babbe861a6b1016bb5f3c2943f3135e4c6a90a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): app/services/ofox.py:393-416 | app/services/volcengine_seedance.py:424-447 \u2014 before extracting anything, compare \u0060app/services/ofox.py\u0060 and \u0060app/services/volcengine_seedance.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/services/ofox.py:393\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":"app/services/ofox.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"941855a7648e55750ba272da267517f55a76d441a4eea302c2bda327b4ba3e82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): app/services/voice.py:1787-1810 | app/services/voice.py:3075-3095 \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":"app/services/voice.py"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c27d21be82a6b43f90bcba485769e6f93e3a5f21f01b864ae6e3ff41b976455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201322 lines \u00D7 2): app/services/material.py:88-109 | app/services/material_cache.py:43-57 \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":"app/services/material.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"33db3c2dd08947d2a948c24ae3943dae05edf0ad976cfd3f31e90c1fca306943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): app/services/chatgpt_auth.py:91-118 | app/services/codex_oauth.py:198-225 \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":"app/services/chatgpt_auth.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ea333e8b11f1d9dbe9683e3018617b178ca0c0861ec5f90e904b062c5cfbf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): app/services/metaso_minimax.py:378-396 | app/services/muapi.py:366-382 \u2014 before extracting anything, compare \u0060app/services/metaso_minimax.py\u0060 and \u0060app/services/muapi.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/services/metaso_minimax.py:378\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":"app/services/metaso_minimax.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"981d2f2c08062fb1d0a258432993dfd43bbc79e4305c7a1fbfa4568ee282db7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201318 lines \u00D7 4): app/services/material.py:2699-2711 | app/services/material.py:2945-2962 | app/services/material.py:3053-3068 | app/services/material.py:3179-3193 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/services/material.py:2699\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":"app/services/material.py"},"region":{"startLine":2699}}}],"partialFingerprints":{"codehealthFindingId/v1":"055d27de7508e3d3887eaa6d383a584e8a9c9dc039f266729cda800b8cc2d30d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): app/services/llm.py:528-544 | app/services/llm.py:791-808 \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 \u0060app/services/llm.py:528\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":"app/services/llm.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20e1e6ac7476350f0344df0298754b7b77b5281b813e71144f421eda9e6322c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): app/services/metaso_minimax.py:255-271 | app/services/muapi.py:240-256 | app/services/ofox.py:264-280 \u2014 before extracting anything, compare \u0060app/services/metaso_minimax.py\u0060 and \u0060app/services/muapi.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/services/metaso_minimax.py:255\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":"app/services/metaso_minimax.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"88243ef78507aa636981c3051d50adaad62e5daf481221fda649a0920f49d255"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 3): app/services/muapi.py:125-136 | app/services/ofox.py:143-154 | app/services/volcengine_seedance.py:143-158 \u2014 before extracting anything, compare \u0060app/services/muapi.py\u0060 and \u0060app/services/ofox.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 99 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":"app/services/muapi.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8d9a346bd544036ab214eb27c0c138b7dbdf2ca23e22638c7feb8ae73726c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): app/services/muapi.py:429-444 | app/services/ofox.py:451-466 | app/services/volcengine_seedance.py:480-495 \u2014 before extracting anything, compare \u0060app/services/muapi.py\u0060 and \u0060app/services/ofox.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 99 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/services/muapi.py:429\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/muapi.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"6549333e3be85fbe51e52f740675dfc17920e7ed4ea44948a1a9859ccc9655ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): app/services/voice.py:3057-3072 | app/services/voice.py:3420-3435 \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":"app/services/voice.py"},"region":{"startLine":3057}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89bbf4e5994162f2b8f36441c13016acaae0940d3f6b40ceb9e2677ac51ff15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): app/services/material.py:2318-2332 | app/services/material.py:2352-2365 \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 \u0060app/services/material.py:2318\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":"app/services/material.py"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47106f6985d9aac5894c7873e4528b5896cf93460e03aeb0976763e98b70729"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): app/services/material.py:2625-2638 | app/services/material.py:3356-3370 \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":"app/services/material.py"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6ae326333a64623559a3263c0800ea733320d6e4dc14cf56799604f8b82dec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): app/services/voice.py:2773-2786 | app/services/voice.py:3048-3062 \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":"app/services/voice.py"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"4056b0ab63da17e299440e3aab5e49a619d856ae802351f7ccf8f54e272ce517"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 4): app/services/material.py:2045-2058 | app/services/material.py:2727-2740 | app/services/material.py:2869-2882 | app/services/material.py:2976-2987 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/services/material.py:2045\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"9540b2170c61d3adc8aaa3c3550f957949523ab188bf2f9937bbc355e7e7e839"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): webui/Main.py:7423-7434 | webui/Main.py:7562-7575 | webui/Main.py:7592-7603 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060webui/Main.py:7560\u0060 calls \u0060getenv\u0060, \u0060strip\u0060 and \u0060webui/Main.py:7591\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":"webui/Main.py"},"region":{"startLine":7423}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a06bac7916785f3300dc717bc278c87147056e3cf61089b48698da8c38227cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): webui/Main.py:8688-8701 | webui/Main.py:8715-8728 | webui/Main.py:8745-8758 \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 \u0060webui/Main.py:8688\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060webui/Main.py:8729\u0060 calls \u0060tr\u0060 and \u0060webui/Main.py:8702\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":"webui/Main.py"},"region":{"startLine":8688}}}],"partialFingerprints":{"codehealthFindingId/v1":"86aefa04e5e4399fa75d728b2f99510e4ec6a4740b7aef37f096b340a735abe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): app/services/material.py:3070-3083 | app/services/material.py:3195-3208 \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 \u0060app/services/material.py:3070\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":"app/services/material.py"},"region":{"startLine":3070}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b50c8e6d8245bc247a01876d76d2afec3c99404a49e7369fc5b9edf9be3c94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 3): app/services/voice.py:1784-1796 | app/services/voice.py:2687-2697 | app/services/voice.py:3072-3082 \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 \u0060app/services/voice.py:1784\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":"app/services/voice.py"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"0878c6fc1ad4ff057851d50fc074d271a1bdca4a85f39406e8aa0988cba4fe3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2): app/services/elevenlabs_music.py:211-262 | app/services/sonilo.py:174-225 \u2014 before extracting anything, compare \u0060app/services/elevenlabs_music.py\u0060 and \u0060app/services/sonilo.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 85 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":"app/services/elevenlabs_music.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efb41ba3bea316945ea598fe276c030515d94b09f51c90620b27bff3f436ec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/services/material.py:160-172 | app/services/material_cache.py:94-106 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060app/services/material.py:159\u0060 calls \u0060_creator_info\u0060, \u0060get\u0060 and \u0060app/services/material_cache.py:93\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":"app/services/material.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8c36adceb2c6e5b25af497d369321122022aa48baa35f2b75c8ae3d312de0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/services/material.py:437-449 | app/services/material.py:589-601 \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":"app/services/material.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d884508d3b46f0e1e0c953cf845058031f527ed9d64b5cd3e678141500bb64e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): app/services/task.py:2009-2021 | app/services/webui_task.py:148-160 \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 \u0060app/services/task.py:2009\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":"app/services/task.py"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"1557876340c6e08a332abc0c2bfb56ce314556fce0cdeb1b8ab8aa27b5a01b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): app/services/material.py:2050-2062 | app/services/material.py:2732-2743 | app/services/material.py:2979-2991 | app/services/material.py:3099-3111 | app/services/material.py:3213-3225 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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":"app/services/material.py"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad99a3dee2789da6f9b19ada12b00cc5c7578fe19d3c46c37de8a801f01156f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): app/services/metaso_minimax.py:390-401 | app/services/ofox.py:406-417 | app/services/volcengine_seedance.py:437-448 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/services/metaso_minimax.py:390\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":"app/services/metaso_minimax.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fb6224982b62f0cd3222dd71033e15f1bb9c5d4bd6f3b494a0a77cb0da5b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): app/services/material.py:2046-2058 | app/services/material.py:2728-2740 | app/services/material.py:2870-2882 | app/services/material.py:2977-2987 | app/services/material.py:3208-3221 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/services/material.py:2046\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":2046}}}],"partialFingerprints":{"codehealthFindingId/v1":"be91e1be247da3a515637f5dc557add1e67a7b11fc8e225deadf6f6c25040378"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): app/services/metaso_minimax.py:139-149 | app/services/muapi.py:151-161 | app/services/ofox.py:169-179 | app/services/volcengine_seedance.py:173-183 \u2014 before extracting anything, compare \u0060app/services/metaso_minimax.py\u0060 and \u0060app/services/muapi.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/metaso_minimax.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8dea75893afa1fba937fa68a0e16fe35c133da6b9c40c7d412583714659cf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): app/services/bgm.py:241-251 | app/services/material_upload.py:257-267 \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":"app/services/bgm.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"21275bfeb0436751214fce9fd44d991848309505ae25a421bd2b59829048c2b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): app/services/material.py:2177-2187 | app/services/material.py:2208-2217 \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 \u0060app/services/material.py:2177\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/material.py"},"region":{"startLine":2177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8467b43a80aa66fba69c656c50e680d0053a9956cb9127de844bea10070622a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): app/services/material.py:2610-2622 | app/services/material.py:2718-2728 \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":"app/services/material.py"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f2c703674828715b0441bf56cd710698d997043cbacec48838be552491ffa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): app/services/material.py:2608-2620 | app/services/material.py:3339-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060app/services/material.py:2608\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":"app/services/material.py"},"region":{"startLine":2608}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d958aedf36073516845c8672b91b428b928d1247455ccabd24551cd6116040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): app/services/utils/video_effects.py:34-44 | app/services/utils/video_effects.py:70-78 \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":"app/services/utils/video_effects.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a0a7fd6f3981ec044121aa16f1fedc5c91d8cd43b91730bad7da6f0b6e72bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 4): app/services/metaso_minimax.py:154-163 | app/services/muapi.py:165-173 | app/services/ofox.py:183-190 | app/services/volcengine_seedance.py:187-194 \u2014 before extracting anything, compare \u0060app/services/metaso_minimax.py\u0060 and \u0060app/services/muapi.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 79 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. 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":"app/services/metaso_minimax.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4ba1d5137e03e34d78fdd7d33ad583561cf6b8181d040a62ed3eeca78a7dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): app/services/material.py:2609-2620 | app/services/material.py:2717-2726 | app/services/material.py:3340-3349 \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 \u0060app/services/material.py:2609\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":"app/services/material.py"},"region":{"startLine":2609}}}],"partialFingerprints":{"codehealthFindingId/v1":"03474e25220bf286f0b93f056815e447523e638d11781c7a304fde7236f22879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/services/bgm.py:116-125 | app/services/material_upload.py:115-124 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/bgm.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9719864c1900defbe8035b5fa4ab115b13a66c950235b341f7183fd9b823948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): app/services/chatgpt_oauth.py:155-164 | app/services/codex_oauth.py:592-601 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/chatgpt_oauth.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73e5ed1181c799cc3d94096c163b09b71e2257c7ac363ae53eb90904079bd23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): app/services/codex_image.py:75-80 | app/services/codex_image.py:153-162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/codex_image.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1683429efe98c2eb5309873f03c0e63710de6d4bf1270f7952d9aaefb4cdac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/services/loomloom.py:604-612 | app/services/loomloom.py:929-937 \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 \u0060app/services/loomloom.py:604\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 after the matched lines, \u0060app/services/loomloom.py:938\u0060 calls \u0060str\u0060, \u0060get\u0060, \u0060strip\u0060 and \u0060app/services/loomloom.py:613\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":"app/services/loomloom.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9eeb0ba8a2f025792ebaeaa96fde222d611a41bc421095b493888221965333c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): app/services/voice.py:2752-2760 | app/services/voice.py:3005-3014 \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 \u0060app/services/voice.py:3005\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/voice.py"},"region":{"startLine":2752}}}],"partialFingerprints":{"codehealthFindingId/v1":"add21b8caffef4740e3c62eec1ef7c2745e2a403295d7995f9e1e206acdbbfe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): webui/Main.py:6652-6660 | webui/Main.py:6685-6691 \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 \u0060webui/Main.py:6652\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":"webui/Main.py"},"region":{"startLine":6652}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6aa80466b8cd724be9ac8ee8c55bacfddf59b112a39bab8cb75ec46489ee08f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): app/services/elevenlabs_music.py:76-82 | app/services/sonilo.py:60-68 \u2014 before extracting anything, compare \u0060app/services/elevenlabs_music.py\u0060 and \u0060app/services/sonilo.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/elevenlabs_music.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9de38cd52e4e2ea2e0a379e5edc2b94ee101fd486fbad87bce547870a265851"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): app/services/elevenlabs_music.py:43-50 | app/services/voice.py:479-487 \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":"app/services/elevenlabs_music.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe793e66078819700bc49ea069ddf2f3434c0b36cb813ac004b174f466a58775"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): app/services/metaso_minimax.py:63-73 | app/services/muapi.py:65-69 | app/services/ofox.py:67-76 \u2014 before extracting anything, compare \u0060app/services/metaso_minimax.py\u0060 and \u0060app/services/muapi.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/metaso_minimax.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a08358902aef16a76e9ea76beea32e4c6f08777e52e9dbc4fc809735b8ad47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): app/services/metaso_minimax.py:177-187 | app/services/muapi.py:183-193 | app/services/ofox.py:201-211 | app/services/volcengine_seedance.py:205-215 \u2014 before extracting anything, compare \u0060app/services/metaso_minimax.py\u0060 and \u0060app/services/muapi.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 79 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":"app/services/metaso_minimax.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28fd1b2dabadd73c8f8ebdf6af9f762672c54b5b36736ec7bcde4677d3b084e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): app/services/muapi.py:115-121 | app/services/ofox.py:133-139 | app/services/volcengine_seedance.py:133-139 \u2014 before extracting anything, compare \u0060app/services/muapi.py\u0060 and \u0060app/services/ofox.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 99 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":"app/services/muapi.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a671d4cb215c19590276e477dd41fd0454d54d757b9dce9e86060edff7e9e243"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): app/services/material.py:55-59 | app/services/video.py:97-101 \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":"app/services/material.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8879fd2827457eaabfac5749accfb1c8cc7cedc6e6de5736c1256d0163487e52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): app/services/ofox.py:192-197 | app/services/volcengine_seedance.py:196-201 \u2014 before extracting anything, compare \u0060app/services/ofox.py\u0060 and \u0060app/services/volcengine_seedance.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/ofox.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fc82d629d542995e2d4b5c3cc10e1ecf36e3b8c1832cfbc59f8945aabcb4fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): app/services/voice.py:744-748 | app/services/voice.py:757-761 \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":"app/services/voice.py"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"9658b6cdeaaaf92610659dd9ee71e6af266a1c92cb8e8fd661c55db40ea40d7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): scripts/accept_chatgpt_oauth.py:33-54 | scripts/accept_codex_image.py:45-66 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"scripts/accept_chatgpt_oauth.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bffeefcb102bb0a2ff387cd6b2e596dbf6d2b2347c052bfbf45aa6fb732091e"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: edge-tts: \u0060edge-tts\u0060 7.3.1 is published on PyPI under \u0060LGPL-3.0\u0060, which this policy bans, and it is in the SHIPPED closure of this repository \u2014 so it is installed by everything that depends on this repository, not just by its test environment. A distribution offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package, or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d4f9135c55178a6c753dc156b596528445d628d38081a72f2381f4c99c590538"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: webui/Main.py: webui/Main.py changed 76 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 111 in Main._render_audio_settings at line 7946. 34 of those changes were fix/bug commits, and the other 42 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- webui/Main.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":"webui/Main.py"},"region":{"startLine":7946}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4b421f04c1f11730432e51726004ca27c0b1d49adc0f94c3db304a71798ec0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/services/task.py: app/services/task.py changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in task._run_pipeline at line 1550. 22 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/task.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":"app/services/task.py"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b585c9029e387c370f116e908d07a4ccf0494721edb0788214105760604d14e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/services/llm.py: app/services/llm.py changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in llm._generate_response at line 315. 27 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/llm.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":"app/services/llm.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79e3fa21744e423d39ea44f8fb5bc308e3950235aeffecfd5015248a71ccd09"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/services/voice.py: app/services/voice.py changed 65 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in voice.voxcpm_tts at line 3270. 50 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/voice.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":"app/services/voice.py"},"region":{"startLine":3270}}}],"partialFingerprints":{"codehealthFindingId/v1":"88af6b005c50d28b56cb0484eb6e69634fee1e0aa68a4a6dc3608583b4791286"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli.py: cli.py changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in cli._validate_batch_task_params at line 1206. 19 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- cli.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":"cli.py"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"071ceed2ffb767fc3ac2207bb8fd7f5f9c2ab4d3387144906591c3b48d97608d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/services/video.py: app/services/video.py changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in video.combine_videos at line 981. 43 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/video.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":"app/services/video.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85a67d88f7de79c73d9046499fd4635ef04548a7aa4164b53278c1f780730fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: docs/skill/mpt_agent.py: docs/skill/mpt_agent.py changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in mpt_agent.missing_config at line 416. 15 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- docs/skill/mpt_agent.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":"docs/skill/mpt_agent.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"168fe44f3727e4539431a4117d369dfc2a7f433d5110b3e02a4b7a5e85599ee1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/services/material.py: app/services/material.py changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in material.download_videos at line 2394. 24 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/material.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":"app/services/material.py"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b969c0a6b88039f8188c8a9339868282fb533682af40a64a815520239b6b46"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/services/upload_post.py: app/services/upload_post.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in UploadPostService.upload_video at line 175. 11 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/upload_post.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":"app/services/upload_post.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20339bb374aa789c30d3e09308c45ecf42ebe7d11ac11bd4ce41c3e18aa1678"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/utils/utils.py: app/utils/utils.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in utils.split_string_by_punctuations at line 309. 17 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/utils/utils.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":"app/utils/utils.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d9396b0956288489af04a3a06b6dd373534c6249abbbd12a3dfd79d9c75aa9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/controllers/v1/video.py: app/controllers/v1/video.py changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in video._parse_byte_range at line 158. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/controllers/v1/video.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":"app/controllers/v1/video.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cc761b0d1422f6a07640eb20ebfcb4956504553385b4c66ac2c128c437be5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/services/subtitle.py: app/services/subtitle.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in subtitle.create at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/subtitle.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":"app/services/subtitle.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c861daf96dd1a63948c53105d1aa10725365c0b3ac01b09cba91f61787662906"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/services/ofox.py: app/services/ofox.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ofox.generate_videos at line 214. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/ofox.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":"app/services/ofox.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cab2830a47eb48386b998ea3cc8259286dd8efc52e4d4feb6ae98dbeef2e19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/services/volcengine_seedance.py: app/services/volcengine_seedance.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in volcengine_seedance.generate_videos at line 232. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/volcengine_seedance.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":"app/services/volcengine_seedance.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6ea287a58d50399c2e44cb89a9d7d81b9f3889e9f5a9e1489155e77581584b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/controllers/manager/redis_manager.py: app/controllers/manager/redis_manager.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in RedisTaskManager._deserialize_task at line 369. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/controllers/manager/redis_manager.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":"app/controllers/manager/redis_manager.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"170ba0b09aee0fb79fcbc2d3d4a41c95caf61f2a641afbb88291957386f21106"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/services/material_cache.py: app/services/material_cache.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in material_cache.load_material_search_cache at line 203. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/material_cache.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":"app/services/material_cache.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5569073fb4f8c77eaeed33ea10ffc2e604afcd8727f3bfb5fa98ec8458705187"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/services/muapi.py: app/services/muapi.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in muapi.generate_videos at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/muapi.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":"app/services/muapi.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b4c6c43b0c260827ea3411a1fa92705a674cb05d611e239add1580158c6b8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/services/metaso_minimax.py: app/services/metaso_minimax.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in metaso_minimax.generate_videos at line 209. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/metaso_minimax.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":"app/services/metaso_minimax.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"6307b22a1799fd306e331191ebb4b3d3a863e3f7fe3eef8f68dadcb11ea29c53"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: app/models/schema.py: app/models/schema.py changed 13 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is VideoAspect.to_resolution at line 39), 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(api): give /videos requests without voice_name the default voice of /audio and /subtitle\u201D; \u201Cfix(schema): normalize enum default types\u201D; \u201Cfix(api): reject nonfinite speech and mixing parameters before scheduling\u201D; \u201Cfix(schema): validate subtitle render geometry before generation\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/models/schema.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":"app/models/schema.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3680abe0887d675f3f134c3b24d7368ed3db3bb4a953099b440668917073c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: app/services/state.py: app/services/state.py changed 11 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is RedisState.list_task_ids at line 164), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(state): guard Redis task deletion atomically\u201D; \u201Cfix(state): preserve raw task ID strings when reading Redis\u201D; \u201Cfix(state): restrict atomic Redis patches to owned task hashes\u201D; \u201Cfix(state): snapshot mutable task update inputs\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/state.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":"app/services/state.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84884b578a325217da2de575b11e090151de8c1d1537c7bd7ffd31bb87d2b97"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: app/config/config.py: app/config/config.py changed 13 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is config.load_config at line 532), 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(config): explain how to fix a Docker bind-mounted config.toml folder\u201D; \u201Cfix(config): keep Windows paths and non-breaking spaces intact when saving config.toml\u201D; \u201Cfix(ffmpeg): expand binary paths before import (#1662)\u201D; \u201Cfix(config): distinguish network routes from default gateways\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/config/config.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":"app/config/config.py"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0b704e504b9f5cd111c24c207f2871758c129af4f51bb179ae9b9f95e8d82a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: app/asgi.py: app/asgi.py changed 8 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is asgi._normalize_allowed_origin at line 98), 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(redis): share task concurrency limits (#1742)\u201D; \u201Cfix(api): describe the rejected field in validation errors\u201D; \u201Cfix(api): serialize rejected inputs in validation responses\u201D; \u201Cfix(redis): resume persisted task queue on API startup\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/asgi.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":"app/asgi.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"688720ed6d99ebeb0cb3b78cc96d847cf757c51d1713918d69bec440b8c30e03"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: app/utils/logging_utils.py: app/utils/logging_utils.py changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is logging_utils._project_relative_path at line 102), 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(log): keep WebUI and API log lines when output is redirected on Windows\u201D; \u201Cfix(log): shorten only the complete project root in messages\u201D; \u201Cfix(webui): show task logs written by helper threads\u201D; \u201Cfix(logging): keep log records when the project root is on another mount (#1260)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/utils/logging_utils.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":"app/utils/logging_utils.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cf254ef18c700c1c1cbe4c937006e460450ddb79669393e62d920bb21f3268"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: app/services/elevenlabs_music.py: app/services/elevenlabs_music.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is elevenlabs_music.test_connection at line 112), 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(music): reject credentialed provider redirects\u201D; \u201Cfix(bgm): keep unknown upstream charsets from bypassing the music error path\u201D; \u201Cfix: decode subprocess output as UTF-8 instead of the system locale\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/elevenlabs_music.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":"app/services/elevenlabs_music.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"acca8253f05c1b8464e5b67832ab45c21ca6058eadb8a041e2a1dd3ce291da51"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: app/services/cache_manager.py: app/services/cache_manager.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is cache_manager.clean_video_cache at line 180), 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(cache): snapshot cleanup candidates with os.stat on Windows\u201D; \u201Cfix(cache): keep fresh downloads during cleanup\u201D; \u201Cfix(material): validate video cache writes (#1416)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/cache_manager.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":"app/services/cache_manager.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a1decd9713600a0d557aefac3b292c996f42d65cd6626cdaa2765a7c0c537d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: app/services/twelvelabs.py: app/services/twelvelabs.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is twelvelabs.rerank_terms_by_subject at line 113), 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(twelvelabs): reject mixed embedding dimensions\u201D; \u201Cfix(twelvelabs): keep invalid embeddings out of the session cache\u201D; \u201Cfix(twelvelabs): close owned HTTP transports after requests\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/services/twelvelabs.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":"app/services/twelvelabs.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da29302e976863910a514726dfee692f5e090a85c239c951633554dbf27fdea"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: app/controllers/manager/base_manager.py: app/controllers/manager/base_manager.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is base_manager._coerce_task_limit at line 12), 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(redis): admit queued requests atomically across API workers\u201D; \u201Cfix(queue): dispatch waiting task before accepting new work\u201D; \u201Cfix(queue): coerce the configured task limits before scheduling\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:14:28 \u002B08:00\u0027 --until=\u00272026-11-13 23:14:28 \u002B08:00\u0027 --full-history --no-merges -- app/controllers/manager/base_manager.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":"app/controllers/manager/base_manager.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b39b4b17d233169403f1d606474727e91ef2e4639bb5f7a5e7535f7a0648051"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: webui/kimi_login.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"35e80d21e60de26352179a03c15933e14d6a3833c29008612df60a3fe114e757"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060pyproject.toml\u0060 makes this repository a deployable product (line 49)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f93f7a2c78f190233679ac8202a9f8e691d2305d697b777ee579589e9c4bff1"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (39220 LoC, 196 module-visible types across 13 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D27","level":"note","message":{"text":"Scattered collaborators: 84 % of calls cross a namespace and only 35 % of collaborators are co-located \u2014 group each feature\u0027s code into a vertical slice so a call\u0027s collaborators sit together."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5aad4a4530bac3928d3a065a664be89d023ecfc865f9bf79ac05754b3bffe322"}},{"ruleId":"D28","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":"af2a529935e392979da0f215b844b1afc273ef389548736f2d272507272882ea"},"properties":{"commitSha":"bcc108bbc7c0f04f87678bd6c7f74de774d7a8fc"}},{"ruleId":"D28","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":"221dd42992650a942432b5834fbd6092154eeea7f74e13dd4c319f54dee9efc7"},"properties":{"commitSha":"bcc108bbc7c0f04f87678bd6c7f74de774d7a8fc"}},{"ruleId":"D28","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":"ceef58925cd0168344054f783a79fed8f940ffbec02126adcbe79235cf4c8644"},"properties":{"commitSha":"bcc108bbc7c0f04f87678bd6c7f74de774d7a8fc"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"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":"703b990f6d9a60db46de372b4bc3713bc769740b61be7dfed2b23b523664ac12"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9545660e6add0322e3f7b23092a9bdb2b9ecacff6395f93e694cf9dc97bdaaa2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a4694634fcc293590fee9e2191767b55a632013523e5569a7db2972085e85fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc17439367157c6f6ff8590f4dfe29bc3a0ce4e328d99df310f8a49a2877af10"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc26593caf509b487cb3dff9d1a587737a02c72fc5e13e59c1a151f7d6412ad4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee6da1b051ddff31eece62e737e90827fa671274985f5a26bd0f59d7c044006f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7d0141152c5300ba863d47573fe0b6384121aac3afaa70381eea83bdc15cefe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0d3b9e656d91b6126894888c4e63cbfa7edab7ec8df8dd2a193266402b138a2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7f6ba9a32457783c93b8965df70eddb631ff9cdec815357fbbedc0dc6be7114"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f437a435955862e52efc1ffde889862942bfbb4bff880c133bb89b2a1c51958"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef980e6742a6c8032c8f9df81766da47452218416c33d1a5b8c9a0576adbea65"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83411c31c539d72c311af507d104a30397edbb934c681b0c14bc84787c9dccb6"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25f18a1346cd84f992a1a7b7615f27d5d3c7166f1cc6c356b8ad34337ea542fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0dd617b55211e983e57d49de24f794d1023af01b7894d8f7c68dabaae2ea7559"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c0b094f4fcef411b75fc2c947815bba4400d0eb13650f24e7d5c7e42d47f40e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c97d63bb03a79df5b9cafec0b697c11b7fb36e522e7ecaee00d42aad43b7e855"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4473fc37b37223402693cfdae1f3c3f2043686e0fd8facdeb8141a5d101099f"},"taxa":[{"id":"CWE-89","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":"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":"6ed059458dc0d864f79fffc2c8cd3f09ac2213f256b255ba1e07734350228541"},"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":"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":"8d4a0f1929f34b20b8bc2f8f7e48197ce3f563d331ee6b6e6fd51b8cfc75a0db"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"5b0ee68789b5c0b0f41b521e5595ad8a4537f5302616f8af485fad1b52b0289d"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f01b4a2de563ad05565776726324476608bfb5b0c81bdc41644af13a3408a8c6"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5102fe556f3399b622dcd81c118f7d1308c1374fbd00ede44c01babfc78c0a23"},"properties":{"dependency":{"package":"pyasn1","version":"0.6.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c809c1897ccdb5402366993e09d589cd8bde930a85cf2d3fa6376ad6efea16f6"},"properties":{"dependency":{"package":"python-multipart","version":"0.0.30","advisory":"PYSEC-2026-3040","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2f69292b7500f63f60d9273f140d50be816fe0dca2dfb24841c4450b5194153"},"properties":{"dependency":{"package":"multidict","version":"6.7.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4244"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da5390fa68f56374e03fd42926d3dd5a9f99c9c35b2a92a4cac72cb8d9aaa23b"},"properties":{"dependency":{"package":"python-multipart","version":"0.0.30","advisory":"PYSEC-2026-3040","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13586fc0c39afd311c8f68b33f2e89fbb1618f43b2d8bc54d4d00cd4d7925790"},"properties":{"dependency":{"package":"setuptools","version":"82.0.1","advisory":"[GHSA redacted]","aliases":["BIT-setuptools-2026-59890","[CVE redacted]","[GHSA redacted]","PYSEC-2026-3447"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D31","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":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"ruleId":"D31","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":"bf290f79648a3d406a16e6e8c8dc23da7faffa36d507f231975cb42d1f0f30ca"}},{"ruleId":"D31","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":"13516a9f3e7a9f530e5cfce2bf783cd1ce6c685acecf1cb1d85a4d760bfd8767"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","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":"82371ef387828fb8ce077a1ec04e556deab65abc5d0e7e6178d9de666e40b0c8"}},{"ruleId":"D31","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":"934f79ed8e5dbb06b3bdf69dd1e5a84aeefdfb2f484e40145e78a1496f9d8fa3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"ea8cf74b0d3edaef19e5e5b20a96dc0826e60533a3c7c0742aec3a5409526481"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"5cfed0ee4e80785ce23c7083cffdead9acc6c64f9dce56a00ca7178bd3d7bee5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"9096464b4d081a661e021451b40cd855a9f69dc9426557304ed8e3614892648c"}},{"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":"dca4da3a82521f659eff020c573eb8f574fed96af2822340834609ad13b4b380"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"a26cc27928f7522a1347373c723e8284a1c57f3cdc57db1424252e44b0e2b238"}},{"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":"1f51a163f26d94ce6b6f473117dde579d091c8cbf9e59810475c94d9fc921120"}},{"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":"5a71135211d7aef0a75f5f8d941fce360d1018a12535e0eecf5da3d6dd34bd41"}},{"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":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19d4cbb252a3e4997007fe629a8fde65a6a24e745494155b47ed43cbf523f1eb"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) \u2014 this is NOT a claim that endpoints are unprotected. What\u0027s missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can\u0027t be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b048fdf3fa524ac68c7874fdfcdb4c49d5f010013f2cb22a0bd84cb12ceb951f"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"M3","level":"note","message":{"text":"No src/ separation: Most of the production code is in directories of its own, but 2 application file(s) sit at the repository root beside the build and tooling files (\u0060cli.py\u0060, \u0060main.py\u0060)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/2 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060docs/local-image-server\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"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":[],"partialFingerprints":{"codehealthFindingId/v1":"db6bab8a28a2145f47e5a4e6683cda39d2ba0296c723238e8057da979ae1c706"}},{"ruleId":"P5","level":"warning","message":{"text":"No DR/backup evidence: A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced \u2014 a volume that survives a container recreate is not a tested restore from catastrophic loss."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5daabb38c90b07af65b8738cf94ce884e90a7d8fef810d341de5c186188c8fe0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060body or response.reason or \u0022request failed\u0022\u0060 appears character-identically in 2 files \u2014 app/services/elevenlabs_music.py, app/services/sonilo.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":"app/services/elevenlabs_music.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c235cf123898b53c46e63580155759c8fdedc208051f921ec406807f3157b49a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.app.get(\u0022sonilo_api_key\u0022, \u0022\u0022) or \u0022\u0022\u0060 appears character-identically in 2 files \u2014 app/services/sonilo.py, webui/Main.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":"app/services/sonilo.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd98860772fd5b8d127e3ef19da2f7bba7d2658f59a6d1ed3cdbcb9d50f022bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.elevenlabs.get(\u0022api_key\u0022, \u0022\u0022) or \u0022\u0022\u0060 appears character-identically in 2 files \u2014 app/services/elevenlabs_music.py, webui/Main.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":"app/services/elevenlabs_music.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0517a0031863f79459289ee275d4824f01696767bac50889a279b3cc1b13d9ef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060configured_key or os.getenv(\u0022SONILO_API_KEY\u0022, \u0022\u0022).strip()\u0060 appears character-identically in 2 files \u2014 app/services/sonilo.py, webui/Main.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":"app/services/sonilo.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f278a242854e039f622d128098bf1618a18f6e47b7bb9607f12e237d3fbb9e68"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current_model and current_model not in choices\u0060 appears character-identically in 2 files \u2014 webui/chatgpt_models.py, webui/codex_models.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":"webui/chatgpt_models.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6625b22d01baa035ecf9095f3fc00f3d3ded8f7c2aa2ea7671096fc48205d1a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060detail or f\u0022HTTP {_status_code(response)}\u0022\u0060 appears character-identically in 4 files \u2014 app/services/metaso_minimax.py, app/services/muapi.py, app/services/ofox.py, app/services/volcengine_seedance.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":"app/services/metaso_minimax.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59b0c3fe3dd9f7cfd05a52701879d92e15d2dbcf39a15dfa0d8dda25f74d0db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error.get(\u0022code\u0022) or payload.get(\u0022code\u0022)\u0060 appears character-identically in 2 files \u2014 app/services/ofox.py, app/services/volcengine_seedance.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":"app/services/ofox.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59364db33255604aff8c596abe5b0272c270cfe0982d1c069c1100b50e49ef8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error.get(\u0022message\u0022) or payload.get(\u0022message\u0022)\u0060 appears character-identically in 2 files \u2014 app/services/ofox.py, app/services/volcengine_seedance.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":"app/services/ofox.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"82371ed8cde3417fac5753c6b1717cfd6ca997a74ae8e07aea7cb473b5d04648"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not file_path or not os.path.exists(file_path)\u0060 appears character-identically in 4 files \u2014 app/services/bgm.py, app/services/elevenlabs_music.py, app/services/material_upload.py, app/services/sonilo.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":"app/services/bgm.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0d14e51c6eec975a0af639b9ec1ac049e09d592a79c23a8d1e84847a270193"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, str) or not value.strip()\u0060 appears character-identically in 2 files \u2014 app/services/material.py, app/services/material_cache.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":"app/services/material.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3437e0794104e260b083a8888fbe38dacd722f65d12764feed0c4a2ca4fdb8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not math.isfinite(duration) or duration \u003C= 0\u0060 appears character-identically in 5 files \u2014 app/services/chatgpt_auth.py, app/services/codex_oauth.py, app/services/elevenlabs_music.py, app/services/material.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":"app/services/chatgpt_auth.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"37052daabbe3668da2e9c1e47d8fe61df76952cc6eb323bbc7255d2f59f607fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not math.isfinite(parsed) or parsed \u003C= 0\u0060 appears character-identically in 2 files \u2014 app/services/kimi_code_oauth.py, cli.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":"app/services/kimi_code_oauth.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12a037a7fbbcb4d11200b1fc58cdb953924aebf3712bbb893f8088d458504de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not math.isfinite(read_timeout) or read_timeout \u003C= 0\u0060 appears character-identically in 2 files \u2014 app/services/elevenlabs_music.py, app/services/sonilo.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":"app/services/elevenlabs_music.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebd74fdf83443f9c6d0fb94649437d261eba946f817c002a849f4c76125ff95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060part.get(\u0022type\u0022) == \u0022output_text\u0022 and isinstance( part.get(\u0022text\u0022), str )\u0060 appears character-identically in 2 files \u2014 app/services/chatgpt_oauth.py, app/services/codex_oauth.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":"app/services/chatgpt_oauth.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3507a98a7d29eed15d8f36d784745db735d32c22fb151d38e5df98d7b59a38e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060proxy_size \u003C= 0 or proxy_size \u003E MAX_PROXY_BYTES\u0060 appears character-identically in 2 files \u2014 app/services/elevenlabs_music.py, app/services/sonilo.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":"app/services/elevenlabs_music.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"788765775a1da2907e3bf41122230a0946b885986b119ffd0234c774ae9be4ae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response is not None and _status_code(response) in RETRYABLE_STATUS_CODES\u0060 appears character-identically in 4 files \u2014 app/services/metaso_minimax.py, app/services/muapi.py, app/services/ofox.py, app/services/volcengine_seedance.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":"app/services/metaso_minimax.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"459d8f842f360bcea721ddb986099bee10bc0a082d8942fa73a93f17ae125f15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.status_code == 401 and attempt == 0\u0060 appears character-identically in 2 files \u2014 app/services/chatgpt_oauth.py, app/services/codex_oauth.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":"app/services/chatgpt_oauth.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"23982c0d1dc128035f84e72c06345b0a3cd10ad846cf1bc628ef26a789b45b69"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 409 is called with an argument built by \u0060utils.to_json(video_terms)\u0060 (line 409), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/task.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf6393b35b429b46f4b2ac5db202b8904ae1b8578819037860770e97c432f55"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/utils/request_logging.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"245b023ca9263234ab1f50f165cc587ffd37e9376d3df11c6a7bfa857cf2842f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/utils/request_logging.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"472831910213aadb101fd8e273ab6427afe32b3ba9a9487dfc8bd583e3b50031"}},{"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":"app/utils/request_logging.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20f8d0e8c8710f8066f08cd69ad4c4a78dc6cf24df0a140d54cc5e32ebedb65"}},{"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":"app/services/material.py"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"b439186750e66e8e68ed23b973f6d318e36d76a8659bd67800476979bb71869f"}},{"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":"app/services/material.py"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fdc988345fd8dadc1f976d1d3f80100c0b8959ce3c40a2493913cd7d03046b"}},{"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":"app/services/video.py"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"922ce3d484749234f0bd8ef325aca783e42af1b8b2719e10530100a58bc4849e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_claims\u0060 returns \u0060{}\u0060 when \u0060(ValueError, IndexError, TypeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app/services/codex_oauth.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e1d18b9693dacb8703c184ae325147507330172be074d99736648649361f1d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_wavespeed_status_code\u0060 returns \u0060200\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":"app/services/material.py"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c8dca768a1341c5af0140a924e2606024e55c9d946ae741e3d2f24ce962cb1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_status_code\u0060 returns \u0060200\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":"app/services/metaso_minimax.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eed5dc174e72ca5f9ad568e913b024fe6ae6ed4be82aec80dbe2fd386c5aa77"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_status_code\u0060 returns \u0060200\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":"app/services/muapi.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8af7443548efde32a592864e98244671b8b0b994de4bad047c7b7815c26d24"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_status_code\u0060 returns \u0060200\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":"app/services/ofox.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f721a49e4186713cef3432033e0906fc9a2de8062d3fceba50835d38e2acd82"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060fallback_fonts\u0060 returns \u0060[]\u0060 when \u0060(KeyError, 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":"app/services/utils/subtitle_shaping.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fabf8296f0066e189c5d54bdc85fe06a69404618421acfac7e25b7ab1e01ddc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_status_code\u0060 returns \u0060200\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":"app/services/volcengine_seedance.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"46545aba4e91f475c7405fdf6efe2f858557dc5d7e478e196b98aeeaeaa2ca3e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060ollama_models\u0060 returns \u0060[]\u0060 when \u0060(requests.RequestException, 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":"docs/local-image-server/server.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af7ac8031765afa2f1ce3827126a3ea1d48a343eb6faf5d8e6455bdc28a46aa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_parse_string_list\u0060 returns \u0060[]\u0060 when \u0060json.JSONDecodeError\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":"docs/skill/mpt_agent.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20d934b70196b308b238870b06b46fac9db10c5bdd0d3881155eefcfecf5b13"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_current_generation_task_id\u0060 returns \u0060\u0027\u0027\u0060 when \u0060(ValueError, TypeError, AttributeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2766806b4fe84a6117002a96d5863658d80aaec9581a2c0c641f9ab7a0fe97"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_generation_is_busy\u0060 swallows every exception into \u0060return True\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":"webui/Main.py"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e58c6b296782ced0a3d50ee37d6c48d305596d7ad32aaedde291554a4f7bb5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_effective_voice_rate_before_audio_panel\u0060 returns \u00601.0\u0060 when \u0060(TypeError, ValueError, OverflowError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"webui/Main.py"},"region":{"startLine":5099}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fc1efd1d0bb6ea72dfaefc5394723d217a88e817819847984f0b6ff9a31884"}}],"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-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-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-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":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":45,"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."]}]}