{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:5Q6W3POPD644DNYY7L4DVQJ5L3","short_pith_number":"pith:5Q6W3POP","schema_version":"1.0","canonical_sha256":"ec3d6dbdcf1fb9c1b718faf83ac13d5ede1c7e94984a90eb897c2fedeb5f3ea4","source":{"kind":"arxiv","id":"0803.3232","version":1},"attestation_state":"computed","paper":{"title":"Codeword stabilized quantum codes: algorithm and structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew W. Cross, Bei Zeng, Graeme Smith, Isaac L. Chuang, John A. Smolin","submitted_at":"2008-03-21T21:38:55Z","abstract_excerpt":"The codeword stabilized (\"CWS\") quantum codes formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes (arXiv:0708.1021). This formalism reduces the problem of constructing such quantum codes to finding a binary classical code correcting an error pattern induced by a graph state. Finding such a classical code can be very difficult. Here, we consider an algorithm which maps the search for CWS codes to a problem of identifying maximum cliques in a graph. While solving this problem is in general very hard, we prove three structure theorems which reduc"},"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":"0803.3232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-03-21T21:38:55Z","cross_cats_sorted":[],"title_canon_sha256":"832482483976182b1dfbc82d53965f8841aaf493258f4796dcd6b6c80b269c54","abstract_canon_sha256":"89fa553b55398381cf55d377d27a1a1fa19d44d1be4d0c271e09e8023b5c1b54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:15:59.974724Z","signature_b64":"FsBey7bfQ8aX20lybuSyXGQ6IL4YSr+B2t6TMLmLNvjx+5PJI99ibcTw9w7IyUpU6FLxYZPfz6Mn08MJ+H4FCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec3d6dbdcf1fb9c1b718faf83ac13d5ede1c7e94984a90eb897c2fedeb5f3ea4","last_reissued_at":"2026-05-18T02:15:59.974103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:15:59.974103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Codeword stabilized quantum codes: algorithm and structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew W. Cross, Bei Zeng, Graeme Smith, Isaac L. Chuang, John A. Smolin","submitted_at":"2008-03-21T21:38:55Z","abstract_excerpt":"The codeword stabilized (\"CWS\") quantum codes formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes (arXiv:0708.1021). This formalism reduces the problem of constructing such quantum codes to finding a binary classical code correcting an error pattern induced by a graph state. Finding such a classical code can be very difficult. Here, we consider an algorithm which maps the search for CWS codes to a problem of identifying maximum cliques in a graph. While solving this problem is in general very hard, we prove three structure theorems which reduc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.3232","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":"0803.3232","created_at":"2026-05-18T02:15:59.974195+00:00"},{"alias_kind":"arxiv_version","alias_value":"0803.3232v1","created_at":"2026-05-18T02:15:59.974195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.3232","created_at":"2026-05-18T02:15:59.974195+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Q6W3POPD644","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Q6W3POPD644DNYY","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Q6W3POP","created_at":"2026-05-18T12:25:56.245647+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/5Q6W3POPD644DNYY7L4DVQJ5L3","json":"https://pith.science/pith/5Q6W3POPD644DNYY7L4DVQJ5L3.json","graph_json":"https://pith.science/api/pith-number/5Q6W3POPD644DNYY7L4DVQJ5L3/graph.json","events_json":"https://pith.science/api/pith-number/5Q6W3POPD644DNYY7L4DVQJ5L3/events.json","paper":"https://pith.science/paper/5Q6W3POP"},"agent_actions":{"view_html":"https://pith.science/pith/5Q6W3POPD644DNYY7L4DVQJ5L3","download_json":"https://pith.science/pith/5Q6W3POPD644DNYY7L4DVQJ5L3.json","view_paper":"https://pith.science/paper/5Q6W3POP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0803.3232&json=true","fetch_graph":"https://pith.science/api/pith-number/5Q6W3POPD644DNYY7L4DVQJ5L3/graph.json","fetch_events":"https://pith.science/api/pith-number/5Q6W3POPD644DNYY7L4DVQJ5L3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Q6W3POPD644DNYY7L4DVQJ5L3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Q6W3POPD644DNYY7L4DVQJ5L3/action/storage_attestation","attest_author":"https://pith.science/pith/5Q6W3POPD644DNYY7L4DVQJ5L3/action/author_attestation","sign_citation":"https://pith.science/pith/5Q6W3POPD644DNYY7L4DVQJ5L3/action/citation_signature","submit_replication":"https://pith.science/pith/5Q6W3POPD644DNYY7L4DVQJ5L3/action/replication_record"}},"created_at":"2026-05-18T02:15:59.974195+00:00","updated_at":"2026-05-18T02:15:59.974195+00:00"}