{"$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":"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":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"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":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Nvim.start (cyclomatic 34): Nvim.start has cyclomatic complexity 34 (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":"neovim.fs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25ed6ed50f5499beda6f17e7446dc19021a037a293fa93448aaa26681fd0d83"}},{"ruleId":"D1","level":"warning","message":{"text":"getopt.parseOptions (cyclomatic 29): getopt.parseOptions has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"getopt.fs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d3f519d1835e108b6377bc968df30e53e7955ffb2435f253bd2cff828bc5d6"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelImpl.redraw (cyclomatic 25): ModelImpl.redraw has cyclomatic complexity 25 (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":"model.fs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31096002d9798c208426ff36fd6172f201fde39fcc71a948611c57b3e8ed997"}},{"ruleId":"D1","level":"warning","message":{"text":"model.Start (cyclomatic 20): model.Start has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"model.fs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba2551a3e0426f60be306a41614554a67dca9a21045e44c475e0401c152d1eb"}},{"ruleId":"D1","level":"warning","message":{"text":"input.onInput (cyclomatic 20): input.onInput has cyclomatic complexity 20 (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":"input.fs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"3292f0479326a190c6002f39f90280326990d4f98bf29f8df957e68b1950b9a4"}},{"ruleId":"D2","level":"warning","message":{"text":"getopt.parseOptions (cognitive 43): getopt.parseOptions has cognitive complexity 43 (threshold 15). Drivers by points: if/else 26, match/switch 14, boolean chains 3 (nesting depth added 13). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"getopt.fs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b510bcc13916fb4c0742bf8cd9f70f87111955025bcbf4a1d9b882dd2d76f9b"}},{"ruleId":"D2","level":"warning","message":{"text":"Nvim.start (cognitive 37): Nvim.start has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13, match/switch 13, error handling 8, boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"neovim.fs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b142ee6a29c33f7a3eca60d6bc47b4424c4eae74240f3dad5fe7a2b2fbf1ca"}},{"ruleId":"D2","level":"warning","message":{"text":"GridViewModel.FindTargetWidget (cognitive 26): GridViewModel.FindTargetWidget has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14, match/switch 10, boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ViewModels/GridViewModel.fs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a806f857c55cc45a6b35df29d4cd010527801ab7f513287e8db35bf80662a75"}},{"ruleId":"D2","level":"warning","message":{"text":"input.onInput (cognitive 25): input.onInput has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16, match/switch 6, loops 2, boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. 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":"input.fs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43c99d6b08c9798286147ea2d1d63a1f3c033d277115db5a133c2fcf9d7579a"}},{"ruleId":"D2","level":"warning","message":{"text":"Grid.Render (cognitive 23): Grid.Render has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, loops 6, boolean chains 2 (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":"Views/Grid.xaml.fs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea627feb7ee290f98a47a02f1ab0bd73faf649f992fac92b654b65482f441c9f"}},{"ruleId":"D2","level":"warning","message":{"text":"model.Start (cognitive 23): model.Start has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15, match/switch 6, boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"model.fs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9aecbedbce1d7c09930d135320391849c550ad60ace9be89c46269317f59fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor.Render (cognitive 18): Cursor.Render has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, error handling 3, match/switch 2 (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":"Views/Cursor.xaml.fs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ad294b1fc6ed9ba60f72d05516f9ff0485e2f42bab6bf615f35f5762101a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"ui.RenderText (cognitive 18): ui.RenderText has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 4, match/switch 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui.fs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90ef47367ff9f6b1f2879b46701962ebf6771a228916a6931ceb1612f15805f"}},{"ruleId":"D2","level":"warning","message":{"text":"GridViewModel.CursorConfig (cognitive 16): GridViewModel.CursorConfig has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 3, match/switch 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ViewModels/GridViewModel.fs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"601e7931373055277cc4d257badb65ded467580011d48fbcd28b587b4d8d57f2"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelImpl.redraw (cognitive 16): ModelImpl.redraw has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, loops 3, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. 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":"model.fs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0b639c1dcde5fb0fef7b10467d48bbe070617cc97b49c5e3e04da86808d302"}},{"ruleId":"D2","level":"warning","message":{"text":"def.|Rune|_| (cognitive 16): def.|Rune|_| has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 3, boolean chains 1, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. 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":"def.fs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e9bfaecc888294f21ea9f245f873c1a26306e7c5cbe57a319be78e4e53109d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: def: TooManyMethods \u2014 48 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"def.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdca2ecb0162ca608ab80267506f4a075b4affb262e4fcfaf6da5cfddff3ec72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ViewModels/GridViewModel.fs: FileTooLong \u2014 740 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ViewModels/GridViewModel.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b5a4e89130706cfc1d446694ab6d21708d9563968ef375e15369aa44745714"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./def.fs: FileTooLong \u2014 650 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"def.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c9cc52965210c6f3225117800448708ed1844bc9a16ce726272da8c36eab4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./wcwidth.fs: FileTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wcwidth.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26de019529fb3348e8efeb031c6802f2235a6a4ce60cb65889bcd9add4946b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: common: TooManyMethods \u2014 34 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"292054d125dc36a0c23290cdc94945617273d9223885af688036075d05f66548"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./model.fs: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"model.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99442511427fba09bfc0a349499d47e145714f2b4540df72eec2489401439e3d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GridViewModel: TooManyMethods \u2014 33 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ViewModels/GridViewModel.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4105a483ab3c07931eeaf0362751897d14887ecc8b574388ff290b23ba7443c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): common.fs:65-71 | common.fs:75-81 \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":"common.fs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"201a84679cc8ed1ac0ae6a8ebc7b2ab0d5e6d1b76173e6a97b6b14b8eae32499"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): def.fs:475-481 | def.fs:486-492 \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":"def.fs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"4450d1cc653f9b77d40d9b010e6550800ffd391beeecd3d3acb370a800af8ff5"}},{"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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3132564c6310e5d01a231f252a02d5d2f5a542c0a8fa29a14c89693f1e3df871"}},{"ruleId":"D9","level":"note","message":{"text":"No tests found: No test suite could be collected \u2014 nothing here references a test framework (Expecto, or xUnit/NUnit through FsUnit or Unquote), so there were no discoverable tests to count. 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":"D16","level":"warning","message":{"text":"dormant codebase \u2014 no living knowledge left to concentrate: All 24 significant source file(s) were last meaningfully changed so long ago that no living knowledge remains \u2014 nothing since has been substantial enough to re-establish ownership (a broad, mechanical sweep that touches many files shallowly does not count, and neither does no activity at all). There is no concentration to measure, so the bus factor is not scored. This is not a clean bill: nobody currently holds working knowledge of this code (see D34 Knowledge Freshness)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"569d55ea5cb0330f13c125b289d07e5abdfcceac947a2c2645277937942e7d5f"}},{"ruleId":"D34","level":"note","message":{"text":"Dormant codebase: 24 of 24 significant files have no living knowledge \u2014 the codebase as a whole is dormant, not 24 separate risks. Re-engage owners or document before change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4c69f1e54b7dd6fe9029dd02df6ba8f8145b789f2f18dbdaa086c40ded49dba6"}},{"ruleId":"D34","level":"note","message":{"text":"Largest orphaned file: One of the largest files with no living knowledge remaining \u2014 a reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ViewModels/GridViewModel.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cff6ab767bec23ccc512055cc5fd9281494818af7d36c5d69def5338b62b347"}},{"ruleId":"D34","level":"note","message":{"text":"Largest orphaned file: One of the largest files with no living knowledge remaining \u2014 a reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wcwidth.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"150d60be45c0343700f9dbd8767f1d510bf7dd07f529e0e76d61dee30ce15a04"}},{"ruleId":"D34","level":"note","message":{"text":"Largest orphaned file: One of the largest files with no living knowledge remaining \u2014 a reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"def.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc5ff8c29d51edc995e0aea12ca77dcfe1204bf609562d55ac523f966d41e14"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}}],"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-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-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":3,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}