{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2605.17572","arxiv_id":"2605.17572","integrity":{"available":true,"endpoint":"/pith/2605.17572/integrity.json","summary":{"critical":1,"advisory":0,"informational":0,"by_detector":{"doi_compliance":{"total":1,"critical":1,"advisory":0,"informational":0}}},"clean":false,"detectors_run":[{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-20T22:32:52.558857Z","findings_count":1},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-05-20T22:31:30.649068Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-05-20T21:22:14.332903Z","findings_count":0},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-05-19T21:33:23.594114Z","findings_count":0}],"findings":[{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1016/0020-0190(92' 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/0020-0190(92","detected_arxiv_id":null,"ref_index":2,"audited_at":"2026-05-19T22:31:05.801691Z"}],"snapshot_sha256":"b404be6e0d3b8ac5fff73b61a0fd3ae128759b311eb1637f708e3f36f4690e05"},"events":[{"event_id":3382,"event_type":"pith.integrity.v1","payload_sha256":"d296bbdc8f683fa83a2b6005f11b5d8fca6d14c796113370e03f118fc7091549","signature_b64":"gBDUDIAF70i2R77Ohtv1K8IbQlaOfW0cWUz+Q20C8bClfuW2bH9r9ngTXfrlFXvwiu2icXD2+KWCLQ74CJ2GAg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T22:32:25.314672+00:00","payload":{"note":"Identifier '10.1016/0020-0190(92' 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":"14 Thang Nguyen Bui and Curt Jones. Finding good approximate vertex and edge partitions is NP-hard.Information Processing Letters, 42(3):153–159, 1992.doi:10.1016/0020-0190(92) 90140-Q. 15 Jean Cardinal and Gwenaël Joret. Hitting all maxima","arxiv_id":"2605.17572","detector":"doi_compliance","evidence":{"doi":"10.1016/0020-0190(92","arxiv_id":null,"ref_index":2,"raw_excerpt":"14 Thang Nguyen Bui and Curt Jones. Finding good approximate vertex and edge partitions is NP-hard.Information Processing Letters, 42(3):153–159, 1992.doi:10.1016/0020-0190(92) 90140-Q. 15 Jean Cardinal and Gwenaël Joret. Hitting all maximal independent sets of a bipartite graph. Algorithmica, 72(2):359–368, 2015.doi:10.1007/s00453-013-9847-3. 16 Steven Chaplick, Grzegorz Gutowski, and Tomasz Kraw","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":2,"audited_at":"2026-05-19T22:31:05.801691Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0020-0190(92","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"1da2bef55e1487b4169241fd8f573eefe073dba1e889c6a48fb7151b98f184be","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2605.17572/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}