{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.18569","arxiv_id":"2607.18569","integrity":{"available":true,"endpoint":"/pith/2607.18569/integrity.json","summary":{"critical":0,"advisory":1,"informational":0,"by_detector":{"doi_compliance":{"total":1,"critical":0,"advisory":1,"informational":0}}},"clean":false,"detectors_run":[{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-03T21:38:47.231119Z","findings_count":0},{"name":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-03T15:42:24.466788Z","findings_count":1},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-07-29T08:11:49.768279Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-07-28T16:33:09.100703Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"skipped","ran_at":"2026-07-22T21:57:25.635900Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-22T13:52:22.453402Z","findings_count":0}],"findings":[{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/J.DAM.2024.11.012 resolves to 'Complexity of Maker–Breaker games on edge sets of graphs'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1016/J.DAM.2024.11.012","detected_arxiv_id":null,"ref_index":9,"audited_at":"2026-08-01T15:19:02.074760Z"}],"snapshot_sha256":"3a91b5ad90fd0f6074afa03f86af4781d3f7b9ddbe9e4252bec4bd17059cd0e5"},"events":[{"event_id":16041,"event_type":"pith.integrity.v1","payload_sha256":"e7724a77e2f9ea056c145604f59554b3b846b9edefe89a0e76a3b828dd00f66e","signature_b64":"M8558ysF9V5xxFp+o9nuMOJ2HICE8sk0qs5s3oA/ls2AbSebs0J306IHytjaQwEp7JnH1ZRKlhVnkWni+HBrBw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T15:23:28.829751+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/J.DAM.2024.11.012 resolves to 'Complexity of Maker–Breaker games on edge sets of graphs'. A reader following the printed text alone cannot reach it.","snippet":"Éric Duchêne, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau, and Milos Stojakovic. Complexity of Maker-Breaker games on edge sets of graphs.Discret. Appl. Math., 361:502–522, 2025.doi:10.1016/J.DAM. 2024.11.012","arxiv_id":"2607.18569","detector":"doi_compliance","evidence":{"ref_index":9,"verdict_class":"incontrovertible","resolved_title":"Complexity of Maker–Breaker games on edge sets of graphs","printed_excerpt":"10.1016/j.dam","reconstructed_doi":"10.1016/J.DAM.2024.11.012"},"severity":"advisory","ref_index":9,"audited_at":"2026-08-01T15:19:02.074760Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/J.DAM.2024.11.012","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"f433aba105c5a0a10f8ba9a669836f3b35c68e10d764ce631a32137e2086a336","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Complexity of Maker–Breaker games on edge sets of graphs","detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.18569/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}