{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2608.03315","arxiv_id":"2608.03315","integrity":{"available":true,"endpoint":"/pith/2608.03315/integrity.json","summary":{"critical":0,"advisory":4,"informational":0,"by_detector":{"doi_compliance":{"total":4,"critical":0,"advisory":4,"informational":0}}},"clean":false,"detectors_run":[{"name":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-10T21:59:12.846832Z","findings_count":4},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-08-10T10:28:10.992109Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-09T23:08:30.959672Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-08-05T12:38:05.205986Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"skipped","ran_at":"2026-08-05T01:08:42.205582Z","findings_count":0},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-08-05T01:08:37.183449Z","findings_count":0}],"findings":[{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1103/PRXQuantum.4.040344 resolves to 'Scalable Surface-Code Decoders with Parallelization in Time'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1103/PRXQuantum.4.040344","detected_arxiv_id":null,"ref_index":31,"audited_at":"2026-08-05T21:18:06.117617Z"},{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1103/PhysRevA.71.022316 resolves to 'Universal quantum computation with ideal Clifford gates and noisy ancillas'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1103/PhysRevA.71.022316","detected_arxiv_id":null,"ref_index":11,"audited_at":"2026-08-05T21:18:06.117617Z"},{"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.1038/s41586-024-08449-y) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1038/s41586-024-08449-y","detected_arxiv_id":null,"ref_index":25,"audited_at":"2026-08-05T21:18:06.117617Z"},{"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.22331/q-2025-01-20-1600) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.22331/q-2025-01-20-1600","detected_arxiv_id":null,"ref_index":30,"audited_at":"2026-08-05T21:18:06.117617Z"}],"snapshot_sha256":"e70e34e277b36a0ab4aa51224a8accb0e32e9ff404696d2dff61735ba32378cc"},"events":[{"event_id":18151,"event_type":"pith.integrity.v1","payload_sha256":"864992ec7790bf9af3d405f0780133717334d781f76db71e7fc829107f33df97","signature_b64":"34Ie9gt+4yMbUkj192ADA78gYPAdcO915jO++8HHBwmNN9Kz+sLPdtJoSb6BUqzHR+864tDvn0pa+WaU0MnWCA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-05T21:18:39.508665+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1103/PRXQuantum.4.040344 resolves to 'Scalable Surface-Code Decoders with Parallelization in Time'. A reader following the printed text alone cannot reach it.","snippet":"X. Tan, F. Zhang, R. Chao, Y . Shi, and J. Chen, “Scalable surface-code decoders with parallelization in time,”PRX Quantum, vol. 4, p. 040344, Dec 2023. [Online]. Available: https://doi.org/10.1103/PRXQuantum.4. 040344","arxiv_id":"2608.03315","detector":"doi_compliance","evidence":{"ref_index":31,"verdict_class":"incontrovertible","resolved_title":"Scalable Surface-Code Decoders with Parallelization in Time","printed_excerpt":"10.1103/prxquantum.4","reconstructed_doi":"10.1103/PRXQuantum.4.040344"},"severity":"advisory","ref_index":31,"audited_at":"2026-08-05T21:18:06.117617Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/PRXQuantum.4.040344","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"c976ff2eda93aec25dd2e27a43c7482e943cb32d5f60b95bdbc269b1b975c073","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Scalable Surface-Code Decoders with Parallelization in Time","detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":18150,"event_type":"pith.integrity.v1","payload_sha256":"eb194a59595f9e15d505d03e1bbb927612fa534bb865bc7c3bf62b35e731c624","signature_b64":"aFj6XDRubUNnI6QvLj08Ad9W085FFGeYfAnKOq0bs2ytoaBthJgRzvMQAc3nK/ZK4Y81jbT7dkbyZWKNJTEoCA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-05T21:18:39.281605+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.22331/q-2025-01-20-1600) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"O. Higgott and C. Gidney, “Sparse Blossom: correcting a million errors per core second with minimum-weight matching,”Quantum, vol. 9, p. 1600, 2025. [Online]. Available: https://doi.org/10.22331/q-2025-01- 20-1600","arxiv_id":"2608.03315","detector":"doi_compliance","evidence":{"ref_index":30,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.22331/q-2025-01-","reconstructed_doi":"10.22331/q-2025-01-20-1600"},"severity":"advisory","ref_index":30,"audited_at":"2026-08-05T21:18:06.117617Z","event_type":"pith.integrity.v1","detected_doi":"10.22331/q-2025-01-20-1600","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"d47a7a7dae33e6a6e78187e4e0c9510c95198334859fe9094cfa8b9a44628b9f","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":18149,"event_type":"pith.integrity.v1","payload_sha256":"882b5b2b916025e8b094e3cab52a445aab8d01610c9b132773a01516420133c6","signature_b64":"7nn8+FLS98rN8hM1q+WnBsbIezEbddI7oGCZootxbIqLAFveqTfYZBQrmJWneslggcyPpi8QaNWAyX8cSffzDA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-05T21:18:39.013634+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1038/s41586-024-08449-y) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"R. Acharya, I. Aleiner, T. I. Andersen, M. Ansmann, F. Arute, and Google Quantum AI and Collaborators, “Quantum error correction below the surface code threshold,”Nature, vol. 638, no. 8052, pp. 920–926, Feb 2025. [Online]. Available: https","arxiv_id":"2608.03315","detector":"doi_compliance","evidence":{"ref_index":25,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1038/s41586-","reconstructed_doi":"10.1038/s41586-024-08449-y"},"severity":"advisory","ref_index":25,"audited_at":"2026-08-05T21:18:06.117617Z","event_type":"pith.integrity.v1","detected_doi":"10.1038/s41586-024-08449-y","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"2cd3eceee5333c65c82f84592aa7f713bc697b971177d43353b36a6027e4b32e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":18148,"event_type":"pith.integrity.v1","payload_sha256":"47db7d55fa2372c6980f1e6072d4fcecb00024748dfc03e5592abeb61332f2d0","signature_b64":"nyxoHosYCa9tOyEH++3MukXxz2UWeUfuoTlj/8lX2q04+nYHZlw5vIv0iklD/GoppGyda1i7B6hhj0+jVxk9BQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-05T21:18:38.773633+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1103/PhysRevA.71.022316 resolves to 'Universal quantum computation with ideal Clifford gates and noisy ancillas'. A reader following the printed text alone cannot reach it.","snippet":"S. Bravyi and A. Kitaev, “Universal quantum computation with ideal clifford gates and noisy ancillas,”Physical Review A, vol. 71, no. 2, Feb. 2005. [Online]. Available: http://dx.doi.org/10.1103/PhysRevA.71. 022316","arxiv_id":"2608.03315","detector":"doi_compliance","evidence":{"ref_index":11,"verdict_class":"incontrovertible","resolved_title":"Universal quantum computation with ideal Clifford gates and noisy ancillas","printed_excerpt":"10.1103/physreva.71","reconstructed_doi":"10.1103/PhysRevA.71.022316"},"severity":"advisory","ref_index":11,"audited_at":"2026-08-05T21:18:06.117617Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/PhysRevA.71.022316","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"136bf1cd44e69b18fec0ddefbe7272076895e4b73ac0e4e212adbe70ff7f34e9","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Universal quantum computation with ideal Clifford gates and noisy ancillas","detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2608.03315/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}