{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:UOARZCY57KC3JK3YOZCE3O3AP6","short_pith_number":"pith:UOARZCY5","canonical_record":{"source":{"id":"quant-ph/0511016","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-11-02T21:23:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"23f6532c69f3f166647dcb6da721d56ac8f4aa541e18e70df7b166ffd95957a6","abstract_canon_sha256":"53d6ace86a6ae6d9b8d523790fbdba9e9a7a4336717c07f2836eb49013c05678"},"schema_version":"1.0"},"canonical_sha256":"a3811c8b1dfa85b4ab7876444dbb607faca1727fc8901a3fe38ce9f6f696cf9b","source":{"kind":"arxiv","id":"quant-ph/0511016","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0511016","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0511016v2","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0511016","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"UOARZCY57KC3","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"UOARZCY57KC3JK3Y","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"UOARZCY5","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:UOARZCY57KC3JK3YOZCE3O3AP6","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0511016","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-11-02T21:23:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"23f6532c69f3f166647dcb6da721d56ac8f4aa541e18e70df7b166ffd95957a6","abstract_canon_sha256":"53d6ace86a6ae6d9b8d523790fbdba9e9a7a4336717c07f2836eb49013c05678"},"schema_version":"1.0"},"canonical_sha256":"a3811c8b1dfa85b4ab7876444dbb607faca1727fc8901a3fe38ce9f6f696cf9b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:47:09.298570Z","signature_b64":"WVR48JRqicu7pOFR1fL6g43iG0K1aBR5qa1xwhYk2Kg8i5jHIKY9D/WyX1Ubx5L/JieclIQEBVzcSgTBF3jfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3811c8b1dfa85b4ab7876444dbb607faca1727fc8901a3fe38ce9f6f696cf9b","last_reissued_at":"2026-05-18T03:47:09.298171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:47:09.298171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0511016","source_version":2,"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-05-18T03:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JvpvyfQRAMDPPICmakujrUrWq0ikHOSmSLYbBHQfm5BagqhtkWNaWXXoqBGDKMBi4JWnZTuQt0icx2GuTSBzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:37:08.080737Z"},"content_sha256":"2a99c89b9df035629ea7fc9991054376bc088127973165022fa541a374e87216","schema_version":"1.0","event_id":"sha256:2a99c89b9df035629ea7fc9991054376bc088127973165022fa541a374e87216"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:UOARZCY57KC3JK3YOZCE3O3AP6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convolutional and tail-biting quantum error-correcting codes","license":"","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"G. David Forney, Jr., Markus Grassl, Saikat Guha","submitted_at":"2005-11-02T21:23:21Z","abstract_excerpt":"Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to 10 are constructed as stabilizer codes from classical self-orthogonal rate-1/n F_4-linear and binary linear convolutional codes, respectively. These codes generally have higher rate and less decoding complexity than comparable quantum block codes or previous quantum convolutional codes. Rate-(n-2)/n block stabilizer codes with the same rate and error-correction capability and essentially the same decoding algorithms are derived from these convolutional codes via tail-biting."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0511016","kind":"arxiv","version":2},"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"},"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-05-18T03:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m2gQ8joitDFq8MInNcldP0QVLrrG2h1x6CpRekDlmc1cUHxXCRbgjK+79MQW8li96nZOW332glCswsoe0RqFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:37:08.081132Z"},"content_sha256":"21f22d3a7088189008f995cb80f36dba584e999b993926a5fca5f52e0eb926f0","schema_version":"1.0","event_id":"sha256:21f22d3a7088189008f995cb80f36dba584e999b993926a5fca5f52e0eb926f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UOARZCY57KC3JK3YOZCE3O3AP6/bundle.json","state_url":"https://pith.science/pith/UOARZCY57KC3JK3YOZCE3O3AP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UOARZCY57KC3JK3YOZCE3O3AP6/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-05-31T06:37:08Z","links":{"resolver":"https://pith.science/pith/UOARZCY57KC3JK3YOZCE3O3AP6","bundle":"https://pith.science/pith/UOARZCY57KC3JK3YOZCE3O3AP6/bundle.json","state":"https://pith.science/pith/UOARZCY57KC3JK3YOZCE3O3AP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UOARZCY57KC3JK3YOZCE3O3AP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:UOARZCY57KC3JK3YOZCE3O3AP6","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":"53d6ace86a6ae6d9b8d523790fbdba9e9a7a4336717c07f2836eb49013c05678","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"quant-ph","submitted_at":"2005-11-02T21:23:21Z","title_canon_sha256":"23f6532c69f3f166647dcb6da721d56ac8f4aa541e18e70df7b166ffd95957a6"},"schema_version":"1.0","source":{"id":"quant-ph/0511016","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0511016","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0511016v2","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0511016","created_at":"2026-05-18T03:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"UOARZCY57KC3","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"UOARZCY57KC3JK3Y","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"UOARZCY5","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:21f22d3a7088189008f995cb80f36dba584e999b993926a5fca5f52e0eb926f0","target":"graph","created_at":"2026-05-18T03:47:09Z","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"},"paper":{"abstract_excerpt":"Rate-(n-2)/n unrestricted and CSS-type quantum convolutional codes with up to 4096 states and minimum distances up to 10 are constructed as stabilizer codes from classical self-orthogonal rate-1/n F_4-linear and binary linear convolutional codes, respectively. These codes generally have higher rate and less decoding complexity than comparable quantum block codes or previous quantum convolutional codes. Rate-(n-2)/n block stabilizer codes with the same rate and error-correction capability and essentially the same decoding algorithms are derived from these convolutional codes via tail-biting.","authors_text":"G. David Forney, Jr., Markus Grassl, Saikat Guha","cross_cats":["cs.IT","math.IT"],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2005-11-02T21:23:21Z","title":"Convolutional and tail-biting quantum error-correcting codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0511016","kind":"arxiv","version":2},"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:2a99c89b9df035629ea7fc9991054376bc088127973165022fa541a374e87216","target":"record","created_at":"2026-05-18T03:47:09Z","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":"53d6ace86a6ae6d9b8d523790fbdba9e9a7a4336717c07f2836eb49013c05678","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"quant-ph","submitted_at":"2005-11-02T21:23:21Z","title_canon_sha256":"23f6532c69f3f166647dcb6da721d56ac8f4aa541e18e70df7b166ffd95957a6"},"schema_version":"1.0","source":{"id":"quant-ph/0511016","kind":"arxiv","version":2}},"canonical_sha256":"a3811c8b1dfa85b4ab7876444dbb607faca1727fc8901a3fe38ce9f6f696cf9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3811c8b1dfa85b4ab7876444dbb607faca1727fc8901a3fe38ce9f6f696cf9b","first_computed_at":"2026-05-18T03:47:09.298171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:47:09.298171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WVR48JRqicu7pOFR1fL6g43iG0K1aBR5qa1xwhYk2Kg8i5jHIKY9D/WyX1Ubx5L/JieclIQEBVzcSgTBF3jfAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:47:09.298570Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0511016","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a99c89b9df035629ea7fc9991054376bc088127973165022fa541a374e87216","sha256:21f22d3a7088189008f995cb80f36dba584e999b993926a5fca5f52e0eb926f0"],"state_sha256":"757e7ca1d96d2abaf5052f57754ebaa8e5b60eca2fe24aaa6775ddd70318cc58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4Mb43VsrF3nLNvJDecGwhZXeEaqXGSJ1lwyNikuq5QXpjKtFwnIoaVsT8E/SMSTemmf5dltMR5ptkFKm7AWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:37:08.085860Z","bundle_sha256":"5303394d54e0e8e33b1805a34f216c416c47949524b51c07e48b3fa88a28c941"}}