{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:THULAWCD6ZEMVI2J4SVC3TFZG3","short_pith_number":"pith:THULAWCD","schema_version":"1.0","canonical_sha256":"99e8b05843f648caa349e4aa2dccb936f5059148ab90efc2c396c2b91302fe64","source":{"kind":"arxiv","id":"1108.5490","version":1},"attestation_state":"computed","paper":{"title":"Low-complexity quantum codes designed via codeword-stabilized framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexey A. Kovalev, Ilya Dumer, Leonid P. Pryadko","submitted_at":"2011-08-28T02:44:21Z","abstract_excerpt":"We consider design of the quantum stabilizer codes via a two-step, low-complexity approach based on the framework of codeword-stabilized (CWS) codes. In this framework, each quantum CWS code can be specified by a graph and a binary code. For codes that can be obtained from a given graph, we give several upper bounds on the distance of a generic (additive or non-additive) CWS code, and the lower Gilbert-Varshamov bound for the existence of additive CWS codes. We also consider additive cyclic CWS codes and show that these codes correspond to a previously unexplored class of single-generator cycl"},"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":"1108.5490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-08-28T02:44:21Z","cross_cats_sorted":[],"title_canon_sha256":"5d4debf3e147fb529038c95b8819c39f6f249f14c9ce86fafbd688af9e33efa7","abstract_canon_sha256":"24778b9524e88a421fa4f3666c78e752c5dd16d55afcbbcbd25348f724e0e420"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:49.556361Z","signature_b64":"7rEnIeBWgfXTCnRvU+4CY07hEDniOs5Bp41fvnG7Ws0r3Ee8OcVm1jeB8Qph1q6tUYgF7ibR2esv/PClGe88AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99e8b05843f648caa349e4aa2dccb936f5059148ab90efc2c396c2b91302fe64","last_reissued_at":"2026-05-18T04:01:49.555865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:49.555865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-complexity quantum codes designed via codeword-stabilized framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexey A. Kovalev, Ilya Dumer, Leonid P. Pryadko","submitted_at":"2011-08-28T02:44:21Z","abstract_excerpt":"We consider design of the quantum stabilizer codes via a two-step, low-complexity approach based on the framework of codeword-stabilized (CWS) codes. In this framework, each quantum CWS code can be specified by a graph and a binary code. For codes that can be obtained from a given graph, we give several upper bounds on the distance of a generic (additive or non-additive) CWS code, and the lower Gilbert-Varshamov bound for the existence of additive CWS codes. We also consider additive cyclic CWS codes and show that these codes correspond to a previously unexplored class of single-generator cycl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5490","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":"1108.5490","created_at":"2026-05-18T04:01:49.555931+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5490v1","created_at":"2026-05-18T04:01:49.555931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5490","created_at":"2026-05-18T04:01:49.555931+00:00"},{"alias_kind":"pith_short_12","alias_value":"THULAWCD6ZEM","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"THULAWCD6ZEMVI2J","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"THULAWCD","created_at":"2026-05-18T12:26:42.757692+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/THULAWCD6ZEMVI2J4SVC3TFZG3","json":"https://pith.science/pith/THULAWCD6ZEMVI2J4SVC3TFZG3.json","graph_json":"https://pith.science/api/pith-number/THULAWCD6ZEMVI2J4SVC3TFZG3/graph.json","events_json":"https://pith.science/api/pith-number/THULAWCD6ZEMVI2J4SVC3TFZG3/events.json","paper":"https://pith.science/paper/THULAWCD"},"agent_actions":{"view_html":"https://pith.science/pith/THULAWCD6ZEMVI2J4SVC3TFZG3","download_json":"https://pith.science/pith/THULAWCD6ZEMVI2J4SVC3TFZG3.json","view_paper":"https://pith.science/paper/THULAWCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5490&json=true","fetch_graph":"https://pith.science/api/pith-number/THULAWCD6ZEMVI2J4SVC3TFZG3/graph.json","fetch_events":"https://pith.science/api/pith-number/THULAWCD6ZEMVI2J4SVC3TFZG3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THULAWCD6ZEMVI2J4SVC3TFZG3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THULAWCD6ZEMVI2J4SVC3TFZG3/action/storage_attestation","attest_author":"https://pith.science/pith/THULAWCD6ZEMVI2J4SVC3TFZG3/action/author_attestation","sign_citation":"https://pith.science/pith/THULAWCD6ZEMVI2J4SVC3TFZG3/action/citation_signature","submit_replication":"https://pith.science/pith/THULAWCD6ZEMVI2J4SVC3TFZG3/action/replication_record"}},"created_at":"2026-05-18T04:01:49.555931+00:00","updated_at":"2026-05-18T04:01:49.555931+00:00"}