{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2604.24927","arxiv_id":"2604.24927","integrity":{"available":true,"endpoint":"/pith/2604.24927/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":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-21T05:42:31.575125Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-19T21:36:00.126424Z","findings_count":1}],"findings":[{"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.18653/v1/2025.findings-naacl.396.URL) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.18653/v1/2025.findings-naacl.396.URL","detected_arxiv_id":null,"ref_index":1,"audited_at":"2026-05-19T21:36:00.126424Z"}],"snapshot_sha256":"caf18e95d0191f3ece4add731e772cd13a0c49d22e93d7e2dc13f5e13809d507"},"events":[{"event_id":3211,"event_type":"pith.integrity.v1","payload_sha256":"23231c650048d2653681588939f3846d7e16af7c756e3611328f473467a25e5f","signature_b64":"K5qQdRYCI1WllOKQL9uQVCTVA9tfQuvk+GCjyQ1C9XGntoMVksEOmVD0TUKCrxfWFhHWiYIzgdXxUM+13Nw6DQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T21:37:23.346721+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.18653/v1/2025.findings-naacl.396.URL) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"URL https://openreview.net/forum? id=H1lJJnR5Ym. Chaslot, G. M., Winands, M. H., and Herik, H. J. Parallel monte-carlo tree search. InProceedings of the 6th International Conference on Computers and Games, CG ’08, pp. 60–71, Berlin, Heidelb","arxiv_id":"2604.24927","detector":"doi_compliance","evidence":{"ref_index":1,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"URL https://openreview.net/forum? id=H1lJJnR5Ym. Chaslot, G. M., Winands, M. H., and Herik, H. J. Parallel monte-carlo tree search. InProceedings of the 6th International Conference on Computers and Games, CG ’08, pp. 60–71, Berlin, Heidelb","reconstructed_doi":"10.18653/v1/2025.findings-naacl.396.URL"},"severity":"advisory","ref_index":1,"audited_at":"2026-05-19T21:36:00.126424Z","event_type":"pith.integrity.v1","detected_doi":"10.18653/v1/2025.findings-naacl.396.URL","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"9a3de5a9ec5d474d4513e04e53338149bd63be6a18aad226e1c856f1c5989051","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2604.24927/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}