{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2604.26831","arxiv_id":"2604.26831","integrity":{"available":true,"endpoint":"/pith/2604.26831/integrity.json","summary":{"critical":2,"advisory":6,"informational":0,"by_detector":{"doi_compliance":{"total":8,"critical":2,"advisory":6,"informational":0}}},"clean":false,"detectors_run":[{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-19T19:45:16.033333Z","findings_count":8}],"findings":[{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1145/3088511.url:https://doi.org/10.1145/3088511' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","detected_doi":"10.1145/3088511.url:https://doi.org/10.1145/3088511","detected_arxiv_id":null,"ref_index":1,"audited_at":"2026-05-19T19:45:16.033333Z"},{"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.4230/LIPIcs.FSTTCS.2025.50.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.50) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.4230/LIPIcs.FSTTCS.2025.50.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.50","detected_arxiv_id":null,"ref_index":25,"audited_at":"2026-05-19T19:45:16.033333Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1137/16m1105815.url:https://doi.org/10.1137/16m1105815' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","detected_doi":"10.1137/16m1105815.url:https://doi.org/10.1137/16m1105815","detected_arxiv_id":null,"ref_index":2,"audited_at":"2026-05-19T19:45:16.033333Z"},{"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.1006/jagm.2000.1117.url:http://dl.acm.org/doi/pdf/10.5555/314161.314190) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1006/jagm.2000.1117.url:http://dl.acm.org/doi/pdf/10.5555/314161.314190","detected_arxiv_id":null,"ref_index":14,"audited_at":"2026-05-19T19:45:16.033333Z"},{"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.1145/1868237.1868242.url:https://doi.org/10.1145/1868237.1868242) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1145/1868237.1868242.url:https://doi.org/10.1145/1868237.1868242","detected_arxiv_id":null,"ref_index":10,"audited_at":"2026-05-19T19:45:16.033333Z"},{"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.1137/1.9781611973105.36.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611973105.36.41) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1137/1.9781611973105.36.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611973105.36.41","detected_arxiv_id":null,"ref_index":13,"audited_at":"2026-05-19T19:45:16.033333Z"},{"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.1145/380752.380797.url:https://doi.org/10.1145/380752.380797) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1145/380752.380797.url:https://doi.org/10.1145/380752.380797","detected_arxiv_id":null,"ref_index":19,"audited_at":"2026-05-19T19:45:16.033333Z"},{"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.1137/1.9781611977912.170.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611977912.170) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1137/1.9781611977912.170.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611977912.170","detected_arxiv_id":null,"ref_index":26,"audited_at":"2026-05-19T19:45:16.033333Z"}],"snapshot_sha256":"dd912680ff74a6019ed4d94adaaf3d776ccab4ea43a48cd89ddd62df73bb125e"},"events":[{"event_id":2774,"event_type":"pith.integrity.v1","payload_sha256":"d8ab8eaf32356bb1ac8e8ab1f8f34131bb9b819e6ef522fa7f986b0d8be2a8aa","signature_b64":"rNLlS+3NaLAL8ec7o4UvUknX27tnD3TY5f2hLTdBkH/mY2G+9kBfQ5JBxbtoq/TnHN2UGdqtmRLSpRgKuKd/BA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T19:47:20.193495+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/1.9781611977912.170.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611977912.170) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Barna Saha and Christopher Ye. “Faster Approximate All Pairs Shortest Paths”. In:Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). siam, 2023, pp. 4758–4827.doi:10.1137/ 1.9781611977912.170. eprint:https://epu","arxiv_id":"2604.26831","detector":"doi_compliance","evidence":{"ref_index":26,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Barna Saha and Christopher Ye. “Faster Approximate All Pairs Shortest Paths”. In:Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). siam, 2023, pp. 4758–4827.doi:10.1137/ 1.9781611977912.170. eprint:https://epu","reconstructed_doi":"10.1137/1.9781611977912.170.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611977912.170"},"severity":"advisory","ref_index":26,"audited_at":"2026-05-19T19:45:16.033333Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/1.9781611977912.170.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611977912.170","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"d81f5e3da75e6eccecb0621a87d846be12cd6889eb163acff14576c01f0cf357","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2773,"event_type":"pith.integrity.v1","payload_sha256":"bc0e4ce96ca2207c6c24e28df8ae7c0564ab8f96d22745d91df7e2f65026a03f","signature_b64":"NoamLdT9ULCSlOP8lI7ukMPlMrVATjXV4zbz6qhzYkQOd4h8CynSo6m8NkiZFjomhOZY90cGXbRCWjQzFpKICw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T19:47:20.192299+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/LIPIcs.FSTTCS.2025.50.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.50) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Liam Roditty and Ariel Sapir. “Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-Offs and Algorithms”. In:45th IARCS Annual Conference on Foundations of Software Technology and Theoreti","arxiv_id":"2604.26831","detector":"doi_compliance","evidence":{"ref_index":25,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Liam Roditty and Ariel Sapir. “Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-Offs and Algorithms”. In:45th IARCS Annual Conference on Foundations of Software Technology and Theoreti","reconstructed_doi":"10.4230/LIPIcs.FSTTCS.2025.50.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.50"},"severity":"advisory","ref_index":25,"audited_at":"2026-05-19T19:45:16.033333Z","event_type":"pith.integrity.v1","detected_doi":"10.4230/LIPIcs.FSTTCS.2025.50.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.50","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"6ebc3f3617b8a991f29074dc04191a8a20be3fc297f23e5ffe19ed8a28f6692d","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2772,"event_type":"pith.integrity.v1","payload_sha256":"a28df6e7baad122f807344454a20abdb09a8d08bb44add61ccf778508e0f4c89","signature_b64":"VFPHVmdCHafM1DsYKF3qL5ZqcGQEFK2MfE2d1IvR/iOQqaav8RUsWFdOvfU5KRFXxp1fU39GEiFGQm9C9bxFCQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T19:47:20.191158+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/380752.380797.url:https://doi.org/10.1145/380752.380797) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Michael Elkin and David Peleg. “(1 +ε·β)-spanner constructions for general graphs”. In:Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing. STOC ’01. Hersonissos, Greece: Association for Computing Machinery, 2001, pp","arxiv_id":"2604.26831","detector":"doi_compliance","evidence":{"ref_index":19,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Michael Elkin and David Peleg. “(1 +ε·β)-spanner constructions for general graphs”. In:Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing. STOC ’01. Hersonissos, Greece: Association for Computing Machinery, 2001, pp","reconstructed_doi":"10.1145/380752.380797.url:https://doi.org/10.1145/380752.380797"},"severity":"advisory","ref_index":19,"audited_at":"2026-05-19T19:45:16.033333Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/380752.380797.url:https://doi.org/10.1145/380752.380797","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"d1c15d7ec5eeb558ce5cea9e52ed501b0e0bc54124a99e6e3fdb8ad8caeba776","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2771,"event_type":"pith.integrity.v1","payload_sha256":"17bd8a335992e0af0539287e547cf3c89d37850b330c31ba46f87156eb376105","signature_b64":"1JDuJFKQtiJDcjkzmpmM+VcYojKoAyWfC9u1yZ7UgtpDf5B2/8NOBYOxdjQOls6UVm+cPz2oV7wNUb9C7lM5Bg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T19:47:20.189990+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1006/jagm.2000.1117.url:http://dl.acm.org/doi/pdf/10.5555/314161.314190) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Edith Cohen and Uri Zwick. “All-Pairs Small-Stretch Paths”. In:Journal of Algorithms38.2 (1997), pp. 335– 353.issn: 0196-6774.doi:http://doi.org/10.1006/jagm.2000.1117.url:http://dl.acm.org/doi/pdf/10. 5555/314161.314190","arxiv_id":"2604.26831","detector":"doi_compliance","evidence":{"ref_index":14,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Edith Cohen and Uri Zwick. “All-Pairs Small-Stretch Paths”. In:Journal of Algorithms38.2 (1997), pp. 335– 353.issn: 0196-6774.doi:http://doi.org/10.1006/jagm.2000.1117.url:http://dl.acm.org/doi/pdf/10. 5555/314161.314190","reconstructed_doi":"10.1006/jagm.2000.1117.url:http://dl.acm.org/doi/pdf/10.5555/314161.314190"},"severity":"advisory","ref_index":14,"audited_at":"2026-05-19T19:45:16.033333Z","event_type":"pith.integrity.v1","detected_doi":"10.1006/jagm.2000.1117.url:http://dl.acm.org/doi/pdf/10.5555/314161.314190","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"c8836d1e9185a37c0f3d70b9fdaa32f3bf3e86d9695bb1a67fd1bc61aefd7fb0","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2770,"event_type":"pith.integrity.v1","payload_sha256":"4d14da5b9dffa180f731783c5a75c80f4f71f605f6837a7fc568ddb446400bb0","signature_b64":"5z2Ysaxlanc4KR7ToQEG+TrSF6PB44JCG4tLA92dGq7cL6Lnzo5tbZwQJ+US6/5jLmip0bLT91Q7VOl8RlQwAw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T19:47:20.188837+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/1.9781611973105.36.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611973105.36.41) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Shiri Chechik. “New Additive Spanners”. In:Proceedings of the 2013 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 498–512.doi:10.1137/1.9781611973105.36.url:https://epubs.siam. org/doi/abs/10.1137/1.9781611973105.36. 41","arxiv_id":"2604.26831","detector":"doi_compliance","evidence":{"ref_index":13,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Shiri Chechik. “New Additive Spanners”. In:Proceedings of the 2013 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 498–512.doi:10.1137/1.9781611973105.36.url:https://epubs.siam. org/doi/abs/10.1137/1.9781611973105.36. 41","reconstructed_doi":"10.1137/1.9781611973105.36.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611973105.36.41"},"severity":"advisory","ref_index":13,"audited_at":"2026-05-19T19:45:16.033333Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/1.9781611973105.36.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611973105.36.41","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"52384db8439feca9045715884bae5e4138580eaa96eb7ab7f0917bca45bd8c8b","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2769,"event_type":"pith.integrity.v1","payload_sha256":"493e945b707329a924b2ed67ae673a35107afced6385c4fd0ce69daefe259b22","signature_b64":"+BQbZxvK9VNr69gARNjoYfOrioKuXHihCU+wi9FwZl+Nz6ibmS/UhTxqF/Eh7N077rlQoW3Bd8R35LT+GPuVDQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T19:47:20.187543+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/1868237.1868242.url:https://doi.org/10.1145/1868237.1868242) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie. “Additive spanners and (α,β)- spanners”. In:ACM Trans. Algorithms7.1 (Dec. 2010).issn: 1549-6325.doi:10.1145/1868237.1868242.url: https://doi.org/10.1145/1868237.1868242","arxiv_id":"2604.26831","detector":"doi_compliance","evidence":{"ref_index":10,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie. “Additive spanners and (α,β)- spanners”. In:ACM Trans. Algorithms7.1 (Dec. 2010).issn: 1549-6325.doi:10.1145/1868237.1868242.url: https://doi.org/10.1145/1868237.1868242","reconstructed_doi":"10.1145/1868237.1868242.url:https://doi.org/10.1145/1868237.1868242"},"severity":"advisory","ref_index":10,"audited_at":"2026-05-19T19:45:16.033333Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/1868237.1868242.url:https://doi.org/10.1145/1868237.1868242","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"fd7748bb76f6157614a9bf15559565e28f0d82b21e6982ea52446f666f089a61","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2768,"event_type":"pith.integrity.v1","payload_sha256":"05115a1fa5d061154c7d5660f22d786cbb29b98292528a9508145038ba6852bf","signature_b64":"HShOxL1c0SpP4s4cOi3niZe+imDOrl8KfofDZwvqqbC32EuQIyRweIIABIExQcEesxHkHM2HW37Rgbn7aEluAA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T19:47:20.186350+00:00","payload":{"note":"Identifier '10.1137/16m1105815.url:https://doi.org/10.1137/16m1105815' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Amir Abboud, Greg Bodwin, and Seth Pettie. “A Hierarchy of Lower Bounds for Sublinear Additive Spanners”. In:SIAM Journal on Computing47.6 (2018), pp. 2203–2236.doi:10 . 1137 / 16M1105815. eprint:https : //doi.org/10.1137/16M1105815.url:htt","arxiv_id":"2604.26831","detector":"doi_compliance","evidence":{"doi":"10.1137/16m1105815.url:https://doi.org/10.1137/16m1105815","arxiv_id":null,"ref_index":2,"raw_excerpt":"Amir Abboud, Greg Bodwin, and Seth Pettie. “A Hierarchy of Lower Bounds for Sublinear Additive Spanners”. In:SIAM Journal on Computing47.6 (2018), pp. 2203–2236.doi:10 . 1137 / 16M1105815. eprint:https : //doi.org/10.1137/16M1105815.url:https://doi.org/10.1137/16M1105815","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":2,"audited_at":"2026-05-19T19:45:16.033333Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/16m1105815.url:https://doi.org/10.1137/16m1105815","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"52d400b6488b54d549324ecf9b9d1686c52f989ed7e932cd4c4a8c40faa86478","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2767,"event_type":"pith.integrity.v1","payload_sha256":"b5a5d28351dcdd0c6fcae2db2dcce37d9f76bad5031c53e273206759f6fcfeea","signature_b64":"8fMgn0+vKk5yx5VyXXwCgA9uiKtVPLzEIscuPttHkmbu8370b9n/kDD847Z3LjARaVhtn3lqQvK1MG1aU6NXBg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T19:47:20.185101+00:00","payload":{"note":"Identifier '10.1145/3088511.url:https://doi.org/10.1145/3088511' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Amir Abboud and Greg Bodwin. “The 4/3 Additive Spanner Exponent Is Tight”. In:J. ACM64.4 (Sept. 2017). issn: 0004-5411.doi:10.1145/3088511.url:https://doi.org/10.1145/3088511","arxiv_id":"2604.26831","detector":"doi_compliance","evidence":{"doi":"10.1145/3088511.url:https://doi.org/10.1145/3088511","arxiv_id":null,"ref_index":1,"raw_excerpt":"Amir Abboud and Greg Bodwin. “The 4/3 Additive Spanner Exponent Is Tight”. In:J. ACM64.4 (Sept. 2017). issn: 0004-5411.doi:10.1145/3088511.url:https://doi.org/10.1145/3088511","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":1,"audited_at":"2026-05-19T19:45:16.033333Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/3088511.url:https://doi.org/10.1145/3088511","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"ff1248224bc2634816a5c4091ff3aa32a5bd5c8f61b415f87b6b300ec4ddabf1","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2604.26831/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}