{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.11709","arxiv_id":"2607.11709","integrity":{"available":true,"endpoint":"/pith/2607.11709/integrity.json","summary":{"critical":1,"advisory":1,"informational":0,"by_detector":{"doi_compliance":{"total":2,"critical":1,"advisory":1,"informational":0}}},"clean":false,"detectors_run":[{"name":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-03T07:51:22.224540Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-01T05:08:57.947983Z","findings_count":0},{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-07-21T04:53:55.520907Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-07-20T10:47:44.209919Z","findings_count":0},{"name":"external_links","version":"1.0.0","status":"completed","ran_at":"2026-07-14T23:36:51.028494Z","findings_count":0},{"name":"shingle_duplication","version":"0.1.0","status":"completed","ran_at":"2026-07-14T17:54:04.559409Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"completed","ran_at":"2026-07-14T07:57:09.839953Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-14T05:21:54.803344Z","findings_count":0}],"findings":[{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1145/367766.368168.url:https://doi.org/10.1145/367766.368168' 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/367766.368168.url:https://doi.org/10.1145/367766.368168","detected_arxiv_id":null,"ref_index":6,"audited_at":"2026-07-14T03:46:45.223703Z"},{"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.5070/c64264235.url:http://dx.doi.org/10) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.5070/c64264235.url:http://dx.doi.org/10","detected_arxiv_id":null,"ref_index":4,"audited_at":"2026-07-14T03:46:45.223703Z"}],"snapshot_sha256":"b6b456c3f62b723399a924b0caeefae9a11c25957a317ceef588ae501b037111"},"events":[{"event_id":13116,"event_type":"pith.integrity.v1","payload_sha256":"908b88af32f6e606d3900ad9014c0c4484e8b236bb13ac277cf360256e9c5061","signature_b64":"A53nnGTHziNDJA8C9lFGD2c/aqQrBDqH9c4c+n02BqYRNiqDYho4mY34TYiLFCK6uYmLAltq3wPqhJgJSMoCCg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-14T03:50:22.064013+00:00","payload":{"note":"Identifier '10.1145/367766.368168.url:https://doi.org/10.1145/367766.368168' 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":"Robert W. Floyd. “Algorithm 97: Shortest path”. In:Commun. ACM5.6 (June 1962), p. 345.ISSN: 0001-0782. DOI:10.1145/367766.368168.URL:https://doi.org/10.1145/367766.368168","arxiv_id":"2607.11709","detector":"doi_compliance","evidence":{"doi":"10.1145/367766.368168.url:https://doi.org/10.1145/367766.368168","arxiv_id":null,"ref_index":6,"raw_excerpt":"Robert W. Floyd. “Algorithm 97: Shortest path”. In:Commun. ACM5.6 (June 1962), p. 345.ISSN: 0001-0782. DOI:10.1145/367766.368168.URL:https://doi.org/10.1145/367766.368168","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":6,"audited_at":"2026-07-14T03:46:45.223703Z","event_type":"pith.integrity.v1","detected_doi":"10.1145/367766.368168.url:https://doi.org/10.1145/367766.368168","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"4d0c67e85371b3154eaa20390095333caaf7432bf8594b7dddc51de605e7c154","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":13115,"event_type":"pith.integrity.v1","payload_sha256":"bf15fb0a1ee23702697e9bde45a1062ad97df34612aacc3605e769268e21d40f","signature_b64":"MbsO9fBk+T/uxj69MVUvW9yOI+24nvWEEcEJqQ3vkf0NHRAXhr72Sb1hv6kJnTtjUU3rEPrnYOtZv8v3SxUiCA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-14T03:50:22.061187+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.5070/c64264235.url:http://dx.doi.org/10) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Grant T. Barkley and David E Speyer. “Combinatorial descriptions of biclosed sets in affine type”. In:Combina- torial Theory4.2 (Sept. 2024).ISSN: 2766-1334.DOI: 10.5070/c64264235.URL: http://dx.doi.org/10. 5070/C64264235","arxiv_id":"2607.11709","detector":"doi_compliance","evidence":{"ref_index":4,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Grant T. Barkley and David E Speyer. “Combinatorial descriptions of biclosed sets in affine type”. In:Combina- torial Theory4.2 (Sept. 2024).ISSN: 2766-1334.DOI: 10.5070/c64264235.URL: http://dx.doi.org/10. 5070/C64264235","reconstructed_doi":"10.5070/c64264235.url:http://dx.doi.org/10"},"severity":"advisory","ref_index":4,"audited_at":"2026-07-14T03:46:45.223703Z","event_type":"pith.integrity.v1","detected_doi":"10.5070/c64264235.url:http://dx.doi.org/10","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"624553640608cd7a0103a1d8d6e83a6c0c10ce6a37a244c46d7e6940adb3f567","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.11709/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}