{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2604.24134","arxiv_id":"2604.24134","integrity":{"available":true,"endpoint":"/pith/2604.24134/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-21T07:38:29.288252Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-19T22:24:01.382386Z","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.4230/LIPIcs.ICALP.2021.79.19) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.4230/LIPIcs.ICALP.2021.79.19","detected_arxiv_id":null,"ref_index":9,"audited_at":"2026-05-19T22:24:01.382386Z"}],"snapshot_sha256":"ca37e5a5a7a2f6dbbb2635aac0dd10d05d9fa549791c3bc59292c420fc510bd1"},"events":[{"event_id":3362,"event_type":"pith.integrity.v1","payload_sha256":"152036e00bb3050d24ec03944c8cd2104ca8419e066b64e32aabbe71302fbf2b","signature_b64":"MIsledLxBMAm5JmsQsUWtTAjJ9Xz5Wbjo9FpVjkCrc2bkhUayfTzirTcPVsJ1WsTkjc/0T7F78MA+ufA8EKOAQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T22:27:24.927576+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/LIPIcs.ICALP.2021.79.19) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik.doi:10.4230/LIPIcs. ICALP.2021.79. 19 John Iacono. Improved upper bounds for pairing heaps. InScandinavian Workshop on Algorithm Theory, pages 32–45. Springer, 2000.doi:10.5555/645900.672600","arxiv_id":"2604.24134","detector":"doi_compliance","evidence":{"ref_index":9,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik.doi:10.4230/LIPIcs. ICALP.2021.79. 19 John Iacono. Improved upper bounds for pairing heaps. InScandinavian Workshop on Algorithm Theory, pages 32–45. Springer, 2000.doi:10.5555/645900.672600","reconstructed_doi":"10.4230/LIPIcs.ICALP.2021.79.19"},"severity":"advisory","ref_index":9,"audited_at":"2026-05-19T22:24:01.382386Z","event_type":"pith.integrity.v1","detected_doi":"10.4230/LIPIcs.ICALP.2021.79.19","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"dc6eac1f9e95f3a81679f4d21cbc230abd247bd57bf41908619fc522a7b6dea8","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2604.24134/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}