{"$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":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"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":"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":"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":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"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":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"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":"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":"AgentRunner._run_impl (cyclomatic 238): AgentRunner._run_impl has cyclomatic complexity 238 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfc418e3a28b5413fa3ee44053de1f2116ea2ed0d65e64c48639a2327c62030"}},{"ruleId":"D1","level":"warning","message":{"text":"run_loop.start_streaming (cyclomatic 199): run_loop.start_streaming has cyclomatic complexity 199 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/run_loop.py"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3116c35d61f7f8d939f2b97084973f2b5888f46f3aee09c0a55f378421e6672"}},{"ruleId":"D1","level":"warning","message":{"text":"turn_resolution.resolve_interrupted_turn (cyclomatic 170): turn_resolution.resolve_interrupted_turn has cyclomatic complexity 170 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5bb0739524f0d89ebdb03013c8f5f2360daee6e43f95d891ce58a1fbd2dca4"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatCmplStreamHandler.handle_stream (cyclomatic 129): ChatCmplStreamHandler.handle_stream has cyclomatic complexity 129 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/chatcmpl_stream_handler.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b723426db556683a2c762a174f07391f976826a4b5842d177eec345538fbc1"}},{"ruleId":"D1","level":"warning","message":{"text":"run_state._build_run_state_from_json (cyclomatic 115): run_state._build_run_state_from_json has cyclomatic complexity 115 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_state.py"},"region":{"startLine":4186}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9e91379d67504f786319c92debb8f2bec11f2b95c2d7a7a820c3fd8528dddc"}},{"ruleId":"D1","level":"warning","message":{"text":"review_protocol.validate_packet (cyclomatic 109): review_protocol.validate_packet has cyclomatic complexity 109 (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":".agents/skills/implementation-final-review/scripts/review_protocol.py"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"5451aec5a0f8eb404b2f618b4c56138462f6bac3aeb59f14c51798514691c8c0"}},{"ruleId":"D1","level":"warning","message":{"text":"turn_resolution.process_model_response (cyclomatic 101): turn_resolution.process_model_response has cyclomatic complexity 101 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":3158}}}],"partialFingerprints":{"codehealthFindingId/v1":"780ce873b4ddbf5bbf3433e141d1bee3271e46eb97e55e33351cdaefbb8df3a5"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter.items_to_messages (cyclomatic 75): Converter.items_to_messages has cyclomatic complexity 75 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/chatcmpl_converter.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"403c073b472a6e3474a7df6c10008be4e1e4844983ee0f2495c17541934e2491"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIResponsesCompactionSession._run_compaction_locked (cyclomatic 60): OpenAIResponsesCompactionSession._run_compaction_locked has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/memory/openai_responses_compaction_session.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"b917da95e3401dfc03acbadd32b609deeba17577f83228229432784b43fc4ab2"}},{"ruleId":"D1","level":"warning","message":{"text":"RunContextWrapper.get_approval_status (cyclomatic 60): RunContextWrapper.get_approval_status has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_context.py"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf15c3ab26779e16c902ce0c4b7f46ed3cd56956666fd58dc6e96bb1f4b5533"}},{"ruleId":"D1","level":"warning","message":{"text":"RealtimeSession.on_event (cyclomatic 59): RealtimeSession.on_event has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/session.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"027c0ad44474c91ff6aed66bdbaf4a4d70bd8bdaca2cd1a2a63f4bd0a764f9fd"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIRealtimeWebSocketModel._handle_ws_event (cyclomatic 58): OpenAIRealtimeWebSocketModel._handle_ws_event has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0df9844edfddfe3f3b29af14868bf9af9e0e72d3f7351ec0acd81ff154beac"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIServerConversationTracker.hydrate_from_state (cyclomatic 57): OpenAIServerConversationTracker.hydrate_from_state has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/oai_conversation.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"316ab34488a865d040557e37245885e2b0af7e1c2c22e1d4cc435dfc20f246ac"}},{"ruleId":"D1","level":"warning","message":{"text":"RealtimeSession._get_new_history (cyclomatic 54): RealtimeSession._get_new_history has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/session.py"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"739bc6c2d6750452336262a8d7f83bf59a7a261c316b27ac917abd3e0f93fea9"}},{"ruleId":"D1","level":"warning","message":{"text":"run_state._validate_completed_tool_invocations (cyclomatic 52): run_state._validate_completed_tool_invocations has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_state.py"},"region":{"startLine":4833}}}],"partialFingerprints":{"codehealthFindingId/v1":"8247a95d971ae0e87669b319767e3250101d89c969b93c9df458548ab4114cdd"}},{"ruleId":"D1","level":"warning","message":{"text":"RealtimeSession._handle_tool_call (cyclomatic 51): RealtimeSession._handle_tool_call has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/session.py"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fada786625ec30c9d6e88d01fda0ecf725da008ac486ec40b969213022b289"}},{"ruleId":"D1","level":"warning","message":{"text":"RunContextWrapper._apply_approval_decision (cyclomatic 50): RunContextWrapper._apply_approval_decision has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_context.py"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"90615fdf44785f4257f0af5f86ab4aa92f5e194c4f82ab02cddbadb9e9aedfdc"}},{"ruleId":"D1","level":"warning","message":{"text":"review_protocol.validate_reviewer_output (cyclomatic 48): review_protocol.validate_reviewer_output 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":".agents/skills/implementation-final-review/scripts/review_protocol.py"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3b535a91dfa5a0900e2f85d4a1267f29c1e1a6eefaa28893c190792474b06f"}},{"ruleId":"D1","level":"warning","message":{"text":"function_schema.function_schema (cyclomatic 45): function_schema.function_schema has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/function_schema.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfa8451f410cfcdcc50200267324616172edc8947c7d0ddb6e8911f5454966f"}},{"ruleId":"D1","level":"warning","message":{"text":"strict_schema._ensure_strict_json_schema (cyclomatic 44): strict_schema._ensure_strict_json_schema has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/strict_schema.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dac7c4f2b040d4948c29d4b49237697e0fc4877d9a43493bfeb67d0b1d712b8"}},{"ruleId":"D1","level":"warning","message":{"text":"session_persistence.resume_pending_session_write (cyclomatic 41): session_persistence.resume_pending_session_write has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/session_persistence.py"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f491a45c8c02d6882b373f5ebaa01308b343d38dd202337db93fe65936e845c"}},{"ruleId":"D1","level":"warning","message":{"text":"run_state._copy_pydantic_value (cyclomatic 41): run_state._copy_pydantic_value has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_state.py"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"c719bbcb92977fabc6d3334266d3f44d9dc018ce92f8a9d27f257ca3c69c9002"}},{"ruleId":"D1","level":"warning","message":{"text":"turn_resolution.execute_tools_and_side_effects (cyclomatic 40): turn_resolution.execute_tools_and_side_effects has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a864531de3f77f01b9543638c3bedd164ca5ba5829df484d7473d24120e107"}},{"ruleId":"D1","level":"warning","message":{"text":"codex_tool._enforce_span_data_budget (cyclomatic 39): codex_tool._enforce_span_data_budget has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/experimental/codex/codex_tool.py"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f3cf454ff564fb6b33aa2e0d90c30ce1fc8b5a1cf1804294a93fbc964e1ebd"}},{"ruleId":"D1","level":"warning","message":{"text":"run_state._restore_current_response_item_identities (cyclomatic 39): run_state._restore_current_response_item_identities has cyclomatic complexity 39 (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":"src/agents/run_state.py"},"region":{"startLine":5471}}}],"partialFingerprints":{"codehealthFindingId/v1":"a339761c109a83c550ef660c7e1631ed49b2c1287b987316030d10118783094a"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIHostedMultiAgentModel._iter_websocket_turn (cyclomatic 38): OpenAIHostedMultiAgentModel._iter_websocket_turn has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/experimental/hosted_multi_agent/model.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee71e4c8ccef849ce5152dad6d4bcc2eacad3d8162586d1178fa4b874eac9e0"}},{"ruleId":"D1","level":"warning","message":{"text":"turn_resolution._preflight_response_invocations_after_processing_error (cyclomatic 38): turn_resolution._preflight_response_invocations_after_processing_error has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":3918}}}],"partialFingerprints":{"codehealthFindingId/v1":"af43c15bc29e0bef75f626388b57794c8b96ed00e93ef83ab01fc0a1a59c70ef"}},{"ruleId":"D1","level":"warning","message":{"text":"items.drop_orphan_function_calls (cyclomatic 36): items.drop_orphan_function_calls has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/items.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f45a5492ad3e944e6bb62b4ba87d6b6defa19829793fed12fbf43ecc07a09c0"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter.message_to_output_items (cyclomatic 35): Converter.message_to_output_items 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":"src/agents/models/chatcmpl_converter.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"15767e93cd0a47762c5145e9eba97ea81794776567c9e93f20b24c2523922fbc"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPUtil.invoke_mcp_tool (cyclomatic 34): MCPUtil.invoke_mcp_tool 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":"src/agents/mcp/util.py"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed980c0c5ce86870218a849f9b958fc160f7b87ff9b53c3ec20f5753ea62b01"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter._convert_tool (cyclomatic 34): Converter._convert_tool 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":"src/agents/models/openai_responses.py"},"region":{"startLine":2237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8227929a92de531d06e0ecd59d53954157012264be17f5ca7a63b92a9e02aacf"}},{"ruleId":"D1","level":"warning","message":{"text":"model_retry.stream_response_with_retry (cyclomatic 34): model_retry.stream_response_with_retry 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":"src/agents/run_internal/model_retry.py"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ae5852228f55b6241fe7f9f99c0f9a445bbd879b8da6fb273100ca830df749"}},{"ruleId":"D1","level":"warning","message":{"text":"turn_resolution.execute_handoffs (cyclomatic 34): turn_resolution.execute_handoffs 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":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a9e91c704b571429c0be7b7060d51603bf3909bbcc001278ac608ce248a386"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIRealtimeWebSocketModel._get_session_config (cyclomatic 33): OpenAIRealtimeWebSocketModel._get_session_config 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":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce193aeffa829737c7d9c7b941167757c9f55d21e603c38aef13487cc05daad3"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentRunner.run_streamed (cyclomatic 33): AgentRunner.run_streamed 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":"src/agents/run.py"},"region":{"startLine":2619}}}],"partialFingerprints":{"codehealthFindingId/v1":"707b3b0b3904585df5ed7d3fd6a29ebacfcaada21d9d224a997134ae7d624020"}},{"ruleId":"D1","level":"warning","message":{"text":"run_loop.run_single_turn_streamed (cyclomatic 33): run_loop.run_single_turn_streamed 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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":2421}}}],"partialFingerprints":{"codehealthFindingId/v1":"613424a163db663bb55e2f5f0cd1d072a546763eb261abd2357b3804b41b2701"}},{"ruleId":"D1","level":"warning","message":{"text":"session_persistence.save_result_to_session (cyclomatic 33): session_persistence.save_result_to_session 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":"src/agents/run_internal/session_persistence.py"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edb826569fa6a0a6074ff0dd8f28189423e11a472aa2097891feb941d386d0e"}},{"ruleId":"D1","level":"warning","message":{"text":"tool_planning._dedupe_processed_response_invocations (cyclomatic 33): tool_planning._dedupe_processed_response_invocations 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":"src/agents/run_internal/tool_planning.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b9010619d1c142c5d67be6df5e9021010115fdd157bff31ad35d2c9bb4fd2e"}},{"ruleId":"D1","level":"warning","message":{"text":"run_state._deserialize_items (cyclomatic 33): run_state._deserialize_items 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":"src/agents/run_state.py"},"region":{"startLine":5172}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd510f34f151c23d595e9df30406e55d759fec780f54372c957eb4d760b2595"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIResponsesWSModel._iter_websocket_response_events (cyclomatic 32): OpenAIResponsesWSModel._iter_websocket_response_events has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/openai_responses.py"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbc25a5e9269bd0f7d6965a1932b26c520fe60c2e9eff82bffcb1bad00c0c6d"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIRealtimeWebSocketModel._interrupt_audio_playback (cyclomatic 32): OpenAIRealtimeWebSocketModel._interrupt_audio_playback has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"472e4216f813225bdf47d81792ce6c570dffcf33bf96a194e128c602c29d6868"}},{"ruleId":"D1","level":"warning","message":{"text":"model_retry._evaluate_retry (cyclomatic 31): model_retry._evaluate_retry has cyclomatic complexity 31 (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":"src/agents/run_internal/model_retry.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8e77c1fcdc8790da5f023209f0dafa11231b66388e0ec84fb76416077c9588"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIServerConversationTracker.prepare_input (cyclomatic 31): OpenAIServerConversationTracker.prepare_input 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":"src/agents/run_internal/oai_conversation.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f124c15fcf5a4cbe376b4ae79f4d97617cfd7f5bc2229fd822af866a32df914"}},{"ruleId":"D1","level":"warning","message":{"text":"AnyLLMModel._fetch_chat_response (cyclomatic 30): AnyLLMModel._fetch_chat_response has cyclomatic complexity 30 (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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42437345e41fb9daed22fcf6666f81fa30454cb41da7fb4b1760585990f3beb"}},{"ruleId":"D1","level":"warning","message":{"text":"AnyLLMModel._fix_tool_message_ordering (cyclomatic 30): AnyLLMModel._fix_tool_message_ordering 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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"2575fe6f62e786128625a042b04095a7383991e78f023fc87a92b487e0e1637b"}},{"ruleId":"D1","level":"warning","message":{"text":"LitellmModel._fix_tool_message_ordering (cyclomatic 30): LitellmModel._fix_tool_message_ordering 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":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed5684101c9600b8bbe20712cbad09a7888bb942a2002885646a0479889d3cf"}},{"ruleId":"D1","level":"warning","message":{"text":"MCPServerStreamableHttp.call_tool (cyclomatic 30): MCPServerStreamableHttp.call_tool 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":"src/agents/mcp/server.py"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6537eea776129219cfa424b10dc8c45a96546677dab33fafb3b53136d677d73"}},{"ruleId":"D1","level":"warning","message":{"text":"CodexExec.run (cyclomatic 29): CodexExec.run 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":"src/agents/extensions/experimental/codex/exec.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcb33701b89fe90a5a8507f4eae93aa419ce8b9a683ff332ed205f8e62ba6b7"}},{"ruleId":"D1","level":"warning","message":{"text":"LitellmModel._fetch_response (cyclomatic 29): LitellmModel._fetch_response 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":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be74d5a2e59cffad5de30beaa8273c07a05d70b430488dbe56c90c8195330d1"}},{"ruleId":"D1","level":"warning","message":{"text":"RealtimeSession._run_output_guardrails (cyclomatic 29): RealtimeSession._run_output_guardrails 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":"src/agents/realtime/session.py"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb1e60da900912227f7d8107ec1b96f446603618d72d912e7bc35f39ef4cadd"}},{"ruleId":"D1","level":"warning","message":{"text":"RunContextWrapper.get_rejection_message (cyclomatic 29): RunContextWrapper.get_rejection_message 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":"src/agents/run_context.py"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f719915fe276980357a3fcdd5df013f0055b34e978b445636c2c6c6808c761"}},{"ruleId":"D1","level":"warning","message":{"text":"run_loop._finalize_streamed_final_output (cyclomatic 29): run_loop._finalize_streamed_final_output 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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35802d7eca83817b009e85132ac6ed10bbd3a113b127700f9063cf80d8687c1"}},{"ruleId":"D1","level":"warning","message":{"text":"tool_execution.collect_manual_mcp_approvals (cyclomatic 29): tool_execution.collect_manual_mcp_approvals 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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d27155f7556a15be3f968582920f284ad78a9188e6ef9e9bc664fe555080c7"}},{"ruleId":"D1","level":"warning","message":{"text":"_run_state_agent_identity._normalize_capability_identity_value (cyclomatic 28): _run_state_agent_identity._normalize_capability_identity_value 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":"src/agents/_run_state_agent_identity.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c905f741280c1a7b875e4f85bb9f0c9e3e279de6f974ce50100dd48ef12fd4a5"}},{"ruleId":"D1","level":"warning","message":{"text":"Agent.__post_init__ (cyclomatic 28): Agent.__post_init__ has cyclomatic complexity 28 (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":"src/agents/agent.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"828b5989f31bf8381602a910ffcebbffa112bb10ab8a3cf5dcecfefc0cbb7e46"}},{"ruleId":"D1","level":"warning","message":{"text":"LitellmModel.get_response (cyclomatic 28): LitellmModel.get_response has cyclomatic complexity 28 (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":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e71260c2701c9f39aaf9f609b00b6e472bb156ab60f7dbf308cb2559539b88"}},{"ruleId":"D1","level":"warning","message":{"text":"session_persistence.prepare_input_with_session (cyclomatic 28): session_persistence.prepare_input_with_session 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":"src/agents/run_internal/session_persistence.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"40684251a2b260a2efb5294357e86621da4f6512d7bde849a8285c434200dc8d"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamedAudioResult.stream (cyclomatic 28): StreamedAudioResult.stream has cyclomatic complexity 28 (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":"src/agents/voice/result.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd0edc83d718a079393ba3cf85944812ea345936d203912caa369b9855847ca"}},{"ruleId":"D1","level":"warning","message":{"text":"RunState._find_nested_approval_state (cyclomatic 27): RunState._find_nested_approval_state 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":"src/agents/run_state.py"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a42955783e6a6a4b2ac8abceb90e9ecb427683c9095d58ebd4d2213717366c7"}},{"ruleId":"D1","level":"warning","message":{"text":"BackendSpanExporter._export_with_deadline (cyclomatic 27): BackendSpanExporter._export_with_deadline 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":"src/agents/tracing/processors.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"140461a0656f8be24e5f7f43202681284e4d6d19f85bf4951be56def06ddbd7c"}},{"ruleId":"D1","level":"warning","message":{"text":"check_optional_truthiness._reference_bindings_for_scope (cyclomatic 26): check_optional_truthiness._reference_bindings_for_scope 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/scripts/check_optional_truthiness.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1ec6d9d18c610edf2ff7a66be82d66aa43993ae9137e436ba05564e9adc9ed"}},{"ruleId":"D1","level":"warning","message":{"text":"_tool_invocation.tool_invocation_identity_and_scope (cyclomatic 26): _tool_invocation.tool_invocation_identity_and_scope 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":"src/agents/_tool_invocation.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf19d22a2c0b1d2dc5de6450d74222c00fd0cea8b05245903dd713cb3306304"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter.extract_all_content (cyclomatic 26): Converter.extract_all_content 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":"src/agents/models/chatcmpl_converter.py"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd67f8c3efaa9452f2082065fad5aaebd05ae65df93b557d89a00fa3ad3895f"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIChatCompletionsModel._fetch_response (cyclomatic 26): OpenAIChatCompletionsModel._fetch_response 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":"src/agents/models/openai_chatcompletions.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"04166a261bcae648f6f130d79a172f563847eb6c48dcbbba0a525fa97c6ee1c0"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIResponsesModel.stream_response (cyclomatic 26): OpenAIResponsesModel.stream_response 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":"src/agents/models/openai_responses.py"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"927315f5d2d7c2ca1e688a1eb9748597abe81fcdb6bc29c87e4aceda2c832f57"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIChatCompletionsModel.get_response (cyclomatic 25): OpenAIChatCompletionsModel.get_response 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":"src/agents/models/openai_chatcompletions.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7631e854daa1b1b4a4f6cf70ab466683375a35805bff146b240494ff15deeb3"}},{"ruleId":"D1","level":"warning","message":{"text":"RunState._merge_generated_items_with_processed (cyclomatic 25): RunState._merge_generated_items_with_processed 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":"src/agents/run_state.py"},"region":{"startLine":1854}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f22f7bd399af4e0404ecc4928d6f932b612cfa9e843933d4468894de4de8fc"}},{"ruleId":"D1","level":"warning","message":{"text":"_run_state_agent_identity._iter_agent_graph (cyclomatic 24): _run_state_agent_identity._iter_agent_graph 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":"src/agents/_run_state_agent_identity.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a2f3d5e6c172530bdd91900301b7710ba32911aff0f75dcbf75eec0a1d8ceb"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultTraceProvider.create_span (cyclomatic 24): DefaultTraceProvider.create_span 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":"src/agents/tracing/provider.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"994fd8aba8734b49ad00679819368b5d48ac73cebeb8d883291d7b52a00dc388"}},{"ruleId":"D1","level":"warning","message":{"text":"codex_tool.codex_tool (cyclomatic 23): codex_tool.codex_tool 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":"src/agents/extensions/experimental/codex/codex_tool.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0fbb0d00349d0935938c210e0ea8610760039aedef32c0e2877ad4a47134b5"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIResponsesModel._build_response_create_kwargs (cyclomatic 23): OpenAIResponsesModel._build_response_create_kwargs 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":"src/agents/models/openai_responses.py"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"252778b40bbd2d741dde6fa032492997025308894704d0c980c35946a86e62ae"}},{"ruleId":"D1","level":"warning","message":{"text":"run_state._run_state_raw_items (cyclomatic 23): run_state._run_state_raw_items 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":"src/agents/run_state.py"},"region":{"startLine":3909}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbb54cad640a166b99238ce333a8e2918a4d4e009dba4a640409a2e0a00b796"}},{"ruleId":"D1","level":"warning","message":{"text":"tool._normalize_function_tool_callable (cyclomatic 23): tool._normalize_function_tool_callable 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":"src/agents/tool.py"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d83410d2749ce5cf96f98bfb1465819e8fc345ea857d379cb1d0d6b6a76231"}},{"ruleId":"D1","level":"warning","message":{"text":"apply_diff._read_section (cyclomatic 22): apply_diff._read_section 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":"src/agents/apply_diff.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86a8d38159f44170410376e012f024cbd6d2250d62c553d90f355c949432eb8"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatCmplStreamHandler.buffer_tool_call_stream (cyclomatic 22): ChatCmplStreamHandler.buffer_tool_call_stream 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":"src/agents/models/chatcmpl_stream_handler.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"0548f0d2fa098b6f07163f7ab3b180f8cf29f7260451da4920e597d2bed734c6"}},{"ruleId":"D1","level":"warning","message":{"text":"RunContextWrapper._matching_sticky_approval_keys (cyclomatic 22): RunContextWrapper._matching_sticky_approval_keys 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":"src/agents/run_context.py"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"1682d311e67fd4574cd31a1b4c4316bfd2633204b64e9ba64740b3787a33a923"}},{"ruleId":"D1","level":"warning","message":{"text":"model._stream_events_for_step (cyclomatic 22): model._stream_events_for_step has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/testing/model.py"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"0001fed9d7bcbe9bfa7d7ba834a1099cbb077a6b45d846274496e86c6cd2677c"}},{"ruleId":"D1","level":"warning","message":{"text":"validate_handoff.validate (cyclomatic 21): validate_handoff.validate has cyclomatic complexity 21 (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":".agents/skills/implementation-kickoff/scripts/validate_handoff.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"34732b9f4b44940f6f5b8ce522b18d53ff6e6c8c621414b05a35fd2aba74a7ae"}},{"ruleId":"D1","level":"warning","message":{"text":"AnyLLMModel._get_response_via_chat (cyclomatic 21): AnyLLMModel._get_response_via_chat has cyclomatic complexity 21 (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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"32793cbd20102b61cc9b9ceb347ddd2eb71fdb906331b6e5f39d184084ecda81"}},{"ruleId":"D1","level":"warning","message":{"text":"_MCPServerWithClientSession.connect (cyclomatic 21): _MCPServerWithClientSession.connect 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":"src/agents/mcp/server.py"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"f734eea1e450150b4b2c12ae1b027a5b432e316574180dd461b4c25a41f83b14"}},{"ruleId":"D1","level":"warning","message":{"text":"_MCPServerWithClientSession.list_tools (cyclomatic 21): _MCPServerWithClientSession.list_tools 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":"src/agents/mcp/server.py"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"405aa1ce7e52428e975c93fe7c2c62e0bfca57683dbf1ef23f584ed07f684ddd"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter._validate_named_function_tool_choice (cyclomatic 21): Converter._validate_named_function_tool_choice 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":"src/agents/models/openai_responses.py"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cbbc4e1a70ccafac32a36515ed7b92205fd53d50d86e235db079bc4d3d3f1d"}},{"ruleId":"D1","level":"warning","message":{"text":"RunContextWrapper._restore_pending_approval_binding (cyclomatic 21): RunContextWrapper._restore_pending_approval_binding 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":"src/agents/run_context.py"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43776e77bb9b0da9e1cafa51a1ca6d4d1c934faa5c196f7c3cf926a5521d1f1"}},{"ruleId":"D1","level":"warning","message":{"text":"items.reconcile_nested_history_owned_input_after_rewrite (cyclomatic 21): items.reconcile_nested_history_owned_input_after_rewrite 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":"src/agents/run_internal/items.py"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fab66464fddc4997f95e42a378544e34c2365524dd3973976bcca68248f163"}},{"ruleId":"D1","level":"warning","message":{"text":"model._validate_model_step (cyclomatic 21): model._validate_model_step has cyclomatic complexity 21 (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":"src/agents/testing/model.py"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"960f4ced48f899497ab25a7262e6af26b351ff027df13ccd74cd75c73e8d2be7"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAISTTTranscriptionSession._handle_events (cyclomatic 21): OpenAISTTTranscriptionSession._handle_events 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":"src/agents/voice/models/openai_stt.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbed118ea5352c51657a2a9959dfe853a588e2b9ed622ef00b5942ceb69e5e2"}},{"ruleId":"D1","level":"warning","message":{"text":"RedisSession._mutate_items_attempt (cyclomatic 20): RedisSession._mutate_items_attempt 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":"src/agents/extensions/memory/redis_session.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf2ab0437d1f23fad8de5c8f1fc19b3daa4e4f952c3c4e7ea6678802aeef8b9"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolOutputTrimmer._structured_output_details (cyclomatic 20): ToolOutputTrimmer._structured_output_details 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":"src/agents/extensions/tool_output_trimmer.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ccc739f19e32928d31a9d8d5beb0171808fa32a6c70e565cddb9f288f5a782"}},{"ruleId":"D1","level":"warning","message":{"text":"result._input_items_for_result (cyclomatic 20): result._input_items_for_result 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":"src/agents/result.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e461346ee4bfe72ea41ffa1896d6965b09c032ba16a2c4b1f69574db5740c7"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIServerConversationTracker.validate_pending_input_filter (cyclomatic 20): OpenAIServerConversationTracker.validate_pending_input_filter 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":"src/agents/run_internal/oai_conversation.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"49730f403c7128110be71ada145f12c8fd88996a89d53dbd339a524a2437762a"}},{"ruleId":"D1","level":"warning","message":{"text":"session_persistence.defer_interrupted_session_write (cyclomatic 20): session_persistence.defer_interrupted_session_write 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":"src/agents/run_internal/session_persistence.py"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"39613bebb2eb06d95b668bbfed7eee9a8239ac2f20d85e63bbbc2a7d80bee059"}},{"ruleId":"D1","level":"warning","message":{"text":"sandbox._normalize_step (cyclomatic 20): sandbox._normalize_step 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":"src/agents/testing/sandbox.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"40051d5d404b056d2b2ff9c71f8d70036d9636dfe1f39868da8f4c81e1545b9f"}},{"ruleId":"D1","level":"warning","message":{"text":"BackendSpanExporter._sanitize_for_openai_tracing_api (cyclomatic 20): BackendSpanExporter._sanitize_for_openai_tracing_api 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":"src/agents/tracing/processors.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f116bc9fea07f97f708fc4529cf13f93f1cea344e5fc3c2667de8ba5fd1b2a"}},{"ruleId":"D1","level":"warning","message":{"text":"review_state.review_state (cyclomatic 19): review_state.review_state 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":".agents/skills/implementation-final-review/scripts/review_state.py"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"c331b0485011b2719c0cf03bd244f3c77ef2c868fe640fd10ac6a7a7ea6fa64d"}},{"ruleId":"D1","level":"warning","message":{"text":"AnyLLMModel._stream_response_via_responses (cyclomatic 19): AnyLLMModel._stream_response_via_responses 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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f65d41d5065e07c3d05f88b9e0ddee7894eb1c24a051f76ebe21c4c6e77bbfe"}},{"ruleId":"D1","level":"warning","message":{"text":"RunContextWrapper._rebuild_hosted_mcp_approvals (cyclomatic 19): RunContextWrapper._rebuild_hosted_mcp_approvals 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":"src/agents/run_context.py"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b30439e0c1c99d58fe44cf195f389095b55051fab547e704f6bc3e38f49f06"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIServerConversationTracker.track_server_items (cyclomatic 19): OpenAIServerConversationTracker.track_server_items 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":"src/agents/run_internal/oai_conversation.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ec0e23b273b4936141cd28289cdcdc7340d8935b92f43efdebec6b41953330"}},{"ruleId":"D1","level":"warning","message":{"text":"session_persistence.rewind_session_items (cyclomatic 19): session_persistence.rewind_session_items 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":"src/agents/run_internal/session_persistence.py"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c63d8c4e1f9c49bdb32af05e95249cfbcfa2e65c2b2626a73d1e0921fd0eedc"}},{"ruleId":"D1","level":"warning","message":{"text":"tool_planning._register_tool_call_items (cyclomatic 19): tool_planning._register_tool_call_items 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":"src/agents/run_internal/tool_planning.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3251c07151c45beafdc407504b31c731a6ae6e773b961e50c01cbd1a5b6523"}},{"ruleId":"D1","level":"warning","message":{"text":"RunState._serialize_item (cyclomatic 19): RunState._serialize_item 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":"src/agents/run_state.py"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"179f69cdc0b1361db53b624a968c27f82af01d3825a896ff154982e57075f533"}},{"ruleId":"D1","level":"warning","message":{"text":"run_state._restore_pydantic_fields_set (cyclomatic 19): run_state._restore_pydantic_fields_set 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":"src/agents/run_state.py"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"888c83fcf26ada6015ac670938049815385b9ed9870038e63cb9eaedc75c5f61"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamedAudioResult._stream_audio (cyclomatic 19): StreamedAudioResult._stream_audio 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":"src/agents/voice/result.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"010200d78a96b020e0f9b3d25ba4644089fadb0e78232b83051fa1a0da73bb04"}},{"ruleId":"D1","level":"warning","message":{"text":"review_protocol._review_state (cyclomatic 18): review_protocol._review_state 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":".agents/skills/implementation-final-review/scripts/review_protocol.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21bc6f44c7ae123978c03f85dec94189096f2eca6baf0c19a459bf2fd1af535"}},{"ruleId":"D1","level":"warning","message":{"text":"release_automation.main (cyclomatic 18): release_automation.main has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/release_automation.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fba10911bf3abb8e8346dab76a0793d599b7c7a6966eb101a8c366a2574a895"}},{"ruleId":"D1","level":"warning","message":{"text":"_tool_identity.resolve_tool_name_collisions (cyclomatic 18): _tool_identity.resolve_tool_name_collisions 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":"src/agents/_tool_identity.py"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e48bbeb9054586f2d491f459bf7890eb2e1194aab5341438faa8dda1ed4ebfc"}},{"ruleId":"D1","level":"warning","message":{"text":"_tool_identity.get_function_tool_approval_keys (cyclomatic 18): _tool_identity.get_function_tool_approval_keys 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":"src/agents/_tool_identity.py"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d1203669e352793eaf5b083c3089fc9c4c6b8395ecac1c54dcb1bc16bd6d3f"}},{"ruleId":"D1","level":"warning","message":{"text":"history._get_nested_history_owned_items (cyclomatic 18): history._get_nested_history_owned_items 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":"src/agents/handoffs/history.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"349dbfdfe5d9f71854282bcf0fcec43cb2445e4091061c3a40a2782bfdabbec4"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter.convert_tool_choice (cyclomatic 18): Converter.convert_tool_choice 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":"src/agents/models/openai_responses.py"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e12cc08066397cf8653dbf3000178f1c566d2c14dea1661b861531c07ca38c"}},{"ruleId":"D1","level":"warning","message":{"text":"RunResultStreaming._check_errors (cyclomatic 18): RunResultStreaming._check_errors 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":"src/agents/result.py"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8275eb4e540dd4ae93e8db7d8bffdeb2fe866209a7a40645814aec48dcfd0e4d"}},{"ruleId":"D1","level":"warning","message":{"text":"_FunctionToolBatchExecutor._maybe_execute_tool_approval (cyclomatic 18): _FunctionToolBatchExecutor._maybe_execute_tool_approval 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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"4760731b5b34f328f5351f2f7462e4adaf8f3cf4198ef53257d54b5c6c0d52c9"}},{"ruleId":"D1","level":"warning","message":{"text":"_FunctionToolBatchExecutor._invoke_tool_and_run_post_invoke (cyclomatic 18): _FunctionToolBatchExecutor._invoke_tool_and_run_post_invoke 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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":2079}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41e85ece3ce6d10658428039c31148ee7171f49273816df10b51450f6433b1f"}},{"ruleId":"D1","level":"warning","message":{"text":"tool_execution.coerce_shell_call (cyclomatic 18): tool_execution.coerce_shell_call 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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbbceaa8e22bf456e173737dad1edd001b50f9e7612a98c0a53d280b1e49755"}},{"ruleId":"D1","level":"warning","message":{"text":"LitellmModel._convert_gemini_extra_content_to_provider_specific_fields (cyclomatic 17): LitellmModel._convert_gemini_extra_content_to_provider_specific_fields has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca00d4094a4acc1c9d620014479767ed15ec7ae37ade8bdc7507a39d98629fdf"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolOutputTrimmer._trim_json_schema (cyclomatic 17): ToolOutputTrimmer._trim_json_schema has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/tool_output_trimmer.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"021c5f6216266d023dade4697a7da28a8f8eb16411d31c9fa9a41552660242f4"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelSettings.resolve (cyclomatic 17): ModelSettings.resolve has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/model_settings.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1db3899ff09c768ed89a3abf9337ffa654b9e332d52c0734d914a4f903747f"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIResponsesWSModel.get_retry_advice (cyclomatic 17): OpenAIResponsesWSModel.get_retry_advice has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/openai_responses.py"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6930f7030a2b392d4fa57b244660eae692a3e8451cddfd683c21f5dc54b55e"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter.convert_tools (cyclomatic 17): Converter.convert_tools has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/openai_responses.py"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ded0aee35a16ea67625b1a07ec9ea164c3b819ed447a362330ab581fc24c27"}},{"ruleId":"D1","level":"warning","message":{"text":"strict_schema._json_values_equal (cyclomatic 17): strict_schema._json_values_equal 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":"src/agents/strict_schema.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2ce0aa295f1ad28ad0c78041f1dba1281e787f7afacd50d5149db44fd79108"}},{"ruleId":"D1","level":"warning","message":{"text":"_function_tool_arguments._is_data_only_schema (cyclomatic 16): _function_tool_arguments._is_data_only_schema 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":"src/agents/_function_tool_arguments.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12d11c01f0ee94d04778d9843a832b2816405c9c3b9c8d3680700f023620b78"}},{"ruleId":"D1","level":"warning","message":{"text":"events.coerce_thread_event (cyclomatic 16): events.coerce_thread_event 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":"src/agents/extensions/experimental/codex/events.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf41213db432176b312a8c8ec5f7e6fdfa884ba63d70beaab5f910756bf31b33"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAIHostedMultiAgentModel._prepare_websocket_request (cyclomatic 16): OpenAIHostedMultiAgentModel._prepare_websocket_request 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":"src/agents/extensions/experimental/hosted_multi_agent/model.py"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3535086254e8d7d378b1a442e612a2bf71984481ea554484581c64f315a8a2"}},{"ruleId":"D1","level":"warning","message":{"text":"visualization._get_all_nodes (cyclomatic 16): visualization._get_all_nodes 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":"src/agents/extensions/visualization.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dea9d2110ab0791177ed3d8c42ff750e3fdd929d16342038d9c07a0c4ded38"}},{"ruleId":"D1","level":"warning","message":{"text":"_ServerWorker._run (cyclomatic 16): _ServerWorker._run 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":"src/agents/mcp/manager.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"55277f59ccdbf829a4831549b27db1c8e7cbfbf3c7aab1266d1812dcca249b80"}},{"ruleId":"D1","level":"warning","message":{"text":"audio_formats.to_realtime_audio_format (cyclomatic 16): audio_formats.to_realtime_audio_format 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":"src/agents/realtime/audio_formats.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"015f7c27cf18338e82add12a50c292c4e03d22f28f5e787ad92bc467f881a57b"}},{"ruleId":"D1","level":"warning","message":{"text":"RealtimeSession._maybe_request_tool_approval (cyclomatic 16): RealtimeSession._maybe_request_tool_approval 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":"src/agents/realtime/session.py"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"893fa5cae3b828d5a96f5bb7f6af2ac94c0ac60eb8f18f6af26536053f56a67c"}},{"ruleId":"D1","level":"warning","message":{"text":"RunResultStreaming.stream_events (cyclomatic 16): RunResultStreaming.stream_events 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":"src/agents/result.py"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"827071931df73085398efde50d15bad64ea7955f15238f76b949e14ea3912d24"}},{"ruleId":"D1","level":"warning","message":{"text":"RunContextWrapper._approval_records_for_key (cyclomatic 16): RunContextWrapper._approval_records_for_key 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":"src/agents/run_context.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a2cd70a1edc4d69c7faacabdde585e3279d3e71246c170f288c1b24c38de4d"}},{"ruleId":"D1","level":"warning","message":{"text":"tool_execution.normalize_shell_output (cyclomatic 16): tool_execution.normalize_shell_output 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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"562ae4ba9af371309758747750fb566cd8a8f227cda1d4c586d47f406bd8bf1a"}},{"ruleId":"D1","level":"warning","message":{"text":"turn_resolution._completed_tool_step_items (cyclomatic 16): turn_resolution._completed_tool_step_items 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":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0e9fc963aab023d4f2f6df9a226aad600a49660cc4e233a38ec3282e2adf35"}},{"ruleId":"D1","level":"warning","message":{"text":"RunState._serialize_context_payload (cyclomatic 16): RunState._serialize_context_payload 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":"src/agents/run_state.py"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"a539d568495180c78958a4eb1215a29b3d4d1287c864e5cfbe49850c631a3623"}},{"ruleId":"D1","level":"warning","message":{"text":"run_state._run_state_program_call_ids (cyclomatic 16): run_state._run_state_program_call_ids 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":"src/agents/run_state.py"},"region":{"startLine":3980}}}],"partialFingerprints":{"codehealthFindingId/v1":"d595000320571858c909e46d07e837191c6d5b3a4748f3aba7eac7d687213a02"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentRunner._run_impl (cognitive 604): AgentRunner._run_impl has cognitive complexity 604 (threshold 15). Drivers by points: if/else 132 (402 pts), ternaries 32 (71 pts), error handling 20 (61 pts), boolean chains 56, loops 4 (14 pts) (nesting depth added 360). 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":"src/agents/run.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbfbe3c6d47b84acbc0dc45100a2317d59f2c6762f553c00226eff621a5f0be"}},{"ruleId":"D2","level":"warning","message":{"text":"run_loop.start_streaming (cognitive 469): run_loop.start_streaming has cognitive complexity 469 (threshold 15). Drivers by points: if/else 126 (327 pts), ternaries 26 (64 pts), error handling 14 (32 pts), boolean chains 31, loops 5 (15 pts) (nesting depth added 267). 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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eec176dd3a97d83029f4ddca15c0f833beb0264721a4e0f37cd55c55ece3282"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatCmplStreamHandler.handle_stream (cognitive 319): ChatCmplStreamHandler.handle_stream has cognitive complexity 319 (threshold 15). Drivers by points: if/else 86 (248 pts), boolean chains 33, ternaries 5 (26 pts), loops 6 (12 pts) (nesting depth added 189). 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":"src/agents/models/chatcmpl_stream_handler.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"e323a9430058d48637c16104312edbb25a5603701084432fbc282ffc14d3a87e"}},{"ruleId":"D2","level":"warning","message":{"text":"turn_resolution.resolve_interrupted_turn (cognitive 235): turn_resolution.resolve_interrupted_turn has cognitive complexity 235 (threshold 15). Drivers by points: if/else 79 (138 pts), boolean chains 37, loops 35 (36 pts), ternaries 12 (22 pts), error handling 2 (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"672ca0be3abc24d59a8a28d4d4b057d36f5619a535ce45fa802f11c6d5a846d1"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter.items_to_messages (cognitive 193): Converter.items_to_messages has cognitive complexity 193 (threshold 15). Drivers by points: if/else 42 (145 pts), loops 5 (18 pts), ternaries 5 (16 pts), boolean chains 14 (nesting depth added 127). 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":"src/agents/models/chatcmpl_converter.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73d3bc66e73a19450690a3a4d282fe6b121e5c270d1a53098669a34e89f6d20"}},{"ruleId":"D2","level":"warning","message":{"text":"turn_resolution.process_model_response (cognitive 192): turn_resolution.process_model_response has cognitive complexity 192 (threshold 15). Drivers by points: if/else 60 (132 pts), ternaries 13 (38 pts), boolean chains 17, loops 2 (5 pts) (nesting depth added 100). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":3158}}}],"partialFingerprints":{"codehealthFindingId/v1":"179ac91ce496502a78c9cae3e156772fe25cfcfd63b1f276f98be4fb2682e601"}},{"ruleId":"D2","level":"warning","message":{"text":"RealtimeSession._get_new_history (cognitive 191): RealtimeSession._get_new_history has cognitive complexity 191 (threshold 15). Drivers by points: if/else 36 (140 pts), loops 7 (31 pts), boolean chains 13, ternaries 1 (7 pts) (nesting depth added 134). 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":"src/agents/realtime/session.py"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfbcb0f8a847f29ad8058b9853a8ab9ea2eb87957c938d9601e89a7c549090e"}},{"ruleId":"D2","level":"warning","message":{"text":"review_protocol.validate_packet (cognitive 174): review_protocol.validate_packet has cognitive complexity 174 (threshold 15). Drivers by points: if/else 70 (126 pts), loops 18 (28 pts), boolean chains 20 (nesting depth added 66). 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":".agents/skills/implementation-final-review/scripts/review_protocol.py"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"a659ac1ad955091d93422c5df64fd7347c7dbbba41a42b45d7528f0b43d4e842"}},{"ruleId":"D2","level":"warning","message":{"text":"run_state._build_run_state_from_json (cognitive 172): run_state._build_run_state_from_json has cognitive complexity 172 (threshold 15). Drivers by points: if/else 63 (105 pts), boolean chains 38, loops 7 (14 pts), ternaries 9 (13 pts), error handling 1 (2 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_state.py"},"region":{"startLine":4186}}}],"partialFingerprints":{"codehealthFindingId/v1":"159c3666cfdc329ad7c6c0ae9a99d11903f1e07529b7d6dc144b08c36a99957c"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIServerConversationTracker.hydrate_from_state (cognitive 113): OpenAIServerConversationTracker.hydrate_from_state has cognitive complexity 113 (threshold 15). Drivers by points: if/else 33 (84 pts), boolean chains 14, ternaries 3 (8 pts), loops 5 (7 pts) (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/oai_conversation.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c43112270ca72c5c5cdf6da13de8187592a8b16b4f12fd6c311a312179b83ee"}},{"ruleId":"D2","level":"warning","message":{"text":"run_state._validate_completed_tool_invocations (cognitive 109): run_state._validate_completed_tool_invocations has cognitive complexity 109 (threshold 15). Drivers by points: if/else 26 (59 pts), loops 23 (43 pts), error handling 1 (4 pts), boolean chains 3 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_state.py"},"region":{"startLine":4833}}}],"partialFingerprints":{"codehealthFindingId/v1":"623c73fca4a2db566aa33fce285b8f9215eb5fdfe810dd7614369c6af1ab7589"}},{"ruleId":"D2","level":"warning","message":{"text":"turn_resolution.execute_tools_and_side_effects (cognitive 101): turn_resolution.execute_tools_and_side_effects has cognitive complexity 101 (threshold 15). Drivers by points: if/else 26 (82 pts), boolean chains 7, error handling 3 (7 pts), ternaries 5 (nesting depth added 60). 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":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"daeefc50cef970166019f1237d3ddfbaf22a06c1b9320618178aa330af8c43e0"}},{"ruleId":"D2","level":"warning","message":{"text":"RealtimeSession.on_event (cognitive 100): RealtimeSession.on_event has cognitive complexity 100 (threshold 15). Drivers by points: if/else 30 (80 pts), boolean chains 11, error handling 2 (6 pts), loops 1 (3 pts) (nesting depth added 56). 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":"src/agents/realtime/session.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c834288e9f65d853d3ad2f7598ba10fc62bf0e8999da895a67ebc834f0530f2"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIResponsesCompactionSession._run_compaction_locked (cognitive 92): OpenAIResponsesCompactionSession._run_compaction_locked has cognitive complexity 92 (threshold 15). Drivers by points: if/else 32 (55 pts), boolean chains 22, ternaries 6 (11 pts), error handling 1 (2 pts), loops 1 (2 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":"src/agents/memory/openai_responses_compaction_session.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"530fad30ee88f38830e6f061522be77678f06906e0703ab42d9f8241438aba31"}},{"ruleId":"D2","level":"warning","message":{"text":"RunContextWrapper.get_approval_status (cognitive 92): RunContextWrapper.get_approval_status has cognitive complexity 92 (threshold 15). Drivers by points: if/else 28 (52 pts), ternaries 13 (20 pts), boolean chains 14, loops 4 (6 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_context.py"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce99c517328a7a0e30a03d93a0e8fd67364a71916350e935b7bcf8e79ebfbf13"}},{"ruleId":"D2","level":"warning","message":{"text":"run_state._copy_pydantic_value (cognitive 90): run_state._copy_pydantic_value has cognitive complexity 90 (threshold 15). Drivers by points: if/else 31 (72 pts), loops 7 (16 pts), boolean chains 2 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_state.py"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6743e53e76c4b7d778b6e23b1d0da7166d23a5fb45c083ef6ae3aec87cc35c"}},{"ruleId":"D2","level":"warning","message":{"text":"RunContextWrapper._apply_approval_decision (cognitive 89): RunContextWrapper._apply_approval_decision has cognitive complexity 89 (threshold 15). Drivers by points: if/else 33 (58 pts), ternaries 9 (19 pts), boolean chains 11, loops 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_context.py"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ab606691b6084ee18be6b2d10b1893df17b5725cca15b4e8990c23524c1ae6"}},{"ruleId":"D2","level":"warning","message":{"text":"model_retry.stream_response_with_retry (cognitive 87): model_retry.stream_response_with_retry has cognitive complexity 87 (threshold 15). Drivers by points: if/else 17 (49 pts), error handling 5 (15 pts), ternaries 5 (14 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/model_retry.py"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"f390095c1033d1920aee4aa8627aa9e076071c7b6f03d2ab43fed5bd7361b973"}},{"ruleId":"D2","level":"warning","message":{"text":"review_protocol.validate_reviewer_output (cognitive 86): review_protocol.validate_reviewer_output has cognitive complexity 86 (threshold 15). Drivers by points: if/else 29 (61 pts), boolean chains 10, loops 6 (9 pts), ternaries 2 (6 pts) (nesting depth added 39). 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":".agents/skills/implementation-final-review/scripts/review_protocol.py"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e8fc301a8f3853a86da93aa5f7df35b624dfe0316a82f7c02d04c63c1a9699"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIRealtimeWebSocketModel._handle_ws_event (cognitive 84): OpenAIRealtimeWebSocketModel._handle_ws_event has cognitive complexity 84 (threshold 15). Drivers by points: if/else 24 (58 pts), boolean chains 14, ternaries 3 (7 pts), loops 1 (3 pts), error handling 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":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd096bec4795caf6a5d7e4462c6aa546d229eba402b831f18c3066b412c5e44"}},{"ruleId":"D2","level":"warning","message":{"text":"LitellmModel._fix_tool_message_ordering (cognitive 80): LitellmModel._fix_tool_message_ordering has cognitive complexity 80 (threshold 15). Drivers by points: if/else 19 (57 pts), loops 6 (19 pts), boolean chains 4 (nesting depth added 51). 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":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a5309b6f31c62a570cf6165e1e4e050ce951255e1c1d980c33c10b9b640b09"}},{"ruleId":"D2","level":"warning","message":{"text":"_run_state_agent_identity._iter_agent_graph (cognitive 73): _run_state_agent_identity._iter_agent_graph has cognitive complexity 73 (threshold 15). Drivers by points: if/else 15 (50 pts), ternaries 3 (13 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/_run_state_agent_identity.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ebf469b335fe3458318cc3ac6bda4ca378fee824107db51fd464932f0a9c67"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter.message_to_output_items (cognitive 73): Converter.message_to_output_items has cognitive complexity 73 (threshold 15). Drivers by points: if/else 23 (59 pts), boolean chains 5, loops 2 (5 pts), ternaries 3 (4 pts) (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":"src/agents/models/chatcmpl_converter.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9a9c50f88d2eb48ccf9115b518604ceed1ace517ce31e1b5e8b3a946598c26"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyLLMModel._fix_tool_message_ordering (cognitive 72): AnyLLMModel._fix_tool_message_ordering has cognitive complexity 72 (threshold 15). Drivers by points: if/else 16 (49 pts), loops 6 (18 pts), boolean chains 5 (nesting depth added 45). 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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea15a8892546647d4e313eef0be3f7b557f3d316771e45c33050270da7817f7a"}},{"ruleId":"D2","level":"warning","message":{"text":"function_schema.function_schema (cognitive 70): function_schema.function_schema has cognitive complexity 70 (threshold 15). Drivers by points: if/else 24 (49 pts), boolean chains 13, loops 4, ternaries 3 (4 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":"src/agents/function_schema.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63a13457c3483c33a282f6fc306c1b6af0f4087c4a2f51cf15ea155add4077d"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIHostedMultiAgentModel._iter_websocket_turn (cognitive 67): OpenAIHostedMultiAgentModel._iter_websocket_turn has cognitive complexity 67 (threshold 15). Drivers by points: if/else 23 (51 pts), ternaries 3 (7 pts), boolean chains 5, loops 2 (3 pts), error handling 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/experimental/hosted_multi_agent/model.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"5290c44497efeb16deadc5c6f3c51f01fd2231131654144955e06c666fd2d2d8"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIResponsesWSModel._iter_websocket_response_events (cognitive 67): OpenAIResponsesWSModel._iter_websocket_response_events has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (49 pts), boolean chains 9, ternaries 1 (4 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/openai_responses.py"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"befb5e84f0c7d4363cf1667eaa6cfab4037529ee4882a6705f4a67cd6ac6fa3b"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIRealtimeWebSocketModel._interrupt_audio_playback (cognitive 66): OpenAIRealtimeWebSocketModel._interrupt_audio_playback has cognitive complexity 66 (threshold 15). Drivers by points: if/else 17 (35 pts), error handling 3 (11 pts), boolean chains 10, ternaries 3 (8 pts), loops 1 (2 pts) (nesting depth added 32). 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":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"686a853bc3cc74faee13e380f152be87645156ffa2699d837c2bf3d646e64a70"}},{"ruleId":"D2","level":"warning","message":{"text":"RealtimeSession._handle_tool_call (cognitive 65): RealtimeSession._handle_tool_call has cognitive complexity 65 (threshold 15). Drivers by points: if/else 27 (41 pts), boolean chains 15, ternaries 8 (9 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":"src/agents/realtime/session.py"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"732426f92279fec2eba7fc43abef90c1efcd61d8aaf7e11b9dc26c8f0e855bf7"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_tool._enforce_span_data_budget (cognitive 63): codex_tool._enforce_span_data_budget has cognitive complexity 63 (threshold 15). Drivers by points: if/else 27 (42 pts), loops 10 (17 pts), boolean chains 4 (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":"src/agents/extensions/experimental/codex/codex_tool.py"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"23772a3fa27841c923d2534f8722a7a41151030b4273b6017d6b3bef74bdd6bb"}},{"ruleId":"D2","level":"warning","message":{"text":"turn_resolution._preflight_response_invocations_after_processing_error (cognitive 61): turn_resolution._preflight_response_invocations_after_processing_error has cognitive complexity 61 (threshold 15). Drivers by points: if/else 17 (32 pts), ternaries 7 (23 pts), boolean chains 5, loops 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":3918}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0f7297cdb513c56ef49c3655bcfa734cc5a12e6ae628c315842f50dc5f40ce"}},{"ruleId":"D2","level":"warning","message":{"text":"items.drop_orphan_function_calls (cognitive 59): items.drop_orphan_function_calls has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (43 pts), boolean chains 12, loops 3 (4 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/items.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5bff356ea948a193546454a93dad69596c4a942082e4dcc2f0c25cf026237b"}},{"ruleId":"D2","level":"warning","message":{"text":"strict_schema._ensure_strict_json_schema (cognitive 58): strict_schema._ensure_strict_json_schema has cognitive complexity 58 (threshold 15). Drivers by points: if/else 27 (39 pts), boolean chains 13, loops 2 (4 pts), 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":"src/agents/strict_schema.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"61321c5479ddd1906608818f5e5571def32909e79edb5d0bafc0ef827d59a381"}},{"ruleId":"D2","level":"warning","message":{"text":"BackendSpanExporter._export_with_deadline (cognitive 58): BackendSpanExporter._export_with_deadline has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (41 pts), error handling 2 (7 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/tracing/processors.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f1c039ec45dd4ed205b91e577aebeb0d23a5d237772314095a7192dc68049b"}},{"ruleId":"D2","level":"warning","message":{"text":"run_loop._finalize_streamed_final_output (cognitive 57): run_loop._finalize_streamed_final_output has cognitive complexity 57 (threshold 15). Drivers by points: if/else 21 (45 pts), error handling 5 (9 pts), boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/run_loop.py"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"96aa9ac3d7ca13ed0cd36dc1d1b18b310ce660b4e27cecb38d8ddb18ff042545"}},{"ruleId":"D2","level":"warning","message":{"text":"session_persistence.prepare_input_with_session (cognitive 57): session_persistence.prepare_input_with_session has cognitive complexity 57 (threshold 15). Drivers by points: if/else 23 (46 pts), ternaries 2 (5 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 27). 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":"src/agents/run_internal/session_persistence.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b780c95c54e8f58d99710aadfad72aa35535373754ca4d699b4d1f96c9d56e7"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPUtil.invoke_mcp_tool (cognitive 53): MCPUtil.invoke_mcp_tool has cognitive complexity 53 (threshold 15). Drivers by points: if/else 25 (37 pts), boolean chains 6, error handling 5 (6 pts), loops 1 (2 pts), ternaries 2 (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":"src/agents/mcp/util.py"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"c396cd5133c05da249e8053535af74f91c5f1cf022bdad830f334debc537059f"}},{"ruleId":"D2","level":"warning","message":{"text":"session_persistence.resume_pending_session_write (cognitive 52): session_persistence.resume_pending_session_write has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 22, 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":"src/agents/run_internal/session_persistence.py"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58f99400e5ad9844c17179b71e942eb7dd81f689dfcf3d4c50e1d66b0b770ea"}},{"ruleId":"D2","level":"warning","message":{"text":"run_loop.run_single_turn_streamed (cognitive 48): run_loop.run_single_turn_streamed has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (25 pts), ternaries 10 (19 pts), boolean chains 2, error handling 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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":2421}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf27eb3eb3ef235ec25fdfb8fc67dbb186723c9568616e7adcc4f35ceec7307"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_planning._dedupe_processed_response_invocations (cognitive 48): tool_planning._dedupe_processed_response_invocations has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (35 pts), loops 5 (7 pts), boolean chains 6 (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":"src/agents/run_internal/tool_planning.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"0363039df26e2835846991c580aceb80aa986b1b891e4140a6d937f9da7bbdbb"}},{"ruleId":"D2","level":"warning","message":{"text":"RealtimeSession._run_output_guardrails (cognitive 47): RealtimeSession._run_output_guardrails has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 7, error handling 1 (2 pts), loops 2, ternaries 1 (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":"src/agents/realtime/session.py"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd212d42efeda3bf7fa3f961e4f4dfa9259b69fb399c85e376cd2595594a2dc3"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIServerConversationTracker.prepare_input (cognitive 47): OpenAIServerConversationTracker.prepare_input has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 9, loops 5 (8 pts), ternaries 2 (4 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":"src/agents/run_internal/oai_conversation.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff8b7b857c8146afdc47c9c23f152f88da40072a17ae913707d9a369180b485"}},{"ruleId":"D2","level":"warning","message":{"text":"run_state._deserialize_items (cognitive 47): run_state._deserialize_items has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (26 pts), error handling 4 (10 pts), ternaries 3 (8 pts), boolean chains 2, loops 1 (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":"src/agents/run_state.py"},"region":{"startLine":5172}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4ebe654c86cfd284945e1519f171dbe7a30d27cb9405c97906e0e6469fcd97"}},{"ruleId":"D2","level":"warning","message":{"text":"turn_resolution.execute_handoffs (cognitive 46): turn_resolution.execute_handoffs has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 10, ternaries 6 (9 pts), error handling 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":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d0ae9c080a054e6ec9cb3d3848470fdd84e43b12c4b20b5cae48bfeb548044"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPServerStreamableHttp.call_tool (cognitive 45): MCPServerStreamableHttp.call_tool has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 7, error handling 5 (7 pts), loops 1 (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":"src/agents/mcp/server.py"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a2f3ce02efb3e4b14ca9dd50c78e234e838fdf8b409784104b9f98c064a24a"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatCmplStreamHandler.buffer_tool_call_stream (cognitive 44): ChatCmplStreamHandler.buffer_tool_call_stream has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (7 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/chatcmpl_stream_handler.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa59ecf4f4b2e2f148a3a311e167b6ffa489cb0e969ef1d68ae36f02575cfcd"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_execution.collect_manual_mcp_approvals (cognitive 44): tool_execution.collect_manual_mcp_approvals has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 12, ternaries 1 (2 pts), 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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a49807bc8d314223d35f1b0bb9eb26315b3ab3cce68d27ff77ec979a2f7dcf"}},{"ruleId":"D2","level":"warning","message":{"text":"run_state._run_state_raw_items (cognitive 44): run_state._run_state_raw_items has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 5 (8 pts), boolean chains 2 (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":"src/agents/run_state.py"},"region":{"startLine":3909}}}],"partialFingerprints":{"codehealthFindingId/v1":"3083c39ce69152a3859812b4dc203ca1b26a579a4deeaf55aa4c80a31bfd2cf5"}},{"ruleId":"D2","level":"warning","message":{"text":"LitellmModel._convert_gemini_extra_content_to_provider_specific_fields (cognitive 43): LitellmModel._convert_gemini_extra_content_to_provider_specific_fields has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (34 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 27). 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":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"b312bbe4019cd31cd3d4819a9f7510f6283a1abdc46d4e1a6f3121bf48da02e1"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIResponsesModel.stream_response (cognitive 43): OpenAIResponsesModel.stream_response has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (28 pts), error handling 4 (5 pts), ternaries 2 (5 pts), boolean chains 4, loops 1 (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":"src/agents/models/openai_responses.py"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73a97636f80b8f11020978a1494ddc91d370f617f1416e0bccedad7e1eefba6"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter._convert_tool (cognitive 43): Converter._convert_tool has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (33 pts), ternaries 4 (8 pts), boolean chains 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":"src/agents/models/openai_responses.py"},"region":{"startLine":2237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5975c95acda6380868dce54d9e6522049c6f747df2454ce3f138d1d1e7f1d7b"}},{"ruleId":"D2","level":"warning","message":{"text":"session_persistence.save_result_to_session (cognitive 42): session_persistence.save_result_to_session has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (28 pts), ternaries 6, boolean chains 5, loops 3 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/session_persistence.py"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2bb0a63287cdd6e4400e6419a75504a96b15d89d2fce33317dbbdd36537d97"}},{"ruleId":"D2","level":"warning","message":{"text":"run_state._restore_current_response_item_identities (cognitive 42): run_state._restore_current_response_item_identities has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (28 pts), boolean chains 9, loops 4, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_state.py"},"region":{"startLine":5471}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f4e052b03f089de474abe72db46a39f0c806eb1fbec86330753331a5b0d8a0"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamedAudioResult._stream_audio (cognitive 41): StreamedAudioResult._stream_audio has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (35 pts), ternaries 3 (4 pts), error handling 1, loops 1 (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":"src/agents/voice/result.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d1401e6973c08857c7ffc76f4f9a23b09b73a5394b23c87f0c98358c35fca9"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter.extract_all_content (cognitive 39): Converter.extract_all_content has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 9, 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":"src/agents/models/chatcmpl_converter.py"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26a9c7b2f64ae97d476ab1aecc7be49362c7523970299758c8ed002c1725bef"}},{"ruleId":"D2","level":"warning","message":{"text":"_run_state_agent_identity._normalize_capability_identity_value (cognitive 38): _run_state_agent_identity._normalize_capability_identity_value has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (27 pts), loops 2 (5 pts), boolean chains 4, error handling 1 (2 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":"src/agents/_run_state_agent_identity.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"34720bbb8eabff7ffe01cbd1e1143f964fd4c86e482be2df97df61e1dbe6db4c"}},{"ruleId":"D2","level":"warning","message":{"text":"_MCPServerWithClientSession.connect (cognitive 38): _MCPServerWithClientSession.connect has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (24 pts), error handling 4 (7 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/mcp/server.py"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bd70da9cd7dafabad8c0d1311b88624254029b9b00ff3164342fa9bbb34216"}},{"ruleId":"D2","level":"warning","message":{"text":"result._input_items_for_result (cognitive 38): result._input_items_for_result has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (32 pts), boolean chains 6 (nesting depth added 19). 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":"src/agents/result.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9ba2d3e01411123ea6fe55e50c4de1616fa9caf3da3919a7297dff205b25e1"}},{"ruleId":"D2","level":"warning","message":{"text":"RunContextWrapper.get_rejection_message (cognitive 38): RunContextWrapper.get_rejection_message has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 6, loops 4 (6 pts), ternaries 6 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_context.py"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3c1b2df4b5c9680a4a373846748e0c7d7066c0609254f92bcbd9df28a12969"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAISTTTranscriptionSession._handle_events (cognitive 38): OpenAISTTTranscriptionSession._handle_events has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 4, error handling 2 (4 pts), loops 1 (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":"src/agents/voice/models/openai_stt.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"211064d1206e3c316ceef9e364bc4d240ee24ea50a0f02796f46f088d11aa001"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyLLMModel._stream_response_via_responses (cognitive 37): AnyLLMModel._stream_response_via_responses has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (25 pts), ternaries 2 (7 pts), error handling 2 (3 pts), boolean chains 1, loops 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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c6f8c772e7c26e18524f1a53387b7508e774e80d1011f51d52d7a0b608a26b"}},{"ruleId":"D2","level":"warning","message":{"text":"run_state._validate_declared_payload (cognitive 36): run_state._validate_declared_payload has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 3 (8 pts), boolean chains 4, error handling 1 (2 pts) (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":"src/agents/run_state.py"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba03fbaf215a86a68defee0cb0c2f5ec07123bf43ff454c2f8aa151914ea8bb"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultTraceProvider.create_span (cognitive 36): DefaultTraceProvider.create_span has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 8, ternaries 1 (2 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":"src/agents/tracing/provider.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"651cead345baf92da6415167fda7b230a3ff260f02fc5389c7aacb42de2b3ea0"}},{"ruleId":"D2","level":"warning","message":{"text":"translate_docs.main (cognitive 35): translate_docs.main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (12 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":"docs/scripts/translate_docs.py"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fb46855f987cc5fe0c8ad8430d709f0a059347cdcc6825dffbdb2b5d4db985"}},{"ruleId":"D2","level":"warning","message":{"text":"RunContextWrapper._matching_sticky_approval_keys (cognitive 35): RunContextWrapper._matching_sticky_approval_keys has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 4 (8 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_context.py"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6ab43ba5754656b77a1cc00bd9bab90f20e0d83457d1af9a8e16d8f8badee0"}},{"ruleId":"D2","level":"warning","message":{"text":"model_retry._evaluate_retry (cognitive 35): model_retry._evaluate_retry has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 14, ternaries 8 (13 pts), if/else 8 (nesting depth added 5). 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":"src/agents/run_internal/model_retry.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"1093ebe34ec7167d3c8b2af0ee2d94f6f301f6b536437f90df5fe28d18b73978"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_planning._register_tool_call_items (cognitive 35): tool_planning._register_tool_call_items has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (22 pts), ternaries 3 (8 pts), loops 3, boolean chains 2 (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":"src/agents/run_internal/tool_planning.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9f816b41191bd8fcb5d4eb1afef966dc3ecf08b2ad793fdb214ae8b4fc8448"}},{"ruleId":"D2","level":"warning","message":{"text":"AsyncSQLiteSession._get_connection (cognitive 34): AsyncSQLiteSession._get_connection has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (17 pts), error handling 5 (14 pts), ternaries 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/memory/async_sqlite_session.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"022b80cac9ff40f52d4cd4feaea9d615801ff746d49d00e98e432f97de95231e"}},{"ruleId":"D2","level":"warning","message":{"text":"_MCPServerWithClientSession.list_tools (cognitive 34): _MCPServerWithClientSession.list_tools has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 4, error handling 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/mcp/server.py"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02fa4c278d369b82db0032df176018e27fbadb736a39189b1e38433006965ef"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIRealtimeWebSocketModel._get_session_config (cognitive 34): OpenAIRealtimeWebSocketModel._get_session_config has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20 (22 pts), boolean chains 6, ternaries 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5bfcf1afdd90c697aae09c3ba32b73d364f55210f28d8063161a7761054346"}},{"ruleId":"D2","level":"warning","message":{"text":"_ConversionHelper.convert_user_input_to_conversation_item (cognitive 34): _ConversionHelper.convert_user_input_to_conversation_item has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (22 pts), ternaries 1 (5 pts), error handling 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 21). 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":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2e5e23511ecae6048d9c86369c676bef61f93a94505fe36948257910a17a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentRunner.run_streamed (cognitive 34): AgentRunner.run_streamed has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 20 (21 pts), if/else 9, boolean chains 4 (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":"src/agents/run.py"},"region":{"startLine":2619}}}],"partialFingerprints":{"codehealthFindingId/v1":"0988f11ab5abe2018315d2cbc3213c34557bb00470834368adc661af286ed850"}},{"ruleId":"D2","level":"warning","message":{"text":"model._stream_events_for_step (cognitive 34): model._stream_events_for_step has cognitive complexity 34 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 5 (9 pts), boolean chains 7, ternaries 1 (3 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":"src/agents/testing/model.py"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"b395b6858d3a826edcaad086d68eda858011089868762043b21727ae7d748e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"LitellmModel.get_response (cognitive 33): LitellmModel.get_response has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 11, ternaries 5 (8 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"038cac09d0d369ecd9bd04df3d981535a4ac3de71babe7ee1405b90e0017b899"}},{"ruleId":"D2","level":"warning","message":{"text":"LitellmModel._fetch_response (cognitive 33): LitellmModel._fetch_response has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 7, ternaries 2, loops 1 (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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51e6e90e74f0ea64de978f68a7e2d914d6e1ce7ba28a7bcaddbf9c75e719c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"run_state._restore_pydantic_fields_set (cognitive 33): run_state._restore_pydantic_fields_set has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 5 (10 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_state.py"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b523e0de5cf5b163e5d9105c8009cbf93aef2ff43330cf8d66708ee4f861152"}},{"ruleId":"D2","level":"warning","message":{"text":"MongoDBSession._pop_item (cognitive 32): MongoDBSession._pop_item has cognitive complexity 32 (threshold 15). Drivers by points: error handling 7 (16 pts), if/else 7 (15 pts), 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":"src/agents/extensions/memory/mongodb_session.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a888a8e59d86e7ead29821239dafb8b79160e97320f0274f92b8a013622716a"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyLLMModel._fetch_chat_response (cognitive 32): AnyLLMModel._fetch_chat_response has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 9, ternaries 4 (5 pts), loops 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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"63480d2d2a124d82558265e5e17a224b007971c36d0edbc8d686c259dceb6fc7"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolOutputTrimmer._trim_json_schema (cognitive 32): ToolOutputTrimmer._trim_json_schema has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 4 (13 pts), boolean chains 4, 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":"src/agents/extensions/tool_output_trimmer.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca92ca6a56e0ced3e2f2171857b8e8c704b667233504f3888355a07d00a23d9"}},{"ruleId":"D2","level":"warning","message":{"text":"RunState._find_nested_approval_state (cognitive 32): RunState._find_nested_approval_state has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 10, loops 3 (4 pts), 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":"src/agents/run_state.py"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"5922e350a0328dda42779947150a8b7c72df947a6bf744dcb69b4254f9c67d12"}},{"ruleId":"D2","level":"warning","message":{"text":"_asyncio_tasks.gather_with_cancel (cognitive 32): _asyncio_tasks.gather_with_cancel has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (9 pts), error handling 4 (6 pts), boolean chains 1 (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. This shape REPEATS in the file: one other method here (_asyncio_tasks.gather_with_cancel) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/util/_asyncio_tasks.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dfe9fe47c6df1e306f5819137e83efe79d5631f2ed3ca0c84da1dd7585b2df"}},{"ruleId":"D2","level":"warning","message":{"text":"_asyncio_tasks.gather_with_cancel (cognitive 32): _asyncio_tasks.gather_with_cancel has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (9 pts), error handling 4 (6 pts), boolean chains 1 (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. This shape REPEATS in the file: one other method here (_asyncio_tasks.gather_with_cancel) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/util/_asyncio_tasks.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa5117623c44d193e36991c23764a541fd093ebbe7e9c12d5eca8ec2ec7e1ca"}},{"ruleId":"D2","level":"warning","message":{"text":"_tool_identity.resolve_tool_name_collisions (cognitive 31): _tool_identity.resolve_tool_name_collisions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 4 (5 pts), boolean chains 2, ternaries 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":"src/agents/_tool_identity.py"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3ee2cbe1fea71de625ee69cce799ae9ca224aed5f63dd24d49163c45670a2c"}},{"ruleId":"D2","level":"warning","message":{"text":"_tool_invocation.tool_invocation_identity_and_scope (cognitive 31): _tool_invocation.tool_invocation_identity_and_scope has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 5, ternaries 1 (2 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":"src/agents/_tool_invocation.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37c52ac57d4b525dd27f30fa232fddcbee7fa493b1bf30c064279e9dcfb147d"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolOutputTrimmer._structured_output_details (cognitive 31): ToolOutputTrimmer._structured_output_details has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 5, loops 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":"src/agents/extensions/tool_output_trimmer.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ec367b72c9c65421b7d17423216cb3f7cad92a132d01e2560a58b6659203d3"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIServerConversationTracker.validate_pending_input_filter (cognitive 31): OpenAIServerConversationTracker.validate_pending_input_filter has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5, loops 3 (5 pts), ternaries 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":"src/agents/run_internal/oai_conversation.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec4b5d12cc7c93d518f1e0a213ad91912aaa01f4902c0c3a233b56e14e46652"}},{"ruleId":"D2","level":"warning","message":{"text":"RunState._lookup_function_name (cognitive 31): RunState._lookup_function_name has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (5 pts), ternaries 1 (4 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":"src/agents/run_state.py"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6533ae55c6cfdf0cc9a1058f6a16b9c0231ab45f5ff3609609b515084e7fbf01"}},{"ruleId":"D2","level":"warning","message":{"text":"Agent.__post_init__ (cognitive 30): Agent.__post_init__ has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 7, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/agent.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"f139fe2d88c8b7cb2bbbbebde6a1a2afedf262a1402a9ca5ead3dd3065392be6"}},{"ruleId":"D2","level":"warning","message":{"text":"_ServerWorker._run (cognitive 30): _ServerWorker._run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 3 (8 pts), boolean chains 2, loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/mcp/manager.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"24048666f22a57175b9ab7025c299104c4ffaf46e7d67215e7b5580d70120261"}},{"ruleId":"D2","level":"warning","message":{"text":"repl.run_demo_loop (cognitive 30): repl.run_demo_loop has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 2 (4 pts), error handling 1 (2 pts) (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":"src/agents/repl.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"beae8d9eb1e6edf9f88c7cdaaed6d31b14e104432616aeeb22637a4919587c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"RunResultStreaming._check_errors (cognitive 30): RunResultStreaming._check_errors has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 6, loops 1 (nesting depth added 13). 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":"src/agents/result.py"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c501e6d27136abe53fabbd98dae70d21d3f1801a4d30ee53939771c8edc8930"}},{"ruleId":"D2","level":"warning","message":{"text":"RunContextWrapper._rebuild_hosted_mcp_approvals (cognitive 30): RunContextWrapper._rebuild_hosted_mcp_approvals has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 6, 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":"src/agents/run_context.py"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f685bdf260b212c635b195779eea794039aa81eaa0d10496a1c3781bf540cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"model_retry.get_response_with_retry (cognitive 30): model_retry.get_response_with_retry has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 3 (10 pts), boolean chains 5, error handling 1 (2 pts), 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":"src/agents/run_internal/model_retry.py"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af1a946b7618ca1baa7e084d7ce62523457d1d99ffdd208ee1f2648ee5f6b72"}},{"ruleId":"D2","level":"warning","message":{"text":"check_optional_truthiness._reference_bindings_for_scope (cognitive 29): check_optional_truthiness._reference_bindings_for_scope has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 9, loops 2 (4 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":".github/scripts/check_optional_truthiness.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"009f2c38f7ec85859adacc09bf38cbbc440c07914fb995934e8c65b6d382ffa5"}},{"ruleId":"D2","level":"warning","message":{"text":"release_automation.main (cognitive 29): release_automation.main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 4 (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":".github/scripts/release_automation.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1d57c105116e8e4ad04250842a4097494753c03f36c108242761ee2dcfa7b9"}},{"ruleId":"D2","level":"warning","message":{"text":"CodexExec.run (cognitive 29): CodexExec.run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21 (22 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/experimental/codex/exec.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b514791d64bd9fe7f982b6a1330419a6cd84bf3eac93f97e9c8d90720688ae"}},{"ruleId":"D2","level":"warning","message":{"text":"history._get_nested_history_owned_items (cognitive 29): history._get_nested_history_owned_items has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 3, boolean chains 2, ternaries 1 (2 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":"src/agents/handoffs/history.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6170f358a5e3e9fd8270b248ad70a6247dea9e1f8357ca8850d686c9cfd1b623"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_planning._collect_runs_by_approval (cognitive 29): tool_planning._collect_runs_by_approval has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 2 (6 pts), ternaries 3 (6 pts), boolean chains 2, loops 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":"src/agents/run_internal/tool_planning.py"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0033884ab18401f8686b387a32bd9cb920c3b27138606e83ea413cf43cc5d2b"}},{"ruleId":"D2","level":"warning","message":{"text":"RunState._merge_generated_items_with_processed (cognitive 29): RunState._merge_generated_items_with_processed has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 9, loops 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":"src/agents/run_state.py"},"region":{"startLine":1854}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb98a1ac472dcf9fcf3f13ef445ce58cfb63d32b3b560e5cb361f1f7dcaa4722"}},{"ruleId":"D2","level":"warning","message":{"text":"BackendSpanExporter._sanitize_for_openai_tracing_api (cognitive 29): BackendSpanExporter._sanitize_for_openai_tracing_api has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 1, 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":"src/agents/tracing/processors.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa690af98477b0db1af29e321b4e347b02fbba496d9237b44f9772b59d593226"}},{"ruleId":"D2","level":"warning","message":{"text":"apply_diff._read_section (cognitive 28): apply_diff._read_section has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6, ternaries 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/apply_diff.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b5b780d16c5108bd3a0f294a6f81080ae0d4a407512e779f8a8b3c4561c130"}},{"ruleId":"D2","level":"warning","message":{"text":"RedisSession._mutate_items_attempt (cognitive 28): RedisSession._mutate_items_attempt has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 5, loops 1 (3 pts), error handling 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/memory/redis_session.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"36958ee9f60dc41b9d34d94fad85fa985eb2280671f5e29cb1711fee9e4799fc"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPServerManager._connect_all_parallel (cognitive 28): MCPServerManager._connect_all_parallel has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (6 pts), 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":"src/agents/mcp/manager.py"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"e788a8a5af87c6ff8575916fd9de7a031043de00740610c892dcab5ae71b9c61"}},{"ruleId":"D2","level":"warning","message":{"text":"items.reconcile_nested_history_owned_input_after_rewrite (cognitive 28): items.reconcile_nested_history_owned_input_after_rewrite has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6, loops 4, ternaries 2 (4 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":"src/agents/run_internal/items.py"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e0d914ce74c0443b384f7a27aa8f09b322af0faf16e91de694500a484aa84a"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIServerConversationTracker.track_server_items (cognitive 28): OpenAIServerConversationTracker.track_server_items has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, loops 2 (3 pts), 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":"src/agents/run_internal/oai_conversation.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b52f32c99b59dfaa40924767477eb5a8dc11557bb3093a3e50ca11960343516"}},{"ruleId":"D2","level":"warning","message":{"text":"_FunctionToolBatchExecutor._build_function_tool_results (cognitive 28): _FunctionToolBatchExecutor._build_function_tool_results has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (15 pts), ternaries 3 (12 pts), loops 1 (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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":2272}}}],"partialFingerprints":{"codehealthFindingId/v1":"98efd791daac5d4a0bab1d6b3e2773e590419ce8d0111e0720aaaf53b5518029"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamedAudioResult.stream (cognitive 28): StreamedAudioResult.stream has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (14 pts), error handling 5 (8 pts), boolean chains 5, 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":"src/agents/voice/result.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9fd23e82bb855eb54bf26b3059df724f8f2b7c55c770f1ef4d7f7914ead055"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIChatCompletionsModel.get_response (cognitive 27): OpenAIChatCompletionsModel.get_response has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10, ternaries 6 (9 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":"src/agents/models/openai_chatcompletions.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc4b6db6918322846fe7a419da043dcadc18b2b23973fdc4534bd18993f115a"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIChatCompletionsModel._fetch_response (cognitive 27): OpenAIChatCompletionsModel._fetch_response has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 9, ternaries 5, loops 1 (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":"src/agents/models/openai_chatcompletions.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdeddaff2ebe77c55cbd0365e955bd08f201ef278fd06a226e0b460d4b350017"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIResponsesModel._build_response_create_kwargs (cognitive 27): OpenAIResponsesModel._build_response_create_kwargs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 6, ternaries 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/openai_responses.py"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"3666c2c819ab2bae25f64fab1f8e1ff8590d21978f201f523a56b132a6176916"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter.convert_tools (cognitive 27): Converter.convert_tools has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 3, ternaries 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":"src/agents/models/openai_responses.py"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86529f807f3d7ef6fa853b76c1486ea48116a96a0133eaa17d7b834353921d6"}},{"ruleId":"D2","level":"warning","message":{"text":"run_state._run_state_program_call_ids (cognitive 27): run_state._run_state_program_call_ids has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 5, 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":"src/agents/run_state.py"},"region":{"startLine":3980}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cfdbc014ed26e727c1d95ea32345d50d0892c3d66bbf5d24c453c07a8e8892"}},{"ruleId":"D2","level":"warning","message":{"text":"EncryptedSession.get_items (cognitive 26): EncryptedSession.get_items has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 5, loops 1 (2 pts), ternaries 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":"src/agents/extensions/memory/encrypt_session.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"12076c507c03c594e741a75c94669958bb5bf1b808407341abebae5ddf13b5bf"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolCallOutputItem.to_input_item (cognitive 26): ToolCallOutputItem.to_input_item has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 1 (4 pts) (nesting depth added 19). 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":"src/agents/items.py"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"3875dc4d42cdf1187704833556a91357587d629cde037df84c1bfe0e224731fc"}},{"ruleId":"D2","level":"warning","message":{"text":"run_state._serialize_pending_nested_agent_tool_runs (cognitive 26): run_state._serialize_pending_nested_agent_tool_runs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_state.py"},"region":{"startLine":2968}}}],"partialFingerprints":{"codehealthFindingId/v1":"f284a1f54af133f5498ce7f2a8d8a9b67f5373a530093003a1239eac317dac9a"}},{"ruleId":"D2","level":"warning","message":{"text":"tool._normalize_function_tool_callable (cognitive 26): tool._normalize_function_tool_callable has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12, boolean chains 7, ternaries 3 (5 pts), error handling 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/tool.py"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d4a7a9b66c13e8bb3b16688d4db7ebc52b574c598c59a74a6e63901e9b21eb"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamedAudioResult._dispatch_audio (cognitive 26): StreamedAudioResult._dispatch_audio has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 2 (3 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":"src/agents/voice/result.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7a55ef103ee1c214d6be5d52a581216e3136b7d513cbfc874ee80133359812"}},{"ruleId":"D2","level":"warning","message":{"text":"visualization._get_all_nodes (cognitive 25): visualization._get_all_nodes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, loops 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":"src/agents/extensions/visualization.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"049543b8fb5ceed6c4e1adeec05bf11ce57b4e680f4cf85337ab47f6fa84f172"}},{"ruleId":"D2","level":"warning","message":{"text":"_MCPServerWithClientSession.cleanup (cognitive 25): _MCPServerWithClientSession.cleanup has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), error handling 3, boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/mcp/server.py"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"979fdb5cede496ad6bbd7c2fd8aa513fb9fa0b19825453f6f65a7d60e403f226"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter._validate_named_function_tool_choice (cognitive 25): Converter._validate_named_function_tool_choice has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 10, loops 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":"src/agents/models/openai_responses.py"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e05440f7267438bca8adc828a1a6508c9d8d000475a68bfb53015c9a2bc0fd"}},{"ruleId":"D2","level":"warning","message":{"text":"RunContextWrapper._resolve_call_id (cognitive 25): RunContextWrapper._resolve_call_id has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, ternaries 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":"src/agents/run_context.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca41de9391aa9987660813226dc3fdadf3a48a9b00f3a14c0fe3d3bb308a8c0"}},{"ruleId":"D2","level":"warning","message":{"text":"RunContextWrapper._approval_records_for_key (cognitive 25): RunContextWrapper._approval_records_for_key has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 3 (7 pts), boolean chains 3 (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":"src/agents/run_context.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"8832c4a30d3f43f7f9764a7efbeb41425882fe6ece484abd17277a92177382ac"}},{"ruleId":"D2","level":"warning","message":{"text":"RunContextWrapper._restore_pending_approval_binding (cognitive 25): RunContextWrapper._restore_pending_approval_binding has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 9, loops 2 (3 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":"src/agents/run_context.py"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"8465b72df828cef8c22d4f786d20f9917354e219befe1eb1cb3bb72f12451c21"}},{"ruleId":"D2","level":"warning","message":{"text":"RunState._serialize_context_payload (cognitive 25): RunState._serialize_context_payload has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), error handling 4 (10 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_state.py"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acbce5eb1deeaaa7621a7f4ce6f089f51b635d5177cf788c197b78f65a31aa4"}},{"ruleId":"D2","level":"warning","message":{"text":"BackendSpanExporter._sanitize_json_compatible_value (cognitive 25): BackendSpanExporter._sanitize_json_compatible_value has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (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":"src/agents/tracing/processors.py"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"15db402ed8474e136d01bf0d862a47ea2d9f8ad947879580398b1f8e9150dbdf"}},{"ruleId":"D2","level":"warning","message":{"text":"review_protocol._review_state (cognitive 24): review_protocol._review_state has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/implementation-final-review/scripts/review_protocol.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfde4ed9f1f4dffe832d2a525f340f11763f746e0efac53711ad806eff225796"}},{"ruleId":"D2","level":"warning","message":{"text":"audio_formats.to_realtime_audio_format (cognitive 24): audio_formats.to_realtime_audio_format has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 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":"src/agents/realtime/audio_formats.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"493f127250f27069459b0ccb75681c93066a52114a223c057d321e16b4e06b27"}},{"ruleId":"D2","level":"warning","message":{"text":"_FunctionToolBatchExecutor._maybe_execute_tool_approval (cognitive 24): _FunctionToolBatchExecutor._maybe_execute_tool_approval has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 5 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"6605c80858ec4a1fd2e974e8cf777d1d15e254b523b79ba44272322a0668010d"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptedModel.stream_response (cognitive 24): ScriptedModel.stream_response has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 4 (8 pts), loops 3 (5 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":"src/agents/testing/model.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcece85aae93e1b99fc6e9ac212ccc2e5245bd80fe4a29194e7d23ea85a1827"}},{"ruleId":"D2","level":"warning","message":{"text":"review_state.review_state (cognitive 23): review_state.review_state has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, loops 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":".agents/skills/implementation-final-review/scripts/review_state.py"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c582c358d7fa83cc89492a2a176c0d20f6d73afe10ee02e251064a2873acb06"}},{"ruleId":"D2","level":"warning","message":{"text":"AdvancedSQLiteSession._extract_tool_name (cognitive 23): AdvancedSQLiteSession._extract_tool_name has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 1 (4 pts), boolean chains 3 (nesting depth added 13). 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":"src/agents/extensions/memory/advanced_sqlite_session.py"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e6c846a456f3dbae95460f0f2eda46832cc8b52fc6a3afac084a43a52a0e1d"}},{"ruleId":"D2","level":"warning","message":{"text":"blocked_output._current_response_boundary (cognitive 23): blocked_output._current_response_boundary has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, ternaries 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":"src/agents/run_internal/blocked_output.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c82c5b4d83c9e89b5f7c6daa2b9daff2fc71d6773d5a131106c7015b4921e57"}},{"ruleId":"D2","level":"warning","message":{"text":"guardrails.run_input_guardrails_with_queue (cognitive 23): guardrails.run_input_guardrails_with_queue has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (6 pts), boolean chains 2, error handling 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":"src/agents/run_internal/guardrails.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c540d5fab443c4b462240ce72c60571aeebc11749b172a5ec79a9ce29f76fbb"}},{"ruleId":"D2","level":"warning","message":{"text":"model._convert_output_items (cognitive 23): model._convert_output_items has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/testing/model.py"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a2e107aeaba173218b7e475a6154e351e56ece17d61c82f62c797b5026fd5b"}},{"ruleId":"D2","level":"warning","message":{"text":"apply_diff._advance_cursor_to_anchor (cognitive 22): apply_diff._advance_cursor_to_anchor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (5 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":"src/agents/apply_diff.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1f8810e3cf2da054780b57ed7a8281beab99cee2231c250bef9b4f345f60d4"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_tool.codex_tool (cognitive 22): codex_tool.codex_tool has cognitive complexity 22 (threshold 15). Drivers by points: if/else 21, boolean chains 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":"src/agents/extensions/experimental/codex/codex_tool.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acd4d9fc5ce6690ae6357c43d4ffb5e9ba0d59ef39d14c11202788369f1a5cf"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIHostedMultiAgentModel._prepare_websocket_request (cognitive 22): OpenAIHostedMultiAgentModel._prepare_websocket_request has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/experimental/hosted_multi_agent/model.py"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0c1734d5c814361379b67467903021c55b50343f467fd4f23f9a98ba49eaf0"}},{"ruleId":"D2","level":"warning","message":{"text":"DaprSession.get_items (cognitive 22): DaprSession.get_items has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 2 (5 pts), 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":"src/agents/extensions/memory/dapr_session.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e30d7f4e0d343413caf1c2b4ff0d2743cac9114366c2865a9d444e423162c99"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyLLMModel._get_response_via_chat (cognitive 22): AnyLLMModel._get_response_via_chat has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8, boolean chains 7, ternaries 5 (7 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"642ad5bec6f5de7c24d7f6db5fc12557bbb332e93126388f6be623815f5c8f98"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemHelpers.tool_call_output_item (cognitive 22): ItemHelpers.tool_call_output_item has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 3 (8 pts), 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":"src/agents/items.py"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"001f96c9db5924e53fd3f4816e724d76edcb4968213022809b6aa457f68d9d40"}},{"ruleId":"D2","level":"warning","message":{"text":"items.resolve_nested_history_owned_item_indexes (cognitive 22): items.resolve_nested_history_owned_item_indexes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (6 pts), boolean chains 3, loops 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":"src/agents/run_internal/items.py"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf4f51164b60d16411c7e4ef48908cd837b9e4b6abf681ef0580be7848d10de"}},{"ruleId":"D2","level":"warning","message":{"text":"_FunctionToolBatchExecutor._invoke_tool_and_run_post_invoke (cognitive 22): _FunctionToolBatchExecutor._invoke_tool_and_run_post_invoke has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 5 (6 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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":2079}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c61368193c652e347cd563e70d5b2d92c9ff13decb0f3737dfc3550f8cb269"}},{"ruleId":"D2","level":"warning","message":{"text":"_FunctionToolBatchExecutor._await_invoke_task (cognitive 22): _FunctionToolBatchExecutor._await_invoke_task has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, ternaries 1 (3 pts), error handling 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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1651abea344d37333ac8adf8f7d6007fce84d76e2eaa2447f6f6d1bb805352"}},{"ruleId":"D2","level":"warning","message":{"text":"sandbox._normalize_step (cognitive 22): sandbox._normalize_step has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11, boolean chains 5, ternaries 2 (4 pts), error handling 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/testing/sandbox.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e801cc084c1e1c20e30828fdcc3b4a0ca941a58cf323a9d16850fae4e2d244ed"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_handoff.validate (cognitive 21): validate_handoff.validate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2, ternaries 2, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".agents/skills/implementation-kickoff/scripts/validate_handoff.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb7de785a38543f31e80fc53479b73bc6d6ed1814ee756b0dcceef66acb1980"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_tool._validate_descriptor (cognitive 21): codex_tool._validate_descriptor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 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":"src/agents/extensions/experimental/codex/codex_tool.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fa6c20e816acc4d961d2c02df7911e84925e11598930a183fac9bec98baf14"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolOutputTrimmer.__call__ (cognitive 21): ToolOutputTrimmer.__call__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/tool_output_trimmer.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b009e54901404e14be2511eec234e95cacdb8587dcfbea118faa2e17d125df"}},{"ruleId":"D2","level":"warning","message":{"text":"_MCPServerWithClientSession.list_prompts (cognitive 21): _MCPServerWithClientSession.list_prompts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 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":"src/agents/mcp/server.py"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabef0d2e9b2f143bf85274897defc399856e9d5821e704de3d4d4754a1e3358"}},{"ruleId":"D2","level":"warning","message":{"text":"RealtimeSession._maybe_request_tool_approval (cognitive 21): RealtimeSession._maybe_request_tool_approval has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/session.py"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8a1aaf2ea9b026329a065d838d48ab2d2eba7b1402815316e0917e1ea56a4e"}},{"ruleId":"D2","level":"warning","message":{"text":"RunResultStreaming.stream_events (cognitive 21): RunResultStreaming.stream_events has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 1 (2 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":"src/agents/result.py"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f61d755216d50d7490533ff858ba379dd2767b5063a81d82e9536e1bb2353d6"}},{"ruleId":"D2","level":"warning","message":{"text":"SandboxRunConfig.__post_init__ (cognitive 21): SandboxRunConfig.__post_init__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 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":"src/agents/run_config.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a4944ad62270fd38d47519fd5f7195af9b3bd19969392634ed54e148e36cf4"}},{"ruleId":"D2","level":"warning","message":{"text":"session_persistence.resolve_nested_history_owned_session_item_refs (cognitive 21): session_persistence.resolve_nested_history_owned_session_item_refs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (4 pts), boolean chains 2, loops 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":"src/agents/run_internal/session_persistence.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"77380b253232d086d572e30c38565d31e30bf16a60d03cd3a68c72bef354b818"}},{"ruleId":"D2","level":"warning","message":{"text":"session_persistence.defer_interrupted_session_write (cognitive 21): session_persistence.defer_interrupted_session_write has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, ternaries 4, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/session_persistence.py"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"1505ca0c6e090a43ccaca1bac395169ea0e9847f61d2907c36a6c2ed197e37cd"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_execution.execute_approved_tools (cognitive 21): tool_execution.execute_approved_tools has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":2601}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0e36f1f3a0a1f168f61bf308affb3a3d5cd3e7271a4f37447702b5916c904f"}},{"ruleId":"D2","level":"warning","message":{"text":"RunState.add_input (cognitive 21): RunState.add_input has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, 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":"src/agents/run_state.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc6e489a48203e503db1d968475286de35a3762fb02f60783130c9620132aea"}},{"ruleId":"D2","level":"warning","message":{"text":"model._validate_model_step (cognitive 21): model._validate_model_step has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 9 (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":"src/agents/testing/model.py"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b2f7cf5b884351c5ddbee38904a79a410ae8e15151d05b9cc10d9e03d97c60"}},{"ruleId":"D2","level":"warning","message":{"text":"_tool_identity._format_tool_name_collision_message (cognitive 20): _tool_identity._format_tool_name_collision_message has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (7 pts), boolean chains 2, 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":"src/agents/_tool_identity.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffe08cbfa0eb5173f78b8b8c5dc16323aba36ff5a3ada418fca3df1e8daeead"}},{"ruleId":"D2","level":"warning","message":{"text":"exceptions._object_instance_dict (cognitive 20): exceptions._object_instance_dict has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 1 (4 pts), ternaries 1 (4 pts), loops 2 (3 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":"src/agents/exceptions.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3daf410e9205e282c89f17fd6c4425aa3866e28b58af5eab85128cb3940209ff"}},{"ruleId":"D2","level":"warning","message":{"text":"RedisSession._mutate_items (cognitive 20): RedisSession._mutate_items has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (19 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":"src/agents/extensions/memory/redis_session.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"59897545c7a9d9f03b1488f7c67fd7e2e67b8556620942362804d1ac81bb3493"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLAlchemySession._pop_item (cognitive 20): SQLAlchemySession._pop_item has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), error handling 1 (2 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":"src/agents/extensions/memory/sqlalchemy_session.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c8678617745b0773adb0322b5394f8ac793262493d90124f86c99ea4943025"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolOutputTrimmer._build_call_id_to_names (cognitive 20): ToolOutputTrimmer._build_call_id_to_names has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/tool_output_trimmer.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6b23ede2038a6086aa7b042686235dd9db6ab7d35d1ec180f6da8dffe1c386"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPServer._normalize_needs_approval (cognitive 20): MCPServer._normalize_needs_approval has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (6 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":"src/agents/mcp/server.py"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d95f4003d791e10ad1bb8cd201a6cef56e904551def2347bdf4dff5e17a0e95"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIChatCompletionsModel._validate_official_openai_input_content_types (cognitive 20): OpenAIChatCompletionsModel._validate_official_openai_input_content_types has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 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":"src/agents/models/openai_chatcompletions.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f1e60533c957bf205ee83abbe372b293e30c8e38dbd776bac3d920da59e76a"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIResponsesWSModel.get_retry_advice (cognitive 20): OpenAIResponsesWSModel.get_retry_advice has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5 (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":"src/agents/models/openai_responses.py"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"590f0323d34b5d581a8b50b7b96a1f693ee7aad48fa3a31985f07ed6da7e26c1"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIRealtimeWebSocketModel.close (cognitive 20): OpenAIRealtimeWebSocketModel.close has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 4 (8 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":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b056e2101629549618d634711cb5af3cae5250e80fee79c0226c4821f588b958"}},{"ruleId":"D2","level":"warning","message":{"text":"blocked_output._prepare_blocked_output_owner_plan (cognitive 20): blocked_output._prepare_blocked_output_owner_plan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 4 (7 pts), boolean chains 3 (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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/blocked_output.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"315354a03eaecd72dd07a4b96a42f8c59590fe346c8413afd880b992b2a3a7d1"}},{"ruleId":"D2","level":"warning","message":{"text":"session_persistence.rewind_session_items (cognitive 20): session_persistence.rewind_session_items has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, loops 2 (3 pts), error handling 2 (nesting depth added 2). 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":"src/agents/run_internal/session_persistence.py"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f916151526a52a7de84c3438f0a48737773bcfae48cb64ee35ce8af0cabc694"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_execution.coerce_shell_call (cognitive 20): tool_execution.coerce_shell_call has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, loops 2, 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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe5b3fc0b6be2001f8d0a4f94fcb052dcc6b3b30a6e15b0a4c9d85d90bbef15"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_execution.normalize_shell_output (cognitive 20): tool_execution.normalize_shell_output has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc80951fbfe846df82c6bd38ea366eaaedb6c60a67cc948c1ad87fd24f8c3c8"}},{"ruleId":"D2","level":"warning","message":{"text":"turn_resolution._completed_tool_step_items (cognitive 20): turn_resolution._completed_tool_step_items has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, 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":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed26ddbbded86ac561ba422b96310328fff664ef6db3bad182fc0bbc05306449"}},{"ruleId":"D2","level":"warning","message":{"text":"turn_resolution._collect_program_parent_state (cognitive 20): turn_resolution._collect_program_parent_state has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f314a362b96fdc45e7de470de71bfc061172d7f8fa799315a2d096f609d002a"}},{"ruleId":"D2","level":"warning","message":{"text":"BackendSpanExporter._sanitize_generation_usage_for_openai_tracing_api (cognitive 20): BackendSpanExporter._sanitize_generation_usage_for_openai_tracing_api has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 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":"src/agents/tracing/processors.py"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb37c7ded19152c34f568ea5cc45d47372f893a8534118ac175045ceaa4999fa"}},{"ruleId":"D2","level":"warning","message":{"text":"review_protocol._workspace_entries (cognitive 19): review_protocol._workspace_entries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, 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":".agents/skills/implementation-final-review/scripts/review_protocol.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"820505aa1b6eb6db82f4e8b5d502d06df0734cf4c947c5ec5b884eca416c9ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"_tool_identity.get_function_tool_approval_keys (cognitive 19): _tool_identity.get_function_tool_approval_keys has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7 (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":"src/agents/_tool_identity.py"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f3de3017ecc9a9fc7cbf772b9b91b03b2b5cb39036e4fb8a0ba40b40891b1c"}},{"ruleId":"D2","level":"warning","message":{"text":"events.coerce_thread_event (cognitive 19): events.coerce_thread_event has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, ternaries 5 (9 pts) (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":"src/agents/extensions/experimental/codex/events.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c206c92d994b6fc30a84da179cd184b0cdb3ea856a4275e26dded5376fe62709"}},{"ruleId":"D2","level":"warning","message":{"text":"Thread._run_streamed_internal (cognitive 19): Thread._run_streamed_internal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 3 (6 pts), boolean chains 2, 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":"src/agents/extensions/experimental/codex/thread.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea5700fd501e5b86da3b2c4f55f07c04eae6fad1efbe7f8f64c5e103e39b198"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyLLMModel._sanitize_any_llm_responses_value (cognitive 19): AnyLLMModel._sanitize_any_llm_responses_value has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2ae42df6bec7fdf7813c535dfca8a3e4d9a294521c10e30541a20636ab5b85"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelSettings.resolve (cognitive 19): ModelSettings.resolve has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (8 pts), 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":"src/agents/model_settings.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4eef45ae5ef0d0982ecad9af1061e5a87b40145e857b1e82ca5f90a3e8fc875"}},{"ruleId":"D2","level":"warning","message":{"text":"result._copy_pending_nested_agent_tool_states (cognitive 19): result._copy_pending_nested_agent_tool_states has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/result.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1fccb59e825caba44593bbf09f78b2be5945e1b329cd27464100b52d8d0d2c"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIServerConversationTracker.mark_input_as_sent (cognitive 19): OpenAIServerConversationTracker.mark_input_as_sent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/oai_conversation.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cf3f315abe7e79e5a476a95283a91bfe6db89596ad5fd1626551bab2b20376"}},{"ruleId":"D2","level":"warning","message":{"text":"session_persistence.held_session_items_for_save (cognitive 19): session_persistence.held_session_items_for_save has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (2 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":"src/agents/run_internal/session_persistence.py"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d8119fdec313adea9b4fae10cae8d8221f68e95c492b76a87fcad2ef56363a"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_execution.execute_computer_actions (cognitive 19): tool_execution.execute_computer_actions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), ternaries 1 (4 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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":2532}}}],"partialFingerprints":{"codehealthFindingId/v1":"9559c270096ef6e7b8abb8332f26a99bfc0d5557551453cda925435ee93eee7e"}},{"ruleId":"D2","level":"warning","message":{"text":"RunState._serialize_item (cognitive 19): RunState._serialize_item has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 5, error handling 1 (2 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":"src/agents/run_state.py"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"22dc32d551595cfdbbe894f19d6e0b0885df39d142cd937fdf3aae5bb6b5ee2c"}},{"ruleId":"D2","level":"warning","message":{"text":"run_state._copy_json_compatible_value (cognitive 19): run_state._copy_json_compatible_value has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 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":"src/agents/run_state.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"769818ed3fca9ac5614e79806ffe364cd56e67ed97161524b33bc24c212b2e48"}},{"ruleId":"D2","level":"warning","message":{"text":"tool.maybe_invoke_function_tool_failure_error_function (cognitive 19): tool.maybe_invoke_function_tool_failure_error_function has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 1 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/tool.py"},"region":{"startLine":2094}}}],"partialFingerprints":{"codehealthFindingId/v1":"07434b5d0191fa141bdef3ccaef7270845764a603684684bc27dc7fc71b03486"}},{"ruleId":"D2","level":"warning","message":{"text":"model._normalize_response (cognitive 18): model._normalize_response has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, 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":"src/agents/extensions/experimental/hosted_multi_agent/model.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c0a855e7ea9399031284f9777e8fe9b28c18855a5859250e56b91458d64a14"}},{"ruleId":"D2","level":"warning","message":{"text":"DaprSession.pop_item (cognitive 18): DaprSession.pop_item has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/memory/dapr_session.py"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5d0f541c9c426faa8c15bf013bca4503b762d665b84c5fb8abdf9b5d50ae3f"}},{"ruleId":"D2","level":"warning","message":{"text":"LitellmConverter.convert_message_to_openai (cognitive 18): LitellmConverter.convert_message_to_openai has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 1 (2 pts), ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cda4dc190ba98e5fef60192ff298866c73a54163bb0d102b619d6c904f0b739"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolOutputTrimmer._trim_structured_function_call_output (cognitive 18): ToolOutputTrimmer._trim_structured_function_call_output has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (5 pts), boolean chains 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":"src/agents/extensions/tool_output_trimmer.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"1836d412167417a073800996fd8c5150b9888f2e2a2bdc3c5c7437f8807d9d21"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolApprovalItem.__post_init__ (cognitive 18): ToolApprovalItem.__post_init__ has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, 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":"src/agents/items.py"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c423e3508fd66f8cbbb70d60337daf13d2eb675f8606143b4d43866a7385e2"}},{"ruleId":"D2","level":"warning","message":{"text":"items.extract_mcp_request_id (cognitive 18): items.extract_mcp_request_id has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 3, ternaries 2 (3 pts), boolean chains 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":"src/agents/run_internal/items.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9c962b049a7bbbb93b7772d5bf87df7610fd6f8217db2cf2678b495fcf2cae"}},{"ruleId":"D2","level":"warning","message":{"text":"items.extract_mcp_request_id_from_run (cognitive 18): items.extract_mcp_request_id_from_run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, error handling 1, 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":"src/agents/run_internal/items.py"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a00429e27cc5ca29d92f1180b1e0329c527edc8bdcf7f19ddb7dc683789244"}},{"ruleId":"D2","level":"warning","message":{"text":"session_persistence._held_items_safe_to_settle (cognitive 18): session_persistence._held_items_safe_to_settle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/session_persistence.py"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f489f0323d9198f64b463feab9485bdbfbf502605612d99f49cb7789b4cd9b09"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_planning._collect_tool_interruptions (cognitive 18): tool_planning._collect_tool_interruptions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4, 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":"src/agents/run_internal/tool_planning.py"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"04341b98071e336643de4328e1cad6f5cfe668cabf881f45efc0a3b8753fa239"}},{"ruleId":"D2","level":"warning","message":{"text":"strict_schema._json_values_equal (cognitive 18): strict_schema._json_values_equal has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (9 pts) (nesting depth added 2). 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":"src/agents/strict_schema.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2e5b572878c6c8ba92ae8d6d856d2c9bef4c53b49eb14bcc5aee61e8736bac"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchTraceProcessor._export_batches (cognitive 18): BatchTraceProcessor._export_batches has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 2 (5 pts), boolean chains 3, loops 2 (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":"src/agents/tracing/processors.py"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65d5e705cd32d39c33bbf94100d753c18bc3c20981b724ca5a5464f280f06c0"}},{"ruleId":"D2","level":"warning","message":{"text":"validate_handoff.hidden_index_paths (cognitive 17): validate_handoff.hidden_index_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 2 (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":".agents/skills/implementation-kickoff/scripts/validate_handoff.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"972f3e6f2ba90e88affe86f02b59186388e07fc24e170d43bb904eaaa6e0c33b"}},{"ruleId":"D2","level":"warning","message":{"text":"_function_tool_arguments._is_data_only_schema (cognitive 17): _function_tool_arguments._is_data_only_schema has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 2). 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":"src/agents/_function_tool_arguments.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a21830bd9a9be479870746aa36499b48d67b2dadc5e9e8ba0e9f84355d06b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"agent_tool_input.resolve_agent_tool_input (cognitive 17): agent_tool_input.resolve_agent_tool_input has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 3 (6 pts), boolean chains 5 (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":"src/agents/agent_tool_input.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0334458d2c77fd311964bb0e0f3798834280fe6fc93efb717bf0cb71d31e76db"}},{"ruleId":"D2","level":"warning","message":{"text":"agent_tool_input._describe_json_schema_field (cognitive 17): agent_tool_input._describe_json_schema_field has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 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":"src/agents/agent_tool_input.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea1c6f098d527d20649be4980754a30e88ceac11c432c858c5b103b159f2cf4"}},{"ruleId":"D2","level":"warning","message":{"text":"codex_tool._validate_run_context_thread_id_context (cognitive 17): codex_tool._validate_run_context_thread_id_context has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, ternaries 1 (2 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":"src/agents/extensions/experimental/codex/codex_tool.py"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90c8f5d0eb36ae7584b79d7af3ac7b23b61077de39999b02896bd48e20b618c"}},{"ruleId":"D2","level":"warning","message":{"text":"AsyncSQLiteSession.close (cognitive 17): AsyncSQLiteSession.close has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/memory/async_sqlite_session.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b18212dec1371fbbd90bafef3dde70c91a54ed532ee3b1d30e54f448d5e43e"}},{"ruleId":"D2","level":"warning","message":{"text":"visualization._get_all_edges (cognitive 17): visualization._get_all_edges has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3, boolean chains 1 (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":"src/agents/extensions/visualization.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13af5ff1daed368ab8e5da8bbdd76dbd0d31e781f4328f9b708d56678808534"}},{"ruleId":"D2","level":"warning","message":{"text":"handoffs.handoff (cognitive 17): handoffs.handoff has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, ternaries 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":"src/agents/handoffs/__init__.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb4a2d10a6f8ba847fd759454f732f118b938cfab5ce084c5a70dcda3e81ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPServerManager._connect_all (cognitive 17): MCPServerManager._connect_all has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (2 pts), 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":"src/agents/mcp/manager.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b03686cbf6ada64762be345ccede6aca126b624d8fc38cdab59b9ef41a5140"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIRealtimeWebSocketModel.connect (cognitive 17): OpenAIRealtimeWebSocketModel.connect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), error handling 3 (4 pts), boolean chains 2 (nesting depth added 2). 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":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2c2abad97f4454c24ce8a59c8948ef75568caf84d3512b66738ef5c5385734"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIRealtimeWebSocketModel._send_interrupt (cognitive 17): OpenAIRealtimeWebSocketModel._send_interrupt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, error handling 1 (3 pts) (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":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cc5c338b52f808472b2ef5915fbec39cdf5298c09bc8a1b5ce6385de4530ab"}},{"ruleId":"D2","level":"warning","message":{"text":"error_handlers.validate_handler_final_output (cognitive 17): error_handlers.validate_handler_final_output has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 2 (4 pts), boolean chains 3, error handling 3 (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":"src/agents/run_internal/error_handlers.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"845a14f3cdc26cd29dbe7d84391460e979a7ee3bd4dc8b730e9acab8cdee96af"}},{"ruleId":"D2","level":"warning","message":{"text":"items._drop_reasoning_items_preceding_dropped_calls (cognitive 17): items._drop_reasoning_items_preceding_dropped_calls 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":"src/agents/run_internal/items.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f0e95b095082ad9f46c307ff94f31299fa49aebfac3a80dfa51736bcc2c739"}},{"ruleId":"D2","level":"warning","message":{"text":"items.filter_nested_history_owned_item_refs_for_input (cognitive 17): items.filter_nested_history_owned_item_refs_for_input has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2, ternaries 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":"src/agents/run_internal/items.py"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f4d66ccb047322ee07b8c02d373bf7197fd3b0a8d0c60423a18e0b3c6af929"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_execution.render_shell_outputs (cognitive 17): tool_execution.render_shell_outputs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a68e74e1dbc673e745b3e7962aa152dbeaf764e038bb9e0366355fd1f9c330f"}},{"ruleId":"D2","level":"warning","message":{"text":"input._buffer_to_audio_file (cognitive 17): input._buffer_to_audio_file has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (17 pts) (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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/voice/input.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d27785a7b1949f923b15267b1c5eff2d1da3db15e33c35e2457e60d7b4e25db"}},{"ruleId":"D2","level":"warning","message":{"text":"python_probe.summarize_results (cognitive 16): python_probe.summarize_results has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), ternaries 3 (6 pts), boolean chains 2, loops 2 (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":".agents/skills/runtime-behavior-probe/templates/python_probe.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"84244630c2b8a53f38448f697ba88454843406f2881e65752d0615afc024d94b"}},{"ruleId":"D2","level":"warning","message":{"text":"check_optional_truthiness._walk_scope_bindings (cognitive 16): check_optional_truthiness._walk_scope_bindings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), 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":".github/scripts/check_optional_truthiness.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e522609c85f5045731909237c112de046daae4da84b2c6cd2ddb992ea2d7d57f"}},{"ruleId":"D2","level":"warning","message":{"text":"_config_coercion.coerce_pydantic_config (cognitive 16): _config_coercion.coerce_pydantic_config has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (2 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":"src/agents/_config_coercion.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"941f54e6f3d0808a77e65e59ffef7678ce50dbbb2b8951a31e788f534b174abc"}},{"ruleId":"D2","level":"warning","message":{"text":"_tool_invocation.tool_invocation_approval_scope (cognitive 16): _tool_invocation.tool_invocation_approval_scope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, ternaries 1 (2 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":"src/agents/_tool_invocation.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de6c14fc723a7380f41fcfd12a369313106b261ec25ab0ef73d999a8fc4f38e"}},{"ruleId":"D2","level":"warning","message":{"text":"apply_diff._parse_update_diff (cognitive 16): apply_diff._parse_update_diff has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (5 pts), ternaries 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":"src/agents/apply_diff.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a058a7a42cd04164dfaaef44b6b315c96fa89506c3aa62f4c0abba0b934031"}},{"ruleId":"D2","level":"warning","message":{"text":"AsyncSQLiteSession._write_connection (cognitive 16): AsyncSQLiteSession._write_connection has cognitive complexity 16 (threshold 15). Drivers by points: error handling 4 (8 pts), if/else 4 (8 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":"src/agents/extensions/memory/async_sqlite_session.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c2f81626d2e298f6e3199fd49ec22c76a026865dafd06be4b603431cb2838f"}},{"ruleId":"D2","level":"warning","message":{"text":"DaprSession.add_items (cognitive 16): DaprSession.add_items has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 2 (4 pts), loops 2, ternaries 1 (2 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":"src/agents/extensions/memory/dapr_session.py"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb2190db78a301fb8533d638cc54405366491af56c7d457f8ccfce48f72ecc2"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemHelpers._convert_single_tool_output_pydantic_model (cognitive 16): ItemHelpers._convert_single_tool_output_pydantic_model has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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":"src/agents/items.py"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e92b8aaf2857fff32032aaf65c872812daefab8c0fd1997762e5cc3fa1b2f92"}},{"ruleId":"D2","level":"warning","message":{"text":"handoffs.realtime_handoff (cognitive 16): handoffs.realtime_handoff has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, 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":"src/agents/realtime/handoffs.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cdeacc7c46a690ea3a7196b048d0d23c0e807e34a550268e8034707da398c1"}},{"ruleId":"D2","level":"warning","message":{"text":"RealtimeSession.__aiter__ (cognitive 16): RealtimeSession.__aiter__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, 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":"src/agents/realtime/session.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40a5660cc4198b9be7741605e95bc57221f4a4dc997290b910617afdde647df"}},{"ruleId":"D2","level":"warning","message":{"text":"RealtimeSession._resolve_tool_dispatch_role (cognitive 16): RealtimeSession._resolve_tool_dispatch_role has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, ternaries 2 (4 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":"src/agents/realtime/session.py"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f445a6e8c7235db86534260920ccd17a4c979e304e241b28128a3c4e0bb2c25"}},{"ruleId":"D2","level":"warning","message":{"text":"_asyncio_progress._get_self_progress_deadline_for_future (cognitive 16): _asyncio_progress._get_self_progress_deadline_for_future has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 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":"src/agents/run_internal/_asyncio_progress.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0e6601682a376bc9db01982a5e1d69e363a40a7d08e98dd3e82f3aa4a46890"}},{"ruleId":"D2","level":"warning","message":{"text":"blocked_output._prepare_blocked_output_snapshot (cognitive 16): blocked_output._prepare_blocked_output_snapshot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, 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":"src/agents/run_internal/blocked_output.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"deaa4d09d06fd4584c81cf46af692be3e86e3ffd955a60c54856b4993b1186b4"}},{"ruleId":"D2","level":"warning","message":{"text":"guardrails.run_input_guardrails (cognitive 16): guardrails.run_input_guardrails has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (6 pts), error handling 1 (nesting depth added 8). 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":"src/agents/run_internal/guardrails.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efe28d4881e90fc44646e68d81e00e8adb04974b5dabf53d4e4afdccaac4004"}},{"ruleId":"D2","level":"warning","message":{"text":"items.rebase_nested_history_owned_item_refs (cognitive 16): items.rebase_nested_history_owned_item_refs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 3 (6 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/items.py"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"41916e4d1cde4806538cd06639f657bb87b44f49be8058ff8b9b9ed8006d5b6f"}},{"ruleId":"D2","level":"warning","message":{"text":"model_retry._normalize_retry_error (cognitive 16): model_retry._normalize_retry_error has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/model_retry.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82e8200d0daf3985a7750440df83eae33db1e50b67d30aeb9d60435be8edfb6"}},{"ruleId":"D2","level":"warning","message":{"text":"run_loop._safe_redacted_persistence_error (cognitive 16): run_loop._safe_redacted_persistence_error has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a76412367ce49cbb43f348cf42d8b40bb9149b31dc3cc505abeaf4b0adee87"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_execution.normalize_shell_output_entries (cognitive 16): tool_execution.normalize_shell_output_entries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), ternaries 1 (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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3eec26143f110750e32361792fd833801b807810f5a4b5eb0cd4e1068dd2404"}},{"ruleId":"D2","level":"warning","message":{"text":"run_state._deserialize_processed_response (cognitive 16): run_state._deserialize_processed_response has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 2, loops 2, ternaries 1 (2 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":"src/agents/run_state.py"},"region":{"startLine":3241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df92786124d414ab70ae38cfbc10a4bdd5bd9062cc253519d238322e77172e6"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAISTTTranscriptionSession._check_errors (cognitive 16): OpenAISTTTranscriptionSession._check_errors has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 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":"src/agents/voice/models/openai_stt.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de26fcc059ddd03d531377b809935940821190a372f63a9d9bad7c1f3cebad1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/run_state.py: FileTooLong \u2014 4269 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3769 over it, 8.54\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":"src/agents/run_state.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf884cc7831a774b740f0ac2695235fe0685ee5eea8d22973fd4fcc8221e86f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run_internal/turn_resolution.py: FileTooLong \u2014 3367 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2867 over it, 6.73\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":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a86b3a47270d2ec9d099db164b182ae5249951a48d85917cba1a7ba1392102"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run_internal/run_loop.py: FileTooLong \u2014 2422 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1922 over it, 4.84\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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f08ce9d03990007c8e335b460771cefa989c26b206bc3396253bae6d51c48f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run_internal/tool_execution.py: FileTooLong \u2014 2251 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1751 over it, 4.50\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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb25345f49fa6fac7c31a081cbf3ee91ed23f803a87a50597403cd696ef8083"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/run.py: FileTooLong \u2014 2220 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1720 over it, 4.44\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":"src/agents/run.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff2caf737eab90a72ac4a19bd95d9fc2fd235a351d23f74281c05ebfa060b98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/tool.py: FileTooLong \u2014 1880 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1380 over it, 3.76\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":"src/agents/tool.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"703483754a9c24b1d39cb954ba1067d0e74ee3f5eee66acb72f88a6158fcc5d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/openai_responses.py: FileTooLong \u2014 1846 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1346 over it, 3.69\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":"src/agents/models/openai_responses.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"823626de3bf8ce751e59756955f7667a0e30aa849d52e41a6e80c1caccdc38d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/server.py: FileTooLong \u2014 1813 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1313 over it, 3.63\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":"src/agents/mcp/server.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9a6b210ba1ab7304928753b6bb548e095a5d66c42731607cc808d42dbbca77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: realtime/openai_realtime.py: FileTooLong \u2014 1685 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1185 over it, 3.37\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":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0eb88b9cf293f64fe579f05bd639e6afa48f9b6dd098bddf61e693f9d048c00"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: realtime/session.py: FileTooLong \u2014 1673 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1173 over it, 3.35\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":"src/agents/realtime/session.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac9657bd95faad1a8c2f117df9fb0fd8c06d34f885e68484b73ef06f489276d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run_internal/session_persistence.py: FileTooLong \u2014 1468 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 968 over it, 2.94\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":"src/agents/run_internal/session_persistence.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14bec97c70d0c91f573698e14882538746d27dfbfc0f0a80b4b108553bd2c0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/run_context.py: FileTooLong \u2014 1395 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 895 over it, 2.79\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":"src/agents/run_context.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc962327b8a4d45d128e879ad366bb5b4e9037432ceb2416dc2fd5cf93cfc807"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/any_llm_model.py: FileTooLong \u2014 1295 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 795 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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1107074066e84817f1de64fa68ba2709c2aea7b32c33e7687b6015c06974042b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: codex/codex_tool.py: FileTooLong \u2014 1151 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 651 over it, 2.30\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":"src/agents/extensions/experimental/codex/codex_tool.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53729473c83f636e3e3b088600865194fcd7662049321f503b6978565a441a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/review_protocol.py: FileTooLong \u2014 1148 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 648 over it, 2.30\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":".agents/skills/implementation-final-review/scripts/review_protocol.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f3298cb439ea12280f3b4d550c994ee16929e5327be76edced823f42d0d7c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run_internal/tool_planning.py: FileTooLong \u2014 1022 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 522 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":"src/agents/run_internal/tool_planning.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f091dce307394c622b66f926d606eda6ddd641d44f5315e6d0ebdca9acd860ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/chatcmpl_stream_handler.py: FileTooLong \u2014 1003 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 503 over it, 2.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":"src/agents/models/chatcmpl_stream_handler.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9caadd620ce7f4aafa60d3f8c232b6b27cd794c36b4dc1cdddee620324c7fc53"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: testing/model.py: FileTooLong \u2014 967 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 467 over it, 1.93\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":"src/agents/testing/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3622f9229a28cc90b92cdce06d65e860ce880a679bce04a6a06c09c4ec47f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run_internal/items.py: FileTooLong \u2014 884 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 384 over it, 1.77\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":"src/agents/run_internal/items.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbf41a547fe6b7a8331af0a024e4864a7095a2f4f3c0c05582d403a2e15d82a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OpenAIRealtimeWebSocketModel: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\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":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d01e79c37aae9e5414c0b11b7ea6edab31aa53a2493af7c2637214cdf72bd02"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RealtimeSession: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\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":"src/agents/realtime/session.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7073e75a1e2039b627c44aa687b67497c13dc48c3ccf5a7608a863d5c273a2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run_internal/tool_actions.py: FileTooLong \u2014 853 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 353 over it, 1.71\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":"src/agents/run_internal/tool_actions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfbfd938449ae5eba3f453795ed0df92ca214b40aafdd1f94f5c6c6421daeea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/result.py: FileTooLong \u2014 847 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 347 over it, 1.69\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":"src/agents/result.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb45a785aecd22087eaf6c9b84fc6ee8712909a8c081c435c8c7543b3ba58f88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: memory/advanced_sqlite_session.py: FileTooLong \u2014 829 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 329 over it, 1.66\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":"src/agents/extensions/memory/advanced_sqlite_session.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f911ab9dd4e011464303f30dd8cbdd0e641569afa6aef3cbe8c7de57fb5f8410"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hosted_multi_agent/model.py: FileTooLong \u2014 805 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 305 over it, 1.61\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":"src/agents/extensions/experimental/hosted_multi_agent/model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"954213dfe883a6fa52fc350505ddc8f75a8f6e191cfd0cf474f0cefd9d9a44c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/chatcmpl_converter.py: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 284 over it, 1.57\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":"src/agents/models/chatcmpl_converter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0d250e7070abec6c3f9e4c955f9cc1c0be23e59d23d6a2f83530934a241aaa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/agent.py: FileTooLong \u2014 780 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 280 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":"src/agents/agent.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38305571c9fa20d3494f5498e550f6c285bf41ed5258950632fba3ef02563a82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/litellm_model.py: FileTooLong \u2014 743 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 243 over it, 1.49\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":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7824d5a545e254bfb387d251fed7c6951ebd452225c422c8a770f3c45b3846"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AnyLLMModel: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e73d6627daca7ceef613cce414e89e621735213339b8c01003b5f3a8e9028fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AdvancedSQLiteSession: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\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":"src/agents/extensions/memory/advanced_sqlite_session.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"286b940fb35e3ab4418aab65e49475563d5e2225d0caaaa9eccc80682c3dc8f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run_internal/model_retry.py: FileTooLong \u2014 706 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 206 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":"src/agents/run_internal/model_retry.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fad70004a01c66ac63df62998225d4fa54911d4ac87154464385064aec52408"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: memory/openai_responses_compaction_session.py: FileTooLong \u2014 693 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 193 over it, 1.39\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":"src/agents/memory/openai_responses_compaction_session.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee5f250f55c2c86d1344ef19d0053a4d718611db3ea93567b621bcc8c6a7964"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run_internal/blocked_output.py: FileTooLong \u2014 683 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 183 over it, 1.37\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":"src/agents/run_internal/blocked_output.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0490cd4eab82520e430e70a1efcf79ca91a7875a92cce6926e6825a5acb153a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/items.py: FileTooLong \u2014 663 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 163 over it, 1.33\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":"src/agents/items.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6004b835785d494827c9c08e226606971c1d87455f185597e498657cbae05d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tracing/processors.py: FileTooLong \u2014 660 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 160 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":"src/agents/tracing/processors.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3f30785714a4761327e13c3337371efb326e9096e2f6c3c36890e08028acec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/util.py: FileTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 113 over it, 1.23\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":"src/agents/mcp/util.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5d168184c4271a9d2d6d33ea62ddf84b774cae951bce6d032989ba2333b6b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/openai_chatcompletions.py: FileTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 110 over it, 1.22\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":"src/agents/models/openai_chatcompletions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcfaea04dd5d69fcf76a20cde623b1252445b89f5f4e0288c5167b08833b534"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/review_state.py: FileTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 87 over it, 1.17\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":".agents/skills/implementation-final-review/scripts/review_state.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"602a02095fabde6a2937ebc6deaba23fc7fa260b24428cc55b145f2a86f85e95"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/openai_stt.py: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 33 over it, 1.07\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":"src/agents/voice/models/openai_stt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2ef4d3c6ebe45670497f3031101abfc9de6aed7a510c483cdf4ebb6231a5a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run_internal/oai_conversation.py: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 25 over it, 1.05\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":"src/agents/run_internal/oai_conversation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df5b77791d6522e9aff49125048e1c7a5dbc17e33c7160e5a8ead9a02695ddd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: run_internal/agent_runner_helpers.py: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 8 over it, 1.02\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":"src/agents/run_internal/agent_runner_helpers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79387a6736257cb04c0e36187561fa4f8a0f9d38b0a39d7943433213a9b19bdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (49 shared lines): src/agents/run_internal/tool_actions.py:482-687 | src/agents/run_internal/tool_actions.py:921-1113 \u2014 These two members are variants of one another: 49 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":"src/agents/run_internal/tool_actions.py"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dedf6e0ed8dff9490a09cc2bd1bfc89b43ab2baf3fe9da64b4dcc6291d701f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): src/agents/run_context.py:1099-1178 | src/agents/run_context.py:1379-1577 \u2014 These two members are one piece of code written twice and then edited apart: 56 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":"src/agents/run_context.py"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b84f700b5118d8a01f8fcdc846f086992850fc1bb062ae75beadac8a503b2c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/agents/run.py:296-383 | src/agents/run.py:401-486 \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":"src/agents/run.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3ee73fa289f63e9c896b1d170d4483216679652734431c1bf58c5e5cffe2ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/agents/mcp/server.py:1989-2070 | src/agents/mcp/server.py:2139-2214 | src/agents/mcp/server.py:2317-2399 | src/agents/run.py:2625-2919 \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":"src/agents/mcp/server.py"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fbd6519bda3ccd721b10f8c02d94b362ef40c90dc1ebe7641940ad9bbc4a11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (124 corresponding lines): src/agents/extensions/models/any_llm_model.py:596-719 | src/agents/models/openai_chatcompletions.py:229-390 \u2014 These two members are one piece of code written twice and then edited apart: 124 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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"89beb8a42ae6279a2c39957dca8d83a0ac497dc33950f438cc6d0d7d88aaab2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (91 corresponding lines): src/agents/extensions/models/any_llm_model.py:1504-1594 | src/agents/extensions/models/litellm_model.py:750-871 \u2014 These two members are one piece of code written twice and then edited apart: 91 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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc254eae66ef527b87dffca91528f4a763ffad9ec6110432b121a3023bf810b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): src/agents/extensions/memory/async_sqlite_session.py:356-426 | src/agents/memory/sqlite_session.py:368-445 \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":"src/agents/extensions/memory/async_sqlite_session.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"62afa3a14434e79717f812e2214e8a323a2b0d438f3f5bf2377fda8c94794f69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (92 corresponding lines): src/agents/handoffs/__init__.py:296-407 | src/agents/realtime/handoffs.py:117-208 \u2014 These two members are one piece of code written twice and then edited apart: 92 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":"src/agents/handoffs/__init__.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd76b7e137f1796f0fd362651894cb3b73572ccbd2a4b291f7b00f4e4e77048d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): src/agents/run_internal/items.py:611-670 | src/agents/run_internal/items.py:678-718 \u2014 These two members are one piece of code written twice and then edited apart: 41 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":"src/agents/run_internal/items.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a47b746579eaee2e37d4f686a862cd6df39bc035822c22f721cc6ed3537bbc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (76 corresponding lines): src/agents/extensions/models/any_llm_model.py:733-808 | src/agents/models/openai_chatcompletions.py:440-533 \u2014 These two members are one piece of code written twice and then edited apart: 76 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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b556d673e64a1b6d34634b3633d7489038638b2ca6787aef63683ddb773150"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 72\u002B corresponding lines): src/agents/extensions/memory/advanced_sqlite_session.py:427-507 | src/agents/extensions/memory/async_sqlite_session.py:249-321 | src/agents/memory/sqlite_session.py:287-358 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 72 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":"src/agents/extensions/memory/advanced_sqlite_session.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba662f355a46ae1d47bf25dc55255e4904d3e9c230f243680529707d597fc2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/agents/handoffs/history.py:280-318 | src/agents/run_state.py:1578-1610 \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":"src/agents/handoffs/history.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c16022ba20cfbf532f7db4e79869f9980630960db2631d8278e42fe245443b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): src/agents/run_internal/guardrails.py:143-193 | src/agents/run_internal/guardrails.py:203-249 \u2014 These two members are one piece of code written twice and then edited apart: 47 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":"src/agents/run_internal/guardrails.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7335cee7163314bf2caaea2d82a47bb99488e0b5c8144d2bb42dce8b8b70d9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/agents/realtime/openai_realtime.py:500-532 | src/agents/realtime/session.py:2122-2160 \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":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd76e5eb6d48e7bdfd2479b0b624d90859e1c6d14680bf547fd881aa627b255"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): src/agents/realtime/session.py:955-1004 | src/agents/run_internal/tool_execution.py:1248-1303 \u2014 These two members are one piece of code written twice and then edited apart: 50 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":"src/agents/realtime/session.py"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4dfa5da332563c5d87926bcfbf79074be164a83210cd79d1c8969abffe41c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/agents/run_internal/items.py:945-972 | src/agents/run_internal/items.py:976-998 \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":"src/agents/run_internal/items.py"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb0198dad42f099cdd5901b836818f1329e437bc8246008c368fcaab9c3f233"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/agents/tracing/processors.py:525-553 | src/agents/tracing/processors.py:556-582 \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":"src/agents/tracing/processors.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"4817e2f92a9c68d1601bc4dd8d5373257f7a513c8ab99d95c0d44bb2ea443004"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/agents/extensions/experimental/hosted_multi_agent/model.py:940-973 | src/agents/models/openai_responses.py:1313-1353 \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":"src/agents/extensions/experimental/hosted_multi_agent/model.py"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d242a5546d1b3a3feb34b38a9de15cc11845d91b24390d003e3fc4b69f9cf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/agents/run_internal/error_handlers.py:145-167 | src/agents/run_internal/error_handlers.py:176-205 \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":"src/agents/run_internal/error_handlers.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf90b751478633f269a0741f10a07bb20a93249f5927e100239b75e21910d746"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/agents/exceptions.py:98-124 | src/agents/sandbox/_mount_security.py:1095-1128 \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":"src/agents/exceptions.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd59e95dd5ea6c2a892682f4a5d1ffb03d5a93e8d0fdf072cda16a4824c9d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/agents/models/openai_provider.py:139-178 | src/agents/voice/models/openai_model_provider.py:83-112 \u2014 These two members are one piece of code written twice and then edited apart: 30 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":"src/agents/models/openai_provider.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aabf127bb5ab486bef526c3796ce783f82de28dc93b902130744f3c0233dbca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/agents/util/_pretty_print.py:35-47 | src/agents/util/_pretty_print.py:65-79 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"src/agents/util/_pretty_print.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ac511de8def90a54a8e445590bc7036bb141ee00631b14c4eb710d092c7018"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/agents/_config_coercion.py:51-66 | src/agents/model_settings.py:318-334 \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":"src/agents/_config_coercion.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f48ba612c136dc781ed3c497c34b635d1eb83acfb03ce206e79153b3ef2776"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/agents/extensions/memory/async_sqlite_session.py:154-168 | src/agents/memory/sqlite_session.py:211-222 \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":"src/agents/extensions/memory/async_sqlite_session.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8647f03dd99a4e92eed6bd96ad58aeb0a51d371605bc6599e74cfef08cee6ea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/agents/realtime/_tool_filtering.py:18-33 | src/agents/run_internal/tool_execution.py:577-595 \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":"src/agents/realtime/_tool_filtering.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cadb35a7155c139aeaeb51858da649f4c7efd61be336c46799ad70b52df929"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/agents/run_internal/items.py:1007-1020 | src/agents/run_internal/items.py:1028-1046 \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":"src/agents/run_internal/items.py"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46959c9ef929ca5cb4e9ee8a7fe4ab257eb6a55a3936cd049716af64b6ab7e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/agents/run_state.py:4118-4137 | src/agents/run_state.py:4143-4162 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"src/agents/run_state.py"},"region":{"startLine":4118}}}],"partialFingerprints":{"codehealthFindingId/v1":"32043a4f29bdf5e7f16b3524f9c1471d51df3fa36c5fafbbb73c7812c64eedd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/agents/memory/session.py:22-53 | src/agents/sandbox/util/blocking_io.py:22-40 \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":"src/agents/memory/session.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9364c07ee6d75c38ccf3cd52aad587364f09dc5893337055d713ba6a1cc0bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/agents/mcp/manager.py:479-500 | src/agents/mcp/manager.py:582-605 \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":"src/agents/mcp/manager.py"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32aa58df74aa932470a296c541436f4e1300629ddccb81ee15b8b8730852cc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): docs/scripts/translate_docs.py:470-479 | docs/scripts/translate_docs.py:568-577 \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":"docs/scripts/translate_docs.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac904e95a5f0a1375d1b17e0664c01f98ea4402e19f33900b0c3ce78cf1bbade"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/agents/extensions/memory/dapr_session.py:85-119 | src/agents/extensions/memory/redis_session.py:372-406 \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":"src/agents/extensions/memory/dapr_session.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad50e30df702a054b6733e87866ae9adad7ba920215c5172edda75c3ff8b442"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/agents/memory/openai_responses_compaction_session.py:774-793 | src/agents/memory/openai_responses_compaction_session.py:796-813 \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":"src/agents/memory/openai_responses_compaction_session.py"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acbc0e98e25633a8a3adbb3d9e92d9e6f723cc6c040d6b1400c701f1e563914"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/agents/run_internal/tool_execution.py:2801-2825 | src/agents/run_internal/tool_execution.py:2836-2865 \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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b622246de73062846d9db1aebdd60a9ec2f98887a3560bdddab06e4dca8b34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/agents/extensions/memory/async_sqlite_session.py:326-348 | src/agents/memory/sqlite_session.py:262-284 \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":"src/agents/extensions/memory/async_sqlite_session.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"696bf824dd2ea3b81c1f48b5fe3548d3889377c85780d7c7e7130fc9adf1b519"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/agents/mcp/server.py:1768-1786 | src/agents/mcp/server.py:1791-1811 \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":"src/agents/mcp/server.py"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55a2e01bc644fad0c90fba99b8d14f3a6c136c8d88f34c381ff1a47bf4c7f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/agents/extensions/experimental/codex/codex_options.py:27-37 | src/agents/extensions/experimental/codex/thread_options.py:42-52 | src/agents/extensions/experimental/codex/turn_options.py:26-36 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/experimental/codex/codex_options.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"daef62df618877c443f7be0604d1400c8a78d9bfbaab00c6017ad69311330e13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/agents/extensions/memory/mongodb_session.py:370-406 | src/agents/extensions/memory/mongodb_session.py:530-565 \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":"src/agents/extensions/memory/mongodb_session.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b7c454a671d4ee635507a7e1f6392271256e21bcc807e62baf279b978b416b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): src/agents/run_internal/tool_execution.py:2418-2436 | src/agents/run_internal/tool_execution.py:2449-2467 | src/agents/run_internal/tool_execution.py:2480-2498 | src/agents/run_internal/tool_execution.py:2511-2529 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":2418}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b50a39a011de8ab9b567aa48b881dcf91cac92e5deb5bfc290a1763c9f72fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): src/agents/agent_tool_state.py:213-230 | src/agents/agent_tool_state.py:238-252 | src/agents/agent_tool_state.py:260-276 \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":"src/agents/agent_tool_state.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"12942dabcdea8a1ad66872f0522514527e5e13aacde7dd45b98c7a3d4600418d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/agents/guardrail.py:117-130 | src/agents/guardrail.py:168-185 \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":"src/agents/guardrail.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"159d1af3ee4ec02ba7a3f4d0ec4fe2dfc4d29508a5d381f401ff7d506add8125"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): src/agents/realtime/openai_realtime.py:676-702 | src/agents/realtime/testing.py:420-434 | src/agents/realtime/testing.py:438-452 \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":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a66405cb70a919236442a7b9d2760d1902dda461e8b76e21543137b4d16d03c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/agents/extensions/memory/async_sqlite_session.py:494-505 | src/agents/memory/sqlite_session.py:522-536 \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":"src/agents/extensions/memory/async_sqlite_session.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"9995ccaea0a4dba886e545993d4d2dfc49b2dc104c9d1ac5cb30ed465d462bd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/agents/voice/input.py:103-112 | src/agents/voice/models/openai_stt.py:63-69 \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":"src/agents/voice/input.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"702e91ef92213099b931364c7a849e40afb8ac07077f73cf3cf20e41b4b74c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/agents/run_state.py:1382-1397 | src/agents/run_state.py:1406-1428 \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":"src/agents/run_state.py"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"9183939f394ae508f65c9bd3f1511dbff486b9dfd201cb365a1319ab4d51a34e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/agents/model_settings.py:392-403 | src/agents/model_settings.py:410-422 \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":"src/agents/model_settings.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddda56534c72e4e7b708854880508385c85a386f22a33e763b7966250b160ffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/agents/mcp/server.py:1193-1209 | src/agents/mcp/server.py:1226-1236 \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":"src/agents/mcp/server.py"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b043b7b82045ad09ee6f6b5a2eefcd589667818c331bb34b0a303bc7a48e7fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/agents/extensions/memory/async_sqlite_session.py:69-100 | src/agents/memory/sqlite_session.py:230-259 \u2014 These two members are one piece of code written twice and then edited apart: 30 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":"src/agents/extensions/memory/async_sqlite_session.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e9f91677fe89102096299d9af43123c2f6c94b9e0eaf2a23fc9c9bf81ef1b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/agents/extensions/memory/advanced_sqlite_session.py:797-814 | src/agents/extensions/memory/advanced_sqlite_session.py:1749-1808 \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":"src/agents/extensions/memory/advanced_sqlite_session.py"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"1318a6a74cb818b3e01a522a56894398ee55ea4e60647c65c519bfdc31ede292"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/agents/models/openai_responses.py:389-401 | src/agents/run_internal/model_retry.py:362-371 \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":"src/agents/models/openai_responses.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fbcd50857ddaee5ff219c102ad6d49281d2ee9ebc8ab16cb264c40ccd7f29b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): .agents/skills/release-candidate-prep/scripts/prepare.py:140-146 | .github/scripts/update_released_api_contract.py:47-51 \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":".agents/skills/release-candidate-prep/scripts/prepare.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be3e9d5ce95f67786f6e091f05e16d34d2bd3ccfaecdff161163e109ccfb6f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/agents/models/openai_responses.py:1817-1826 | src/agents/tool.py:1480-1489 \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":"src/agents/models/openai_responses.py"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfc56b605a55be9f0849cb24bca7f90bdecf4cf383a29c491908a3d9fc6d3e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/agents/extensions/experimental/codex/codex_tool.py:1280-1287 | src/agents/handoffs/history.py:456-463 \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":"src/agents/extensions/experimental/codex/codex_tool.py"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77caf2fdddeafadfcbe9029eedcfa5e139f5f2b5fd52058b01f2c0ae393fc9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/agents/__init__.py:271-277 | src/agents/memory/__init__.py:39-45 \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":"src/agents/__init__.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acfa756704ceb5931217da590a203aeb6ae2e96041ba8d0e86af1a8cb7f997b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/agents/_tool_invocation.py:298-304 | src/agents/sandbox/session/snapshot_lifecycle.py:178-183 \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":"src/agents/_tool_invocation.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"2668e711406b5cd68ca890a4be2bab3e95c4890bd6c4ce93b76640c0f018d619"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/agents/exceptions.py:131-135 | src/agents/run_internal/blocked_output.py:46-50 \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":"src/agents/exceptions.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d01f92406791948643a3cfef03810181b5ece48719b56796551e955795adeeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (71\u201378 lines \u00D7 3): src/agents/mcp/server.py:1989-2059 | src/agents/mcp/server.py:2139-2211 | src/agents/mcp/server.py:2317-2394 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/mcp/server.py"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d5b5417cc1ca40c11f030acc6d9f8a2b6b8619978e7de45ee21a52ec73bd90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56 lines \u00D7 2): src/agents/run_context.py:1115-1170 | src/agents/run_context.py:1417-1472 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_context.py"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc1ec620ec691383a5aa3ffe721660985b7f31dd63138508ed8e33843175d8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201351 lines \u00D7 2): src/agents/handoffs/__init__.py:296-346 | src/agents/realtime/handoffs.py:117-154 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/handoffs/__init__.py:296\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/handoffs/__init__.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc853a8b679dadd5b27a12287c51ad75124240cb9ca010d2c68b21cc17ea673f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): src/agents/handoffs/__init__.py:348-384 | src/agents/realtime/handoffs.py:156-192 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/handoffs/__init__.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe577f583f0df7d2f692e759566b4fe48489807d4ab4c0d700fc221b32ade21f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201334 lines \u00D7 2): src/agents/run_internal/oai_conversation.py:279-312 | src/agents/run_internal/oai_conversation.py:315-347 \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":"src/agents/run_internal/oai_conversation.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"779d680f0f327aa55c2a5c1d117ff47f66946c1d339b41e7718958b3a2ccdf14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): src/agents/run_internal/run_loop.py:2581-2613 | src/agents/run_internal/run_loop.py:3005-3037 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run_internal/run_loop.py:2581\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/run_loop.py"},"region":{"startLine":2581}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b55744c757987f9c6054e9e1b22a41ce24e1d2bcc6220691e0220247da0a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/agents/run.py:353-383 | src/agents/run.py:456-486 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run.py:353\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f1439f84eb77c1a4aeb0a757377c6bb923f6e884e0fa25262bf32a2509dcae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): src/agents/extensions/models/any_llm_model.py:629-656 | src/agents/models/openai_chatcompletions.py:273-301 \u2014 before extracting anything, compare \u0060src/agents/extensions/models/any_llm_model.py\u0060 and \u0060src/agents/models/openai_chatcompletions.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 118 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed47707398b36ddb7b0efa41bc366f381c5a5d5b8d78c1ff22ed70466a97d3ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201328 lines \u00D7 2): src/agents/extensions/models/any_llm_model.py:978-998 | src/agents/models/openai_chatcompletions.py:755-782 \u2014 before extracting anything, compare \u0060src/agents/extensions/models/any_llm_model.py\u0060 and \u0060src/agents/models/openai_chatcompletions.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 118 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. Note first that the copies are not typed on the same thing: \u0060FAKE_RESPONSES_ID\u0060 names \u0060...models.fake_id\u0060 in one and \u0060.fake_id\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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa98db476b766abc17ea4f01f9ce1f78f60a0d83dcb903f04b0e85d07c88409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/agents/mcp/server.py:1626-1651 | src/agents/mcp/server.py:2607-2632 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/mcp/server.py"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b9cf4977e9ccda3c413b45427d82c3a3e09419625ea9b1a3c1746e65ac4835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201326 lines \u00D7 2): src/agents/run_internal/tool_actions.py:842-864 | src/agents/run_internal/tool_actions.py:1086-1111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run_internal/tool_actions.py:842\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":"src/agents/run_internal/tool_actions.py"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"234f9ce5bfd005d720831b225b7bcc05c623175f2f4ee58e205c4bff9b409f94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): src/agents/models/chatcmpl_stream_handler.py:874-898 | src/agents/models/chatcmpl_stream_handler.py:959-982 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/models/chatcmpl_stream_handler.py:874\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/chatcmpl_stream_handler.py"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d16a6d1cf25488c7a6163647a44c4950a00b51a7418b02968472c847f2dc29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): src/agents/run.py:1789-1812 | src/agents/run.py:1897-1919 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run.py:1789\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run.py"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f680ea9517151b0485978b89bd753d0c99969077c565b47f163eee614de146a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): src/agents/extensions/models/any_llm_model.py:520-540 | src/agents/models/openai_responses.py:749-770 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/models/openai_responses.py:749\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"401bd95d58e5221ec5d7827607a2c75b05a02bc12b7c7963217cad4db72186b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/agents/extensions/models/any_llm_model.py:692-713 | src/agents/models/openai_chatcompletions.py:360-381 \u2014 before extracting anything, compare \u0060src/agents/extensions/models/any_llm_model.py\u0060 and \u0060src/agents/models/openai_chatcompletions.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 118 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 \u0060src/agents/extensions/models/any_llm_model.py:692\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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2df1e0f64ab7e5805e7044f215032363333e2e282b2b7808e998a25e22f62a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/agents/extensions/models/litellm_model.py:574-595 | src/agents/models/openai_responses.py:990-1011 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/extensions/models/litellm_model.py:574\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb72edaa4b4fdcf44c90d990880b8a7111472f0c263a6f9a9a4ab1018d17816"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): src/agents/run.py:1408-1428 | src/agents/run.py:2149-2167 \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, \u0060src/agents/run.py:1407\u0060 calls \u0060discard_held_current_response\u0060 and \u0060src/agents/run.py:2148\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":"src/agents/run.py"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"868a0085705cc37ae6e465772e2ab0e06e72fbff80bbe719e751faa2d62ab041"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/agents/run_internal/run_loop.py:1859-1878 | src/agents/run_internal/run_loop.py:1950-1970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run_internal/run_loop.py:1950\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/run_loop.py"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"8948329e3a822613e147f947dc4a0d728b762105a2f81bc0b9831a06a2237eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/agents/realtime/session.py:1007-1026 | src/agents/realtime/session.py:1059-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/session.py"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"365375c71fe08165c412e37a27f744f7e269b7b54d6ba2a816ed90c46f87aa54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/agents/run.py:1310-1329 | src/agents/run.py:2353-2372 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run.py:1310\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 \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":"src/agents/run.py"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"642afc953c5374d750852c712f409e22e127416692045144dd8933076721b2e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/agents/run_internal/model_retry.py:670-689 | src/agents/run_internal/model_retry.py:885-904 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run_internal/model_retry.py:670\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/model_retry.py"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"6466670a169228c71b2179649a22770109017a86364f268ac2fd0a23867d2425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/agents/run_internal/turn_resolution.py:3723-3742 | src/agents/run_internal/turn_resolution.py:3771-3789 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run_internal/turn_resolution.py:3723\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":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":3723}}}],"partialFingerprints":{"codehealthFindingId/v1":"af92162989e73610e7c5d3f4ba0fa6927cf9a2bba9cdaa9b595e12028a9ba9ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/agents/extensions/models/litellm_model.py:240-258 | src/agents/models/openai_chatcompletions.py:240-258 \u2014 before extracting anything, compare \u0060src/agents/extensions/models/litellm_model.py\u0060 and \u0060src/agents/models/openai_chatcompletions.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 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 \u0060src/agents/extensions/models/litellm_model.py:240\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55823c1d901f773d175a81076de446f45a1ec8a97f2d59ee6fa7df183dc0cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/agents/extensions/models/litellm_model.py:414-432 | src/agents/models/openai_chatcompletions.py:454-472 \u2014 before extracting anything, compare \u0060src/agents/extensions/models/litellm_model.py\u0060 and \u0060src/agents/models/openai_chatcompletions.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 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 \u0060src/agents/extensions/models/litellm_model.py:414\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8021fcaeb3cbaf7b310ae156ed731eaee8c5480f8a2610e28b4ff8f13f2634"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/agents/extensions/models/litellm_model.py:547-565 | src/agents/models/openai_chatcompletions.py:627-645 \u2014 before extracting anything, compare \u0060src/agents/extensions/models/litellm_model.py\u0060 and \u0060src/agents/models/openai_chatcompletions.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 96 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 \u0060src/agents/extensions/models/litellm_model.py:547\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 first that the copies are not typed on the same thing: \u0060Converter\u0060 names \u0060...models.chatcmpl_converter\u0060 in one and \u0060.chatcmpl_converter\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":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e394ed562de00453cfe62a6ea4c5fb9f445b7a9093fbf62cdd3aff4be80572d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): src/agents/run.py:1508-1526 | src/agents/run.py:1673-1689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run.py:1508\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run.py"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c94215131f915f38645c43694fa3dd754241666d90b23855fb3584fa0c79e87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 3): src/agents/run_internal/tool_actions.py:670-687 | src/agents/run_internal/tool_actions.py:851-866 | src/agents/run_internal/tool_actions.py:1096-1113 \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 \u0060src/agents/run_internal/tool_actions.py:670\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/tool_actions.py"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"33144d5a090222dc439aebd268e61d9cae570d54d8feca34a22f5877d0722e8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201318 lines \u00D7 2): src/agents/extensions/models/any_llm_model.py:1582-1594 | src/agents/extensions/models/litellm_model.py:854-871 \u2014 before extracting anything, compare \u0060src/agents/extensions/models/any_llm_model.py\u0060 and \u0060src/agents/extensions/models/litellm_model.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 109 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 \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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"915b1fb9f149270bca3a63a56eb7956490302dfaecd494a3ceed6eb6e5955d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/agents/extensions/visualization.py:251-268 | src/agents/extensions/visualization.py:274-291 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/extensions/visualization.py:251\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/visualization.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a461f52c9b03956645362e07677cda86d46941e9515151cfad160fb9e66b40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/agents/mcp/manager.py:481-498 | src/agents/mcp/manager.py:585-602 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/mcp/manager.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba73bf9871d49bc923b122f258e1cdad5cd85ad582590397bd0662486640c8e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/agents/run.py:1293-1310 | src/agents/run.py:2332-2349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run.py:1293\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run.py"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c1da4624fe1ca1ace2ebb263b4ad0dbf8cec9c121c3e858706e2f7391a73c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): src/agents/run_internal/run_loop.py:2557-2574 | src/agents/run_internal/run_loop.py:2991-3005 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run_internal/run_loop.py:2557\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/run_loop.py"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"445844d42396730996c0f1e41960e60ca85b23f8d89857be35d386a322319ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): src/agents/extensions/memory/advanced_sqlite_session.py:427-443 | src/agents/extensions/memory/async_sqlite_session.py:249-266 | src/agents/memory/sqlite_session.py:287-303 \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. Note first that the copies are not typed on the same thing: \u0060TResponseInputItem\u0060 names \u0060...items\u0060 in one and \u0060..items\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":"src/agents/extensions/memory/advanced_sqlite_session.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"644cc610affa29ab88b3ad088983bcaa6f7641837ddd8ac4cc4cad53251d8af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): src/agents/models/chatcmpl_stream_handler.py:882-898 | src/agents/models/chatcmpl_stream_handler.py:966-982 | src/agents/models/chatcmpl_stream_handler.py:1161-1176 \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 \u0060src/agents/models/chatcmpl_stream_handler.py:882\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/chatcmpl_stream_handler.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75b80b2c20ba414e5a41977afb0d44698cec3d3f482c66c61443f4b38f7964b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/agents/extensions/models/any_llm_model.py:400-416 | src/agents/extensions/models/any_llm_model.py:482-498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/extensions/models/any_llm_model.py:400\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a664067412dfb56b07c2ffded22784f5e2f1b6d00214c547704c3d9cb226cac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/agents/memory/session.py:37-53 | src/agents/sandbox/util/blocking_io.py:24-40 \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 \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":"src/agents/memory/session.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f34b06f2e81cefeb6ecfd83ba167ff7f413b576945f59119b192404c6ef971"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/agents/models/chatcmpl_stream_handler.py:722-737 | src/agents/models/chatcmpl_stream_handler.py:745-761 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/chatcmpl_stream_handler.py"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f92db019639451f6a5d4682c0c7452daffd3e4fd45caf124f04c059b6e19cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/agents/run_internal/turn_resolution.py:3338-3354 | src/agents/run_internal/turn_resolution.py:3424-3440 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run_internal/turn_resolution.py:3424\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":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":3338}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52400d1662d562b2a2c2f24f34659160a97c0e0103cbc00d133cc80bd98a2a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/agents/run_state.py:393-408 | src/agents/run_state.py:455-471 \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":"src/agents/run_state.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc5e01833a34fab5e0ced2d0debca88c94a1b92f13b1350e1eac8aff93a985d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 3): src/agents/extensions/models/any_llm_model.py:881-892 | src/agents/extensions/models/litellm_model.py:556-571 | src/agents/models/openai_chatcompletions.py:636-651 \u2014 before extracting anything, compare \u0060src/agents/extensions/models/any_llm_model.py\u0060 and \u0060src/agents/extensions/models/litellm_model.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 109 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 \u0060src/agents/extensions/models/litellm_model.py:556\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 first that the copies are not typed on the same thing: \u0060Converter\u0060 names \u0060...models.chatcmpl_converter\u0060 in one and \u0060.chatcmpl_converter\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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"0055d27a980cc82caa50d30c4486453d8c940664baf26297b75ff73067bb53f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/agents/extensions/models/any_llm_model.py:497-511 | src/agents/models/openai_responses.py:712-727 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/extensions/models/any_llm_model.py:497\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e70e0afc1606fb8ebd29ce6085b8d84ae35e715f45ebce0264d7f6d2115dc9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): src/agents/extensions/models/any_llm_model.py:1554-1567 | src/agents/extensions/models/litellm_model.py:819-834 \u2014 before extracting anything, compare \u0060src/agents/extensions/models/any_llm_model.py\u0060 and \u0060src/agents/extensions/models/litellm_model.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 109 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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fa34f43ace431336516a94a1bcf3d4740e4aea81ff89f8d4f034d7719afdd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/agents/models/openai_chatcompletions.py:229-244 | src/agents/models/openai_chatcompletions.py:443-458 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/models/openai_chatcompletions.py:229\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/openai_chatcompletions.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e0d09ef7044ade661728a1b7daf6d4a8b6971b7b2cd5b7c8188a41d248c91c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/agents/models/openai_provider.py:146-161 | src/agents/voice/models/openai_model_provider.py:89-104 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/models/openai_provider.py:146\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/openai_provider.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9567bc15ce2eca5716f58f6850e8af6086f73689703cf5fb0685f625123093db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/agents/models/openai_responses.py:603-618 | src/agents/models/openai_responses.py:699-714 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/models/openai_responses.py:603\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/openai_responses.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91067b587b3d2fc85932f1dfb852987f689aba53456b0ea6fcbcf64e80c62f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/agents/run.py:1473-1494 | src/agents/run.py:2199-2214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run.py:1473\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, \u0060src/agents/run.py:1496\u0060 calls \u0060take_held_session_write\u0060 and \u0060src/agents/run.py:2215\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":"src/agents/run.py"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8166f285ae606532971755fca0cbfefe6b78d0b47ed5443ce6408484fc531a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/agents/run_internal/run_loop.py:1388-1403 | src/agents/run_internal/run_loop.py:1909-1924 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/run_loop.py"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"9618ec0468838ce483f0c06c3a666b7f29eba2041bf58dbcfde58565036d5298"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/agents/run_internal/run_loop.py:2493-2508 | src/agents/run_internal/run_loop.py:2863-2878 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run_internal/run_loop.py:2493\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/agents/run_internal/run_loop.py:2488\u0060 calls \u0060get_output_schema\u0060 and \u0060src/agents/run_internal/run_loop.py:2861\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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":2493}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b810733a1c75473cadc85695809fef3394646d8136f6e3b45dc31b6d6f01e9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/agents/run_internal/tool_actions.py:522-537 | src/agents/run_internal/tool_actions.py:971-986 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run_internal/tool_actions.py:522\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":"src/agents/run_internal/tool_actions.py"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"6759813799c7952221c7bb8beb4863147c4d31e8ea211bba7b5cda2716f59175"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): src/agents/mcp/server.py:2045-2059 | src/agents/mcp/server.py:2197-2211 | src/agents/mcp/server.py:2380-2394 | src/agents/run.py:2892-2906 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/mcp/server.py:2045\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/mcp/server.py"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"89803ef8cbaeac4b3dacfba1efbe6ad6e61b360ad98cc1cf1a8884762eaeab3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/agents/run_internal/turn_resolution.py:3441-3455 | src/agents/run_internal/turn_resolution.py:3725-3739 | src/agents/run_internal/turn_resolution.py:3774-3788 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/agents/run_internal/turn_resolution.py:3456\u0060 calls \u0060get_mapping_or_attr\u0060, \u0060debug\u0060 and \u0060src/agents/run_internal/turn_resolution.py:3740\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":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":3441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9317db3544c7f5c418dcdc5337229c6a55b356c129c56bda41340c906647b27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/agents/agent.py:957-971 | src/agents/agent.py:1070-1084 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/agent.py:957\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/agent.py"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bb593979d38935fe381d0ca50f2364259668c617a8c62179119c4944b02e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/agents/extensions/memory/dapr_session.py:383-397 | src/agents/extensions/memory/dapr_session.py:472-486 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/memory/dapr_session.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"8631349a257d86172321e55039763216318c8830c9bc5b07a6b4815ea0c8f9be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/agents/run_internal/items.py:472-484 | src/agents/run_internal/items.py:548-562 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/items.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec70ce481f8d8ce224959575452729044e7f8a5f709cba366d9aa274352b9771"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/agents/run_internal/tool_actions.py:545-559 | src/agents/run_internal/tool_actions.py:995-1009 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run_internal/tool_actions.py:545\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, \u0060src/agents/run_internal/tool_actions.py:560\u0060 calls \u0060ShellCommandRequest\u0060 and \u0060src/agents/run_internal/tool_actions.py:1011\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":"src/agents/run_internal/tool_actions.py"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1d4f37abe824d9b2ddcc9e5df21036054e6b5037eb559657b13a751be3385e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/agents/run.py:1722-1735 | src/agents/run_internal/run_loop.py:1859-1872 | src/agents/run_internal/run_loop.py:1950-1963 \u2014 there are 3 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 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run.py"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f5658ba1ad2ad8727ead7059fd60aa9d0db4b8177ae347ac56fa974f5c319f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/agents/extensions/models/any_llm_model.py:949-962 | src/agents/extensions/models/litellm_model.py:644-657 \u2014 before extracting anything, compare \u0060src/agents/extensions/models/any_llm_model.py\u0060 and \u0060src/agents/extensions/models/litellm_model.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 109 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/agents/extensions/models/litellm_model.py:658\u0060 calls \u0060_merge_headers\u0060 and \u0060src/agents/extensions/models/any_llm_model.py:963\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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"f025f5c0b7532d10314918db08830c612e539cb89f73d668c2b7ed2331449111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/agents/realtime/openai_realtime.py:514-527 | src/agents/realtime/openai_realtime.py:1951-1964 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ec8b111b1f03b3b03157d423d1e9b79acd9ea92b6fd552de6b6962a5351dbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/agents/run_internal/run_loop.py:2473-2486 | src/agents/run_internal/run_loop.py:2848-2861 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run_internal/run_loop.py:2473\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, \u0060src/agents/run_internal/run_loop.py:2488\u0060 calls \u0060get_output_schema\u0060 and \u0060src/agents/run_internal/run_loop.py:2863\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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":2473}}}],"partialFingerprints":{"codehealthFindingId/v1":"577e445cfca66708bdddbcc16841cddff7fb20865cd8393fdb500ee5c0b2c720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/agents/extensions/models/any_llm_model.py:630-642 | src/agents/extensions/models/litellm_model.py:268-280 | src/agents/models/openai_chatcompletions.py:274-286 \u2014 before extracting anything, compare \u0060src/agents/extensions/models/any_llm_model.py\u0060 and \u0060src/agents/extensions/models/litellm_model.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 109 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/agents/extensions/models/litellm_model.py:282\u0060 calls \u0060hasattr\u0060 and \u0060src/agents/extensions/models/any_llm_model.py:644\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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6b9042a470b4e201b49307724fba4126215dd9c8ef66ea991c75ba1e5b06be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/agents/extensions/models/any_llm_model.py:596-608 | src/agents/extensions/models/any_llm_model.py:733-745 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/extensions/models/any_llm_model.py:596\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb5d98010655708977f5302c81a56e472463942390a0508ee27a9907e65b0d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/agents/run.py:1132-1144 | src/agents/run_internal/run_loop.py:1433-1445 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"83645f249befd0c61e2abaa5a36f7b718b47a0fd6caba0667610383b85c90552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/agents/run_internal/items.py:946-958 | src/agents/run_internal/items.py:978-990 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/agents/run_internal/items.py:959\u0060 calls \u0060isinstance\u0060 and \u0060src/agents/run_internal/items.py:991\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":"src/agents/run_internal/items.py"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"72be046884d49dd86afd007a89310b0e4947453859028e2b26a9ffb1319d06a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/agents/run_internal/oai_conversation.py:229-241 | src/agents/run_internal/oai_conversation.py:356-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/oai_conversation.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bf17e9f8e09b8e309c1804994df02f3328f7384f896e45dc4cea53585e0193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/agents/run_internal/run_loop.py:2499-2510 | src/agents/run_internal/run_loop.py:2869-2880 | src/agents/run_internal/turn_resolution.py:2280-2291 \u2014 there are 3 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 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/run_loop.py"},"region":{"startLine":2499}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7c24617514bf55cbb07cafd8685301ae1a0e08c6231b10a3bc4520fbf1c3ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/agents/run.py:2485-2496 | src/agents/run_internal/run_loop.py:2401-2412 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run.py"},"region":{"startLine":2485}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7a36e0a7a16f21d01fbe20b5e473672debbffd3eaf9175701c455e3ad4d341"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/agents/run_internal/error_handlers.py:148-159 | src/agents/run_internal/error_handlers.py:179-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/error_handlers.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c50d25238758fcc83be82876526d1e1131c323f2b0e970655fbec06b1500959"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/agents/run_internal/model_retry.py:655-666 | src/agents/run_internal/model_retry.py:870-881 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run_internal/model_retry.py:655\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/model_retry.py"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e2421f64fb1d480e92e28bb2a01ecae2c501d13af6de4e247870cc6050fa7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/agents/run_internal/run_loop.py:1341-1351 | src/agents/run_internal/run_loop.py:2407-2418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/run_loop.py"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"4668fdc2759516d24aaf15b5bbaab8c9008975d4902c23ffc3ac95f913cb1996"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): src/agents/run_internal/oai_conversation.py:233-243 | src/agents/run_internal/oai_conversation.py:250-258 | src/agents/run_internal/oai_conversation.py:360-370 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/oai_conversation.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9027ab5a3f364281166f5be67ea05c72f63b8873aedd6110e8d76c18db1630ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/agents/handoffs/history.py:297-307 | src/agents/run_state.py:1590-1600 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/handoffs/history.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6831fcbbd6b1ae89d349f5ad5fe5489a13e4ef6028d96970dab54148801993a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/agents/run_internal/items.py:656-666 | src/agents/run_internal/items.py:702-712 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/items.py"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbbe5a8c0157f0ee52a1765d651c3c6f33c019805aacbfa51646e01b65a07ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/agents/run_internal/turn_resolution.py:1029-1039 | src/agents/run_internal/turn_resolution.py:2811-2820 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run_internal/turn_resolution.py:1029\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec395f3f1a82e5b5b103a4efd8f5f1e8e531aebe5730baf53d1ad7d1cc7bcd66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/agents/util/_pretty_print.py:37-47 | src/agents/util/_pretty_print.py:70-79 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060result\u0060 to \u0060\u0022RunResult\u0022\u0060 in one and \u0060\u0022RunResultStreaming\u0022\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":"src/agents/util/_pretty_print.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6993c7bf3f3708d31dc74c3ac612b5597a10e7dce94885437af82be3fcb8028b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/agents/realtime/openai_realtime.py:509-518 | src/agents/realtime/session.py:2131-2141 \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 \u0060src/agents/realtime/openai_realtime.py:509\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7b2f690ea6e738863343892f2a3cca64d246f88b85022e65e34a02b3b0525a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/agents/run_state.py:510-519 | src/agents/run_state.py:575-584 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/run_state.py:510\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_state.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a29cdc2da6aff87dcebc64de16fd15dc6f51ed4c5667fbbe4a45d553afb11f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/agents/mcp/server.py:1574-1582 | src/agents/mcp/server.py:1630-1638 | src/agents/mcp/server.py:2611-2619 \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 \u0060src/agents/mcp/server.py:1574\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/mcp/server.py"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f596206268d48323a2c9a9eddc3bc40b466fd2ec31339de26c32a3290a2600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): .agents/skills/implementation-final-review/scripts/review_protocol.py:905-913 | .agents/skills/implementation-final-review/scripts/review_protocol.py:918-926 \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 \u0060.agents/skills/implementation-final-review/scripts/review_protocol.py:905\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":".agents/skills/implementation-final-review/scripts/review_protocol.py"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d57d827c75c9f17687b2c3de508bb3307051663d320cc35245c4b8f6378ad8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/agents/extensions/memory/async_sqlite_session.py:372-380 | src/agents/memory/sqlite_session.py:389-397 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: \u0060TResponseInputItem\u0060 names \u0060...items\u0060 in one and \u0060..items\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":"src/agents/extensions/memory/async_sqlite_session.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed81bdfe6e5aea71e2ce0864471c5454c369e9180f66bc8a440b766dd96db68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/agents/run.py:635-643 | src/agents/run.py:2625-2633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run.py"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3d76410111b6d22fa475b80977d2c3f8bd1c24ed4c4f325c44a0ab78c0c976"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/agents/run_internal/items.py:629-637 | src/agents/run_internal/items.py:693-701 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/items.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"c034c5ad96aa601b78543e044e85889dd341bafdb98834ab196b49ca2fc9a008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/agents/run_state.py:3879-3887 | src/agents/run_state.py:4016-4024 \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 \u0060expected_type\u0060 to \u0060Literal[\u0022input\u0022, \u0022output\u0022]\u0060 in one and \u0060Literal[\u0022tool_input\u0022, \u0022tool_output\u0022]\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":"src/agents/run_state.py"},"region":{"startLine":3879}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cac6549a5928451815ba0b94d54462c5f5ffeb344f4b3177de538d85bece486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/agents/handoffs/history.py:286-294 | src/agents/run_internal/session_persistence.py:344-352 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/handoffs/history.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"576cd27e7fbe9f15934607bf247ed55785b13ea276ba447283deaa78f61a046d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/agents/models/_retry_runtime.py:17-23 | src/agents/models/openai_responses.py:434-440 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/_retry_runtime.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5fd0a2e5e2161120202a469882b9b17439348a8372beddd7bafe7ac7e0861f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/agents/handoffs/history.py:289-294 | src/agents/run_internal/session_persistence.py:347-352 | src/agents/run_state.py:1582-1587 \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":"src/agents/handoffs/history.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6abe0d2d3a8b3a6e336381097141054f4a8562a1a9cb08019a083ab747d3a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/agents/run_internal/items.py:622-627 | src/agents/run_internal/items.py:685-690 \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":"src/agents/run_internal/items.py"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ac7175ace9017e964a23cd635683743689a4ae9c8ea07bef35cc05920cc2c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/agents/run_internal/turn_resolution.py:3183-3191 | src/agents/run_internal/turn_resolution.py:3926-3934 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7d1f6f0ed65b7092687bde73b6c8a30d9abd02e839863409fca65d646d0998"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/agents/extensions/models/any_llm_model.py:1304-1313 | src/agents/extensions/models/litellm_model.py:883-892 | src/agents/models/openai_chatcompletions.py:134-143 | src/agents/models/openai_responses.py:542-551 \u2014 before extracting anything, compare \u0060src/agents/extensions/models/any_llm_model.py\u0060 and \u0060src/agents/extensions/models/litellm_model.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 109 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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dbcb7bc53eadd4304d37cad3a49af65d160f94cd2424415217b27b2d8cde08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/agents/extensions/models/any_llm_model.py:1319-1331 | src/agents/extensions/models/litellm_model.py:898-910 \u2014 before extracting anything, compare \u0060src/agents/extensions/models/any_llm_model.py\u0060 and \u0060src/agents/extensions/models/litellm_model.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"43076e002b2314f5eb22b5e7b8d5b866ead58defceb358e3dd313d8ca68c722a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/agents/extensions/models/any_llm_model.py:1478-1486 | src/agents/extensions/models/litellm_model.py:383-391 \u2014 before extracting anything, compare \u0060src/agents/extensions/models/any_llm_model.py\u0060 and \u0060src/agents/extensions/models/litellm_model.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 109 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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b12134acc3c48493a2a96182d4c677b54ab9402ed17bf5d0439e510ba44d46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/agents/models/openai_chatcompletions.py:151-163 | src/agents/models/openai_responses.py:559-571 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/openai_chatcompletions.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb04bb82cc7ffd5428b53bf0a9a427f7ac5c1bfd8effefa9a6b9c2067de4cf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/agents/models/openai_chatcompletions.py:786-792 | src/agents/models/openai_responses.py:1120-1126 \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":"src/agents/models/openai_chatcompletions.py"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"de21188ae3d999b2c44188b16e542d95a135b10eb846a6a3acad4aeb4ea5f308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/agents/extensions/experimental/codex/events.py:92-96 | src/agents/extensions/experimental/codex/items.py:164-168 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060raw\u0060 to \u0060ThreadError | Mapping[str, Any]\u0060 in one and \u0060McpToolCallError | Mapping[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":"src/agents/extensions/experimental/codex/events.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82f9e4fdc42aadcb8cfda9b3db2903a47de2fa23a5cf3e1d8f8bacc837f3330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/agents/extensions/experimental/hosted_multi_agent/model.py:468-476 | src/agents/models/openai_responses.py:1260-1268 \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 \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":"src/agents/extensions/experimental/hosted_multi_agent/model.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"e851f99a1b251749c3fa687fd2f22f71150d6accd02646131e0fb207ca992a9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/agents/realtime/testing.py:229-234 | src/agents/testing/model.py:314-319 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/testing.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f4d7a2ef9a6920c5d899aed3f23ed1c33dc5a65b3a70cae03f6cbf2b12ba82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): .agents/skills/implementation-final-review/scripts/review_protocol.py:687-692 | .agents/skills/implementation-final-review/scripts/review_protocol.py:802-807 \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":".agents/skills/implementation-final-review/scripts/review_protocol.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"93eb024be377d16b7d6e1e52e333080f37ea6927b061b89dae97726d7416b117"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (58 shared lines): src/agents/extensions/sandbox/daytona/sandbox.py:1093-1169 | src/agents/extensions/sandbox/e2b/sandbox.py:1488-1560 \u2014 These two members are variants of one another: 58 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":"src/agents/extensions/sandbox/daytona/sandbox.py"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d447f1a9b67d9416778370fef05cf092c85d31b84fe9888fb502fe13669766"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (14 members, 50\u002B identical tokens): examples/sandbox/basic.py:167-221 | examples/sandbox/docker/docker_runner.py:69-157 | examples/sandbox/extensions/blaxel_runner.py:145-233 | examples/sandbox/extensions/blaxel_runner.py:250-327 | examples/sandbox/extensions/blaxel_runner.py:348-420 | examples/sandbox/extensions/cloudflare_runner.py:217-296 | examples/sandbox/extensions/cloudflare_runner.py:317-370 | examples/sandbox/extensions/daytona/daytona_runner.py:103-155 | examples/sandbox/extensions/e2b_runner.py:151-224 | examples/sandbox/extensions/modal_runner.py:261-319 | examples/sandbox/extensions/vercel_runner.py:310-388 | examples/sandbox/tax_prep.py:142-171 | examples/sandbox/unix_local_pty.py:88-151 | examples/sandbox/unix_local_runner.py:139-199 \u2014 These 14 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 14 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 14 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/sandbox/basic.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ac72a257508f18fa5bd4dcd8105da896192bce614f300ecd2c6cc0c7ae6209"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): src/agents/extensions/sandbox/blaxel/sandbox.py:811-898 | src/agents/extensions/sandbox/cloudflare/sandbox.py:1120-1220 | src/agents/extensions/sandbox/daytona/sandbox.py:642-771 | src/agents/extensions/sandbox/e2b/sandbox.py:967-1066 | src/agents/extensions/sandbox/modal/sandbox.py:858-928 | src/agents/sandbox/sandboxes/docker.py:1053-1176 | src/agents/sandbox/sandboxes/unix_local.py:437-530 \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":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"0389e5aa5a2f92dde2539ef0f2019ad2bf7b4aa73c715d089c332c9ea2578085"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): examples/memory/dapr_session_example.py:117-240 | examples/memory/encrypted_session_example.py:21-112 | examples/memory/openai_session_example.py:15-74 | examples/memory/redis_session_example.py:22-150 | examples/memory/sqlalchemy_session_example.py:9-72 | examples/memory/sqlite_session_example.py:15-73 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/memory/dapr_session_example.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec577312ed6cb31c842a257471f8f2a798ba089759f0c69a4b733b7e17d1f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/agents/extensions/sandbox/blaxel/sandbox.py:908-936 | src/agents/extensions/sandbox/daytona/sandbox.py:827-857 | src/agents/extensions/sandbox/e2b/sandbox.py:1076-1107 | src/agents/extensions/sandbox/modal/sandbox.py:938-965 | src/agents/sandbox/sandboxes/docker.py:1186-1226 | src/agents/sandbox/sandboxes/unix_local.py:540-576 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d52877742312528c3676fbba42622b52577054853554df8ee00b4299ddf3c6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/agents/extensions/sandbox/blaxel/sandbox.py:560-574 | src/agents/extensions/sandbox/cloudflare/sandbox.py:1372-1431 | src/agents/extensions/sandbox/daytona/sandbox.py:1009-1027 | src/agents/extensions/sandbox/e2b/sandbox.py:1163-1182 | src/agents/extensions/sandbox/modal/sandbox.py:1315-1357 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75af9cf325ddbee133f05141e20384f68e1428b36ce0285df15fd388ec6da72"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/agents/extensions/sandbox/cloudflare/sandbox.py:1056-1071 | src/agents/extensions/sandbox/e2b/sandbox.py:1275-1291 | src/agents/extensions/sandbox/modal/sandbox.py:1172-1187 | src/agents/sandbox/sandboxes/docker.py:1348-1367 | src/agents/sandbox/sandboxes/unix_local.py:673-689 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/cloudflare/sandbox.py"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a6174ce01c23949cbcccf3e7722317ccfa4976baea311d717e493792049dea"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/agents/extensions/sandbox/cloudflare/sandbox.py:1074-1086 | src/agents/extensions/sandbox/e2b/sandbox.py:1294-1306 | src/agents/sandbox/sandboxes/docker.py:1370-1382 | src/agents/sandbox/sandboxes/unix_local.py:692-704 \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":"src/agents/extensions/sandbox/cloudflare/sandbox.py"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f480544f11cff1e5cf5291a520723aaffecd04ca415f1b292a0cda55845284b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): examples/memory/compaction_session_example.py:16-81 | examples/memory/compaction_session_stateless_example.py:15-80 \u2014 These two members are one piece of code written twice and then edited apart: 66 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/memory/compaction_session_example.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6721e9d1742cb59fe77a27d074e1793b2b64a878e81a3e8bf98a8ba9a3353543"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): src/agents/sandbox/session/archive_extraction.py:66-132 | src/agents/sandbox/session/archive_extraction.py:142-200 \u2014 These two members are one piece of code written twice and then edited apart: 59 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":"src/agents/sandbox/session/archive_extraction.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"941ab40a4168538184126cd56fee5b994a2c4507d43cd4d3fb10d32e100f7952"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (87 corresponding lines): examples/basic/retry.py:22-108 | examples/basic/retry_litellm.py:22-110 \u2014 These two members are one piece of code written twice and then edited apart: 87 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/basic/retry.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9f1a9db6c0c9caacd73bdb504bb0d8400f00abcf996cd8ae3754612a374662"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): src/agents/extensions/sandbox/blaxel/sandbox.py:743-794 | src/agents/extensions/sandbox/daytona/sandbox.py:1172-1227 \u2014 These two members are one piece of code written twice and then edited apart: 52 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":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2efdfea855d9274385311abc636c15834f0bf012d7a312d6c56c7dcc88e36c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): examples/memory/memory_session_hitl_example.py:63-122 | examples/memory/openai_session_hitl_example.py:63-120 \u2014 These two members are one piece of code written twice and then edited apart: 58 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/memory/memory_session_hitl_example.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5fd669bf74b48bd5027035837cfa2232d202a288fc5a6e429eb34847b9c1f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): integration_tests/_contract_state.py:185-215 | integration_tests/_contract_state.py:336-368 \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":"integration_tests/_contract_state.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"142bb086c7df4bc7db06de296b4661b443bb30f8394d84b796a48c377952f99f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/agents/sandbox/sandboxes/unix_local.py:1188-1217 | src/agents/sandbox/sandboxes/unix_local.py:1227-1263 \u2014 These two members are one piece of code written twice and then edited apart: 30 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":"src/agents/sandbox/sandboxes/unix_local.py"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"474d764274a307f25e8d655542938cc14c6b5dd3c71de2032ec7038c2d86145f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): examples/financial_research_agent/manager.py:138-168 | examples/research_bot/manager.py:66-92 \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":"examples/financial_research_agent/manager.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"48dacc963315ada86db2dece732e724b6d735edf2de034e8cf9652320f8d7359"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): examples/sandbox/extensions/cloudflare_runner.py:153-191 | examples/sandbox/extensions/vercel_runner.py:144-179 \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":"examples/sandbox/extensions/cloudflare_runner.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"36dc254c90e3e1cb2c84abf99add208d27454a9ec3c2c1aa8c54619e8ec64644"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): examples/sandbox/extensions/temporal/temporal_sandbox_tui.py:631-656 | examples/sandbox/extensions/temporal/temporal_sandbox_tui.py:660-682 \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":"examples/sandbox/extensions/temporal/temporal_sandbox_tui.py"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c03f9304a54d1eec35e5a8ceed6e198ec223c4055ff8517c22b8bb8a0b75882"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): examples/financial_research_agent/manager.py:79-104 | examples/research_bot/manager.py:22-50 \u2014 These two members are one piece of code written twice and then edited apart: 26 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/financial_research_agent/manager.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"108a222515077c04a7797b4098b79e878ee01db0ac62741ccdc66a2259f01427"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): src/agents/extensions/sandbox/cloudflare/sandbox.py:508-551 | src/agents/extensions/sandbox/cloudflare/sandbox.py:554-591 \u2014 These two members are one piece of code written twice and then edited apart: 38 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":"src/agents/extensions/sandbox/cloudflare/sandbox.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2a944e907f91b9e8a4d904946fbdb53319e3e2f06f2cb94b4b874953083ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): examples/handoffs/message_filter.py:75-188 | examples/handoffs/message_filter_streaming.py:75-188 \u2014 These two members are one piece of code written twice and then edited apart: 53 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/handoffs/message_filter.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"730825df36eed53818a69a9d852229de139a91c4b35d277cb6c331f99a38fa2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/agents/sandbox/entries/mounts/providers/azure_blob.py:59-87 | src/agents/sandbox/entries/mounts/providers/s3.py:82-113 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"src/agents/sandbox/entries/mounts/providers/azure_blob.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c79a702afae1601cb6902321a06380cd80671c09daed114b1b5fc47eb1ac38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): examples/mcp/sse_example/main.py:32-55 | examples/mcp/streamablehttp_example/main.py:32-55 \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":"examples/mcp/sse_example/main.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d105029bc44db77d56af159ad1bff6cfa069d260e74dd60f378dfceebf0dda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/agents/extensions/sandbox/blaxel/mounts.py:535-562 | src/agents/sandbox/entries/mounts/base.py:396-428 \u2014 These two members are one piece of code written twice and then edited apart: 28 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":"src/agents/extensions/sandbox/blaxel/mounts.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b1d4b9982195e9e92c544c57c8c848247a1dd8ea9d5b524a7c98795f91528b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): src/agents/extensions/sandbox/blaxel/sandbox.py:176-197 | src/agents/extensions/sandbox/daytona/sandbox.py:146-168 | src/agents/extensions/sandbox/modal/sandbox.py:219-240 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 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":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ca854dd5551394ac946381c37df2d0efa6485b50330c2985495f8df9cf39e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/agents/sandbox/_mount_security.py:482-505 | src/agents/sandbox/_mount_security.py:513-540 \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":"src/agents/sandbox/_mount_security.py"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08c39e59696881bfe44365e4767d12ec9e6d00309cb26cf284d299621fe1b20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/agents/sandbox/entries/mounts/base.py:135-152 | src/agents/sandbox/session/sandbox_client.py:55-74 | src/agents/sandbox/snapshot.py:38-50 \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":"src/agents/sandbox/entries/mounts/base.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba7a2f22417af522cbaa27980f27b75d147b0b6ec5610897fa8d2a27df4cfd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/agents/extensions/sandbox/e2b/sandbox.py:96-112 | src/agents/extensions/sandbox/modal/sandbox.py:186-200 \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":"src/agents/extensions/sandbox/e2b/sandbox.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72b01b232bd4d982b7702c32e7045a4830b67c2843d5a9a67c0582d33d7ef1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): examples/sandbox/healthcare_support/data.py:22-35 | examples/sandbox/tutorials/misc.py:92-104 \u2014 These two members are one piece of code written twice and then edited apart: 13 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/sandbox/healthcare_support/data.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4a3ecc6456df256a86b0c4d50a4cdf03505a5d73d153bd0735ede457dd59ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/agents/sandbox/session/base_sandbox_session.py:1227-1260 | src/agents/sandbox/session/base_sandbox_session.py:1270-1312 \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":"src/agents/sandbox/session/base_sandbox_session.py"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e90fa07c68429a31cf0c28ca72430b904e59a26252f4d6cbb18438bc2c42f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/agents/sandbox/entries/mounts/providers/box.py:76-94 | src/agents/sandbox/entries/mounts/providers/r2.py:62-81 \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":"src/agents/sandbox/entries/mounts/providers/box.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"277320ac447e8d11f94f66a9f61892fa21de94aa635c2b3e5d6d046a6750fe82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/agents/extensions/sandbox/blaxel/sandbox.py:495-508 | src/agents/extensions/sandbox/daytona/sandbox.py:534-547 \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":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"674515ea4cbb4494d7f6aa208ffc1fa7ca9366725a6f2fcf4c9c06297d8c281d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/agents/sandbox/sandboxes/docker.py:1272-1296 | src/agents/sandbox/sandboxes/docker.py:1299-1321 \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":"src/agents/sandbox/sandboxes/docker.py"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee6c7ab7efe4b8acf8fb6728bf9adebcba9b03a01867c3bb31429dbea20a89b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/agents/sandbox/entries/mounts/base.py:243-256 | src/agents/sandbox/entries/mounts/base.py:454-473 \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":"src/agents/sandbox/entries/mounts/base.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da38d9ca3b7000de073a5732086b492be69604e879c9921bc378ac960338a31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/agents/extensions/sandbox/blaxel/sandbox.py:160-168 | src/agents/extensions/sandbox/modal/sandbox.py:120-131 \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":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf74cdb8215d26a210b15408e410b9485dc5de905e27de1e93e1bcb6fbe8fae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/agents/sandbox/sandboxes/docker.py:919-934 | src/agents/sandbox/session/base_sandbox_session.py:1020-1032 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"src/agents/sandbox/sandboxes/docker.py"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"be46c4c1496d6bf459593fe11e8abb6329b3055bdd490d4c751d17ca03bcd47d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): src/agents/sandbox/session/base_sandbox_session.py:1076-1089 | src/agents/sandbox/session/base_sandbox_session.py:1098-1118 | src/agents/sandbox/session/base_sandbox_session.py:1127-1147 \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":"src/agents/sandbox/session/base_sandbox_session.py"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef51462b984eedbbbbcf4aa454069dcff9435a1e46bf657c0bd5180a23d76326"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/agents/extensions/sandbox/blaxel/sandbox.py:1035-1044 | src/agents/extensions/sandbox/daytona/sandbox.py:911-921 | src/agents/extensions/sandbox/modal/sandbox.py:1190-1201 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 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":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"734c539d34af4970dad285a35ea57c40f2cd11cb83c71cf6be7013179575a271"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/agents/extensions/sandbox/cloudflare/sandbox.py:831-848 | src/agents/sandbox/session/base_sandbox_session.py:493-512 \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":"src/agents/extensions/sandbox/cloudflare/sandbox.py"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6cec7f0cdd28c085d754605ce23f04755a8e0452ef79ae2b223ae36bc882f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/agents/sandbox/session/sandbox_client.py:78-92 | src/agents/sandbox/snapshot.py:54-66 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"src/agents/sandbox/session/sandbox_client.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5fea66e5cbc8ee9c01884870a9eda76f417579ae2f32e7015cadcc5d574cec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): examples/sandbox/docs/coding_task.py:102-118 | examples/sandbox/sandbox_agent_capabilities.py:265-277 \u2014 These two members are one piece of code written twice and then edited apart: 13 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/sandbox/docs/coding_task.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"920e5382f331b3a0815ec0e724e52a774af3ce54a7ee35a51eb3443d439f5481"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/agents/extensions/sandbox/cloudflare/mounts.py:57-70 | src/agents/extensions/sandbox/cloudflare/mounts.py:110-120 \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":"src/agents/extensions/sandbox/cloudflare/mounts.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c5edb70958eaabe0218c6e17c4c9c4adfdde274115c1ed061834543195f565"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): src/agents/extensions/sandbox/daytona/mounts.py:207-218 | src/agents/extensions/sandbox/daytona/mounts.py:248-259 | src/agents/extensions/sandbox/e2b/mounts.py:92-104 | src/agents/extensions/sandbox/e2b/mounts.py:134-146 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 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":"src/agents/extensions/sandbox/daytona/mounts.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cb11217fb8067069e5f8aacf0edf07674fcd539b61312a2977989b9f9343f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/agents/extensions/sandbox/blaxel/sandbox.py:1319-1346 | src/agents/extensions/sandbox/cloudflare/sandbox.py:467-474 \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":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e213a847a813b32a70948c7cbc32bdb48a813987b571a55f57e54248499423"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): examples/sandbox/docs/coding_task.py:84-98 | examples/sandbox/misc/example_support.py:18-33 | examples/sandbox/shared_session_workdirs.py:163-175 \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":"examples/sandbox/docs/coding_task.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba15f58040f0a281c32809f6e523549b3ea299aa6289ca6763cae123796ab31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/agents/sandbox/_mount_security.py:774-784 | src/agents/sandbox/_mount_security.py:788-798 \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":"src/agents/sandbox/_mount_security.py"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"97979dff59a38725030822c83dedc685d2f246a7beb5b30fe3d252cbe85acb9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/agents/sandbox/sandboxes/docker.py:1927-1939 | src/agents/sandbox/sandboxes/docker.py:1943-1954 \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":"src/agents/sandbox/sandboxes/docker.py"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9beee52017ee3864aa1a329259a96de0e3f8e57964c8fc439871b7fb8fdf727"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/agents/extensions/sandbox/e2b/sandbox.py:647-663 | src/agents/extensions/sandbox/modal/sandbox.py:321-336 \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":"src/agents/extensions/sandbox/e2b/sandbox.py"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"44938b61aeacd9c8593060309af3f97abf1f75d1a555f0783e3f21cf03b675ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): examples/basic/lifecycle_example.py:82-88 | examples/basic/lifecycle_example.py:93-99 \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":"examples/basic/lifecycle_example.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f204927e30b5f1500cb1f44d4375054b2798b9014f0edc3fd6628fa4e2b3328"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): src/agents/extensions/sandbox/daytona/sandbox.py:244-255 | src/agents/extensions/sandbox/e2b/sandbox.py:528-539 | src/agents/extensions/sandbox/modal/sandbox.py:135-147 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 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":"src/agents/extensions/sandbox/daytona/sandbox.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f55dc17915b3cf9c26b05e46e5f3e55f47eaa615e6662c8e98efc8217c5299"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/agents/extensions/sandbox/modal/sandbox.py:1855-1868 | src/agents/extensions/sandbox/modal/sandbox.py:1871-1884 \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":"src/agents/extensions/sandbox/modal/sandbox.py"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"06405896ba7abfafa41be052036ce358116d5240fe4004360c453ca462d826f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): examples/financial_research_agent/manager.py:126-133 | examples/research_bot/manager.py:53-63 \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":"examples/financial_research_agent/manager.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e55f50ba52873089ac95ffed07323931ce3762f66a0319b16ec57f05c8e00f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/agents/extensions/sandbox/blaxel/mounts.py:603-613 | src/agents/extensions/sandbox/blaxel/mounts.py:650-659 \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":"src/agents/extensions/sandbox/blaxel/mounts.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"64522553aea646c2deefddb0c3b8fdf20f41e3ebff6417f9c09e8fab2ce9a812"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/agents/sandbox/capabilities/tools/shell_tool.py:205-213 | src/agents/sandbox/capabilities/tools/view_image.py:114-122 \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":"src/agents/sandbox/capabilities/tools/shell_tool.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"73eb9c1264331292d17319153690d91dc6ba75ad010ded9e08f9f98a8c9848c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): examples/run_examples.py:191-201 | examples/tools/web_search_filters.py:71-81 \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":"examples/run_examples.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4bfd75d1e798cbb0c8236660f51103191d47ee41f58e84dbc5d3139bad3c6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): examples/financial_research_agent/printer.py:15-18 | examples/research_bot/printer.py:10-13 \u2014 These two members are one piece of code written twice and then edited apart: 4 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/financial_research_agent/printer.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"19656cd55be25ed4d604582d525b4e4596a4db60a090532481dbe4802b81f980"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): examples/basic/agent_lifecycle_example.py:111-122 | examples/basic/lifecycle_example.py:150-162 \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":"examples/basic/agent_lifecycle_example.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25d63d9994119af584a413cf02991e4ab389b28382e64847cfaf772e51f6190"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/agents/extensions/sandbox/cloudflare/mounts.py:80-86 | src/agents/extensions/sandbox/modal/mounts.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":"src/agents/extensions/sandbox/cloudflare/mounts.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"596103efaccc5d89fc164d91e7622c40c2490e853a506946b4dea1d6f8e1d46a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/agents/extensions/sandbox/modal/mounts.py:48-54 | src/agents/sandbox/entries/mounts/base.py:319-325 \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":"src/agents/extensions/sandbox/modal/mounts.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fcfcc57016602ee3b7fc64b0c46c5ce71a097acc991bb65b741e9eb7c06248"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): examples/sandbox/shared_session_workdirs.py:208-213 | src/agents/sandbox/memory/rollouts.py:143-152 \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":"examples/sandbox/shared_session_workdirs.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2525ed474c5c2230f1407bcff1869118e0ae2242dc0c9b093541f9f2a55ce188"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/agents/sandbox/capabilities/skills.py:305-312 | src/agents/sandbox/capabilities/tools/shell_tool.py:308-316 \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":"src/agents/sandbox/capabilities/skills.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ab6904416ac073ff4dce283f9ad34c2e0b513d4b4cd24e22ec9946d7ca2551"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): examples/model_providers/custom_example_agent.py:49-57 | examples/model_providers/custom_example_global.py:51-59 \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":"examples/model_providers/custom_example_agent.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a8c6a250c43ab406d1f3b7703c12d08b70917283bdc57cdb4dd79d3be29a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): examples/sandbox/misc/workspace_apply_patch.py:14-19 | src/agents/sandbox/capabilities/skills.py:516-523 | src/agents/sandbox/memory/storage.py:18-22 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"examples/sandbox/misc/workspace_apply_patch.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3385204dd1685419138c24d5c4949b8c6794df02e15a6738a9f8cb54c1da86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): examples/voice/static/main.py:36-39 | examples/voice/streamed/my_workflow.py:16-19 \u2014 These two members are one piece of code written twice and then edited apart: 4 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/voice/static/main.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5df29a33675db0f0dd8de5f1c64eccacea53ada4578f318ac42b1e554c92548"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/agents/sandbox/entries/artifacts.py:43-49 | src/agents/sandbox/util/checksums.py:9-16 \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":"src/agents/sandbox/entries/artifacts.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1ff708c546f95127d09a777dd22885cb89650c91d26f984a898cafd70dd052"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): examples/tools/codex.py:100-103 | examples/tools/codex_same_thread.py:49-52 \u2014 These two members are one piece of code written twice and then edited apart: 4 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/tools/codex.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b77abe0aae99a0dec590525f1d67896963c2b590516246d71cbcb1cfab569a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/agents/sandbox/session/sandbox_client.py:96-99 | src/agents/sandbox/snapshot.py:70-73 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"src/agents/sandbox/session/sandbox_client.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f2476af7c30fab77deea73f73bc3b1abc65099fb20eee2f1358a5af4f61092"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): examples/sandbox/tutorials/dataroom_qa/main.py:53-56 | examples/sandbox/tutorials/sandbox_resume/main.py:58-61 \u2014 These two members are one piece of code written twice and then edited apart: 4 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/sandbox/tutorials/dataroom_qa/main.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"685046fe895dd672704be61e5eaab6a157e3036696b42b9c57edc4c5d70bddd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): examples/sandbox/memory.py:70-124 | examples/sandbox/memory_multi_agent_multiturn.py:120-143 \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":"examples/sandbox/memory.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f379c00deafbd7aea43f69c7bcb9911a068e9f346405fbefd19c88b0c1e5c29a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/agents/extensions/sandbox/blaxel/sandbox.py:342-347 | src/agents/extensions/sandbox/daytona/sandbox.py:408-412 \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":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2f918beef4ec05f6ae1f9518e6617ab5996eb13476f9b35fc303b05a02cae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/agents/extensions/sandbox/e2b/sandbox.py:175-178 | src/agents/extensions/sandbox/vercel/sandbox.py:156-159 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"src/agents/extensions/sandbox/e2b/sandbox.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7cb9f6c31c3fbbcda6e301653a04b9f0731cc17a70df61dcdbd7050004d0b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (69 lines \u00D7 2): examples/basic/retry.py:22-90 | examples/basic/retry_litellm.py:22-90 \u2014 before extracting anything, compare \u0060examples/basic/retry.py\u0060 and \u0060examples/basic/retry_litellm.py\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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/basic/retry.py:22\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/basic/retry.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e306f5bd4546f2e58ee2bebaba46d466c11e91cfcd68ce9b152c26177b0d648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51\u201353 lines \u00D7 2): examples/tools/container_shell_inline_skill.py:56-106 | examples/tools/container_shell_skill_reference.py:49-101 \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 \u0060examples/tools/container_shell_skill_reference.py:49\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/tools/container_shell_inline_skill.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce7a0411be4ee42f5b39b53e869974a16d3b1d3d0f6d8e2c6ca6af62fb9f416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47\u201349 lines \u00D7 3): examples/sandbox/extensions/blaxel_runner.py:186-232 | examples/sandbox/extensions/cloudflare_runner.py:247-295 | examples/sandbox/unix_local_pty.py:102-150 \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 \u0060examples/sandbox/extensions/cloudflare_runner.py:247\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":"examples/sandbox/extensions/blaxel_runner.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c44e7b5daceefa7f1c746437085869708c16dd25d1919d82074f9ee77e3198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201348 lines \u00D7 2): examples/memory/compaction_session_example.py:29-76 | examples/memory/compaction_session_stateless_example.py:30-75 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/memory/compaction_session_example.py:29\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 before the matched lines, \u0060examples/memory/compaction_session_stateless_example.py:29\u0060 calls \u0060ModelSettings\u0060 and \u0060examples/memory/compaction_session_example.py:28\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":"examples/memory/compaction_session_example.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33a28607d8a411cc8daaa146c0a7c819283191312f4d5491a743ed8af95cc84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): examples/memory/memory_session_hitl_example.py:75-122 | examples/memory/openai_session_hitl_example.py:73-120 \u2014 before extracting anything, compare \u0060examples/memory/memory_session_hitl_example.py\u0060 and \u0060examples/memory/openai_session_hitl_example.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 79 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":"examples/memory/memory_session_hitl_example.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b1e6dfc9ff730863c775677c9370d665202b098f33b5e8c47a8fa7f444b696"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201340 lines \u00D7 6): examples/memory/dapr_session_example.py:157-196 | examples/memory/encrypted_session_example.py:41-80 | examples/memory/openai_session_example.py:23-60 | examples/memory/redis_session_example.py:52-89 | examples/memory/sqlalchemy_session_example.py:21-60 | examples/memory/sqlite_session_example.py:24-61 \u2014 before extracting anything, compare \u0060examples/memory/dapr_session_example.py\u0060 and \u0060examples/memory/redis_session_example.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 65 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/memory/encrypted_session_example.py:41\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, \u0060examples/memory/dapr_session_example.py:197\u0060 calls \u0060get_items\u0060 and \u0060examples/memory/encrypted_session_example.py:81\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":"examples/memory/dapr_session_example.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3292dbed69cd4b32fb9586e2cce8cebfba47a67bf019967f8db92ff34e256205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201333 lines \u00D7 2): src/agents/extensions/sandbox/cloudflare/sandbox.py:519-551 | src/agents/extensions/sandbox/cloudflare/sandbox.py:561-591 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/cloudflare/sandbox.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1d600a9bc82e31aea9db8f34aedf60ea5b5efba6007f071dbdda57ea8e7980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): examples/handoffs/message_filter.py:75-102 | examples/handoffs/message_filter_streaming.py:75-102 \u2014 before extracting anything, compare \u0060examples/handoffs/message_filter.py\u0060 and \u0060examples/handoffs/message_filter_streaming.py\u0060 as WHOLE FILES: 92% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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/handoffs/message_filter.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd16c489fe24f36caefd9e1000b41a63d0adc2ac2eec8662114d3d65363c15f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): examples/sandbox/tax_prep.py:107-133 | examples/sandbox/tutorials/vision_website_clone/main.py:123-150 \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/sandbox/tax_prep.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0554408ce4d587215af5fa78d01cd69e3f4e5669cc4b2780d2940b28771bbd30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201327 lines \u00D7 2): src/agents/extensions/sandbox/blaxel/mounts.py:535-561 | src/agents/sandbox/entries/mounts/base.py:396-419 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/blaxel/mounts.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"c560637c7a53de34a087a4d8bc89dabacf035c28698452d1014f90a51079292c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/agents/extensions/sandbox/blaxel/sandbox.py:743-768 | src/agents/extensions/sandbox/daytona/sandbox.py:1172-1197 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce7e0864ade0aef1bab3155c4083ed4b8b905a5d831076638d418e154d3da4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): examples/handoffs/message_filter.py:25-49 | examples/handoffs/message_filter_streaming.py:25-49 \u2014 before extracting anything, compare \u0060examples/handoffs/message_filter.py\u0060 and \u0060examples/handoffs/message_filter_streaming.py\u0060 as WHOLE FILES: 92% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"examples/handoffs/message_filter.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"75acc2ac0dc99fad6b3fdcb0080935252ae5ffc84ebd2c2bd4f2380a7acf185f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 7): src/agents/extensions/sandbox/blaxel/sandbox.py:877-898 | src/agents/extensions/sandbox/cloudflare/sandbox.py:1199-1220 | src/agents/extensions/sandbox/daytona/sandbox.py:750-771 | src/agents/extensions/sandbox/e2b/sandbox.py:1045-1066 | src/agents/extensions/sandbox/modal/sandbox.py:907-928 | src/agents/sandbox/sandboxes/docker.py:1155-1176 | src/agents/sandbox/sandboxes/unix_local.py:509-530 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 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 7 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"84db7261b1fff30948611cd98a6838979a1ae8da548141f5ccfab9b5a5ee0e2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): examples/sandbox/extensions/cloudflare_runner.py:163-184 | examples/sandbox/extensions/vercel_runner.py:151-172 \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 \u0060examples/sandbox/extensions/cloudflare_runner.py:163\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/sandbox/extensions/cloudflare_runner.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc2268ea0d50641d4f03be9b9caccea6a917caa7da598bd47ece9ce45a5bdb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): integration_tests/_contract_validation.py:148-168 | integration_tests/_contract_validation.py:195-215 \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":"integration_tests/_contract_validation.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0e97ecc173c120e24b4a2f270e960045bb410ba1c07004b65ec0697e828aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): examples/financial_research_agent/manager.py:149-168 | examples/research_bot/manager.py:73-92 \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 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/research_bot/manager.py:71\u0060 calls \u0060create_task\u0060, \u0060_search\u0060 and \u0060examples/financial_research_agent/manager.py:148\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":"examples/financial_research_agent/manager.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb05a964da4b1d19c8beaad52707e2743834090ca1f5989e89b16d47a366061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201320 lines \u00D7 2): examples/financial_research_agent/manager.py:209-221 | examples/research_bot/manager.py:111-130 \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 \u0060examples/research_bot/manager.py:111\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/financial_research_agent/manager.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"62308b74da99c4fb004cbe990e5b4de3cb1d518f6ca0693c44faad0e3643a3b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): examples/tools/shell.py:121-141 | examples/tools/shell_human_in_the_loop.py:31-50 \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":"examples/tools/shell.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b68069de5bb6b84d329cd6fc62cfd25f1756dc73b8c641021e1f860f86aee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/agents/extensions/sandbox/cloudflare/sandbox.py:900-919 | src/agents/extensions/sandbox/cloudflare/sandbox.py:922-941 \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":"src/agents/extensions/sandbox/cloudflare/sandbox.py"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fb976c4d38c354b0985355077f4a416b29be32d5208b98875fbe407796ae92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/agents/extensions/sandbox/blaxel/sandbox.py:179-197 | src/agents/extensions/sandbox/modal/sandbox.py:222-240 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5185549d6930f5d80a87cc2b17b78a7809a93a52c5e597d66eb4b3f2514b1bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 6): src/agents/extensions/sandbox/blaxel/sandbox.py:919-936 | src/agents/extensions/sandbox/daytona/sandbox.py:840-857 | src/agents/extensions/sandbox/e2b/sandbox.py:1090-1107 | src/agents/extensions/sandbox/modal/sandbox.py:948-965 | src/agents/sandbox/sandboxes/docker.py:1209-1226 | src/agents/sandbox/sandboxes/unix_local.py:559-576 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"296bfc1fdd35786f0b69abc6aac38b597501fb966736bccc57d9337a022fe47a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): examples/sandbox/extensions/daytona/daytona_runner.py:107-124 | examples/sandbox/extensions/modal_runner.py:272-290 | examples/sandbox/extensions/vercel_runner.py:328-346 \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 \u0060examples/sandbox/extensions/daytona/daytona_runner.py:107\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, \u0060examples/sandbox/extensions/daytona/daytona_runner.py:126\u0060 calls \u0060DaytonaSandboxClient\u0060 and \u0060examples/sandbox/extensions/modal_runner.py:292\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":"examples/sandbox/extensions/daytona/daytona_runner.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc66029476be07674bdf3054507b62ef85a5c51903ee624573574f824a72bb73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): integration_tests/_contract_validation.py:150-167 | integration_tests/_contract_validation.py:197-214 | integration_tests/_contract_validation.py:239-256 \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. 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 before the matched lines, \u0060integration_tests/_contract_validation.py:238\u0060 calls \u0060object\u0060 and \u0060integration_tests/_contract_validation.py:149\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":"integration_tests/_contract_validation.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a37e95f4c271750b7749c29115dd6eae0866d53d3bcc03168cfb1639b57369b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): examples/memory/file_hitl_example.py:70-86 | examples/memory/file_hitl_example.py:101-118 \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/memory/file_hitl_example.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf48d8f10e7b87b85a27bf3b2387667503bcc82061aa7b858c2743d7105d7f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): examples/mcp/filesystem_example/main.py:14-30 | examples/mcp/sse_example/main.py:37-53 | examples/mcp/streamablehttp_example/main.py:37-53 \u2014 \u0060examples/mcp/sse_example/main.py\u0060 and \u0060examples/mcp/streamablehttp_example/main.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 3 separate duplicated blocks between them, totalling at least 39 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/mcp/filesystem_example/main.py:14\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 before the matched lines, \u0060examples/mcp/sse_example/main.py:36\u0060 calls \u0060ModelSettings\u0060 and \u0060examples/mcp/filesystem_example/main.py:13\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":"examples/mcp/filesystem_example/main.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"abca39661755db3cf41cec6d05acf485c836be3aa221cc64aa79706c612c1050"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): examples/agent_patterns/human_in_the_loop.py:119-135 | examples/agent_patterns/human_in_the_loop_stream.py:94-110 \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":"examples/agent_patterns/human_in_the_loop.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf090a2134013c8745bc4adf5977c8f12aa414eac5b270fac733c522fad648b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): examples/memory/dapr_session_example.py:217-233 | examples/memory/redis_session_example.py:109-125 \u2014 before extracting anything, compare \u0060examples/memory/dapr_session_example.py\u0060 and \u0060examples/memory/redis_session_example.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 65 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/memory/dapr_session_example.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa3f40e3ab3700ebded15179387d8c9da010b1e19931b559458744b9d2529bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/agents/extensions/sandbox/blaxel/sandbox.py:1016-1032 | src/agents/extensions/sandbox/daytona/sandbox.py:868-884 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1403d4c4d2a9d7d1a60070c648f908c948ea9a7c05e78715a30ea0f8f86c75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201317 lines \u00D7 2): src/agents/extensions/sandbox/cloudflare/sandbox.py:1494-1503 | src/agents/extensions/sandbox/modal/sandbox.py:2044-2060 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/extensions/sandbox/cloudflare/sandbox.py:1494\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/agents/extensions/sandbox/modal/sandbox.py:2061\u0060 calls \u0060ephemeral_persistence_paths\u0060 and \u0060src/agents/extensions/sandbox/cloudflare/sandbox.py:1504\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":"src/agents/extensions/sandbox/cloudflare/sandbox.py"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cf44ce7f04a499e77ca830fd7f3108730ed4aee2c81598fc06001302bb308f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/agents/extensions/sandbox/daytona/sandbox.py:1135-1151 | src/agents/extensions/sandbox/e2b/sandbox.py:1527-1543 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/extensions/sandbox/daytona/sandbox.py:1135\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":"src/agents/extensions/sandbox/daytona/sandbox.py"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a125ed2f7e064de1e2fc485169ab643a568e66c3f8846c1d7c2caeb45ea989c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/agents/extensions/sandbox/daytona/sandbox.py:1153-1169 | src/agents/extensions/sandbox/e2b/sandbox.py:1544-1560 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/extensions/sandbox/daytona/sandbox.py:1153\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 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/agents/extensions/sandbox/e2b/sandbox.py:1564\u0060 calls \u0060posix_path_for_error\u0060 and \u0060src/agents/extensions/sandbox/daytona/sandbox.py:1173\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":"src/agents/extensions/sandbox/daytona/sandbox.py"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5de8055502580628e67cfc7e499b0737ea31490f5fb5f19a72e028f65dcf74c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/agents/extensions/sandbox/blaxel/sandbox.py:678-693 | src/agents/extensions/sandbox/daytona/sandbox.py:1107-1122 | src/agents/extensions/sandbox/e2b/sandbox.py:1499-1514 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f40aa6961c193faa28a763499b906534ab42f883324d5a2aea639c7c3100501"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): integration_tests/_contract_surface.py:306-321 | integration_tests/_contract_surface.py:358-373 \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 \u0060integration_tests/_contract_surface.py:306\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":"integration_tests/_contract_surface.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5e1028ecf83f827e73b905f44c3469790fccb1b5b7ca2ccd4e6d02c9104ea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): integration_tests/_contract_validation.py:94-108 | integration_tests/_contract_validation.py:153-167 | integration_tests/_contract_validation.py:200-214 | integration_tests/_contract_validation.py:242-256 \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. 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":"integration_tests/_contract_validation.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f2b46737e81233f057aa90ddc311bb1c1a0b1774c2ed96a6bbadb016ca01b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): examples/sandbox/extensions/cloudflare_runner.py:167-181 | examples/sandbox/extensions/e2b_runner.py:110-124 | examples/sandbox/extensions/vercel_runner.py:155-169 \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 \u0060examples/sandbox/extensions/cloudflare_runner.py:167\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/sandbox/extensions/cloudflare_runner.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b8645d59ebe93322c04ea08f71fb2ab82cc52eef8016a788dca52a013692ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): src/agents/sandbox/sandboxes/unix_local.py:1029-1041 | src/agents/sandbox/sandboxes/unix_local.py:1195-1209 | src/agents/sandbox/sandboxes/unix_local.py:1239-1252 \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 \u0060src/agents/sandbox/sandboxes/unix_local.py:1195\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 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/sandbox/sandboxes/unix_local.py"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c306ebfda62c376e988ab50d6ce37a210ce9f70a8b875fdcdf3275ede52fdc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): examples/sandbox/extensions/e2b_runner.py:117-131 | examples/sandbox/sandbox_agent_with_remote_snapshot.py:131-144 \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 \u0060examples/sandbox/extensions/e2b_runner.py:117\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/sandbox/extensions/e2b_runner.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6b540274b5671bb7fc5f2c200b7af44149571b6688450c46f7dc8ac49df1fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): examples/sandbox/extensions/modal_runner.py:177-191 | examples/sandbox/extensions/vercel_runner.py:146-160 \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 \u0060examples/sandbox/extensions/modal_runner.py:177\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/sandbox/extensions/modal_runner.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4af30506f1f1d64f3c96b6c29efe729b9839ca441c9a6c1faf2b0ceb548d4ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/agents/extensions/sandbox/e2b/sandbox.py:647-661 | src/agents/extensions/sandbox/modal/sandbox.py:321-335 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/extensions/sandbox/e2b/sandbox.py:647\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/e2b/sandbox.py"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4842f63807b0d84dbe97c983568e4251a2f96a17b7ee0c22a8777e7525f1c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 6): examples/sandbox/extensions/blaxel_runner.py:405-415 | examples/sandbox/extensions/cloudflare_runner.py:355-365 | examples/sandbox/extensions/daytona/daytona_runner.py:136-148 | examples/sandbox/extensions/modal_runner.py:304-314 | examples/sandbox/extensions/vercel_runner.py:369-381 | examples/sandbox/unix_local_runner.py:181-194 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 6 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 6 times. 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/sandbox/extensions/blaxel_runner.py"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"be53934932a73f16d503b30d25a77aaf44daa76f5487318f97162086485b86c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 4): src/agents/extensions/sandbox/e2b/sandbox.py:1276-1289 | src/agents/extensions/sandbox/modal/sandbox.py:1173-1185 | src/agents/sandbox/sandboxes/docker.py:1352-1365 | src/agents/sandbox/sandboxes/unix_local.py:674-687 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/extensions/sandbox/e2b/sandbox.py:1276\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/e2b/sandbox.py"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"30df48b0d5e771d0b01adcf776e8ab35be37d3b47318bca5e6cadc5e8ed79f7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): examples/memory/advanced_sqlite_session_example.py:50-63 | examples/memory/advanced_sqlite_session_example.py:65-78 | examples/memory/advanced_sqlite_session_example.py:80-93 \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/memory/advanced_sqlite_session_example.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"43799932a535edc9a6d8d96179110de6d856c98be41067e3c7e4ad652e03f9ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): examples/sandbox/extensions/cloudflare_runner.py:162-174 | examples/sandbox/extensions/modal_runner.py:180-193 | examples/sandbox/extensions/vercel_runner.py:149-162 \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 \u0060examples/sandbox/extensions/modal_runner.py:180\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/sandbox/extensions/cloudflare_runner.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a6dc1f1deeba8f6cbee9328d24bbafbbdacd373a4c41b8cb3b0d93d4d236fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): examples/sandbox/extensions/modal_runner.py:204-217 | examples/sandbox/extensions/vercel_runner.py:162-175 \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 \u0060examples/sandbox/extensions/modal_runner.py:204\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/sandbox/extensions/modal_runner.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef28bd2d77817670d85933de1dd34bc7fdf837e70d386c8e5583bc87e0d25c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): src/agents/extensions/sandbox/cloudflare/sandbox.py:1059-1071 | src/agents/extensions/sandbox/e2b/sandbox.py:1279-1291 | src/agents/extensions/sandbox/modal/sandbox.py:1175-1187 | src/agents/sandbox/sandboxes/docker.py:1355-1367 | src/agents/sandbox/sandboxes/unix_local.py:677-689 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/cloudflare/sandbox.py"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1968ca1f5d1c8f15bcd4036d19cd495c09e8609d4af1935eeeacfe23f9cf46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/agents/sandbox/entries/mounts/providers/box.py:82-94 | src/agents/sandbox/entries/mounts/providers/r2.py:69-81 \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 \u0060src/agents/sandbox/entries/mounts/providers/box.py:82\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/sandbox/entries/mounts/providers/box.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb03f359880a235d583e083f513edc032bcaa7facef6d273125b49dd5d7fd95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): examples/sandbox/basic.py:196-207 | examples/sandbox/docker/docker_runner.py:127-138 | examples/sandbox/extensions/blaxel_runner.py:191-202 | examples/sandbox/extensions/cloudflare_runner.py:254-265 | examples/sandbox/unix_local_pty.py:109-120 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times. 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/sandbox/basic.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45fd705bc55f212c158333c2ebdc62b23e8b0cf09f1e179f82da34843aad520"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): examples/mcp/sse_example/main.py:32-43 | examples/mcp/streamablehttp_custom_client_example/main.py:73-84 | examples/mcp/streamablehttp_example/main.py:32-43 \u2014 \u0060examples/mcp/sse_example/main.py\u0060 and \u0060examples/mcp/streamablehttp_example/main.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 3 separate duplicated blocks between them, totalling at least 39 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/mcp/sse_example/main.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde6b29934885f209134f9e90098984e685812f64e963d05db0cfbfe3d6893b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/agents/extensions/sandbox/cloudflare/sandbox.py:1074-1085 | src/agents/sandbox/sandboxes/docker.py:1370-1381 | src/agents/sandbox/sandboxes/unix_local.py:692-703 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/cloudflare/sandbox.py"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe650a23ea1a8a3d41fc390775dd3e523207c26ddb23160e8cabaecdc468d0b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): examples/realtime/app/server.py:239-249 | examples/realtime/app/server.py:428-438 \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/realtime/app/server.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"660a4b18440d715466ba2d67968acd0abdc0a9f150963636da58a4a8423a4c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/agents/extensions/sandbox/blaxel/mounts.py:380-390 | src/agents/extensions/sandbox/blaxel/mounts.py:420-430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/blaxel/mounts.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68d4a45e5cc01328df597387becf72ca3511c8810ed83830e6826037a6b3882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/agents/extensions/sandbox/blaxel/sandbox.py:852-862 | src/agents/extensions/sandbox/daytona/sandbox.py:714-724 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/extensions/sandbox/blaxel/sandbox.py:852\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba991c2d3ca6ea0e6d55320b7f90d757401de939e39fb7116901ade2adb3fb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/agents/sandbox/capabilities/tools/shell_tool.py:192-202 | src/agents/sandbox/capabilities/tools/view_image.py:101-111 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/sandbox/capabilities/tools/shell_tool.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a765dbb0f028b8f23ce61b1d80292061053face6d70f308f948c3d380336e0c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/agents/sandbox/sandboxes/unix_local.py:1313-1323 | src/agents/sandbox/sandboxes/unix_local.py:1348-1358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/sandbox/sandboxes/unix_local.py"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d879c766c9359e5aa542098bcf2c5f9395dba64b13ccea77ddba1489655e50d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/agents/sandbox/session/archive_extraction.py:120-130 | src/agents/sandbox/session/archive_extraction.py:186-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/sandbox/session/archive_extraction.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfcb02b4ef136d7eedd13363c178a67d325721fa8c9c420f7831f2016bc91cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/sandbox/docs/coding_task.py:84-93 | examples/sandbox/shared_session_workdirs.py:163-172 \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 \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/sandbox/docs/coding_task.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cabdfee13cb2e5c43ec4460130f278d96664dc78cd8fdfc26fce1c0d87412d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): integration_tests/_contract_state.py:192-201 | integration_tests/_contract_state.py:342-351 \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 \u0060integration_tests/_contract_state.py:192\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060integration_tests/_contract_state.py:191\u0060 calls \u0060get\u0060 and \u0060integration_tests/_contract_state.py:341\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":"integration_tests/_contract_state.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1d28f42ad5af6491b201be593d17e7a764dc4d40373c5d17d7e00a79e8b49c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/agents/extensions/sandbox/e2b/sandbox.py:99-108 | src/agents/extensions/sandbox/modal/sandbox.py:189-198 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/e2b/sandbox.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5b5bbe785c61f5d123f1df1750047c2eceb4a52d251d6887cffdb8e25a71cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 8): examples/sandbox/extensions/blaxel_runner.py:314-322 | examples/sandbox/extensions/blaxel_runner.py:410-416 | examples/sandbox/extensions/cloudflare_runner.py:360-366 | examples/sandbox/extensions/daytona/daytona_runner.py:141-149 | examples/sandbox/extensions/modal_runner.py:309-315 | examples/sandbox/extensions/vercel_runner.py:374-382 | examples/sandbox/tax_prep.py:142-148 | examples/sandbox/unix_local_runner.py:187-195 \u2014 there are 8 copies across 7 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 8 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/sandbox/extensions/blaxel_runner.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc045a1e47edf20a2d2abc6d6296191939520b4aa0caa0f816ae9ca5eff24fba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/agents/extensions/sandbox/cloudflare/sandbox.py:1078-1086 | src/agents/extensions/sandbox/e2b/sandbox.py:1298-1306 | src/agents/sandbox/sandboxes/docker.py:1374-1382 | src/agents/sandbox/sandboxes/unix_local.py:696-704 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/extensions/sandbox/cloudflare/sandbox.py:1078\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":"src/agents/extensions/sandbox/cloudflare/sandbox.py"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"718158d11d61c16c130f558075fc1b7e4922d5fa0c4b658ace78b1e029c69be8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): examples/memory/file_hitl_example.py:90-98 | examples/memory/memory_session_hitl_example.py:80-90 | examples/memory/openai_session_hitl_example.py:78-88 \u2014 before extracting anything, compare \u0060examples/memory/memory_session_hitl_example.py\u0060 and \u0060examples/memory/openai_session_hitl_example.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 79 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":"examples/memory/file_hitl_example.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be88dd1fde335d01935646ef93aaa03fca4ba2888bf903cc6ef1fb236de14f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/agents/extensions/sandbox/blaxel/sandbox.py:160-168 | src/agents/extensions/sandbox/daytona/sandbox.py:101-109 | src/agents/extensions/sandbox/modal/sandbox.py:123-131 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d868b6f2e1eed4c1d6dcc1dcfb52b12bf0196e1ca4318327f41024eccd35b74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): src/agents/extensions/sandbox/blaxel/sandbox.py:564-571 | src/agents/extensions/sandbox/daytona/sandbox.py:1013-1020 | src/agents/extensions/sandbox/e2b/sandbox.py:1166-1174 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/agents/extensions/sandbox/blaxel/sandbox.py:560\u0060 calls \u0060posix_path_as_path\u0060, \u0060coerce_posix_path\u0060 and \u0060src/agents/extensions/sandbox/e2b/sandbox.py:1162\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":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc306477b617240a88a5e92775eeb3ce878dcf4e748a7c248ac326db8a3c7841"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): integration_tests/_contract_support.py:61-70 | integration_tests/_contract_support.py:155-164 \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":"integration_tests/_contract_support.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"106abee68f04dbcc1ad64ada41d44e2319977e1b8dd3bcce013f775363b45300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 14): examples/sandbox/basic.py:195-202 | examples/sandbox/docker/docker_runner.py:126-133 | examples/sandbox/extensions/blaxel_runner.py:190-197 | examples/sandbox/extensions/blaxel_runner.py:316-323 | examples/sandbox/extensions/blaxel_runner.py:412-417 | examples/sandbox/extensions/cloudflare_runner.py:253-260 | examples/sandbox/extensions/cloudflare_runner.py:362-367 | examples/sandbox/extensions/daytona/daytona_runner.py:143-150 | examples/sandbox/extensions/e2b_runner.py:211-218 | examples/sandbox/extensions/modal_runner.py:311-316 | examples/sandbox/extensions/vercel_runner.py:376-383 | examples/sandbox/tax_prep.py:144-149 | examples/sandbox/unix_local_pty.py:108-115 | examples/sandbox/unix_local_runner.py:189-196 \u2014 there are 14 copies across 11 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 14 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/sandbox/extensions/e2b_runner.py:220\u0060 calls \u0060_rewrite_template_resolution_error\u0060 and \u0060examples/sandbox/extensions/blaxel_runner.py:324\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":"examples/sandbox/basic.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b1bd945140967317afbb05a204534998796be007c5731fd5ed2eee7a458996"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 6): examples/memory/dapr_session_example.py:201-207 | examples/memory/encrypted_session_example.py:80-86 | examples/memory/openai_session_example.py:60-67 | examples/memory/redis_session_example.py:94-100 | examples/memory/sqlalchemy_session_example.py:60-66 | examples/memory/sqlite_session_example.py:61-67 \u2014 before extracting anything, compare \u0060examples/memory/dapr_session_example.py\u0060 and \u0060examples/memory/redis_session_example.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 65 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/memory/redis_session_example.py:90\u0060 calls \u0060get_items\u0060 and \u0060examples/memory/encrypted_session_example.py:77\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":"examples/memory/dapr_session_example.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c33e5f9e130b167c9ece4872a2a2468c6ba1973d64c6f57e230cc56f6b9ae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): src/agents/extensions/sandbox/blaxel/sandbox.py:561-568 | src/agents/extensions/sandbox/cloudflare/sandbox.py:1373-1380 | src/agents/extensions/sandbox/daytona/sandbox.py:1010-1017 | src/agents/extensions/sandbox/e2b/sandbox.py:1163-1170 | src/agents/extensions/sandbox/modal/sandbox.py:1315-1322 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/agents/extensions/sandbox/blaxel/sandbox.py:560\u0060 calls \u0060posix_path_as_path\u0060, \u0060coerce_posix_path\u0060 and \u0060src/agents/extensions/sandbox/e2b/sandbox.py:1162\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":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41e2f5841bbab8ef4e7b65524b566e114c3ce9afb8ad46fd10a18eacdf077ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/financial_research_agent/printer.py:39-46 | examples/research_bot/printer.py:34-41 \u2014 \u0060examples/financial_research_agent/printer.py\u0060 and \u0060examples/research_bot/printer.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 8 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/financial_research_agent/printer.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd21741b4190ea615aec1baa3c22f12f7058934cb4daf349f1c681c2dd2fe351"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 3): examples/memory/advanced_sqlite_session_example.py:145-152 | examples/memory/advanced_sqlite_session_example.py:173-176 | examples/memory/advanced_sqlite_session_example.py:211-218 \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 \u0060examples/memory/advanced_sqlite_session_example.py:145\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, \u0060examples/memory/advanced_sqlite_session_example.py:209\u0060 calls \u0060get\u0060, \u0060str\u0060 and \u0060examples/memory/advanced_sqlite_session_example.py:173\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":"examples/memory/advanced_sqlite_session_example.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21fc91419d9c4d9fcf749b23465e01dfe2ad372914ffbc9886492083834b7f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): examples/sandbox/healthcare_support/data.py:27-33 | examples/sandbox/tutorials/misc.py:95-102 \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/sandbox/healthcare_support/data.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae729fe9175bedea0c0fc7fffe5e67fd3f267150759b4d1b318f02e6e58f1c79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/agents/extensions/sandbox/daytona/sandbox.py:1093-1100 | src/agents/extensions/sandbox/e2b/sandbox.py:1488-1495 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/daytona/sandbox.py"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"318ff9f067712d7523f8684f2915eff5bf0994eba121855782a22eda7ef00e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/agents/sandbox/entries/mounts/base.py:248-255 | src/agents/sandbox/entries/mounts/base.py:465-472 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/sandbox/entries/mounts/base.py:248\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/sandbox/entries/mounts/base.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3db3e3b5423717d5574613e6eaa4ae2fe60994dafc1a58b0ffa9f252ceb136a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/agents/sandbox/entries/mounts/patterns.py:841-847 | src/agents/sandbox/entries/mounts/patterns.py:908-915 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/agents/sandbox/entries/mounts/patterns.py:908\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/sandbox/entries/mounts/patterns.py"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03c6c70a34f069a9582d4bfa47d4b9a6bd075e629768f6b749dd52d8e6a22c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): examples/mcp/prompt_server/main.py:17-23 | examples/mcp/streamablehttp_custom_client_example/main.py:25-31 | examples/mcp/streamablehttp_example/main.py:17-23 \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. 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/mcp/prompt_server/main.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2c5e6f53eff7b198e3091facb59b3c78fbf83eadc40fa4adeb3b541adba14c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): src/agents/extensions/sandbox/blaxel/sandbox.py:744-749 | src/agents/extensions/sandbox/daytona/sandbox.py:1173-1178 | src/agents/extensions/sandbox/e2b/sandbox.py:1565-1571 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/agents/extensions/sandbox/e2b/sandbox.py:1564\u0060 calls \u0060posix_path_for_error\u0060 and \u0060src/agents/extensions/sandbox/blaxel/sandbox.py:743\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":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"02da979c651ef9b0580a03312142a89f24989202bf4a2610148d85ab86687308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/mcp/sse_example/main.py:17-23 | examples/mcp/sse_remote_example/main.py:21-27 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/mcp/sse_remote_example/main.py:17\u0060 calls \u0060getenv\u0060 and \u0060examples/mcp/sse_example/main.py:13\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":"examples/mcp/sse_example/main.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"178b4dc33b2f2b3baecd9e88f90489318de39288c60c24f10aac11ac80579562"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/agents/extensions/sandbox/modal/mounts.py:122-128 | src/agents/sandbox/entries/mounts/providers/s3.py:43-53 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/modal/mounts.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"086df1c65c0296eb3d2f7466bff1ad1bebd08615984df00e7f5bce2590988561"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): examples/sandbox/extensions/temporal/temporal_sandbox_tui.py:450-455 | examples/sandbox/extensions/temporal/temporal_sandbox_tui.py:1169-1174 \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/sandbox/extensions/temporal/temporal_sandbox_tui.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ea4ef7741eba27c3433524f7ed9b3a918bd9290e224935aef1015716c060b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/agents/sandbox/capabilities/memory.py:92-97 | src/agents/sandbox/memory/rollouts.py:53-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/sandbox/capabilities/memory.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3205c4e78fb9ac8b19e4bbde83d9c1ef929f10667897866e7b354499764231"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): integration_tests/_contract_surface.py:85-89 | integration_tests/_contract_surface.py:108-115 \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 \u0060integration_tests/_contract_surface.py:108\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":"integration_tests/_contract_surface.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d951bd6a3fa30e2eed443263df15778f2e543013673490c7c0866913660aedad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): examples/model_providers/any_llm_auto.py:25-45 | examples/model_providers/litellm_auto.py:28-49 \u2014 before extracting anything, compare \u0060examples/model_providers/any_llm_auto.py\u0060 and \u0060examples/model_providers/litellm_auto.py\u0060 as WHOLE FILES: 94% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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/model_providers/any_llm_auto.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6493a534fcd6d1df2f74ee24e40ad29ad44d8359f1e532a2eae4ed88293da4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): examples/basic/remote_image.py:9-27 | examples/basic/remote_pdf.py:9-27 \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":"examples/basic/remote_image.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4658e518bdc84a69e7b443df7dfa2f9b473212f38b5b2bbb6e96c7b8eb28fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): examples/memory/memory_session_hitl_example.py:27-46 | examples/memory/openai_session_hitl_example.py:27-46 \u2014 before extracting anything, compare \u0060examples/memory/memory_session_hitl_example.py\u0060 and \u0060examples/memory/openai_session_hitl_example.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 79 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":"examples/memory/memory_session_hitl_example.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69f9e02e61aaac989d633ee5627be8ea1a39f24f58c081c8d1fd43471f01c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/sandbox/docs/coding_task.py:72-80 | examples/sandbox/healthcare_support/workflow.py:215-222 \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/sandbox/docs/coding_task.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"706fb69c0e2ba70f92189d1feda44a4fbd56d8bd4ed0fe5dd5ddcbcacfc5327b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): examples/sandbox/extensions/blaxel_runner.py:126-130 | examples/sandbox/extensions/cloudflare_runner.py:209-213 | examples/sandbox/unix_local_pty.py:80-84 \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. 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/sandbox/extensions/blaxel_runner.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbeeeb7bbbfbc8baa6b85eeffb33e5304989f339990b6f79376b0029fcd08e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): examples/sandbox/extensions/cloudflare_runner.py:140-144 | examples/sandbox/extensions/modal_runner.py:153-157 | examples/sandbox/extensions/vercel_runner.py:109-113 \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":"examples/sandbox/extensions/cloudflare_runner.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f7dbc5c6f9544d95439f0241c523700d54232c62cd2a65c64d34ce4f18ba99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/tools/container_shell_inline_skill.py:43-50 | examples/tools/container_shell_skill_reference.py:33-40 \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":"examples/tools/container_shell_inline_skill.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b56cca4c81af58f07bb8b8a9133a4dfba192e8d357cdc5c831385059f4c78b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/agents/extensions/sandbox/blaxel/sandbox.py:939-944 | src/agents/extensions/sandbox/daytona/sandbox.py:887-892 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"74478b6eb36c2f23871cfe748f309a968b0cf4a4c7ab8eb51e5a74897294abbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): src/agents/extensions/sandbox/cloudflare/sandbox.py:1038-1045 | src/agents/extensions/sandbox/daytona/sandbox.py:901-908 | src/agents/extensions/sandbox/e2b/sandbox.py:1233-1240 | src/agents/sandbox/sandboxes/docker.py:1330-1337 | src/agents/sandbox/sandboxes/unix_local.py:655-662 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times. 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 \u0060entry\u0060 to \u0060_CloudflarePtyProcessEntry\u0060 in one and \u0060_DockerPtyProcessEntry\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":"src/agents/extensions/sandbox/cloudflare/sandbox.py"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e846e453953f57b0d90270419a7d1e50d5caa9dc154ce6e306f2db9011be39a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/agents/extensions/sandbox/cloudflare/sandbox.py:1261-1267 | src/agents/extensions/sandbox/e2b/sandbox.py:1110-1116 | src/agents/extensions/sandbox/modal/sandbox.py:968-974 | src/agents/sandbox/sandboxes/docker.py:1229-1235 | src/agents/sandbox/sandboxes/unix_local.py:579-585 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/cloudflare/sandbox.py"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"515f3d877ee5fcef3e6f4eeb2d1e5c31b700f6ff26fe5ca7d74c3929e01de8a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/agents/extensions/sandbox/daytona/sandbox.py:348-362 | src/agents/extensions/sandbox/vercel/sandbox.py:441-455 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/sandbox/daytona/sandbox.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae80f0224eee446ee97417f01ed21b57efb58f8215eca0d13b16a465ff2234dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/agents/sandbox/_mount_security.py:660-670 | src/agents/sandbox/entries/mounts/_redaction.py:13-23 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/sandbox/_mount_security.py"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"010304e0368f4da78924053eafee65d4d3abcf555414a76cc7f92151a0fdd817"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/agents/sandbox/capabilities/skills.py:549-553 | src/agents/sandbox/entries/artifacts.py:60-64 | src/agents/sandbox/manifest.py:276-280 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/sandbox/capabilities/skills.py"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"b068d900997b8c87b1a09906546416552cecf5410939e14bd364fb458fd9b497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/agents/sandbox/entries/artifacts.py:68-72 | src/agents/sandbox/manifest.py:284-288 \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 \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":"src/agents/sandbox/entries/artifacts.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1544cf4ed0dd3c668134c508188b730678566d6ccb3af0f2f4d445c604fe0150"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/mcp/sse_example/main.py:59-68 | examples/mcp/streamablehttp_example/main.py:59-68 \u2014 \u0060examples/mcp/sse_example/main.py\u0060 and \u0060examples/mcp/streamablehttp_example/main.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 3 separate duplicated blocks between them, totalling at least 39 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/mcp/sse_example/main.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"abaf9411f1f46a2452fdf692e5e7b3b949bfa0aa34bee28ff9944ae7c9cce2d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/model_providers/any_llm_provider.py:32-44 | examples/model_providers/litellm_provider.py:33-44 \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":"examples/model_providers/any_llm_provider.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"463636fe22e91540fb30e8fbf70e0958e0cb48fb562cc5a2ab0345fecea0ab56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/agents/sandbox/session/base_sandbox_session.py:586-593 | src/agents/sandbox/session/snapshot_lifecycle.py:198-205 \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":"src/agents/sandbox/session/base_sandbox_session.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87d08ba44a8be15f21d9eea59912c151bdb2376bfdf166e3525f0023c35a7fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): examples/sandbox/extensions/daytona/usaspending_text2sql/setup_db.py:597-601 | examples/sandbox/extensions/daytona/usaspending_text2sql/setup_db.py:690-694 \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/sandbox/extensions/daytona/usaspending_text2sql/setup_db.py"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"700981fd2dad75f1fb3c74f40ee2b97dfa2aff239ea41da07566bc38255495c6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BaseSandboxSession (LCOM4 4): BaseSandboxSession\u0027s methods fall into 4 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 4 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":"src/agents/sandbox/session/base_sandbox_session.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c65fe434b6cff4b26fd79d4969d69bf6ff95d84dba85471d0545f0bba8c476c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/run.py: src/agents/run.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 238 in AgentRunner._run_impl at line 629. 18 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/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":"src/agents/run.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"74928e6b70803f38af000e9010632f8e85e3d1784b5ada7c56cb989481ae668d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/run_internal/run_loop.py: src/agents/run_internal/run_loop.py changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 199 in run_loop.start_streaming at line 989. 19 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/run_internal/run_loop.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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"601fe68f3d38999985963dd91febbb13843a7d8b309d843cc47ad6f9426c7525"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/run_state.py: src/agents/run_state.py changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 115 in run_state._build_run_state_from_json at line 4186. 26 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/run_state.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":"src/agents/run_state.py"},"region":{"startLine":4186}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b70aa8de81eb26e56fb6a2299a6c82f1097b102dc99bce732701f447fc9259"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/run_internal/turn_resolution.py: src/agents/run_internal/turn_resolution.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 170 in turn_resolution.resolve_interrupted_turn at line 1387. 12 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/run_internal/turn_resolution.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":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4b6d71cee963bb44b1cf5f6ca65be76d8221c2c93ef9299732e257393b05e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/memory/openai_responses_compaction_session.py: src/agents/memory/openai_responses_compaction_session.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in OpenAIResponsesCompactionSession._run_compaction_locked at line 273. 16 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/memory/openai_responses_compaction_session.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":"src/agents/memory/openai_responses_compaction_session.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45c11dd330fc0d605547836e59d1b2845878237be450fc7f80b919997c30509"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/realtime/session.py: src/agents/realtime/session.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in RealtimeSession.on_event at line 412. 10 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/realtime/session.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":"src/agents/realtime/session.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fcb55d6b41bc2b420f13425eeda0d9b4c6c57227ede8abb1308538e06c224f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/run_internal/session_persistence.py: src/agents/run_internal/session_persistence.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in session_persistence.resume_pending_session_write at line 1446. 14 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/run_internal/session_persistence.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":"src/agents/run_internal/session_persistence.py"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"768f563b87fe455e0c94738d97c797fda08f5122a80d14ca6e21a48715c5ebf6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: integration_tests/_contract_support.py: integration_tests/_contract_support.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in _contract_support.build_released_api_contract at line 208. 5 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- integration_tests/_contract_support.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":"integration_tests/_contract_support.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e4a771c7368295d3191f455ac1bd3b53a26a70391ad7d2a7b7cb574b985b60"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/function_schema.py: src/agents/function_schema.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in function_schema.function_schema at line 321. 10 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/function_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":"src/agents/function_schema.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c1e64438b68955fe78da04107b12f9a222c8a20c9c651c7d73bbbc9a1bdc33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/models/openai_responses.py: src/agents/models/openai_responses.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Converter._convert_tool at line 2237. 10 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/models/openai_responses.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":"src/agents/models/openai_responses.py"},"region":{"startLine":2237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4447345133662679b429df40639bf867fd321474698dabbe37123811919f089b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/models/chatcmpl_stream_handler.py: src/agents/models/chatcmpl_stream_handler.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 129 in ChatCmplStreamHandler.handle_stream at line 603. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/models/chatcmpl_stream_handler.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":"src/agents/models/chatcmpl_stream_handler.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"122a47bd5996e8923753cc9286a2d845cdc34c6b4aba84e498a915556ec2edc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/models/chatcmpl_converter.py: src/agents/models/chatcmpl_converter.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in Converter.items_to_messages at line 559. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/models/chatcmpl_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":"src/agents/models/chatcmpl_converter.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"467b4faf6465bd6d909aed7cef8c6ecce0fce969a50fed1d358710ecbceef02c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/run_context.py: src/agents/run_context.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in RunContextWrapper.get_approval_status at line 1369. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/run_context.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":"src/agents/run_context.py"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"447f590b9078efbabbb63aebca1e07fe89ffc0b1ff86bef09c42943fd6ed9397"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/extensions/models/any_llm_model.py: src/agents/extensions/models/any_llm_model.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in AnyLLMModel._get_response_via_chat at line 584. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/extensions/models/any_llm_model.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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b5d9314cf736003b7563df8e89f9ff6dca4b78e0c80b2f80d79aeae74527eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/voice/models/openai_stt.py: src/agents/voice/models/openai_stt.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in OpenAISTTTranscriptionSession._handle_events at line 320. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/voice/models/openai_stt.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":"src/agents/voice/models/openai_stt.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf4b3e30959a984a0770795dd7592d09119ae0f254cf64f09edf62e23487a11"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/realtime/openai_realtime.py: src/agents/realtime/openai_realtime.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in OpenAIRealtimeWebSocketModel._interrupt_audio_playback at line 1044. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/realtime/openai_realtime.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":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d5e13d5ae58801375c81e27899d10dc12d56d6421a201d49f3dc6b8855261d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/result.py: src/agents/result.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in RunResultStreaming._check_errors at line 1172. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/result.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":"src/agents/result.py"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7607ff40cb93c3487508165b2306f62c6a73280c5fd0d6e627bad91496f7c275"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/mcp/server.py: src/agents/mcp/server.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in _MCPServerWithClientSession.list_tools at line 1474. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/mcp/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":"src/agents/mcp/server.py"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee49b888152603c772a42a3c05fd99b554f363e6de34bb1df9b18812054d5f0d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/tracing/processors.py: src/agents/tracing/processors.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in BackendSpanExporter._export_with_deadline at line 134. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/tracing/processors.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":"src/agents/tracing/processors.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1363bed01e498ed7c6e0ba2a3f1462baeb833b3df219392669438191c6281c36"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/models/openai_chatcompletions.py: src/agents/models/openai_chatcompletions.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in OpenAIChatCompletionsModel._fetch_response at line 605. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/models/openai_chatcompletions.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":"src/agents/models/openai_chatcompletions.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b36c08c98fd5791c9667619faf0cce5e0caf29621341b6a5501f13d96069821"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/run_internal/tool_execution.py: src/agents/run_internal/tool_execution.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in _FunctionToolBatchExecutor._maybe_execute_tool_approval at line 1875. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/run_internal/tool_execution.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":"src/agents/run_internal/tool_execution.py"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd198fce94dd846830e9e266679f455129dbd6ad53b589ed6257da508d1f27d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/sandbox/sandboxes/docker.py: src/agents/sandbox/sandboxes/docker.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DockerSandboxClient.resume at line 1759. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/sandbox/sandboxes/docker.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":"src/agents/sandbox/sandboxes/docker.py"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee17c9d261d4ce7e88773ba5c9bd15162b260a06a7cc4c5234e24a73973d52c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/extensions/models/litellm_model.py: src/agents/extensions/models/litellm_model.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in LitellmModel.get_response at line 219. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/extensions/models/litellm_model.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":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0261eddf16591ade1ae245e768b1b9c540b5e1b3b28b980b167c49fa5984403"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/strict_schema.py: src/agents/strict_schema.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in strict_schema._ensure_strict_json_schema at line 156. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/strict_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":"src/agents/strict_schema.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eb2e5578aceaef8c9a2ff818651465db16800354564480bdcaf06d3588aa72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/run_internal/model_retry.py: src/agents/run_internal/model_retry.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in model_retry.stream_response_with_retry at line 692. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/run_internal/model_retry.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":"src/agents/run_internal/model_retry.py"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"929ade8e42b034b7d3ad3a935925be94ac734579d4f1117a445de269eab6486f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/extensions/experimental/codex/exec.py: src/agents/extensions/experimental/codex/exec.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in CodexExec.run at line 61. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/extensions/experimental/codex/exec.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":"src/agents/extensions/experimental/codex/exec.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f4e73d087cf6563ec36dd9c44903f43bbe32203c512e51a395469327142afd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/extensions/sandbox/cloudflare/sandbox.py: src/agents/extensions/sandbox/cloudflare/sandbox.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in CloudflareSandboxSession.pty_exec_start at line 1110. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/extensions/sandbox/cloudflare/sandbox.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":"src/agents/extensions/sandbox/cloudflare/sandbox.py"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"47433f04908b797facffb3b437c56994eb41a02172a0b32536b02ba022b4b1d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/voice/result.py: src/agents/voice/result.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in StreamedAudioResult._stream_audio at line 143. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/voice/result.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":"src/agents/voice/result.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca21a1bc2ad4e4d20dd8788d0dbf58799200c804e804097820822fa344c2772"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/testing/model.py: src/agents/testing/model.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in model._stream_events_for_step at line 781. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/testing/model.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":"src/agents/testing/model.py"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff207699a793c44ae199a484bdf2b390ba5ef1b62e88c49f6b3120228cf4ffc3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/sandbox/util/tar_utils.py: src/agents/sandbox/util/tar_utils.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in tar_utils.strip_tar_member_prefix 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/sandbox/util/tar_utils.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/sandbox/util/tar_utils.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99219b52504333153fdff35ae1db813ca96b6d667051d86f958c4d9f21f6020"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/sandbox/sandboxes/docker_removal.py: src/agents/sandbox/sandboxes/docker_removal.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DockerRemovalService._bind_new at line 279. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/sandbox/sandboxes/docker_removal.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":"src/agents/sandbox/sandboxes/docker_removal.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cb950e7fe13fa6c1b0a9453b61f725bb74362ce1917e14b07f08035cea50bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/agents/extensions/visualization.py: src/agents/extensions/visualization.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in visualization._get_all_nodes at line 194. 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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/extensions/visualization.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":"src/agents/extensions/visualization.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e154ed9ead31be60eb2e8387202f21d6a5524d863cd4c080331234545c7a23"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/extensions/memory/advanced_sqlite_session.py: src/agents/extensions/memory/advanced_sqlite_session.py changed 8 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is AdvancedSQLiteSession._extract_tool_name at line 996), 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(sessions): reject blank SQLite branch names (#5179)\u201D; \u201Cfix(extensions): keep SQLite usage capture off the event loop (#4981)\u201D; \u201Cfix(sessions): match literal Unicode content in AdvancedSQLiteSession (#5143)\u201D; \u201Cfix(extensions): keep the current branch when a forced delete_branch fails (#5081)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/extensions/memory/advanced_sqlite_session.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":"src/agents/extensions/memory/advanced_sqlite_session.py"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"4add4b51f25daff12d1688c2b2337151dba2ba77d45da87af54f023fa3dc1ab2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/run_internal/agent_runner_helpers.py: src/agents/run_internal/agent_runner_helpers.py changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is agent_runner_helpers.attach_usage_to_span at line 132), 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: preserve tool outputs after callback failures (#5318)\u201D; \u201Cfix(sessions): persist deferred approval history across resumes (#4828)\u201D; \u201Cfix(sessions): recover fresh streamed handoffs after session append failures (#4835)\u201D; \u201Cfix(core): deliver tool-not-found output on server-managed resume (#4947)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/run_internal/agent_runner_helpers.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":"src/agents/run_internal/agent_runner_helpers.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"357988a09237b2847198d9e98b870f5cff10c6a8bb0ea1a57c50cbb051dc1ffe"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/sandbox/session/base_sandbox_session.py: src/agents/sandbox/session/base_sandbox_session.py changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is BaseSandboxSession._validate_remote_path_access at line 834), 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: keep the file when apply_patch does a case-only rename (#4890)\u201D; \u201Cfix(sandbox): preserve symlink targets during snapshot restore (#5208)\u201D; \u201Cfix(sandbox): scope exclusive Add File creation to UnixLocal (#4893)\u201D; \u201Cfix(sandbox): enforce grants during recursive removal (#5206)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/sandbox/session/base_sandbox_session.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":"src/agents/sandbox/session/base_sandbox_session.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"da60cd75c465b6c7611fee5ad39e141c373f9b77c0bb75a64ee1028a4b68e5bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/items.py: src/agents/items.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 13 (its worst body is ItemHelpers.tool_call_output_item at line 845), 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: preserve wire aliases when replaying Responses items (#5638)\u201D; \u201Cfix(deps): bump daytona from 0.155.0 to 0.226.1 (#5487)\u201D; \u201Cfix: preserve completed tool outputs when a sibling fails (#5332)\u201D; \u201Cfix(core): strip created_by when replaying RunItems as input (#4568)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/items.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":"src/agents/items.py"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92593918bba6eced5caf8f9ef21afbe6bc51712f3bf510bd744800de0969337"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/memory/sqlite_session.py: src/agents/memory/sqlite_session.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 11 (its worst body is SQLiteSession.close at line 538), 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(memory): preserve encrypted SQLite history on wrong-key pops (#5083)\u201D; \u201Cfix(sessions): close SQLiteSession connections owned by exited worker threads (#5090)\u201D; \u201Cfix(extensions): preserve filtered history during automatic compaction (#5103)\u201D; \u201Cfix(sessions): settle conversation deletion before propagating cancellation (#4790)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/memory/sqlite_session.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":"src/agents/memory/sqlite_session.py"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71da1b7d5c874a9ad16be385a74e45bc3a6a6cb73720defa9f0486fac67b3e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/extensions/memory/encrypt_session.py: src/agents/extensions/memory/encrypt_session.py changed 6 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 15 (its worst body is EncryptedSession.get_items at line 346), 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(memory): require encrypted envelopes for session history (#5204)\u201D; \u201Cfix(memory): preserve encrypted SQLite history on wrong-key pops (#5083)\u201D; \u201Cfix(extensions): preserve filtered history during automatic compaction (#5103)\u201D; \u201Cfix(sessions): preserve Session transformations during generation tracking (#4917)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/extensions/memory/encrypt_session.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":"src/agents/extensions/memory/encrypt_session.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"780068eed359a8ff6561d2323652b96a58efca94564e845579ad2e660e3a1d78"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/sandbox/capabilities/tools/apply_patch_tool.py: src/agents/sandbox/capabilities/tools/apply_patch_tool.py changed 5 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 11 (its worst body is apply_patch_tool._parse_apply_patch_input at line 337), 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: preserve embedded separators in sandbox patches (#5365)\u201D; \u201Cfix(sandbox): check sandbox apply_patch approval scope (#5146)\u201D; \u201Cfix(sandbox): require apply_patch update hunks (#4470)\u201D; \u201Cfix(sandbox): normalize apply_patch paths as POSIX (#4437)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/sandbox/capabilities/tools/apply_patch_tool.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":"src/agents/sandbox/capabilities/tools/apply_patch_tool.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"432ea4c1cbefef315c498c2504a5b746f316a510288b97a83cdf7fde8553e0ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/usage.py: src/agents/usage.py changed 4 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 15 (its worst body is Usage.add at line 257), 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(deps): bump daytona from 0.155.0 to 0.226.1 (#5487)\u201D; \u201Cfix: normalize nullable token counts in remaining provider paths (#5260)\u201D; \u201Cfix(core): detach aggregated request usage entries (#4519)\u201D; \u201Cfix(core): count Responses requests without usage (#4453)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/usage.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":"src/agents/usage.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ad6efe362721475d068901ddf4dccf3e6d62f4fa051e980965912029b43153"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/util/_asyncio_tasks.py: src/agents/util/_asyncio_tasks.py changed 4 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 14 (its worst body is _asyncio_tasks.gather_with_cancel at line 97), 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: stop native tool queues during function failure cleanup (#5446)\u201D; \u201Cfix: preserve completed tool outputs when a sibling fails (#5332)\u201D; \u201Cfix: avoid awaiting cleanup during coroutine closure (#5163)\u201D; \u201Cfix(core): bound agent tool streaming callback backlogs (#5106)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/util/_asyncio_tasks.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":"src/agents/util/_asyncio_tasks.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"142006a3e8bf08c2e4459d35800ad756b9e2852b1960a0665bade04790ec4bdd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/run_internal/run_steps.py: src/agents/run_internal/run_steps.py changed 4 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 2 (its worst body is SingleStepResult.generated_items at line 242), 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: preserve tool outputs after callback failures (#5318)\u201D; \u201Cfix(sessions): persist deferred approval history across resumes (#4828)\u201D; \u201Cfix(mcp): bind resumed MCP calls to their original recipients (#5119)\u201D; \u201Cfix(core): align conditional approvals with validated tool arguments (#5066)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/run_internal/run_steps.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":"src/agents/run_internal/run_steps.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afb939c1bd9755e240e22d77ddc082e040fa2723aa7ddb21da4024f498dde50"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/sandbox/sandboxes/_unix_local_file_ops.py: src/agents/sandbox/sandboxes/_unix_local_file_ops.py changed 4 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 _FileOps._open_regular_file at line 63), 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: keep the file when apply_patch does a case-only rename (#4890)\u201D; \u201Cfix(sandbox): scope exclusive Add File creation to UnixLocal (#4893)\u201D; \u201Cfix(sandbox): add opt-in bounded workspace outbox reads (#5128)\u201D; \u201Cfix(sandbox): reject special files in shared UnixLocal file I/O (#5177)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/sandbox/sandboxes/_unix_local_file_ops.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":"src/agents/sandbox/sandboxes/_unix_local_file_ops.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d359cc356818c4fcaff50977e5cc82387a4badb8f71c0fc3f19919f5f17f0ed4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/exceptions.py: src/agents/exceptions.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is exceptions._prepare_data_redacted_error at line 192), 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: preserve completed tool outputs when a sibling fails (#5332)\u201D; \u201Cfix: preserve caller-owned exceptions during sandbox redaction (#5367)\u201D; \u201Cfix: max-turn handler session semantics (#4412)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/exceptions.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":"src/agents/exceptions.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b12286f2ac1074a91074b9678c4096bbc8348077c2e675fd737a5e84136fd8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/sandbox/capabilities/tools/shell_tool.py: src/agents/sandbox/capabilities/tools/shell_tool.py changed 4 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 7 (its worst body is ExecCommandTool._run at line 226), 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: recover from invalid sandbox tool arguments (#5321)\u201D; \u201Cfix(sandbox): preserve workdir for shell command lists (#4915)\u201D; \u201Cfix(sandbox): keep model paths POSIX-normalized (#4416)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/sandbox/capabilities/tools/shell_tool.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":"src/agents/sandbox/capabilities/tools/shell_tool.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5bf3f7f9e3bf47c55d9345a1d043ad60ea38bb0efcb417ef3578c56b9b8919"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/sandbox/capabilities/tools/view_image.py: src/agents/sandbox/capabilities/tools/view_image.py changed 4 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 view_image._detect_image_mime_type at line 24), 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: recover from invalid sandbox tool arguments (#5321)\u201D; \u201Cfix(sandbox): validate view_image raster content (#4462)\u201D; \u201Cfix(sandbox): honor view_image extra path grants (#4417)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/sandbox/capabilities/tools/view_image.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":"src/agents/sandbox/capabilities/tools/view_image.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cf7d9947c7ad6eaed61ca3d5e829185a3d7f0719dec9ccf7bc1d62ebc3f2a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/sandbox/apply_patch.py: src/agents/sandbox/apply_patch.py changed 4 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 WorkspaceEditor.apply_operation at line 68), 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: keep the file when apply_patch does a case-only rename (#4890)\u201D; \u201Cfix(sandbox): scope exclusive Add File creation to UnixLocal (#4893)\u201D; \u201Cfix(sandbox): normalize apply_patch paths as POSIX (#4437)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/sandbox/apply_patch.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":"src/agents/sandbox/apply_patch.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"330e2c2836a429b84d26827951adb39624a7142dbe6611453a18550844be912b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/run_internal/guardrails.py: src/agents/run_internal/guardrails.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 12 (its worst body is guardrails.run_input_guardrails_with_queue at line 69), 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: report completed input guardrails when a tripwire fires (#5634)\u201D; \u201Cfix: preserve completed tool outputs when a sibling fails (#5332)\u201D; \u201Cfix: preserve streamed cancellation and pending guardrail cleanup (#5224)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/run_internal/guardrails.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":"src/agents/run_internal/guardrails.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb8a4c12271fe6dec903d10bc4e5b277914a136f5ee7c8d3b104c59f8554546"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/run_internal/tool_actions.py: src/agents/run_internal/tool_actions.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 13 (its worst body is ComputerAction._execute_action_and_capture at line 226), 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: preserve empty structured shell results (#5423)\u201D; \u201Cfix: preserve completed tool outputs when a sibling fails (#5332)\u201D; \u201Cfix(core): scope function tool approvals to their owning agent (#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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/run_internal/tool_actions.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":"src/agents/run_internal/tool_actions.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"4957ca955b9da582d3d2e3c9bcb0dd1cf357e9926738acfdbcda272687d57f0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/memory/openai_conversations_session.py: src/agents/memory/openai_conversations_session.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 7 (its worst body is OpenAIConversationsSession._get_items at line 92), 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: batch OpenAI conversation session writes within the API limit (#5334)\u201D; \u201Cfix(sessions): do not forward session limit as Conversations page size (#4961)\u201D; \u201Cfix(sessions): settle conversation deletion before propagating cancellation (#4790)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/memory/openai_conversations_session.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":"src/agents/memory/openai_conversations_session.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c866cb3452d6387f8d0ed8bf12e6cc65798d804156b0112554d9b5e2b4a6293"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/voice/models/openai_model_provider.py: src/agents/voice/models/openai_model_provider.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 5 (its worst body is OpenAIVoiceModelProvider._get_client at line 82), 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: use gpt-transcribe as the default voice STT model (#5276)\u201D; \u201Cfix(core/voice): honor OpenAI provider options over default clients (#4530)\u201D; \u201Cfix(voice) reject ignored explicit-client options (#4527)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/voice/models/openai_model_provider.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":"src/agents/voice/models/openai_model_provider.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ac2ad531a2ae8ca4d82bcd9a6cda75972d8b148cbe0a40ec854b5d7042af19"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/sandbox/session/sandbox_session.py: src/agents/sandbox/session/sandbox_session.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 15 (its worst body is SandboxSession._apply_trace_finish_data at line 333), 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: keep the file when apply_patch does a case-only rename (#4890)\u201D; \u201Cfix(sandbox): scope exclusive Add File creation to UnixLocal (#4893)\u201D; \u201Cfix(sandbox): add opt-in bounded workspace outbox reads (#5128)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/sandbox/session/sandbox_session.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":"src/agents/sandbox/session/sandbox_session.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d8878759c7ba028a5d09629c52e3649ee1994623d1e8842f1fc0a12569587d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/agents/extensions/sandbox/blaxel/sandbox.py: src/agents/extensions/sandbox/blaxel/sandbox.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 15 (its worst body is BlaxelSandboxSession._exec_internal at line 590), 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(sandbox): add opt-in bounded workspace outbox reads (#5128)\u201D; \u201Cfix(sandbox): settle PTY output before cleanup (#4738)\u201D; \u201Cfix(sandbox): clean up PTY startup cancellation (#4750)\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-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 13:01:18 \u002B00:00\u0027 --until=\u00272026-11-11 13:01:18 \u002B00:00\u0027 --full-history --no-merges -- src/agents/extensions/sandbox/blaxel/sandbox.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":"src/agents/extensions/sandbox/blaxel/sandbox.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e234f746e6b0c78b5c32e531351e6e52b93ebf2cc945e59a3a9a04133b597b8"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 14 significant file(s) lose their only recent owner: src/agents/extensions/experimental/codex/codex_tool.py, src/agents/extensions/experimental/hosted_multi_agent/model.py, integration_tests/_contract_validation.py, src/agents/_tool_identity.py, integration_tests/_contract_support.py, src/agents/agent_tool_state.py, src/agents/run_internal/error_handlers.py, src/agents/logger.py (\u002B6 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d41e5b76630fcf94c027ed66018811fd9801b0725ac050be3cffa141d6f5ad41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: revisit ResponseIncludable | str if ResponseIncludable covers more cases \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/model_settings.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6ad28841dfc910f70441568d546e2d4e4be8d376df4fa299ae2e9b3122c201"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (sdcoffey) env val from secret store \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/sandbox/manifest.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f168b3820165e8200bc58bd9987d6b6b76d256c4b18e82feafbf30754da3c680"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: thinking about using proxy instead of direct http call \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/sandbox/session/sinks.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bb34f47947661f2f38bf0768423b40cf615335669d725b791daf9a23269ac7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Replace this fixed cap with 70% of the phase-one model\u0027s effective \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/sandbox/memory/phase_one.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6956fcf24ad3e26eeaa30c0e8e58816fe6471d481a91e9edc6f6ce7308eb823"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Persist Agent.as_tool() owner identity so replacement before RunState \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2da0c555558e00c6a79031ad07d60298373755f05ba512174d29bad38cf9c72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (rm) Add history audio storage config \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/config.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed06a6908482c4be9d733d30d96c1fdb0845b568215d050a73bf94dbf6864e01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove this once generated Realtime server event models accept custom voice objects. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0b96a8c70dde673334203c95dff726f89f209944ddccddd4ebbdc3c70738a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (rm) remove \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c05a4c49d41d4ac27097af5bd0544405e2e278fcf1b433533ed42d4682d83c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (rm) Add support for audio storage config \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/session.py"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebfaaee8d9922991b4ebe36d983c4eca464564ba3dff871a04a0b75cafc10bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (rm) Remove this cast, it\u0027s wrong \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/realtime/session.py"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ce98b8231fe856a64ee24e94342818fe237ca450f9ba0dc19494070d237152"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: enable mkdocs search plugin to seamlessly work with i18n plugin \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":"docs/scripts/translate_docs.py"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c7b35fe9055696ec7526def973ba1eb44f462ab5184e38b75fab410dae36ef"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (142632 LoC, 1357 module-visible types across 89 directories) overshoots its size bounds. 1 of 2 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":"a959f7d4bed573b00398e804d165b3a332df0fc95818333927ff74194904b6dd"},"properties":{"commitSha":"334c40e5fb58a80cdd9b54da9608a389e4e85682"}},{"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":"e17ecd539406ca42a0395ae3b821778acd1d06e1d6507986b2771dbb434c3e72"},"properties":{"commitSha":"334c40e5fb58a80cdd9b54da9608a389e4e85682"}},{"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":"a2781fa8fc5c6d89a9f9a1c050ac53fe77005c6072f36490daccad730fc18ccb"},"properties":{"commitSha":"334c40e5fb58a80cdd9b54da9608a389e4e85682"}},{"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":"cfde830162b290dab33c6461818622dd2c22fbf34b6e8782209b5dc1adb7ab60"},"properties":{"commitSha":"334c40e5fb58a80cdd9b54da9608a389e4e85682"}},{"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":"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":"b771042665ea6d71aba941b992633db9e3ebce965a1208744b92e0d8d7a5a906"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"26aa9c7eda97d5d36cc2900cc44dd7a337068d8bbe81683c2581f17c0862a6f9"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"b99d04797a0141a6f6daf44d284976c5ed3477b15851b8c13a1558394d36cd84"},"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":"5ab5fffeb283dcc47a213ea8e1f05b8c5d3f7708853b67c25e051e455a2be3b9"},"taxa":[{"id":"CWE-276","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"08aa6c00587fbfd25f8499e35675830d768660e972cade079126f8470f185895"},"taxa":[{"id":"CWE-276","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"d0697d6176d5f0a8e86277ec12e20b7194339b428693075e225f2cd93a5b2f78"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"f05900b588d01c567f547dd64cd38ce020eae00386f83a2454d8fa7d4ac7711f"},"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":"7b5e980e7b7946be9431458b76e6fd682fcdf75193486606850b7e7d1fb34210"},"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":"219fd3ed8a87cfe15239d13fa73d394bd46391e9f77849dfc7dd3b0b0243bd27"},"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":"16f846c35b89220212aa9d20fd9c744858aa7cfd32e230d63b4b8ce17b180264"},"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":"5ff5c3649518a2b1f4db36e9de763e66e4044d6bcb5f463b48b27d39734a7a1a"},"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":"253b1c7621e5ebc6c96c53f077cb5f04f7e5a3064e8ebabcb105180a94fcc2c2"},"properties":{"dependency":{"package":"litellm","version":"1.83.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-2598","PYSEC-2026-2599","PYSEC-2026-2600","PYSEC-2026-2601","PYSEC-2026-2602","PYSEC-2026-3476","PYSEC-2026-3477","PYSEC-2026-3479","PYSEC-2026-3861","PYSEC-2026-388","PYSEC-2026-391","PYSEC-2026-4066","PYSEC-2026-4067","PYSEC-2026-4070"],"reachability":{"kind":"production","file":"src/agents/extensions/models/litellm_model.py","line":17}}}},{"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":"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":"1cd5edb55bbbb627ab2f3a485a1a65f2b7d9e94a298b940d9d0c04d4a4bc987f"},"properties":{"dependency":{"package":"filelock","version":"4.0.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[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":"3b3561b3bde269e229d36f78bc14d6fa7c55db65722539ac2080da513f44a218"},"properties":{"dependency":{"package":"opentelemetry-api","version":"1.45.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/tracing/create.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66561a2dac136b83b489e21c73da17eba80ca75de9211c7b7b087126efd4976"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 6 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: src/agents/tool_guardrails.py, src/agents/realtime/events.py, src/agents/realtime/items.py, src/agents/tracing/processor_interface.py, src/agents/repl.py, src/agents/prompts.py (7 orphaned of 145 analysed files in total, 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; 145 of the 208 production source files in this repository met that bar). 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":"src/agents/tool_guardrails.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7c1e2a0df64842ed1ac308533df41a192b307ad59fe126bcb4078ddfa6bc67"}},{"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":"src/agents/realtime/events.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"189a391cb98c0dec3e7182002b50df9a9f28691ddba8d338636fa14ea422f7ac"}},{"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":"src/agents/realtime/items.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb77598d0cde8d35aa0a40a20cea52d87ff5fd2535576920f7aeb0f04ca7bcb7"}},{"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":"src/agents/tracing/processor_interface.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86886559c8066347893f967e3524106fbb4cf240f7b140ab881916d357b285b1"}},{"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":"src/agents/repl.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09e19e9f7a74b9e42bac677ecd7c8acbce8f80eb3f2a912f9669812dad2ca82"}},{"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":"src/agents/prompts.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ac9a269f109b889428196c60c8d402db8f85613c2693103f442f5d39e7b195"}},{"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":"eb304bfca793660f2a5eee9182f22e635edca03862cf56f54fce93b4fea01e78"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"DM6","level":"error","message":{"text":"Domain fused to persistence infrastructure: OpenAIHostedMultiAgentModel: \u0060OpenAIHostedMultiAgentModel\u0060 is a domain concept fused to persistence ON ITS OWN DECLARATION (Django/SQLAlchemy \u2014 \u0060models.Model\u0060/\u0060db.Model\u0060) \u2014 the domain entity IS the ORM row (active-record), and it carries domain behaviour on the persistence type. A schema/persistence change ripples straight into the domain. Keep the ORM/table mapping on a boundary data-model \u002B a mapper, and the domain entity framework-free (map row\u2194domain through a repository)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/extensions/experimental/hosted_multi_agent/model.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"2866b14430a46feaf7334cbd7c11a64be4f881dcb573c97112b5d9f833c3c122"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_debug.DONT_LOG_MODEL_DATA or _debug.DONT_LOG_TOOL_DATA\u0060 appears character-identically in 6 files \u2014 src/agents/logger.py, src/agents/mcp/util.py, src/agents/run_internal/session_persistence.py, src/agents/tracing/processors.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":"src/agents/logger.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2843d0773eac6e2f984a9f0beecc8c434965e4bedc3c45af548758d723ed865e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060approval_status is None and evaluation.outcome == \u0022invoke\u0022\u0060 appears character-identically in 2 files \u2014 src/agents/realtime/session.py, src/agents/run_internal/tool_execution.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":"src/agents/realtime/session.py"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06191575c0a997ddd620bde1eba47209f584d4a4cdac20eed50ad7b98e5f654"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060call_identity is not None and call_identity[1] is None\u0060 appears character-identically in 2 files \u2014 src/agents/run_context.py, src/agents/run_internal/tool_planning.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":"src/agents/run_context.py"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbae62b7dd36545f48a13e2edf8200e7f649b9d39fa896ecf2e8f8bef8f9b828"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060call_identity is not None and call_identity[1] is not None\u0060 appears character-identically in 2 files \u2014 src/agents/run_internal/tool_planning.py, src/agents/run_state.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":"src/agents/run_internal/tool_planning.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"02422ea14ff31d1c4cb70e37e821580c74699f9f4690198ae3c3001b98da0e02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate.exists() or candidate.is_symlink()\u0060 appears character-identically in 2 files \u2014 .agents/skills/implementation-final-review/scripts/review_state.py, .agents/skills/implementation-kickoff/scripts/validate_handoff.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":".agents/skills/implementation-final-review/scripts/review_state.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8369ca84c9c3b3f296ced0e7c8e618ba0b97b20499db7a425ac501bc1eb50f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060context.run_config is None or context.run_config.trace_include_sensitive_data\u0060 appears character-identically in 2 files \u2014 src/agents/mcp/util.py, src/agents/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":"src/agents/mcp/util.py"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc773b07d7072f0e48d384a1e0d4de0d084543c47d1f12592968a752b68d7f67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060conversation_id is not None or previous_response_id is not None or auto_previous_response_id\u0060 appears character-identically in 2 files \u2014 src/agents/run.py, src/agents/run_internal/run_loop.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":"src/agents/run.py"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa520e512e3b0db300dbf2fcfdfc5753a9e5476295e3ff751a2c78c8abdb4c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current is not None and id(current) not in seen\u0060 appears character-identically in 2 files \u2014 src/agents/models/_retry_runtime.py, src/agents/models/openai_responses.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":"src/agents/models/_retry_runtime.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25930570cc0823ee9446218c069edf26254ec8d895a757556d96dd6afd3d614"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current.__cause__ or current.__context__\u0060 appears character-identically in 3 files \u2014 src/agents/models/_retry_runtime.py, src/agents/models/openai_responses.py, src/agents/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":"src/agents/models/_retry_runtime.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"12349015963d2bbf86857596796eb8bd7ef34e602d83479b7382bfdfa96708ff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expired_end != prefix[-1][0] or len(prefix) \u003C limit\u0060 appears character-identically in 2 files \u2014 src/agents/extensions/memory/async_sqlite_session.py, src/agents/memory/sqlite_session.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":"src/agents/extensions/memory/async_sqlite_session.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"700433e37d0ada4bf1541573519ff8009e9bbeca416ecd5ff9b0f16162c839ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060extra_body is not None and not _is_openai_omitted_value(extra_body)\u0060 appears character-identically in 2 files \u2014 src/agents/extensions/experimental/hosted_multi_agent/model.py, src/agents/models/openai_responses.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":"src/agents/extensions/experimental/hosted_multi_agent/model.py"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"e161c79a508bf8bdaca9b767cf19aee3d2f3569fbb27fc4a4730049babc33d3c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060extra_query is not None and not _is_openai_omitted_value(extra_query)\u0060 appears character-identically in 2 files \u2014 src/agents/extensions/experimental/hosted_multi_agent/model.py, src/agents/models/_openai_websocket.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":"src/agents/extensions/experimental/hosted_multi_agent/model.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdcab42519b601349e01ee23a1a8f69c110f6055e387f19681d6dac8028540f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first_choice is not None and first_choice.logprobs is not None and first_choice.logprobs.content\u0060 appears character-identically in 2 files \u2014 src/agents/extensions/models/any_llm_model.py, src/agents/models/openai_chatcompletions.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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7262d12c5fee928c55265fa8cd880f7b8a98bf328c9298736a394a2d9dea2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getattr(raw, \u0022call_id\u0022, None) or getattr(raw, \u0022id\u0022, None)\u0060 appears character-identically in 2 files \u2014 src/agents/run_internal/agent_runner_helpers.py, src/agents/run_internal/tool_planning.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":"src/agents/run_internal/agent_runner_helpers.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd92cc83f7cc4609bf6fd8bbcca3681c312dc70961b1062ec12ee36634f03fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060google_fields and isinstance(google_fields, dict)\u0060 appears character-identically in 3 files \u2014 src/agents/extensions/models/litellm_model.py, src/agents/models/chatcmpl_converter.py, src/agents/models/chatcmpl_stream_handler.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":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"7169076701165440c5c4edf70b3d64d5cdecf976a98edf70228a390ea3996c1e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input_type is not None and on_handoff is None\u0060 appears character-identically in 2 files \u2014 src/agents/handoffs/__init__.py, src/agents/realtime/handoffs.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":"src/agents/handoffs/__init__.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f1e7641743cce76ff712d482e5e29ff9e7305871c370a17478b2eb0ec3c2d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input_type is not None and type_adapter is not None\u0060 appears character-identically in 2 files \u2014 src/agents/handoffs/__init__.py, src/agents/realtime/handoffs.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":"src/agents/handoffs/__init__.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"3276d4cc93018d16b52e79376fd194e8f525dc0fb3c84ffe0ea50e0dd63fadc5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_http_status_error(error) or is_http_request_error(error)\u0060 appears character-identically in 2 files \u2014 src/agents/mcp/_compat.py, src/agents/mcp/server.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":"src/agents/mcp/_compat.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f3c90db19821e7a48e81f21a93140c560aef05f08d19f0abeaa681111ab63c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_resumed_state and run_state is not None\u0060 appears character-identically in 2 files \u2014 src/agents/run.py, src/agents/run_internal/run_loop.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":"src/agents/run.py"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebce6c1f0a51537f5ba79a4abab764b2d57ac670212d4fd35d54c3fa0b7381a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(candidate, str) and candidate\u0060 appears character-identically in 2 files \u2014 src/agents/_tool_invocation.py, src/agents/run_internal/approvals.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":"src/agents/_tool_invocation.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07d2755bcc8fd7be9520e07a78bc3f4d5b9b1a9554e1019cdd24b6737962410"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(item, dict) and item.get(\u0022role\u0022) == \u0022user\u0022\u0060 appears character-identically in 2 files \u2014 src/agents/extensions/memory/advanced_sqlite_session.py, src/agents/extensions/tool_output_trimmer.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":"src/agents/extensions/memory/advanced_sqlite_session.py"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0659a47e7f8a6f92c86f683685768b3cd50831bd3068e9799ae3b212b72132"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(item, dict) and item.get(\u0022type\u0022) == \u0022compaction\u0022\u0060 appears character-identically in 2 files \u2014 src/agents/memory/openai_responses_compaction_session.py, src/agents/models/chatcmpl_converter.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":"src/agents/memory/openai_responses_compaction_session.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0d9ce903d7aa491cd0fbc61eccfe89f8660030fc2f61b3f2b919ab0e822f67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(item, dict) and item.get(\u0022type\u0022) == \u0022function_call\u0022\u0060 appears character-identically in 2 files \u2014 src/agents/extensions/tool_output_trimmer.py, src/agents/models/chatcmpl_converter.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":"src/agents/extensions/tool_output_trimmer.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b6a26e0d2e99fdb561b928f44c24751898b06c30c9d0b150a0b6f8dd1421d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(item, dict) and item.get(\u0022type\u0022) == \u0022reasoning\u0022\u0060 appears character-identically in 2 files \u2014 src/agents/memory/openai_responses_compaction_session.py, src/agents/models/chatcmpl_converter.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":"src/agents/memory/openai_responses_compaction_session.py"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"663f27123adea988faffa6c1745c201ea98f63869180cea59837b8fe5406efd9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(tool_name, str) and tool_name\u0060 appears character-identically in 3 files \u2014 src/agents/_tool_identity.py, src/agents/agent.py, src/agents/run_internal/tool_execution.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":"src/agents/_tool_identity.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6a551693f7b9e288d0d8f31d1048f4a99ccf0eccb7d77f6c20cb59268683b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(tool_namespace, str) and tool_namespace\u0060 appears character-identically in 2 files \u2014 src/agents/_tool_identity.py, src/agents/run_context.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":"src/agents/_tool_identity.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d8637eabc571ac87e4c3b4cd50238752cfed72aaac3ea0274d54f2213feeec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(turn_result.next_step, NextStepFinalOutput) and turn_result.has_recovered_tool_outputs\u0060 appears character-identically in 2 files \u2014 src/agents/run.py, src/agents/run_internal/run_loop.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":"src/agents/run.py"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc2a1a2191bd9acba1d1ad1f52b0af428ca515e8bff8299ad919f33942abc0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mapping.get(\u0022type\u0022) == \u0022hosted_tool_call\u0022 and isinstance(provider_data, Mapping) and provider_data.get(\u0022type\u0022) == \u0022mcp_approval_request\u0022\u0060 appears character-identically in 2 files \u2014 src/agents/_tool_invocation.py, src/agents/run_context.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":"src/agents/_tool_invocation.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf629254fb8ccd10de090059f1a13a7ead8948e8aa64da2f25fca27ac45584e1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060max_turns is not None and current_turn \u003E max_turns\u0060 appears character-identically in 2 files \u2014 src/agents/run.py, src/agents/run_internal/run_loop.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":"src/agents/run.py"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdd9d3d7ecdd1009c3983d8a80e355a3335f4744dfe33f03c4e4acc0b868ff0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message is not None and first_choice is not None and first_choice.finish_reason == \u0022content_filter\u0022 and not message.content and not message.\u2026\u0060 appears character-identically in 2 files \u2014 src/agents/extensions/models/any_llm_model.py, src/agents/models/openai_chatcompletions.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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3dff8b051cbab90894ca0103eefb7098e08310ddc5d1d9e8ec00345fd06a52e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message is not None and hasattr(response, \u0022id\u0022)\u0060 appears character-identically in 3 files \u2014 src/agents/extensions/models/any_llm_model.py, src/agents/extensions/models/litellm_model.py, src/agents/models/openai_chatcompletions.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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2519a3c38dc598ab7072c658b7537ac3cd2e12179636756a4defd07b4ee9f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060model_settings.reasoning is not None and model_settings.reasoning.effort is not None\u0060 appears character-identically in 2 files \u2014 src/agents/extensions/models/any_llm_model.py, src/agents/extensions/models/litellm_model.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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2915f63958783d5ea30db2cd74627cab373bb9f3e741b5bf27c9d898c01f167"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060model_settings.top_logprobs is not None and \u0022logprobs\u0022 not in extra_kwargs\u0060 appears character-identically in 2 files \u2014 src/agents/extensions/models/any_llm_model.py, src/agents/extensions/models/litellm_model.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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f0c33f51bfdd3d2807e86a4872f820b3f042a6b1cda833d5deb404e5a585c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nested_owner or (nested_state, interruption)\u0060 appears character-identically in 2 files \u2014 src/agents/agent.py, src/agents/run_internal/turn_resolution.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":"src/agents/agent.py"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e4a16c9905e86520db7f49dca5188ee26a11e69bf744e0a27db743dc0d9b26"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(call_id, str) or not call_id\u0060 appears character-identically in 5 files \u2014 src/agents/extensions/experimental/hosted_multi_agent/model.py, src/agents/run_context.py, src/agents/run_internal/tool_actions.py, src/agents/run_internal/turn_resolution.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":"src/agents/extensions/experimental/hosted_multi_agent/model.py"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"da347a313203eaaca05b695efe960c7b7654777ad3656b97608cd5f5e7e77049"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(error, asyncio.CancelledError) or _is_tool_local_cancellation(error)\u0060 appears character-identically in 2 files \u2014 src/agents/run.py, src/agents/run_internal/turn_resolution.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":"src/agents/run.py"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7295a7d519a783b67c598b8a248699feda8667fd2a51f9d75aa840165bdc73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(name, str) or not name.strip()\u0060 appears character-identically in 2 files \u2014 src/agents/extensions/experimental/codex/codex_tool.py, src/agents/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":"src/agents/extensions/experimental/codex/codex_tool.py"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca2465c28c988a0a6fd056f64bf7dde6bf94f32645f7795667987d23e89d5bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(tool_name, str) or not tool_name\u0060 appears character-identically in 3 files \u2014 src/agents/_tool_identity.py, src/agents/run_context.py, src/agents/run_state.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":"src/agents/_tool_identity.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"180290fb9dee16efccafd0b1b532c93b1ba465a137be4e9a434c0bfdadb8f23a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output_schema is None or output_schema.is_plain_text()\u0060 appears character-identically in 3 files \u2014 src/agents/models/openai_responses.py, src/agents/run_internal/error_handlers.py, src/agents/run_internal/turn_resolution.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":"src/agents/models/openai_responses.py"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c5827dc1dc6e96ab25f56c7908f1fe3721296eaf8dd8f769b9f793925f4a0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060override_fields is None or field.name in override_fields\u0060 appears character-identically in 2 files \u2014 src/agents/memory/session_settings.py, src/agents/model_settings.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":"src/agents/memory/session_settings.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4a666ca8ebcc19a9324456c291dc1263409154cf073211bd21b22639c0e0dc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pending_input_admission_items and run_state is not None\u0060 appears character-identically in 2 files \u2014 src/agents/run.py, src/agents/run_internal/run_loop.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":"src/agents/run.py"},"region":{"startLine":1995}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ef74c4905716008d28214236efbbc161f320737fabad0341fa2c79c100c288"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pending_run_result and getattr(pending_run_result, \u0022interruptions\u0022, None)\u0060 appears character-identically in 2 files \u2014 src/agents/agent.py, src/agents/run_internal/turn_resolution.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":"src/agents/agent.py"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"75aac02239b40de79d98fb77beb4be6d9fabc9331818aca7b92d0af6eb465599"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060record.invocation_type != invocation_type or record.approval_scope != approval_scope or record.fingerprint != fingerprint\u0060 appears character-identically in 2 files \u2014 src/agents/run_context.py, src/agents/run_internal/turn_resolution.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":"src/agents/run_context.py"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbbe67bed3d8e7bf03ca9aa3181fab174bc3ff56460228d9415aec30b6711ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.previous_response_id or request.conversation_id\u0060 appears character-identically in 2 files \u2014 src/agents/models/_openai_retry.py, src/agents/models/openai_responses.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":"src/agents/models/_openai_retry.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb1888cad17d25120a9a0f41f86585a247f681312763334e431b6b14cb989d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.choices and len(response.choices) \u003E 0\u0060 appears character-identically in 2 files \u2014 src/agents/extensions/models/litellm_model.py, src/agents/models/openai_chatcompletions.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":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a8a9142ee827d4684308e18e7ccccd96169e818bbab61ae8efc9b17af0d98c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060responses_tool_choice is None or responses_tool_choice is omit\u0060 appears character-identically in 3 files \u2014 src/agents/extensions/models/any_llm_model.py, src/agents/extensions/models/litellm_model.py, src/agents/models/openai_chatcompletions.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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"0514e849f08b0f1b45fcbd4519fcdd62a302eedb885c498f44c89c960063edfa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060role == \u0022assistant\u0022 and original_message.get(\u0022tool_calls\u0022)\u0060 appears character-identically in 2 files \u2014 src/agents/extensions/models/any_llm_model.py, src/agents/extensions/models/litellm_model.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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e3dacc98e1d72429df6117674d3046f4473d47bc648cbe8fe1d4d3425fbc26"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run_state is None or not isinstance(run_state._current_step, NextStepInterruption)\u0060 appears character-identically in 3 files \u2014 src/agents/run_internal/run_loop.py, src/agents/run_internal/session_persistence.py, src/agents/run_internal/turn_resolution.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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7eb23ba43ec0f83d17172fd475364d54a6d4c6d892309c0000d4aa7437b457"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run_state is None or server_conversation_tracker is None or not pending_input_admission_items\u0060 appears character-identically in 2 files \u2014 src/agents/run.py, src/agents/run_internal/run_loop.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":"src/agents/run.py"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"2add97b0894a6ce386ec041847fc04d0dccac10b8e9df19b0c0a5a3132d54008"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run_state is not None and _has_output_guardrails(current_agent, run_config)\u0060 appears character-identically in 2 files \u2014 src/agents/run.py, src/agents/run_internal/run_loop.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":"src/agents/run.py"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30f0d58287701b64e795c0762bdf429a2ec589bcb35ab3a11e05a5579af7920"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run_state is not None and run_state._current_agent is not None\u0060 appears character-identically in 2 files \u2014 src/agents/run.py, src/agents/run_internal/run_loop.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":"src/agents/run.py"},"region":{"startLine":2744}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a644622302a5f9ef29411bef6e13fb7b51872c32bb09f1d4c6c52cbf454eb8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run_state is not None and run_state._current_turn_persisted_item_count \u003E 0\u0060 appears character-identically in 2 files \u2014 src/agents/run.py, src/agents/run_internal/agent_runner_helpers.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":"src/agents/run.py"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccef4e90e67653ebf5c73786c51c9c8e51b4c94771606575538ed4c64528d07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run_state is not None and run_state._starting_agent is not None\u0060 appears character-identically in 3 files \u2014 src/agents/run.py, src/agents/run_internal/agent_runner_helpers.py, src/agents/run_internal/run_loop.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":"src/agents/run.py"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00a4efc2124efa9ede3e31c46b0b16d39ac23764deeed3199d02da0188fe099"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.instructions is not None and not isinstance(self.instructions, str) and not callable(self.instructions)\u0060 appears character-identically in 2 files \u2014 src/agents/agent.py, src/agents/realtime/agent.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":"src/agents/agent.py"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30560fbe1af83998f3a198d24a9cd8e660b12ea18691a8c12ef5c1f78154dbb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session is None or server_conversation_tracker is not None\u0060 appears character-identically in 2 files \u2014 src/agents/run_internal/run_loop.py, src/agents/run_internal/session_persistence.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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c6cc4ecf718f1d59dbfc55344fdec48f7e5913e17c57f17308f2e9a59b385c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session is not None and server_conversation_tracker is None\u0060 appears character-identically in 2 files \u2014 src/agents/run.py, src/agents/run_internal/session_persistence.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":"src/agents/run.py"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e82575204ed010825f5271b39fcd10b11db6203872824481014d20d933b2b16"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stream and model_settings.include_usage is not None\u0060 appears character-identically in 2 files \u2014 src/agents/extensions/models/any_llm_model.py, src/agents/extensions/models/litellm_model.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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4569b71f03b0d9e6871fcef28d3f4fa34e71423a5e9c61f8165d5a0e55d252"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tool_description_override or Handoff.default_tool_description(agent)\u0060 appears character-identically in 2 files \u2014 src/agents/handoffs/__init__.py, src/agents/realtime/handoffs.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":"src/agents/handoffs/__init__.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"720be97dce41ee4e46f7a1494de986fd45cef80648f0ad57ccf787c67c8636a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tool_name_override or Handoff.default_tool_name(agent)\u0060 appears character-identically in 2 files \u2014 src/agents/handoffs/__init__.py, src/agents/realtime/handoffs.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":"src/agents/handoffs/__init__.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3528a51bb673c6a7a65e0d540c36c8320e21d87022ee3e65508d0c2d6f573c5c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tool_qualified_name(tool_name, tool_namespace) or tool_name or \u0022unknown_tool\u0022\u0060 appears character-identically in 2 files \u2014 src/agents/_tool_identity.py, src/agents/run_context.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":"src/agents/_tool_identity.py"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"131eb040cb238142405aa5f5065d2343f6e0daf8f227617f2593b442c67f0ecc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tool_trace_name(self.tool_name, self.tool_namespace) or self.tool_name\u0060 appears character-identically in 2 files \u2014 src/agents/items.py, src/agents/tool_context.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":"src/agents/items.py"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"501378a6650571965348a038d6c6e99c14b18047ffaa44389fdc24bd51551c37"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value is omit or isinstance(value, NotGiven)\u0060 appears character-identically in 2 files \u2014 src/agents/extensions/models/any_llm_model.py, src/agents/extensions/models/litellm_model.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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f07e899bf31cb9ecce7fc27b2778e9306868a58d9cb2fd8ec20413c78ffcde4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060arguments_unchanged\u0060 is public, takes a document from its caller (line 111) and hands it to \u0060_same_json\u0060, which calls itself at line 164 (\u0060_same_json\u0060) with a piece of \u0060left\u0060 (and at line 167) \u2014 and nowhere in \u0060_same_json\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_same_json\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/_function_tool_arguments.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"239c72fe51eff1f9975ab85306f3d1832224e699714cbb9370391a9cb430f839"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060from_json\u0060 is public, takes a document from its caller (line 2445) and hands it to \u0060_validate_run_state_json_value\u0060, which calls itself at line 2571 (\u0060_validate_run_state_json_value\u0060) with a piece of \u0060value\u0060 (and at line 2575) \u2014 and nowhere in \u0060_validate_run_state_json_value\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_validate_run_state_json_value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/run_state.py"},"region":{"startLine":2571}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e2f5eea0dfe1ed77b9326627c6caa5e934956101088997282819f88dba4acf"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060ensure_strict_json_schema\u0060 is public, takes a document from its caller (line 116) and hands it to \u0060_json_values_equal\u0060, which calls itself at line 519 (\u0060_json_values_equal\u0060) with a piece of \u0060left\u0060 (and at line 526) \u2014 and nowhere in \u0060_json_values_equal\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_json_values_equal\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/strict_schema.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b28b7a924b82c5358a4005983dfb05c0d2ed3f71f52d5b0bcc84e5b0b12d91a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060resolve_openai_harness_id_for_model_provider\u0060 is public, takes a document from its caller (line 65) and hands it to \u0060_harness_id_from_model_provider\u0060, which calls itself at line 103 (\u0060_harness_id_from_model_provider\u0060) with a piece of \u0060model_provider\u0060 \u2014 and nowhere in \u0060_harness_id_from_model_provider\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_harness_id_from_model_provider\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/agents/models/openai_agent_registration.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf884fdc5334d1646f564f605ab4ee433a0a54f57253887f22c8b408606246d9"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 2056 is called with an argument built by \u0060[item.type for item in items_to_save_turn]\u0060 (line 2058), 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":"src/agents/run.py"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7940995f2030a938d282c76db9a07ed27dbd0f7f94e431b518dab5f7a9bac15"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 2553 is called with an argument built by \u0060[id(i) for i in filtered.input]\u0060 (line 2556), 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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":2553}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff5e13fd5e0a6499e495436fd7d89cf1c0280506365416e32e1dfd9b3b3e4e6"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 280 is called with an argument built by \u0060json.dumps(message.model_dump(), indent = 2, ensure_ascii = False)\u0060 (line 282), 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":"src/agents/models/openai_chatcompletions.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a438b9df69cdcca3753486f75f621c3f6c402378f5b02dcc07c02e96610a82"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 626 is called with an argument built by \u0060x.model_dump()\u0060 (line 629), 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":"src/agents/models/openai_responses.py"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fb1c28f4c793aca04af892487510c17d7e0ae82859e107a9caac265656d072"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 427 is called with an argument built by \u0060item.model_dump()\u0060 (line 430), 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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f491a6aef372d7ebed5fd2d5d8193dc19901307b0025d15f6bd7fc179da46780"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 636 is called with an argument built by \u0060json.dumps(message.model_dump(), indent = 2, ensure_ascii = False)\u0060 (line 638), 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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd2ce04249805cf7e54a538cbb0c4e800b991fcd3ce8265f694e475514ad99b"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 898 is called with an argument built by \u0060json.dumps(converted_messages, indent = 2, ensure_ascii = False)\u0060 (line 902), 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":"src/agents/extensions/models/any_llm_model.py"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd7751fd9ff8dd6bc3573f3b765c1315e573f43279239f60f73b7dbb98404b7"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 274 is called with an argument built by \u0060json.dumps(message.model_dump(), indent = 2, ensure_ascii = False)\u0060 (line 276), 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":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c8a14185c94691e5cb3d549ec3c36e3d6df78b97aa787a5e5a351164f895e8"}},{"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":"src/agents/_tool_identity.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1364e9c7aefc01a701728635ad5b2a3b33bbbc91d3ec095e4ad8ce820a8ee5"}},{"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":"src/agents/_tool_identity.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ee70fbf487bb9f82eb080ecd420f29a2919e0a5eab3a497d234854a20a31ea"}},{"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":"src/agents/agent_tool_state.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60fb64f508b28b29fb227e8ad6be77fe2450876c03b61a1b0192ab7ad894eeb"}},{"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":"src/agents/agent_tool_state.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"38930742911fa8c5795ac37da91a0df3a72280c8b2160c0e93613cf38f658ca8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except BaseException\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":"src/agents/exceptions.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"57afbe5cce90e1d1e1dada1806766ca8f9fd4438ca54c38cf68bf198c1969574"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except BaseException\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":"src/agents/exceptions.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"06350082bf2730388bcc6e95a1bf5a017f3c84d549c735734591919f6842d65a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except BaseException\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":"src/agents/exceptions.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ae998f4d4ac01e350b0a56ef70330e2ad166af035650ee4fdb163e9a933401"}},{"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":"src/agents/exceptions.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6626d573f767b37fce2ed2bcc312d2747bd34b76183168a28dd530dc9737cad"}},{"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":"src/agents/exceptions.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"637994b79ae9ed339af2397d153aa626cb78fe75e85e6e896a47614a734ece39"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except BaseException\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":"src/agents/exceptions.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b617d16074ac264ede5cb0901f2e18fa74f3a27c30729ba261d342e65d1cdfb"}},{"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":"src/agents/exceptions.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8bc7504fb5bddded97c6927bca13389669a1b5728af08fe93bb8238dd46e53"}},{"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":"src/agents/logger.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaa4185fd137907e2c423a49755b548723d5509092867d608b50632e8f5644e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except BaseException\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":"src/agents/run.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1ff11ae3459e161fa1beb96ebffef7589df1f087305b5b547302902056142b"}},{"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":"src/agents/run.py"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9de66755e5cdd6d41a61772d916d9e8dbb3a505659dc8e609d8c5c9a6385e9"}},{"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":"src/agents/run.py"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d0a80e49db07e5632086935af7f95ac9b51c5d8aa3d25b5d07b32c1ae4a6a1"}},{"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":"src/agents/run_context.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"045fa79f0487023279966a029ce4fe64aa078d87d04a2aa99cac9c49e7a3a210"}},{"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":"src/agents/run_state.py"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bd12cc7c00d67a69a1365c13af490532e292d2b7fd5169159094a1793a6c4b"}},{"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":"src/agents/run_state.py"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c749bdc74782827cd1050c8f06768338d6a506936273c441aa7484fbd1bc21de"}},{"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":"src/agents/run_state.py"},"region":{"startLine":2833}}}],"partialFingerprints":{"codehealthFindingId/v1":"c249e238928cfb86d918735237617fb85d7494ee6ea5aa83591788a8688803bc"}},{"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":"src/agents/run_state.py"},"region":{"startLine":3363}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b6aeeb58b923853a828db2f92577a2ccfaeb589c3ad7f591dc06e17d83ba56"}},{"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":"src/agents/run_state.py"},"region":{"startLine":3386}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e698a46b684e5ac743648dc86da0d39475b78953e03ec89f9d632057badfd7"}},{"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":"src/agents/run_state.py"},"region":{"startLine":3444}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece3dbb82b888c7227efe36f8b221b1c6a719487afd4d3ac04e6d16633000614"}},{"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":"src/agents/run_state.py"},"region":{"startLine":3656}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d61602643b49cf8e27499e95ca99a4d5ba10ed0df935860598f091650960f6"}},{"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":"src/agents/run_state.py"},"region":{"startLine":3662}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e99cdc01e1e34b1faf96cb7925922e456a2a4c7ae1561cabca7f229e4e6b34"}},{"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":"src/agents/run_state.py"},"region":{"startLine":3670}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bad5038187fec86809c5624c772ba7620117b38a8e70a396ca967ea06f07e1"}},{"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":"src/agents/run_state.py"},"region":{"startLine":3855}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a8893d8d512b65cc59bf04f2c230013c5e3777d46d227f2b666081bacb5d42"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except BaseException\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":"src/agents/run_state.py"},"region":{"startLine":5678}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b20094441c6816e4bae4da3d61fb1c6c1ec6a4b18ed195a0d1637abb74d5185"}},{"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":"src/agents/tool.py"},"region":{"startLine":2243}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b916e984e6d2057d182cf22a239bf3559d7b689b8db17f588f844da9883ed68"}},{"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":"src/agents/util/_json.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcaffc354fb1bfdedb747deedd11b6787d13b2ebcee2ebc5614aacc9122eda01"}},{"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":"src/agents/testing/model.py"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"9160596101830ba0d5a8ed25a67ac9868cdec653938811d8345405ef86cfb001"}},{"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":"src/agents/run_internal/agent_runner_helpers.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bd3018b33dd8ccd912bd172a49ee601afa4c818e5c6065aa83391814b1060d"}},{"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":"src/agents/run_internal/agent_runner_helpers.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6f0e37825da1dadc47c96c1418ba36537c4fd07d9edc852e7a96a75c3e3d58"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except BaseException\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":"src/agents/run_internal/blocked_output.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f426a53199f0ff0c8a690ab2b7ed27e6290a0be6910dd35aa7d856931d4270e1"}},{"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":"src/agents/run_internal/blocked_output.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c145d643eaa723afd1a551146b6bc1f89d477df5560dd0c3e15518abb52b3b38"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except BaseException\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":"src/agents/run_internal/blocked_output.py"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d0d1a3d43fa66fa3e25accfc4a246f65c78b98e4516f54b59a69f261f3472e"}},{"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":"src/agents/run_internal/blocked_output.py"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"82861e171927f89f8d28a1ebf727cbf2dbad2548b31b36bdb2907e7fb2edd394"}},{"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":"src/agents/run_internal/blocked_output.py"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb35e0086c560d0d95fc731a03e86fa651e8723ce4685c63948170ab611cb637"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except BaseException\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":"src/agents/run_internal/error_handlers.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b405b77c09bf0d8fe7e02e0e475cfa7c805e014a17248c5103727c958c3d630"}},{"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":"src/agents/run_internal/error_handlers.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc7d00b752d2ed18bdfc354b00727f020fa787bac80ef1bf17ddd800b318dbd"}},{"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":"src/agents/run_internal/items.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62d45e54f024371df0e18ab36cafaaf801bd0ccdf9df4398a70a68c85469baa"}},{"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":"src/agents/run_internal/items.py"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1edc777fb635697cc8fc721e6b3064e986cde4026436104d8d430a328edd965"}},{"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":"src/agents/run_internal/items.py"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5350a8cb0ed86a768c9fa038537b52ecadacc0dbb96fd32c71caf08fd33c54c"}},{"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":"src/agents/run_internal/items.py"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed88dcf6305f5889721007aadc90e4af1e2e39998818cd869663605b6fde6a2"}},{"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":"src/agents/run_internal/items.py"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1149394b9709085e704e0b1f4e9f3fac3a48aaaf1d2d7e467823144187fa3bb"}},{"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":"src/agents/run_internal/items.py"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"25145de2255b61c827c29a7561346f30ccfc8a71cf7b87bd85cf967b733f006d"}},{"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":"src/agents/run_internal/items.py"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38dc8f255c3c07291d24b731c8a417043b5c9ccff3b3c6c9b27830724ee0ee6"}},{"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":"src/agents/run_internal/oai_conversation.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"575fbe9bd73b39860ad71dd5a10c0ec4f7c0fde14509cefdbf9030d97d331ddc"}},{"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":"src/agents/run_internal/oai_conversation.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7267877cd3a62d6849a526479f8e10631731d9903d9e4e4eab9c26d30735a6"}},{"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":"src/agents/run_internal/run_grouping.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"52288220f92ca984acdc600083edd4df3ac78b6b5954f49ecb6ebe93af10241e"}},{"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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9b24223ff3f178b26d696d3adcb8d674401503a3616eee5504197ce3810121"}},{"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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"064aa3c1c4930b6f03961e3f2f0104f02ee8d3d9348997489748924f45665394"}},{"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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25d08747dcfab9f8e53e41f02cb43d6d6f9af4aa54696e7a397702d49eac8fa"}},{"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":"src/agents/run_internal/run_loop.py"},"region":{"startLine":2839}}}],"partialFingerprints":{"codehealthFindingId/v1":"2971502be1386002ae883f5df06f9c6f17f4285b43eb5a5276f75d93817d3ffe"}},{"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":"src/agents/run_internal/tool_planning.py"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"4587634033f6bfee2c226b38fe80622ebc65eb4b32ce91e5907c57e77e65a8b0"}},{"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":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0da4e6c674d3b0003194458899ec30cedc7c7d8d8cfb4bee6900c8a1273095"}},{"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":"src/agents/run_internal/turn_resolution.py"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ff0d765f1920c71948b795bc63274643c7184b7f7cbf6a5707a93a28ba1d5b"}},{"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":"src/agents/realtime/openai_realtime.py"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84cd78fe049dae3857e4284a80e88b517c6fefd8f2848d858c778d6de5efe2b"}},{"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":"src/agents/realtime/session.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d0da4a10b0f10797006bf17b7d600cea0995bb889e674f3d64026fd1b8ed1f"}},{"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":"src/agents/models/openai_responses.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"5844676af0c0c1cff4dc0da88f2666b17c01df8a184c93d6266790183c3b4793"}},{"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":"src/agents/models/openai_responses.py"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb385d809bf4c56785f49164fc53fb34e49e8c42e3b4e99cd3932fa0c6ca435c"}},{"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":"src/agents/models/openai_responses.py"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4fe5d83007ae97ddb67d399c04fb8a9d10b0aae8e7927ad1d0648e30d54831"}},{"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":"src/agents/memory/session.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c38fb843598419b571663945d3a6fb1e256a10666e9cd644602a5a792ce4b9"}},{"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":"src/agents/memory/session.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc1ecbd5cc2ddd15cd0b077467ba24cadf2da205c99c885927cc5aefab6a14e"}},{"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":"src/agents/memory/session.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bff478411982c955e4ebdd4a0553b8bd238f80a698c8a119cb9f7846a3cdec2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except BaseException\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":"src/agents/memory/sqlite_session.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec2562d72ea0ab86ff13682f6341870e7d8bb14c777c999ae00098638f95228"}},{"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":"src/agents/mcp/server.py"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f4a3725218e7738cacc18603516d6eb2f9f8b32d5ccab7fa6590400116b94b"}},{"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":"src/agents/mcp/server.py"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c364e448ed4461e46725fa3342cd0c69eab5a1e813ca83b280e1f8dbee12ddd"}},{"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":"src/agents/mcp/server.py"},"region":{"startLine":2551}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5040b0031221d6cf244ed41e57fe13653c367192a2505acc928c0dfb88a2b8"}},{"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":"src/agents/mcp/util.py"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"f682b91bfbc03704ac242e29d85644ea70d3699ac794f940bcedd4083fc5bf7c"}},{"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":"src/agents/extensions/models/litellm_model.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1f580d73e2eeee4b96e1974922b8c73781eea9d76c2033307a92fba3cf630e"}},{"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":"src/agents/extensions/memory/advanced_sqlite_session.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0a5d10995e049eb360401c0522c90d5a170e1333643e8e5581e158b421b06a"}},{"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":"src/agents/extensions/memory/advanced_sqlite_session.py"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"313a40297ef38056ae47d95a9971ddd187a6b4343fee03dbc416a0b4c38ea2b0"}},{"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":"src/agents/extensions/memory/async_sqlite_session.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0a774e59a1943aa579eca79faeab7ba23e1f56f5327cc355d606a0dd09a15d"}},{"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":"src/agents/extensions/memory/async_sqlite_session.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99e6ad4f3845b72f9cc81acd7d59d6b3df71c5f8cf8ccc57f81ec6f9df4e3f1"}},{"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":"src/agents/extensions/memory/dapr_session.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a466d7cf8ee854476c33bdd7aa17887cf714cb4e30981be730249e5379b43c"}},{"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":"src/agents/extensions/memory/encrypt_session.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"10af88ca0b94aca90684bc545b1540c7e5e2a9e31d836549e162ed192947f2ca"}},{"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":"src/agents/extensions/memory/mongodb_session.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7366484b532522d654df992fddf2999c5f471dec90aa0f01ae83d86446ad803b"}},{"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":"src/agents/extensions/memory/mongodb_session.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"463e95ae572362158dbff5a7ccb644bd2f2bba77253aef445324a9d32db32162"}},{"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":"src/agents/extensions/memory/mongodb_session.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"404910cc007639ff0be6dcc77c1ed009033feef1d7392232d598ccbf4eab2ba0"}},{"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":"src/agents/extensions/memory/mongodb_session.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cb6750063555c46eb7058841919dd422d72bc0ccafeab94c1b39bdab32f77a"}},{"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":"src/agents/extensions/memory/mongodb_session.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df34efb6c5ec95efe838f53ff62f420b1da81bf48aae248418240a47d78c543"}},{"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":"src/agents/extensions/memory/redis_session.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ddfac5764c963cdc3a0e94e2f448b5075ca95e885cd415983e91694dc988df"}},{"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":"src/agents/extensions/memory/redis_session.py"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b1d6b7a823b645c4304e7570f6feb355c8e99ffe292c1c9380b2d55357b6ec"}},{"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":"src/agents/extensions/experimental/codex/codex_tool.py"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"57450e6aa750b692231d85a694902502892f2c2152b10d711fe8d8b7694ee93d"}},{"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":"src/agents/extensions/experimental/codex/codex_tool.py"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f166182fdd3f16024a0cb13e2f06d4a861afec65f723bceca89cfa101916e6"}},{"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":"src/agents/extensions/experimental/codex/output_schema_file.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f11131f0423762e432389355348b3bb1e030dc75b7293a3948da14206ad33d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060git_last_commit_timestamp\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. 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":"docs/scripts/translate_docs.py"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b84c0688f5bbd8c1268c4082e221f4885fe471f9bb302bcb4f3ada90453222b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_daytona_exception_types\u0060 swallows every exception into \u0060return ()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. 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":"src/agents/extensions/sandbox/daytona/sandbox.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3083f517a5f0422da630bb91acfeaf8b94b57fc5cc8da1e58cfa3ca9f137c67a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_e2b_exception_types\u0060 swallows every exception into \u0060return ()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. 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":"src/agents/extensions/sandbox/e2b/sandbox.py"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4a44eb6124f2eeddfd192e962573f4ec86e8e924a2fbb30b48291779337d94"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_modal_exception_types\u0060 swallows every exception into \u0060return ()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. 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":"src/agents/extensions/sandbox/modal/sandbox.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d39cf3e6ac0dc0bd94f4c5a933aad835016def940f54156df6a6e3fd03ccb8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060sanitize_url_for_trace\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":"src/agents/models/_trace.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fa8957d635222aec93c14ee3efea4dff620ff4257c252a28ab243612792a33"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_data_free_tool_output_guardrail_results\u0060 swallows every exception into \u0060return ()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. 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":"src/agents/run_internal/blocked_output.py"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51add0949dcf2ece931570c0830d80f8e320b364082939fc048a927ea6819f5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_supported_keyword_arguments\u0060 returns \u0060set()\u0060 when \u0060(TypeError, ValueError)\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":"src/agents/run_internal/tool_actions.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31a22aa992b0bb892534e09f32a4b2685425d8baae3c9e770232cd9f415b70b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_resolve_runtime_metadata\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. 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":"src/agents/sandbox/capabilities/skills.py"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"7199c0e894189042923672c79a87b0bb667b4e178a8a15de1b0248fbaa547037"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_read_text_if_present\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. 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":"src/agents/sandbox/entries/mounts/patterns.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d359bb25f5598c4c9b9b734e821a63f35994264ffd2100b9ae632aa02f0e9d5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060read_phase_two_selection\u0060 returns \u0060[]\u0060 when \u0060json.JSONDecodeError\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":"src/agents/sandbox/memory/storage.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c263ffef1259b99edf8b360546395accfe638998519532803ce1bee109378ff"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_list_current_selection_items\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. 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":"src/agents/sandbox/memory/storage.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c77fea4954c689d16086090e4f510e839fe6a3d77d110ace29a4661cbac3cc"}}],"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-276","guid":"4e27da05-61af-1d5c-aeb5-9f56b6ede3e3","name":"Incorrect Default Permissions","shortDescription":{"text":"Incorrect Default Permissions"},"helpUri":"https://cwe.mitre.org/data/definitions/276.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.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-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-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":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"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":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_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":"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/"}]},{"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-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"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":22,"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."]}]}