{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2605.12457","arxiv_id":"2605.12457","integrity":{"available":true,"endpoint":"/pith/2605.12457/integrity.json","summary":{"critical":0,"advisory":2,"informational":0,"by_detector":{"doi_compliance":{"total":2,"critical":0,"advisory":2,"informational":0}}},"clean":false,"detectors_run":[{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-05-20T13:01:24.840707Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-20T09:27:32.763023Z","findings_count":2},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-05-19T22:21:57.825803Z","findings_count":0},{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-19T10:34:59.376661Z","findings_count":0}],"findings":[{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/0196-6774(91) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/0196-6774(91","detected_arxiv_id":null,"ref_index":1,"audited_at":"2026-05-19T07:27:15.414548Z"},{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/S0166-218X(96) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/S0166-218X(96","detected_arxiv_id":null,"ref_index":13,"audited_at":"2026-05-19T07:27:15.414548Z"}],"snapshot_sha256":"e144d5885e2d5c0a7da80622a2cc9db3febe4cabf9c6f2592a27329fce8e3a76"},"events":[{"event_id":319,"event_type":"pith.integrity.v1","payload_sha256":"f15c8bf0a8cd26c9d5cc9b158a3718cf463de057ba5ccce5372b544a5ff37a1c","signature_b64":"yw5QT3fHvBHIxbeYBOxNM1aKMy0DIR+iqf1s4jP2sR1l8xpwrLkP5wGrYxdMHhEN4bWR9jfeNj1dr2J5YpEzAg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T07:31:54.667466+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/S0166-218X(96) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Yinnone, H.: On paths avoiding forbidden pairs of vertices in a graph. Dis- crete Applied Mathematics74(1), 85–92 (1997). https://doi.org/10.1016/S0166- 218X(96)00017-0 A Well-definedness of the output ofNormalize Claim 14 (Normalizeoutputs","arxiv_id":"2605.12457","detector":"doi_compliance","evidence":{"ref_index":13,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Yinnone, H.: On paths avoiding forbidden pairs of vertices in a graph. Dis- crete Applied Mathematics74(1), 85–92 (1997). https://doi.org/10.1016/S0166- 218X(96)00017-0 A Well-definedness of the output ofNormalize Claim 14 (Normalizeoutputs","reconstructed_doi":"10.1016/S0166-218X(96"},"severity":"advisory","ref_index":13,"audited_at":"2026-05-19T07:27:15.414548Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/S0166-218X(96","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"9d14f4d8278f880847773c1c15e71e8e058d3f9d0328e27b30f07da2057b1c3b","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":318,"event_type":"pith.integrity.v1","payload_sha256":"ac31d890466ed15ee171293b0ae1aae0be70d3bc1820e50e332a323cf91a330b","signature_b64":"3o2KjnSoIAzFCDnWR+4lak2U/0kodhkqooq2PGl0+GfxaJZ6Tjpqy1tSkmPL4Htm3lvoVmKr6RGf8ohjDk81AQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T07:31:54.666194+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/0196-6774(91) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms12(2), 308–340 (1991). https://doi.org/10.1016/0196- 6774(91)90006-K","arxiv_id":"2605.12457","detector":"doi_compliance","evidence":{"ref_index":1,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms12(2), 308–340 (1991). https://doi.org/10.1016/0196- 6774(91)90006-K","reconstructed_doi":"10.1016/0196-6774(91"},"severity":"advisory","ref_index":1,"audited_at":"2026-05-19T07:27:15.414548Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0196-6774(91","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"bf82ab0fd9cb4d205a0bcd452381aceee652f069731885f259aef93ad2b15cc9","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2605.12457/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}