{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"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":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"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"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"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"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"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"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"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":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"schemas._combine_schemas_and_map_params (cyclomatic 62): schemas._combine_schemas_and_map_params has cyclomatic complexity 62 (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":"fastmcp_slim/fastmcp/utilities/openapi/schemas.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bce32c895bde927937a8a34f1d7bd1e66112d59c6e3bf078bb6512901098b1"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.run (cyclomatic 61): cli.run has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/cli.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"07dc3d64951a8b7b98d8031b11fe3078dc9a3d5f7e86ca86fabd0f5e79ff84f1"}},{"ruleId":"D1","level":"warning","message":{"text":"ParsedFunction.from_function (cyclomatic 49): ParsedFunction.from_function has cyclomatic complexity 49 (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":"fastmcp_slim/fastmcp/tools/function_parsing.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c693f79af6ff9b8ef65935959d1d68251f0e8c2f5eb46f3149151f157b098fd"}},{"ruleId":"D1","level":"warning","message":{"text":"formatters.format_description_with_responses (cyclomatic 48): formatters.format_description_with_responses has cyclomatic complexity 48 (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":"fastmcp_slim/fastmcp/utilities/openapi/formatters.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f991e58cabbe9070117b6c9e5d551ad2dc81864374534b299581eb9a7ff657e"}},{"ruleId":"D1","level":"warning","message":{"text":"OAuthProxy.load_access_token (cyclomatic 37): OAuthProxy.load_access_token has cyclomatic complexity 37 (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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbb205ccf852618d01cf48254395ba67b42cf75b3cc31431968fddadb640f58"}},{"ruleId":"D1","level":"warning","message":{"text":"RequestDirector.build (cyclomatic 37): RequestDirector.build has cyclomatic complexity 37 (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":"fastmcp_slim/fastmcp/utilities/openapi/director.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"331439f6c5d797b422dd3b53507d5e709ee2f004f467de48d0988e848cf36c9f"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionResourceTemplate.from_function (cyclomatic 35): FunctionResourceTemplate.from_function has cyclomatic complexity 35 (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":"fastmcp_slim/fastmcp/resources/template.py"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d53d72dde4a8cf26a4735a35b5593379be41ce1c9604b9242e54bb645d19301"}},{"ruleId":"D1","level":"warning","message":{"text":"schemas.extract_output_schema_from_responses (cyclomatic 34): schemas.extract_output_schema_from_responses has cyclomatic complexity 34 (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":"fastmcp_slim/fastmcp/utilities/openapi/schemas.py"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"170c6da65f8affcea7b99a7c46b3e19da41231ad68bb15230bd896a0b6f9a2c5"}},{"ruleId":"D1","level":"warning","message":{"text":"agentic_triage.finish (cyclomatic 33): agentic_triage.finish has cyclomatic complexity 33 (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":".github/agentic/flows/agentic_triage.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f969f34ca0d7e09b319aaa24b5837a41cab9de3b4670a2f72881a0bb5aa625"}},{"ruleId":"D1","level":"warning","message":{"text":"client.list_command (cyclomatic 33): client.list_command has cyclomatic complexity 33 (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":"fastmcp_slim/fastmcp/cli/client.py"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"854c43a1103983432a0f58e01f17d3b30348b60f48e9e108bef68fba70aad3f2"}},{"ruleId":"D1","level":"warning","message":{"text":"IdentityAssertionValidator.validate (cyclomatic 33): IdentityAssertionValidator.validate has cyclomatic complexity 33 (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":"fastmcp_slim/fastmcp/server/auth/identity_assertion.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"68560dbbbbb58e064e337852a278eebd17da1eaaaeeb092f03f1b5b06ba6c4cb"}},{"ruleId":"D1","level":"warning","message":{"text":"json_schema_type._convert_schema (cyclomatic 31): json_schema_type._convert_schema has cyclomatic complexity 31 (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":"fastmcp_slim/fastmcp/utilities/json_schema_type.py"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9a688e6243b53c8bc8754cbc6fd7d9d67d2e2e14566518db4996436ba9b490"}},{"ruleId":"D1","level":"warning","message":{"text":"formatters.generate_example_from_schema (cyclomatic 30): formatters.generate_example_from_schema has cyclomatic complexity 30 (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":"fastmcp_slim/fastmcp/utilities/openapi/formatters.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ccc1b9c6ad70a7147bfee514143981e2acfcc891cdc945c9a6936e1fdbc3a1"}},{"ruleId":"D1","level":"warning","message":{"text":"agentic_pr_verification.verify (cyclomatic 29): agentic_pr_verification.verify 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":".github/agentic/flows/agentic_pr_verification.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6912a16ae9641bab543abab669a020b8795020ecb781c5bfc07c2b44f4488bdc"}},{"ruleId":"D1","level":"warning","message":{"text":"elicitation.validate_elicitation_json_schema (cyclomatic 29): elicitation.validate_elicitation_json_schema has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/elicitation.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d219cf447f36504afb01a5b2af95a1731336fc325760ea90c34bd2a3afbe48"}},{"ruleId":"D1","level":"warning","message":{"text":"operations.render (cyclomatic 29): operations.render has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"status-site/operations.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86a79ccab92dddd22cb535575adea641205c53f5edbf2696c4c7da75e07114e"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAISamplingHandler._convert_to_openai_messages (cyclomatic 28): OpenAISamplingHandler._convert_to_openai_messages has cyclomatic complexity 28 (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":"fastmcp_slim/fastmcp/client/sampling/handlers/openai.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61d2cf6cafc424b00c2e4cd226abb35459c85f16bf3e64bbb278494adb0d7e3"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionPrompt.from_function (cyclomatic 28): FunctionPrompt.from_function has cyclomatic complexity 28 (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":"fastmcp_slim/fastmcp/prompts/function_prompt.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a113195265e93a2182e6fb49c0889ad2cea8f2d775f48a898c55a5f2713e117b"}},{"ruleId":"D1","level":"warning","message":{"text":"OIDCProxy.__init__ (cyclomatic 27): OIDCProxy.__init__ has cyclomatic complexity 27 (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":"fastmcp_slim/fastmcp/server/auth/oidc_proxy.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"1542accfb0e6f75116110722df4cd11ca472630b4689efd42ff8b8f6dcf6cb94"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformedTool._merge_schema_with_precedence (cyclomatic 27): TransformedTool._merge_schema_with_precedence has cyclomatic complexity 27 (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":"fastmcp_slim/fastmcp/tools/tool_transform.py"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba801437f01683fe02ec2b41ac5d24163ab4a715834e4921731b30f2ffe3207"}},{"ruleId":"D1","level":"warning","message":{"text":"json_schema_converter.convert_openapi_schema_to_json_schema (cyclomatic 27): json_schema_converter.convert_openapi_schema_to_json_schema has cyclomatic complexity 27 (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":"fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"296bcf985703ffa126faf50be85c2b0030152db613c4ddc024ab1f36fb3de806"}},{"ruleId":"D1","level":"warning","message":{"text":"json_schema_converter._needs_recursive_processing (cyclomatic 27): json_schema_converter._needs_recursive_processing has cyclomatic complexity 27 (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":"fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f3c352fa30aa6149e340338efb731df2a07ebb916d93a89ccacdf19a7917a0"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAPIParser.parse (cyclomatic 27): OpenAPIParser.parse has cyclomatic complexity 27 (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":"fastmcp_slim/fastmcp/utilities/openapi/parser.py"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"7434483686d8053575443ac6701e9d1dd5fa925dc84c43ed3e0e61f3ab557fdb"}},{"ruleId":"D1","level":"warning","message":{"text":"agentic_intake.route_intake (cyclomatic 26): agentic_intake.route_intake has cyclomatic complexity 26 (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":".github/agentic/flows/agentic_intake.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdcd7528a13c427954a406b56a58daa9b801efeda0edfd247a3e3c6b1b274c2"}},{"ruleId":"D1","level":"warning","message":{"text":"agentic_stack_controller.run_batch (cyclomatic 26): agentic_stack_controller.run_batch has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_stack_controller.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5101ee4ef3ae094359b375bb69ca5fcd6f58ea431855fb864e695ce5a7f7cb"}},{"ruleId":"D1","level":"warning","message":{"text":"OAuthProxy.exchange_authorization_code (cyclomatic 26): OAuthProxy.exchange_authorization_code has cyclomatic complexity 26 (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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3118b155b33c71dc00a08043bc73f64339848ed5f82d45f2abfc9576a93e74"}},{"ruleId":"D1","level":"warning","message":{"text":"app.refreshTriage (cyclomatic 26): app.refreshTriage has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"status-site/app.js"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"115ef5194d9db908bf718e4d86de85ec49812bf7e5cea1d3d166606df498592f"}},{"ruleId":"D1","level":"warning","message":{"text":"run.run_command (cyclomatic 25): run.run_command has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/run.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"137ae1a1144fad9f47e7dec9911dfd2018a261a6cdee8fa0ad01373b1f180c9f"}},{"ruleId":"D1","level":"warning","message":{"text":"OAuthProxy.__init__ (cyclomatic 25): OAuthProxy.__init__ has cyclomatic complexity 25 (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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec69745f5b2c44d5613886cfae3e436a0620ec715616e8c7015fc0697f3d171"}},{"ruleId":"D1","level":"warning","message":{"text":"dependencies.transform_context_annotations (cyclomatic 25): dependencies.transform_context_annotations has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/dependencies.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba0ef2904b016adb77ff03c834c5216e002bf18617414a354c930ea5afd063f"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformedTool.from_tool (cyclomatic 25): TransformedTool.from_tool has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/tools/tool_transform.py"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb64ada7293a5ee472e1b4cafa85e68a2d4e8e6d6e03e2c34ce4b750fc5796e"}},{"ruleId":"D1","level":"warning","message":{"text":"agentic_review_delivery.deliver_reviews (cyclomatic 24): agentic_review_delivery.deliver_reviews has cyclomatic complexity 24 (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":".github/agentic/flows/agentic_review_delivery.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d975654697f269c5d86226a5adc7d89fc4634da392bcac14845d13ddc7384d5a"}},{"ruleId":"D1","level":"warning","message":{"text":"agentic_review_publication.post_review (cyclomatic 24): agentic_review_publication.post_review has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_review_publication.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6812f98bfd9ab42d93b793f5e1616adc4badcc73fab9f99c894e36bdc8f6de7"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.inspect (cyclomatic 24): cli.inspect has cyclomatic complexity 24 (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":"fastmcp_slim/fastmcp/cli/cli.py"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"183f8e2ee484cbdca4411a1dc3ee0b5b347c95f2946c03c80e00463cfd31a912"}},{"ruleId":"D1","level":"warning","message":{"text":"ClerkTokenVerifier.verify_token (cyclomatic 24): ClerkTokenVerifier.verify_token has cyclomatic complexity 24 (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":"fastmcp_slim/fastmcp/server/auth/providers/clerk.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e4492ce3abece4e63d90f57b805637c052433d24aff769836c444c95cd2c07"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionTool.from_function (cyclomatic 24): FunctionTool.from_function has cyclomatic complexity 24 (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":"fastmcp_slim/fastmcp/tools/function_tool.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"154e46b3a66b30880b880d65182dcceb9b81793faa5d8a501b4f2cab65199ace"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect.inspect_fastmcp_v2 (cyclomatic 24): inspect.inspect_fastmcp_v2 has cyclomatic complexity 24 (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":"fastmcp_slim/fastmcp/utilities/inspect.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a156c9549d21a0fc8937a2b112beae9bbb19777488a1f6b610e7bbad36d6f03f"}},{"ruleId":"D1","level":"warning","message":{"text":"agentic_claims.drain_predecessor (cyclomatic 23): agentic_claims.drain_predecessor has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_claims.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b469bbb3b6d3925267bbfe992c07297cd49d81e304b85a9b719742312f91b058"}},{"ruleId":"D1","level":"warning","message":{"text":"apps_dev._model_from_schema (cyclomatic 23): apps_dev._model_from_schema has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/apps_dev.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e9b1206ece245ac9fcca11f0af21e047884f8e091480d40078189bba82e941"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiAuth.__init__ (cyclomatic 23): MultiAuth.__init__ has cyclomatic complexity 23 (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":"fastmcp_slim/fastmcp/server/auth/auth.py"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a2f547cb000b0e72353273b58aa1be20b096390ee76596b913d7dadd88c78d"}},{"ruleId":"D1","level":"warning","message":{"text":"ConsentMixin._submit_consent (cyclomatic 23): ConsentMixin._submit_consent has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78a7d0ea92c016373684887b7510455a321f84ae0c5859724a444d5a9a75526"}},{"ruleId":"D1","level":"warning","message":{"text":"OAuthProxy.exchange_refresh_token (cyclomatic 23): OAuthProxy.exchange_refresh_token has cyclomatic complexity 23 (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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"386c75bb9c9035c75e5df47331ba38e0b6939f4017834d869e7742278a31184f"}},{"ruleId":"D1","level":"warning","message":{"text":"IntrospectionTokenVerifier.verify_token (cyclomatic 23): IntrospectionTokenVerifier.verify_token has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/introspection.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad6ccac10c120893b9616d16c49c70a38f72b24dea7e5112b0f5cf8817a7c27"}},{"ruleId":"D1","level":"warning","message":{"text":"FastMCP.__init__ (cyclomatic 23): FastMCP.__init__ has cyclomatic complexity 23 (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":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70c2e9ca3ac11ee182d18faa7b5ce59858a2c0607a1f82f1ebe5b9ea83b9b9d"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.load_and_merge_config (cyclomatic 23): cli.load_and_merge_config has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/cli.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8caddfd9972347a7c2011608c81ac366c0350450951ef3d55ec03d0c1551810"}},{"ruleId":"D1","level":"warning","message":{"text":"RequestDirector._unflatten_arguments (cyclomatic 23): RequestDirector._unflatten_arguments has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/director.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1c16a8d361502882825f0ff2643c7c1767510868225a465f5aef1eafbc9b2b"}},{"ruleId":"D1","level":"warning","message":{"text":"agentic_pr_verification.pytest_result (cyclomatic 22): agentic_pr_verification.pytest_result has cyclomatic complexity 22 (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":".github/agentic/flows/agentic_pr_verification.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7cc580373d3d83388829e15208f852487d3f24015f508870e03de47c63ee35"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformedTool.run (cyclomatic 22): TransformedTool.run has cyclomatic complexity 22 (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":"fastmcp_slim/fastmcp/tools/tool_transform.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f74e8d62d7086b49a61e6191b11cc993180f2bfffb5ba602f4d825cb6a72ff"}},{"ruleId":"D1","level":"warning","message":{"text":"agentic_stack_runtime.judge (cyclomatic 21): agentic_stack_runtime.judge has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_stack_runtime.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e56db1a56a245bdeadc7e3ccc08190ab34c76c191f2449986ce473d2278d9e9"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.__init__ (cyclomatic 21): Client.__init__ has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/client.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da851322a5d1e94f1e88607a3acfdbee0130b12850eac6239120868ead74c17"}},{"ruleId":"D1","level":"warning","message":{"text":"tools._parse_call_tool_result (cyclomatic 21): tools._parse_call_tool_result has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/mixins/tools.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca7e7c45e06cf9aebb35c79fb5723b79c4fc0748ceb22dc38dfadc578f01b6d"}},{"ruleId":"D1","level":"warning","message":{"text":"CIMDFetcher.fetch (cyclomatic 21): CIMDFetcher.fetch has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/cimd.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"825c396ed2403a9178f53f91ec04b119825f927f5118c202c24aa521bbe31ec3"}},{"ruleId":"D1","level":"warning","message":{"text":"CIMDAssertionValidator.validate_assertion (cyclomatic 21): CIMDAssertionValidator.validate_assertion has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/cimd.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a2c3b1bd2545896aeb1425163eb08d96a1335f7146cdecfcf56f58074a3261"}},{"ruleId":"D1","level":"warning","message":{"text":"OAuthProxy.get_routes (cyclomatic 21): OAuthProxy.get_routes has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":2535}}}],"partialFingerprints":{"codehealthFindingId/v1":"55627fad7c5e9b5de772d9f2e407d73305108d6082767489ac3b07d296a23e85"}},{"ruleId":"D1","level":"warning","message":{"text":"OAuthProxy._handle_idp_callback (cyclomatic 21): OAuthProxy._handle_idp_callback has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":2747}}}],"partialFingerprints":{"codehealthFindingId/v1":"5439084bd6ee1bf1df8e4141d83a0a21433520c1ca9d63e93d231f937b66f851"}},{"ruleId":"D1","level":"warning","message":{"text":"GitHubTokenVerifier.verify_token (cyclomatic 21): GitHubTokenVerifier.verify_token has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/github.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c1ea975349142cf978c370069fe23e2ae07689e1b102b7b5f979e91d9f7e6e"}},{"ruleId":"D1","level":"warning","message":{"text":"filesystem_discovery.import_module_from_file (cyclomatic 21): filesystem_discovery.import_module_from_file has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"4150288966184db76da0d4147a13f513b0956663da29e747f47e97a9fabc2714"}},{"ruleId":"D1","level":"warning","message":{"text":"FastMCP.read_resource (cyclomatic 21): FastMCP.read_resource has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d94cbb3c30bbeff67608c68b93d8293dc77be07ffd5ebd58395700a87ea42c9"}},{"ruleId":"D1","level":"warning","message":{"text":"tool_transform._structural_kind (cyclomatic 21): tool_transform._structural_kind has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/tools/tool_transform.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e48afaeeb0dbe3bad1f1ca2562550109f1e0c666fb96ba68956a96757f56388"}},{"ruleId":"D1","level":"warning","message":{"text":"inspect.inspect_fastmcp_v1 (cyclomatic 21): inspect.inspect_fastmcp_v1 has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/inspect.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68ee2f590a49f8af8731842477f869fc1860b611b35fed0a288c766e22fccc3"}},{"ruleId":"D1","level":"warning","message":{"text":"json_schema_type._resolve_recursive_types (cyclomatic 21): json_schema_type._resolve_recursive_types has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema_type.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c185cb937e7384e2c14de199ffb572c766ba075972deedc6d4caf518bbd2db"}},{"ruleId":"D1","level":"warning","message":{"text":"schemas._replace_ref_with_defs (cyclomatic 21): schemas._replace_ref_with_defs has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/schemas.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccb9727fca09b2b54478de0d2c414cdad953463be8e1aef3432baf594d4464b"}},{"ruleId":"D1","level":"warning","message":{"text":"operations.ranking (cyclomatic 21): operations.ranking has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. 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":"status-site/operations.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7a582dbbcfb732e2088e8446ea9183339b5dcf3d92bf84b4e5ff7480b26aa0"}},{"ruleId":"D1","level":"warning","message":{"text":"shared.process_common_args (cyclomatic 20): shared.process_common_args has cyclomatic complexity 20 (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":"fastmcp_slim/fastmcp/cli/install/shared.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"121ad24e4bb0a8a5e3a5600a6c8d519cd9fa99f4a3eb059ca90e39c8c8d72bdc"}},{"ruleId":"D1","level":"warning","message":{"text":"GoogleTokenVerifier.verify_token (cyclomatic 20): GoogleTokenVerifier.verify_token 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":"fastmcp_slim/fastmcp/server/auth/providers/google.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b9a26780a0ded4f73d98827d498aac3f8e090f7f3370cc877552384eb5a863"}},{"ruleId":"D1","level":"warning","message":{"text":"json_schema_type._merge_defaults (cyclomatic 20): json_schema_type._merge_defaults has cyclomatic complexity 20 (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":"fastmcp_slim/fastmcp/utilities/json_schema_type.py"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0d13309ad2d9ad2c0062d8f08a61e57067d64a2c178afb2c85d0500671e59e"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAPIParser._extract_responses (cyclomatic 20): OpenAPIParser._extract_responses has cyclomatic complexity 20 (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":"fastmcp_slim/fastmcp/utilities/openapi/parser.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdef694c3b97d743e1df499f3b36b39d3c18c7608814d4eedc28266fb4e2e7f5"}},{"ruleId":"D1","level":"warning","message":{"text":"schemas._make_optional_parameter_nullable (cyclomatic 20): schemas._make_optional_parameter_nullable has cyclomatic complexity 20 (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":"fastmcp_slim/fastmcp/utilities/openapi/schemas.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28b6a91f38d377e96161a7a9410557bbf85013a50cacd05a38cab2fcbf50143"}},{"ruleId":"D1","level":"warning","message":{"text":"AnthropicSamplingHandler._convert_to_anthropic_messages (cyclomatic 19): AnthropicSamplingHandler._convert_to_anthropic_messages has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"419eb11ac60dfcecd116adda1149348d4869a28ba9a38511485b8f1a218a74d9"}},{"ruleId":"D1","level":"warning","message":{"text":"StdioTransport.connect (cyclomatic 19): StdioTransport.connect has cyclomatic complexity 19 (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":"fastmcp_slim/fastmcp/client/transports/stdio.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc09c0104735f061daf0f6be1c7c488b0412a2f7a38768b7f4d61e9a0708fe9e"}},{"ruleId":"D1","level":"warning","message":{"text":"ProxyDCRClient.validate_redirect_uri (cyclomatic 19): ProxyDCRClient.validate_redirect_uri has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/models.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7264b8847977d5edf656680965a8cb654c79bbde79e1ab8b8772218007f65bf"}},{"ruleId":"D1","level":"warning","message":{"text":"schemas._flatten_discriminator_subtypes (cyclomatic 19): schemas._flatten_discriminator_subtypes has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/schemas.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bde7b6ee507354a294c35a9a8921c9fe418915535933e15af681ff08b96cfe"}},{"ruleId":"D1","level":"warning","message":{"text":"app.backlog (cyclomatic 19): app.backlog has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 5 belong to 4 function items inside it that branch. 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":"status-site/app.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"820c22f5accc05b0bbc226eed701baa9cbedba8750da57c3846c3bff3181b8b2"}},{"ruleId":"D1","level":"warning","message":{"text":"agentic_native_triage.run_native_stage (cyclomatic 18): agentic_native_triage.run_native_stage has cyclomatic complexity 18 (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":".github/agentic/flows/agentic_native_triage.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e874063dc0d19f3ca288f270275f0e9f4fcd46cbd556d931b3cb8897ebd0943"}},{"ruleId":"D1","level":"warning","message":{"text":"agentic_stack_usage.usage_report (cyclomatic 18): agentic_stack_usage.usage_report has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_stack_usage.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7423fa1ce64413d29b30bcb8be598d5712ed6e1cc0bdfb465b61fbe5f4254384"}},{"ruleId":"D1","level":"warning","message":{"text":"PrivateKeyJWTClientAuthenticator.authenticate_request (cyclomatic 18): PrivateKeyJWTClientAuthenticator.authenticate_request has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/auth.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"087da938aa57d020a93b186d67e5a240f8c0da928ef79ebe43f7478e7ccecf3a"}},{"ruleId":"D1","level":"warning","message":{"text":"ssrf._ssrf_safe_fetch_response (cyclomatic 18): ssrf._ssrf_safe_fetch_response has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/ssrf.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecb41b0bd851a152beabb85cd72febd63dcc256b3d3d01793adf949ff5c2cd2"}},{"ruleId":"D1","level":"warning","message":{"text":"RequestDirector._serialize_query_params (cyclomatic 18): RequestDirector._serialize_query_params has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/director.py"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4d0a6479aca8881d64d2062efa3d0489b515616d807daf39eddb90ff6c4531"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAPIParser._resolve_ref (cyclomatic 18): OpenAPIParser._resolve_ref has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/parser.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3431bec5f5ddc4cc128f30af5cb3c711fdd70cd39b99d62bdae8172c7b5138a1"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAPIParser._extract_parameters (cyclomatic 18): OpenAPIParser._extract_parameters has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/parser.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37c9ca2b0b7feeb25a39979038fe6f96253c6ed7b4c21b529421ffdaebb5473"}},{"ruleId":"D1","level":"warning","message":{"text":"client.coerce_value (cyclomatic 17): client.coerce_value 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":"fastmcp_slim/fastmcp/cli/client.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d523b067097f5deaf646870d85d94ef505bdc6edf493117f3a59a98ef73714"}},{"ruleId":"D1","level":"warning","message":{"text":"generate._resolve_tool_param_flags (cyclomatic 17): generate._resolve_tool_param_flags 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":"fastmcp_slim/fastmcp/cli/generate.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"306b735896617c21a2c81e3de0ae237c7fd630c782cdc650388e207d109cacba"}},{"ruleId":"D1","level":"warning","message":{"text":"ConsentMixin._show_consent_page (cyclomatic 17): ConsentMixin._show_consent_page 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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"95857265ba7239fad4c3441c95fe1fc76aa641e321a5011cd5131cc6f856c59c"}},{"ruleId":"D1","level":"warning","message":{"text":"OAuthProxy.register_client (cyclomatic 17): OAuthProxy.register_client 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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80320a1afd3e1a92c4f2e882956a5308311f0cbaa8ec54f67772ba05964aac3"}},{"ruleId":"D1","level":"warning","message":{"text":"OAuthProxy.exchange_identity_assertion (cyclomatic 17): OAuthProxy.exchange_identity_assertion has cyclomatic complexity 17 (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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7b7c3111113b5ce98df4053b0e3ff87decaeb12c3fcc4ab884b5ffbe385d3a"}},{"ruleId":"D1","level":"warning","message":{"text":"JWTVerifier._refresh_jwks_key (cyclomatic 17): JWTVerifier._refresh_jwks_key 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":"fastmcp_slim/fastmcp/server/auth/providers/jwt.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"9741687a06c7a45e2a426f8edc8ebb4ce95cd4779e9ef173956587db949bb369"}},{"ruleId":"D1","level":"warning","message":{"text":"JWTVerifier.load_access_token (cyclomatic 17): JWTVerifier.load_access_token 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":"fastmcp_slim/fastmcp/server/auth/providers/jwt.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"369f791659a96f508f0d2b802cf976be251331351b1cb9e88e10833e703abdcb"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionsMixin._install_extension (cyclomatic 17): ExtensionsMixin._install_extension has cyclomatic complexity 17 (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":"fastmcp_slim/fastmcp/server/mixins/extensions.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6432db6d034406989856e65e053d15e41478742132127a28ad627432de54336c"}},{"ruleId":"D1","level":"warning","message":{"text":"prefab_synthesis._build_resource_for_tool (cyclomatic 17): prefab_synthesis._build_resource_for_tool 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":"fastmcp_slim/fastmcp/server/providers/prefab_synthesis.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee31263d121ad80ea8ad1280c8a0b6d31dff705ab0f1273860d003166f94112"}},{"ruleId":"D1","level":"warning","message":{"text":"FastMCP.call_tool (cyclomatic 17): FastMCP.call_tool 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":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c87658bfd90e1c014c88d04c15909fcecfbae8bb449ed91ee0c629ffa6df30a"}},{"ruleId":"D1","level":"warning","message":{"text":"SkillFrontmatter.validate_agent_skills_fields (cyclomatic 17): SkillFrontmatter.validate_agent_skills_fields has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/skills/models.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4bce981438cdeaa363b7835d1f01b5a0e1c01840ee2b3d7dd743e763995914"}},{"ruleId":"D1","level":"warning","message":{"text":"Tool.convert_result (cyclomatic 17): Tool.convert_result has cyclomatic complexity 17 (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":"fastmcp_slim/fastmcp/tools/base.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bbc9559b505f95389a7e56b27fac696dace1c5992969e468878651d21a7e39"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformedTool._create_forwarding_transform (cyclomatic 17): TransformedTool._create_forwarding_transform 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":"fastmcp_slim/fastmcp/tools/tool_transform.py"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf88dce4f2c5193ea25f0c862c51d66ec7947bd06dd9a5e8920f7b936039534b"}},{"ruleId":"D1","level":"warning","message":{"text":"agentic_backlog.inventory (cyclomatic 16): agentic_backlog.inventory has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_backlog.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd2447e6f53b3798b8d8c89a2ac5de959c16570a9dd56f64bcb734f64cb02a4"}},{"ruleId":"D1","level":"warning","message":{"text":"agentic_triage.admit (cyclomatic 16): agentic_triage.admit has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_triage.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dda9c49a6ce3300bf172cfaf0dc182915f95bee362053ff0bdd66cf149a41d"}},{"ruleId":"D1","level":"warning","message":{"text":"agentic_triage_nodes.triage_finalize (cyclomatic 16): agentic_triage_nodes.triage_finalize has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_triage_nodes.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c993079cca71aebb3dc260e74a18b16bd09ed197c9bfa53c5206922b29c66e1c"}},{"ruleId":"D1","level":"warning","message":{"text":"fastmcp.__getattr__ (cyclomatic 16): fastmcp.__getattr__ has cyclomatic complexity 16 (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":"fastmcp_slim/fastmcp/__init__.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4eb74f9203f6e152ba6bb967d76ce3f01b860ff5ee55296ba52e2168694f8c"}},{"ruleId":"D1","level":"warning","message":{"text":"google_genai._response_to_result_with_tools (cyclomatic 16): google_genai._response_to_result_with_tools has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/sampling/handlers/google_genai.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"0874f356f54f57104c751d7dbd9f9e7f995b588ca1dd7d64963ce438863af572"}},{"ruleId":"D1","level":"warning","message":{"text":"OAuthProxy.revoke_token (cyclomatic 16): OAuthProxy.revoke_token has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b3b5bda5d5182e76a2e212b5d79df31ace434e39db65a65c2c756a4352db70"}},{"ruleId":"D1","level":"warning","message":{"text":"JWTVerifier.__init__ (cyclomatic 16): JWTVerifier.__init__ has cyclomatic complexity 16 (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":"fastmcp_slim/fastmcp/server/auth/providers/jwt.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27abc4a8690b7259962a3ee7f95dd054fec387919d5fd71ab48b3e8b0fb30b5"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPOperationsMixin._on_call_tool (cyclomatic 16): MCPOperationsMixin._on_call_tool has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/mixins/mcp_operations.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b969a2873e2247a90e34c1039dfee898a9169de359dc8a8af0ccf275243485e"}},{"ruleId":"D1","level":"warning","message":{"text":"TransportMixin.run_http_async (cyclomatic 16): TransportMixin.run_http_async has cyclomatic complexity 16 (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":"fastmcp_slim/fastmcp/server/mixins/transport.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a070b000fe2af821f6ce60c4db541c4cd2f8edca610553a71cef48ff0dc95c5"}},{"ruleId":"D1","level":"warning","message":{"text":"Visibility._matches (cyclomatic 16): Visibility._matches has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/transforms/visibility.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe5a12b54886c0cf0dd0075d7a6643d95ed16e4617e5e0a19a5353955eeb312"}},{"ruleId":"D1","level":"warning","message":{"text":"json_schema_type._build_dataclass (cyclomatic 16): json_schema_type._build_dataclass has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema_type.py"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbcdef775b6d3bac0b07d84a1865b57f59243c5e4822b6f8ced8be95990d5a1"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAPIParser._extract_request_body (cyclomatic 16): OpenAPIParser._extract_request_body has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/parser.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"d889f8be38cbf43b89dd4462f14cabe90ce336a471f6c9585b2666349edffb15"}},{"ruleId":"D2","level":"warning","message":{"text":"formatters.format_description_with_responses (cognitive 150): formatters.format_description_with_responses has cognitive complexity 150 (threshold 15). Drivers by points: if/else 22 (84 pts), loops 6 (28 pts), ternaries 7 (27 pts), boolean chains 11 (nesting depth added 104). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/formatters.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb07b74b91961cec74d9713d737b7b248c94cddcfa5caf3a8dc0488bfdff54b"}},{"ruleId":"D2","level":"warning","message":{"text":"schemas._combine_schemas_and_map_params (cognitive 150): schemas._combine_schemas_and_map_params has cognitive complexity 150 (threshold 15). Drivers by points: if/else 43 (105 pts), loops 9 (25 pts), boolean chains 13, ternaries 3 (7 pts) (nesting depth added 82). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/schemas.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"693753fc23834ad0635979ccdd579ff50f8ca0baad557196c0085bf75cae9c82"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.run (cognitive 125): cli.run has cognitive complexity 125 (threshold 15). Drivers by points: if/else 42 (101 pts), ternaries 10 (12 pts), boolean chains 7, error handling 3 (5 pts) (nesting depth added 63). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/cli.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"380a0a4b13183d259af7e04cd88e0e8320061f68638fe4152d9927d09ae6abc5"}},{"ruleId":"D2","level":"warning","message":{"text":"ParsedFunction.from_function (cognitive 76): ParsedFunction.from_function has cognitive complexity 76 (threshold 15). Drivers by points: if/else 26 (48 pts), boolean chains 12, loops 5 (7 pts), ternaries 4 (5 pts), error handling 2 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/tools/function_parsing.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"11412c41c804da63d4dce531b51eb0a198afa12e6b9604e9f87a375e3506b646"}},{"ruleId":"D2","level":"warning","message":{"text":"elicitation.validate_elicitation_json_schema (cognitive 68): elicitation.validate_elicitation_json_schema has cognitive complexity 68 (threshold 15). Drivers by points: if/else 21 (60 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/elicitation.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"f571b3407f934d42a06b9b39f757a3f5372f1e50740ad1852b9e657c48ccf28e"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_triage.finish (cognitive 66): agentic_triage.finish has cognitive complexity 66 (threshold 15). Drivers by points: if/else 16 (39 pts), ternaries 9 (19 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_triage.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8ed3b5aca3378788f1e0202b10e6218b5fc20151f8174780589ae4a7eaa8c2"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAISamplingHandler._convert_to_openai_messages (cognitive 64): OpenAISamplingHandler._convert_to_openai_messages has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (58 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 40). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/sampling/handlers/openai.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5d5e8a1bf4cf30b0f4e06061dda01c5f2244b6d4d15addfddfe61cdd3a4236"}},{"ruleId":"D2","level":"warning","message":{"text":"OAuthProxy.load_access_token (cognitive 64): OAuthProxy.load_access_token has cognitive complexity 64 (threshold 15). Drivers by points: if/else 18 (35 pts), error handling 6 (12 pts), ternaries 5 (10 pts), boolean chains 7 (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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6670e06f732bbe35876a539c80a2c9557c940ae389db193e5c366af7a8b87177"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestDirector.build (cognitive 64): RequestDirector.build has cognitive complexity 64 (threshold 15). Drivers by points: if/else 13 (26 pts), ternaries 10 (24 pts), boolean chains 11, loops 1 (3 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/director.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8006ab3113dd7ca7e17e221a68775e12d0edc0667f8384a242978f3392b5f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAPIParser.parse (cognitive 64): OpenAPIParser.parse has cognitive complexity 64 (threshold 15). Drivers by points: if/else 12 (32 pts), error handling 4 (16 pts), loops 4 (8 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 37). 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":"fastmcp_slim/fastmcp/utilities/openapi/parser.py"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5584d45a8eb188c31b8ed259c6d2ab8740879312317fdbd585bb47700d96373"}},{"ruleId":"D2","level":"warning","message":{"text":"json_schema_converter._needs_recursive_processing (cognitive 63): json_schema_converter._needs_recursive_processing has cognitive complexity 63 (threshold 15). Drivers by points: if/else 9 (39 pts), boolean chains 14, loops 3 (10 pts) (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"895103672ec7bffc959591634efca929f000235661339f14b796f30d16f75c60"}},{"ruleId":"D2","level":"warning","message":{"text":"client.list_command (cognitive 62): client.list_command has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (43 pts), loops 5 (12 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 30). 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":"fastmcp_slim/fastmcp/cli/client.py"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94d24ccc704f185a16c3f88db3f26a84814bf1eaea2354289cbfb6273c07a4a"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_stack_controller.run_batch (cognitive 60): agentic_stack_controller.run_batch has cognitive complexity 60 (threshold 15). Drivers by points: if/else 13 (37 pts), error handling 4 (14 pts), loops 3 (4 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 37). 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":".github/agentic/flows/agentic_stack_controller.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec5d51c423ddc79bc56318978ed9b4149c620cd519a89edd03340c68f9ea461"}},{"ruleId":"D2","level":"warning","message":{"text":"schemas._make_optional_parameter_nullable (cognitive 60): schemas._make_optional_parameter_nullable has cognitive complexity 60 (threshold 15). Drivers by points: if/else 12 (37 pts), loops 4 (19 pts), boolean chains 4 (nesting depth added 40). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/schemas.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"6013816e147b2f6877e22425621344503446670de0bd07c7859a19528697d688"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformedTool._merge_schema_with_precedence (cognitive 56): TransformedTool._merge_schema_with_precedence has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 5 (8 pts), boolean chains 6 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/tools/tool_transform.py"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e4a036cdf52187979821832a2243025c2d5b572deb2ffd71326985a29ecf4a"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionResourceTemplate.from_function (cognitive 53): FunctionResourceTemplate.from_function has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (37 pts), boolean chains 6, loops 4 (6 pts), error handling 1 (2 pts), ternaries 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/resources/template.py"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"257c70a9ac76544aef86e3b9a66a9418527bd12d54a20cddadced340ee27e2f6"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestDirector._serialize_query_params (cognitive 53): RequestDirector._serialize_query_params has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (37 pts), loops 3 (11 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/director.py"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"2529ba68468c09edfda359b35de5c535cdf4c72e0f580ca5138d6fc63836d5ec"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformedTool.run (cognitive 50): TransformedTool.run has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 2 (5 pts), ternaries 1 (5 pts), boolean chains 3, error handling 1 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/tools/tool_transform.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebbffd635efd73fef85e60d6a42ef3adaac842e7157489ef712555535e2a8b2"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAPIParser._extract_responses (cognitive 49): OpenAPIParser._extract_responses has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (34 pts), error handling 4 (10 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/parser.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c1ed5d4c9c86446a140c913292dbe94b81365a19b2dde5aafcc59df39aaf38"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionPrompt.from_function (cognitive 48): FunctionPrompt.from_function has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 7, error handling 1 (5 pts), loops 3 (5 pts), ternaries 2 (nesting depth added 20). 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":"fastmcp_slim/fastmcp/prompts/function_prompt.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8616781f73291d31e5297a9ae02f560b20f703554127ab6ea2801d5cfed760"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformedTool.from_tool (cognitive 48): TransformedTool.from_tool has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (36 pts), ternaries 5, loops 2 (4 pts), boolean chains 3 (nesting depth added 17). 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":"fastmcp_slim/fastmcp/tools/tool_transform.py"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffcdf2e38ee64e8d49045bd6925710d9b3f3204b63be86884bd052ecbf0a1f4"}},{"ruleId":"D2","level":"warning","message":{"text":"json_schema_type._convert_schema (cognitive 48): json_schema_type._convert_schema has cognitive complexity 48 (threshold 15). Drivers by points: if/else 25 (41 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 17). 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":"fastmcp_slim/fastmcp/utilities/json_schema_type.py"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26dc9f62c67c9ea0c9f510f44280a4925108710bdb9124d8565647c28798eca"}},{"ruleId":"D2","level":"warning","message":{"text":"run.run_command (cognitive 47): run.run_command has cognitive complexity 47 (threshold 15). Drivers by points: ternaries 11 (29 pts), if/else 13 (17 pts), error handling 1 (nesting depth added 22). 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":"fastmcp_slim/fastmcp/cli/run.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65c384e3c386890324bd8b0f9214ff82a908f65817793205f6aed2e0248454a"}},{"ruleId":"D2","level":"warning","message":{"text":"apps_dev._model_from_schema (cognitive 45): apps_dev._model_from_schema has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 3 (8 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/apps_dev.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aeb5bf93de6ca47168bf169bde77512be028d2afcb9f12df635161c27a6c7f0"}},{"ruleId":"D2","level":"warning","message":{"text":"schemas.extract_output_schema_from_responses (cognitive 44): schemas.extract_output_schema_from_responses has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 10, loops 4 (7 pts), ternaries 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":"fastmcp_slim/fastmcp/utilities/openapi/schemas.py"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad3af23f4f89628ac5de1d37750b3e20570683845e5c0e4af1968cb489d7392"}},{"ruleId":"D2","level":"warning","message":{"text":"formatters.generate_example_from_schema (cognitive 43): formatters.generate_example_from_schema has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 2 (6 pts), ternaries 2 (5 pts), boolean chains 4 (nesting depth added 20). 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":"fastmcp_slim/fastmcp/utilities/openapi/formatters.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d1a903048b5b463e4d5e3d00ee0d5409a1ece25a93bc524f856751f006ce54"}},{"ruleId":"D2","level":"warning","message":{"text":"ProxyDCRClient.validate_redirect_uri (cognitive 41): ProxyDCRClient.validate_redirect_uri has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (35 pts), error handling 1 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/models.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"349520909687dfe498cea6b531bd0b4b61ffad5bbc22940c8b8421b323569169"}},{"ruleId":"D2","level":"warning","message":{"text":"filesystem_discovery.import_module_from_file (cognitive 41): filesystem_discovery.import_module_from_file has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (28 pts), error handling 4 (10 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b0cc1e27c3a21edc9d2f3bbde01cdb537803efea4c99a5b4eeeac102920e95"}},{"ruleId":"D2","level":"warning","message":{"text":"refreshTriage (cognitive 41): refreshTriage has cognitive complexity 41 (threshold 15). Drivers by points: ternaries 7 (17 pts), if/else 8 (13 pts), loops 5 (7 pts), boolean chains 3, error handling 1 (nesting depth added 17). 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":"status-site/app.js"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7cc607c066ade670201434921d53f805ca1ba3d08bab76838b6362176d00a9"}},{"ruleId":"D2","level":"warning","message":{"text":"AnthropicSamplingHandler._convert_to_anthropic_messages (cognitive 40): AnthropicSamplingHandler._convert_to_anthropic_messages has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (28 pts), ternaries 2 (8 pts), loops 2 (4 pts) (nesting depth added 25). 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":"fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd4e1322c56930bf3dea6ee9dc1c5ac20491c8023e8be28d6059dfae48a229d"}},{"ruleId":"D2","level":"warning","message":{"text":"json_schema_converter.convert_openapi_schema_to_json_schema (cognitive 40): json_schema_converter.convert_openapi_schema_to_json_schema has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 11, ternaries 3 (11 pts), loops 2 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf56dbcb6dce1f3fbc0fd08805d86814d0e7a42c4fc61d4bc53ebb3217fecb6"}},{"ruleId":"D2","level":"warning","message":{"text":"IdentityAssertionValidator.validate (cognitive 39): IdentityAssertionValidator.validate has cognitive complexity 39 (threshold 15). Drivers by points: if/else 23 (30 pts), boolean chains 7, error handling 2 (nesting depth added 7). 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":"fastmcp_slim/fastmcp/server/auth/identity_assertion.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca3f9523ec4c6654db2a19ca0d07862336b6ff48aa9572620112c9ec9770218"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.load_and_merge_config (cognitive 39): cli.load_and_merge_config has cognitive complexity 39 (threshold 15). Drivers by points: if/else 22 (31 pts), error handling 2 (7 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/cli.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"26eda330a2623fb2e94a42b5bbfbdf06cd0d8a56142f3902ee9f8cdad1da1c06"}},{"ruleId":"D2","level":"warning","message":{"text":"ssrf._ssrf_safe_fetch_response (cognitive 37): ssrf._ssrf_safe_fetch_response has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (23 pts), error handling 3 (7 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 20). 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":"fastmcp_slim/fastmcp/server/auth/ssrf.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c404066d35dba4f5b681711232c1b437ef52ceae40c5dbdab47b365f1ab407e"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_claims.drain_predecessor (cognitive 36): agentic_claims.drain_predecessor has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 7, loops 4 (6 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_claims.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddce1dc8640c012e17e7789f82c5796493bb5a6f9c140309a8f52b6a6aff9c9"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_review_delivery.deliver_reviews (cognitive 36): agentic_review_delivery.deliver_reviews has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 5, ternaries 1 (3 pts), error handling 1, 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":".github/agentic/flows/agentic_review_delivery.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"334f4b95c683c4d5e5c81fd7828ebd9f937804f09131e61d8f2eeb64ffe95be8"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_stack_usage.usage_report (cognitive 36): agentic_stack_usage.usage_report has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (10 pts), ternaries 3 (4 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_stack_usage.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a564b5c6bbb0b59cb6a11aeb93e24ac9dbc169714a679ccb62eec90d2d67aa7e"}},{"ruleId":"D2","level":"warning","message":{"text":"dependencies.transform_context_annotations (cognitive 36): dependencies.transform_context_annotations has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (30 pts), error handling 3, loops 2, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/dependencies.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ca28c1450f86368954b386db9a1bb0457332adee2afe94f0fa8a4db33ef1d6"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_transform._structural_kind (cognitive 36): tool_transform._structural_kind has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 4 (8 pts), loops 2 (4 pts), boolean chains 3 (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":"fastmcp_slim/fastmcp/tools/tool_transform.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8742a8c760a961e1ca8adb1068073ce9d5d96dda44f62cdcfd4b21fe5f9c87"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect.inspect_fastmcp_v2 (cognitive 36): inspect.inspect_fastmcp_v2 has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 16 (29 pts), loops 4, boolean chains 3 (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":"fastmcp_slim/fastmcp/utilities/inspect.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6900a8e55be535edac7942599a7c682d4e445f9b38f843dcfb7b978b4741f851"}},{"ruleId":"D2","level":"warning","message":{"text":"RequestDirector._unflatten_arguments (cognitive 36): RequestDirector._unflatten_arguments has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (31 pts), boolean chains 4, loops 1 (nesting depth added 17). 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":"fastmcp_slim/fastmcp/utilities/openapi/director.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e0d6a589f1a8affcbbefbae65ef8905576430996bc05fb6b9f72e73b10c05f"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_triage_nodes.triage_finalize (cognitive 35): agentic_triage_nodes.triage_finalize has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_triage_nodes.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"269eaa8d00a3c3fc66a2c0184194b3293b38fd9190bc44ac95ed604e1c96dc85"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_pr_verification.verify (cognitive 34): agentic_pr_verification.verify has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 7, loops 5 (6 pts), ternaries 1 (nesting depth added 6). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_pr_verification.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"01adc0ac901c873c4c2c093a15c199ba4491b1143ef36a02bc21ff998fe9ef3d"}},{"ruleId":"D2","level":"warning","message":{"text":"shared.process_common_args (cognitive 34): shared.process_common_args has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (20 pts), error handling 3 (7 pts), boolean chains 4, loops 1 (2 pts), ternaries 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":"fastmcp_slim/fastmcp/cli/install/shared.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68f47d4a2c7678e2db9d27074bedabb03074344ab82ac4c144bcaaf6a37235e"}},{"ruleId":"D2","level":"warning","message":{"text":"FastMCP.read_resource (cognitive 34): FastMCP.read_resource has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (25 pts), error handling 6 (9 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfca130356245239b1ad03e0c155b47035e956658091b4cd58c4109c0939e6b"}},{"ruleId":"D2","level":"warning","message":{"text":"json_schema_type._resolve_recursive_types (cognitive 34): json_schema_type._resolve_recursive_types has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 6 (9 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema_type.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c15e7a0ce59ddff03d7c82214d74ef154e5be7efadac7000940d426e68d57a"}},{"ruleId":"D2","level":"warning","message":{"text":"schemas._flatten_discriminator_subtypes (cognitive 34): schemas._flatten_discriminator_subtypes has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (6 pts), ternaries 3 (4 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/schemas.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"2930191bf48b256510efcf75a9e6659e3f93036bad2f10736ddda3ae09bbf366"}},{"ruleId":"D2","level":"warning","message":{"text":"render (cognitive 34): render has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 9 (15 pts), if/else 8, loops 6, boolean chains 5 (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":"status-site/operations.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"371570263446b4774aa45b761caf89d6ddaf3dbb1d54c29e087455bded195960"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_stack_runtime.judge (cognitive 32): agentic_stack_runtime.judge has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 5, loops 2 (3 pts), ternaries 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":".github/agentic/flows/agentic_stack_runtime.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5d0a4a3e97c1625b4e1b9f33b1afbac3d62b2ce999a955f313bfb7719cff62"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.inspect (cognitive 32): cli.inspect has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 5, error handling 3 (4 pts), ternaries 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":"fastmcp_slim/fastmcp/cli/cli.py"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fc34616ff96963c7887eb4ce049464bb226a215bb1a648cd861dcd2ff46eab"}},{"ruleId":"D2","level":"warning","message":{"text":"generate._resolve_tool_param_flags (cognitive 32): generate._resolve_tool_param_flags has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 6 (11 pts), boolean chains 2, ternaries 1 (2 pts) (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":"fastmcp_slim/fastmcp/cli/generate.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9317fff8a90ccc8f24e6f3b77ebdde44ce569acf947a3b8f01c5bb8e93b41a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"generate._tool_function_source (cognitive 32): generate._tool_function_source has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 3 (5 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/generate.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cae9e68e55de776937985cc450e4b19994fa87b1b58fe90d886498090811d45"}},{"ruleId":"D2","level":"warning","message":{"text":"tools._parse_call_tool_result (cognitive 32): tools._parse_call_tool_result has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 10, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/mixins/tools.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1dcb19a50de5a4e576839d119401121fa1892fb0450ea76e6fff118e73c9c85"}},{"ruleId":"D2","level":"warning","message":{"text":"OIDCProxy.__init__ (cognitive 32): OIDCProxy.__init__ has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (23 pts), ternaries 3 (5 pts), boolean chains 4 (nesting depth added 6). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oidc_proxy.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"0314214287e66457ea7772a8deb9b1be1e64ac780d7b9295a7c82306e355db1f"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_freshness.revalidate (cognitive 31): agentic_freshness.revalidate has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (6 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_freshness.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"09caa7cbf10911b3c5c47961fe7e894ed55abe8be36ff12f6743c74fd758d636"}},{"ruleId":"D2","level":"warning","message":{"text":"Client._connect (cognitive 31): Client._connect has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 4 (13 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/client.py"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"75370180da04392b122ee44e6bdfe6444da715c9262d526daf0be0bd0e065aee"}},{"ruleId":"D2","level":"warning","message":{"text":"CIMDFetcher.fetch (cognitive 31): CIMDFetcher.fetch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (22 pts), error handling 5 (6 pts), boolean chains 3 (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":"fastmcp_slim/fastmcp/server/auth/cimd.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac33393387ad503f567566a18140f9c0ec5c72cb460477a825900b354c6751a"}},{"ruleId":"D2","level":"warning","message":{"text":"ConsentMixin._submit_consent (cognitive 31): ConsentMixin._submit_consent has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 8, ternaries 1 (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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"78282b9160f88444e75f58e8ac89704038850ee870edc41679f9b62aef3f29e1"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformedTool._create_forwarding_transform (cognitive 31): TransformedTool._create_forwarding_transform has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/tools/tool_transform.py"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b72a75d651d8132295e9aa97ea0d8f0af0c4ad611ac076fc8fa9641b7d31592"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAPIParser._extract_request_body (cognitive 31): OpenAPIParser._extract_request_body has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 4 (10 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/parser.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ca0d1459430dab010019461052b656352b96dcbfd2ff7795fb2e534a808f9b"}},{"ruleId":"D2","level":"warning","message":{"text":"schemas._replace_ref_with_defs (cognitive 31): schemas._replace_ref_with_defs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (22 pts), ternaries 2 (5 pts), loops 3, boolean chains 1 (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":"fastmcp_slim/fastmcp/utilities/openapi/schemas.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f707b7a73a1f543e07c28e23b0aa93706aaa907bd9f60e302c0c8e00d0fbe4"}},{"ruleId":"D2","level":"warning","message":{"text":"template.match_uri_template (cognitive 30): template.match_uri_template has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 1 (6 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/resources/template.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c929879b3e5e7c9f2caeefc461d32feb1df14b5c071bba9e198d7fcad6696500"}},{"ruleId":"D2","level":"warning","message":{"text":"types.get_cached_typeadapter (cognitive 30): types.get_cached_typeadapter has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (3 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/types.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c371c18c0b3d0f3b59cafab5ed221165e0acd62445ac7186126d02648d0a7b4"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_intake.route_intake (cognitive 29): agentic_intake.route_intake has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 10 (nesting depth added 4). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_intake.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"085ab3a45f50a56f16618fcbd561ccacf93550c0aaeb1e43ef039f0a1e6dee4c"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.__init__ (cognitive 29): Client.__init__ has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 3 (5 pts), boolean chains 4 (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":"fastmcp_slim/fastmcp/client/client.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a32678fbbb6f717f50ecee30ddc92c09b9b7f405e1acaaf80d277cbe5057c6"}},{"ruleId":"D2","level":"warning","message":{"text":"AuthorizationHandler.handle (cognitive 29): AuthorizationHandler.handle has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/handlers/authorize.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"961ce21407da5ee2d41171d7e249511372a264cb12370b015478547d81c56f66"}},{"ruleId":"D2","level":"warning","message":{"text":"OAuthProxy.revoke_token (cognitive 29): OAuthProxy.revoke_token has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, error handling 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc351dbf093f8f1a722b33c887034c4b5692c4bd1eff56b27c8a2c296e62cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"json_schema_type._merge_defaults (cognitive 29): json_schema_type._merge_defaults has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema_type.py"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aebca88cb1128d390c8e12fd6aa089541e2121a07ef67a0df4b1c2b7ab956a1"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAPIParser._extract_parameters (cognitive 29): OpenAPIParser._extract_parameters has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 6, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (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":"fastmcp_slim/fastmcp/utilities/openapi/parser.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"4928c8897528cf3924d71376bf51b37676d8d3508a2cad3b3df192b2f328a07c"}},{"ruleId":"D2","level":"warning","message":{"text":"operations.ranking (cognitive 29): operations.ranking has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 7 (15 pts), loops 4 (6 pts), boolean chains 5, if/else 3 (nesting depth added 10). Of this number, 24 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. 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":"status-site/operations.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9b0722b36bea4d272bff8451e4279005379a240d1d5e14ea9967bc06e28c45"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_baseline.review_existing (cognitive 28): agentic_baseline.review_existing has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 pts), error handling 1 (3 pts), ternaries 1 (2 pts), boolean chains 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":".github/agentic/flows/agentic_baseline.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee67acecb04f098d8f92e25aaabd88585984c76427809929e16e54fc0ead203"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_triage.admit (cognitive 28): agentic_triage.admit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_triage.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b7a6c280272a5b0bd4ef9741aa9adbdadf30a472468d2898b56aa1cb9dfdf5"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionPrompt._convert_string_arguments (cognitive 28): FunctionPrompt._convert_string_arguments has cognitive complexity 28 (threshold 15). Drivers by points: error handling 4 (14 pts), if/else 6 (12 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/prompts/function_prompt.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e237702652704d37ae2f1a73467a9b4f64068e1f69751807e14ac4ef94cd491"}},{"ruleId":"D2","level":"warning","message":{"text":"ConsentMixin._show_consent_page (cognitive 28): ConsentMixin._show_consent_page has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, ternaries 2 (3 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"899b11c32b42ecd6d5aeacc1b4d50d626a6b81ea452bb26b8aebf47d5d631d5e"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_review_publication.post_review (cognitive 27): agentic_review_publication.post_review has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 14, if/else 8 (10 pts), ternaries 2 (3 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_review_publication.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e74b98390f906b0d369e79ddf9cbceaadb7e3a985621f094b6df338f1e0df0f"}},{"ruleId":"D2","level":"warning","message":{"text":"PrivateKeyJWTClientAuthenticator.authenticate_request (cognitive 27): PrivateKeyJWTClientAuthenticator.authenticate_request has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), error handling 2 (4 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/auth.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0f537d0efd45f27392656d0c7e2112368cf662dfbdf62b2616991ed7539238"}},{"ruleId":"D2","level":"warning","message":{"text":"OAuthProxy.exchange_authorization_code (cognitive 27): OAuthProxy.exchange_authorization_code has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 8, ternaries 4 (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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dadb6b0ddccf0597df18fadefd73754d3093884f0e64a870a588b7219113bc"}},{"ruleId":"D2","level":"warning","message":{"text":"OAuthProxy._handle_idp_callback (cognitive 27): OAuthProxy._handle_idp_callback has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 4, error handling 2, ternaries 1 (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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":2747}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16d726548f4e182477a82c7c6899e788f7fe6c4fa1cfe0aab2f02fa747a1ce0"}},{"ruleId":"D2","level":"warning","message":{"text":"IntrospectionTokenVerifier.verify_token (cognitive 27): IntrospectionTokenVerifier.verify_token has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 5 (8 pts), boolean chains 3, error handling 3 (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":"fastmcp_slim/fastmcp/server/auth/providers/introspection.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4169bbc46d910f409462c11a0bc29ed414c958973729e0f83b286dbf9c74069a"}},{"ruleId":"D2","level":"warning","message":{"text":"JWTVerifier._refresh_jwks_key (cognitive 27): JWTVerifier._refresh_jwks_key has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), error handling 5 (6 pts), loops 1 (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":"fastmcp_slim/fastmcp/server/auth/providers/jwt.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee589497db053e285609b51b9610cf690f8adfc57beb32e6338e2d7db0a66fb"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionTool.from_function (cognitive 27): FunctionTool.from_function has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 9, ternaries 3 (4 pts) (nesting depth added 3). 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":"fastmcp_slim/fastmcp/tools/function_tool.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf34c8d404557cc99c3c8db2b3ed41b0dac232b4f5af045e204cec373b6750a0"}},{"ruleId":"D2","level":"warning","message":{"text":"json_schema_type._build_dataclass (cognitive 27): json_schema_type._build_dataclass has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema_type.py"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6bd702508aab8de42d72caa67df6ba5ce4c559066dfdc06e2de29c91172c19"}},{"ruleId":"D2","level":"warning","message":{"text":"backlog (cognitive 27): backlog has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 8 (13 pts), if/else 4 (7 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 9). Of this number, 20 points are the body\u0027s own statements and 7 belong to 13 function items inside it that branch. 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":"status-site/app.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"66db1d5868b2b9fe585e1bfab2e0f9a4ef2e5dc358c7c38160b60936f459708c"}},{"ruleId":"D2","level":"warning","message":{"text":"run.run_with_reload (cognitive 26): run.run_with_reload has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3 (6 pts), boolean chains 2, error handling 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":"fastmcp_slim/fastmcp/cli/run.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0fc901d8d64732c1a3f7a84a48f6990205732d19cbc4e0023316b0c0c42b01"}},{"ruleId":"D2","level":"warning","message":{"text":"CIMDAssertionValidator.validate_assertion (cognitive 26): CIMDAssertionValidator.validate_assertion has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 1, error handling 1 (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":"fastmcp_slim/fastmcp/server/auth/cimd.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28b9eff981baad66b83b935bc4b2b7d9811561743e657a90bc41bf52eda9610"}},{"ruleId":"D2","level":"warning","message":{"text":"OAuthProxy.__init__ (cognitive 26): OAuthProxy.__init__ has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 6 (7 pts), boolean chains 5 (nesting depth added 3). 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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"28534d4f92bd0932aecb888a31d37195d5c921176168fb3f2cca3991cf598c8b"}},{"ruleId":"D2","level":"warning","message":{"text":"GitHubTokenVerifier.verify_token (cognitive 26): GitHubTokenVerifier.verify_token has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), error handling 5, ternaries 2 (5 pts), boolean chains 1 (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":"fastmcp_slim/fastmcp/server/auth/providers/github.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1febf6cc57d216347d174e4da5cc06744a60ad797d5987c22986bace2357bbc8"}},{"ruleId":"D2","level":"warning","message":{"text":"FastMCP.__init__ (cognitive 26): FastMCP.__init__ has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (9 pts), loops 3 (4 pts), ternaries 4 (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":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94be2f19a9e38ca43ca26015e2acdafa2e3447b363fa4cf5ebd726e91b504b0"}},{"ruleId":"D2","level":"warning","message":{"text":"inspect.inspect_fastmcp_v1 (cognitive 26): inspect.inspect_fastmcp_v1 has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 7 (12 pts), boolean chains 7, loops 4, if/else 1 (2 pts), error handling 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":"fastmcp_slim/fastmcp/utilities/inspect.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"795157569f58b2ce635c423cbd292b2caf79b108770724e9eda10c9103056a0f"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAPIParser._resolve_ref (cognitive 26): OpenAPIParser._resolve_ref has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/parser.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2804dc5d34673de52a423c011c9bf79eb06b00c764e0e333774c62257807d1e"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_pr_verification.pytest_result (cognitive 25): agentic_pr_verification.pytest_result has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6, loops 2 (3 pts), error handling 1 (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":".github/agentic/flows/agentic_pr_verification.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"addf9a956947ba773ee074e1ff4c754b574b994f61214c3f41f5ae9536d421c4"}},{"ruleId":"D2","level":"warning","message":{"text":"OAuthProxy.exchange_refresh_token (cognitive 25): OAuthProxy.exchange_refresh_token has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 4, ternaries 4, error handling 2 (nesting depth added 3). 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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"75897288f5d6e539de471396c8806804caf581f2f3ee481a490543f5ea43eacb"}},{"ruleId":"D2","level":"warning","message":{"text":"OAuthProxy.get_routes (cognitive 25): OAuthProxy.get_routes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 11, loops 1 (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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":2535}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1249eacc6ebabaa04ffba00061c69decf3d85b2c0bc0f517e8afcd83d784165"}},{"ruleId":"D2","level":"warning","message":{"text":"ClerkTokenVerifier.verify_token (cognitive 25): ClerkTokenVerifier.verify_token has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 6, error handling 3, ternaries 2 (nesting depth added 3). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/clerk.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1151b6cabd3e93c9a2c57f73f107e60dac02653c50d4d7347eb6222ec1a282dc"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_backlog.inventory (cognitive 24): agentic_backlog.inventory has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 2 (3 pts), ternaries 2 (3 pts) (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":".github/agentic/flows/agentic_backlog.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fff8a491450320472c8ab9dbaf720b24bea00196eacb7523d281b84b9b6dc5"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_backlog.settle (cognitive 24): agentic_backlog.settle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (4 pts), boolean chains 3 (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":".github/agentic/flows/agentic_backlog.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2228c281b23ffc9725b9100f52ec6781b43ed2606ce528deb6f65afaf0eb4d38"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_native_cache.find_native_result (cognitive 24): agentic_native_cache.find_native_result has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, error handling 2 (4 pts), loops 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":".github/agentic/flows/agentic_native_cache.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c78373211419fc19754bf11669164dd3ad27aa1b724b19042fab66bbc0aa98"}},{"ruleId":"D2","level":"warning","message":{"text":"client.coerce_value (cognitive 24): client.coerce_value has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 4 (9 pts), boolean chains 3 (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":"fastmcp_slim/fastmcp/cli/client.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a6748083bf3bb6ba32d6c3d305ac4ad2e3258aebcce860a1d1f7c12df78323"}},{"ruleId":"D2","level":"warning","message":{"text":"google_genai._response_to_result_with_tools (cognitive 24): google_genai._response_to_result_with_tools has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (7 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/sampling/handlers/google_genai.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12abb0b692fbdbb0c69713b90ff235e15f9d32642676241a22614c7677b9505"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiAuth.__init__ (cognitive 24): MultiAuth.__init__ has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11, boolean chains 7, ternaries 5 (6 pts) (nesting depth added 1). 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":"fastmcp_slim/fastmcp/server/auth/auth.py"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"8553adca65778b008b82294a41fa16955ff70253cd3058d661a24dc8062e35c2"}},{"ruleId":"D2","level":"warning","message":{"text":"TransportMixin.http_app (cognitive 24): TransportMixin.http_app has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 11 (22 pts), if/else 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":"fastmcp_slim/fastmcp/server/mixins/transport.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44928ce8efc060712caeb9702ab651a397db4b499eef8a5e69a13477138979d"}},{"ruleId":"D2","level":"warning","message":{"text":"auth.parse_scopes (cognitive 24): auth.parse_scopes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), error handling 1 (3 pts), ternaries 1 (2 pts), boolean chains 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":"fastmcp_slim/fastmcp/utilities/auth.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"37846e5911cd9d227e14280d68fec71e5b6e56756a990c9263afaf26f876613a"}},{"ruleId":"D2","level":"warning","message":{"text":"discovery._scan_claude_code (cognitive 23): discovery._scan_claude_code has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), error handling 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":"fastmcp_slim/fastmcp/cli/discovery.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c6859a059a562f9fd71130af87ef398090f6e102e6af0ab1e28e2daac0749f"}},{"ruleId":"D2","level":"warning","message":{"text":"google_genai._convert_messages_to_google_genai_content (cognitive 23): google_genai._convert_messages_to_google_genai_content has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (4 pts), ternaries 1 (2 pts), boolean chains 1 (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":"fastmcp_slim/fastmcp/client/sampling/handlers/google_genai.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d261332e60922391c4c08dcb6092dc97261ac4237ebb1b6511c65524553ea8c7"}},{"ruleId":"D2","level":"warning","message":{"text":"ResourceSecurity.validate (cognitive 23): ResourceSecurity.validate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/resources/security.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21daf3ce2fc10afa322dea9ece19289f8d5cd678a4c28fe0d26e8158fe2a6cb"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionResourceTemplate.read (cognitive 23): FunctionResourceTemplate.read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (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":"fastmcp_slim/fastmcp/resources/template.py"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59d361e33aea3da9f7cec259f328dd9f614263481c937ae294af1384977f7d0"}},{"ruleId":"D2","level":"warning","message":{"text":"JWTVerifier.load_access_token (cognitive 23): JWTVerifier.load_access_token has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 2, error handling 2, ternaries 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":"fastmcp_slim/fastmcp/server/auth/providers/jwt.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ca5fed61f89e106fa04cb93212af03c546d10c06293a4019f04976b188c484"}},{"ruleId":"D2","level":"warning","message":{"text":"filesystem_discovery.extract_components (cognitive 23): filesystem_discovery.extract_components has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 1 (4 pts), boolean chains 2, error handling 1 (2 pts), 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":"fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54509cb0149c68e27fbb11a121caa116c1f123f8cd918619baf43ccae814416"}},{"ruleId":"D2","level":"warning","message":{"text":"FastMCP.call_tool (cognitive 23): FastMCP.call_tool has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), error handling 4, boolean chains 3 (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":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6995931ed015cf20b6b7372c924151e7032fc2020361155aa6c09d27f6056d"}},{"ruleId":"D2","level":"warning","message":{"text":"fastmcp.__getattr__ (cognitive 22): fastmcp.__getattr__ has cognitive complexity 22 (threshold 15). Drivers by points: error handling 7 (14 pts), if/else 8 (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":"fastmcp_slim/fastmcp/__init__.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"793b67bbce812d67fc1ffde8b7ea7be402f0d52eb83ec41bbb110e5b96cee4b4"}},{"ruleId":"D2","level":"warning","message":{"text":"StdioTransport.connect (cognitive 22): StdioTransport.connect has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8 (nesting depth added 3). 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":"fastmcp_slim/fastmcp/client/transports/stdio.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8964d6e72d836a1e4f40ebb7471ebd7e772bbd079b9f83d5aa462afd21723d"}},{"ruleId":"D2","level":"warning","message":{"text":"GoogleTokenVerifier.verify_token (cognitive 22): GoogleTokenVerifier.verify_token has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 3 (4 pts), boolean chains 3, error handling 3 (nesting depth added 3). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/google.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7396f83fe19f9ba09afa04294f8135b506576993be44dad4215e03b02fc1a235"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolDecoratorMixin.add_tool (cognitive 22): ToolDecoratorMixin.add_tool has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 2 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"274a5cf7151bb0b0afc76a2a8795e784dc40c6aa0b6ca19431de8fe3bc20392e"}},{"ruleId":"D2","level":"warning","message":{"text":"json_schema._merge_ref_siblings (cognitive 22): json_schema._merge_ref_siblings has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3b25a81e12726c53608bdadbc15430b67e425059056d4069f7692548151aa3"}},{"ruleId":"D2","level":"warning","message":{"text":"UvStdioTransport.__init__ (cognitive 21): UvStdioTransport.__init__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, loops 1 (2 pts) (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":"fastmcp_slim/fastmcp/client/transports/stdio.py"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a6ce2feeb88394b16947af34ec8a4792faaa7d7b4d4303e8e650528b388d15"}},{"ruleId":"D2","level":"warning","message":{"text":"OAuthProxy.exchange_identity_assertion (cognitive 21): OAuthProxy.exchange_identity_assertion has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, error handling 1, ternaries 1 (nesting depth added 3). 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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7dc3382c86d50bfbbd5d77d8632502ea6d735ce66a71ce3c26ae274f99c26e"}},{"ruleId":"D2","level":"warning","message":{"text":"routing._determine_route_type (cognitive 21): routing._determine_route_type has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/openapi/routing.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8635964381fc0c208a1432800c117ab199a5cc815c587589dc1244d0281781"}},{"ruleId":"D2","level":"warning","message":{"text":"prefab_synthesis._build_resource_for_tool (cognitive 21): prefab_synthesis._build_resource_for_tool has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, ternaries 3 (4 pts), error handling 1 (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":"fastmcp_slim/fastmcp/server/providers/prefab_synthesis.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"895770e2f945b0ecc5f6933c57860a71cfa728336d6b3548b04dea4bac1886e6"}},{"ruleId":"D2","level":"warning","message":{"text":"json_schema._strip_discriminator (cognitive 21): json_schema._strip_discriminator has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, ternaries 1 (4 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e90a13808c158254c905f917a6311fc3727f1f3a53e0e6e0c20a9595566458"}},{"ruleId":"D2","level":"warning","message":{"text":"client.resolve_server_spec (cognitive 20): client.resolve_server_spec has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, error handling 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":"fastmcp_slim/fastmcp/cli/client.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"20936f1e1310f21a7bb645367ce98ca4f1fc6bcdc7dd7c282f8c25d1e931e2fb"}},{"ruleId":"D2","level":"warning","message":{"text":"client._terminal_elicitation_handler (cognitive 20): client._terminal_elicitation_handler has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/client.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"622310273a3091d00c0b901662efabf945b708e283888c86c6c9ee47ef80d313"}},{"ruleId":"D2","level":"warning","message":{"text":"claude_desktop.install_claude_desktop (cognitive 20): claude_desktop.install_claude_desktop has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, error handling 1 (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":"fastmcp_slim/fastmcp/cli/install/claude_desktop.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bc29fd3ba5f299748094f117e61ebc96259d77f77b6a2a1843316c8511aeeb"}},{"ruleId":"D2","level":"warning","message":{"text":"google_genai._sampling_content_to_google_genai_part (cognitive 20): google_genai._sampling_content_to_google_genai_part has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (3 pts), boolean chains 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":"fastmcp_slim/fastmcp/client/sampling/handlers/google_genai.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c110bd47e49066ccc987d4ad71dfe281a53e702bd54b3b75776f8e9f1176e13"}},{"ruleId":"D2","level":"warning","message":{"text":"OAuthProxy.register_client (cognitive 20): OAuthProxy.register_client has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 2 (4 pts), ternaries 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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4d4cd800e9cda87bc4c785db37e3d202273c010318ebbee0947b733282944a"}},{"ruleId":"D2","level":"warning","message":{"text":"InMemoryOAuthProvider._revoke_internal (cognitive 20): InMemoryOAuthProvider._revoke_internal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2 (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":"fastmcp_slim/fastmcp/server/auth/providers/in_memory.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"88df29ff9bb4ada2d1802dac0f6c75f6a69e2e1dbd3777a460aa324422459782"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPOperationsMixin._on_call_tool (cognitive 20): MCPOperationsMixin._on_call_tool has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, ternaries 2 (5 pts), error handling 2 (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":"fastmcp_slim/fastmcp/server/mixins/mcp_operations.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efdb969484705490cd495aff9b95abd93e4162b3441dc34dce848ed1fa909a2"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAPITool.run (cognitive 20): OpenAPITool.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, error handling 2, loops 1 (2 pts), ternaries 1 (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":"fastmcp_slim/fastmcp/server/providers/openapi/components.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddcb0d7088fb56f535152b11843f18c519b1b1a8f7d17edb758dd602f4f35b8"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillsDirectoryProvider._discover_skills (cognitive 20): SkillsDirectoryProvider._discover_skills has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 2 (6 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/skills/directory_provider.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2614d5d8839eba4902259fa37005d6f63f6a4ed6cf0f1fa7e22f95dcaa0032ba"}},{"ruleId":"D2","level":"warning","message":{"text":"json_schema.resolve_root_ref (cognitive 20): json_schema.resolve_root_ref has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (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":"fastmcp_slim/fastmcp/utilities/json_schema.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c13b7a8823ffbb8df08a3f2c510821a31c711601fd2819da4a486daaef452ec"}},{"ruleId":"D2","level":"warning","message":{"text":"UVEnvironment.prepare (cognitive 20): UVEnvironment.prepare has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 6 (9 pts), boolean chains 1 (nesting depth added 4). 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":"fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a5c07c00441260e8f585bd8fa2b66fca572d5888226572486a7d67ff64927c"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_native_triage.run_native_stage (cognitive 19): agentic_native_triage.run_native_stage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, loops 2, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_native_triage.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a593843a67686bad599fd4617dedf60175a35166f62510f4b7915d3f550074a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ClientSkillsMixin._skill_manifest (cognitive 19): ClientSkillsMixin._skill_manifest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/mixins/skills.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"207de03fec1f08513578ee402919a1858bd22982e0201447720df2209c9dca11"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiAuth.verify_token (cognitive 19): MultiAuth.verify_token has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 2 (4 pts), ternaries 1 (3 pts), boolean chains 2, 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":"fastmcp_slim/fastmcp/server/auth/auth.py"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c209786bc35be0eff3bb0f75755d57eef079260ab403933ff97b8552ecad00"}},{"ruleId":"D2","level":"warning","message":{"text":"docstring_parsing.parse_docstring (cognitive 19): docstring_parsing.parse_docstring has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts), boolean chains 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":"fastmcp_slim/fastmcp/utilities/docstring_parsing.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a4df123fe67924485aa48c731747a504f2b47c5b2ea6409623beae8fcf8bc8"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_review_publication.before_delivery (cognitive 18): agentic_review_publication.before_delivery has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_review_publication.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fcc37ef56ef402f03257ad9fd602bb27c87b623c45c8120c1f802e3b228303"}},{"ruleId":"D2","level":"warning","message":{"text":"apps_dev._build_picker_html (cognitive 18): apps_dev._build_picker_html has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (5 pts), boolean chains 3, error handling 1 (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":"fastmcp_slim/fastmcp/cli/apps_dev.py"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"7986a206749497f36551dfe5e6d23b7f42419dd6aeb756140729f5f0f99476e8"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.inspector (cognitive 18): cli.inspector has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), error handling 3, loops 1 (3 pts), boolean chains 1, ternaries 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":"fastmcp_slim/fastmcp/cli/cli.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b126420c448c4aaeb321e165edc71fab4d2c388acd0edf46b41a82b4103b47"}},{"ruleId":"D2","level":"warning","message":{"text":"generate._tool_skill_section (cognitive 18): generate._tool_skill_section has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (5 pts), boolean chains 2, loops 2 (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":"fastmcp_slim/fastmcp/cli/generate.py"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dddcaf4638c12724983f3c84e4b8ea0f6ce49b1a156a37c0db3e1e5491e9278"}},{"ruleId":"D2","level":"warning","message":{"text":"huggingface._extract_scopes (cognitive 18): huggingface._extract_scopes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 4). 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":"fastmcp_slim/fastmcp/server/auth/providers/huggingface.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b85ecb4fce6ffb3f3198effb64b62a855ea6bc5b2bff6a1a69d17ab663bbeb2"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionsMixin._install_extension (cognitive 18): ExtensionsMixin._install_extension has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, loops 3, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/mixins/extensions.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34bc8ed3315b793812c836fad40e07a82bb81803616c4192dc86faa3b262d82"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPOperationsMixin._on_list_tools (cognitive 18): MCPOperationsMixin._on_list_tools has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 3 (6 pts), boolean chains 2, 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":"fastmcp_slim/fastmcp/server/mixins/mcp_operations.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"50622a646ff5f6038b9d7192850fbccbcfbe128e1f9ace1e26d371c110c44639"}},{"ruleId":"D2","level":"warning","message":{"text":"Visibility._matches (cognitive 18): Visibility._matches has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4 (nesting depth added 4). 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":"fastmcp_slim/fastmcp/server/transforms/visibility.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4009cd9583bf0077ea54882f1e52b0a4dabef91f343faad3cbb7bb3dec0a5ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool.convert_result (cognitive 18): Tool.convert_result has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, ternaries 2, error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/tools/base.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc6a7505fe4efd4d8abb5576ea4129697620ea218a0c8f645e1812f6839b158"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_existing_review.verify_existing (cognitive 17): agentic_existing_review.verify_existing has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (3 pts), boolean chains 2, ternaries 2 (nesting depth added 4). 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":".github/agentic/flows/agentic_existing_review.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cda1b17d314d516157514017421ee98180224a985eba14361026d14d841ca50"}},{"ruleId":"D2","level":"warning","message":{"text":"generate.serialize_transport (cognitive 17): generate.serialize_transport has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 1 (2 pts), boolean chains 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":"fastmcp_slim/fastmcp/cli/generate.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ef93f272f2976fc243803506126bd821c56ac267f7d0ca8943d520bc365d01"}},{"ruleId":"D2","level":"warning","message":{"text":"code_mode._legible_call_error (cognitive 17): code_mode._legible_call_error has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (5 pts), ternaries 2 (5 pts) (nesting depth added 4). 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":"fastmcp_slim/fastmcp/experimental/transforms/code_mode.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d61f785b747aa609b700b5270b2d1b725f9804caf39fb1b3f76e606995c49fa"}},{"ruleId":"D2","level":"warning","message":{"text":"OAuthProxy.get_client (cognitive 17): OAuthProxy.get_client has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1 (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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6556e1ba82cee04311df632fc28b7c689ecafd1c4a0d4032ca2e6a48db612a"}},{"ruleId":"D2","level":"warning","message":{"text":"JWTVerifier.__init__ (cognitive 17): JWTVerifier.__init__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/jwt.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1eed1d4ac85a9c680c9fe5be426af72af91c9b8dfec068fd984f45f89e2162"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseLoggingMiddleware._create_before_message (cognitive 17): BaseLoggingMiddleware._create_before_message has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4 (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":"fastmcp_slim/fastmcp/server/middleware/logging.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93579e4338e205fd2df18f46703021686bcdd7c89c783e2afd8c917610fd5c2"}},{"ruleId":"D2","level":"warning","message":{"text":"base._object_fields (cognitive 17): base._object_fields has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (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":"fastmcp_slim/fastmcp/server/transforms/search/base.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"987b1810cc41d92eb5e3b7d326b7f0b8177d4c9b6c2182a81f127d71f6c24a7a"}},{"ruleId":"D2","level":"warning","message":{"text":"Skill.to_directory (cognitive 17): Skill.to_directory has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 2 (4 pts), loops 1 (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":"fastmcp_slim/fastmcp/skills/skill.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd773932a9582fd030fef53d6ee81f6c3741a80d65e3d13869682a652648279"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformedTool._apply_single_transform (cognitive 17): TransformedTool._apply_single_transform has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 3). 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":"fastmcp_slim/fastmcp/tools/tool_transform.py"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce9d650f3f1b82ac731f48a568d23e8b2fa7d81af36f1e79cb77a9542a46dab"}},{"ruleId":"D2","level":"warning","message":{"text":"json_schema._resolve_local_ref (cognitive 17): json_schema._resolve_local_ref has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts), ternaries 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":"fastmcp_slim/fastmcp/utilities/json_schema.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"25619956d52d88d8335ea04db9d0e8090b16a2a0a41c140f326c738cf821002e"}},{"ruleId":"D2","level":"warning","message":{"text":"File.to_resource_content (cognitive 17): File.to_resource_content has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts) (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":"fastmcp_slim/fastmcp/utilities/types.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed14a4e567bafc6751c91cece9b877e9ccb02eee49057db127aa851dc900e8d4"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_native_triage.run_native_triage (cognitive 16): agentic_native_triage.run_native_triage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (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":".github/agentic/flows/agentic_native_triage.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6393987c57cc6ba48a61d980918ea3314be3ec019e0cb71e6a6799b7b1706e4"}},{"ruleId":"D2","level":"warning","message":{"text":"agentic_verification_inputs.manifest (cognitive 16): agentic_verification_inputs.manifest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (5 pts), error handling 1 (3 pts), boolean chains 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":".github/agentic/flows/agentic_verification_inputs.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b2630b9fd0fb5f28bfa8ce5edc9a44920f8e8be9b8ccc0797f89be8cd65b6a"}},{"ruleId":"D2","level":"warning","message":{"text":"authentication.poll_device_authorization (cognitive 16): authentication.poll_device_authorization has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1, ternaries 1 (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":"fastmcp_slim/fastmcp/cli/deploy/authentication.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ec741363a033b448d0332c58e36019903d71fd4a35922dbfc8ab347cafdaed"}},{"ruleId":"D2","level":"warning","message":{"text":"discovery._scan_goose (cognitive 16): discovery._scan_goose has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, error handling 2, loops 1 (nesting depth added 3). 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":"fastmcp_slim/fastmcp/cli/discovery.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"793bcb5ec0dc14ae5c30819f67c0257e106164b80e54362904c3a65314e851da"}},{"ruleId":"D2","level":"warning","message":{"text":"OAuthProxy.authorize (cognitive 16): OAuthProxy.authorize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, ternaries 2 (3 pts) (nesting depth added 3). 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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ed05717da82b8ef6ea0b1919ec6c68ec20d0959d467625a8914fbd7596d762"}},{"ruleId":"D2","level":"warning","message":{"text":"OAuthProxy._try_transparent_refresh (cognitive 16): OAuthProxy._try_transparent_refresh has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, ternaries 4 (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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f70b1bf5e52d088e02290eb183e7f49b3467e11f9f4a07deb51380546da7a75"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.session_id (cognitive 16): Context.session_id has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1 (nesting depth added 3). 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":"fastmcp_slim/fastmcp/server/context.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"969c607fd3dc8eba7b2e83fc4b67f7dd271480da98c24ef7807eff645d011a6f"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionsMixin._register_bundled_extensions (cognitive 16): ExtensionsMixin._register_bundled_extensions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, 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":"fastmcp_slim/fastmcp/server/mixins/extensions.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a763ac2b773f55ea918fb02a60f853c605ffc5d9c526c940b8abee382d98e9fd"}},{"ruleId":"D2","level":"warning","message":{"text":"TransportMixin.run_http_async (cognitive 16): TransportMixin.run_http_async has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, ternaries 5, boolean chains 4. 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":"fastmcp_slim/fastmcp/server/mixins/transport.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"6474f4f69be040ca0e82ce4d4fcfa8704fb948ef8169cbbc9821da8ebd540187"}},{"ruleId":"D2","level":"warning","message":{"text":"components._extract_mime_type_from_route (cognitive 16): components._extract_mime_type_from_route has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (4 pts), boolean chains 1 (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":"fastmcp_slim/fastmcp/server/providers/openapi/components.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f26302b4aa9d7d643854e61a02abbb69e5a39b7cf487b67251841b67a039e82"}},{"ruleId":"D2","level":"warning","message":{"text":"FastMCP.render_prompt (cognitive 16): FastMCP.render_prompt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 1 (4 pts), error handling 3, loops 1 (3 pts) (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":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"81135094f51f5f1ea6a248497b74e2ec800ded331e38907678f0a8731e95a723"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillFrontmatter.validate_agent_skills_fields (cognitive 16): SkillFrontmatter.validate_agent_skills_fields has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/skills/models.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be27ec66454464e59c1f0b32c828dd536a58366c342d62637f715e1b710adbe"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPSkill.validate_entry (cognitive 16): MCPSkill.validate_entry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 1 (2 pts), ternaries 1 (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":"fastmcp_slim/fastmcp/skills/models.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fddb91f50902d041e4ad8c9d153b5b1c421f832f42540e191bd097ca165790"}},{"ruleId":"D2","level":"warning","message":{"text":"handlers.tasks_get (cognitive 16): handlers.tasks_get has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 2 (4 pts), boolean chains 1 (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":"fastmcp_tasks/fastmcp_tasks/handlers.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6f8498bcaa83912cabdf1ded7975169fb20f50bc7e3826def11e988a2ca52c"}},{"ruleId":"D2","level":"warning","message":{"text":"operations.chart (cognitive 16): operations.chart has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (9 pts), boolean chains 5, if/else 2 (nesting depth added 3). Of this number, 13 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"status-site/operations.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbb8d142dc09c662d5375dc803d9449d8579dee4cebed2c70a60769b4da8ef4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oauth_proxy/proxy.py: FileTooLong \u2014 1573 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1073 over it, 3.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44791040b07bf9028e288c0bc85d35cd48c54cf77db7aec4df20c5c4fa0efefa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/server.py: FileTooLong \u2014 1415 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 915 over it, 2.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e69d6ebf909676cd2c7639fa1164fdcc9b1a5bcc5e5072739bf500f0739132"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/apps_dev.py: FileTooLong \u2014 1294 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 794 over it, 2.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/apps_dev.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b05deac5b0e05ab9915e9965a28cf15a4d44b2015d9e96d6dafc8814045fe5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/proxy.py: FileTooLong \u2014 1238 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 738 over it, 2.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/proxy.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4799f8d2fb4e1910d34917a905319f7358ff31ec4c70d615a1ebb973583d47c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utilities/json_schema_type.py: FileTooLong \u2014 1018 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 518 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema_type.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1fec3597bdd437cf467886a77d4b617d124b055d3968439a0137f807fd259c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/client.py: FileTooLong \u2014 875 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 375 over it, 1.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/client.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f65b9ce781052cf7b2a59cf350995c2425a6aed5cf0f7d7915e247f3354a668"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FastMCP: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. 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":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed56bcfc8e8a9c2df44bdb6ea7935d549eb78d319240ecd4620a16917a09f8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/client.py: FileTooLong \u2014 794 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 294 over it, 1.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/client.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"402eb83c9a2768f86446db02d59a58ac105c53690414403c36ba67a7e1f7d2a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/cli.py: FileTooLong \u2014 782 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 282 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/cli.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c73158c2ed9b590429ed7eef0c6771137efd44fe724c274aceb79e56e9785b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/dependencies.py: FileTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 205 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/dependencies.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adf7ee605d3d450d90a97851a457da18eafe377aa57e4f6c66653261b0500e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/tool_transform.py: FileTooLong \u2014 680 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 180 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/tools/tool_transform.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f359afa1ebf45b5556acded5753d875a7de47ef05a9d5848e3a1d5be6ed9287"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Client: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. 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":"fastmcp_slim/fastmcp/client/client.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c60ff4e907e4262d5b30c8414c6c1d8f66bcc40937067cdf112d332e9506f57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/context.py: FileTooLong \u2014 661 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 161 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/context.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a8598dc39d31859e173e8bbfecb41ab46c8107a5f64d0699788711c3d3a4a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: auth/auth.py: FileTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 137 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/auth.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"736cbc3e63d17a63d5fa7d2b0363862f2e28105f78055a27606f66f1557b9d3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openapi/schemas.py: FileTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 134 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/schemas.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a22e35f9ea5ff20f9e0d0c470087299e0f779b78ad32aa4620211b71f7db31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/generate.py: FileTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 123 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/generate.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6ffe056c2e8f694c2b15f2301407ba29adf702fb71c8aac0fa1216c53662cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openapi/parser.py: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/parser.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fc6fdf8759e352b1bfec2fdb15cdf5830e4df830f48cb661ba3189cea93714"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: status-site/app.js: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 78 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"status-site/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e8b6b82644cdf81f102124c70deb2910f12da33007429dd2ad139954635cbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resources/template.py: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 69 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/resources/template.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58a3db8213ae3aef1f9651e9ba80e38b18adc18a7ca76d9627c3a49dbfb3b4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: operations.render: FunctionTooLong \u2014 render runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"status-site/operations.js"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac8205bb1670320c4219c6711c85f623cba1a96444cbd1456a7a55a42fd1798"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openapi/director.py: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/director.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a06e032f8ed6b143e7387c32208db17ef77c65bb91e17aa201804b237d88c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: app.backlog: FunctionTooLong \u2014 backlog runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"status-site/app.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4f1a495538c6130ce14050982c7a0ef91643452c93542d57f539ffaae05671"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Provider: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. 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":"fastmcp_slim/fastmcp/server/providers/base.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fb077e9a6768635b821ac3e937dacf36774bfa000a4c76fc9c72da06c555e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utilities/json_schema.py: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6ad50b73197092fa635ef62e050d58ddc4d8de4a498875a781c989195aed71"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/http.py: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/http.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"610fb74976f66d24cd66e8617b03fe6ff325187eb5d32f4cc04833db4da47055"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): fastmcp_slim/fastmcp/cli/install/claude_code.py:85-152 | fastmcp_slim/fastmcp/cli/install/claude_desktop.py:62-136 | fastmcp_slim/fastmcp/cli/install/cursor.py:72-140 | fastmcp_slim/fastmcp/cli/install/cursor.py:156-225 | fastmcp_slim/fastmcp/cli/install/gemini_cli.py:81-149 | fastmcp_slim/fastmcp/cli/install/mcp_json.py:34-97 | fastmcp_slim/fastmcp/cli/install/stdio.py:32-75 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/install/claude_code.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cb8be7b0485406566281214716ffd3bc7fbcdba63033a50d2089743802f959"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): fastmcp_slim/fastmcp/client/mixins/prompts.py:34-70 | fastmcp_slim/fastmcp/client/mixins/resources.py:35-71 | fastmcp_slim/fastmcp/client/mixins/resources.py:126-165 | fastmcp_slim/fastmcp/client/mixins/tools.py:41-89 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/mixins/prompts.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cffb2dbf844228a587661cb0151dd646694f7ab58450cdbff998e8bca1df0a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (148 corresponding lines): fastmcp_slim/fastmcp/utilities/inspect.py:101-248 | fastmcp_slim/fastmcp/utilities/inspect.py:252-410 \u2014 These two members are one piece of code written twice and then edited apart: 148 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/inspect.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a19e1f016f5bfee1a57ca67675d8cbc058af70cefa7c0889dfe3465796bdc6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (110 corresponding lines): fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:122-231 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py:233-362 \u2014 These two members are one piece of code written twice and then edited apart: 110 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5bd53a00fe8679b998a96a83271c9dd4e40499f0cdf09f4ad10ff91b2a1b03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): fastmcp_slim/fastmcp/prompts/function_prompt.py:424-467 | fastmcp_slim/fastmcp/tools/function_tool.py:626-687 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/prompts/function_prompt.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd45d11e78273daffe681e95b6ede078e361bac81e52a1026164a82e5bd1f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 42\u002B corresponding lines): fastmcp_slim/fastmcp/server/server.py:1096-1150 | fastmcp_slim/fastmcp/server/server.py:1239-1290 | fastmcp_slim/fastmcp/server/server.py:1371-1412 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 42 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ef8cadb5f49368eeefbe9d59b8de3672130cdfb0240c3f312e49603de0d8a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 50\u002B corresponding lines): fastmcp_slim/fastmcp/server/middleware/authorization.py:243-306 | fastmcp_slim/fastmcp/server/middleware/authorization.py:338-404 | fastmcp_slim/fastmcp/server/middleware/authorization.py:467-516 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 50 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/authorization.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e529555d0da9ee5a690531854140f3116dbb7599a2b27e3ee00704c1b84e159"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): fastmcp_slim/fastmcp/server/auth/providers/in_memory.py:174-218 | fastmcp_slim/fastmcp/server/auth/providers/in_memory.py:242-290 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/in_memory.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"523c8a90674c94727767a1a49ab12d575c908951ac721a696ca533de3ba4af1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py:134-181 | fastmcp_slim/fastmcp/client/sampling/handlers/openai.py:136-177 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"991956664503855df9a5532767f9232b630ab5ebe7098af9624fea324f89bf41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (111 corresponding lines): fastmcp_slim/fastmcp/server/auth/providers/clerk.py:311-421 | fastmcp_slim/fastmcp/server/auth/providers/google.py:305-441 \u2014 These two members are one piece of code written twice and then edited apart: 111 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/clerk.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc98f65df39ba318dcb9fc66f9b2c70e792db24ad6e1d40717319c5240a88b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): fastmcp_slim/fastmcp/utilities/json_schema_type.py:1327-1362 | fastmcp_slim/fastmcp/utilities/json_schema_type.py:1428-1463 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema_type.py"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2467c13602344e5f37c3d1954bf4d2e33cd9e4e27b98a48525447f69564e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:395-440 | fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:447-488 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/mixins/mcp_operations.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5997d5c0b718c4f67040da71d9d87777d40e7be06068b46f073984ad846eb3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 75\u002B corresponding lines): fastmcp_slim/fastmcp/server/auth/providers/discord.py:220-313 | fastmcp_slim/fastmcp/server/auth/providers/github.py:344-434 | fastmcp_slim/fastmcp/server/auth/providers/huggingface.py:206-280 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 75 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/discord.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5768b41689da0fc815ae4ab24db97b92c75bf7d3e3a38fce97ba3caf0bb53b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): fastmcp_slim/fastmcp/server/middleware/caching.py:543-584 | fastmcp_slim/fastmcp/server/middleware/caching.py:592-624 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/caching.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"974d24ba8c969ae2773d136a35a268a4994251fdc55be1542598af552f42c884"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): fastmcp_slim/fastmcp/server/auth/providers/auth0.py:111-193 | fastmcp_slim/fastmcp/server/auth/providers/oci.py:148-218 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/auth0.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d96b322bcd30f9670e4d9b4f6992e6d0e4eb2702479f3859dc8310e9a58f37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 40\u002B corresponding lines): fastmcp_slim/fastmcp/client/mixins/prompts.py:76-117 | fastmcp_slim/fastmcp/client/mixins/resources.py:77-118 | fastmcp_slim/fastmcp/client/mixins/resources.py:171-214 | fastmcp_slim/fastmcp/client/mixins/skills.py:126-165 | fastmcp_slim/fastmcp/client/mixins/tools.py:97-143 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 40 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/mixins/prompts.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ceec92d382244343c3edf94079bf8fcafda220df1c1f988e861c4a4d056273"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): fastmcp_slim/fastmcp/server/auth/providers/auth0.py:247-289 | fastmcp_slim/fastmcp/server/auth/providers/workos.py:372-424 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/auth0.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fb5de192e7a8a70a89be4ad87868cbc9f188b599614abe554575457b94bc95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 26\u002B corresponding lines): fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:219-244 | fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:247-272 | fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:275-302 | fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:305-330 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"768f8a798af7d3cc049273227e00a52572a97d9b34f8439361ab18e06b7d60e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): .github/agentic/flows/agentic_artifacts.py:55-79 | .github/agentic/flows/agentic_stack_runtime.py:209-224 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_artifacts.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b745c534097e5889667eaeaf5bb3ca1bce1c4a89b1f711ec9304f65514f936d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): fastmcp_slim/fastmcp/resources/base.py:450-463 | fastmcp_slim/fastmcp/resources/template.py:590-603 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/resources/base.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"21aff76ef7dc815aa1c60a6a652591a6c4797e507cb9caf575bd6d465ab7fbf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 23\u002B corresponding lines): fastmcp_slim/fastmcp/server/providers/proxy.py:1056-1078 | fastmcp_slim/fastmcp/server/providers/proxy.py:1133-1155 | fastmcp_slim/fastmcp/server/providers/proxy.py:1177-1199 | fastmcp_slim/fastmcp/server/providers/proxy.py:1221-1243 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/proxy.py"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e76becc6075b0253efa8944e8625154fb9f9cdfe087d4d3afc72fa9b1bd806"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): fastmcp_slim/fastmcp/client/transports/stdio.py:416-458 | fastmcp_slim/fastmcp/client/transports/stdio.py:476-498 | fastmcp_slim/fastmcp/client/transports/stdio.py:514-551 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/transports/stdio.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f65f42f0e3d4f64bfbbd55db49a8bc4119dca6c9ba1127ff51590801bdaa002"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): fastmcp_slim/fastmcp/server/middleware/caching.py:377-402 | fastmcp_slim/fastmcp/server/middleware/caching.py:410-435 | fastmcp_slim/fastmcp/server/middleware/caching.py:443-466 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/caching.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"b000da77283e58eec0fa24676a3259211d9a0770087836510eea2c93fdd5400c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:288-314 | fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:374-398 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/experimental/transforms/jev_search.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"927b5ed3f1c50aa9a8cf340879249cabe0a8ef4b13a246363764c9c41b367aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): fastmcp_slim/fastmcp/server/server.py:1204-1234 | fastmcp_slim/fastmcp/server/server.py:1326-1368 | fastmcp_slim/fastmcp/server/server.py:1448-1486 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"761b3a4e78490563f888697b7a087ac0018f5466c78f4976f043b6a88778df65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): fastmcp_slim/fastmcp/cli/apps_dev.py:1109-1127 | fastmcp_slim/fastmcp/cli/apps_dev.py:1131-1153 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/apps_dev.py"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"13143e7a7856864e8f9f737fdcdac60a92723455a3e048e24dc8968870a4955c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:319-336 | fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:341-365 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/experimental/transforms/jev_search.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5773fb9a39f86dad9f82b1e1ae27fd98d5b0d161b99c94fe3620125ce4971fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 32\u002B corresponding lines): fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:50-81 | fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:91-127 | fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:136-167 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d00adc4ad8d16402743871261b754a540ab678fa4d83705b6db83dfeed6536"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 27\u002B corresponding lines): fastmcp_slim/fastmcp/server/auth/providers/auth0.py:312-338 | fastmcp_slim/fastmcp/server/auth/providers/propelauth.py:145-183 | fastmcp_slim/fastmcp/server/auth/providers/supabase.py:141-181 | fastmcp_slim/fastmcp/server/auth/providers/workos.py:452-492 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/auth0.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c257144d670eff667fe747da20aecebe0379361e5514ab6fc22364ee64ac11e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:222-239 | fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:246-263 | fastmcp_slim/fastmcp/server/mixins/mcp_operations.py:270-282 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/mixins/mcp_operations.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4950a281eebc56f2cbd5a5610ee67ff659c8402f0e7de7e3557a94037895ea43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): fastmcp_slim/fastmcp/cli/discovery.py:150-163 | fastmcp_slim/fastmcp/cli/install/claude_desktop.py:21-46 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/discovery.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9f42c78216d5d4e4b93bfb37b112d8c423945aa202d84477cb9451ca068182"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): fastmcp_slim/fastmcp/client/mixins/skills.py:84-118 | fastmcp_slim/fastmcp/client/mixins/skills.py:173-209 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/mixins/skills.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe9d182b9bfa9d6e48752bcce30c3cb49b6fa08470ce92dfc108074192f4861"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): fastmcp_slim/fastmcp/server/auth/jwt_issuer.py:115-173 | fastmcp_slim/fastmcp/server/auth/jwt_issuer.py:183-230 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/jwt_issuer.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9142cec172681173f3dd675345abe9a7b5df2e100b0725a3a83c7e807e02e3c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): fastmcp_slim/fastmcp/server/middleware/authorization.py:215-236 | fastmcp_slim/fastmcp/server/middleware/authorization.py:313-333 | fastmcp_slim/fastmcp/server/middleware/authorization.py:413-433 | fastmcp_slim/fastmcp/server/middleware/authorization.py:440-460 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/authorization.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f1d5285241e417688147845a5147601699afe39d5ebb16edf833b666bf9ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): fastmcp_slim/fastmcp/server/providers/proxy.py:1083-1093 | fastmcp_slim/fastmcp/server/providers/proxy.py:1160-1170 | fastmcp_slim/fastmcp/server/providers/proxy.py:1204-1214 | fastmcp_slim/fastmcp/server/providers/proxy.py:1248-1258 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/proxy.py"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b26872a0420f731f617faf2d294b3017a88a35116b8c5a89fd0d86c976d056"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): fastmcp_slim/fastmcp/server/transforms/visibility.py:188-204 | fastmcp_slim/fastmcp/tools/tool_transform.py:1181-1200 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/transforms/visibility.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9fd4c1e50da36929da44b763724a595a5f4a4089e20484ffd333ce0f63a491"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 27\u002B corresponding lines): fastmcp_slim/fastmcp/cli/install/claude_code.py:214-242 | fastmcp_slim/fastmcp/cli/install/claude_desktop.py:205-232 | fastmcp_slim/fastmcp/cli/install/cursor.py:294-321 | fastmcp_slim/fastmcp/cli/install/gemini_cli.py:211-239 | fastmcp_slim/fastmcp/cli/install/mcp_json.py:166-193 | fastmcp_slim/fastmcp/cli/install/stdio.py:130-156 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/install/claude_code.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d2e41c7ab7af9eaa98601bade16b1a17a36b6bb8d189f72b22d420cec6a043"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): fastmcp_tasks/fastmcp_tasks/input_store.py:285-302 | fastmcp_tasks/fastmcp_tasks/input_store.py:308-318 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_tasks/fastmcp_tasks/input_store.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c96a36f2afcd8b240fb26d9c010151d5722f2b3c6b751279d86a98dfcb33bd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): fastmcp_slim/fastmcp/server/providers/base.py:349-374 | fastmcp_slim/fastmcp/server/providers/base.py:389-417 | fastmcp_slim/fastmcp/server/providers/base.py:432-455 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/base.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f38db168ca1a696f5f25469c15dba9438e0919d6bba355333dde9143a15441"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): fastmcp_slim/fastmcp/client/auth/client_credentials.py:241-265 | fastmcp_slim/fastmcp/client/auth/client_credentials.py:381-404 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/auth/client_credentials.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa99529f9727b17b50726950c3a4bc9aa7acd46875b66814254027ba25a8b5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): fastmcp_slim/fastmcp/tools/tool_transform.py:1009-1019 | fastmcp_slim/fastmcp/tools/tool_transform.py:1025-1035 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/tools/tool_transform.py"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"2803cfcff80895ca5fce95042d59dbe4f453d9f282a194a55a293284b6580d09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): fastmcp_slim/fastmcp/server/middleware/logging.py:179-200 | fastmcp_slim/fastmcp/server/middleware/logging.py:230-252 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/logging.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0a508717d29e8b728bb16ef669515d22180e24c3f97c3fb58d0deaaa94ecbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): fastmcp_slim/fastmcp/server/server.py:1295-1321 | fastmcp_slim/fastmcp/server/server.py:1417-1443 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37b31509c668414d1ed33afed539f1f31f473a8b8dcde1c4486ee91450736fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:201-223 | fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:278-300 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02954477b9991d21872cffad7b6e8913d541debe381aebc32d9cde18d409d05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py:379-394 | fastmcp_slim/fastmcp/client/sampling/handlers/openai.py:427-445 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fe079172d310e1cfb654d7ddfcc75764be16bd523484d512ef5e3681a54866"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): fastmcp_slim/fastmcp/server/providers/proxy.py:399-413 | fastmcp_slim/fastmcp/server/providers/proxy.py:572-587 | fastmcp_slim/fastmcp/server/providers/proxy.py:690-706 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/proxy.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"9483559d69b304e267f4fcb457081b1b2d2cb04a9a66d2ed2b6dad404388e153"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): fastmcp_slim/fastmcp/server/auth/cimd.py:56-61 | fastmcp_slim/fastmcp/server/auth/providers/jwt.py:51-58 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/cimd.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c0c06fbb46a3cd597cb3ac91913a23eb9eb54b3f2c78f1439bf7ceefbb1a27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py:61-77 | fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py:152-167 | fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py:214-227 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ee1de86052d9dc3c5db9ebf409767a4943b2344245a2f6c6d797f20785196b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py:187-204 | fastmcp_slim/fastmcp/client/sampling/handlers/openai.py:183-202 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa910bfa88b7cfa5bd50590a1b5d0195ba40cbb6c4198ca081912d8854d90b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:343-358 | fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:367-382 | fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:391-408 | fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py:417-432 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/local_provider/local_provider.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c2e9e22e2a33b2eff7d32be862117b2d9d49eb7ddda99489876c571e95488c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): fastmcp_slim/fastmcp/utilities/types.py:257-266 | fastmcp_slim/fastmcp/utilities/types.py:402-412 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/types.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bbedce743f0f7ae66c6f230568130077a8e9ad3c3eb26625260a27344f0515"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): fastmcp_slim/fastmcp/server/providers/base.py:472-491 | fastmcp_slim/fastmcp/server/providers/base.py:566-584 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/base.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"993b0b96104df6d118a9483da2f556a695be060ce9ef9ec4ae52bcdec0cdcfe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py:463-474 | fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py:477-492 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca6d7614d943919978bb3a755a30a233f2654cfa0cd8ae2e91824cef76b7efe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): fastmcp_slim/fastmcp/server/auth/providers/auth0.py:292-306 | fastmcp_slim/fastmcp/server/auth/providers/workos.py:427-446 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/auth0.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a315cc4d69c1f42051db79c83804db998592bb42fb7c462dd920026bb01ad5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): fastmcp_slim/fastmcp/server/auth/cimd.py:521-527 | fastmcp_slim/fastmcp/server/auth/identity_assertion.py:245-250 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/cimd.py"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"95edf18618d11dbd6f7f5a7c3ba423c48fed5faf3c46f2e37ba41b8e8b6d6ec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): fastmcp_slim/fastmcp/resources/base.py:364-381 | fastmcp_slim/fastmcp/resources/template.py:492-506 | fastmcp_slim/fastmcp/tools/base.py:418-436 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/resources/base.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"732ec4d8cd959d67cf0a773a2e1acceba3d993f8ee49afc09ec1d3ca2c17505c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): fastmcp_slim/fastmcp/server/providers/proxy.py:1412-1419 | fastmcp_slim/fastmcp/server/providers/proxy.py:1429-1436 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/proxy.py"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc483802b00bf6fc3304ca752d819f88b143472f45be1b7ef141060025a05aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): .github/agentic/flows/agentic_stack_runtime.py:234-250 | .github/agentic/flows/agentic_triage.py:90-96 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_stack_runtime.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"7500bc7761ba31e295f98fb451d62dcdff1f64bf65bb24c1cc17294b84878ddc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): fastmcp_slim/fastmcp/apps/config.py:180-187 | fastmcp_slim/fastmcp/server/providers/prefab_synthesis.py:64-70 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/apps/config.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebea7194817cc8fd6c20fff1cb350caa39795ebd9850e67dfd22706fd19cb5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): fastmcp_slim/fastmcp/server/dependencies.py:143-151 | fastmcp_slim/fastmcp/tools/base.py:678-687 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/dependencies.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"636d97c596f93f3099b4aa0a22fba6b563bdb57a9a5390fe244be1a94840f052"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): fastmcp_slim/fastmcp/resources/base.py:466-466 | fastmcp_slim/fastmcp/resources/template.py:474-474 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/resources/base.py"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"700954f114d9be4959f907bf22ac26acbd2aacfadee2bf5b701b9e19e7b8d731"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): fastmcp_slim/fastmcp/server/providers/openapi/provider.py:54-58 | fastmcp_slim/fastmcp/utilities/exceptions.py:12-16 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/openapi/provider.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12c5eb4ca362c84be82b2b3f060fcde8870abc8eb083ebc43594d9cb68918d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56\u201368 lines \u00D7 2): fastmcp_slim/fastmcp/server/auth/providers/auth0.py:111-178 | fastmcp_slim/fastmcp/server/auth/providers/oci.py:148-203 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fastmcp_slim/fastmcp/server/auth/providers/auth0.py:111\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":"fastmcp_slim/fastmcp/server/auth/providers/auth0.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d938086e47e62964c466c7b396ceb6df46c16297dcacf82c42551b6aa695b1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201334 lines \u00D7 2): fastmcp_slim/fastmcp/server/auth/providers/discord.py:280-313 | fastmcp_slim/fastmcp/server/auth/providers/github.py:402-434 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fastmcp_slim/fastmcp/server/auth/providers/discord.py:280\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":"fastmcp_slim/fastmcp/server/auth/providers/discord.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e895fc5b80d2308efdf9340f39c2f3befee8627159bc6c07e2ee7fb0fb2342d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): fastmcp_slim/fastmcp/prompts/function_prompt.py:439-467 | fastmcp_slim/fastmcp/tools/function_tool.py:659-687 \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 \u0060fastmcp_slim/fastmcp/prompts/function_prompt.py:439\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":"fastmcp_slim/fastmcp/prompts/function_prompt.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3c5c6f03620ce0cd0f1bebf2c0959df01906b5f8fca65b2332cd1b50cede6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): fastmcp_slim/fastmcp/utilities/json_schema_type.py:1327-1354 | fastmcp_slim/fastmcp/utilities/json_schema_type.py:1428-1456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema_type.py"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67c0a5b10c81507afbd99d6242c776928d0d950552c0371328896b1273c16b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 4): fastmcp_slim/fastmcp/client/mixins/prompts.py:34-61 | fastmcp_slim/fastmcp/client/mixins/resources.py:35-62 | fastmcp_slim/fastmcp/client/mixins/resources.py:126-153 | fastmcp_slim/fastmcp/client/mixins/tools.py:41-70 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/mixins/prompts.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14c715a0f59493cbfd27368876bc09e1c82911fc2bb738ca206f44fa2759ac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): fastmcp_slim/fastmcp/client/transports/stdio.py:416-443 | fastmcp_slim/fastmcp/client/transports/stdio.py:514-541 \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":"fastmcp_slim/fastmcp/client/transports/stdio.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7102e3b42cbbfc89ed1803d5c37d2b8fa83c992f5928906459bd0c4afa9db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): fastmcp_slim/fastmcp/server/providers/proxy.py:609-634 | fastmcp_slim/fastmcp/server/providers/proxy.py:742-769 \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 \u0060fastmcp_slim/fastmcp/server/providers/proxy.py:742\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":"fastmcp_slim/fastmcp/server/providers/proxy.py"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"8406bfb8f9213373b6e7c2f7a80fb33706badccf082340cb0898289b06db3001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): fastmcp_slim/fastmcp/cli/install/mcp_json.py:34-62 | fastmcp_slim/fastmcp/cli/install/stdio.py:32-58 \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":"fastmcp_slim/fastmcp/cli/install/mcp_json.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8c978a8cae20361e27d8bcd87a71ebf0fab564ab298b4e4e6e122db25f84f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): fastmcp_slim/fastmcp/cli/install/claude_desktop.py:88-113 | fastmcp_slim/fastmcp/cli/install/cursor.py:102-127 \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":"fastmcp_slim/fastmcp/cli/install/claude_desktop.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9b117562ba56a768559119d48b2b88a3818e3164f4a2b2f598af56b2b0aa92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201326 lines \u00D7 2): fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py:670-695 | fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py:716-735 \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 \u0060fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py:716\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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3d821a962be94de07cc495d343f845ad6e172a4bc154d2f57511e4812f6128"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201326 lines \u00D7 2): fastmcp_slim/fastmcp/server/auth/providers/github.py:123-142 | fastmcp_slim/fastmcp/server/auth/providers/google.py:118-143 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The 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":"fastmcp_slim/fastmcp/server/auth/providers/github.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e75ef72b5b4b26c15287a92ac00342cd828885854eb1e65acb8ffcf89144b36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): fastmcp_slim/fastmcp/server/middleware/authorization.py:243-268 | fastmcp_slim/fastmcp/server/middleware/authorization.py:467-490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060call_next\u0060 to \u0060CallNext[mt.CallToolRequestParams, ToolResult]\u0060 in one and \u0060CallNext[mt.GetPromptRequestParams, PromptResult]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/authorization.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c83059db4b150f6ae3f6997f96af7164e9e772e9edb074be9de1f5e665ce81e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201324 lines \u00D7 2): fastmcp_slim/fastmcp/server/server.py:1757-1780 | fastmcp_slim/fastmcp/server/server.py:1822-1841 \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 \u0060fastmcp_slim/fastmcp/server/server.py:1757\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":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f788ec3baee18cb01b5bee2cf90b2da6fbc7f0681c6239584cc7ab484a08d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py:1973-1995 | fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py:2187-2207 \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 \u0060fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py:1973\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py:1998\u0060 calls \u0060max\u0060 and \u0060fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py:2208\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"98aa8b43d2ca2d26d63dea23d2cd149f7bbaa265f17528146820f3464d537429"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:288-309 | fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:374-394 \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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060names\u0060 to \u0060Sequence[str]\u0060 in one and \u0060list[str]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/experimental/transforms/jev_search.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b0e06903291d7b504fc53667e7f78de1f73b2d9b4b6158c20d259049da88eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:190-207 | fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:236-256 \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":"fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"254981309e8d84c62bed8e35e96a178816155547f02713e602fe15aef57da868"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 5): fastmcp_slim/fastmcp/server/auth/providers/auth0.py:174-193 | fastmcp_slim/fastmcp/server/auth/providers/aws.py:224-243 | fastmcp_slim/fastmcp/server/auth/providers/google.py:422-441 | fastmcp_slim/fastmcp/server/auth/providers/oci.py:199-218 | fastmcp_slim/fastmcp/server/auth/providers/workos.py:285-304 \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 all 5 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fastmcp_slim/fastmcp/server/auth/providers/auth0.py:174\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":"fastmcp_slim/fastmcp/server/auth/providers/auth0.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b7559a89093a45b279ac2c3c3a531e75c748090b1445c3dc9f8e563bbb55f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): fastmcp_slim/fastmcp/client/mixins/prompts.py:99-117 | fastmcp_slim/fastmcp/client/mixins/resources.py:100-118 | fastmcp_slim/fastmcp/client/mixins/tools.py:125-143 \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 all 3 call sites, so a change lands once. 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":"fastmcp_slim/fastmcp/client/mixins/prompts.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4432bf865065f374240f599f20729b0dd61e4cda93d39e8330b04e42b6cc282a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): fastmcp_slim/fastmcp/cli/cli.py:655-670 | fastmcp_slim/fastmcp/cli/cli.py:703-721 \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":"fastmcp_slim/fastmcp/cli/cli.py"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0ce047b1b09b55b81ca0fa7d870f352f41d78c06213f4190b731f6b5c9599d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): fastmcp_slim/fastmcp/cli/apps_dev.py:1037-1054 | fastmcp_slim/fastmcp/cli/apps_dev.py:1061-1078 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060fastmcp_slim/fastmcp/cli/apps_dev.py:1036\u0060 calls \u0060Pages\u0060 and \u0060fastmcp_slim/fastmcp/cli/apps_dev.py:1060\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/apps_dev.py"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"586122987a8b63f94e6657ea8ce25efc9eb2722413c06b98b108ff16cf55e181"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): fastmcp_slim/fastmcp/experimental/transforms/jev_search.py:219-236 | fastmcp_slim/fastmcp/server/transforms/search/bm25.py:117-132 \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":"fastmcp_slim/fastmcp/experimental/transforms/jev_search.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"793c6659ed93f93fef70e974f9f4c32e898da8ddb48e988da64dc35d1c4dd7d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py:2017-2033 | fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py:2042-2059 \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 \u0060fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py:2017\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":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":2017}}}],"partialFingerprints":{"codehealthFindingId/v1":"0582c1c617765856024bac8a70c68c72d0ad17a5d6aebb53f89b35a2519a82d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:168-185 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py:284-301 \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":"fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff1e4421031c1441b259f9b7917233e9c61e3229a1313162d4da78c2a6358d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): fastmcp_slim/fastmcp/server/server.py:1063-1080 | fastmcp_slim/fastmcp/server/server.py:1343-1362 | fastmcp_slim/fastmcp/server/server.py:1465-1481 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fastmcp_slim/fastmcp/server/server.py:1343\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. 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. 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":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cef80a9fe4e18b97021a6980c18d10a904c500b81dad82debb018306763518e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): fastmcp_slim/fastmcp/cli/install/claude_code.py:105-121 | fastmcp_slim/fastmcp/cli/install/gemini_cli.py:102-118 \u2014 before extracting anything, compare \u0060fastmcp_slim/fastmcp/cli/install/claude_code.py\u0060 and \u0060fastmcp_slim/fastmcp/cli/install/gemini_cli.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fastmcp_slim/fastmcp/cli/install/claude_code.py:105\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. 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":"fastmcp_slim/fastmcp/cli/install/claude_code.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40ab26cfd36679f74d3122d6434495154711eebde98775674fd1091924d0543"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): fastmcp_slim/fastmcp/server/auth/auth.py:108-124 | fastmcp_slim/fastmcp/server/auth/auth.py:128-144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/auth.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bcf0018886f7ed9f5e8a02294bdcc624dae4fc4f12d9a0f398633d0758510b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): fastmcp_slim/fastmcp/server/auth/providers/in_memory.py:182-198 | fastmcp_slim/fastmcp/server/auth/providers/in_memory.py:254-270 \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 \u0060fastmcp_slim/fastmcp/server/auth/providers/in_memory.py:182\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":"fastmcp_slim/fastmcp/server/auth/providers/in_memory.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ad11ad1fdb3ebafee77d302a9b58cf15590b8a6965a99f7661ab1a11c51876"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): fastmcp_slim/fastmcp/server/mixins/transport.py:433-449 | fastmcp_slim/fastmcp/server/mixins/transport.py:462-478 \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":"fastmcp_slim/fastmcp/server/mixins/transport.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7090a8145a81c711ce7451276a3047cc8f4aa401a86a5f705dce1d51b58d3a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:191-207 | fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py:214-231 \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":"fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee679a6adce46e71880dbc2806ca798a06b44fcb4b09202c6b8103884e64ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 7): fastmcp_slim/fastmcp/cli/install/claude_code.py:110-125 | fastmcp_slim/fastmcp/cli/install/claude_desktop.py:90-104 | fastmcp_slim/fastmcp/cli/install/cursor.py:104-118 | fastmcp_slim/fastmcp/cli/install/cursor.py:174-188 | fastmcp_slim/fastmcp/cli/install/gemini_cli.py:107-122 | fastmcp_slim/fastmcp/cli/install/mcp_json.py:52-66 | fastmcp_slim/fastmcp/cli/install/stdio.py:48-62 \u2014 before extracting anything, compare \u0060fastmcp_slim/fastmcp/cli/install/claude_code.py\u0060 and \u0060fastmcp_slim/fastmcp/cli/install/gemini_cli.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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":"fastmcp_slim/fastmcp/cli/install/claude_code.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1410ecc72ec1fd785c584f2da3637e96861c645bae93d60fdc40658080ad6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 7): fastmcp_slim/fastmcp/server/auth/providers/azure.py:283-298 | fastmcp_slim/fastmcp/server/auth/providers/clerk.py:395-410 | fastmcp_slim/fastmcp/server/auth/providers/discord.py:289-304 | fastmcp_slim/fastmcp/server/auth/providers/github.py:410-425 | fastmcp_slim/fastmcp/server/auth/providers/google.py:415-430 | fastmcp_slim/fastmcp/server/auth/providers/huggingface.py:247-262 | fastmcp_slim/fastmcp/server/auth/providers/workos.py:278-293 \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 all 7 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/azure.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a0514e8a0954aab04525f549366544a6a260165cb2ac947a2977ce63e0a7d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:196-211 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py:307-322 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:196\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":"fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6c93df11a9b350b7ffed2e6ad5edb564bd7b60c965f3b1adbbb4ad7b180b4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): fastmcp_slim/fastmcp/server/providers/openapi/components.py:255-270 | fastmcp_slim/fastmcp/server/providers/openapi/components.py:354-368 \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":"fastmcp_slim/fastmcp/server/providers/openapi/components.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d57d3f26ded8d8383b9c388d97ebd2f0f04d400874ed587191996a44037b15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): fastmcp_slim/fastmcp/utilities/inspect.py:128-142 | fastmcp_slim/fastmcp/utilities/inspect.py:151-165 | fastmcp_slim/fastmcp/utilities/inspect.py:176-190 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fastmcp_slim/fastmcp/utilities/inspect.py:128\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":"fastmcp_slim/fastmcp/utilities/inspect.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"247244d899512ffb8352bc364104b41ac023375b2ca565c403cf33affad6d62d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): fastmcp_slim/fastmcp/utilities/inspect.py:285-299 | fastmcp_slim/fastmcp/utilities/inspect.py:311-325 | fastmcp_slim/fastmcp/utilities/inspect.py:334-348 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fastmcp_slim/fastmcp/utilities/inspect.py:285\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":"fastmcp_slim/fastmcp/utilities/inspect.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde287572e03b38609ee62409a85eaac71f50573f37ce24600c007ca74f669f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): fastmcp_slim/fastmcp/resources/function_resource.py:254-268 | fastmcp_slim/fastmcp/tools/function_tool.py:653-667 \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 \u0060fastmcp_slim/fastmcp/resources/function_resource.py:254\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":"fastmcp_slim/fastmcp/resources/function_resource.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08d03080abb76d82412944cd4fcdf2b904c4d5443bb961fa1a065708d52437d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py:366-391 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:66-91 \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 \u0060fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py:366\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":"fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"95034b6738344502a0529b96d7cb73cdb410f28445486afb4a999e0706cacbdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:56-70 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:89-103 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:56\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b678324efae35ecb6c9e2962f8cf8f23cd829d8a52722dc103d7155f12a5a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): fastmcp_slim/fastmcp/cli/apps_dev.py:1222-1233 | fastmcp_slim/fastmcp/cli/apps_dev.py:1236-1249 \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":"fastmcp_slim/fastmcp/cli/apps_dev.py"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3420057001814d6c9c1cb5ece538ffabaca7501da6c238e02b1fc10fcdb636d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:196-209 | fastmcp_slim/fastmcp/tools/function_tool.py:652-665 \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 \u0060fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:196\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":"fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"507b29565456c0f05cba05ce3210ebc3dbdc0903ae690c4b297d289eb9cb19a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): fastmcp_slim/fastmcp/server/server.py:1308-1321 | fastmcp_slim/fastmcp/server/server.py:1430-1443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"307f96958244a7e3749fef72383d7cac0a54a186b4be516856a65efee535fbb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): fastmcp_slim/fastmcp/utilities/inspect.py:127-137 | fastmcp_slim/fastmcp/utilities/inspect.py:149-160 | fastmcp_slim/fastmcp/utilities/inspect.py:174-185 | fastmcp_slim/fastmcp/utilities/inspect.py:200-211 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fastmcp_slim/fastmcp/utilities/inspect.py:127\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":"fastmcp_slim/fastmcp/utilities/inspect.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"872fbb8a446d3f7b4e5133ca98eaf3f7cfe2fe6593a06db8066398d76adf570e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): fastmcp_slim/fastmcp/prompts/function_prompt.py:437-448 | fastmcp_slim/fastmcp/resources/function_resource.py:258-269 | fastmcp_slim/fastmcp/tools/function_tool.py:657-668 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fastmcp_slim/fastmcp/prompts/function_prompt.py:437\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":"fastmcp_slim/fastmcp/prompts/function_prompt.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"1215cbcc715e28380b077b28a9ac52c7a89439b0d43677811704a0d38af7d795"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): fastmcp_slim/fastmcp/cli/client.py:648-659 | fastmcp_slim/fastmcp/cli/client.py:740-751 \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":"fastmcp_slim/fastmcp/cli/client.py"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e090588439cf86106c7a44bf83bd6139bbe2ab0ed9ba8029daf59cf7529307"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): fastmcp_slim/fastmcp/cli/install/claude_code.py:141-152 | fastmcp_slim/fastmcp/cli/install/gemini_cli.py:138-149 \u2014 before extracting anything, compare \u0060fastmcp_slim/fastmcp/cli/install/claude_code.py\u0060 and \u0060fastmcp_slim/fastmcp/cli/install/gemini_cli.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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. 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":"fastmcp_slim/fastmcp/cli/install/claude_code.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e496b6be8cd7d27d8ab6ed5237702efbd5437f31f27209b56c533294a90b4c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): fastmcp_slim/fastmcp/cli/run.py:201-215 | fastmcp_slim/fastmcp/cli/run.py:224-235 \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 \u0060fastmcp_slim/fastmcp/cli/run.py:201\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":"fastmcp_slim/fastmcp/cli/run.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"881d308efdef385d48dac38378d200c867a814e5a1816360201a0b6482f984d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:168-178 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:174-184 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py:284-294 \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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py:168\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":"fastmcp_slim/fastmcp/server/providers/local_provider/decorators/prompts.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4aeba3ffef79fc27455f71ade94ee9ac3c73dd85451cd384eee1f3d24baa141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): fastmcp_slim/fastmcp/server/providers/openapi/provider.py:303-311 | fastmcp_slim/fastmcp/server/providers/openapi/provider.py:336-346 \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 \u0060fastmcp_slim/fastmcp/server/providers/openapi/provider.py:303\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060fastmcp_slim/fastmcp/server/providers/openapi/provider.py:335\u0060 calls \u0060_extract_mime_type_from_route\u0060 and \u0060fastmcp_slim/fastmcp/server/providers/openapi/provider.py:302\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/openapi/provider.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"9582167dff12d71d9920f45d31590d81710ec94ec9e3c118c55da4e5bf14ee49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): fastmcp_slim/fastmcp/utilities/json_schema_type.py:1379-1388 | fastmcp_slim/fastmcp/utilities/json_schema_type.py:1503-1513 \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":"fastmcp_slim/fastmcp/utilities/json_schema_type.py"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2584e56682997e6f55eed76429f22a10fd2c70d26a2b1ff2eef06fea56e4a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): fastmcp_slim/fastmcp/utilities/openapi/schemas.py:210-220 | fastmcp_slim/fastmcp/utilities/openapi/schemas.py:224-234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/schemas.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd05ed3f20941288324e77d88b2d17f61c78a9bcc449195d87d6914a270ce9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): fastmcp_slim/fastmcp/server/auth/identity_assertion.py:510-519 | fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py:181-190 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060claims\u0060 to \u0060dict\u0060 in one and \u0060dict[str, Any]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/identity_assertion.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"668895b6e9ede27058235ea1560e51ad4851003b30b6e6cacf6aaa62375b41d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py:365-374 | fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py:381-390 \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":"fastmcp_slim/fastmcp/server/providers/filesystem_discovery.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"260ce044361c78b08da9d1b67b01ab388db5fbde65c03c60cd7879f489402b5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:65-74 | fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py:81-90 \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":"fastmcp_slim/fastmcp/server/providers/local_provider/decorators/resources.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c841e71fb0c077cf9dada92fba92f83aafcc79159cb84cc35306f179a3a4bacb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fastmcp_slim/fastmcp/cli/cli.py:614-622 | fastmcp_slim/fastmcp/cli/run.py:190-198 \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":"fastmcp_slim/fastmcp/cli/cli.py"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4998ac18fd0a7a886a446f8aac7d6ae4773ea3f515f517fa50adda97487a198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fastmcp_slim/fastmcp/cli/discovery.py:151-159 | fastmcp_slim/fastmcp/cli/install/claude_desktop.py:33-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/discovery.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ef70a323056726483effdf601b12810deb81192c81fae65ef583fe71f39f9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fastmcp_slim/fastmcp/utilities/types.py:335-343 | fastmcp_slim/fastmcp/utilities/types.py:402-410 \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":"fastmcp_slim/fastmcp/utilities/types.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c38f5395f95438066ade905aea55c4cbf56dc100637d3612d1b9bab4cc39aee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): fastmcp_slim/fastmcp/cli/client.py:217-224 | fastmcp_slim/fastmcp/cli/client.py:231-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/client.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f3991f637d724f7a1a1c03b80f0b86cea83cdafe0a65090deecb4baec1b1b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fastmcp_slim/fastmcp/resources/base.py:455-463 | fastmcp_slim/fastmcp/resources/template.py:595-603 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fastmcp_slim/fastmcp/resources/base.py:455\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":"fastmcp_slim/fastmcp/resources/base.py"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"357ce5133df9695c92a442099ebf67fe8439a1c583fe2627136b0028c529bea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): fastmcp_slim/fastmcp/server/providers/proxy.py:1086-1093 | fastmcp_slim/fastmcp/server/providers/proxy.py:1251-1258 \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 \u0060fastmcp_slim/fastmcp/server/providers/proxy.py:1086\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. 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":"fastmcp_slim/fastmcp/server/providers/proxy.py"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce7bd4cc4d1b159b268089cc44e93d7978159a40c63289c1771627e31d97f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): fastmcp_slim/fastmcp/utilities/openapi/formatters.py:221-228 | fastmcp_slim/fastmcp/utilities/openapi/formatters.py:231-238 \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":"fastmcp_slim/fastmcp/utilities/openapi/formatters.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ad9154a7c06f113aea652eb141a1c26fae592945d8dec3b2ecdd4a502f4c67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): fastmcp_slim/fastmcp/utilities/types.py:295-301 | fastmcp_slim/fastmcp/utilities/types.py:375-381 \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":"fastmcp_slim/fastmcp/utilities/types.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c2382f69b2afab4d86cd21f18302c4ca3c076f0bf28374e47b6f3f649310e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:72-77 | fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:158-163 \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 \u0060fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py:72\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":"fastmcp_slim/fastmcp/contrib/mcp_mixin/mcp_mixin.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94377b6a0d0054003a856ca405181a13c8e8c03caa0b751e5f7540533ea7ff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): fastmcp_slim/fastmcp/server/auth/cimd.py:57-61 | fastmcp_slim/fastmcp/server/auth/providers/jwt.py:54-58 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060key_data\u0060 to \u0060dict[str, Any]\u0060 in one and \u0060JWKKeyData\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/cimd.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8984466451b3cdc5ddc496099f1ef898caf9c120d3b7d0424fa9ce4cff30e153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): fastmcp_slim/fastmcp/client/client.py:1641-1645 | fastmcp_slim/fastmcp/server/server.py:2641-2646 \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":"fastmcp_slim/fastmcp/client/client.py"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e93b1b4e313852d8d111828c80b080f5f941912b9f1b611c133787ce13f43bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): fastmcp_slim/fastmcp/server/providers/skills/claude_provider.py:37-44 | fastmcp_slim/fastmcp/server/providers/skills/vendor_providers.py:19-26 | fastmcp_slim/fastmcp/server/providers/skills/vendor_providers.py:37-44 | fastmcp_slim/fastmcp/server/providers/skills/vendor_providers.py:81-88 | fastmcp_slim/fastmcp/server/providers/skills/vendor_providers.py:117-124 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/skills/claude_provider.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f6558d09f2aaa472dc74ea2d6936c94aa8979fbcfc76aff5ae8b2de83243c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): fastmcp_slim/fastmcp/server/transforms/prompts_as_tools.py:62-71 | fastmcp_slim/fastmcp/server/transforms/resources_as_tools.py:65-74 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: \u0060FastMCP\u0060 names \u0060fastmcp\u0060 in one and \u0060fastmcp.server.server\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/transforms/prompts_as_tools.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b1e57ee19d45013d010f9a3d7a5cb8310624bf82f02449791bbe4e369a85e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py:594-608 | fastmcp_slim/fastmcp/server/providers/wrapped_provider.py:118-126 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The 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":"fastmcp_slim/fastmcp/server/providers/fastmcp_provider.py"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"6839f4c8a37a905504e41d4d96f73ed7c529eb0c0d612a3876cf01d7fba6ef06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py:46-52 | fastmcp_slim/fastmcp/tools/function_parsing.py:48-54 \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":"fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b6a760edd66bba8c2e48e23568c66b545a25e220c95427917506b58a9211ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (34 shared lines): examples/persistent_state/client.py:22-81 | examples/persistent_state/client_stdio.py:28-84 \u2014 These two members are variants of one another: 34 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/persistent_state/client.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa40e069a67bb7126d2633c189d09c4f78b0416f688fc4b85199080267ab868"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (13 members, 50\u002B identical tokens): examples/auth/aws_oauth/client.py:17-37 | examples/auth/azure_oauth/client.py:17-27 | examples/auth/clerk_oauth/client.py:18-28 | examples/auth/discord_oauth/client.py:17-27 | examples/auth/github_oauth/client.py:17-27 | examples/auth/google_oauth/client.py:17-27 | examples/auth/huggingface_oauth/client.py:17-27 | examples/auth/keycloak_oauth/client.py:15-28 | examples/auth/mounted/client.py:19-44 | examples/auth/oci_oauth/client.py:17-27 | examples/auth/propelauth_oauth/client.py:17-38 | examples/auth/scalekit_oauth/client.py:17-36 | examples/auth/workos_oauth/client.py:17-27 \u2014 These 13 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 13 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 13 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/auth/aws_oauth/client.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d33f5966aeaf312e3085c490b875ffe5e9955eced018c1535648645bc79d00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): examples/atproto_mcp/src/atproto_mcp/_atproto/_read.py:15-48 | examples/atproto_mcp/src/atproto_mcp/_atproto/_read.py:52-88 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/atproto_mcp/src/atproto_mcp/_atproto/_read.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6210e6c5a57e9841a52a60c1319af7fdd48b6e53321682d594574d3a38166018"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): examples/apps/contacts/contacts_server.py:104-142 | examples/apps/patterns_server.py:313-344 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/apps/contacts/contacts_server.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac046e6dbc0f4550fef0e0611f191856e5ff71d3c5f95d4057ed63faf3170e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): examples/atproto_mcp/src/atproto_mcp/_atproto/_social.py:44-74 | examples/atproto_mcp/src/atproto_mcp/_atproto/_social.py:78-108 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/atproto_mcp/src/atproto_mcp/_atproto/_social.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf950020664b39e56ec811cd1998954f2470deb9f47040818f748f45f5713a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): scripts/auto_close_duplicates.py:77-121 | scripts/auto_close_needs_mre.py:75-114 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/auto_close_duplicates.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c4d261392b0c4c7874ee2175fb02de9febf0506bccebf362f3441e8b6a8d05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): scripts/auto_close_duplicates.py:187-218 | scripts/auto_close_needs_mre.py:223-258 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/auto_close_duplicates.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"65da30c054173f1b6ebdbb268071dd2c0e067431f9cb1e52b60c4fb86a008e95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201325 lines \u00D7 4): examples/tags_example.py:52-66 | examples/tags_example.py:69-86 | examples/tags_example.py:89-113 | examples/tags_example.py:116-136 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/tags_example.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"823f2ae437d0acd38355cecae7a98c4004e01e73335f7df5185d60e5cb9cf67f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): examples/search/client_bm25.py:82-104 | examples/search/client_regex.py:81-105 \u2014 before extracting anything, compare \u0060examples/search/client_bm25.py\u0060 and \u0060examples/search/client_regex.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 92 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/search/client_bm25.py:82\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":"examples/search/client_bm25.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac8ad4fa29679bbeb8b2ed688729f886daa2bd382894fd4bf97d35f6611d3b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): examples/auth/propelauth_oauth/client.py:19-38 | examples/auth/scalekit_oauth/client.py:19-36 \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":"examples/auth/propelauth_oauth/client.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e52b3055848e0196aa13747c4de1bf75690fccc4e79037aaecc04c12d9abf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 3): examples/code_mode/client.py:80-94 | examples/search/client_bm25.py:77-95 | examples/search/client_regex.py:76-94 \u2014 before extracting anything, compare \u0060examples/code_mode/client.py\u0060 and \u0060examples/search/client_bm25.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/code_mode/client.py:80\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":"examples/code_mode/client.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fbf72122fde3b2623844811d72e20cbf94c3b6faad38ce4d1465ca4fe4dcd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): examples/persistent_state/client.py:53-71 | examples/persistent_state/client_stdio.py:57-75 \u2014 before extracting anything, compare \u0060examples/persistent_state/client.py\u0060 and \u0060examples/persistent_state/client_stdio.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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":"examples/persistent_state/client.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea108d3bc15a3a8aac0c5974a97e9e782637d575e6235f030b070e0fba60feb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): scripts/auto_close_needs_mre.py:117-135 | scripts/auto_close_needs_mre.py:155-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/auto_close_needs_mre.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"94295eafb8c94dbd4f3938e56cb536923c43e862f8bdd00725485fb352116c67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): examples/code_mode/client.py:53-68 | examples/search/client_bm25.py:50-65 | examples/search/client_regex.py:50-65 \u2014 before extracting anything, compare \u0060examples/code_mode/client.py\u0060 and \u0060examples/search/client_bm25.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/code_mode/client.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"54681195675953fb4fb9ae68da2b4bee359e4423781d318267186c43b10ce986"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): examples/atproto_mcp/src/atproto_mcp/_atproto/_social.py:44-58 | examples/atproto_mcp/src/atproto_mcp/_atproto/_social.py:78-92 \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":"examples/atproto_mcp/src/atproto_mcp/_atproto/_social.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6419d638020206b02d8db4530a6091de1b41d278baa83f44663828ef1cb2ef5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): examples/search/client_bm25.py:106-120 | examples/search/client_regex.py:107-119 \u2014 before extracting anything, compare \u0060examples/search/client_bm25.py\u0060 and \u0060examples/search/client_regex.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 92 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/search/client_bm25.py:106\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":"examples/search/client_bm25.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad01ac07f8b34e540305612d579ff88dfae65919f64f2a29c75baff91687c8a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): scripts/auto_close_duplicates.py:343-357 | scripts/auto_close_needs_mre.py:332-346 \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":"scripts/auto_close_duplicates.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"106fd22015ccdee9749b1150511c43589c2503ea6d6fdb8e3837de342e91fd6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): examples/apps/contacts/contacts_server.py:104-116 | examples/apps/patterns_server.py:313-325 \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":"examples/apps/contacts/contacts_server.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfd55b2537e49356f1218314e8151e12521f28cf043cb9a56901c235552163e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): scripts/auto_close_duplicates.py:103-115 | scripts/auto_close_needs_mre.py:96-108 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/auto_close_duplicates.py:103\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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060scripts/auto_close_needs_mre.py:109\u0060 calls \u0060get\u0060 and \u0060scripts/auto_close_duplicates.py:116\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/auto_close_duplicates.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24e84f5781ca14e85fca6b4a8f8cd46ee40241e97be81f2bc5ead1db4c7781a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/atproto_mcp/src/atproto_mcp/_atproto/_read.py:23-34 | examples/atproto_mcp/src/atproto_mcp/_atproto/_read.py:61-72 \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":"examples/atproto_mcp/src/atproto_mcp/_atproto/_read.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b360b03fe36c3b09afe168cedb84611ea97f4684a6c5f3332e0974eb776493f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): examples/persistent_state/client.py:23-32 | examples/persistent_state/client.py:44-54 | examples/persistent_state/client.py:66-76 \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":"examples/persistent_state/client.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a06a5e3a21315559e368718b8686e7378a04edf53b9f843f14135af2a32644a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): examples/code_mode/client.py:38-47 | examples/search/client_bm25.py:35-44 | examples/search/client_regex.py:35-44 \u2014 before extracting anything, compare \u0060examples/code_mode/client.py\u0060 and \u0060examples/search/client_bm25.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"examples/code_mode/client.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84218074aca8b61deae1abe7d62e92e554476cff325f984b924bc5bf0a6b570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 10): examples/auth/azure_oauth/client.py:19-27 | examples/auth/clerk_oauth/client.py:20-28 | examples/auth/discord_oauth/client.py:19-27 | examples/auth/github_oauth/client.py:19-27 | examples/auth/google_oauth/client.py:19-27 | examples/auth/huggingface_oauth/client.py:19-27 | examples/auth/mounted/client.py:22-30 | examples/auth/mounted/client.py:36-44 | examples/auth/oci_oauth/client.py:19-27 | examples/auth/workos_oauth/client.py:19-27 \u2014 \u0060examples/auth/azure_oauth/client.py\u0060 and \u0060examples/auth/clerk_oauth/client.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 16 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/auth/azure_oauth/client.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e475633bb385b53750b418a639116cb58d8bc5a294d98dc16833ab3b25bce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): examples/persistent_state/client_stdio.py:29-37 | examples/persistent_state/client_stdio.py:49-58 | examples/persistent_state/client_stdio.py:70-79 \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":"examples/persistent_state/client_stdio.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"df19e2b443df5717cae9794d7e093e57cf724c2c280eaed111649d32fd92d09d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/atproto_mcp/src/atproto_mcp/_atproto/_posts.py:185-192 | examples/atproto_mcp/src/atproto_mcp/_atproto/_posts.py:209-217 \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":"examples/atproto_mcp/src/atproto_mcp/_atproto/_posts.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96355ce69054e68ed16da6fe61507335ed1088f72bb2cd39ade3471037dd996"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/persistent_state/client.py:31-38 | examples/persistent_state/client_stdio.py:36-43 \u2014 before extracting anything, compare \u0060examples/persistent_state/client.py\u0060 and \u0060examples/persistent_state/client_stdio.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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":"examples/persistent_state/client.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"72724a8cb588c658cb5988c96936208abb6f689a5003e46ea28acda580bff3ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 11): examples/auth/aws_oauth/client.py:18-24 | examples/auth/azure_oauth/client.py:18-24 | examples/auth/clerk_oauth/client.py:19-25 | examples/auth/discord_oauth/client.py:18-24 | examples/auth/google_oauth/client.py:18-24 | examples/auth/huggingface_oauth/client.py:18-24 | examples/auth/keycloak_oauth/client.py:15-21 | examples/auth/oci_oauth/client.py:18-24 | examples/auth/propelauth_oauth/client.py:18-24 | examples/auth/scalekit_oauth/client.py:18-24 | examples/auth/workos_oauth/client.py:18-24 \u2014 \u0060examples/auth/aws_oauth/client.py\u0060 and \u0060examples/auth/azure_oauth/client.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 7 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Note first that the copies are not typed on the same thing: \u0060Client\u0060 names \u0060fastmcp\u0060 in one and \u0060fastmcp.client\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/auth/aws_oauth/client.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed076d7a05db6f26b9a6a074b5d0ff1907cd676a0b7ba14e5b729388e02c43f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/persistent_state/client.py:75-81 | examples/persistent_state/client_stdio.py:78-84 \u2014 before extracting anything, compare \u0060examples/persistent_state/client.py\u0060 and \u0060examples/persistent_state/client_stdio.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 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":"examples/persistent_state/client.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a522793bab873af2bf7bb2bb0aadbb7a53c60fa7f4af56a478ccf7d5a44ef3b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/auto_close_duplicates.py:189-195 | scripts/auto_close_needs_mre.py:245-252 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/auto_close_needs_mre.py:245\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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/auto_close_duplicates.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7fb87a043c2380d4e80ced458311220d5139fe6be93bc8f354eb9d571bdf52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): examples/atproto_mcp/src/atproto_mcp/_atproto/_posts.py:199-203 | examples/atproto_mcp/src/atproto_mcp/_atproto/_posts.py:211-217 \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":"examples/atproto_mcp/src/atproto_mcp/_atproto/_posts.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bd6497d854a338165df74f4ef4d497640d146ccbbfbb513ea051da8cbb4c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 3): examples/code_mode/server.py:23-74 | examples/search/server_bm25.py:25-74 | examples/search/server_regex.py:29-65 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/code_mode/server.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b017640c30edade3adc594746b585ee87f73536bb71d6d86ed458650e3319c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): examples/code_mode/client.py:28-34 | examples/search/client_bm25.py:25-31 | examples/search/client_regex.py:25-31 \u2014 before extracting anything, compare \u0060examples/code_mode/client.py\u0060 and \u0060examples/search/client_bm25.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"examples/code_mode/client.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"11934827af256b0c654ff711abe9535a2c3f3f053de82be857248f6d1160ebec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/fastmcp_config_demo/server.py:21-34 | examples/screenshot.py:23-34 \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":"examples/fastmcp_config_demo/server.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d30382aafb8c2b2d7edd7726f05d9b15e2c770a3dd13372ddf659662b9418e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/auto_close_duplicates.py:67-74 | scripts/auto_close_needs_mre.py:63-70 \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":"scripts/auto_close_duplicates.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"de000e623608e5a3ed363117e6656aa0d96c5b2c0fadec3400dbcb27f154bd6d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: fastmcp-slim: fastmcp-slim: abstractness 0.03, instability 0.00, distance 0.97 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"863af90daa5b67781b4822d889a3e11bfbda5a3288e26977fbc8354b4748955d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FastMCP (LCOM4 8): FastMCP\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acc4e05dc11c26280508c3115ca12c2a78985b1f08761fba8e5f7ba5abcc756"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ResponseCachingMiddleware (LCOM4 6): ResponseCachingMiddleware\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/caching.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"48638426f2138cc5bf7943ccaaa0f0468c1a2d854eba2068742218d202eb2d52"}},{"ruleId":"D13","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":"f00be8c87f5a562c75a546fcc7f0e4b6bc1829c32b789ab7c7bc0ecfecacaef8"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/utilities/openapi/schemas.py: fastmcp_slim/fastmcp/utilities/openapi/schemas.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in schemas._combine_schemas_and_map_params at line 528. 5 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/utilities/openapi/schemas.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/schemas.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46e9772cf0a42efe4eaebc119312b1bb2c9899030d7c6efcaff454f5ac81692"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/utilities/json_schema_type.py: fastmcp_slim/fastmcp/utilities/json_schema_type.py changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in json_schema_type._convert_schema at line 1067. 12 of those changes were fix/bug commits, and the other 13 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/utilities/json_schema_type.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema_type.py"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"439f0d6af04c0cf93fc27b881006ba4b2e0e13ab2abc26d1da161f9199e6959c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/server/server.py: fastmcp_slim/fastmcp/server/server.py changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in FastMCP.__init__ at line 442. 8 of those changes were fix/bug commits, and the other 18 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/server/server.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e4a01b70275c71c1f6bd336fed2f6658be8644eefcbe429c7210d9deb1be2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py: fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in OAuthProxy.load_access_token at line 2223. 9 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a868adf262b718b3d5062b074798076140322edf06bf745ae61bc4be15b09a82"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/utilities/openapi/director.py: fastmcp_slim/fastmcp/utilities/openapi/director.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in RequestDirector.build at line 286. 9 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/utilities/openapi/director.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/director.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f06f9566df342937bcc80aed6b0f7928355af3ede609498a1392e1e3be6e47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/cli/cli.py: fastmcp_slim/fastmcp/cli/cli.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in cli.run at line 395. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/cli/cli.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/cli.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb23ca56ed0956f6361c32a7cb6b4c413ecab70bdf97d241bf21e92d4c7ee7db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/resources/template.py: fastmcp_slim/fastmcp/resources/template.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in FunctionResourceTemplate.from_function at line 713. 7 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/resources/template.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/resources/template.py"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1550fef0763a10d25641224914aa494d8f1a6c19a79f61dec60306f94167d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .github/agentic/flows/agentic_stack_controller.py: .github/agentic/flows/agentic_stack_controller.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in agentic_stack_controller.run_batch at line 58. 3 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- .github/agentic/flows/agentic_stack_controller.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_stack_controller.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06458534ca1760f1c4b832b3bf9597aa387424e94104f348047f245365de80b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/client/client.py: fastmcp_slim/fastmcp/client/client.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Client.__init__ at line 424. 7 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/client/client.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/client.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34b105cfa55fda136b10313ffd68769183013f32e12caa033684876f0e5f9f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/tools/tool_transform.py: fastmcp_slim/fastmcp/tools/tool_transform.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in TransformedTool.from_tool at line 532. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/tools/tool_transform.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/tools/tool_transform.py"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7562bec3a885c83b37dee89bfa2e40686540a448c9acb5393e3749b7f7529c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/client/transports/stdio.py: fastmcp_slim/fastmcp/client/transports/stdio.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in StdioTransport.connect at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/client/transports/stdio.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/transports/stdio.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"974e0791e8432b952d6f5ca99cc1443c3d572a7f8cb3c4618526423bac4ea681"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .github/agentic/flows/agentic_triage.py: .github/agentic/flows/agentic_triage.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in agentic_triage.finish at line 232. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- .github/agentic/flows/agentic_triage.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_triage.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"194e8cb739d541932ebb222d7a994dec6cd7b2e278afc88d25e8dd4051647a76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/prompts/function_prompt.py: fastmcp_slim/fastmcp/prompts/function_prompt.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in FunctionPrompt.from_function at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/prompts/function_prompt.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/prompts/function_prompt.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2ba299a3127f66eb1a7095cf5b361b0cf166141cc4b81d24ef86a970aa18c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/tools/function_parsing.py: fastmcp_slim/fastmcp/tools/function_parsing.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in ParsedFunction.from_function at line 229. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/tools/function_parsing.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/tools/function_parsing.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf60b6fe86a6c71d837e6d366f16190d30918bfac39cf02e7052c043a63a93c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/server/mixins/mcp_operations.py: fastmcp_slim/fastmcp/server/mixins/mcp_operations.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MCPOperationsMixin._on_call_tool at line 284. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/server/mixins/mcp_operations.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/mixins/mcp_operations.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"6672d2ca8a06452bfd92d3e3125011f06b32e8fdd1b0451801c1c5ee63b0f39f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/client/mixins/tools.py: fastmcp_slim/fastmcp/client/mixins/tools.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in tools._parse_call_tool_result at line 396. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/client/mixins/tools.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/mixins/tools.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"024c027543420a485569f4e6f964e9e23a2a3b3e86267839cf64dfec05235232"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/server/auth/auth.py: fastmcp_slim/fastmcp/server/auth/auth.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in MultiAuth.__init__ at line 713. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/server/auth/auth.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/auth.py"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"84626dd02fbfda2f55050fc48a203a38634e9df98e2ff4130be5c74e4ec28870"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/server/auth/oidc_proxy.py: fastmcp_slim/fastmcp/server/auth/oidc_proxy.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in OIDCProxy.__init__ at line 263. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/server/auth/oidc_proxy.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oidc_proxy.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2987f5bcb0a794d75a0dde044afe2c42e21ad109d013219ba8ba0b56cf1254"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py: fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in json_schema_converter.convert_openapi_schema_to_json_schema at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b946f635d941ce4002d316f7b42f14296d6764d7c11eafed89029d05067f7e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/cli/run.py: fastmcp_slim/fastmcp/cli/run.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in run.run_command at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/cli/run.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/run.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e6820a30c5948e014f4cce964c4603c68e2bd29a8eb6dfbebf7836cec4e1f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .github/agentic/flows/agentic_review_publication.py: .github/agentic/flows/agentic_review_publication.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in agentic_review_publication.post_review at line 97. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- .github/agentic/flows/agentic_review_publication.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_review_publication.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1359fbc5e0c1136f2c2c832a20be9cc28f423d5d8bc89e6a550a56839c5373a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/utilities/cli.py: fastmcp_slim/fastmcp/utilities/cli.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in cli.load_and_merge_config at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/utilities/cli.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/cli.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0675ea77fc314b2f8ca7190abba3b3e058ad89e24589b6c2b96c6f42b381ab8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/server/auth/providers/github.py: fastmcp_slim/fastmcp/server/auth/providers/github.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in GitHubTokenVerifier.verify_token at line 122. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/server/auth/providers/github.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/github.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d47a4951346a3b1e605b663cf25d9b3a944e40adea1951e9f21b1c9762a2a36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/server/auth/cimd.py: fastmcp_slim/fastmcp/server/auth/cimd.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in CIMDAssertionValidator.validate_assertion at line 536. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/server/auth/cimd.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/cimd.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb82a5991f38b46fbb8a7424206d066d7af2d16bc204898a9a9460009586f963"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/server/auth/providers/google.py: fastmcp_slim/fastmcp/server/auth/providers/google.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in GoogleTokenVerifier.verify_token at line 117. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/server/auth/providers/google.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/google.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae775f7c6947579375d18fc2a729d02382e47f9a1e0407baddeecef5fbb2f1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .github/agentic/flows/agentic_review_delivery.py: .github/agentic/flows/agentic_review_delivery.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in agentic_review_delivery.deliver_reviews at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- .github/agentic/flows/agentic_review_delivery.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_review_delivery.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"0331566f8bd5a56f0ec1df9e4d438ecabb1d662ac908e099956d9ffec3577980"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/utilities/openapi/parser.py: fastmcp_slim/fastmcp/utilities/openapi/parser.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in OpenAPIParser._extract_responses at line 481. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/utilities/openapi/parser.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/parser.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb9afe219260d1000c832e7d815b81c54d079a5bf2d38cc31a146328344ebab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .github/agentic/flows/agentic_pr_verification.py: .github/agentic/flows/agentic_pr_verification.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in agentic_pr_verification.verify at line 288. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- .github/agentic/flows/agentic_pr_verification.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_pr_verification.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"971497e6f8f9e495e96c60c0797594e0d88aadccb9dce0d5e9de6956710651c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/server/providers/prefab_synthesis.py: fastmcp_slim/fastmcp/server/providers/prefab_synthesis.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in prefab_synthesis._build_resource_for_tool at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/server/providers/prefab_synthesis.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/prefab_synthesis.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"41d1197ea8f9516886fc6e606317d9c9ac9c41c667dc50ae67b558dcb920d974"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/server/auth/providers/jwt.py: fastmcp_slim/fastmcp/server/auth/providers/jwt.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in JWTVerifier.__init__ at line 227. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/server/auth/providers/jwt.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/jwt.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"154e28998e2b4eb378f16f8fe6b1a5b6f2ddac8d36ebb5cbdfdb3cdfeea393ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fastmcp_slim/fastmcp/__init__.py: fastmcp_slim/fastmcp/__init__.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in fastmcp.__getattr__ at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/__init__.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/__init__.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56dbab4c8e0a15c9f51cdf244890feaa19b51b29b8c755b57d2219ffafc7985"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: fastmcp_slim/fastmcp/utilities/json_schema.py: fastmcp_slim/fastmcp/utilities/json_schema.py changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is json_schema.is_object_schema at line 993), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CRevert 12 contributions merged without enough review (#6434)\u201D; \u201Cfix: preserve referenced schema definitions (#5588)\u201D; \u201Cfix(proxy): relay non-object tool results across MCP versions (#5763)\u201D; \u201Cfix(json-schema): decode RFC 6901 escapes when extracting $defs names (#6180)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/utilities/json_schema.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema.py"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"56313f4644191f32ddbfafd41d625b56f2ab5a5782dc6f8b208d34e5adbb0a72"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: fastmcp_slim/fastmcp/client/transports/base.py: fastmcp_slim/fastmcp/client/transports/base.py changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is VersionAwareClientSession._absorb_tool_listing at line 89), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(client): stop validating version-pinned call_tool results against the highest version\u0027s schema (#5725)\u201D; \u201Cfix(client): preserve a caller-provided OAuth httpx client factory when verify is set (#5849)\u201D; \u201CFix static checks broken by ty 0.0.89 and pydantic 2.14 (#6001)\u201D; \u201Cfix: support modern protocol in multi-server clients (#4893)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/client/transports/base.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/transports/base.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1375fbd78a535130b81fe980d9e6125442727f94033ea02b38bf8c19718e8f87"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: fastmcp_slim/fastmcp/client/transports/http.py: fastmcp_slim/fastmcp/client/transports/http.py changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is StreamableHttpTransport._set_auth at line 113), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(client): preserve a caller-provided OAuth httpx client factory when verify is set (#5849)\u201D; \u201Cfix(client): forward max_sse_event_size through StreamableHttpTransport (#6016)\u201D; \u201CFix static checks broken by ty 0.0.89 and pydantic 2.14 (#6001)\u201D; \u201CFix proxy forwarding of MCP transport headers (#4853)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/client/transports/http.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/transports/http.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"676a11c2d7b7226e9cf551a2bf012581e749299c8727e9cfa79b20db05867254"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: fastmcp_slim/fastmcp/server/telemetry.py: fastmcp_slim/fastmcp/server/telemetry.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is telemetry.server_span at line 255), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix #5563: OTel: prefer \u0060AccessToken.subject\u0060 over \u0060client_id\u0060 for \u0060enduser.id\u0060 (#5565)\u201D; \u201Cfix(telemetry): record exceptions once per span (#5861)\u201D; \u201Cfix(telemetry): record mounted and nested server spans as INTERNAL (#6252)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/server/telemetry.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/telemetry.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"de61ed34db81896975f7ae9532d44d591c0f622d9243361e53e9a56202c1b63e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: fastmcp_slim/fastmcp/server/low_level.py: fastmcp_slim/fastmcp/server/low_level.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is FastMCPServerMiddleware.__call__ at line 179), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CRevert 12 contributions merged without enough review (#6434)\u201D; \u201Cfix(server): serve Mcp-Param validation from a wire-schema cache (#5666)\u201D; \u201CFix static checks broken by ty 0.0.89 and pydantic 2.14 (#6001)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/server/low_level.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/low_level.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75cb8d0cb3b132a1f29acfaa018c2eb369b62a07520f90dd4eacbb230d7ebf9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: fastmcp_tasks/fastmcp_tasks/handlers.py: fastmcp_tasks/fastmcp_tasks/handlers.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is handlers.tasks_get at line 250), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CRevert 12 contributions merged without enough review (#6434)\u201D; \u201Cfix(tasks): retain results after tool removal (#5507)\u201D; \u201Cfix(tasks): keep stored arguments alive with the other per-task keys (#5144)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_tasks/fastmcp_tasks/handlers.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_tasks/fastmcp_tasks/handlers.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a04716606cc7b0c09d49a5b162f725b06331a5465efae7c6f72c22d3cd35c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: fastmcp_slim/fastmcp/server/transforms/search/bm25.py: fastmcp_slim/fastmcp/server/transforms/search/bm25.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is _BM25Index.query at line 57), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(search): rebuild the BM25 index when the tool name set changes (#6282)\u201D; \u201Cfix: return current tool schemas from cached BM25 searches (#5153)\u201D; \u201Cfix: support Unicode tokens in BM25 search (#4889)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 02:14:03 -06:00\u0027 --until=\u00272026-11-15 02:14:03 -06:00\u0027 --full-history --no-merges -- fastmcp_slim/fastmcp/server/transforms/search/bm25.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/transforms/search/bm25.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4476ade4a07f400f4842438824887ff32f48fe00a958a3f58b8b83cfd8462a"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 35 significant file(s) lose their only recent owner: scripts/rank_issues.py, fastmcp_slim/fastmcp/server/providers/base.py, fastmcp_slim/fastmcp/server/auth/identity_assertion.py, scripts/maintenance_status.py, fastmcp_slim/fastmcp/client/auth/client_credentials.py, fastmcp_slim/fastmcp/experimental/transforms/jev_search.py, fastmcp_slim/fastmcp/apps/app.py, fastmcp_slim/fastmcp/server/transforms/search/base.py (\u002B27 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8e4f032e5b0ff58d23a1700dc18b555149d75b53fccd9ef9d5a919aaf89dafbe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sdk-v2-migration): remove once user code has migrated off camelCase reads. \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":"fastmcp_slim/fastmcp/_compat.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"278eeed5cbe7d4a9234d632662f245f896ca2391e10cb6c9d766a78d91d42c91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ty): remove when ty supports Unpack[TypedDict] inference \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":"fastmcp_slim/fastmcp/client/transports/stdio.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a872d2ee3a7c2eb5376fb24e3a8053e8788cf65c607bde2698e458c614a93d"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Consequences section: dev-docs/v3-notes/auth-provider-env-vars.md has no Consequences section (a heading such as \u0060## Consequences\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dev-docs/v3-notes/auth-provider-env-vars.md"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0f80347a3c362c9aeeb0fdbbc1a6b9144166717610233699ae55066edb6a2c"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060fastmcp_slim\u0060 (75517 LoC, 641 module-visible types across 38 directories) overshoots its size bounds. 2 of 4 build unit(s) (Python) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/pyproject.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be538ca4d4f87422b7feeac7165d9eb73e1b189182be66d8cf8e2d87f0912762"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (13991 LoC, 208 module-visible types across 47 directories) overshoots its size bounds. 2 of 4 build unit(s) (Python) overshoot their size bounds, lowering Project Cohesion to 0.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4842ad367a78941ccec73d857627e21e838b932492f4ae73cdd87ada79a9f00"}},{"ruleId":"D28","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":"d11587f796fb2563b629c250a1d5cca8fb6e2e546bb01e8a9aa4a8a32907862b"},"properties":{"commitSha":"c3c41b4402ce1d795efb913206e050d2668a8b02"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"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":"0d549a7645d45b3dd0d57d746a8f2b4cbbbc1b0fdb8117c3df9472de9c53ba81"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"24b3ebcc287e3d38c8ef892b13db497b59a80bb6e21487d43d3e8507f56c76ae"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"0c182b55d7ef3b089b42888b8fd7daad302ac7418779c3ab4e0c48b78a6be799"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"f50647f7d84c0b9be7ef7045c2ad222a283add18aacc5dfa2ef94915d62bf6e2"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"a7a09f67afc76684ddc4eede935aaf4acc2e3dab787b59864a0dde6180096480"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"18cf4ad1fac9ce8d84b24a30f1f71c99514cf98a0d0d1807d00dbd1c04e01550"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"1223688c36b561aeb632d0acbf26f2663e6764393609b3001a5387282e5b4a68"},"taxa":[{"id":"CWE-269","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"8d3f505d8bf9462aa9bacf22df328c75f09cd1c9eb492d9971b736b0380462ad"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"9273b5a68a4e255d2a3ac861afab012b6f23522640bf75c530b57becebdf1892"},"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"264020b477a754de7b49583f674924bb40555f256ea0ff904183468218e18bb7"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"34942760f2f4d98821caec968fda9c9d57ef0c5f4453b3ecf66d2b678f539404"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"6ed059458dc0d864f79fffc2c8cd3f09ac2213f256b255ba1e07734350228541"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"c13cc456539b71753b802b094a20883ae1c53533b949d4caea040d8ecb18030a"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"b147c5aef3f551c7caa870ddb7377aaa3b08d869cc4f474cb3995d31ed0c1051"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"8a5fc2ae8eb50ae7e1ff6f1f039491d20b61156615e5e1748bbe413544267dd4"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"4ef77d9740603ad1d8c3976f943a2e783c00c38c2e241b8b2c4a0926c755d472"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"ff24951de13ee3e84c9aafb475bfe40da6146700a75a98e55aae252e78ee5e0d"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"29ca8aad49060ff93e814d18a99fdd9a97e249e71936d827f147bfcdb294144d"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"1dd26680ff66c140a3c8c1ae46641ae83bf4f071622d3f4ec8eb77bbd96ca9cf"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"1d9310795c3028b2d6368bcff09215cbf8b6f44b3eb57b12021ce2781bd9efdb"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"44e0d01cbc0c24891ebda53a65d98bf48eee393470fcefbced813e3f0550d89a"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"25b97d580f065aa9df2f6f82481076d21e2c1008a63f874aaa7b02eafe2c4f31"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"f08c4e3b977b4eb40476e6f93d40ffe682aea5c5b26e3a8375e24c9d7d169972"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"99f22ec7c69868f01f84dc606c5be4b788535e85e662d0b3dd0a694ac54fae86"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"f48343f2d80b9f7a40e7c3187e84fc5f82b73db73ae055767aaca65f4b036091"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"233e8c584fe73fee43b1a2ce419223babaf3d1889eaacd02f797a41febb9ec41"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"653d71823f6fd9817d64613fa6ccf0581385267e1269f3c3c8fe72b175ef3de9"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"c3636da9046582991a75f6a152b65d12b48b2b2be84d5c1eea68d98843a5bdf8"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"512abdc84e3c9310574269b7562b3f81bdcb673e9c8445e9941772f66544d93f"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"db3f2bb2de3311ed11632f22508e6fc48ef528149399ec5c8f62c551f62edbfd"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"5b25d4fac6ed9abd7cccce8ee32194653e61673f1ea353d61e81be90ceb5b0e5"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"c5c1acb8470d509a62348e7f7a0958ed3ef00335472062a78929b48a8b89a6bc"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"e58d3c4190ff21ad852642d6aaccdc1e3fe8432ff76ee12c5d13f29b686d3944"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"2462e3de5709d7fd0cb31b5fc887af6c4ff9eceb237f89818005b603e15d2cc3"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"bf8accec2d46e2fcc6ed96c31fc367f13f7eb8ad45aa96411e2e4c798737b220"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"d5a575dc42ed218d7298b02ac6d943a2f568b3999c745e15d217670c30d1c04a"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"8d1665d3015b724f2451cf63a14701fb92de84819f6e470e70e1ed14b0af3bb0"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"952465b334ddedc272aba1ad812ef2d087059b26f025f578f0c66a3211288142"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"54058eba4e3613688f5d47dcfe8c0878609f64b3f0418dd90fbd9e50c2896810"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"eb94825dc8a5ffaf3be88e1e24397f9bb60ac8a89639aa9a496470ef92e17c67"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"f9ff774211c1b814e27742d2a6605914109b40a5da75a07944d7c5b98b2b880c"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"095325fa94f1e23f4cb2edadad187516e2a18cb0f01b91e0c2ea0678d3732d59"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"0a9ae900e4e5f2e6fbfeb8d10912f0950fbaf4ef8bc7e777d42be5a7e40aec65"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"fd25bb17a647dcd0774013a5175b8c3d7bb57e27cc892186ea782b787aab656f"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"2ffbc736cbbced0ca0fcc7b84d940ee1c76dc910db6e20e062a5c5a0da7210fd"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"8b236b408e1a8b4843827f77f2e72e6414f4e347b2285b71c365721bbf2e8e1c"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"357d343cab55b09a6634e42b1afe28cb3ecc535f018ddec1ba486a77e631463e"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"32d4c74d8557547a31879a5aefe229508d80774ac6827aac3ba420f3e0e1a531"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"15f28f5db1bfe8f351475158985e84901b08ca00da2e34af174597379733a913"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"c161fbb966fb99fa6001fea15201ca30addfc5b9a5b9cdc6b34c89a899984681"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","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":"e5540ae5542f3ee2093d36a0223029d41253c035765cbe10361c4c1b0bf0866f"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"ba3e9367d05b8ee8cbb2470564ee2b24ade98a9ac4ae830cdea0d52481b0f53f"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"8886b39c81ee2ba97e180f52cab8fe0a75ab2cdd3a7be2c464829c11ae6a940f"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"36cd4be2064823203e21bf96cb43359fe3a81768450d7ac329c48e270b7726b2"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c131c66f7da9fd7420d81e212c2a26829c15e771fbfd032b17379e92497b3b3"},"properties":{"dependency":{"package":"dnspython","version":"2.8.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df381938d837c3b16a2b0a5889645e537a4966f7e6b6204dd1a0bf5a322d1122"},"properties":{"dependency":{"package":"dnspython","version":"2.8.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d55eb5e10fbe2eebac3cecc6f1c6c6c29fa6ca98a738924e23ab582305d2b6f"},"properties":{"dependency":{"package":"dnspython","version":"2.8.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2de3757918c1df128154f532f265daef311802d7f166baa7ba5a9e200829fea5"},"properties":{"dependency":{"package":"opentelemetry-api","version":"1.45.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"135f52239aa7f6d75fb9142e7302b749d4d65f9b332c5c4255b4457b77e25d15"},"properties":{"dependency":{"package":"fastmcp","version":"4.0.11","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]"],"reachability":{"kind":"production","file":"examples/smart_home/src/smart_home/fire_tv/client.py","line":12}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4c72f344b026fe2b1587fad79354709e2837583489b0205ccca7494a416c9ad8"},"properties":{"dependency":{"package":"fastmcp-slim","version":"4.0.11","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbfc05556601fe9f2ee92671497316ca5eee64a8d401c7bb9ebf83c55eb6f083"},"properties":{"dependency":{"package":"fastmcp","version":"3.4.8","advisory":"[GHSA redacted]","reachability":{"kind":"production","file":"examples/testing_demo/server.py","line":8}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1b5ff71fcca55ebbff5d6d22c25e1fb142d9768ce3a5d3e2156cdb3751eadba"},"properties":{"dependency":{"package":"fastmcp-slim","version":"3.4.8","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 3 of 235 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 235 of the 306 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: fastmcp_slim/fastmcp/server/auth/providers/propelauth.py, fastmcp_tasks/fastmcp_tasks/encryption.py, fastmcp_slim/fastmcp/server/auth/providers/keycloak.py. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/propelauth.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1ec7729bc401b7ed3e25c54b8ce150b5a58496a216e908514978ea065459c0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_tasks/fastmcp_tasks/encryption.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e4cfacb46b88eab1fcdd21e35908f7ea653e5d3fb215d206d06f3347c1c647"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/keycloak.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d28d5a6b4ef199b02bee72a4870f42719cb29524390b2cb5595171b2cdb81a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: claude_desktop.py \u2192 cli.py, claude_code.py, cursor.py, run.py: \u0060fastmcp_slim/fastmcp/cli/install/claude_desktop.py\u0060 changes together with 4 other files \u2014 \u0060fastmcp_slim/fastmcp/cli/cli.py\u0060, \u0060fastmcp_slim/fastmcp/cli/install/claude_code.py\u0060, \u0060fastmcp_slim/fastmcp/cli/install/cursor.py\u0060, \u0060fastmcp_slim/fastmcp/cli/run.py\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/install/claude_desktop.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fe601e9860831007355c73a3eff590d7ae3d16fea719bacec543f6a23f72b8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: github.py \u2192 azure.py, google.py, workos.py: \u0060fastmcp_slim/fastmcp/server/auth/providers/github.py\u0060 changes together with 3 other files \u2014 \u0060fastmcp_slim/fastmcp/server/auth/providers/azure.py\u0060, \u0060fastmcp_slim/fastmcp/server/auth/providers/google.py\u0060, \u0060fastmcp_slim/fastmcp/server/auth/providers/workos.py\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/github.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45198ad88b34053b5a663834afa9b77d1aaeb2481a6eebe27ef7edee5de2fe70"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: claude_code.py \u2194 cursor.py: \u0060fastmcp_slim/fastmcp/cli/install/claude_code.py\u0060 and \u0060fastmcp_slim/fastmcp/cli/install/cursor.py\u0060 change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060ea47d232\u0060 Refactor Environment to support multiple runtime types (#1673) (at that commit the files were still \u0060src/fastmcp/cli/install/claude_code.py\u0060 and \u0060src/fastmcp/cli/install/cursor.py\u0060); \u0060465e4033\u0060 Improve fastmcp.json environment configuration and project-based depl\u2026 (at that commit the files were still \u0060src/fastmcp/cli/install/claude_code.py\u0060 and \u0060src/fastmcp/cli/install/cursor.py\u0060); \u0060afedabea\u0060 Fix and centralize CLI path resolution (#1590) (at that commit the files were still \u0060src/fastmcp/cli/install/claude_code.py\u0060 and \u0060src/fastmcp/cli/install/cursor.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/install/claude_code.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0876201d81e14c2c15cf9f36ce7f9f819df44460da58391d2e1114195c7254"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: anthropic.py \u2194 openai.py: \u0060fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py\u0060 and \u0060fastmcp_slim/fastmcp/client/sampling/handlers/openai.py\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006099df3146\u0060 Preserve or explicitly reject images in sampling tool results (#5554); \u00601b1bcf7f\u0060 Report the stop reason from sampling handlers when no tools are offer\u2026; \u0060200d79e7\u0060 Enable PERF and T20 ruff rules (#3845) (at that commit the files were still \u0060src/fastmcp/client/sampling/handlers/anthropic.py\u0060 and \u0060src/fastmcp/client/sampling/handlers/openai.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5337460a8efdf8526e9d7fac657037d21fc40726c893ad08a786f60bfe96469a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: anthropic.py \u2194 google_genai.py: \u0060fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py\u0060 and \u0060fastmcp_slim/fastmcp/client/sampling/handlers/google_genai.py\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006099df3146\u0060 Preserve or explicitly reject images in sampling tool results (#5554); \u00601b1bcf7f\u0060 Report the stop reason from sampling handlers when no tools are offer\u2026; \u006018aa6a09\u0060 Document sampling handlers on both protocol routes; qualify log-level\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/sampling/handlers/anthropic.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b1103a5d58736d8b38606e6ba8105483dd400e515ee744c03c34416f9c43c5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: azure.py \u2194 google.py: \u0060fastmcp_slim/fastmcp/server/auth/providers/azure.py\u0060 and \u0060fastmcp_slim/fastmcp/server/auth/providers/google.py\u0060 change together 52% of the time (11 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u00607c98326d\u0060 Forward enable_cimd to OAuthProxy in all provider subclasses (#3608) (at that commit the files were still \u0060src/fastmcp/server/auth/providers/azure.py\u0060 and \u0060src/fastmcp/server/auth/providers/google.py\u0060); \u0060ea529f6a\u0060 feat: make upstream_client_secret optional in OAuthProxy (#3486) (at that commit the files were still \u0060src/fastmcp/server/auth/providers/azure.py\u0060 and \u0060src/fastmcp/server/auth/providers/google.py\u0060); \u00609a076cd5\u0060 Update docstrings (at that commit the files were still \u0060src/fastmcp/server/auth/providers/azure.py\u0060 and \u0060src/fastmcp/server/auth/providers/google.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/azure.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55b33f0db6f20b737db2fe73333211182042ffc88950bc668e93e36073a8e59"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: cli.py \u2194 cursor.py: \u0060fastmcp_slim/fastmcp/cli/cli.py\u0060 and \u0060fastmcp_slim/fastmcp/cli/install/cursor.py\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00605f8461b7\u0060 Remove shell=True from Windows subprocess calls (#2091) (at that commit the files were still \u0060src/fastmcp/cli/cli.py\u0060 and \u0060src/fastmcp/cli/install/cursor.py\u0060); \u0060ea47d232\u0060 Refactor Environment to support multiple runtime types (#1673) (at that commit the files were still \u0060src/fastmcp/cli/cli.py\u0060 and \u0060src/fastmcp/cli/install/cursor.py\u0060); \u0060465e4033\u0060 Improve fastmcp.json environment configuration and project-based depl\u2026 (at that commit the files were still \u0060src/fastmcp/cli/cli.py\u0060 and \u0060src/fastmcp/cli/install/cursor.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/cli.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76484752c0f6447ba8c8b3dab3ef5e29ad931fe553fcfbd2a0af8ae17ad35111"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: __init__.py \u2194 __init__.py: \u0060fastmcp_slim/fastmcp/prompts/__init__.py\u0060 and \u0060fastmcp_slim/fastmcp/resources/__init__.py\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060ea7fb8cb\u0060 Remove 3.x-era compatibility shims (#4661); \u0060daa2dace\u0060 Add standalone decorators and eliminate fastmcp.fs module (#2832) (at that commit the files were still \u0060src/fastmcp/prompts/__init__.py\u0060 and \u0060src/fastmcp/resources/__init__.py\u0060); \u00603ea0685a\u0060 Expand support for various method interactions (at that commit the files were still \u0060src/fastmcp/prompts/__init__.py\u0060 and \u0060src/fastmcp/resources/__init__.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/prompts/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45e916b0848880a69665878fb8dde81fb59d20a799ad0581043ba1c91b5be88"}},{"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"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"31c0a0bc5665d03f53c855a8f29409633ed2dfade373c061a58868bf07dab5d0"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.version-badge\u0060 moves (\u0060transition: box-shadow 0.2s, transform 0.15s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/css/version-badge.css"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9b57310e946ac951788ba9f8fe719afc3de617568ea7894da2fee7c0d8bc3d"}},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 1 ADR-shaped document(s) detected by content \u2014 \u0060dev-docs/v3-notes/auth-provider-env-vars.md\u0060. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live \u2014 so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea921cf64dae701abd877090b3279ff10d03c2e3250e26c8c299d7c5665e0d3f"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 2/3 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060fastmcp_remote\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 26 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":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/agentic-checks.yml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060inspector\u0060 is async and calls subprocess.run \u2014 a blocking call inside async code stalls the event loop \u2014 every other task on it waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/cli.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"566237f855a3c32aba147b46166421a1e61e620e9788addc39f1c372b490cd5b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060run\u0060 is async and calls subprocess.run \u2014 a blocking call inside async code stalls the event loop \u2014 every other task on it waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/cli.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2ca719ebfd001cf167b09cd8cff41e3c5f7558d9bd54c0bdf90c996e95243e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060inspect\u0060 is async and calls subprocess.run \u2014 a blocking call inside async code stalls the event loop \u2014 every other task on it waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/cli.py"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"5769dc3465b17778a5769e1a147a71dc133dc60c8895786f499bd799a9db7dff"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060prepare\u0060 is async and calls subprocess.run \u2014 a blocking call inside async code stalls the event loop \u2014 every other task on it waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b579833ff8201145265e9af62fe27e533c8da18a34aa5da86ce2f69c4f6e77b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022:\u0022 in host and not host.startswith(\u0022[\u0022)\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/server/http.py, fastmcp_slim/fastmcp/server/mixins/transport.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/http.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"729226398620de5d1e65b89fda5b23d12a9f9b1d82a0aebe6a56992edd29a7b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060context is None or context.flow_run is None\u0060 appears character-identically in 3 files \u2014 .github/agentic/flows/agentic_stack_controller.py, .github/agentic/flows/agentic_triage.py, .github/agentic/flows/agentic_triage_records.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_stack_controller.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bcfd2956973ef8e2cc99bc49ad74cd89aa3fde3dd6b6bab551d2b069e2a384"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060deployment.version != runtime.source_sha or deployment.work_pool_name != \u0022managed\u0022\u0060 appears character-identically in 2 files \u2014 .github/agentic/flows/agentic_existing_review.py, .github/agentic/flows/agentic_native_triage.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_existing_review.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"22da4981b7f2ac6ddb2cb39d7088c95c9e1977ee4790cc983ee7e111857455da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060evidence.get(\u0022complete\u0022) is not True or evidence.get(\u0022schema_version\u0022) != 2\u0060 appears character-identically in 2 files \u2014 .github/agentic/flows/agentic_intake.py, .github/agentic/flows/agentic_stack_policy.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_intake.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"68358d5b0e1d3bc48458a004a105959c7595319818c949a3133a2d38543b9d8a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host.startswith(\u0022[\u0022) and host.endswith(\u0022]\u0022)\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/client/auth/oauth.py, fastmcp_slim/fastmcp/server/auth/redirect_validation.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/client/auth/oauth.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"150ca6c8402648d57f389596b5150e1342f36aec87fe384138dad0bf46603af3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(fastmcp_meta, dict) and fastmcp_meta.get(\u0022wrap_result\u0022) is True\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/server/mixins/mcp_operations.py, fastmcp_slim/fastmcp/tools/base.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/mixins/mcp_operations.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1a67c3994c2b3bdf48521b75aa29bcaa42dc2e20ffba2c4c11925ceb14c67f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(result_type, str) and result_type not in mcp_types.CORE_RESULT_TYPES\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/server/low_level.py, fastmcp_slim/fastmcp/server/providers/proxy.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/low_level.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"3910fdc2fcdd4b94192d88417d8349e0ecb7850f1af20f9e34ea06e2fc41ad5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(schema, dict) and isinstance(schema.get(\u0022$ref\u0022), str)\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/server/transforms/search/base.py, fastmcp_slim/fastmcp/utilities/openapi/director.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/transforms/search/base.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9826f8e4fa1aa619a4da51d09e80ed3e2fc32879c7136ab775cde09a05db575f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, float) and not math.isfinite(value)\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/skills/models.py, fastmcp_slim/fastmcp/tools/base.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/skills/models.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"357ab08e9f3f8460a5a80082e1be81a8ab44d44bae9b9c75d2157a674ce2c8c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060media_type == \u0022application/json\u0022 or media_type.endswith(\u0022\u002Bjson\u0022)\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/server/providers/openapi/components.py, fastmcp_slim/fastmcp/utilities/openapi/director.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/openapi/components.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecfcf95299cfb26c908ca3adcc5e1cc2e99b732dfaf5e46794d76af18198cb2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata is not None and individual_params_provided\u0060 appears character-identically in 3 files \u2014 fastmcp_slim/fastmcp/prompts/function_prompt.py, fastmcp_slim/fastmcp/resources/function_resource.py, fastmcp_slim/fastmcp/tools/function_tool.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/prompts/function_prompt.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f97841a126ad568f84ffed345b70a657f326d32709fb2fdc86c75276cb0ede"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.name or getattr(fn, \u0022__name__\u0022, None) or fn.__class__.__name__\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/prompts/function_prompt.py, fastmcp_slim/fastmcp/resources/function_resource.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/prompts/function_prompt.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"369de1665e285cf280d55ab36e7df0f372b27142248f3d19c09d604dd1b9220d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not inspect.isroutine(fn) and not isinstance(fn, functools.partial)\u0060 appears character-identically in 4 files \u2014 fastmcp_slim/fastmcp/prompts/function_prompt.py, fastmcp_slim/fastmcp/resources/function_resource.py, fastmcp_slim/fastmcp/resources/template.py, fastmcp_slim/fastmcp/tools/function_parsing.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/prompts/function_prompt.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ce983650052d9c70c90b5b25325419f28fd257091cbe89a2a5f87161944af4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(client_id, str) or not client_id\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/server/auth/auth.py, fastmcp_slim/fastmcp/server/auth/oauth_proxy/revocation.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/auth.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"6561ce3276a5872944c88917a75f8cc275e2320459009ef03f6660bf47403fac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not schema or not isinstance(schema, dict)\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/utilities/openapi/formatters.py, fastmcp_slim/fastmcp/utilities/openapi/schemas.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/formatters.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedcb9a2e26af2f8291a5437729ec3a2926ffbb72d0a51dfcf0cee43fc880e91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060origin is Union or origin is types.UnionType or origin is Annotated\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py, fastmcp_slim/fastmcp/tools/function_parsing.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/local_provider/decorators/tools.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"777ebdcd4deb10299e928ce6f36f4bcc61892a60935ca03082cc0979eb0be282"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060outer_docstring.description or inner_docstring.description\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/prompts/function_prompt.py, fastmcp_slim/fastmcp/tools/function_parsing.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/prompts/function_prompt.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"85adbda343ea51ad0b965d56df3d0d053396b88b40a6c8084a21573e3a886dbe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060param_name in properties and \u0022description\u0022 not in properties[param_name]\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/prompts/function_prompt.py, fastmcp_slim/fastmcp/tools/function_parsing.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/prompts/function_prompt.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10db482c28d31d194907e6740b32db452ed75504d71b07d6f412d6b3c537afc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw is None or digest(raw) != ref.binding\u0060 appears character-identically in 2 files \u2014 .github/agentic/flows/agentic_native_cache.py, .github/agentic/flows/agentic_triage_records.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_native_cache.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93eb1840423e524e1b5328ae4e91066e7bd526b53870c26a5adeaa762de53bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response_info is None or not response_info.content_schema\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/server/providers/openapi/components.py, fastmcp_slim/fastmcp/utilities/openapi/schemas.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/openapi/components.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e022bf92cf1aa0c5205d55ffa2aef67b22da4aa330f3b07dc5b89ee22a64968b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060route.request_body and route.request_body.content_schema\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/utilities/openapi/director.py, fastmcp_slim/fastmcp/utilities/openapi/schemas.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/director.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"17387dc2f7ab5228048a3b54ea4c7b252e52d4e85db4ec2292280e7d8ff947d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run.state is not None and run.state.is_final()\u0060 appears character-identically in 2 files \u2014 .github/agentic/flows/agentic_existing_review.py, .github/agentic/flows/agentic_native_triage.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/agentic/flows/agentic_existing_review.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"533aa78c1e67efc058da2266be412e427808ad4f41d8ba86c3ee44424ad4cecd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._auto_bind_audience and self._resource_url is not None and isinstance(self.token_verifier, JWTVerifier)\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/server/auth/providers/auth0.py, fastmcp_slim/fastmcp/server/auth/providers/workos.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/auth0.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e6e174481b8beca882dcf11f1e82d8539d1f2de231f9e44feeac81529b061f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.client_registration_options or ClientRegistrationOptions()\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/server/auth/auth.py, fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/auth.py"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2026d19bc58d3ad89930b6d15c7aab7a75b4c46fa416757f52963db1b683d514"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.revocation_options or RevocationOptions()\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/server/auth/auth.py, fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/auth.py"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8b73f78906963e1f3418d5635f4dc4d60daa50f000838db45e3a09dd94b975"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060transaction.get(\u0022scopes\u0022) or self.required_scopes or []\u0060 appears character-identically in 2 files \u2014 fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py, fastmcp_slim/fastmcp/server/auth/providers/azure.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd28764d2680c87c9bc79b0c8f56b9cbb07ebcf710e9a6aa64bfdcffb2e91d5b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060dereference_refs\u0060 is public, takes a document from its caller (line 343) and hands it to \u0060_strip_remote_refs\u0060, which calls itself at line 231 (\u0060_strip_remote_refs\u0060) with a piece of \u0060obj\u0060 (and at line 232, line 234) \u2014 and nowhere in \u0060_strip_remote_refs\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_strip_remote_refs\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1fd77e1d8c0cbc837d010e4837279ccd4516ede5fe064eb22f671eba302ff4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060dereference_refs\u0060 is public, takes a document from its caller (line 343) and hands it to \u0060_merge_ref_siblings\u0060, which calls itself at line 499 (\u0060_merge_ref_siblings\u0060) with a piece of \u0060original\u0060 (and at line 508) \u2014 and nowhere in \u0060_merge_ref_siblings\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_merge_ref_siblings\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema.py"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc19f885405c8f5b6dbaa765bcdea8f7b46a79510e5bd46a38a9413d3d61926"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_object_schema\u0060 is public and takes \u0060schema: dict[str, Any]\u0060 from its caller, and it calls itself at line 1040 (\u0060is_object_schema\u0060) with a piece of \u0060schema\u0060 \u2014 and nowhere in \u0060is_object_schema\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060is_object_schema\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/json_schema.py"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28d672f778eed36b364114d2d213207d46face42e92c90b5fa441dac2ad00a5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_class_member_of_type\u0060 is public and takes \u0060cls: Any\u0060 from its caller, and it calls itself at line 153 (\u0060is_class_member_of_type\u0060) with a piece of \u0060cls\u0060 (and at line 158) \u2014 and nowhere in \u0060is_class_member_of_type\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060is_class_member_of_type\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/types.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea91e10fa6c94f954b06e138b4bc78126b0b6aafb75b9a91996c970b304386e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060convert_openapi_schema_to_json_schema\u0060 is public, takes a document from its caller (line 48) and hands it to \u0060_scope_schemas\u0060, which calls itself at line 373 (\u0060_scope_schemas\u0060) with a piece of \u0060schema\u0060 (and at line 377) \u2014 and nowhere in \u0060_scope_schemas\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_scope_schemas\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/json_schema_converter.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f54a9013221ed7df936efa87365a664286e95f2efceaa99f4d468e408fd3bee"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060extract_output_schema_from_responses\u0060 is public, takes a document from its caller (line 892) and hands it to \u0060_replace_ref_with_defs\u0060, which calls itself at line 156 (\u0060_replace_ref_with_defs\u0060) with a piece of \u0060info\u0060 (and at line 161, line 170, line 175) \u2014 and nowhere in \u0060_replace_ref_with_defs\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_replace_ref_with_defs\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/schemas.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9ea584925ac5097283d4435d28fca4a00ab212fadfbb78ad492f2ca963a04f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060annotate_payload_identities\u0060 is public, takes a document from its caller (line 91) and hands it to \u0060_walk_tool_calls\u0060, which calls itself at line 53 (\u0060_walk_tool_calls\u0060) with a piece of \u0060node\u0060 (and at line 56) \u2014 and nowhere in \u0060_walk_tool_calls\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_walk_tool_calls\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/prefab_payload.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9ba6a8eacb87fc1016453bcb8eaaece16fe38ecca0a4cfc6bb85faa2a29738"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060coerce_value\u0060 is public, takes a document from its caller (line 394) and hands it to \u0060_schema_allows_null\u0060, which calls itself at line 367 (\u0060_schema_allows_null\u0060) with a piece of \u0060schema\u0060 \u2014 and nowhere in \u0060_schema_allows_null\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_schema_allows_null\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/client.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba01f4a175703df8a672be86d06a407d01c196116e6862dc48bf576b44729d6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060coerce_value\u0060 is public, takes a document from its caller (line 394) and hands it to \u0060_schema_may_be_string\u0060, which calls itself at line 384 (\u0060_schema_may_be_string\u0060) with a piece of \u0060schema\u0060 \u2014 and nowhere in \u0060_schema_may_be_string\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_schema_may_be_string\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/client.py"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"a956ebff2f6520f67ee54b548793d4e01ba365049a0397360181c6fd6d10a4c5"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/3 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: refreshTriage: \u0060refreshTriage\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"status-site/app.js"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac452aa0e8efa1cc3902b85302f1805e01b9f81e29510fd00b49328a9e92149"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: refreshBacklog: \u0060refreshBacklog\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"status-site/app.js"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb3aa5c9459fd809fcdbd0ceea58acc6bae86f47ffb965b6ce1a884f6aae578"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: refresh: \u0060refresh\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"status-site/operations.js"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac511ec740b71e2fe8321850c3a142922f647841d07072e41fac828062735122"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 190 is called with an argument built by \u0060\u0022\u2026\u0022.join(dependencies)\u0060 (line 190), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"7963117e0f5e92d022946c1248759e5681053568ea33cc2c2fafd0bc00bbc4cf"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 236 is called with an argument built by \u0060\u0022\u2026\u0022.join(editable_paths)\u0060 (line 236), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/mcp_server_config/v1/environments/uv.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e7e14c50017f86953d78ade6d007b785b493877087f41f6575273876e336ca"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 195 is called with an argument built by \u0060list(metadata.keys())\u0060 (line 197), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/providers/scalekit.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c787310cdec5cccd11c129bb2bb35e7b32e811444ea82f804f94fa56447aed"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 2406 is called with an argument built by \u0060sorted(missing_scopes)\u0060 (line 2408), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":2406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d187ae251f24c0ee63db83821b0c2e00672cf3106dbe85588c360d92453396f6"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 2911 is called with an argument built by \u0060list(self._extra_token_params.keys())\u0060 (line 2914), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/proxy.py"},"region":{"startLine":2911}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39743ce02f29c598e7b4aab2b8e74e3facbc538498690f318d122f5e327cb32"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 630 is called with an argument built by \u0060list(final_server_args)\u0060 (line 639), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/cli.py"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"d510449392d143a105a03e04bb51b2514f833bd406f1994f92d583bfaa747ac6"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 739 is called with an argument built by \u0060\u0022\u2026\u0022.join(cmd)\u0060 (line 739), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/cli.py"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"c061c670401f8df2047294436169b9a4a8195fb129afe98764237cfc9b10536e"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 314 is called with an argument built by \u0060\u0022\u2026\u0022.join(cmd)\u0060 (line 314), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/run.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c326b455cbc891e539c9454c599f558584c020d2d54a8a60c5f13e536921231"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"status-site/app.js"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"83408518a55c657fc66725258f52e8c914f36ae9c3d0290dd7bf1393d3af18b3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"status-site/app.js"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c45d23ca56bfbc15b6e0af8c65ad4c2c5d187f4bb8c08710893767c41d1b1fa"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"status-site/operations.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc3e124c74e919eab2b40fcb97ebb2a5f77da819b7db3778a247ac73ee1c594"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"status-site/operations.js"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4969d89e90cfecdbfa083c2c2650a461a88770c559da2745b98f4aaa1cdb183"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"status-site/operations.js"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf44e28dbaa6b6777291e89bb69edcc987a84f9a372f07f20d482d15822a2bc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/inspect.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa6a5ce073ad09e31080b739d8f55c2e4cecd59beba81398faea1962f934d43"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/tools/function_tool.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c38f75e2893d02b8ad04a423fd8720b143174765985498d0ea0ea7eb5774676"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/auth/oauth_proxy/consent.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a72173836636b64043ec9971a1cad3e78e540596c277a66953f94b9b9019ac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 244 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/authorization.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"502a4b9a016fe49ca4bc96c3b0523d9c8dfc04b575d2990a46b3a8e82912b327"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 47 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/formatters.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa35109284f5cd9d76be40561c144b0f70208e5c8a453e9b563f9da25fe8c12"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 86 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/utilities/openapi/formatters.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"593de9ba798741b7718ca960eb04370ce53ecc821e7b65ed40e1befdb1adcce5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 490 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/tools/function_tool.py"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"151e68bb7fa4f6eefa763fc8e2f396e0a06841a9c340dcedc67d8f33320086a1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 1398 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/context.py"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"679a5c984b70e230ff45f5f6dd3a65d6229dd857dec2a84342834b7c15845a76"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 1611 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"27181dbec09d25c9c8f30b737ba1004c79bedd6a3f303c62a1260a8a5b2b50ce"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 1647 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"683e28879bdd74d55e354f2949bf7ea9163719ac667d023eb6a411556a025c2f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 1753 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb4666c897dfffc8f54cddcf095584e96bb47e26710842651e638bf8c584c95"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060exception\u0060 at line 1760 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.exception(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.exception(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3cadf004c2045a200ac78f32d9085062c6e83eb0513e465e7b9dd7e981ad6e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060exception\u0060 at line 1763 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.exception(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.exception(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1763}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1565a3456174ca993158d171f56859d87c6fb12569a04f81ebdadbc130f445"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 1820 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5bb8882b11ed54ccd073472716da7edf96e49e734b3bff95d38141185542f2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060exception\u0060 at line 1825 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.exception(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.exception(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcfe94e7f62b5630b4015696ab7fa44a98d60a29cf60a5eb3dd2b2bb5062fac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060exception\u0060 at line 1828 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.exception(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.exception(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e9fd566a2a5ccdcd4a02804e24607aecfc959273ef8bcfe35e7deea2ab0c44"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 1919 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a66eceae17a17169d866cb0e90d099ce23e9537b1e05c84a08e1a72c5e33cb2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060exception\u0060 at line 1924 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.exception(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.exception(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"869b03cc2bd50066456ceb2dc4f31871aa8a2fd4d863254e53e52af834757bc1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060exception\u0060 at line 1927 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.exception(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.exception(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc39ba79d03beb2b12fc2c70c691b90e8b9e4460bc28c23a20576a2d19079098"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 2509 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/server.py"},"region":{"startLine":2509}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4d6d35530c2488c11010ad14601f9769349dbd83cf4cc4a42dd4ca4226428c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 216 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/aggregate.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4958b5b45ecb4d52f2704a846e0c97cf5f280535404e2c1caf5e93ddc0067e68"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 226 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/aggregate.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbf38abad474da68a93fb31d093b24956e784a93251239f6a6f9d79d17d2cff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 250 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/aggregate.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf0d2260ab744f712f148fa57746275a3acfc5a4a04c15f215dc82b4fb3f771"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 279 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/providers/openapi/components.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1c18020512c3dcb65c7f136880df762bbd25f6794e4c812416d8fcb11a15bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 256 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/authorization.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"620d3cff89b0fa3fce07b369a32a9451e17cdec38e97ced056fed63891ec1def"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 349 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/authorization.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e062d30e5e77f846b34001ac355cf11298090ddddf573765a666e8c21d4e5fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 478 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/authorization.py"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05bf397a90a0aa76f90ff1e2059c1ffa2ff4cb75eb23cf66d67879b6a000ba5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 80 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/error_handling.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"981afc017178e8f73458924146807be19a46102c1266f37bcb0ca0fb971d85b8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 89 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/error_handling.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2063027fd37669014c450deb8e04807b484c163da5a2246336693c8358f24f02"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 224 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/error_handling.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcaa473a06d43eab0a1440a5549d07394ebe877d5b7772c869485fde67d2bfba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 42 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/logging.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e57b511446aef168cf2df735cf35fc1cb401a06e68c4b0694941780679a247"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 47 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/timing.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c36b59c491239039383e00c96902b2d310fdfe93d2ec4ede9cfb6125976a08"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 53 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/timing.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6264af4327fcbe7e01cbaa2596b61585f5e33f8ff6e02df3348e854d28a222"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 99 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/timing.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e544aed7b7868a382af316d9c70a36c72017ef40f407c67bf97e1a2e2066951f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060log\u0060 at line 105 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.log(logging.INFO, \u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/middleware/timing.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fa07aa45029f18974f85c5c0a9ab9aa102e29999719d17fce685afb4377898"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 1126 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/apps_dev.py"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a425861d3bd8b242ab64e9d5d2ea9fa84f92f956577b30ae1132d63e366e49a4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 1152 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/apps_dev.py"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09af77313b8fe3230fc5e3defa52a32155bfacb1acf12c2ae6b52450e5d1a7b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 1747 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/apps_dev.py"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16dc10b582f47a42e1f48d442205d01d8b0db9e51c56ea5d7db3622e299f1ed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 1753 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/apps_dev.py"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fad28b2ca0a73a8dccd49e781707470c98bde5945df8823d0276e37655eef0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_build_picker_html\u0060 returns \u0060\u0022\u003Chtml\u003E\u003Cbody\u003E\u003Cp\u003Eprefab-ui not installed. Run: pip install \u0027fastmcp[apps]\u0027\u003C/p\u003E\u003C/body\u003E\u003C/html\u003E\u0022\u0060 when \u0060ImportError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/cli/apps_dev.py"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"0502fdc6cd8634456e33b1ada5039a5ad85ad260c1ea072ecf069d50e9c8f93e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_origin_host\u0060 returns \u0060\u0027\u0027\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/server/http.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8311381f60f7165ae4ead8eaaf7724f89959c25d911bf252ee462713046c89a9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_resolve_param_hints\u0060 returns \u0060{}\u0060 when \u0060TypeError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_slim/fastmcp/tools/function_tool.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"34316dadd622555acebd8f57003f54782c176a720bdce703cbbe55bfd5ce4d54"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060get_task_leg_number\u0060 returns \u00601\u0060 when \u0060LookupError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_tasks/fastmcp_tasks/context.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5d17aa28001d1cf2b10dc2aa25f5d78006a416bdd8e5193a0191b46dd642cd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060leg_number_from_key\u0060 returns \u00601\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_tasks/fastmcp_tasks/keys.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"165468313f657e9d4efba1a36939db89a7f226ca0f0edeffffe997abae667536"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060redact_backend_url\u0060 returns \u0060\u0027***\u0027\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fastmcp_tasks/fastmcp_tasks/worker_cli.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e620868681373e7855686d5448fb0c877a6fb5493e7ad1deecabce2b7415be80"}}],"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-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"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-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.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-269","guid":"70e1f5f6-81e5-4e5a-ba40-b541c3a346e2","name":"Improper Privilege Management","shortDescription":{"text":"Improper Privilege Management"},"helpUri":"https://cwe.mitre.org/data/definitions/269.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"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-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"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":72,"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."]}]}