{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2605.05086","arxiv_id":"2605.05086","integrity":{"available":true,"endpoint":"/pith/2605.05086/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":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-20T10:37:49.516360Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-05-19T21:31:19.624181Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-19T13:50:33.905425Z","findings_count":1}],"findings":[{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1007/s12532-009-0017-6' 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.1007/s12532-009-0017-6","detected_arxiv_id":null,"ref_index":20,"audited_at":"2026-05-19T13:50:33.905425Z"}],"snapshot_sha256":"f33070228f646714be857dfa881318a628ce4901938e00227d7d1cc7019300f6"},"events":[{"event_id":1537,"event_type":"pith.integrity.v1","payload_sha256":"fd60e30760c0f54c68957f6f391f508a844a90519ce1204f6e5c88213b8ea07b","signature_b64":"kLVnOquiBr1xGUqtYRI+TPEr2IOIdeCv7NomNZ5diyX1YOgO30c2atUOwjiKTx493n2dMvXkzbgBm1ubr2wVDg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T13:52:05.730763+00:00","payload":{"note":"Identifier '10.1007/s12532-009-0017-6' 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":"Fischetti, M., Salvagnin, D.: Feasibility Pump 2.0. Mathematical Programming Computation1(2-3), 201–222 (2009). https://doi.org/10.1007/s12532-009-0017-6","arxiv_id":"2605.05086","detector":"doi_compliance","evidence":{"doi":"10.1007/s12532-009-0017-6","arxiv_id":null,"ref_index":20,"raw_excerpt":"Fischetti, M., Salvagnin, D.: Feasibility Pump 2.0. Mathematical Programming Computation1(2-3), 201–222 (2009). https://doi.org/10.1007/s12532-009-0017-6","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":20,"audited_at":"2026-05-19T13:50:33.905425Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s12532-009-0017-6","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"aa10733a5c7130458e96f0638df2daac533e46c2906286cacea500a71b09b428","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2605.05086/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}