{"$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":"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":"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"]}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"]}}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Sync.run (cyclomatic 27): Sync.run has cyclomatic complexity 27 (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":"tools/Propulsion.Tool/Sync.fs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1a67d345511829dcc68daeb868ead55c2a99e6acfd923770b4924da78ba068"}},{"ruleId":"D1","level":"warning","message":{"text":"FeedMonitor.AwaitCompletion (cyclomatic 23): FeedMonitor.AwaitCompletion has cyclomatic complexity 23 (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/Propulsion/Feed/FeedMonitor.fs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c075fc5e79934f7c962500b084dd64fbaca1b3e611f79a6ac60d500de82c9f"}},{"ruleId":"D1","level":"warning","message":{"text":"Impl.materializeIndexEpochAsBatchesOfStreamEvents (cyclomatic 20): Impl.materializeIndexEpochAsBatchesOfStreamEvents has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Propulsion.DynamoStore/DynamoStoreSource.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"12223031d9b8d0c3f5f2cb0ec2ea89de221fa6da84c06338cc3b727c9a6df587"}},{"ruleId":"D1","level":"warning","message":{"text":"ChangeFeedProcessor.Start (cyclomatic 19): ChangeFeedProcessor.Start has cyclomatic complexity 19 (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/Propulsion.CosmosStore/ChangeFeedProcessor.fs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d868e6ceb6dc9218135659f5b6f394bb41dc67597c3c43ddc49d701424bdcc9e"}},{"ruleId":"D1","level":"warning","message":{"text":"Handler.parse (cyclomatic 18): Handler.parse has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Propulsion.DynamoStore.Indexer/Handler.fs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c77c38b55b013fe9f5ae234f79a0864314b36a0cdcc3ee2d5de99bd79106b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Handler.parse (cyclomatic 17): Handler.parse has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Propulsion.DynamoStore.Notifier/Handler.fs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"258b86a7820fe1477f6cb6598de1acd982ed605ae5570fcb97c85e0a4523ad02"}},{"ruleId":"D2","level":"warning","message":{"text":"Handler.parse (cognitive 46): Handler.parse has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 19, if/else 17, loops 6, boolean chains 3, error handling 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Propulsion.DynamoStore.Indexer/Handler.fs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c008abf7f5e4bbe844115386150d4fcb7e504134e53e6a4102edf25cbcb12a10"}},{"ruleId":"D2","level":"warning","message":{"text":"Handler.parse (cognitive 30): Handler.parse has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14, match/switch 12, boolean chains 2, error handling 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Propulsion.DynamoStore.Notifier/Handler.fs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6844393d102ab0d60eba42d7db1e022d7d4ab1cadb4cd926471243e90a917879"}},{"ruleId":"D2","level":"warning","message":{"text":"FeedMonitor.AwaitCompletion (cognitive 28): FeedMonitor.AwaitCompletion has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12, match/switch 11, boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Propulsion/Feed/FeedMonitor.fs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"180a1671e85f38c00eb08c05c053711a2d73eeb5e271c76e604ab7d5b2b7d337"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamQueue.insert (cognitive 28): StreamQueue.insert has cognitive complexity 28 (threshold 15). Drivers by points: if/else 26, loops 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":"src/Propulsion.DynamoStore/DynamoStoreIndex.fs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa76e84f1c9bac048f500321fe91661530e2763456e9ed7a0e37de87bec2ec5f"}},{"ruleId":"D2","level":"warning","message":{"text":"Impl.materializeIndexEpochAsBatchesOfStreamEvents (cognitive 25): Impl.materializeIndexEpochAsBatchesOfStreamEvents has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10, loops 7, match/switch 6, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Propulsion.DynamoStore/DynamoStoreSource.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e13e61c6d9b6312e76d2029035589653ae5409759596e656881cfda293550c"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine\u00604.Pump (cognitive 22): Engine\u00604.Pump has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18, boolean chains 2, error handling 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":"src/Propulsion/Streams.fs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea01edabdf06d3c2fdfcbc5dde30b866c70ba200e779fed2670e599a7e2f876f"}},{"ruleId":"D2","level":"warning","message":{"text":"Sync.run (cognitive 22): Sync.run has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 13, if/else 9 (nesting depth added 4). 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":"tools/Propulsion.Tool/Sync.fs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"99dd185be472f0827460aa069100b65335a2dcd6316aabb584db190ddcd29e08"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamStates\u00601.Dump (cognitive 19): StreamStates\u00601.Dump has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Propulsion/Streams.fs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a2291134a233775b12149655c840640cd6770224d4839d005601e2c8d42be8"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoryStoreMonitor.AwaitCompletion (cognitive 19): MemoryStoreMonitor.AwaitCompletion has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8, match/switch 5, boolean chains 4, loops 2 (nesting depth added 7). 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":"src/Propulsion.MemoryStore/MemoryStoreSource.fs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26b0a7a8015c5af5f323fdfe3467bd38c8dc3f81e522b37036d43148de6849b"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader.loadIndex (cognitive 18): Reader.loadIndex has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, loops 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Propulsion.DynamoStore/DynamoStoreIndex.fs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9265522fa0576fd6c80622c0cdeacbe3905368a47fd66c8e6d39cb7727c88c"}},{"ruleId":"D2","level":"warning","message":{"text":"Dynamo.dumpSummary (cognitive 18): Dynamo.dumpSummary has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, match/switch 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/Propulsion.Tool/Args.fs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"304651f5aa6c4186ae45f4342d7457cfffe0b9c6ed14cbf42a29a4f46bf20587"}},{"ruleId":"D2","level":"warning","message":{"text":"ProgressState\u00601.Dump (cognitive 17): ProgressState\u00601.Dump has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, match/switch 5, loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Propulsion/Streams.fs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"1106ab31b149a7094d4fcb2cd0151dc831bd5ff65ab4e68c3bff6f7b684fd47e"}},{"ruleId":"D2","level":"warning","message":{"text":"ChangeFeedProcessor.Start (cognitive 16): ChangeFeedProcessor.Start has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7, loops 4, error handling 3, if/else 2 (nesting depth added 1). 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":"src/Propulsion.CosmosStore/ChangeFeedProcessor.fs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4db327c5c9e23d1d864149845137801533450602715406957c21e404192809"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamState.combine (cognitive 16): StreamState.combine has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 3, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"src/Propulsion/Streams.fs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1efdbd17a163b3b7c27b80da3b18912c33291c4f5ec32484baf9e35790dd045"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Propulsion/Streams.fs: FileTooLong \u2014 1031 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":"src/Propulsion/Streams.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cf153856609a2d88bdff53d6ae95505dc561d0cbe593f10b20dc57ba0d9509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/Propulsion.CosmosStore/PropulsionCosmosStorePrometheus.fs:49-60 | src/Propulsion.Prometheus/FeedPrometheus.fs:45-56 \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. 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":"src/Propulsion.CosmosStore/PropulsionCosmosStorePrometheus.fs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8996e1dd0ab8cb4427c354206d25bbaa03ee6f2fb42b3d59615cd51bd8023c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Propulsion.EventStoreDb/EventStoreSource.fs:36-47 | src/Propulsion.SqlStreamStore/SqlStreamStoreSource.fs:31-41 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Propulsion.EventStoreDb/EventStoreSource.fs:36\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Propulsion.EventStoreDb/EventStoreSource.fs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b43b0ae2aadb8c243bc4e1334323dd0ef4c75672e873647bea5c5bb66a15eba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Propulsion.CosmosStore/PropulsionCosmosStorePrometheus.fs:39-46 | src/Propulsion.Prometheus/PropulsionPrometheus.fs:42-49 \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":"src/Propulsion.CosmosStore/PropulsionCosmosStorePrometheus.fs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8cf60700a377df80249bd4afa6f2445262d316257d7387bb4d001b5c8dcf3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/Propulsion.DynamoStore.Indexer/Function.fs:7-14 | src/Propulsion.DynamoStore.Notifier/Function.fs:5-12 \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. 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":"src/Propulsion.DynamoStore.Indexer/Function.fs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e249da413c05fb26c20af8ff874ef29a8e0bf7042751bf0e4ba076d8adce54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Propulsion.CosmosStore/CosmosStoreSink.fs:137-143 | src/Propulsion.EventStore/EventStoreSink.fs:95-101 \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":"src/Propulsion.CosmosStore/CosmosStoreSink.fs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43498b94ccda38088221e0ada2a1ae81aee1d9756bbd1667e38acf32cb927c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Propulsion.CosmosStore/CosmosStoreSink.fs:171-177 | src/Propulsion.EventStore/EventStoreSink.fs:121-127 \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":"src/Propulsion.CosmosStore/CosmosStoreSink.fs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e98448c774d9507130911bd4fd17d822e1fa8dabfa48b5f51375227c92655e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Propulsion/Pipeline.fs:53-59 | src/Propulsion/Pipeline.fs:89-95 \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":"src/Propulsion/Pipeline.fs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6694973ede45c60ac04a7f37cbf2175b81171efbdeb9958013b66496f6e2a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Propulsion.DynamoStore.Constructs/DynamoStoreIndexerLambda.fs:41-47 | src/Propulsion.DynamoStore.Constructs/DynamoStoreReactorLambda.fs:68-76 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Propulsion.DynamoStore.Constructs/DynamoStoreIndexerLambda.fs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"312e569a411d8562e21eb0c54b749affae021737c0e578c0e095d41e8269c21c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Propulsion.DynamoStore/DynamoStoreSource.fs:188-194 | src/Propulsion.MessageDb/MessageDbSource.fs:115-121 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Propulsion.DynamoStore/DynamoStoreSource.fs:188\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Propulsion.DynamoStore/DynamoStoreSource.fs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e6abe9de70e1f9b91fafe7dcf5ed42fdc0f35091469373066786ab25bafeca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Propulsion.CosmosStore/CosmosStoreSink.fs:44-49 | src/Propulsion.EventStore/EventStoreSink.fs:22-27 \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":"src/Propulsion.CosmosStore/CosmosStoreSink.fs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea653f8ebe5a4957f78b8a6c958f2e10480461eb0b836a98a46d5d05040a1f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Propulsion.CosmosStore/ReaderCheckpoint.fs:58-63 | src/Propulsion.EventStore/Checkpoint.fs:42-47 \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":"src/Propulsion.CosmosStore/ReaderCheckpoint.fs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"70be1503589f8bd00796f4532b79f5091bd50f5f7f0494a400a49aa9c510a0f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Propulsion.CosmosStore/ReaderCheckpoint.fs:113-118 | src/Propulsion.EventStore/Checkpoint.fs:85-90 \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":"src/Propulsion.CosmosStore/ReaderCheckpoint.fs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b60ec1f0fc8d18bacc2d234c25662e3b65e4476b50792e96c61bbce9421e65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Propulsion/Streams.fs:1254-1259 | src/Propulsion.Kafka/Consumers.fs:360-365 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Propulsion/Streams.fs:1254\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":"src/Propulsion/Streams.fs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b958db73d8eb6a4b666761da8532207d1d8354af6d59fa5c6180ebd4757367"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Propulsion.CosmosStore/FeedObserver.fs:19-23 | src/Propulsion/Feed/FeedReader.fs:23-27 \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. 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":"src/Propulsion.CosmosStore/FeedObserver.fs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"702f6b9b7c37052519c61f934f8ea5297ae1c5c5de347b72c4054bd8031f2b8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Propulsion/Streams.fs:1196-1200 | src/Propulsion/Streams.fs:1259-1263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/Propulsion/Streams.fs:1196\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Propulsion/Streams.fs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1bd9f6a188a7b1fc147b5cb18a58fdc7b4c3b53277625e490286fd7e5fceeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Propulsion.DynamoStore.Indexer/Handler.fs:8-12 | src/Propulsion.DynamoStore.Notifier/Handler.fs:20-24 \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":"src/Propulsion.DynamoStore.Indexer/Handler.fs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b88731f640d45e7ce5b63a3b4e137b68e6c59dd8b6a06351c345243d0771f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Propulsion.DynamoStore.Indexer/Handler.fs:16-20 | src/Propulsion.DynamoStore.Notifier/Handler.fs:27-33 \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":"src/Propulsion.DynamoStore.Indexer/Handler.fs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2887f6d973b3a3f7453d9692e7af22008bc6e30dab4369cf63de6b414a6a2aba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/Propulsion.Kafka/Consumers.fs:195-199 | src/Propulsion.Kafka/Consumers.fs:371-375 \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/Propulsion.Kafka/Consumers.fs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c28aa9ed6d2f839d7b5181795881d28d9f3bdfc232c0d55c44f4aa07ea0dde"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 test suite did not build: Coverage NOT MEASURED: this repository did not build in our analyzer environment (a C#/MSBuild compiler error), so no coverage could be collected. It is excluded from the score rather than counted as a near-zero defect. We did not read WHERE the failing diagnostic is, so this does not claim the fault is in your test code \u2014 a repository written for an older SDK band can compile for you and not for us. Run \u0060dotnet build\u0060 on this commit; if it succeeds, the gap is ours. Committing the Cobertura/OpenCover/lcov report your CI already produces also lets us measure real coverage without building anything."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D12","level":"error","message":{"text":"Vulnerable: Amazon.CDK.Lib: Amazon.CDK.Lib 2.26.0 \u2014 Low severity. https://github.com/advisories/[GHSA redacted]"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"36d71f5f734441e707c05108ab531f004f5831e97ec51e6d8054288f48f1e934"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: Microsoft.Data.SqlClient: Microsoft.Data.SqlClient 2.1.7 \u2014 Other"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"baceefaec10d73f1d1204cb973e189e0eb9316f97b6e6b0f9c58f7d7e051cb1b"}},{"ruleId":"D12","level":"warning","message":{"text":"Deprecated: SqlStreamStore: SqlStreamStore 1.2.0-beta.8 \u2014 Legacy"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8d4e409dcfd3ab3699c3a7780fbc5194bf7003766a99e47492e444d03fc1415f"}},{"ruleId":"D12","level":"warning","message":{"text":"Prerelease dependency: SqlStreamStore: SqlStreamStore resolves to 1.2.0-beta.8, a prerelease build. Prerelease packages carry no support policy, may change breaking between previews and can be unlisted \u2014 pin a stable release before shipping, or record the reason this preview is required."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6845be70bdc2ae298f57459877da0bbed268a404be5f27127ce0e58c306466ba"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 8 significant file(s) lose their only recent owner: src/Propulsion/Streams.fs, tools/Propulsion.Tool/Args.fs, tools/Propulsion.Tool/Sync.fs, src/Propulsion/Internal.fs, src/Propulsion/Pipeline.fs, src/Propulsion.MemoryStore/MemoryStoreSource.fs, tools/Propulsion.Tool/Infrastructure.fs, tools/Propulsion.Tool/Program.fs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"eedd137c3fd74ad3f814d9cc4db112cd44de1604555e68452972dd32babf1b39"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (9 single-owned of 57 analysed files in total, counted over production source files of roughly 100 lines or more, excluding tests, vendored, generated and example/demo trees, largest first). They are anonymized user #2 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D19","level":"note","message":{"text":"The overview mentions DynamoStore serverless support but does not link to the dedicated DynamoStore section or the Serverless pipeline subsection in the outline.: Link the \u0027Serverless event pipelines\u0027 section to the DynamoStore-specific components and the end-to-end system running only Lambda/DynamoDB."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9773d944b2d161d70b915867ca136a5e1cdb532ba19811b076bb84c057e2cd88"}},{"ruleId":"D19","level":"note","message":{"text":"The overview lists strong metrics support but does not mention or link to where Prometheus integration is documented.: Add a sentence noting that Feed Sources and Projectors provide comprehensive logging/metrics, with an external link to the Prometheus pluggable guide."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d87efc227b07bb43acca3a2edb92c8a92fa00afe2d60eb42d3fcf33dae27a5"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e70c524555fbc7c33eff51cdbc22b580298e72da2250b4f5744ec4c297defd0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1962c7f182fb21f2cea137f1d6a8d69c07af44cd8d3a437ac32df934078d7372"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9658270ba49f37ed04e99ab1263b6393cd42aed8bdfb7aafd9fa1070f5491895"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-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-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-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":7,"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."]}]}