{"$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":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"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":"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":"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":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"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":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"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":"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":"IndraRecognitionPredictor.detect_layout (cyclomatic 99): IndraRecognitionPredictor.detect_layout has cyclomatic complexity 99 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: marker/ocr/indra.py holds 3 of the 30 methods over the threshold \u2014 including the worst \u2014 and 122 of the 356 points over it (34%), 2.1\u00D7 the next-largest file (marker/builders/ocr.py at 58). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/ocr/indra.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ec96c25b3f58d7c152dc5858c036f9da5fda30dd3bce4c389bc4e1ca5c6c40"}},{"ruleId":"D1","level":"warning","message":{"text":"OcrBuilder.fuse_vlm_with_indra (cyclomatic 64): OcrBuilder.fuse_vlm_with_indra has cyclomatic complexity 64 (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":"marker/builders/ocr.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"389697d04735f1fb91e7b1f432d1ef8b13458e6856e7d574c47c5bf01720c180"}},{"ruleId":"D1","level":"warning","message":{"text":"convert.convert_cli (cyclomatic 48): convert.convert_cli 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":"marker/scripts/convert.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"739dffe6158d8c755332d4275258502a35dc868b6a61b008c402473041a6ac5d"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerEngine.page (cyclomatic 45): ViewerEngine.page 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":"marker/scripts/viewer.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2dd041af317000d7201bf94d77b300b2512273918872a91185934333034698"}},{"ruleId":"D1","level":"warning","message":{"text":"IndraRecognitionPredictor._recognize_crop (cyclomatic 36): IndraRecognitionPredictor._recognize_crop 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: marker/ocr/indra.py holds 3 of the 30 methods over the threshold \u2014 including the worst \u2014 and 122 of the 356 points over it (34%), 2.1\u00D7 the next-largest file (marker/builders/ocr.py at 58). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/ocr/indra.py"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"604c156fa5b9375d64a2b93150a1718a2e84d38e4d35b35d109e50c4a9dc5d10"}},{"ruleId":"D1","level":"warning","message":{"text":"IndraRecognitionPredictor._page_to_ocr_result (cyclomatic 32): IndraRecognitionPredictor._page_to_ocr_result 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: marker/ocr/indra.py holds 3 of the 30 methods over the threshold \u2014 including the worst \u2014 and 122 of the 356 points over it (34%), 2.1\u00D7 the next-largest file (marker/builders/ocr.py at 58). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/ocr/indra.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b404bdfda16f8f7ea07f263c4e5a9d1315c2d45fa376b1faa9e57285d8aa786"}},{"ruleId":"D1","level":"warning","message":{"text":"Markdownify.convert_table (cyclomatic 27): Markdownify.convert_table has cyclomatic complexity 27 (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":"marker/renderers/markdown.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"287be38dbce2576e1431bb3b350a86772bd966e469a274793435c99bb835a879"}},{"ruleId":"D1","level":"warning","message":{"text":"LineBuilder.flag_bad_blocks (cyclomatic 26): LineBuilder.flag_bad_blocks 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":"marker/builders/line.py"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3b5492cab3d9353bf802931ec692e678a523c6cafc4fb7b7262ec88fc7b609"}},{"ruleId":"D1","level":"warning","message":{"text":"OcrBuilder.convert_pdf_with_indra (cyclomatic 24): OcrBuilder.convert_pdf_with_indra 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":"marker/builders/ocr.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1bbeb18d50175fb0457ccac7c2c044abc47b418e676be2e5b6fb2c3c59d8d1"}},{"ruleId":"D1","level":"warning","message":{"text":"CustomClickPrinter.parse_args (cyclomatic 23): CustomClickPrinter.parse_args 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":"marker/config/printer.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75ea180d1c04b0f0a9f9c7338640c698bdb3aa23e6cc488a1088ec52733b88b"}},{"ruleId":"D1","level":"warning","message":{"text":"Span.assemble_html (cyclomatic 23): Span.assemble_html 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":"marker/schema/text/span.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9c4917774d1bbb21e5a13e734ec3589ba77217b9800bb7f61fb66f4667926f"}},{"ruleId":"D1","level":"warning","message":{"text":"LineBuilder.get_all_lines (cyclomatic 22): LineBuilder.get_all_lines 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":"marker/builders/line.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f421e4f3158c230754794f8618338d7eb3560c03e659e8e6c80014b9b61650"}},{"ruleId":"D1","level":"warning","message":{"text":"table_recon.reconstruct_table_html (cyclomatic 22): table_recon.reconstruct_table_html 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":"marker/processors/table_recon.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"97eaedbf90c53540eaf4c0dc4af168f8af5733ca49fa02ddf69a7c9cc6ffd4fe"}},{"ruleId":"D1","level":"warning","message":{"text":"TextProcessor.__call__ (cyclomatic 22): TextProcessor.__call__ 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":"marker/processors/text.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"830342b77439e9f189c244762499d30874fc969281e88565e8d9702e6e97ca41"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigParser.generate_config_dict (cyclomatic 21): ConfigParser.generate_config_dict 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":"marker/config/parser.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"42884dc8199a12de351e7c1a78410d620343403d4f65a6dd65d6af9d508e7aeb"}},{"ruleId":"D1","level":"warning","message":{"text":"EquationProcessor.__call__ (cyclomatic 21): EquationProcessor.__call__ 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":"marker/processors/equation.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff76c3df36a9a3f949c56d5ca3e34e4ba8bd2d2283d7058a924cbf05bd01b8e6"}},{"ruleId":"D1","level":"warning","message":{"text":"table_recon._line_tokens (cyclomatic 21): table_recon._line_tokens 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":"marker/processors/table_recon.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8bf3f4a1ad7bd0e1336c17ee6031c2cd71c2fcc71b2abcccb25c220bfa7b44"}},{"ruleId":"D1","level":"warning","message":{"text":"convert_single.convert_single_cli (cyclomatic 21): convert_single.convert_single_cli 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":"marker/scripts/convert_single.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a21138719194c030bb7c81db9789ab2130879bf7bd882f149ddddf5bf52ce5"}},{"ruleId":"D1","level":"warning","message":{"text":"ListProcessor.list_group_indentation (cyclomatic 19): ListProcessor.list_group_indentation 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":"marker/processors/list.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3fc48b8e55b7dac6f92a1e2683d9f3c1772b30c5ad5dc8881d93d7ebc1b077"}},{"ruleId":"D1","level":"warning","message":{"text":"MarginaliaProcessor.__call__ (cyclomatic 19): MarginaliaProcessor.__call__ 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":"marker/processors/marginalia.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"083bd8bb59b08ce64317a66644e37c5c42edbb65f3ee81a972ae5cccc82e38bc"}},{"ruleId":"D1","level":"warning","message":{"text":"table_recon._grid_proj (cyclomatic 19): table_recon._grid_proj 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":"marker/processors/table_recon.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8025346d3d346f366574e9f63aec44ea41a542f052f2d9b88cefe96a998603"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockquoteProcessor.__call__ (cyclomatic 18): BlockquoteProcessor.__call__ 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":"marker/processors/blockquote.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"63824345b3d319c028bc7c8593f1782ebcf21d73fad3c2a08fb8d5db2179b797"}},{"ruleId":"D1","level":"warning","message":{"text":"TableProcessor.reconstruct_digital_table (cyclomatic 18): TableProcessor.reconstruct_digital_table 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":"marker/processors/table.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4acf87896c16ecc954539c863b3398f2851a1bc54f5213afcd6c5e01270494"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfProvider.pdftext_extraction (cyclomatic 18): PdfProvider.pdftext_extraction 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":"marker/providers/pdf.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4cd84a5944b5b37731a274882389512611dde7a0ae644f6d6b7e0bc742cff1"}},{"ruleId":"D1","level":"warning","message":{"text":"TableProcessor.run_ocr_fallback (cyclomatic 17): TableProcessor.run_ocr_fallback 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":"marker/processors/table.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0885c3302cd194d328694f97e3f03ac05b3605f47355d8f106a3e57e4e81c88f"}},{"ruleId":"D1","level":"warning","message":{"text":"OCRJSONRenderer.extract_json (cyclomatic 17): OCRJSONRenderer.extract_json 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":"marker/renderers/ocr_json.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c9ce89c8366d3119d58a54a63d038f745d7583ae8c1154a0b5770a435bf87e"}},{"ruleId":"D1","level":"warning","message":{"text":"table_recon._attach_wrapped_lines (cyclomatic 16): table_recon._attach_wrapped_lines 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":"marker/processors/table_recon.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"95843e94e015cb41df9a3b9ee0b92a363bcbe5501c6bab34cc323ff0f1903fbc"}},{"ruleId":"D1","level":"warning","message":{"text":"PowerPointProvider._handle_text (cyclomatic 16): PowerPointProvider._handle_text 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":"marker/providers/powerpoint.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e656759e987b73db08519c0d1859cc7931986002235131dbc135ae45f04e96f"}},{"ruleId":"D1","level":"warning","message":{"text":"Block.contained_blocks (cyclomatic 16): Block.contained_blocks 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":"marker/schema/blocks/base.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd3466179af2f526ecff94be17a665cc0c8cd613542bb2695d359170e7ef1f8"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerEngine.upload (cyclomatic 16): ViewerEngine.upload 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":"marker/scripts/viewer.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"157855a641e98a87553fe3cba08c5721658e8aec22959f6fae95ee6f5c9cf74b"}},{"ruleId":"D2","level":"warning","message":{"text":"IndraRecognitionPredictor.detect_layout (cognitive 340): IndraRecognitionPredictor.detect_layout has cognitive complexity 340 (threshold 15). Drivers by points: if/else 42 (222 pts), loops 14 (63 pts), boolean chains 37, ternaries 5 (18 pts) (nesting depth added 242). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: marker/ocr/indra.py holds 4 of the 68 methods over the threshold \u2014 including the worst \u2014 and 427 of the 1417 points over it (30%), 2.6\u00D7 the next-largest file (marker/builders/ocr.py at 163). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/ocr/indra.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b11a0a741226c1aa5bf496730dd7fc56009807e585e4fcac4ca720747d0678c"}},{"ruleId":"D2","level":"warning","message":{"text":"OcrBuilder.fuse_vlm_with_indra (cognitive 133): OcrBuilder.fuse_vlm_with_indra has cognitive complexity 133 (threshold 15). Drivers by points: if/else 23 (76 pts), loops 10 (27 pts), boolean chains 24, ternaries 2 (6 pts) (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/builders/ocr.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cbb56869bf6768fc6db2983aeba62ac178afc22a664591565153efd4769f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"IndraRecognitionPredictor._recognize_crop (cognitive 73): IndraRecognitionPredictor._recognize_crop has cognitive complexity 73 (threshold 15). Drivers by points: if/else 25 (51 pts), loops 3 (8 pts), boolean chains 7, ternaries 2 (7 pts) (nesting depth added 36). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: marker/ocr/indra.py holds 4 of the 68 methods over the threshold \u2014 including the worst \u2014 and 427 of the 1417 points over it (30%), 2.6\u00D7 the next-largest file (marker/builders/ocr.py at 163). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/ocr/indra.py"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5242db85e094235c33fe5fa63631d27e47215484b3f76f416c679a55d712c9"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerEngine.page (cognitive 71): ViewerEngine.page has cognitive complexity 71 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 14, loops 6 (14 pts), ternaries 2 (4 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":"marker/scripts/viewer.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d773f219b2b36e0187ea0b40c117c125d5ebf1f40371853b08b864e37dc059"}},{"ruleId":"D2","level":"warning","message":{"text":"convert.convert_cli (cognitive 67): convert.convert_cli has cognitive complexity 67 (threshold 15). Drivers by points: if/else 22 (30 pts), boolean chains 14, ternaries 7 (13 pts), loops 3 (6 pts), error handling 2 (4 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":"marker/scripts/convert.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"63688892b83fa8c5e2efcb5b839fe07e527a64e910838914fa68decfe5d8e587"}},{"ruleId":"D2","level":"warning","message":{"text":"Markdownify.convert_table (cognitive 59): Markdownify.convert_table has cognitive complexity 59 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 12 (25 pts), error handling 1 (5 pts), boolean chains 3, ternaries 1 (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":"marker/renderers/markdown.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f24149195b4a306d451806a74f2ffaf0ad878db2deeba479a37ac8f88a5a3f"}},{"ruleId":"D2","level":"warning","message":{"text":"LineBuilder.flag_bad_blocks (cognitive 57): LineBuilder.flag_bad_blocks has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (43 pts), loops 5 (10 pts), boolean chains 3, ternaries 1 (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":"marker/builders/line.py"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d47812fb9740f3e6c6037b6271875ea45755cf2b56d1af42fdb91b0fbf2f6c"}},{"ruleId":"D2","level":"warning","message":{"text":"IndraRecognitionPredictor._page_to_ocr_result (cognitive 55): IndraRecognitionPredictor._page_to_ocr_result has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (38 pts), boolean chains 13, loops 2 (4 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: marker/ocr/indra.py holds 4 of the 68 methods over the threshold \u2014 including the worst \u2014 and 427 of the 1417 points over it (30%), 2.6\u00D7 the next-largest file (marker/builders/ocr.py at 163). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/ocr/indra.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac89f12cc744ccb96dbf57e8371933912809be65bd1aaaa9fdf5117c5478865"}},{"ruleId":"D2","level":"warning","message":{"text":"ListProcessor.list_group_indentation (cognitive 53): ListProcessor.list_group_indentation has cognitive complexity 53 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 6 (17 pts), boolean chains 4 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/processors/list.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c46b332ce503fca94b8376a3d51db60e0d8a056e74bd171ad30e4c40ae3de51"}},{"ruleId":"D2","level":"warning","message":{"text":"TextProcessor.__call__ (cognitive 47): TextProcessor.__call__ has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (37 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/processors/text.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a501d42c078a509847a63f5210af3556029df7a75ea847d078c62b286884717"}},{"ruleId":"D2","level":"warning","message":{"text":"OcrBuilder.convert_pdf_with_indra (cognitive 44): OcrBuilder.convert_pdf_with_indra has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 9, loops 3 (5 pts), ternaries 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":"marker/builders/ocr.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"617f1079fced2fc0394a216af6d3e02f7411ad054209784ec17ca0a20de7972c"}},{"ruleId":"D2","level":"warning","message":{"text":"CustomClickPrinter.parse_args (cognitive 44): CustomClickPrinter.parse_args has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 7 (13 pts), boolean chains 5, ternaries 1 (3 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":"marker/config/printer.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c345dd921eec1c9d5658b7db8a72d39dbe97720c0be16d065a2cfd56cf1cefb5"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfProvider.pdftext_extraction (cognitive 43): PdfProvider.pdftext_extraction has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 4 (10 pts), boolean chains 5, ternaries 1 (5 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/providers/pdf.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"749dacdf77762f7a2d5be4015bf66cb7910ca8cb529d5e67da92d576e39a9472"}},{"ruleId":"D2","level":"warning","message":{"text":"LineBuilder.get_all_lines (cognitive 41): LineBuilder.get_all_lines has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 4 (8 pts), boolean chains 5, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/builders/line.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d93cb9447635574defc350c308ad0380bb357df8cfae88550c2c55edc93ebb"}},{"ruleId":"D2","level":"warning","message":{"text":"SectionHeaderProcessor.__call__ (cognitive 41): SectionHeaderProcessor.__call__ has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (31 pts), loops 5 (10 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":"marker/processors/sectionheader.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1cd073da361d12c10ab5857eb951cd6fce9da076d8e0c6023993825660924a"}},{"ruleId":"D2","level":"warning","message":{"text":"LineNumbersProcessor.ignore_line_starts_ends (cognitive 40): LineNumbersProcessor.ignore_line_starts_ends has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 5 (14 pts) (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":"marker/processors/line_numbers.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5080f29ade004fe276ff91b5d38c7d76956e1f484a94aac4fdb64aef1ffd918a"}},{"ruleId":"D2","level":"warning","message":{"text":"OCRJSONRenderer.extract_json (cognitive 39): OCRJSONRenderer.extract_json has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 5 (11 pts), ternaries 1 (4 pts), boolean chains 3 (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":"marker/renderers/ocr_json.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a137539cd1d5c5115d4b0b90659ca96c992d1c42738ab95ef83dd742f12a49cb"}},{"ruleId":"D2","level":"warning","message":{"text":"table_recon._grid_proj (cognitive 37): table_recon._grid_proj has cognitive complexity 37 (threshold 15). Drivers by points: loops 9 (17 pts), if/else 9 (16 pts), ternaries 1 (3 pts), boolean chains 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":"marker/processors/table_recon.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"575a1e4b80c11d65df1a62d2087456aee049c831ae6d163c76fb13f22cc45a18"}},{"ruleId":"D2","level":"warning","message":{"text":"convert.discover_input_files (cognitive 36): convert.discover_input_files has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (7 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":"marker/scripts/convert.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce537ece4e2b8f8dc9127d14c2d2826c1f0963ecc612d595faee768be4113142"}},{"ruleId":"D2","level":"warning","message":{"text":"table_recon._line_tokens (cognitive 35): table_recon._line_tokens has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 6, loops 4 (6 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":"marker/processors/table_recon.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d63604c2c2920ffa9deff2b2acae24101cc6e9a4d2b743985acb52831a14da"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockquoteProcessor.__call__ (cognitive 34): BlockquoteProcessor.__call__ has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (25 pts), boolean chains 6, loops 2 (3 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":"marker/processors/blockquote.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c784b513d43b61464c843931b3477c506aa24c29cd15ec3377d28feda1386f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"EquationProcessor.__call__ (cognitive 33): EquationProcessor.__call__ has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 5 (9 pts), boolean chains 6, error handling 1, ternaries 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":"marker/processors/equation.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddbec67926cf7c52f9fde3b74d7360678bafa24d9ba6cc35cfe436080ad086a"}},{"ruleId":"D2","level":"warning","message":{"text":"SpreadSheetProvider._excel_to_html_table (cognitive 33): SpreadSheetProvider._excel_to_html_table has cognitive complexity 33 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (12 pts), ternaries 2 (8 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":"marker/providers/spreadsheet.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3aceb111500399a273186bc04436510af4e0619ce4db25dfd4ad1664566ee3"}},{"ruleId":"D2","level":"warning","message":{"text":"MarginaliaProcessor.__call__ (cognitive 32): MarginaliaProcessor.__call__ has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/processors/marginalia.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d46666f569652dfb96f9ca89c2eff3c4fc5327c91f544f66db1ae3aa062bb2f"}},{"ruleId":"D2","level":"warning","message":{"text":"table_recon.reconstruct_table_html (cognitive 32): table_recon.reconstruct_table_html has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 4 (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":"marker/processors/table_recon.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e911a1378a17fbfee041a831b5cccc09bd479121564d9571944caae694d74e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Span.assemble_html (cognitive 32): Span.assemble_html has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 4, loops 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":"marker/schema/text/span.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ed2cc2e2d5f551d900094c132bf999bb37aaa15eba03ecb67ca6ac5999561e"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigParser.generate_config_dict (cognitive 31): ConfigParser.generate_config_dict has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 1 (2 pts), boolean chains 1, 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":"marker/config/parser.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c801d4b72490faee8603db87f6fb09553ff0968ab129c73ad94b0a830ccd82"}},{"ruleId":"D2","level":"warning","message":{"text":"table_recon._attach_wrapped_lines (cognitive 29): table_recon._attach_wrapped_lines has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (4 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/processors/table_recon.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13c1e11705c53d1cdcef9de1d5d1bebd798c2c03c22afd23280f2fe342b3f92"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseGeminiService.__call__ (cognitive 29): BaseGeminiService.__call__ has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), error handling 3 (6 pts), boolean chains 1, 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":"marker/services/gemini.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7df37c700aba42e90535e5f844452b7c02eb69abcbf813d98c018da9f2ab63"}},{"ruleId":"D2","level":"warning","message":{"text":"LLMTableProcessor.parse_html_table (cognitive 27): LLMTableProcessor.parse_html_table has cognitive complexity 27 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 4 (9 pts), boolean chains 2 (nesting depth added 14). 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":"marker/processors/llm/llm_table.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed502f9d09f30ddb06caffde1b7c68a87e7727f43087d8af0071d548c5a298de"}},{"ruleId":"D2","level":"warning","message":{"text":"PowerPointProvider._handle_text (cognitive 26): PowerPointProvider._handle_text has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, ternaries 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/providers/powerpoint.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c480e7a6d6988c73ea6887c817f5c6040073823021bb71e9fb9953bd7559395c"}},{"ruleId":"D2","level":"warning","message":{"text":"LLMTableMergeProcessor.rewrite_blocks (cognitive 25): LLMTableMergeProcessor.rewrite_blocks has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (4 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":"marker/processors/llm/llm_table_merge.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f0aa4b5a39bb93017d45f20f29f9ab334ab1ae61aee408c4290059119e9555"}},{"ruleId":"D2","level":"warning","message":{"text":"TableProcessor.run_ocr_fallback (cognitive 25): TableProcessor.run_ocr_fallback has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, ternaries 2 (4 pts), loops 3, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/processors/table.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb6e037e99071af471f180fe86d518c718ff4ff0c168cd45886e53773261ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfProvider.check_page (cognitive 25): PdfProvider.check_page has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (4 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":"marker/providers/pdf.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"e291e0e68c9b54adebcf5a9c8e25f374fc9ca1e30f2121b41e794cc4c2eb23d9"}},{"ruleId":"D2","level":"warning","message":{"text":"StructureBuilder.split_list_groups (cognitive 24): StructureBuilder.split_list_groups has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/builders/structure.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1423b96066ffc59f657ce10eceacd5671c8960302c9ecb585a74ec47170168"}},{"ruleId":"D2","level":"warning","message":{"text":"LineNumbersProcessor.ignore_line_number_spans (cognitive 24): LineNumbersProcessor.ignore_line_number_spans has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (9 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":"marker/processors/line_numbers.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1b0f4a1b8920951496ef1e311912365841286ba64fa1fd8ff58cc769f72c5e"}},{"ruleId":"D2","level":"warning","message":{"text":"LLMTableMergeProcessor.process_rewriting (cognitive 23): LLMTableMergeProcessor.process_rewriting has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 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":"marker/processors/llm/llm_table_merge.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f848424ab219d0a6b80e019b5b3b505415c28e73ba10c638c5eb7e88019a6b07"}},{"ruleId":"D2","level":"warning","message":{"text":"TableProcessor.reconstruct_digital_table (cognitive 23): TableProcessor.reconstruct_digital_table has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 3 (5 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":"marker/processors/table.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c23f7429f7a45b710798140f14a3df12da581f9a9e63fb166a8cf94058247d"}},{"ruleId":"D2","level":"warning","message":{"text":"PowerPointProvider.convert_pptx_to_pdf (cognitive 23): PowerPointProvider.convert_pptx_to_pdf has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (3 pts), boolean chains 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":"marker/providers/powerpoint.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"747e5a8468f9293b777970078fa12f0c37f6b5ec46d71eedaa1df66286c69694"}},{"ruleId":"D2","level":"warning","message":{"text":"PageGroup.add_initial_blocks (cognitive 23): PageGroup.add_initial_blocks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (10 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/schema/groups/page.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"754092df5c05124eb007a669a9b6fe1e2cff171a75547fdaeda09e23212f2050"}},{"ruleId":"D2","level":"warning","message":{"text":"convert_single.convert_single_cli (cognitive 23): convert_single.convert_single_cli has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, error handling 2 (4 pts), ternaries 2 (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":"marker/scripts/convert_single.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f25a07db1914f2423502a4c8f4452c9d00200fbd3533b34d1801ec4d2bfc1af"}},{"ruleId":"D2","level":"warning","message":{"text":"LineBuilder.ocr_error_detection (cognitive 22): LineBuilder.ocr_error_detection has cognitive complexity 22 (threshold 15). Drivers by points: loops 3 (7 pts), ternaries 2 (7 pts), if/else 4 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/builders/line.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"208dd9a37a70693e8bdc6fe6a3a25696681885e5b78e24871652da7ae3a4dd80"}},{"ruleId":"D2","level":"warning","message":{"text":"ListProcessor.list_group_continuation (cognitive 22): ListProcessor.list_group_continuation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/processors/list.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c51b0a55a7ded698834d6c164b97b86a8b338ebf21d804d193cc2f9c2099c22"}},{"ruleId":"D2","level":"warning","message":{"text":"TableProcessor.__call__ (cognitive 22): TableProcessor.__call__ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (7 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/processors/table.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"81db3aeec34e0241ecf39cba2e66bcd5b463738ee1572c1590b71fdf6baa9812"}},{"ruleId":"D2","level":"warning","message":{"text":"Line.formatted_text (cognitive 21): Line.formatted_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 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":"marker/schema/text/line.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b06a5f1d7ea60d472b74e52e7a144486dd3a847cfc889fd7bc1c71065e9c67"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerEngine.upload (cognitive 21): ViewerEngine.upload has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 3 (6 pts), boolean chains 3, loops 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":"marker/scripts/viewer.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"586912aa3290c7d5f933f5922e75dca3ae334704d463799bb62a8109f1496fcc"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutBuilder.add_blocks_to_pages (cognitive 20): LayoutBuilder.add_blocks_to_pages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 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":"marker/builders/layout.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"443f48c069789a31b687fab63d58adfdf7443d09b3a16f824705c790ed78991e"}},{"ruleId":"D2","level":"warning","message":{"text":"OcrBuilder.ocr_flagged_blocks (cognitive 20): OcrBuilder.ocr_flagged_blocks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 2 (3 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":"marker/builders/ocr.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aba3f22907f5d9c08ef3c2a632f4a34157e9cfe03d5ded869d8ed40f405b22f"}},{"ruleId":"D2","level":"warning","message":{"text":"LineMergeProcessor.merge_lines (cognitive 20): LineMergeProcessor.merge_lines has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (4 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":"marker/processors/line_merge.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e7c5fc110f17ee9f3123928f38a30cc798cbaa43a2e653e91a0d3153d5e076"}},{"ruleId":"D2","level":"warning","message":{"text":"Block.contained_blocks (cognitive 20): Block.contained_blocks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, ternaries 2, 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":"marker/schema/blocks/base.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"15875d19400e79571044bd1da99bcd49725f204e66b0b7cb8518057b41b4b594"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer._parse_page_range_spec (cognitive 20): viewer._parse_page_range_spec has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/scripts/viewer.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2792ca1f2076fbdc3b59aa34f34024c0e625a7437a6fc6f72e8e6393ce5ae1"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutBuilder.expand_layout_blocks (cognitive 19): LayoutBuilder.expand_layout_blocks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (6 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":"marker/builders/layout.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d16eda2ef33511ac90d21a5c0d75794d0fd297a90f470dda48a9339f1cff42c"}},{"ruleId":"D2","level":"warning","message":{"text":"OcrBuilder.__call__ (cognitive 19): OcrBuilder.__call__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/builders/ocr.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"108a9286f6fc1391d6b4c6bd765f181ea294b384a8e609821e0673514fdf4929"}},{"ruleId":"D2","level":"warning","message":{"text":"OcrBuilder.apply_block_html (cognitive 19): OcrBuilder.apply_block_html has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (7 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":"marker/builders/ocr.py"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"7943de2f77d92a1897aef1ce3c659c4c8ae74b66c135a03f11d11b81d6b373c3"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigCrawler._crawl_config (cognitive 19): ConfigCrawler._crawl_config has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 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":"marker/config/crawler.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6456f2290598db1636529ec4e332dfce3409be7b63e70dd5ab2e039b7859040a"}},{"ruleId":"D2","level":"warning","message":{"text":"IndraRecognitionPredictor.engine (cognitive 19): IndraRecognitionPredictor.engine has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 1 (3 pts), ternaries 1 (3 pts), boolean chains 2, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: marker/ocr/indra.py holds 4 of the 68 methods over the threshold \u2014 including the worst \u2014 and 427 of the 1417 points over it (30%), 2.6\u00D7 the next-largest file (marker/builders/ocr.py at 163). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/ocr/indra.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a1f8788bf69535bef4dc41f5b4a33aeda54cc87615b2e3955d577ee36d6bc5"}},{"ruleId":"D2","level":"warning","message":{"text":"util.download_font (cognitive 19): util.download_font has cognitive complexity 19 (threshold 15). Drivers by points: error handling 3 (10 pts), if/else 3 (7 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/util.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb052d911502b9a7dd877970420aa5801f599b6aa70218bf0266ecc2e20d170"}},{"ruleId":"D2","level":"warning","message":{"text":"OcrBuilder.replace_page_structure (cognitive 18): OcrBuilder.replace_page_structure has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (13 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":"marker/builders/ocr.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12858de913f045d5a23844316b34ff10660abfcf22b9798e95c670f6f254dca"}},{"ruleId":"D2","level":"warning","message":{"text":"LLMMathBlockProcessor.rewrite_blocks (cognitive 18): LLMMathBlockProcessor.rewrite_blocks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts), boolean chains 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":"marker/processors/llm/llm_mathblock.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab731a79f58fa93f21c60a787a43169d0e968360826ca0c9b5ddcc8a4eec554e"}},{"ruleId":"D2","level":"warning","message":{"text":"EpubProvider.convert_epub_to_pdf (cognitive 18): EpubProvider.convert_epub_to_pdf has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/providers/epub.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0fecc0d1ddd98c3c9da703c7bc0d6f664ec585a8cf839d7a0b3c094dd5d94c"}},{"ruleId":"D2","level":"warning","message":{"text":"ReferenceProcessor.__call__ (cognitive 17): ReferenceProcessor.__call__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 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":"marker/processors/reference.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"347b97d7fbd12350f7797921ad9485837678555c411e9d4d46fd001f6d574ab4"}},{"ruleId":"D2","level":"warning","message":{"text":"TableProcessor.cleanup_contained_blocks (cognitive 17): TableProcessor.cleanup_contained_blocks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 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":"marker/processors/table.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"300ede86a16ca6ae44ef1978320515eb4f450ef9dba759386d82bb712897d719"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutBuilder.surya_layout (cognitive 16): LayoutBuilder.surya_layout has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (6 pts), loops 2 (3 pts) (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/builders/layout.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"93afa6600903144741f79f6a0151e243f440b6ca156cc97b020d1de846a72fbd"}},{"ruleId":"D2","level":"warning","message":{"text":"table_recon._grid_span (cognitive 16): table_recon._grid_span has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 2 (6 pts), 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":"marker/processors/table_recon.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a828e7e35653fa32e8fb6dac27a00e507b681b0f2c5a0c5ac012e84d8ce338dd"}},{"ruleId":"D2","level":"warning","message":{"text":"SectionHeader.assemble_html (cognitive 16): SectionHeader.assemble_html has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (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":"marker/schema/blocks/sectionheader.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"488e5cd860b49ae8ab256ba62e5cc46e5aa5bfc8cd791aba9443030eeeda4564"}},{"ruleId":"D2","level":"warning","message":{"text":"AzureOpenAIService.__call__ (cognitive 16): AzureOpenAIService.__call__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 2 (4 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/services/azure_openai.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb387897e548b9b0bcff3aafe3451c482b9929c0a5b1c28210b61435d1b1bbf"}},{"ruleId":"D2","level":"warning","message":{"text":"ClaudeService.__call__ (cognitive 16): ClaudeService.__call__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/services/claude.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4728d9787093b56f61096510d30b86aa142bd8b39ffbe742ee4de3b94694e98c"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIService.__call__ (cognitive 16): OpenAIService.__call__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 2 (4 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/services/openai.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"8745c6cef64889e19e927e023242aa34b07876e422b992157e18eb6788e58abd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ocr/indra.py: FileTooLong \u2014 998 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 498 over it, 2.00\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":"marker/ocr/indra.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cb2785963122b8a23ba427f7069ef0a69027c814e8256952f66b8aaae38626"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/viewer.py: FileTooLong \u2014 958 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 458 over it, 1.92\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":"marker/scripts/viewer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c65d48b732f5f19716350be6a09c0f393e463bdb12ecf32f73878ffc89949ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builders/ocr.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":"marker/builders/ocr.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f1ff0796e6bffee6d1393a7f08d77694f5790222ba5528a6c0af0f3068bbd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): marker/services/azure_openai.py:52-115 | marker/services/openrouter.py:84-143 \u2014 These two members are one piece of code written twice and then edited apart: 60 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":"marker/services/azure_openai.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"991d9c907212587810f9c5874ee5c8fbfe725ffaa5b062db0f370c0422cf1418"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): marker/processors/debug.py:63-90 | marker/processors/debug.py:93-124 \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":"marker/processors/debug.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96cdff0ec6608e6de91675ccf72a8a3b1e372894eeea62338e4cbb7b7b4b8cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): marker/processors/llm/__init__.py:151-174 | marker/processors/llm/llm_page_correction.py:265-289 \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":"marker/processors/llm/__init__.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4595067391552fbb777b73bee0da0bfe4e52df2a39c4095e3e667603d5d4fe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): marker/processors/llm/llm_complex.py:70-97 | marker/processors/llm/llm_form.py:98-123 | marker/processors/llm/llm_handwriting.py:69-88 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 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":"marker/processors/llm/llm_complex.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d42d712862f14ee1dad350e4ca25187333f6ccf3bb8de24056ad971629e79ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): marker/converters/ocr.py:30-44 | marker/converters/pdf.py:205-219 \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":"marker/converters/ocr.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c17870801d9b3ca900dc1061c71ed7c4aa4e51c0197470eb22a37d03c3d45c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): marker/providers/document.py:55-66 | marker/providers/epub.py:50-61 | marker/providers/html.py:10-22 | marker/providers/powerpoint.py:47-58 | marker/providers/spreadsheet.py:35-46 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/providers/document.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ec43fe9ea6a4bdd97c1e1534751f35ef13c4d552de7fbbc05b21a21642712d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): marker/processors/llm/llm_complex.py:55-67 | marker/processors/llm/llm_equation.py:93-110 | marker/processors/llm/llm_form.py:78-93 \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":"marker/processors/llm/llm_complex.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b277a6c7316bcbc42b2fd5cc0441cc0097a57e2fe7db2d1034fafcd5053935ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): marker/processors/llm/llm_handwriting.py:53-66 | marker/processors/llm/llm_image_description.py:50-68 \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":"marker/processors/llm/llm_handwriting.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"342b8d520991fb3f35f73993f8e6cb0194d61e96530336e8fb7a7d677af2c7df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): marker/processors/equation.py:84-89 | marker/processors/table.py:69-76 \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":"marker/processors/equation.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e2a9fc0370156bb74465aa4264345a4dbfe00d331125c8588bb2a90cc0e6fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): marker/services/azure_openai.py:53-79 | marker/services/openai.py:71-97 \u2014 before extracting anything, compare \u0060marker/services/azure_openai.py\u0060 and \u0060marker/services/openai.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 71 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 \u0060marker/services/azure_openai.py:53\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":"marker/services/azure_openai.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85e60ca452da0604c4fa8e54cddde726e499bea5e614ff3ff7a72eabe911d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): marker/schema/blocks/inlinemath.py:16-39 | marker/schema/blocks/text.py:16-39 \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":"marker/schema/blocks/inlinemath.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f4abe91cfac73a41ba1fe9290936dd9957211b985d09e66a19aa6762de0aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): marker/services/azure_openai.py:52-73 | marker/services/claude.py:53-74 | marker/services/openai.py:70-91 \u2014 before extracting anything, compare \u0060marker/services/azure_openai.py\u0060 and \u0060marker/services/openai.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 71 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":"marker/services/azure_openai.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9a96f2a24865d22752410cf7e97d7478fea21b47f69bb9c8203a5f725db5ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): marker/services/azure_openai.py:81-102 | marker/services/openai.py:99-119 \u2014 before extracting anything, compare \u0060marker/services/azure_openai.py\u0060 and \u0060marker/services/openai.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 71 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 \u0060marker/services/azure_openai.py:81\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. 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":"marker/services/azure_openai.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6129b98c3d388386aa3018ed6a3a08bcdba7d3b355d49b3cd1520daa589aa4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): marker/processors/llm/llm_table.py:199-216 | marker/processors/llm/llm_table.py:242-262 \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":"marker/processors/llm/llm_table.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c584d49e9da69fe83b78703de69f24049bcfd7173f18687b0e8853019852b7ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): marker/builders/ocr.py:329-346 | marker/builders/ocr.py:394-412 \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":"marker/builders/ocr.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"297bdc5d011768574b8237d5a333a5a52ba8029672303e31b933c616ecf652af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): marker/processors/llm/__init__.py:111-129 | marker/processors/llm/llm_page_correction.py:244-262 \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":"marker/processors/llm/__init__.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96f3bd2997b9cbde7f15699f08f069f7098652edb02d1505a4a6d1c8681ca26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): marker/schema/blocks/diagram.py:15-33 | marker/schema/blocks/picture.py:15-33 \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":"marker/schema/blocks/diagram.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8cb773d37b218c5e049adafc15c9cfd0a1c81fcad11f5b773751b92a4735de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): marker/services/claude.py:100-116 | marker/services/openai.py:117-133 \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":"marker/services/claude.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d78bf409aa3c5bb75e6b95c7af7aeeb229fe22617e65c00297ca4a4c034195"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): marker/schema/blocks/base.py:202-216 | marker/schema/groups/page.py:97-112 \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":"marker/schema/blocks/base.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a463b1a6ee657830430b613821e55db556e90cce5932b209b170358db6bf834"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): marker/providers/powerpoint.py:88-102 | marker/providers/powerpoint.py:131-142 \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":"marker/providers/powerpoint.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57edcfc655aa0ab40660f2fe3dca5b0d54f88d675541ad16038db7cc2854d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): marker/schema/blocks/diagram.py:14-28 | marker/schema/blocks/figure.py:14-27 | marker/schema/blocks/picture.py:14-28 \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":"marker/schema/blocks/diagram.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5443d66667596c44df429b206a9579424d61b70344138ca27b3ce40305600356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): marker/processors/equation.py:169-181 | marker/processors/table.py:226-238 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060marker/processors/table.py:239\u0060 calls \u0060all\u0060 and \u0060marker/processors/equation.py:182\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":"marker/processors/equation.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"397f55b523ebb98bfb30f6c59ade456fd04a86a1d2dd74bb10105bd37b08891a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): marker/processors/llm/llm_mathblock.py:143-154 | marker/processors/llm/llm_table_merge.py:274-286 \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 \u0060marker/processors/llm/llm_mathblock.py:143\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":"marker/processors/llm/llm_mathblock.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48c84ba31f9441d51b7a66539dde7d319d810d22135b9131fe22a96fabf267d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): marker/scripts/convert.py:318-328 | marker/scripts/convert_single.py:76-86 \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":"marker/scripts/convert.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7952f37a41feb717c2b38ab74540fcae3b7f946039a8d79daf600b325becf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): marker/builders/ocr.py:470-476 | marker/builders/ocr.py:479-485 \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 \u0060marker/builders/ocr.py:470\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":"marker/builders/ocr.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcc3a8c199b90dfd55df86a379643b9938a3375cf8ad5aa7c904da484d71704"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): marker/ocr/indra.py:511-516 | marker/ocr/indra.py:519-524 \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":"marker/ocr/indra.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf292d731f4abfff77d25b61e8dcc197da65c282cf136dd62146c8998448d2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): marker/processors/table_recon.py:244-248 | marker/processors/table_recon.py:277-281 \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":"marker/processors/table_recon.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea45bf59ce7d42667a4523c7667d96195a2dd622ebe7481d276a9f4df4fe6ab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): marker/providers/document.py:69-73 | marker/providers/epub.py:64-68 | marker/providers/html.py:25-29 | marker/providers/powerpoint.py:61-65 | marker/providers/spreadsheet.py:49-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/providers/document.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e19be26f70148b12b07ca74ebedab7add983cfc0f0342465704acdb89fa5c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): marker/schema/blocks/caption.py:12-19 | marker/schema/blocks/footnote.py:16-23 \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":"marker/schema/blocks/caption.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"78538eab2eee87e84d271b7626c327c0b9176ed6d1d220dea2af8cc92a5178c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): marker/schema/blocks/pagefooter.py:15-25 | marker/schema/blocks/pageheader.py:15-25 \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":"marker/schema/blocks/pagefooter.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4974a6128f0d0edb31536ba7f0e588183b311d735364f769511246921f6bf4a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Markdownify (LCOM4 4): Markdownify\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":"marker/renderers/markdown.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19aef69f60849af54da1353943f53e8294f1735a7adccfcbbb0e6709cf40b67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: marker/scripts/viewer.py: marker/scripts/viewer.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in ViewerEngine.page at line 255. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:32:15 -05:00\u0027 --until=\u00272026-11-13 23:32:15 -05:00\u0027 --full-history --no-merges -- marker/scripts/viewer.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":"marker/scripts/viewer.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e88bb3b084d9996574e5644dca7cf2a139822799c9dda72127f891381fbdcc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: marker/scripts/convert.py: marker/scripts/convert.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in convert.convert_cli at line 239. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:32:15 -05:00\u0027 --until=\u00272026-11-13 23:32:15 -05:00\u0027 --full-history --no-merges -- marker/scripts/convert.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":"marker/scripts/convert.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d0e14369eef89ab4aa7a0ac76ad187c5ea77ae9e002f3abc035523499e85cb"}},{"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: marker/processors/table_recon.py, marker/scripts/convert.py, marker/processors/llm/llm_table.py, marker/scripts/server.py, marker/processors/llm/llm_page_correction.py, benchmarks/inference.py, marker/renderers/__init__.py, marker/processors/llm/llm_sectionheader.py (\u002B6 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"60a14c3cc2f616cfceb7af1aedd0f3acfad4fbe04c8dec6eb1d746faa308d697"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (15 single-owned of 74 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; 74 of the 138 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: benchmarks/competitors/liteparse_infer.py."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060pyproject.toml\u0060 makes this repository a deployable product (line 48)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f93f7a2c78f190233679ac8202a9f8e691d2305d697b777ee579589e9c4bff1"}},{"ruleId":"D27","level":"note","message":{"text":"Scattered collaborators: 72 % of calls cross a namespace and only 37 % of collaborators are co-located \u2014 group each feature\u0027s code into a vertical slice so a call\u0027s collaborators sit together."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5aad4a4530bac3928d3a065a664be89d023ecfc865f9bf79ac05754b3bffe322"}},{"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":"de0bebde9756739ba42390c9aabb1a67255a48fb51a47244fd878e511356b8d8"},"properties":{"commitSha":"28560cbc567f212ff3b49906554860e833623332"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a4694634fcc293590fee9e2191767b55a632013523e5569a7db2972085e85fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7d0141152c5300ba863d47573fe0b6384121aac3afaa70381eea83bdc15cefe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1e315ee108c0ef562ce67afc8a028397a22037063b69dfeed4bc9ab20c1f6cc"},"taxa":[{"id":"CWE-269","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e691c6cc17786243b74cadcec8e3c95e627c4b76881d70fae4028ed5009393f6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c608177766a3ed5f982bf89a4b82d0c91a4af8c48969609bdb0361247089a964"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6579796ef67d85fa4342622ecd992df004838aabc8b06560a6c6f8bfbaa92ca5"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0368062220b7d03a1fa9e9d2bccb854d86c67fc9ecc0cc9ff48703e4ad75233a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3bfb062085fda1f3c91e45900c000e1ef9d1449d8ad7ab90e3a7218da6970c0c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d47becdf3c49bf2a42bad58d4f581776e3c28d79120f532f558ec349bb216fb4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ec1dd958ebf5e700901b249643a737748a49b922efc5af3e205502296713a8a0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe9c044a7e4afbd818dc5514683e28df013247aceebfe7267e86c4b5d48aeb7e"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"dbdc43dcbd812d0b57401c92d17f71fce24f742b3f7924c2012cb45c6011e670"},"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":"c505e434777b28f3b14bb11ca30ccd4f21dc1b36133f2e473187bc4572b3443b"},"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":"10489e37cff3de5980ee8ed891f3f2c61785cdec17eefa58154476340033e584"},"properties":{"dependency":{"package":"brotli","version":"1.2.0","advisory":"[GHSA redacted]","aliases":["BIT-brotli-2026-111497","BIT-dotnet-2026-111497","BIT-dotnet-sdk-2026-111497","BIT-node-2026-111497","BIT-node-min-2026-111497","BIT-powershell-2026-111497","[CVE redacted]","[GHSA redacted]","GO-2026-6888","PYSEC-2026-4322","PYSEC-2026-4323"],"reachability":{"kind":"unknown"}}}},{"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":"c6c10491006f6813f8b2d4070dc67d3681a8b944e3efa25cc1b3c96a54c4ce85"},"properties":{"dependency":{"package":"brotlicffi","version":"1.2.0.1","advisory":"[GHSA redacted]","aliases":["BIT-brotli-2026-111497","BIT-dotnet-2026-111497","BIT-dotnet-sdk-2026-111497","BIT-node-2026-111497","BIT-node-min-2026-111497","BIT-powershell-2026-111497","[CVE redacted]","[GHSA redacted]","GO-2026-6888","PYSEC-2026-4322","PYSEC-2026-4323"],"reachability":{"kind":"unknown"}}}},{"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":"c39221e7a57c94c8668f293a52beb2217070a9b1a940bee5edd4b6b0b226af4b"},"properties":{"dependency":{"package":"certifi","version":"2026.6.17","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"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":"09eef8b6625b25738f8700358b71be29a093fcfe59905926f2178ad3d178132f"},"properties":{"dependency":{"package":"pillow","version":"10.4.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-25990","BIT-pillow-2026-40192","BIT-pillow-2026-42308","BIT-pillow-2026-42310","BIT-pillow-2026-42311","BIT-pillow-2026-54058","BIT-pillow-2026-54059","BIT-pillow-2026-54060","BIT-pillow-2026-55379","BIT-pillow-2026-55380","BIT-pillow-2026-55798","BIT-pillow-2026-59197","BIT-pillow-2026-59198","BIT-pillow-2026-59199","BIT-pillow-2026-59200","BIT-pillow-2026-59204","BIT-pillow-2026-59205","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[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]","[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]","[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]","[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]","[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]","[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]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-165","PYSEC-2026-2249","PYSEC-2026-2250","PYSEC-2026-2252","PYSEC-2026-2253","PYSEC-2026-2254","PYSEC-2026-2255","PYSEC-2026-2256","PYSEC-2026-2257","PYSEC-2026-2874","PYSEC-2026-3451","PYSEC-2026-3453","PYSEC-2026-3454","PYSEC-2026-3493","PYSEC-2026-3494","PYSEC-2026-3495","PYSEC-2026-3496","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4343","PYSEC-2026-4363"],"reachability":{"kind":"production","file":"marker/builders/ocr.py","line":5}}}},{"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":"a848c382c8b8d7071a123cc620adc049527f5e7c02d12e6b43294a21f8ace908"},"properties":{"dependency":{"package":"aiohttp","version":"3.14.1","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]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-3545","PYSEC-2026-3546","PYSEC-2026-3547"],"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":"006bc09fe1c8f368204de0316eff374aa31b7c81c27de1cd301ae024f2a90b4d"},"properties":{"dependency":{"package":"cryptography","version":"49.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3552"],"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":"3.31.1","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]","[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":"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":"10e04b22e35243729294f2c63d26777ab5e2f09392f1c7f89a239026644367c0"},"properties":{"dependency":{"package":"fsspec","version":"2026.4.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4217"],"reachability":{"kind":"unknown"}}}},{"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":"575e71672c9901048ef5423bc0fd582e533de9919d1255fe21985ccc907301c5"},"properties":{"dependency":{"package":"jupyter-server","version":"2.20.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4054"],"reachability":{"kind":"unknown"}}}},{"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":"87f0cc47c402a8f083592d510fb0e4cdcc896fad54ede243587bea77c9a15b0a"},"properties":{"dependency":{"package":"jupyterlab","version":"4.6.1","advisory":"[GHSA redacted]","aliases":["BIT-jupyterlab-2026-102904","BIT-jupyterlab-2026-73415","BIT-jupyterlab-2026-73416","BIT-jupyterlab-2026-73417","BIT-jupyterlab-2026-73626","BIT-jupyterlab-2026-73627","[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]","PYSEC-2026-3670","PYSEC-2026-3671","PYSEC-2026-3672","PYSEC-2026-4055","PYSEC-2026-4056","PYSEC-2026-4057","PYSEC-2026-4058","PYSEC-2026-4059","PYSEC-2026-4060","PYSEC-2026-4112"],"reachability":{"kind":"unknown"}}}},{"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":"8cbb13c1ebd4a96b1d48789c4d1f8cb765655ee480de5b6cfcb31716ff26ad96"},"properties":{"dependency":{"package":"lxml","version":"5.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-87"],"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":"973761dc48415cb88e8328f335615cb9a9390dc14e167c265c3a4fcef8a1e0a7"},"properties":{"dependency":{"package":"nbconvert","version":"7.17.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"c7aaf1fb8559c36e5df33ec1068e23fe8da0a6bf8c468a8e6f2615c3a7cea7f6"},"properties":{"dependency":{"package":"notebook","version":"7.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-4057","PYSEC-2026-4058","PYSEC-2026-4060","PYSEC-2026-4112"],"reachability":{"kind":"unknown"}}}},{"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":"5102fe556f3399b622dcd81c118f7d1308c1374fbd00ede44c01babfc78c0a23"},"properties":{"dependency":{"package":"pyasn1","version":"0.6.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA 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":"c5edc0ec9e0f535342ada95ecc0efcbfe4f1ed6560267b94d06cbf1fa94b95ad"},"properties":{"dependency":{"package":"soupsieve","version":"2.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"c8d3dcf234d07496351880fce4779e84ddade6494e493217ff2558072baf308e"},"properties":{"dependency":{"package":"tornado","version":"6.5.7","advisory":"[GHSA redacted]","aliases":["[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]","PYSEC-2026-3928"],"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":"f268873f65bdaa9fa0eb6931555627e85a8ff8143ca35ae482b4a7d5ea5ae3e9"},"properties":{"dependency":{"package":"urllib3","version":"2.7.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4175","PYSEC-2026-4176","PYSEC-2026-4177"],"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":"cebe9ad6cd46790024b517d6c5049099ee23b44f50c9cae011efb57f253284fa"},"properties":{"dependency":{"package":"virtualenv","version":"21.6.1","advisory":"[GHSA redacted]","aliases":["BIT-virtualenv-2026-102925","BIT-virtualenv-2026-102930","BIT-virtualenv-2026-102937","BIT-virtualenv-2026-102938","BIT-virtualenv-2026-113714","BIT-virtualenv-2026-113715","BIT-virtualenv-2026-113716","BIT-virtualenv-2026-113717","BIT-virtualenv-2026-113718","BIT-virtualenv-2026-113719","BIT-virtualenv-2026-113720","BIT-virtualenv-2026-113721","BIT-virtualenv-2026-113722","BIT-virtualenv-2026-113723","BIT-virtualenv-2026-113724","BIT-virtualenv-2026-113725","BIT-virtualenv-2026-113726","BIT-virtualenv-2026-113732","BIT-virtualenv-2026-113776","[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]","[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]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4011","PYSEC-2026-4012","PYSEC-2026-4013","PYSEC-2026-4014"],"reachability":{"kind":"unknown"}}}},{"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":"81f3b5b6c0d05296f0e602a0822a984d4a7b598dbda182f358d5b535aefc133f"},"properties":{"dependency":{"package":"weasyprint","version":"63.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-2034","PYSEC-2026-3412","PYSEC-2026-3940","PYSEC-2026-4311"],"reachability":{"kind":"production","file":"marker/providers/__init__.py","line":63}}}},{"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":"91aabcbc80841d7613e48bded99bff95f9e1d6b21e7380ef7837b8a31042afde"},"properties":{"dependency":{"package":"datasets","version":"5.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3716"],"reachability":{"kind":"test-or-tooling","file":"tests/conftest.py","line":73}}}},{"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":"d2f69292b7500f63f60d9273f140d50be816fe0dca2dfb24841c4450b5194153"},"properties":{"dependency":{"package":"multidict","version":"6.7.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4244"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 7 of 74 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 74 of the 138 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: marker/providers/powerpoint.py, marker/processors/list.py, marker/services/azure_openai.py, marker/processors/block_relabel.py, marker/providers/document.py, marker/processors/blockquote.py, marker/config/crawler.py. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/providers/powerpoint.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cab8bb39bee03a14a7672a59771996e65fd28f6b35dd2471e547b5eef7b7239"}},{"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":"marker/processors/list.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"709a33f5df00b49099b0622745ab84dca7d8f7cfb99462153a0ef92eb67e5691"}},{"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":"marker/config/crawler.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc9059c0b6729977bff0f5aca92726d9daded86bc058c903642474c59540d11"}},{"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":"marker/services/azure_openai.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab47e2129ddf84b044ca0070963040cbd8c3ac6bc9a60812a82d6629b3a19fb"}},{"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":"marker/processors/block_relabel.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76a0c09b5826534f11c186ac2e2e341dded0d4df53ec64de90325df22f1ac90"}},{"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":"marker/providers/document.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa43a541ac7470da2fa5670258af8225e8adbe609944ccddbc8c35091d8049d1"}},{"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":"marker/processors/blockquote.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c95cf5f86836c204ba4ea255549f06d95fd6d9c8259b87746d7df39a44e94be"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: convert.py \u2194 convert_single.py: \u0060convert.py\u0060 and \u0060convert_single.py\u0060 change together 59% of the time (17 of the 29 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 17 shared commits counted here, the most recent 3 are \u006031498995\u0060 Add table converter; \u00600d1c9ff1\u0060 Add tests for llm processors; \u006052df53e1\u0060 Clean up benchmarks \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"convert.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32de92a3b7fffc7ab4dd6a9f56e6c40200657116e9afdf2b4b3b021699d5f769"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: pdf.py \u2194 html.py: \u0060marker/converters/pdf.py\u0060 and \u0060marker/renderers/html.py\u0060 change together 50% of the time (10 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060faa7e885\u0060 Add fast/balanced modes, CPU reading order, and pipeline perf work; \u0060d142598e\u0060 Iterate on inline math; \u00604480e918\u0060 dynamic option parsing and updated documentation \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/converters/pdf.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3848ac0d07f8197f199922710c2c9adec18d6cb3599a696d23c7eee169c927f6"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81d0799af757bba1afbed34637d383ea39ed22bd8ff8ec5b09c5aa413595d701"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cfcd82fdb168b13bb41affabdcb2cb35cf5ac7f10a66641c54fea8dc5b92503c"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20a3c1b7a0d7f7ce3ba869fd0cccf45884478beda2a41c16d75b08dd2ae0562a"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"M3","level":"note","message":{"text":"No src/ separation: Most of the production code is in directories of its own, but 4 application file(s) sit at the repository root beside the build and tooling files (\u0060convert.py\u0060, \u0060convert_single.py\u0060, \u0060marker_app.py\u0060, \u0060marker_server.py\u0060)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fdf7f5b24e313364d10170a5c2542959902fe0d26ed70edef3eaa10ec5bcdb1d"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 4 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/cla.yml"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060pyproject.toml\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cb10b4cecf1ff8954b4572fe00acd990e1e486a213ddb60c937a99b3b59c61"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060urlopen(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/providers/utils.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb99a5383385cef2f9abe802418817abdec679c6287f24677011aa43d4797a25"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060invoke_conversion\u0060 is async and calls requests.get, requests.post \u2014 a blocking call inside async code stalls the event loop \u2014 every other task on it waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/marker_modal_deployment.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"704b206e2f2875ae4dc1e636a8298dc395d081d5d51c48ca70ef609cfe0998d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getattr(response, \u0022usage\u0022, None) is not None and getattr(response.usage, \u0022total_tokens\u0022, None) is not None\u0060 appears character-identically in 2 files \u2014 marker/services/azure_openai.py, marker/services/openai.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":"marker/services/azure_openai.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0c15ee8950321fb0be550a690af0d220f124852a4187d5774f943bab81d1f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getattr(self, \u0022temp_pdf_path\u0022, None) and os.path.exists(self.temp_pdf_path)\u0060 appears character-identically in 5 files \u2014 marker/providers/document.py, marker/providers/epub.py, marker/providers/html.py, marker/providers/powerpoint.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":"marker/providers/document.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5176113203590c5e39aaa12b706d925f8391e967dac01a43c3d5fbe412ac789d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kwargs.pop(\u0022install_skill\u0022, None) or install_skill_dir\u0060 appears character-identically in 2 files \u2014 marker/scripts/convert.py, marker/scripts/convert_single.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":"marker/scripts/convert.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"803ad5d403f66d752738a55ba3484ea9cf0527b0da3ec5423027b8282ed6e195"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not response or \u0022corrected_html\u0022 not in response\u0060 appears character-identically in 3 files \u2014 marker/processors/llm/llm_form.py, marker/processors/llm/llm_mathblock.py, marker/processors/llm/llm_table.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":"marker/processors/llm/llm_form.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64720e35fa2feaf1501601b729992454f692a2b4bac8d951a3d334700de16b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not response or \u0022correction_type\u0022 not in response\u0060 appears character-identically in 2 files \u2014 marker/processors/llm/llm_page_correction.py, marker/processors/llm/llm_sectionheader.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":"marker/processors/llm/llm_page_correction.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"930ea226939ee0ae88969c225d93abf0d741cab8d89a9e583eb2cb69be179cde"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not self.use_llm or self.llm_service is None\u0060 appears character-identically in 2 files \u2014 marker/processors/llm/__init__.py, marker/processors/llm/llm_meta.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":"marker/processors/llm/__init__.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"571379f9b8e416bf24cc4c63760454da0c99c8b952396f0c76a52a42d075a561"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ocr_backend == \u0022auto\u0022 and effective_mode in (\u0022fast\u0022, \u0022indra\u0022)\u0060 appears character-identically in 2 files \u2014 marker/scripts/convert.py, marker/scripts/convert_single.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":"marker/scripts/convert.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0f55cd0cb439f63168ab17547f35e718499c08591932ae92b1aebb99786a5a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060provider is not None and hasattr(provider, \u0022page_lines\u0022)\u0060 appears character-identically in 2 files \u2014 marker/builders/layout.py, marker/ocr/indra.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":"marker/builders/layout.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30f3f5a6f2d85b118f4327262402858102b7f5e203a90269e9c16719a924bb0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.html and not self.ignore_for_output\u0060 appears character-identically in 2 files \u2014 marker/schema/blocks/pagefooter.py, marker/schema/blocks/pageheader.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":"marker/schema/blocks/pagefooter.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe58b6d5ec214f6707378d3e199a94ebc71bb366ee18cdc354814288dc4e818"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.mode not in (\u0022vllm\u0022, \u0022surya\u0022, \u0022accurate\u0022) and self.indra_model is not None and rec_model is not self.indra_model and type(exc).__name__\u2026\u0060 appears character-identically in 3 files \u2014 marker/builders/ocr.py, marker/processors/equation.py, marker/processors/table.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":"marker/builders/ocr.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f885343a17997bede725dcce435f32b5bb19c0e4cf5e6331b00c58d66df03ebe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.structure is not None and len(self.structure) \u003E 0\u0060 appears character-identically in 2 files \u2014 marker/schema/blocks/base.py, marker/schema/text/line.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":"marker/schema/blocks/base.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73607af0d610bab4e8705808827e85b01be4d1e618646b6921fc0bb93b6bd5a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060uses_indra and effective_mode in (\u0022fast\u0022, \u0022indra\u0022)\u0060 appears character-identically in 2 files \u2014 marker/scripts/convert.py, marker/scripts/convert_single.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":"marker/scripts/convert.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5b2aed81042b8e914e9bf4d04e091da3d4703cd8615b6ad9c424cb8c0b1257"}},{"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":"marker/models.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a75f875b59bedd617e071e1a6769fc7a2cfb9c4e9327172de9e4ee7585c8623"}},{"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":"marker/models.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d3f0e7305729e394ab0ee48575914498b60f7547642972a144060334561cff"}},{"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":"marker/settings.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dc3fe30d21b77b3058d4c44c98fbc061c822916cef583527c4ab82d13c8966"}},{"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":"marker/scripts/convert.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"85af3d02b59d631c16898422e20247e2bb3a616532054152dabea9adbfb0b775"}},{"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":"marker/scripts/convert.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23af5972ce8fa8b1949c0e8ae064ae61935a91cb2abe436a77708df12f56c4c"}},{"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":"marker/scripts/convert_single.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9d56a149410468658244d3554b7feaa31163de13c35895dd79fdbd09fb3647"}},{"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":"marker/scripts/viewer.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28b1a11ac008af5394c2a6686873c12da5bd094b047dfdc3c55755a6a038a54"}},{"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":"marker/providers/pdf.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"03547eb34c57e43abb7004e1aaae9dd7752b5c3aacf08b36adf3f229bff4b2f0"}},{"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":"marker/providers/registry.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c3b54ef137002bab61aee6610d7484234f441005beae73b49f29ded98516fa"}},{"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":"marker/builders/line.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"545dc82f7789ca7270312ce538fe7ce09b67d796ef867c9aba94d14a638c1e51"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/util.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2d975bd04db75b29671a5866de90c71bffe69cd496a8cd2b869efa7dc9d3aa"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/scripts/viewer.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a84422d550af40ada687916edc6acf84c92cfa723ed34a0e016df2231fa074"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/schema/blocks/equation.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d95229c496c825def96b47965f9a954c4b0e6b958372fb53acb0ea6899b6bba"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/schema/blocks/sectionheader.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a9e480f7565eb6a94985b1fb71cfc125336240787fd26c56891caeb16546e3"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/ocr/indra.py"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"2384b12f53418074cb1899912dcde316f9d5a52607dbb4858a83b5f1b665cb3b"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/builders/ocr.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed1d56a923f5b211c32cdfaa20362e40019550534abd7275470c4dbccb7540c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_one\u0060 swallows every exception into \u0060return -1\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":"benchmarks/competitors/liteparse_infer.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f184e12fcdfbac5e5fee047a3150793bffab9b8fc9a9e391dec5070611eee11"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060rm.endswith(\u0022$\u0022)\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060rm.endswith(\u0022$$\u0022)\u0060 also satisfies \u0060rm.endswith(\u0022$\u0022)\u0060, so the \u0060\u0026\u0026\u0060 chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"marker/ocr/indra.py"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90d4f9d7264a2edb4e273c7bd23af2a771704b7e8e072ae799e4d61bb745504"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-269","guid":"70e1f5f6-81e5-4e5a-ba40-b541c3a346e2","name":"Improper Privilege Management","shortDescription":{"text":"Improper Privilege Management"},"helpUri":"https://cwe.mitre.org/data/definitions/269.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-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-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":46,"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."]}]}