{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.04676","arxiv_id":"2607.04676","integrity":{"available":true,"endpoint":"/pith/2607.04676/integrity.json","summary":{"critical":0,"advisory":2,"informational":0,"by_detector":{"doi_compliance":{"total":2,"critical":0,"advisory":2,"informational":0}}},"clean":false,"detectors_run":[{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-07-16T15:53:52.605776Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-07-14T17:32:37.627877Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-07-14T15:54:32.401953Z","findings_count":2},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-07-13T14:23:57.787896Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-12T04:19:17.005481Z","findings_count":0}],"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.1007/978-3-540-24685-51) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/978-3-540-24685-51","detected_arxiv_id":null,"ref_index":18,"audited_at":"2026-07-11T15:31:48.958347Z"},{"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.1007/978-3-642-38527-815) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/978-3-642-38527-815","detected_arxiv_id":null,"ref_index":25,"audited_at":"2026-07-11T15:31:48.958347Z"}],"snapshot_sha256":"a81ea6cc63d79b3577fc52a8473e99d7d4b9ea130ee733861f0894ea2155d75c"},"events":[{"event_id":12217,"event_type":"pith.integrity.v1","payload_sha256":"6594a4c4f82c7d3ab904bd2681ccaef29e5d9eb56dc0ff7f7780d43ff08ac707","signature_b64":"kTmVGY3Bts44tCtwo4WnN4O3tS9yoOxa09jkNE4RlXNcJzUlS1BfxU53UIlwuKYzQ9ssA7cJ6KIJE41WgbhjBQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-11T15:36:17.268433+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-642-38527-815) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"D. Zhou, D. G. Andersen, and M. Kaminsky, “Space-efficient, high- performance rank and select structures on uncompressed bit sequences,” inInternational Symposium on Experimental Algorithms. Springer, 2013, pp. 151–163. [Online]. Available:","arxiv_id":"2607.04676","detector":"doi_compliance","evidence":{"ref_index":25,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"D. Zhou, D. G. Andersen, and M. Kaminsky, “Space-efficient, high- performance rank and select structures on uncompressed bit sequences,” inInternational Symposium on Experimental Algorithms. Springer, 2013, pp. 151–163. [Online]. Available:","reconstructed_doi":"10.1007/978-3-642-38527-815"},"severity":"advisory","ref_index":25,"audited_at":"2026-07-11T15:31:48.958347Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-642-38527-815","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"350843aa190fa3adaa9f0255621abfb9f47893d24af42cc7af7ec953a650e9f3","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":12216,"event_type":"pith.integrity.v1","payload_sha256":"4523df4a7cc6dc9e6ccd613855c5789b32dcaf0a9efbb56ccac6272a40b94e2f","signature_b64":"c8QQYvZOOM1q/OyiX0m2CcPIAGKxUQ4DW3r/aRJHcLez27QpHMDHcF2yxBXDlS6juJPyULlOngp5GWHBa63ZCA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-11T15:36:17.262186+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-540-24685-51) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"R. Rabenseifner, “Optimization of collective reduction operations,” in International Conference on Computational Science. Springer, 2004, pp. 1–9. [Online]. Available: https://doi.org/10.1007/978-3-540-24685- 5 1","arxiv_id":"2607.04676","detector":"doi_compliance","evidence":{"ref_index":18,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"R. Rabenseifner, “Optimization of collective reduction operations,” in International Conference on Computational Science. Springer, 2004, pp. 1–9. [Online]. Available: https://doi.org/10.1007/978-3-540-24685- 5 1","reconstructed_doi":"10.1007/978-3-540-24685-51"},"severity":"advisory","ref_index":18,"audited_at":"2026-07-11T15:31:48.958347Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-540-24685-51","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"9401fe3e9a51aec00204fc6e4a281a290b5beea13b45611a7c0d16b24c2252b0","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.04676/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}