{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"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":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"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":"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":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Pick.process_G (cyclomatic 61): Pick.process_G has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent 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: DisperPicker/pick.py holds 4 of the 7 methods over the threshold \u2014 including the worst \u2014 and 106 of the 137 points over it (77%), 5\u00D7 the next-largest file (DisperPicker/qc.py at 21). 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":"DisperPicker/pick.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"7922043af8554509f07b1a147a1c377ea9dd99728db03fa1c7e09106be38c255"}},{"ruleId":"D1","level":"warning","message":{"text":"Pick.pick_C (cyclomatic 53): Pick.pick_C has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent 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: DisperPicker/pick.py holds 4 of the 7 methods over the threshold \u2014 including the worst \u2014 and 106 of the 137 points over it (77%), 5\u00D7 the next-largest file (DisperPicker/qc.py at 21). 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":"DisperPicker/pick.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af818dfb5c224eeecaaa26a56f0dfec758651af7ac4b02be36507b1e180d9af"}},{"ruleId":"D1","level":"warning","message":{"text":"qc.qc (cyclomatic 36): qc.qc has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"DisperPicker/qc.py"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc3ca56242be6cb9438448ab29fbafad1c472e8b9550dc0c8c85d38850cf55d"}},{"ruleId":"D1","level":"warning","message":{"text":"Pick.pick (cyclomatic 29): Pick.pick has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: DisperPicker/pick.py holds 4 of the 7 methods over the threshold \u2014 including the worst \u2014 and 106 of the 137 points over it (77%), 5\u00D7 the next-largest file (DisperPicker/qc.py at 21). 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":"DisperPicker/pick.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c645f0c882dc1274a4b682687bebc6fb2b0f5d03910df73c052143b82ec945b7"}},{"ruleId":"D1","level":"warning","message":{"text":"Pick.process_C (cyclomatic 23): Pick.process_C 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: DisperPicker/pick.py holds 4 of the 7 methods over the threshold \u2014 including the worst \u2014 and 106 of the 137 points over it (77%), 5\u00D7 the next-largest file (DisperPicker/qc.py at 21). 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":"DisperPicker/pick.py"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace2fadac48aed8bac758796914ace74f049ef8ceaf9a70487b1f5514c67b9b8"}},{"ruleId":"D1","level":"warning","message":{"text":"gfcn_analysis.AutoPhaseDisperPick (cyclomatic 21): gfcn_analysis.AutoPhaseDisperPick 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":"EGFAnalysisTimeFreq.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57d662081b79f1199c97a3f6ad6abee4d1662fef8baca861f97f61fd1db8962"}},{"ruleId":"D1","level":"warning","message":{"text":"gfcn_analysis.AutoGroupDisperPick (cyclomatic 19): gfcn_analysis.AutoGroupDisperPick 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":"EGFAnalysisTimeFreq.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d157e7bd16a9648b54e32f402d767ea3159a0cf5d60264a23bd03b34676958"}},{"ruleId":"D2","level":"warning","message":{"text":"Pick.process_G (cognitive 165): Pick.process_G has cognitive complexity 165 (threshold 15). Drivers by points: if/else 35 (118 pts), loops 12 (29 pts), boolean chains 18 (nesting depth added 100). 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: DisperPicker/pick.py holds 4 of the 11 methods over the threshold \u2014 including the worst \u2014 and 369 of the 524 points over it (70%), 5.7\u00D7 the next-largest file (EGFAnalysisTimeFreq.py at 65). 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":"DisperPicker/pick.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"548af0408cd0bcd7eb8168e9364a9442dda187d5efd71852c4613019353fe5ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Pick.pick_C (cognitive 152): Pick.pick_C has cognitive complexity 152 (threshold 15). Drivers by points: if/else 32 (113 pts), loops 9 (23 pts), boolean chains 16 (nesting depth added 95). 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: DisperPicker/pick.py holds 4 of the 11 methods over the threshold \u2014 including the worst \u2014 and 369 of the 524 points over it (70%), 5.7\u00D7 the next-largest file (EGFAnalysisTimeFreq.py at 65). 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":"DisperPicker/pick.py"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b0ad4054b1db27a038d5283bfbfc8c85c295c70accb4f69f65d52bfbbbdbc7"}},{"ruleId":"D2","level":"warning","message":{"text":"Pick.pick (cognitive 76): Pick.pick has cognitive complexity 76 (threshold 15). Drivers by points: if/else 22 (44 pts), loops 10 (27 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 41). To reduce it, split the body into named stages: move each independent 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: DisperPicker/pick.py holds 4 of the 11 methods over the threshold \u2014 including the worst \u2014 and 369 of the 524 points over it (70%), 5.7\u00D7 the next-largest file (EGFAnalysisTimeFreq.py at 65). 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":"DisperPicker/pick.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"713404fec2ecd6cb4fdc639328f76bf5ce17c923eed13f0bdb97b866b55f176f"}},{"ruleId":"D2","level":"warning","message":{"text":"qc.qc (cognitive 71): qc.qc has cognitive complexity 71 (threshold 15). Drivers by points: if/else 16 (43 pts), loops 8 (17 pts), boolean chains 11 (nesting depth added 36). 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":"DisperPicker/qc.py"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f256c1336c018b8477ae17106b242ad9b86af8655798a0233470d6cb6ad1c83"}},{"ruleId":"D2","level":"warning","message":{"text":"gfcn_analysis.AutoPhaseDisperPick (cognitive 45): gfcn_analysis.AutoPhaseDisperPick has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 6 (11 pts), boolean chains 2 (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":"EGFAnalysisTimeFreq.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"9241e7a5e02954943adb5038dda0892e40d51ca932d81761c81a04089e9f26d7"}},{"ruleId":"D2","level":"warning","message":{"text":"gfcn_analysis.AutoGroupDisperPick (cognitive 39): gfcn_analysis.AutoGroupDisperPick has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"EGFAnalysisTimeFreq.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f713a184629c6d578bf9be6109a327b4ae90200299a21e3c4d322bfc02ff6954"}},{"ruleId":"D2","level":"warning","message":{"text":"Pick.process_C (cognitive 36): Pick.process_C has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 6 (7 pts), boolean chains 3 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: DisperPicker/pick.py holds 4 of the 11 methods over the threshold \u2014 including the worst \u2014 and 369 of the 524 points over it (70%), 5.7\u00D7 the next-largest file (EGFAnalysisTimeFreq.py at 65). 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":"DisperPicker/pick.py"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e60f72fca7da046386c3baea7b6795301d1bb18a2a0792116d6f1751993cd6"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader.get_batch_data (cognitive 31): Reader.get_batch_data has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 5 (13 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Reader.get_validation_data) 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":"DisperPicker/reader/reader.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f9d45ae37109ca024725facde8b013c262f3c387e023222dc9dae879ee7c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader.get_validation_data (cognitive 31): Reader.get_validation_data has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 5 (13 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Reader.get_batch_data) 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":"DisperPicker/reader/reader.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0c22f618ba018f8c58adc6bae18c50e1d673301da3fb342fb576ef7bf46a54"}},{"ruleId":"D2","level":"warning","message":{"text":"gfcn_analysis.AutoSearch (cognitive 26): gfcn_analysis.AutoSearch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 6 (10 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":"EGFAnalysisTimeFreq.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3015b320728414d0ed8f5a3b5b474d318055a889c3c826510a6f20d6f40f99"}},{"ruleId":"D2","level":"warning","message":{"text":"CNN.train (cognitive 17): CNN.train has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"DisperPicker/train_cnn.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e648b5a12884b4e8d4905aff479375b19dd88bab8b3bd004882d06e3b28ab975"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./EGFAnalysisTimeFreq.py: FileTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 106 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"EGFAnalysisTimeFreq.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03ad008ff31905a9eb03ccf0aee5837d523d1b4f8f885ee9f8e1a2eb94be0b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 8 shared lines): DisperPicker/plot/plot_test2.py:9-74 | DisperPicker/plot/plot_test_all.py:10-160 | DisperPicker/plot/plot_train.py:9-192 \u2014 These 3 members are variants of one another: a block of 8 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"DisperPicker/plot/plot_test2.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c9ef3b412e6c3f5ce1c0434c058d514ead5a9a9b43267d5e81550ccfd49b6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (60 shared lines): EGFAnalysisTimeFreq.py:265-376 | EGFAnalysisTimeFreq.py:519-647 \u2014 These two members are variants of one another: 60 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"EGFAnalysisTimeFreq.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d38dc4f7659327cad5a23db4ce7b48395fcca706755e5c4f07779bf800b3e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): DisperPicker/tflib/layers.py:15-38 | DisperPicker/tflib/layers.py:49-71 | DisperPicker/tflib/layers.py:77-106 | DisperPicker/tflib/layers.py:132-154 \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":"DisperPicker/tflib/layers.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcaf4e063a6078762224fff6aabe0d0cd7edb0b2db6e5b38bf20133c51153320"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (80 corresponding lines): DisperPicker/reader/reader.py:39-122 | DisperPicker/reader/reader.py:126-205 \u2014 These two members are one piece of code written twice and then edited apart: 80 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":"DisperPicker/reader/reader.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"194aec49f76896292bca982bc8d70f19f0240bd7b52c1f3dfaca0621b0626b88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): config.py:82-134 | config_train.py:82-134 \u2014 These two members are one piece of code written twice and then edited apart: 53 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":"config.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4aca5ad5ed018739bf71a5e0baef4a2b1eb70b0033b22a8b916d7b4ca5c9787"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): EGFAnalysisTimeFreq.py:650-670 | EGFAnalysisTimeFreq.py:674-696 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"EGFAnalysisTimeFreq.py"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5e7d9f3c45d368fa03777c947ab4c770f4048dbce5725dd0b59b7705835be0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): DisperPicker/plot/plot_test_all.py:163-176 | DisperPicker/plot/plot_train.py:196-209 \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":"DisperPicker/plot/plot_test_all.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d630cfcd94664cf1a3c320b448f767a5f6fd1d846f4ab7f19273d3670e96fc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): EGFAnalysisTimeFreq.py:297-327 | EGFAnalysisTimeFreq.py:563-593 \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":"EGFAnalysisTimeFreq.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"50587185636eaa4d8a09bb756ce522a14c5c124aa5f198160cfbe074fbbec390"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): DisperPicker/plot/plot_train.py:49-77 | DisperPicker/plot/plot_train.py:129-157 \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":"DisperPicker/plot/plot_train.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae525f069581a93325cdd154502fbb2274d03f7eb7252473182d6cfa18ec287"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): config.py:82-127 | config_train.py:82-127 \u2014 before extracting anything, compare \u0060config.py\u0060 and \u0060config_train.py\u0060 as WHOLE FILES: 94% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"config.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"03db130d02d5055bcf6dbe76ade27cc744d99984bf034c362f810179391518d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): DisperPicker/pick.py:381-407 | DisperPicker/pick.py:689-714 \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":"DisperPicker/pick.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"0318f20f1d617f737856441eeb8dc84e2d163e9967615a17ae1ba300c7785979"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): DisperPicker/pick.py:230-258 | DisperPicker/pick.py:280-308 \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":"DisperPicker/pick.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8448b2486684ac2ffea3adea5d30584b815fa1bea6c653fa374fd386acc90a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 4): DisperPicker/reader/reader.py:56-76 | DisperPicker/reader/reader.py:83-105 | DisperPicker/reader/reader.py:138-159 | DisperPicker/reader/reader.py:166-188 \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 \u0060DisperPicker/reader/reader.py:56\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":"DisperPicker/reader/reader.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f899026e8da189937cb109b6eb4397a7d76f785ccc835a19738cc1af1fcd48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): EGFAnalysisTimeFreq.py:782-802 | EGFAnalysisTimeFreq.py:806-826 \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":"EGFAnalysisTimeFreq.py"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5bf9e26e4613898b6c21c09954bd9ebd643f8b27c712f376d846f519eef4e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): DisperPicker/pick.py:409-425 | DisperPicker/pick.py:716-730 \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":"DisperPicker/pick.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3dc08c90b8823e3e536f2802567b11a707782146e9cf7ef03dd14a35fa25540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): EGFAnalysisTimeFreq.py:831-847 | EGFAnalysisTimeFreq.py:852-867 \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":"EGFAnalysisTimeFreq.py"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dce1fc5f418a8dc3a3e89c56a7115de0eef0bf4f5c38823da08a771ea2d95dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): EGFAnalysisTimeFreq.py:650-665 | EGFAnalysisTimeFreq.py:674-689 \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":"EGFAnalysisTimeFreq.py"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea4fbb8b6ab0262c39d41e19e8955a8488791656308361364e1f979538d9d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): DisperPicker/tflib/layers.py:15-25 | DisperPicker/tflib/layers.py:49-59 \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":"DisperPicker/tflib/layers.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9406a8e32bcf28f7f8f2a191db1d815a6b498250b6cd31af1c57b7d4d510ff8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): EGFAnalysisTimeFreq.py:341-353 | EGFAnalysisTimeFreq.py:610-622 \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":"EGFAnalysisTimeFreq.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd5cf55cfff9da43f8ded29e35cd7be86a22aed2124e4a2144809b34e55b54a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): DisperPicker/plot/plot_test2.py:46-54 | DisperPicker/plot/plot_test_all.py:89-98 \u2014 before extracting anything, compare \u0060DisperPicker/plot/plot_test2.py\u0060 and \u0060DisperPicker/plot/plot_test_all.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 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":"DisperPicker/plot/plot_test2.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"032f2d426e211abb5ae1683a311464e4f09876e95905a8e386b505458b5688f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): DisperPicker/plot/plot_test_all.py:41-49 | DisperPicker/plot/plot_test_all.py:103-111 | DisperPicker/plot/plot_train.py:59-67 | DisperPicker/plot/plot_train.py:139-147 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"DisperPicker/plot/plot_test_all.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f01667f2a152a3579da9f6193406f18c4c69118cbeac49a26f181712081fca3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): DisperPicker/plot/plot_test2.py:66-74 | DisperPicker/plot/plot_test_all.py:152-160 | DisperPicker/plot/plot_train.py:185-192 \u2014 before extracting anything, compare \u0060DisperPicker/plot/plot_test2.py\u0060 and \u0060DisperPicker/plot/plot_test_all.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 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":"DisperPicker/plot/plot_test2.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ed0006b1d00a63db151cdabe89394bda986fdb88e9205640aae997e9b4d028"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): DisperPicker/plot/plot_train.py:25-33 | DisperPicker/plot/plot_train.py:107-114 \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":"DisperPicker/plot/plot_train.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3609fd0aa56a951aa0a9c61f836915c2df5245666a23f279aaecb4744c853cbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20139 lines \u00D7 4): DisperPicker/plot/plot_test_all.py:38-38 | DisperPicker/plot/plot_test_all.py:100-102 | DisperPicker/plot/plot_train.py:34-42 | DisperPicker/plot/plot_train.py:115-123 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"DisperPicker/plot/plot_test_all.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a28e69471eaef4444e60497850e9296087318f7a43c4d44d6a3c4abd32fadb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): EGFAnalysisTimeFreq.py:277-285 | EGFAnalysisTimeFreq.py:532-540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"EGFAnalysisTimeFreq.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45d003c4c36ffeab9a198ca74b2cbcdb0ad34cee1eaa4bb10f4be8f3df96742"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): EGFAnalysisTimeFreq.py:329-335 | EGFAnalysisTimeFreq.py:596-603 \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":"EGFAnalysisTimeFreq.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"14744b6a070411076ca259e00f5050ccfd6021170838788ab676e1bfb82abb27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): DisperPicker/plot/plot_test2.py:45-51 | DisperPicker/plot/plot_test_all.py:70-76 | DisperPicker/plot/plot_test_all.py:88-94 | DisperPicker/plot/plot_test_all.py:132-138 \u2014 before extracting anything, compare \u0060DisperPicker/plot/plot_test2.py\u0060 and \u0060DisperPicker/plot/plot_test_all.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 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":"DisperPicker/plot/plot_test2.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"66eadc3bdc79b7e51ffdb64345a024a8b9d152799829ff6899794ecbc301fbeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): DisperPicker/tflib/layers.py:17-23 | DisperPicker/tflib/layers.py:51-57 | DisperPicker/tflib/layers.py:86-93 | DisperPicker/tflib/layers.py:139-146 \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 \u0060DisperPicker/tflib/layers.py:17\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":"DisperPicker/tflib/layers.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e800c64ac3c479f2477297ec77a23d451cb65766318028174e708a0437ace4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): DisperPicker/plot/plot_test2.py:44-49 | DisperPicker/plot/plot_test2.py:64-70 | DisperPicker/plot/plot_test_all.py:69-74 | DisperPicker/plot/plot_test_all.py:87-92 | DisperPicker/plot/plot_test_all.py:131-136 | DisperPicker/plot/plot_test_all.py:150-156 \u2014 before extracting anything, compare \u0060DisperPicker/plot/plot_test2.py\u0060 and \u0060DisperPicker/plot/plot_test_all.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060DisperPicker/plot/plot_test_all.py:146\u0060 calls \u0060line_interval\u0060 and \u0060DisperPicker/plot/plot_test2.py:42\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":"DisperPicker/plot/plot_test2.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba5aa126378421ff1c98a78ac5de15fcfb01e83c366d892ca8bcf89af9ba796"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): DisperPicker/pick.py:174-180 | DisperPicker/pick.py:181-187 \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":"DisperPicker/pick.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d22932abab8e9eba59a7250554ec407e5132d8fbb754ee4b91dbfcc6dcd773"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): DisperPicker/plot/plot_test2.py:38-42 | DisperPicker/plot/plot_test2.py:56-60 | DisperPicker/plot/plot_test_all.py:80-84 | DisperPicker/plot/plot_test_all.py:141-145 \u2014 before extracting anything, compare \u0060DisperPicker/plot/plot_test2.py\u0060 and \u0060DisperPicker/plot/plot_test_all.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060DisperPicker/plot/plot_test2.py:61\u0060 calls \u0060line_interval\u0060, \u0060plot\u0060 and \u0060DisperPicker/plot/plot_test2.py:43\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":"DisperPicker/plot/plot_test2.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a169ede3c6870fa39ec427c4c5aa31e7c3e348d32364a80305218582f799648b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): DisperPicker/plot/plot_train.py:79-87 | DisperPicker/plot/plot_train.py:159-167 \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":"DisperPicker/plot/plot_train.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0bcc2ba7aca8684eefa17e4657b49894a3e480638e7e74e5666b08afe89c9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): DisperPicker/plot/plot_test_all.py:41-58 | DisperPicker/plot/plot_test_all.py:107-120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"DisperPicker/plot/plot_test_all.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"882fe4ba467be064ea3b10c2e1fda9e1d880b7fd42bc07f3e4064bb45c718914"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): DisperPicker/plot/plot_test_all.py:60-76 | DisperPicker/plot/plot_test_all.py:122-138 \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":"DisperPicker/plot/plot_test_all.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5193ce215e805dcbffd17bee34e1d8d55aa83922c6733826c874d3ce0da5b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): DisperPicker/plot/plot_test_all.py:53-58 | DisperPicker/plot/plot_test_all.py:71-76 | DisperPicker/plot/plot_test_all.py:115-120 | DisperPicker/plot/plot_test_all.py:133-138 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"DisperPicker/plot/plot_test_all.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b614f2071300df3af3d7cbf6754c5b433e901231037d20710385a9160895cb20"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: (root): (root): abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"51ca5f5bba3ac7cbb4b8e1f651f219f376cded51fec13491755cad3ccdd7168a"}},{"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":"f8971d119a6ac3d549e306343a439e14d2985b3b35822d817e11bd0bb0b7c6bc"},"properties":{"dependency":{"package":"geopy","version":"2.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4218"],"severity":"medium","fixedVersion":"2.5.0","relation":"direct","declaredRange":"2.2.0","reachability":{"kind":"production","file":"EGFAnalysisTimeFreq.py","line":15}}}},{"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":"ba06fb2a4ba368e7257aeccf178f4a2b6710abdd7e3f113449aa51e8a80ad30e"},"properties":{"dependency":{"package":"numpy","version":"1.19.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2021-854","PYSEC-2021-855","PYSEC-2021-856"],"severity":"medium","fixedVersion":"1.21","relation":"direct","declaredRange":"1.19.0","reachability":{"kind":"production","file":"DisperPicker/pick.py","line":14}}}},{"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":"06a1d352673ae3364face1ae497e1c9c88127fb9a35427d185b9a4cd4e0f1e38"},"properties":{"dependency":{"package":"scipy","version":"1.5.2","advisory":"PYSEC-2023-102","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2023-114"],"severity":"medium","fixedVersion":"1.10.0","relation":"direct","declaredRange":"1.5.2","reachability":{"kind":"production","file":"EGFAnalysisTimeFreq.py","line":8}}}},{"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: Production code is mixed at the repository root with everything else the repository holds, so nothing marks which files are the product."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"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 \u2014 this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 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":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060requirements.txt\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"requirements.txt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea225f8356846d84bbfadf416ac2ef55b5c7044e420f90a9d544ca3d435c540"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 85 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"EGFAnalysisTimeFreq.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d645a017920fb2b684929012afd8e71d2964b89947b81f5fac0277eafe863527"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 105 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"EGFAnalysisTimeFreq.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62441d3e9ec140efb12faa9dd0d00d99967885274356beb2e423b19b64a3bc3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 106 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"EGFAnalysisTimeFreq.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9930b7a06e37fcdde398224ec2a334f30fd893c5c76b39c21da020c7f771b1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 114 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"EGFAnalysisTimeFreq.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c38b47eb920489ebd89948b817a299f8041ed364219b0e0bf0ffe74bbe51521"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 151 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"EGFAnalysisTimeFreq.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d26e0acbf899aa8d7a32fa7cf334aeae6c1891c8e8d5372455b8d767361835"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 174 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"EGFAnalysisTimeFreq.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d051222833927ae30e920a40f1ccd9c50d156a86102bb659c2964719098b4e96"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 744 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"EGFAnalysisTimeFreq.py"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffe2ee4d082c815a5984964419852eebaddc6b7dd8ebcda36212cb9ed18b18d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 846 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"EGFAnalysisTimeFreq.py"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf8564d5fc53877517ac99d26ad2d89f022dda4607ac55023fd75b125704938"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 866 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"EGFAnalysisTimeFreq.py"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1056993b2c7148295941a06a69badf20eea67935bfc9552ad5692ae873a170"}}],"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-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]}],"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":3,"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."]}]}