{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2604.20098","arxiv_id":"2604.20098","integrity":{"available":true,"endpoint":"/pith/2604.20098/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-21T15:36:14.115526Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-20T02:19:34.102477Z","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/2023.emnlp-main.741.URL) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.18653/v1/2023.emnlp-main.741.URL","detected_arxiv_id":null,"ref_index":3,"audited_at":"2026-05-20T02:19:34.102477Z"}],"snapshot_sha256":"6d68ac768de3e6f58f07c6a53875975d71130f3947aec8c48b0ee76f6166adaa"},"events":[{"event_id":4308,"event_type":"pith.integrity.v1","payload_sha256":"9edc69ffa1089391af784461e5c1de88be78caad00fdfac345c844972486d2cb","signature_b64":"vcLVmVdiKWHosBL54ibga6d0ihubbFpQL9Tb5fQtUUZUVrwtqmh4PZUImZB6aBIj/+xJkLKAaIVNBLK7qIukDw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-20T02:22:39.541101+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.18653/v1/2023.emnlp-main.741.URL) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"URL https://proceedings.neurips. cc/paper_files/paper/2021/file/ 0d441de75945e5acbc865406fc9a2559-Paper. pdf. Grover, A., Wang, E., Zweig, A., and Ermon, S. Stochastic optimization of sorting networks via continuous relax- ations. InInterna","arxiv_id":"2604.20098","detector":"doi_compliance","evidence":{"ref_index":3,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"URL https://proceedings.neurips. cc/paper_files/paper/2021/file/ 0d441de75945e5acbc865406fc9a2559-Paper. pdf. Grover, A., Wang, E., Zweig, A., and Ermon, S. Stochastic optimization of sorting networks via continuous relax- ations. InInterna","reconstructed_doi":"10.18653/v1/2023.emnlp-main.741.URL"},"severity":"advisory","ref_index":3,"audited_at":"2026-05-20T02:19:34.102477Z","event_type":"pith.integrity.v1","detected_doi":"10.18653/v1/2023.emnlp-main.741.URL","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"155e131172e1def6b874727cfcf12a7cd2d658b2b64ce9874731a4504ba74e02","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2604.20098/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}