{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2605.02874","arxiv_id":"2605.02874","integrity":{"available":true,"endpoint":"/pith/2605.02874/integrity.json","summary":{"critical":2,"advisory":0,"informational":0,"by_detector":{"doi_compliance":{"total":2,"critical":2,"advisory":0,"informational":0}}},"clean":false,"detectors_run":[{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-20T14:40:22.011933Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-05-20T02:01:22.416178Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-19T15:53:00.523038Z","findings_count":2}],"findings":[{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1007/978-3-642-39206-1_67.url:https://arxiv.org/abs/1302.4347' 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/978-3-642-39206-1_67.url:https://arxiv.org/abs/1302.4347","detected_arxiv_id":null,"ref_index":4,"audited_at":"2026-05-19T15:53:00.523038Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1016/0166-218x(85)90008-3.url:https://www.sciencedirect' 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/0166-218x(85)90008-3.url:https://www.sciencedirect","detected_arxiv_id":null,"ref_index":9,"audited_at":"2026-05-19T15:53:00.523038Z"}],"snapshot_sha256":"ec503d9a15a07dfa380abaf10f5482892c46e60fdcf2c9933478c87470c0975e"},"events":[{"event_id":1930,"event_type":"pith.integrity.v1","payload_sha256":"151367fa65600409a4699759211ca2887388420e65fbd58d504448f1d9042103","signature_b64":"l3MomgRLY30SZtuL4rfIscGis8or+JtEDcT0jvfYm90W9NorDMQ7jpwTE30Mz9KXJxupfAkzc1D+a4i3e4wzAA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T15:57:11.685099+00:00","payload":{"note":"Identifier '10.1016/0166-218x(85)90008-3.url:https://www.sciencedirect' 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":"M.E. Dyer and A.M. Frieze. “On the complexity of partitioning graphs into connected sub- graphs”. In:Discrete Applied Mathematics10.2 (1985), pp. 139–153.issn: 0166-218X.doi: https://doi.org/10.1016/0166-218X(85)90008-3.url:https://www.scie","arxiv_id":"2605.02874","detector":"doi_compliance","evidence":{"doi":"10.1016/0166-218x(85)90008-3.url:https://www.sciencedirect","arxiv_id":null,"ref_index":9,"raw_excerpt":"M.E. Dyer and A.M. Frieze. “On the complexity of partitioning graphs into connected sub- graphs”. In:Discrete Applied Mathematics10.2 (1985), pp. 139–153.issn: 0166-218X.doi: https://doi.org/10.1016/0166-218X(85)90008-3.url:https://www.sciencedirect. com/science/article/pii/0166218X85900083","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:53:00.523038Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0166-218x(85)90008-3.url:https://www.sciencedirect","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"ef9d8a5612b4d2cd574a40349539cac97153387104edbd16a77902da775c23c8","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":1929,"event_type":"pith.integrity.v1","payload_sha256":"1bd2324618081578d89d7d6026b3c76e00ea4ab15c3996dc0b84d0d89a05ce82","signature_b64":"p8E21kgpzfOyGoSCRRGXKRm74FlKZvPRUANvimkdMfBiYXdlMGEKo7PuMQRaOhRt81Ye8/gD1kcb5cKLWCmCDA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T15:57:11.683793+00:00","payload":{"note":"Identifier '10.1007/978-3-642-39206-1_67.url:https://arxiv.org/abs/1302.4347' 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":"Maxim Sviridenko and Justin Ward. “Large Neighborhood Local Search for the Maximum Set Packing Problem”. In:Automata, Languages, and Programming: 40th International Collo- quium, ICALP 2013. Vol. 7965. Lecture Notes in Computer Science. Spr","arxiv_id":"2605.02874","detector":"doi_compliance","evidence":{"doi":"10.1007/978-3-642-39206-1_67.url:https://arxiv.org/abs/1302.4347","arxiv_id":null,"ref_index":4,"raw_excerpt":"Maxim Sviridenko and Justin Ward. “Large Neighborhood Local Search for the Maximum Set Packing Problem”. In:Automata, Languages, and Programming: 40th International Collo- quium, ICALP 2013. Vol. 7965. Lecture Notes in Computer Science. Springer, 2013, pp. 792– 803.doi:10.1007/978-3-642-39206-1_67.url:https://arxiv.org/abs/1302.4347","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":4,"audited_at":"2026-05-19T15:53:00.523038Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-642-39206-1_67.url:https://arxiv.org/abs/1302.4347","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"2c8c4436f4ee7c36359a1d0cda54e42d4b953f9691021c1c12e1b4f04523d323","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2605.02874/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}