{"$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":"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":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"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":"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":"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":"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":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X31","name":"Test-only surface in a production module","shortDescription":{"text":"Test-only surface in a production module"},"helpUri":"https://codehealth.canine.dev/dimensions/X31"},{"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":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"jhn_cbor.do_encode (cyclomatic 81): jhn_cbor.do_encode has cyclomatic complexity 81 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_cbor.erl"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dad96bea06dac7c5d7ebdcdb69a8ccbbc3849a58cd1c7409ff2d5894130cc4"}},{"ruleId":"D1","level":"warning","message":{"text":"jhn_syslog.recv (cyclomatic 52): jhn_syslog.recv has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_syslog.erl"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"866f11c618bff968dcb07ad0e682b6bfaa795deafccad70c260ea133a79865bf"}},{"ruleId":"D1","level":"warning","message":{"text":"jhn_msgpack.encode_integer (cyclomatic 41): jhn_msgpack.encode_integer has cyclomatic complexity 41 (threshold 15). To reduce it, name the conditions \u2014 but note WHERE they are: these tests sit in guard sequences, and a guard is a restricted expression sublanguage that allows neither binding a local nor calling a function you wrote, so neither of those moves is available in place. Move the decision out of the guard instead: keep one clause with a permissive guard, compute the compound test in the body through named predicate functions, and dispatch on their result. Where the clauses genuinely differ by pattern rather than by test, keep the patterns and lift only the comma-conjunctions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_msgpack.erl"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"54888a08eb69d9d93f56263e30447c4c3ffd8f0fba15db5ec47eafbf3741100c"}},{"ruleId":"D1","level":"warning","message":{"text":"jhn_syslog.open (cyclomatic 38): jhn_syslog.open has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_syslog.erl"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec54d7e6494bae2258b64b4e773030697eab5b9b03be829cde7e4cde8ad4905"}},{"ruleId":"D1","level":"warning","message":{"text":"jhn_syslog.accept (cyclomatic 29): jhn_syslog.accept has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_syslog.erl"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a3bab6cb1cbfbadc109783e42bc4db63f4ce98c464d1a3383bad0857f89be6"}},{"ruleId":"D1","level":"warning","message":{"text":"jhn_json.number (cyclomatic 25): jhn_json.number has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions \u2014 but note WHERE they are: these tests sit in guard sequences, and a guard is a restricted expression sublanguage that allows neither binding a local nor calling a function you wrote, so neither of those moves is available in place. Move the decision out of the guard instead: keep one clause with a permissive guard, compute the compound test in the body through named predicate functions, and dispatch on their result. Where the clauses genuinely differ by pattern rather than by test, keep the patterns and lift only the comma-conjunctions. This is NOT this file\u0027s highest cyclomatic complexity: jhn_json.escape (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_json.erl"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6faa5b495741777f76d70aa90e4115346b11b368ec60c63f467d059acd6998"}},{"ruleId":"D1","level":"warning","message":{"text":"jhn_shttpc.recv (cyclomatic 18): jhn_shttpc.recv has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: jhn_shttpc.validate (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_shttpc.erl"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"061c434d37bb384c59b8fcf27db4df0bd9fcd01ceb11abe91ca288d7967eeb4d"}},{"ruleId":"D1","level":"warning","message":{"text":"jhn_uri.decode_scheme (cyclomatic 17): jhn_uri.decode_scheme has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: jhn_uri.unhex (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_uri.erl"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0087dc04fc02cd79cece35a1d4950d176c10d953c11459524cd2b692a2e44d3"}},{"ruleId":"D2","level":"warning","message":{"text":"jhn_syslog.recv (cognitive 116): jhn_syslog.recv has cognitive complexity 116 (threshold 15). Drivers by points: match/switch 38 (76 pts), error handling 14 (40 pts) (nesting depth added 64). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/jhn_syslog.erl holds 3 of the 6 functions over the threshold \u2014 including the worst \u2014 and 167 of the 181 points over it (92%), 23.9\u00D7 the next-largest file (src/jhn_cbor.erl at 7). 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":"src/jhn_syslog.erl"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"75767ca3829cffc151ee3d7902a74e6f660be44ca07549e6b6ad6ab81fabce15"}},{"ruleId":"D2","level":"warning","message":{"text":"jhn_syslog.accept (cognitive 49): jhn_syslog.accept has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 23 (37 pts), error handling 6 (12 pts) (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/jhn_syslog.erl holds 3 of the 6 functions over the threshold \u2014 including the worst \u2014 and 167 of the 181 points over it (92%), 23.9\u00D7 the next-largest file (src/jhn_cbor.erl at 7). 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":"src/jhn_syslog.erl"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc843a4b1f06526ad5672b242f5879beefdc2da5c78fde83e6c31cab61cfa79"}},{"ruleId":"D2","level":"warning","message":{"text":"jhn_syslog.open (cognitive 47): jhn_syslog.open has cognitive complexity 47 (threshold 15). Drivers by points: match/switch 27 (36 pts), error handling 6 (11 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: src/jhn_syslog.erl holds 3 of the 6 functions over the threshold \u2014 including the worst \u2014 and 167 of the 181 points over it (92%), 23.9\u00D7 the next-largest file (src/jhn_cbor.erl at 7). 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":"src/jhn_syslog.erl"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fd827d48348bbbcb49b7e7dce27ec8fa7e472706380e9ce0679ee15a23d48e"}},{"ruleId":"D2","level":"warning","message":{"text":"jhn_cbor.do_encode (cognitive 22): jhn_cbor.do_encode has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 13, loops 5, match/switch 4. To reduce it, name the conditions \u2014 but note WHERE they are: these tests sit in guard sequences, and a guard is a restricted expression sublanguage that allows neither binding a local nor calling a function you wrote, so neither of those moves is available in place. Move the decision out of the guard instead: keep one clause with a permissive guard, compute the compound test in the body through named predicate functions, and dispatch on their result. Where the clauses genuinely differ by pattern rather than by test, keep the patterns and lift only the comma-conjunctions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_cbor.erl"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5f3162033bb499617800d81a07af74ceb7bf99f9e5849925775556d5f705f5"}},{"ruleId":"D2","level":"warning","message":{"text":"jhn_msgpack.encode_integer (cognitive 20): jhn_msgpack.encode_integer has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 20. To reduce it, name the conditions \u2014 but note WHERE they are: these tests sit in guard sequences, and a guard is a restricted expression sublanguage that allows neither binding a local nor calling a function you wrote, so neither of those moves is available in place. Move the decision out of the guard instead: keep one clause with a permissive guard, compute the compound test in the body through named predicate functions, and dispatch on their result. Where the clauses genuinely differ by pattern rather than by test, keep the patterns and lift only the comma-conjunctions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_msgpack.erl"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f186060b0fa18df20650a82da47f9b6fa60769f0ebdbbe9937b9e732db11b735"}},{"ruleId":"D2","level":"warning","message":{"text":"jhn_uri.do_encode (cognitive 17): jhn_uri.do_encode has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 17. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_uri.erl"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceeacd7281a4936981aff056ebbd24d5649e71a103cb6279645719a1a7578e00"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: jhn_t_tree: TooManyFunctions \u2014 57 functions. The bar is 30 functions; this is 27 over it, 1.90\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_t_tree.erl"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5254fc6ce7c32605d13c2800db9c444e767e5c4b3721d686218310208c511d89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/jhn_syslog.erl: FileTooLong \u2014 915 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 53 functions. The bar is 500 significant lines; this is 415 over it, 1.83\u00D7 the bar. In this language a module is exactly one source file, so its length cannot be moved into sibling files of the same module. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no one module has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_syslog.erl"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5a4a7bcc6af2a86dfa7e1e2268c5a2f0285c3dc363523af2f5ae1bc23373be"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: jhn_bstring: TooManyFunctions \u2014 53 functions. The bar is 30 functions; this is 23 over it, 1.77\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_bstring.erl"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0886a309c549cd39baeab9d0929f721fe14b9c062ee4acd6a83d8ad917d728"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/jhn_json.erl: FileTooLong \u2014 851 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 89 functions. The bar is 500 significant lines; this is 351 over it, 1.70\u00D7 the bar. In this language a module is exactly one source file, so its length cannot be moved into sibling files of the same module. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no one module has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_json.erl"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15134c12eda1629e833e67f180b5da0e5191e303b283a9fe5eb96f4957ce078"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: jhn_shadow: TooManyFunctions \u2014 45 functions. The bar is 30 functions; this is 15 over it, 1.50\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_shadow.erl"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffa1bcabb8709b93603963e26a0f8cbb3eab7b11241df5ff81f97016c573ba9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/jhn_shttpc.erl: FileTooLong \u2014 700 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 70 functions. The bar is 500 significant lines; this is 200 over it, 1.40\u00D7 the bar. In this language a module is exactly one source file, so its length cannot be moved into sibling files of the same module. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no one module has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_shttpc.erl"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ba212dc2d7082f1a42c7562bd51db3be74492bbab496d48bde6cda44665159"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: jhn_server: TooManyFunctions \u2014 38 functions. The bar is 30 functions; this is 8 over it, 1.27\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_server.erl"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0ecc5dfd9f639d8c37134875fabe5f100eb8baa9ae47cbd1f122838c2d6548"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: jhn_ip_addr: TooManyFunctions \u2014 37 functions. The bar is 30 functions; this is 7 over it, 1.23\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_ip_addr.erl"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d9b63f0b58729a15f3e4d65c8ebe8ac8fdf456b023110879fd9227eb0086e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/jhn_blist.erl: FileTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 113 functions. The bar is 500 significant lines; this is 95 over it, 1.19\u00D7 the bar. In this language a module is exactly one source file, so its length cannot be moved into sibling files of the same module. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no one module has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_blist.erl"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbe18c31b72a80297e35482d087fae529197cbff6f0e56b56419cc184d601d3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: jhn_hpack: TooManyFunctions \u2014 33 functions. The bar is 30 functions; this is 3 over it, 1.10\u00D7 the bar. The counted members are a module\u0027s functions \u2014 a module holds no instance state, so there is no shared data to group them by and no type to move them onto. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no single module carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_hpack.erl"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9834d9be33796cefcfa1edef105fdff812e2006a3d25aee200561bb1b9cbec29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/jhn_base.erl: FileTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 36 functions. The bar is 500 significant lines; this is 37 over it, 1.07\u00D7 the bar. In this language a module is exactly one source file, so its length cannot be moved into sibling files of the same module. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no one module has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_base.erl"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d797d87bedc79c77f45fe0216138144de490f72fe696f5226a45c02e201ad1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/jhn_timestamp.erl: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded), declaring 46 functions. The bar is 500 significant lines; this is 26 over it, 1.05\u00D7 the bar. In this language a module is exactly one source file, so its length cannot be moved into sibling files of the same module. To reduce it, extract each cohesive family of functions into a new module of its own and have this one delegate to it, so no one module has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_timestamp.erl"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8473839d4ad64f687cf06bed1537d1767cc4fa834c70fc57410c87a35bda165e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/jhn_syslog.erl:621-643 | src/jhn_syslog.erl:733-755 \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":"src/jhn_syslog.erl"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2593a69267a7235d166423e9593988271992744cc9bc47f3885cf6967b40518"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 6): src/jhn_syslog.erl:613-629 | src/jhn_syslog.erl:640-656 | src/jhn_syslog.erl:669-685 | src/jhn_syslog.erl:696-712 | src/jhn_syslog.erl:725-741 | src/jhn_syslog.erl:752-768 \u2014 all 6 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":"src/jhn_syslog.erl"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"4650f82c5cb8ae7ebc3e268598281a11675f82e3f2c738067f1d412847261e20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/jhn_syslog.erl:404-418 | src/jhn_syslog.erl:472-486 \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":"src/jhn_syslog.erl"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"6662847053df13bae4f9fb1cdd8f203a3bcdb95135104528da647639c05aa655"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/jhn_server.erl:761-771 | src/jhn_shadow.erl:668-678 \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":"src/jhn_server.erl"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9c802cf9c11334900150e70006e245622323073e42698bed9c401aaedffdb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/jhn_shadow.erl:209-219 | src/jhn_shadow.erl:232-242 \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":"src/jhn_shadow.erl"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2cfcf08a671633a6d2513d3ea9854e71ebe1becb8137f989439ee9fb0130d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/jhn_shttpc.erl:529-539 | src/jhn_shttpc.erl:562-572 \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":"src/jhn_shttpc.erl"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"40501d72650c415b0f148563b5cfae8ae09d2da0aebfd88249aa826a67ad41e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/jhn_blist.erl:433-440 | src/jhn_blist.erl:506-513 \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":"src/jhn_blist.erl"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eac121f22ff1deab2649ff46db0e3a39457cf55ff7c13d69f15e6ca55bd1a41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/jhn_t_tree.erl:321-327 | src/jhn_t_tree.erl:333-339 \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":"src/jhn_t_tree.erl"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d4cc697632e4724b409df109a2cb7e869589e24ee3233f66f48fd3641fc220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/jhn_blist.erl:479-484 | src/jhn_blist.erl:1096-1101 \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":"src/jhn_blist.erl"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"7152160b63d45f75205f8babe4afb90e7f21f1f873befe07a310b75eb46df33d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/jhn_p_tree.erl:164-168 | src/jhn_pb_tree.erl:164-168 \u2014 before extracting anything, compare \u0060src/jhn_p_tree.erl\u0060 and \u0060src/jhn_pb_tree.erl\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 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":"src/jhn_p_tree.erl"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3698555e4687ead4832b4f7207eacab2a6a54eb82c25cc5870facd0f01b61c49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/jhn_p_tree.erl:239-243 | src/jhn_pb_tree.erl:239-243 \u2014 before extracting anything, compare \u0060src/jhn_p_tree.erl\u0060 and \u0060src/jhn_pb_tree.erl\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 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":"src/jhn_p_tree.erl"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2d0377df1f79728cbde82ebf3b82da7ae51e40eeaf2863b05203477d4fc21e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/jhn_timestamp.erl:763-767 | src/jhn_timestamp.erl:769-773 | src/jhn_timestamp.erl:774-779 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_timestamp.erl"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"6576b8457b593422073a9789fee9a7ace73b53dd5a8a9e61429ecb0edbc1af20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/jhn_p_tree.erl:430-451 | src/jhn_pb_tree.erl:433-454 \u2014 before extracting anything, compare \u0060src/jhn_p_tree.erl\u0060 and \u0060src/jhn_pb_tree.erl\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 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":"src/jhn_p_tree.erl"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00e70a44b1e83edb52bd6eaa23aa43c87269e960721bdd885aab19ee7610acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/jhn_ip_addr.erl:392-404 | src/jhn_uri.erl:447-459 \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":"src/jhn_ip_addr.erl"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfa3fbd3218433a31578af9280f8cec2184f5adc840f42caa4cbb2599515961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/jhn_p_tree.erl:245-249 | src/jhn_pb_tree.erl:245-249 | src/jhn_r_tree.erl:230-234 \u2014 before extracting anything, compare \u0060src/jhn_p_tree.erl\u0060 and \u0060src/jhn_pb_tree.erl\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 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":"src/jhn_p_tree.erl"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c23c49b4853ff7819b610b7061829e0e1a13f251a59bfac3f294b3dcf9f1195"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: %% FIXME \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060% REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/jhn_json.erl"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efaa7ae23a647ebc81e9f61cbd5bab5353029ab691ccb1743ac946eaa9531d5"}},{"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":"M4","level":"note","message":{"text":"README/code drift: CBOR/HPACK/JSON modules present but README omits CBOR (jhn_cbor) and HPACK (jhn_hpack) \u2014 reported by the model that read the README against this repository; no term search was run for this one, so nothing here has been checked against the tree. Treat it as a reading to confirm, not as a measured contradiction: verify it against the code before acting on it, and if the footprint it describes does exist, this row is wrong."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c7182693c8ab2bde84fe57731d24a23cc3c7589634c0391bf9822d64b2eadf3b"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: snappy compression present but README omits snappy (jhn_snappy) \u2014 reported by the model that read the README against this repository; no term search was run for this one, so nothing here has been checked against the tree. Treat it as a reading to confirm, not as a measured contradiction: verify it against the code before acting on it, and if the footprint it describes does exist, this row is wrong."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e5f33ea7916dea0449cc726157b37804ed0b35022a606073270e805721c90201"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: RFC references in README contradict the absence of any RFC-4627 or other referenced projects \u2014 reported by the model that read the README against this repository; no term search was run for this one, so nothing here has been checked against the tree. Treat it as a reading to confirm, not as a measured contradiction: verify it against the code before acting on it, and if the footprint it describes does exist, this row is wrong."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7c291fff48a577e492f4b702589f2506b0dc2c21541d5fef3ec3c16ddd6fc408"}},{"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 dialyzer or elvis \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":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}}],"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-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-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-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":0,"secretScannerRunsExcluded":0}}}]}