{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"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":"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"]}],"properties":{"cwe":["CWE-506"]}},{"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":"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":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"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":"train_ppo.ppo_train_epoch (cyclomatic 29): train_ppo.ppo_train_epoch has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"trainer/train_ppo.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40c5fe68152d84aad8ec41dc77834070b044d9dc3d418cced7cf046d356f28e"}},{"ruleId":"D1","level":"warning","message":{"text":"train_agent.rl_train_epoch (cyclomatic 26): train_agent.rl_train_epoch has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"trainer/train_agent.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c629bc039974de510f2f1eeef1e35e47653c919c4ddb98521328fa713e523cb1"}},{"ruleId":"D1","level":"warning","message":{"text":"train_agent.calculate_rewards (cyclomatic 25): train_agent.calculate_rewards has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"trainer/train_agent.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5f4d17b13b2a729183d78cb741b26cfac42a597d3884d2414b1a5a265e2e58"}},{"ruleId":"D1","level":"warning","message":{"text":"train_grpo.grpo_train_epoch (cyclomatic 23): train_grpo.grpo_train_epoch 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":"trainer/train_grpo.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"165f1f76c347f5bd88b956ab74e8b87370fa4e74748a3b843645837a64ada461"}},{"ruleId":"D1","level":"warning","message":{"text":"train_distillation.train_epoch (cyclomatic 19): train_distillation.train_epoch 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":"trainer/train_distillation.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdddbc45f708da9b4074ab0cda9efdcc805f9feacccd1d527d7fc92952a6a475"}},{"ruleId":"D1","level":"warning","message":{"text":"MiniMindForCausalLM.generate (cyclomatic 18): MiniMindForCausalLM.generate 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":"model/model_minimind.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6689021529ef02773f546444782cfbfd8ec561caf6b0743d6bafcbc8cc080ca"}},{"ruleId":"D1","level":"warning","message":{"text":"web_demo.main (cyclomatic 18): web_demo.main has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/web_demo.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af7f580012bfb128f13584a7465a3974d930a18b2013ef7cadd0ad7a29ff293"}},{"ruleId":"D1","level":"warning","message":{"text":"eval_toolcall.chat_api (cyclomatic 16): eval_toolcall.chat_api 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":"scripts/eval_toolcall.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdd900d87936be78924c83cbcf0cfc3e8d42bceb781ab5ecdecf73ea981f0e3"}},{"ruleId":"D2","level":"warning","message":{"text":"train_ppo.ppo_train_epoch (cognitive 73): train_ppo.ppo_train_epoch has cognitive complexity 73 (threshold 15). Drivers by points: if/else 14 (42 pts), ternaries 5 (15 pts), loops 5 (11 pts), boolean chains 5 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"trainer/train_ppo.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fb6c1ee2164b0dd8a76758b56da737290c4a6a849a70c287e3778e59c1ee19"}},{"ruleId":"D2","level":"warning","message":{"text":"train_agent.calculate_rewards (cognitive 67): train_agent.calculate_rewards has cognitive complexity 67 (threshold 15). Drivers by points: ternaries 13 (36 pts), if/else 7 (19 pts), loops 3 (6 pts), error handling 1 (5 pts), boolean chains 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"trainer/train_agent.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8ca12a559f6eb1bc83feff3be39303a973d11d9b76896a542b64431d52e17a"}},{"ruleId":"D2","level":"warning","message":{"text":"train_agent.rl_train_epoch (cognitive 52): train_agent.rl_train_epoch has cognitive complexity 52 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 4 (10 pts), ternaries 4 (10 pts), boolean chains 7 (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":"trainer/train_agent.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f98d87faeb62af41ef0e41b00ae300c7269a9cff6709883fb2586cf6aac48cd"}},{"ruleId":"D2","level":"warning","message":{"text":"train_grpo.grpo_train_epoch (cognitive 44): train_grpo.grpo_train_epoch has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (8 pts), ternaries 3 (8 pts), boolean chains 7 (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":"trainer/train_grpo.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"346a396dfab56785f7610beff177558d1a214b30a9f71b337b358d9bcb20586b"}},{"ruleId":"D2","level":"warning","message":{"text":"eval_toolcall.chat_api (cognitive 42): eval_toolcall.chat_api has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 3 (8 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/eval_toolcall.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bcbfe1f8959cafbee9eeb6f0aee63d5b1806e9992e1ba2cea9685e73a30b68"}},{"ruleId":"D2","level":"warning","message":{"text":"trainer_utils.lm_checkpoint (cognitive 40): trainer_utils.lm_checkpoint has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 6 (17 pts), loops 1 (2 pts) (nesting depth added 23). 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":"trainer/trainer_utils.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4636c5381593321fd69e789be4cf76432f558abaa8739fccf3714d79f6f3b1f"}},{"ruleId":"D2","level":"warning","message":{"text":"train_distillation.train_epoch (cognitive 38): train_distillation.train_epoch has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 4 (13 pts), boolean chains 4, 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":"trainer/train_distillation.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"577c9363ce75fe6847e485e372197185ec0cab1647868b75459dd28b319d9b58"}},{"ruleId":"D2","level":"warning","message":{"text":"web_demo.main (cognitive 34): web_demo.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (11 pts), error handling 1 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/web_demo.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffb19e4cc82721655cce088ec658c92bfb2c631fcf9ed6156d07cd300153e8e"}},{"ruleId":"D2","level":"warning","message":{"text":"MiniMindForCausalLM.generate (cognitive 31): MiniMindForCausalLM.generate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 5 (9 pts), loops 2 (4 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":"model/model_minimind.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0a57a10e4732ffe408fa4c393cedaa5f376db18bc208710a0ae00298577d25"}},{"ruleId":"D2","level":"warning","message":{"text":"serve_openai_api.generate_stream_response (cognitive 31): serve_openai_api.generate_stream_response has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 1, error handling 1, loops 1, ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/serve_openai_api.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee1573b7fa3eec44bef6ac1b8e6a91ac8162a3ef84b34da5735538a72886486"}},{"ruleId":"D2","level":"warning","message":{"text":"train_agent.rollout_single (cognitive 26): train_agent.rollout_single has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 1 (4 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"trainer/train_agent.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b367d3cb776924bf8e702217369f72421e31611fc389f5a03ea15aefd3b913"}},{"ruleId":"D2","level":"warning","message":{"text":"train_full_sft.train_epoch (cognitive 25): train_full_sft.train_epoch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (9 pts), boolean chains 4, 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":"trainer/train_full_sft.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3578d45c7cdf7e3411fb444a52a3d474ef1dd50b9593c7ec55b1c77e2caa19cb"}},{"ruleId":"D2","level":"warning","message":{"text":"train_pretrain.train_epoch (cognitive 25): train_pretrain.train_epoch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (9 pts), boolean chains 4, 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":"trainer/train_pretrain.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3bb54f0590c1b6f5d595078b6df84b93e6aba2d81d410f02a00cc3a592e454"}},{"ruleId":"D2","level":"warning","message":{"text":"eval_toolcall.run_case (cognitive 24): eval_toolcall.run_case has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 7 (16 pts), if/else 3 (5 pts), 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":"scripts/eval_toolcall.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c28a9fce72a1b329d2800ea4d9290f1e69bf1ea483a3d57c5f26c2c13bb3c3"}},{"ruleId":"D2","level":"warning","message":{"text":"train_dpo.train_epoch (cognitive 22): train_dpo.train_epoch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (6 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"trainer/train_dpo.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"90711a5e08a836bc6f55a8b0730541db392d4b5b09abd88121c6ded5cf87a3e8"}},{"ruleId":"D2","level":"warning","message":{"text":"train_lora.train_epoch (cognitive 22): train_lora.train_epoch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (6 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"trainer/train_lora.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c4f80dbd4b2993af210f5fef87c0f9df64b28bdf46a1f4456ae530ce0e2d90"}},{"ruleId":"D2","level":"warning","message":{"text":"train_tokenizer.get_texts (cognitive 18): train_tokenizer.get_texts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 1 (3 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":"trainer/train_tokenizer.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59524d154aa9ea1d0cd9e841a200f6f38c2a867ebcd49090c31e739172a65ba"}},{"ruleId":"D2","level":"warning","message":{"text":"SFTDataset.generate_labels (cognitive 17): SFTDataset.generate_labels has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (7 pts), ternaries 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (DPODataset.generate_loss_mask) 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":"dataset/lm_dataset.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"661e222add6795ac47c7cf7d42639bfe45fd0bf1d28a0468ccc80d5d70ad6e29"}},{"ruleId":"D2","level":"warning","message":{"text":"DPODataset.generate_loss_mask (cognitive 17): DPODataset.generate_loss_mask has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (7 pts), ternaries 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (SFTDataset.generate_labels) 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":"dataset/lm_dataset.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ced057464044c0c24ded1ef6cebf943a6914b597a779a30f35f17b541069bd"}},{"ruleId":"D2","level":"warning","message":{"text":"train_grpo.calculate_rewards (cognitive 17): train_grpo.calculate_rewards has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (11 pts), if/else 1 (3 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"trainer/train_grpo.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a294d53a21885afba7527e742f6a55d91206d34cf1d18f341cdb60dc2a05562c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 30 shared lines): trainer/train_full_sft.py:25-72 | trainer/train_lora.py:26-67 | trainer/train_pretrain.py:25-71 \u2014 These 3 members are variants of one another: a block of 30 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":"trainer/train_full_sft.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe824b84079a2ec5ade45ffeac5bb84c4233150e32ba19e55c8e85af8f3c7c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (22 shared lines): trainer/train_distillation.py:40-134 | trainer/train_dpo.py:54-119 \u2014 These two members are variants of one another: 22 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":"trainer/train_distillation.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f167efe42248862a5d4a59b191cec27ba57f2533cd19e0b26b09a581d96d695a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): trainer/train_full_sft.py:27-41 | trainer/train_lora.py:28-42 | trainer/train_pretrain.py:27-41 \u2014 before extracting anything, compare \u0060trainer/train_full_sft.py\u0060 and \u0060trainer/train_lora.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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":"trainer/train_full_sft.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b90aef8a5e00e3cb714311f0a06d0e01778cfbaf2b7fccf05fe37e7e913d8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 4): trainer/train_distillation.py:93-104 | trainer/train_dpo.py:85-96 | trainer/train_full_sft.py:38-51 | trainer/train_pretrain.py:38-51 \u2014 before extracting anything, compare \u0060trainer/train_distillation.py\u0060 and \u0060trainer/train_dpo.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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":"trainer/train_distillation.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfbd832c70c43e6cc08abb930f9b35b9136b5942c444a28ccbf91a35b7a03c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201311 lines \u00D7 5): trainer/train_distillation.py:107-108 | trainer/train_dpo.py:99-100 | trainer/train_full_sft.py:44-54 | trainer/train_lora.py:44-53 | trainer/train_pretrain.py:44-54 \u2014 before extracting anything, compare \u0060trainer/train_distillation.py\u0060 and \u0060trainer/train_dpo.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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. 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":"trainer/train_distillation.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ded1860077d8cb1557802a9bf82fe744ba3922d3f63d8640bf0dfb8352037c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): trainer/train_grpo.py:58-68 | trainer/train_ppo.py:65-75 \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":"trainer/train_grpo.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"116ec3a0e02466157d574ada3feca8eb70346f4bfeb19cbe255f30e6ee34271e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): dataset/lm_dataset.py:93-102 | dataset/lm_dataset.py:182-191 \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":"dataset/lm_dataset.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d794f992cc677ec43a694f4b6b1d015a5442be2a2652fe1a61497f372c30a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): trainer/train_ppo.py:237-244 | trainer/train_ppo.py:247-254 \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":"trainer/train_ppo.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"260df22d3b77a64bef2f3e382a4643bb5016e00a7287cdab618dfd58a177ea0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): trainer/train_distillation.py:98-104 | trainer/train_dpo.py:90-96 | trainer/train_full_sft.py:44-51 | trainer/train_lora.py:44-50 | trainer/train_pretrain.py:44-51 \u2014 before extracting anything, compare \u0060trainer/train_distillation.py\u0060 and \u0060trainer/train_dpo.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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":"trainer/train_distillation.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"481cdf76eec2aa0f8affb643233e0eede132165af5eefa1979c447bfd41b0582"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): trainer/train_agent.py:316-322 | trainer/train_grpo.py:132-138 \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":"trainer/train_agent.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acac883e1734a79477e2ad4e707562142e002d562aebe762c8db9ce5a2d0c23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): trainer/train_agent.py:357-363 | trainer/train_grpo.py:189-193 \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 \u0060trainer/train_agent.py:357\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":"trainer/train_agent.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa0816d4989d9b8526eb7d5cb076d2f1517fd05e38773662c4d295fe148bd42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): dataset/lm_dataset.py:75-80 | dataset/lm_dataset.py:244-249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dataset/lm_dataset.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f97bd4d22bceeedfc5bc03ccb35dc59b7ec0e6449ac65b453ee27f83a4b4137"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/web_demo.py:178-183 | scripts/web_demo.py:192-197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"scripts/web_demo.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a5fe352db4989ae474a5cccde69bff24e4be8024bfc2261a0ecaec6cc0efce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): eval_llm.py:24-28 | scripts/serve_openai_api.py:41-45 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval_llm.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0414907b5a7427ac45e5807467085bbe91b03ad8f99691a6c2dbdfcd1ab053a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/convert_model.py:27-31 | scripts/convert_model.py:86-91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060scripts/convert_model.py:26\u0060 calls \u0060save_pretrained\u0060 and \u0060scripts/convert_model.py:85\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":"scripts/convert_model.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcf69e24d1eba6516a31a0e8b422c86d448c1c8be8a29957550211b39eaab9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): trainer/train_agent.py:309-313 | trainer/train_grpo.py:119-123 \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":"trainer/train_agent.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d12073c114a8776874b85a64bd5ce8e5835d36348b6f38ca081bd84dd08f3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): trainer/train_agent.py:329-333 | trainer/train_grpo.py:144-150 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"trainer/train_agent.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d81481ebe7f461bde86d343d8fce35f51d286c82f38b84ad500956872b2d67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): trainer/train_grpo.py:107-111 | trainer/train_ppo.py:103-107 \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":"trainer/train_grpo.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"727427a030581e3d5721bc1ff5508c66bf73b8884ad0c51377bd95314609aa0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/web_demo.py:307-313 | trainer/trainer_utils.py:57-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/web_demo.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d286a636971a17b53df4fea52ce4de9a319254b74199a3a03362db309d98d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): eval_llm.py:36-40 | scripts/eval_toolcall.py:206-210 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"eval_llm.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f202897460bd04dce26928544d0374075de8c56d0797885effe5357b97ff41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): trainer/train_distillation.py:122-129 | trainer/train_dpo.py:106-113 \u2014 before extracting anything, compare \u0060trainer/train_distillation.py\u0060 and \u0060trainer/train_dpo.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 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":"trainer/train_distillation.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"555eeecc0805b22ae28ec3b4a12fbddb3c4d870d80dc38cea3a8e631e12bb6a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): trainer/train_full_sft.py:57-61 | trainer/train_lora.py:56-60 | trainer/train_pretrain.py:57-61 \u2014 before extracting anything, compare \u0060trainer/train_full_sft.py\u0060 and \u0060trainer/train_lora.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 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":"trainer/train_full_sft.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc21e47b71ea4925f081a35d0f8997489e94c497ec2f994ea1061ace39cc326"}},{"ruleId":"D8","level":"error","message":{"text":"No automated tests: No automated tests \u2014 no test code was found in this repository. Untested code is the largest single risk to changing it safely. Start with the code you change most often: add a suite in a framework a runner can collect (pytest or unittest), and run it in CI so the gap cannot reopen."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3132564c6310e5d01a231f252a02d5d2f5a542c0a8fa29a14c89693f1e3df871"}},{"ruleId":"D9","level":"note","message":{"text":"No tests found: No test suite could be collected \u2014 no discoverable tests to count. If this repository does test, wiring the suite to a framework a runner can collect (pytest or unittest) is what makes it countable here; a pipeline step that invokes a runner is not evidence on its own, because a runner over an empty suite passes. Tests written as plain executables or shell/PowerShell harnesses are not collectible this way and are not scored here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9bf64cbb5a4ae13d6bcd01fa3bc8d2879d860c73bc67f176ee3c2cecb8adce3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: trainer/train_ppo.py: trainer/train_ppo.py changed 9 times in last 90 days, max cyclomatic complexity 29 in train_ppo.ppo_train_epoch at line 78. 4 of those changes were fix/bug commits, and the other 5 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-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 00:07:30 \u002B08:00\u0027 --until=\u00272026-09-23 00:07:30 \u002B08:00\u0027 --full-history --no-merges -- trainer/train_ppo.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":"trainer/train_ppo.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"545fbcb1f1ad9d357dbf2956411d1d9b4939a5f10e2b76a135a6a6571c7c67cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: trainer/train_agent.py: trainer/train_agent.py changed 8 times in last 90 days, max cyclomatic complexity 26 in train_agent.rl_train_epoch at line 242. 4 of those changes were fix/bug commits, and the other 4 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-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 00:07:30 \u002B08:00\u0027 --until=\u00272026-09-23 00:07:30 \u002B08:00\u0027 --full-history --no-merges -- trainer/train_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":"trainer/train_agent.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dad78295f2b13042a1b43a698005c3993a3cf95bc3a0328a319e807d15a0b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: trainer/train_grpo.py: trainer/train_grpo.py changed 7 times in last 90 days, max cyclomatic complexity 23 in train_grpo.grpo_train_epoch at line 71. 3 of those changes were fix/bug commits, and the other 4 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-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 00:07:30 \u002B08:00\u0027 --until=\u00272026-09-23 00:07:30 \u002B08:00\u0027 --full-history --no-merges -- trainer/train_grpo.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":"trainer/train_grpo.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9244eb0fe50da46aa998aa99d59fa02f7860d6f588720b86279f6a0b6cfe6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: model/model_minimind.py: model/model_minimind.py changed 5 times in last 90 days, max cyclomatic complexity 18 in MiniMindForCausalLM.generate at line 262. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 00:07:30 \u002B08:00\u0027 --until=\u00272026-09-23 00:07:30 \u002B08:00\u0027 --full-history --no-merges -- model/model_minimind.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":"model/model_minimind.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7ca2007d24fbb85afc33e50108f6ff14575f6860956d1db1306cc27d330e5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/web_demo.py: scripts/web_demo.py changed 2 times in last 90 days, max cyclomatic complexity 18 in web_demo.main at line 316. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 00:07:30 \u002B08:00\u0027 --until=\u00272026-09-23 00:07:30 \u002B08:00\u0027 --full-history --no-merges -- scripts/web_demo.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/web_demo.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"598ee4b9e066d14705e185ac4679a554e5e902fa733b64c69eb7d25a19bd7c92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: trainer/trainer_utils.py: trainer/trainer_utils.py changed 2 times in last 90 days, max cyclomatic complexity 15 in trainer_utils.lm_checkpoint at line 65. 1 of those changes was a fix/bug commit, and the other 1 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-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 00:07:30 \u002B08:00\u0027 --until=\u00272026-09-23 00:07:30 \u002B08:00\u0027 --full-history --no-merges -- trainer/trainer_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":"trainer/trainer_utils.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8618021de01c78da7e6f7580fede1e2c43929c2926fb5b1771dd3e346d116ebf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: eval_llm.py: eval_llm.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is eval_llm.main at line 32), 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: align LoRA inference paths with training output\u201D; \u201C[fix] unify Ctrl\u002BC handling\u201D; \u201Cfix: eval_llm.py Ctrl\u002BC \u9000\u51FA\u5F02\u5E38\u4FEE\u590D\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-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 00:07:30 \u002B08:00\u0027 --until=\u00272026-09-23 00:07:30 \u002B08:00\u0027 --full-history --no-merges -- eval_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":"eval_llm.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ba6f7d27b4bcfbb779b13791c65258a00955c3428c2fe0f3e58a093d35f490"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/serve_openai_api.py: scripts/serve_openai_api.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 14 (its worst body is serve_openai_api.generate_stream_response at line 105), 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: align LoRA inference paths with training output\u201D; \u201C[fix] serve_openai_api \u975E\u6D41\u5F0F\u7AEF\u70B9\u7684 max_tokens \u4E0D\u751F\u6548\uFF0C\u4E0E\u6D41\u5F0F\u7AEF\u70B9\u884C\u4E3A\u4E0D\u4E00\u81F4\u201D; \u201C[fix] robustness\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-06-25..2026-09-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-25 00:07:30 \u002B08:00\u0027 --until=\u00272026-09-23 00:07:30 \u002B08:00\u0027 --full-history --no-merges -- scripts/serve_openai_api.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/serve_openai_api.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca755044c2bb2832cb077d2191a80894553b615db1394b21a4a0a3d8536ffa00"}},{"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":"939e7820f308976365c3f6d3a26d247e0a2fde4c27ad5ab0258b6de69008b79c"}},{"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":"60d31a051760159631eaa9ba0e90c965120cf2c230f2b5ca78fdc144cd48fdda"}},{"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":"adbf44f8b4a6edb926d1a888cc8101a501c27c1d49346708aac7d67704aaf860"}},{"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":"5e293b69b9e9da82dd3ba81ef3f88e37ba0bdee0a8c1e99907817f561f377343"}},{"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":"957a1d60c8c2aeb14cbe5bd4f7929ed7e1f1f0656592db8d7bc16a50a50f9195"}},{"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":"9c4166bc67b9bc20b1458c020354ac9d41556126b68754c34a569b30a815717b"}},{"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":"31fe04f0d006c45853b37c692de14e085a04d91900c8d97d04b103b10d7663cf"}},{"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":"41c40677ebaf4bd83070e314f921f88ddad2e3d3a5df0e8b159f0136a6ff203a"}},{"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":"78834919ac9df11fc4c1e0e581d8dae587ec8e752d479cd9c80e4a3c464c34ff"}},{"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":"286f59eb3d1a9806a619444e8c9ae53d0ce8b92dc70c4ce99cbdc12d61458d91"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: train_grpo.py \u2194 train_ppo.py: \u0060trainer/train_grpo.py\u0060 and \u0060trainer/train_ppo.py\u0060 change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00601e6e909f\u0060 [update] trim redundant comments; \u00607a9137d2\u0060 [update] trim verbose ddp comments; \u006037ac206e\u0060 [perf] skip the per-forward RoPE buffer broadcast in the RL trainers \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"trainer/train_grpo.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f26c4403f650d740b25aa4f29672afb3b1774b5c3bb90a1b1d0358e96d65233"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M3","level":"note","message":{"text":"No src/ separation: Production code isn\u0027t grouped under a src/ folder \u2014 it\u0027s spread across several top-level directories, so there\u0027s no one place that says \u0027this is the product\u0027."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"M3","level":"note","message":{"text":"No tests/ separation: No test surface was found \u2014 this check walked the tree for authored source in the languages it models (\u0060.cs\u0060, \u0060.vb\u0060, \u0060.fs\u0060, \u0060.java\u0060, \u0060.kt\u0060, \u0060.scala\u0060, \u0060.py\u0060, \u0060.php\u0060, \u0060.rb\u0060, \u0060.ex\u0060, \u0060.exs\u0060, \u0060.go\u0060, \u0060.erl\u0060, \u0060.hrl\u0060, \u0060.swift\u0060, \u0060.dart\u0060, \u0060.rs\u0060, \u0060.ts\u0060, \u0060.tsx\u0060, \u0060.mts\u0060, \u0060.cts\u0060) and found none of it test-shaped. \u2605 \u0060.js\u0060, \u0060.jsx\u0060, \u0060.mjs\u0060 and \u0060.cjs\u0060 are NOT in that walk, so a Jest or Mocha suite written in plain JavaScript is invisible to it and this row is then wrong. If that is your case, say so rather than moving anything. Otherwise there are no tests here to separate from production code, so the folder question hasn\u0027t been reached yet."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"999e0c784909c76b6346a705ee63961fe363ed1cd6a94e3f80e2ebe7820ccd5d"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: README claims MiniMind-V and MiniMind-O vision while only minimind-v1-moe exists \u2014 searched for: \u0060MiniMind-V\u0060, \u0060MiniMind-O\u0060. Each was matched case- and separator-insensitively against file and directory NAMES anywhere in the tree, and against the CONTENTS of manifest files (package.json, *.csproj, *.props, *.slnx, *.yml, Dockerfile); the README\u0027s own prose never counts, so a claim is never refuted by merely being made. Nothing outside that search was read \u2014 a footprint living only in a submodule, in a file type not listed here, or under a name none of those terms matches is not seen, and this row is then wrong."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c746bfa7d62d9f4766d3643321405d95f2fb6d453f6ad4f103a33d49e91ebf4"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: claims dLM/diffusion model but no such branch exists \u2014 searched for: \u0060dLM\u0060, \u0060diffusion\u0060. Each was matched case- and separator-insensitively against file and directory NAMES anywhere in the tree, and against the CONTENTS of manifest files (package.json, *.csproj, *.props, *.slnx, *.yml, Dockerfile); the README\u0027s own prose never counts, so a claim is never refuted by merely being made. Nothing outside that search was read \u2014 a footprint living only in a submodule, in a file type not listed here, or under a name none of those terms matches is not seen, and this row is then wrong."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7cc4231661fba09cbe8e9b2d74a0f9498d1ca7d391fa46aa00c34d446ab7cad2"}},{"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"}}],"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":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"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":"SQL Injection","shortDescription":{"text":"SQL Injection"},"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":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":10,"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."]}]}