{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:UOARZCY57KC3JK3YOZCE3O3AP6","short_pith_number":"pith:UOARZCY5","schema_version":"1.0","canonical_sha256":"a3811c8b1dfa85b4ab7876444dbb607faca1727fc8901a3fe38ce9f6f696cf9b","source":{"kind":"arxiv","id":"quant-ph/0511016","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0511016","created_at":"2026-05-18T03:47:09.298238+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0511016v2","created_at":"2026-05-18T03:47:09.298238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0511016","created_at":"2026-05-18T03:47:09.298238+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOARZCY57KC3","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOARZCY57KC3JK3Y","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOARZCY5","created_at":"2026-05-18T12:25:53.939244+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UOARZCY57KC3JK3YOZCE3O3AP6","json":"https://pith.science/pith/UOARZCY57KC3JK3YOZCE3O3AP6.json","graph_json":"https://pith.science/api/pith-number/UOARZCY57KC3JK3YOZCE3O3AP6/graph.json","events_json":"https://pith.science/api/pith-number/UOARZCY57KC3JK3YOZCE3O3AP6/events.json","paper":"https://pith.science/paper/UOARZCY5"},"agent_actions":{"view_html":"https://pith.science/pith/UOARZCY57KC3JK3YOZCE3O3AP6","download_json":"https://pith.science/pith/UOARZCY57KC3JK3YOZCE3O3AP6.json","view_paper":"https://pith.science/paper/UOARZCY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0511016&json=true","fetch_graph":"https://pith.science/api/pith-number/UOARZCY57KC3JK3YOZCE3O3AP6/graph.json","fetch_events":"https://pith.science/api/pith-number/UOARZCY57KC3JK3YOZCE3O3AP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOARZCY57KC3JK3YOZCE3O3AP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOARZCY57KC3JK3YOZCE3O3AP6/action/storage_attestation","attest_author":"https://pith.science/pith/UOARZCY57KC3JK3YOZCE3O3AP6/action/author_attestation","sign_citation":"https://pith.science/pith/UOARZCY57KC3JK3YOZCE3O3AP6/action/citation_signature","submit_replication":"https://pith.science/pith/UOARZCY57KC3JK3YOZCE3O3AP6/action/replication_record"}},"created_at":"2026-05-18T03:47:09.298238+00:00","updated_at":"2026-05-18T03:47:09.298238+00:00"}