{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2605.03334","arxiv_id":"2605.03334","integrity":{"available":true,"endpoint":"/pith/2605.03334/integrity.json","summary":{"critical":3,"advisory":1,"informational":0,"by_detector":{"doi_compliance":{"total":4,"critical":3,"advisory":1,"informational":0}}},"clean":false,"detectors_run":[{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-20T14:33:59.406683Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-05-20T01:31:21.382028Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-19T15:28:21.357452Z","findings_count":4}],"findings":[{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1016/s0020-0190(97' 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.1016/s0020-0190(97","detected_arxiv_id":null,"ref_index":6,"audited_at":"2026-05-19T15:28:21.357452Z"},{"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/j.comgeo.2014.08.003.13) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/j.comgeo.2014.08.003.13","detected_arxiv_id":null,"ref_index":7,"audited_at":"2026-05-19T15:28:21.357452Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1016/0196-6774(81' 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.1016/0196-6774(81","detected_arxiv_id":null,"ref_index":9,"audited_at":"2026-05-19T15:28:21.357452Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1016/0022-0000(89' 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.1016/0022-0000(89","detected_arxiv_id":null,"ref_index":10,"audited_at":"2026-05-19T15:28:21.357452Z"}],"snapshot_sha256":"65eeb682c8d5677c560e7c16c42937f8606e35f31102d51085058e0a76e8164b"},"events":[{"event_id":1858,"event_type":"pith.integrity.v1","payload_sha256":"e4e35caff794ae2d5b21227de0ffc2f9257b4fd536e3c64edf97ad22fd781015","signature_b64":"7aGTeaIv0IfZ604r9SoQmzWoEQeMJyOe/YqPI+ZPacP+o8aZcb1wKpcf93Ndy+h4axk/AUl84VXcAx4Nn1pHDg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T15:32:16.859019+00:00","payload":{"note":"Identifier '10.1016/0022-0000(89' 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":"doi:10.1016/0022-0000(89) 90041-X. Bhore, Liu, Naredla, Nekrich, Oh, van Renssen, Staals, Wang, and Xue 37 18 Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, and Robert E. Tarjan. Linear-time algorithms for visibility and ","arxiv_id":"2605.03334","detector":"doi_compliance","evidence":{"doi":"10.1016/0022-0000(89","arxiv_id":null,"ref_index":10,"raw_excerpt":"doi:10.1016/0022-0000(89) 90041-X. Bhore, Liu, Naredla, Nekrich, Oh, van Renssen, Staals, Wang, and Xue 37 18 Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, and Robert E. Tarjan. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons.Algorithmica, 2(1-4):209–233, 1987.doi:10.1007/BF01840360. 19 Leonidas J. Guibas, Rajeev Motwani, and","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":10,"audited_at":"2026-05-19T15:28:21.357452Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0022-0000(89","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"173ba56e57e68a3d799520c568dc822aeccc3e80b3e416b32add97bfdea39685","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":1857,"event_type":"pith.integrity.v1","payload_sha256":"850f133bb542ba726ecbab6679b397cc06e7cf9738251e55741c1e0af0af7971","signature_b64":"lTF2kKrX0zMDrG/pQd23CIAGGzu/o24Gp68ON8frb75B7oUnj0jC7GXrwiKfEtwrf9OYf89aAik+HKEFKu1zDg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T15:32:16.855747+00:00","payload":{"note":"Identifier '10.1016/0196-6774(81' 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":"doi:10.1016/0196-6774(81) 90019-5. 17 Leonidas J. Guibas and John Hershberger. Optimal shortest path queries in a simple polygon. Journal of Computer and System Sciences, 39(2):126–152,","arxiv_id":"2605.03334","detector":"doi_compliance","evidence":{"doi":"10.1016/0196-6774(81","arxiv_id":null,"ref_index":9,"raw_excerpt":"doi:10.1016/0196-6774(81) 90019-5. 17 Leonidas J. Guibas and John Hershberger. Optimal shortest path queries in a simple polygon. Journal of Computer and System Sciences, 39(2):126–152,","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":9,"audited_at":"2026-05-19T15:28:21.357452Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0196-6774(81","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"df3986e1c5b551fc4c870bb9ea5aec8585d09adfa11395ff5b3c2ef09b8676e9","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":1856,"event_type":"pith.integrity.v1","payload_sha256":"1459ade8e00a5eefb3b7b28fac5b8096f160852f56e3bbbbebe0dfdd8d7003a0","signature_b64":"XOHvLYvB8MWJMou/VAnzxpbep1rMcHrahkCiLhiigg8/pxtsuqxlR/a4k3aIbGz4N2PsX2oOr40qXsk9gV5gAA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T15:32:16.853253+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/j.comgeo.2014.08.003.13) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"doi:10.1016/j.comgeo. 2014.08.003. 13 Danny Z. Chen and Haitao Wang. Weak visibility queries of line segments in simple polygons. Computational Geometry: Theory and Applications, 48:443–452, 2015.doi:10.1016/j.comgeo. 2015.02.001. 14 James ","arxiv_id":"2605.03334","detector":"doi_compliance","evidence":{"ref_index":7,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"doi:10.1016/j.comgeo. 2014.08.003. 13 Danny Z. Chen and Haitao Wang. Weak visibility queries of line segments in simple polygons. Computational Geometry: Theory and Applications, 48:443–452, 2015.doi:10.1016/j.comgeo. 2015.02.001. 14 James ","reconstructed_doi":"10.1016/j.comgeo.2014.08.003.13"},"severity":"advisory","ref_index":7,"audited_at":"2026-05-19T15:28:21.357452Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.comgeo.2014.08.003.13","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"42666e77050e0476e052f6350a2573d3383ad00e40354ad96b57e1fcd3752b0b","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":1855,"event_type":"pith.integrity.v1","payload_sha256":"730d78b0c2387e66f4f9b85f70e34702de7589e88943a827b7e25167f3efc6ef","signature_b64":"wjVUx2UlGi+3s9WtoZDWpETvPZN+aQuKcEK0BRzB1UqhHFPLyjDpxoBOJtHKfbwUNqSM5GP7tlbzCQ66ZMS8BA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T15:32:16.829594+00:00","payload":{"note":"Identifier '10.1016/s0020-0190(97' 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":"doi:10.1016/S0020-0190(97) 00211-1. 12 Danny Z. Chen and Haitao Wang. Visibility and ray shooting queries in polygonal domains. Computational Geometry: Theory and Applications, 48:31–41,","arxiv_id":"2605.03334","detector":"doi_compliance","evidence":{"doi":"10.1016/s0020-0190(97","arxiv_id":null,"ref_index":6,"raw_excerpt":"doi:10.1016/S0020-0190(97) 00211-1. 12 Danny Z. Chen and Haitao Wang. Visibility and ray shooting queries in polygonal domains. Computational Geometry: Theory and Applications, 48:31–41,","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":6,"audited_at":"2026-05-19T15:28:21.357452Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/s0020-0190(97","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"e82a8c98b1933c281a9a4bde3243deb61169aa359af800357e768ce4974e3e46","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2605.03334/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}