{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DXTWENUQL2LUUSECJBNGSXVCR5","short_pith_number":"pith:DXTWENUQ","schema_version":"1.0","canonical_sha256":"1de76236905e974a4882485a695ea28f5354b252cd3deb4d71c059e418f936df","source":{"kind":"arxiv","id":"1901.00984","version":1},"attestation_state":"computed","paper":{"title":"Quantum Insertion-Deletion Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Dave Touchette, Janet Leahy, Penghui Yao","submitted_at":"2019-01-04T05:27:10Z","abstract_excerpt":"We introduce a model of quantum insertion-deletion (insdel) channels. Insdel channels are meant to represent, for example, synchronization errors arising in data transmission. In the classical setting, they represent a strict generalization of the better-understood corruption error channels, and until recently, had mostly resisted effort toward a similar understanding as their corruption counterparts. They have received considerable attention in recent years. Very recently, Haeupler and Shahrasbi developed a framework, using what they call synchronisation strings, that allows one to turn insde"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1901.00984","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-04T05:27:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d3af5a3e87050996d1d20d536b785a537b4ff075cff1b13fa86e2997ca4dcc34","abstract_canon_sha256":"8165ffd6c0944cc605746159ecb28c28bd94c78f8e5326e754626dc9ccd84aae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:57.522802Z","signature_b64":"or2Lngi0+VrcNnHVRPfiTjz+8GHhvSWsKu72TMpnhZB1N7mpdWtAfPKR9fNw07Hs0Cd4i6ThZS7ktcQWlx/lAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1de76236905e974a4882485a695ea28f5354b252cd3deb4d71c059e418f936df","last_reissued_at":"2026-05-17T23:56:57.522058Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:57.522058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Insertion-Deletion Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Dave Touchette, Janet Leahy, Penghui Yao","submitted_at":"2019-01-04T05:27:10Z","abstract_excerpt":"We introduce a model of quantum insertion-deletion (insdel) channels. Insdel channels are meant to represent, for example, synchronization errors arising in data transmission. In the classical setting, they represent a strict generalization of the better-understood corruption error channels, and until recently, had mostly resisted effort toward a similar understanding as their corruption counterparts. They have received considerable attention in recent years. Very recently, Haeupler and Shahrasbi developed a framework, using what they call synchronisation strings, that allows one to turn insde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00984","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.00984","created_at":"2026-05-17T23:56:57.522185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.00984v1","created_at":"2026-05-17T23:56:57.522185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00984","created_at":"2026-05-17T23:56:57.522185+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXTWENUQL2LU","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXTWENUQL2LUUSEC","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXTWENUQ","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11510","citing_title":"Decoding Algorithm to Composite Errors Consisting of Deletions and Insertions for Quantum Deletion-Correcting Codes Based on Quantum Reed-Solomon Codes","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DXTWENUQL2LUUSECJBNGSXVCR5","json":"https://pith.science/pith/DXTWENUQL2LUUSECJBNGSXVCR5.json","graph_json":"https://pith.science/api/pith-number/DXTWENUQL2LUUSECJBNGSXVCR5/graph.json","events_json":"https://pith.science/api/pith-number/DXTWENUQL2LUUSECJBNGSXVCR5/events.json","paper":"https://pith.science/paper/DXTWENUQ"},"agent_actions":{"view_html":"https://pith.science/pith/DXTWENUQL2LUUSECJBNGSXVCR5","download_json":"https://pith.science/pith/DXTWENUQL2LUUSECJBNGSXVCR5.json","view_paper":"https://pith.science/paper/DXTWENUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.00984&json=true","fetch_graph":"https://pith.science/api/pith-number/DXTWENUQL2LUUSECJBNGSXVCR5/graph.json","fetch_events":"https://pith.science/api/pith-number/DXTWENUQL2LUUSECJBNGSXVCR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXTWENUQL2LUUSECJBNGSXVCR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXTWENUQL2LUUSECJBNGSXVCR5/action/storage_attestation","attest_author":"https://pith.science/pith/DXTWENUQL2LUUSECJBNGSXVCR5/action/author_attestation","sign_citation":"https://pith.science/pith/DXTWENUQL2LUUSECJBNGSXVCR5/action/citation_signature","submit_replication":"https://pith.science/pith/DXTWENUQL2LUUSECJBNGSXVCR5/action/replication_record"}},"created_at":"2026-05-17T23:56:57.522185+00:00","updated_at":"2026-05-17T23:56:57.522185+00:00"}