{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2608.06820","arxiv_id":"2608.06820","integrity":{"available":true,"endpoint":"/pith/2608.06820/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":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-08-12T08:48:08.587828Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-11T21:08:29.848399Z","findings_count":0},{"name":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-11T20:38:18.089983Z","findings_count":2},{"name":"citation_quote_validity","version":"0.1.0","status":"skipped","ran_at":"2026-08-10T19:08:48.505386Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-08-10T12:08:11.832585Z","findings_count":0},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-08-10T03:08:41.495306Z","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.4230/LIPIcs.MFCS.2019.36) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.4230/LIPIcs.MFCS.2019.36","detected_arxiv_id":null,"ref_index":18,"audited_at":"2026-08-10T20:28:19.674751Z"},{"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.1109/TIT.2005.864441) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1109/TIT.2005.864441","detected_arxiv_id":null,"ref_index":24,"audited_at":"2026-08-10T20:28:19.674751Z"}],"snapshot_sha256":"38435f769e37e59a9d56d82fa4befe9eddad3e666b99ea411a9355a9cd2bb4ea"},"events":[{"event_id":18894,"event_type":"pith.integrity.v1","payload_sha256":"0aeb3b1f34f993c00f5e07058457a2435019b82df1360336ecc3828791956f31","signature_b64":"kcsZAqFrx1Lyq+7CAHPEPppZ7AWM7jdBUUtdLpyJQvaKsbCFdM+1FUDvp19YQoxmYkf+aWC5amN1xzmrhzsAAQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-10T20:28:40.387317+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/TIT.2005.864441) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Moshe Schwartz and Alexander Vardy. On the stopping distance and the stopping redundancy of codes.IEEE Transactions on Information Theory, 52(3):922–932, 2006. doi: 10.1109/TIT.2005. 864441","arxiv_id":"2608.06820","detector":"doi_compliance","evidence":{"ref_index":24,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1109/tit.2005","reconstructed_doi":"10.1109/TIT.2005.864441"},"severity":"advisory","ref_index":24,"audited_at":"2026-08-10T20:28:19.674751Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/TIT.2005.864441","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"e6dc46931764f923fd85af988a2d243ac177a612f7d16de647a02fd247e7e0e6","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":18893,"event_type":"pith.integrity.v1","payload_sha256":"60c3b1525a12e4803fc36a43a937065a66760f3f7c0146988de5e6a1806ac721","signature_b64":"K3oDXasuQZilJE44GQb+2jjDtHEaLGNJgYa+jNYXG//8kRO4wItR44HJlStfDvbNhKyuKMicMr3QBfIdagJIAA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-10T20:28:40.263688+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/LIPIcs.MFCS.2019.36) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Victor Lagerkvist and Gustav Nordh. On the strength of uniqueness quantification in primitive positive formulas. In44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), volume 138 ofLeibniz International ","arxiv_id":"2608.06820","detector":"doi_compliance","evidence":{"ref_index":18,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.4230/lipics","reconstructed_doi":"10.4230/LIPIcs.MFCS.2019.36"},"severity":"advisory","ref_index":18,"audited_at":"2026-08-10T20:28:19.674751Z","event_type":"pith.integrity.v1","detected_doi":"10.4230/LIPIcs.MFCS.2019.36","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"81e0bfa179ce10831732858f0bc1e7fafec8436d64f0dda43dea0c79807bb70b","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2608.06820/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}