{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:DY2Q5UPLKBNQIJXSM6HA2AUDTK","short_pith_number":"pith:DY2Q5UPL","canonical_record":{"source":{"id":"quant-ph/0401134","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-01-21T20:36:52Z","cross_cats_sorted":[],"title_canon_sha256":"f029eda44de0b94e93156b0af94eac1ea20ec778aaf0e6ded7174fe22294bec4","abstract_canon_sha256":"765227b4bd4d38973fd78d1774e0ca88d422610d441ede24087f38012b913377"},"schema_version":"1.0"},"canonical_sha256":"1e350ed1eb505b0426f2678e0d02839a945240f4102186bae57088a2d4f50f4e","source":{"kind":"arxiv","id":"quant-ph/0401134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0401134","created_at":"2026-07-04T14:46:30Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0401134v1","created_at":"2026-07-04T14:46:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0401134","created_at":"2026-07-04T14:46:30Z"},{"alias_kind":"pith_short_12","alias_value":"DY2Q5UPLKBNQ","created_at":"2026-07-04T14:46:30Z"},{"alias_kind":"pith_short_16","alias_value":"DY2Q5UPLKBNQIJXS","created_at":"2026-07-04T14:46:30Z"},{"alias_kind":"pith_short_8","alias_value":"DY2Q5UPL","created_at":"2026-07-04T14:46:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:DY2Q5UPLKBNQIJXSM6HA2AUDTK","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0401134","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-01-21T20:36:52Z","cross_cats_sorted":[],"title_canon_sha256":"f029eda44de0b94e93156b0af94eac1ea20ec778aaf0e6ded7174fe22294bec4","abstract_canon_sha256":"765227b4bd4d38973fd78d1774e0ca88d422610d441ede24087f38012b913377"},"schema_version":"1.0"},"canonical_sha256":"1e350ed1eb505b0426f2678e0d02839a945240f4102186bae57088a2d4f50f4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:30.614383Z","signature_b64":"oCsE58tydlx4Ib9McIxpPcTD0UCkhWaL8aFaT9/omPKprVVB7AjjU3IK9ZG3Gb/g0lfdw+ZPxXuLwEQfHkzgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e350ed1eb505b0426f2678e0d02839a945240f4102186bae57088a2d4f50f4e","last_reissued_at":"2026-07-04T14:46:30.613984Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:30.613984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0401134","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T14:46:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBoW88ZibAi5JP3UwtWcwBo5jJdBMHUDhOOjnB1U0K6zdVdaMvdu8ysRidmuMjGj0sy2zMoAWtjqNAR3CR3iDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T13:31:44.969158Z"},"content_sha256":"f1fcf4080a16883d501581f69f0a23f8fa215f835c625bcf277e2277e3c56dfa","schema_version":"1.0","event_id":"sha256:f1fcf4080a16883d501581f69f0a23f8fa215f835c625bcf277e2277e3c56dfa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:DY2Q5UPLKBNQIJXSM6HA2AUDTK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum convolutional codes: fundamentals","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"H. Ollivier, J.-P. Tillich","submitted_at":"2004-01-21T20:36:52Z","abstract_excerpt":"We describe the theory of quantum convolutional error correcting codes. These codes are aimed at protecting a flow of quantum information over long distance communication. They are largely inspired by their classical analogs which are used in similar circumstances in classical communication. In this article, we provide an efficient polynomial formalism for describing their stabilizer group, derive an on-line encoding circuit with linear gate complexity and study error propagation together with the existence of on-line decoding. Finally, we provide a maximum likelihood error estimation algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0401134","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0401134/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T14:46:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ky8adpiqn7cw139Y+0sZ78VA1a8ej7D/XXjPeZItg+liEvD1tJJdzNsy/3tMAx/Na5/FwkMK+UV4ItoL/i5PAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T13:31:44.970128Z"},"content_sha256":"278e8763aaf6635c4ec1eeffe650c3c6a9d064d87eaf49865287ce92819df4e8","schema_version":"1.0","event_id":"sha256:278e8763aaf6635c4ec1eeffe650c3c6a9d064d87eaf49865287ce92819df4e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DY2Q5UPLKBNQIJXSM6HA2AUDTK/bundle.json","state_url":"https://pith.science/pith/DY2Q5UPLKBNQIJXSM6HA2AUDTK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DY2Q5UPLKBNQIJXSM6HA2AUDTK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T13:31:44Z","links":{"resolver":"https://pith.science/pith/DY2Q5UPLKBNQIJXSM6HA2AUDTK","bundle":"https://pith.science/pith/DY2Q5UPLKBNQIJXSM6HA2AUDTK/bundle.json","state":"https://pith.science/pith/DY2Q5UPLKBNQIJXSM6HA2AUDTK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DY2Q5UPLKBNQIJXSM6HA2AUDTK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:DY2Q5UPLKBNQIJXSM6HA2AUDTK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"765227b4bd4d38973fd78d1774e0ca88d422610d441ede24087f38012b913377","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2004-01-21T20:36:52Z","title_canon_sha256":"f029eda44de0b94e93156b0af94eac1ea20ec778aaf0e6ded7174fe22294bec4"},"schema_version":"1.0","source":{"id":"quant-ph/0401134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0401134","created_at":"2026-07-04T14:46:30Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0401134v1","created_at":"2026-07-04T14:46:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0401134","created_at":"2026-07-04T14:46:30Z"},{"alias_kind":"pith_short_12","alias_value":"DY2Q5UPLKBNQ","created_at":"2026-07-04T14:46:30Z"},{"alias_kind":"pith_short_16","alias_value":"DY2Q5UPLKBNQIJXS","created_at":"2026-07-04T14:46:30Z"},{"alias_kind":"pith_short_8","alias_value":"DY2Q5UPL","created_at":"2026-07-04T14:46:30Z"}],"graph_snapshots":[{"event_id":"sha256:278e8763aaf6635c4ec1eeffe650c3c6a9d064d87eaf49865287ce92819df4e8","target":"graph","created_at":"2026-07-04T14:46:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0401134/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We describe the theory of quantum convolutional error correcting codes. These codes are aimed at protecting a flow of quantum information over long distance communication. They are largely inspired by their classical analogs which are used in similar circumstances in classical communication. In this article, we provide an efficient polynomial formalism for describing their stabilizer group, derive an on-line encoding circuit with linear gate complexity and study error propagation together with the existence of on-line decoding. Finally, we provide a maximum likelihood error estimation algorith","authors_text":"H. Ollivier, J.-P. Tillich","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2004-01-21T20:36:52Z","title":"Quantum convolutional codes: fundamentals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0401134","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f1fcf4080a16883d501581f69f0a23f8fa215f835c625bcf277e2277e3c56dfa","target":"record","created_at":"2026-07-04T14:46:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"765227b4bd4d38973fd78d1774e0ca88d422610d441ede24087f38012b913377","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2004-01-21T20:36:52Z","title_canon_sha256":"f029eda44de0b94e93156b0af94eac1ea20ec778aaf0e6ded7174fe22294bec4"},"schema_version":"1.0","source":{"id":"quant-ph/0401134","kind":"arxiv","version":1}},"canonical_sha256":"1e350ed1eb505b0426f2678e0d02839a945240f4102186bae57088a2d4f50f4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e350ed1eb505b0426f2678e0d02839a945240f4102186bae57088a2d4f50f4e","first_computed_at":"2026-07-04T14:46:30.613984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:46:30.613984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oCsE58tydlx4Ib9McIxpPcTD0UCkhWaL8aFaT9/omPKprVVB7AjjU3IK9ZG3Gb/g0lfdw+ZPxXuLwEQfHkzgDA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:46:30.614383Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0401134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1fcf4080a16883d501581f69f0a23f8fa215f835c625bcf277e2277e3c56dfa","sha256:278e8763aaf6635c4ec1eeffe650c3c6a9d064d87eaf49865287ce92819df4e8"],"state_sha256":"2209400eb177ad8ed1f298cd2cb7596b176309ceafc78c306e1a46640c2c7205"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"81ahBxcXIE+nfn2bnN/H29nFRD+EFfLTBF8fPD7R00D9CSS3dbcF2CyJNsdp5fQi+P5ZuJ1mON0LUOK5Vh8IAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T13:31:44.976547Z","bundle_sha256":"62859ce00b61f542ce1e4db5c022b47521c0c41f2ae9f67bafab2882f63770b2"}}