{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.07153","arxiv_id":"2607.07153","integrity":{"available":true,"endpoint":"/pith/2607.07153/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_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-07-19T21:34:53.849236Z","findings_count":0},{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-07-16T09:02:15.717892Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-07-15T19:46:34.230698Z","findings_count":2},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-07-15T15:44:44.158118Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"completed","ran_at":"2026-07-09T19:58:09.232566Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-09T16:18:31.136487Z","findings_count":0}],"findings":[{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.5555/578533' 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.5555/578533","detected_arxiv_id":null,"ref_index":24,"audited_at":"2026-07-09T18:59:16.459412Z"},{"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.tcs.2005.08.031.15) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/j.tcs.2005.08.031.15","detected_arxiv_id":null,"ref_index":26,"audited_at":"2026-07-09T18:59:16.459412Z"}],"snapshot_sha256":"7e22d569a819020c5dde6252a1630d1a1dc26726e7f7719e0236f8f418d4c708"},"events":[{"event_id":10377,"event_type":"pith.integrity.v1","payload_sha256":"36c3a88c2321dde6d13f238bc2fc7596ae76f767ee63cdc5e1313fe3f14f45ae","signature_b64":"zTtJJ5JpYkbypQORgJ7r++5UrsReF3MCu+X0X+X8cns+fILcAAp3WZb20EfYed0ZwiJa5O8LwSyD9Yc9bqOdDg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-09T19:03:09.183338+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/j.tcs.2005.08.031.15) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Edith Hemaspaandra, Holger Spakowski, and Jörg Vogel. The complexity of Kemeny elec- tions.Theoretical Computer Science, 349:382–391, 2005.doi:10.1016/j.tcs.2005.08. 031. 15","arxiv_id":"2607.07153","detector":"doi_compliance","evidence":{"ref_index":26,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Edith Hemaspaandra, Holger Spakowski, and Jörg Vogel. The complexity of Kemeny elec- tions.Theoretical Computer Science, 349:382–391, 2005.doi:10.1016/j.tcs.2005.08. 031. 15","reconstructed_doi":"10.1016/j.tcs.2005.08.031.15"},"severity":"advisory","ref_index":26,"audited_at":"2026-07-09T18:59:16.459412Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.tcs.2005.08.031.15","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"ca4c86ca5b9b8d266c2a5a8303a08d0c3d4ef7aee28ca1f6182f20b92ffed2ea","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":10376,"event_type":"pith.integrity.v1","payload_sha256":"b887d98ac3644df7ca26ae9638c1e0796d4c93cdc5cc19d39551218eb61939bc","signature_b64":"Jps94xAWw8K2Whk0RGTptuT9vj46qIxxizdy1ybV0/zoC6rsoAQ0wbBsiiwSRoJCoREoaxULdVCyyslgtdr+DQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-09T19:03:09.178714+00:00","payload":{"note":"Identifier '10.5555/578533' 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":"Michael R. Garey and David S. Johnson.Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco, 1979. URL: https://dl.acm.org/doi/10.5555/578533,doi:10.5555/578533","arxiv_id":"2607.07153","detector":"doi_compliance","evidence":{"doi":"10.5555/578533","arxiv_id":null,"ref_index":24,"raw_excerpt":"Michael R. Garey and David S. Johnson.Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco, 1979. URL: https://dl.acm.org/doi/10.5555/578533,doi:10.5555/578533","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":24,"audited_at":"2026-07-09T18:59:16.459412Z","event_type":"pith.integrity.v1","detected_doi":"10.5555/578533","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"2549e2cb0c49fb52976dbc7ad887b07a5cbe977cdd43b9a7c0a94dd90b2fd272","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.07153/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}