{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MHJSWUHTQAUIISFL4JC5KY5YAT","short_pith_number":"pith:MHJSWUHT","canonical_record":{"source":{"id":"1312.7646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-30T07:24:00Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ff12444139c9bf34684c6baf7710396ea66472c4560fc7a765e127fb1cd7a98f","abstract_canon_sha256":"79893360edd5b105a9204ff03b6408703f24b2326e9e983cf3294c0dee558577"},"schema_version":"1.0"},"canonical_sha256":"61d32b50f380288448abe245d563b804e5ce6b5e2df010d511dcdae17e395bcb","source":{"kind":"arxiv","id":"1312.7646","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7646","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7646v1","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7646","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"pith_short_12","alias_value":"MHJSWUHTQAUI","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MHJSWUHTQAUIISFL","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MHJSWUHT","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MHJSWUHTQAUIISFL4JC5KY5YAT","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-30T07:24:00Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ff12444139c9bf34684c6baf7710396ea66472c4560fc7a765e127fb1cd7a98f","abstract_canon_sha256":"79893360edd5b105a9204ff03b6408703f24b2326e9e983cf3294c0dee558577"},"schema_version":"1.0"},"canonical_sha256":"61d32b50f380288448abe245d563b804e5ce6b5e2df010d511dcdae17e395bcb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:34.105644Z","signature_b64":"E5L7llAwDQUo5QYGY1H1JdGsmM56tPEoHMms6Xswdm1OYBRw6eER7us9BLIsoSU7RtCBPhoeRlKx43DaoSOaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61d32b50f380288448abe245d563b804e5ce6b5e2df010d511dcdae17e395bcb","last_reissued_at":"2026-05-18T03:03:34.104932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:34.104932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7646","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-05-18T03:03:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TgLB/zlLbRnHBpcaPnx4HYHaeCDmzxCjFsHqc9G8cPCPXlgTj7X7TZ1FK/B2iE3Zyp/PDVYkE/CBTvX1nYWhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T22:53:44.533950Z"},"content_sha256":"2881c05e870ad62a61351e176445fa387335942c48e0e2ed3a7715fdc5e12619","schema_version":"1.0","event_id":"sha256:2881c05e870ad62a61351e176445fa387335942c48e0e2ed3a7715fdc5e12619"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MHJSWUHTQAUIISFL4JC5KY5YAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Short random circuits define good quantum error correcting codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Omar Fawzi, Winton Brown","submitted_at":"2013-12-30T07:24:00Z","abstract_excerpt":"We study the encoding complexity for quantum error correcting codes with large rate and distance. We prove that random Clifford circuits with $O(n \\log^2 n)$ gates can be used to encode $k$ qubits in $n$ qubits with a distance $d$ provided $\\frac{k}{n} < 1 - \\frac{d}{n} \\log_2 3 - h(\\frac{d}{n})$. In addition, we prove that such circuits typically have a depth of $O( \\log^3 n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7646","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"},"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:03:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOLCGIv0d00EeLwr3M9CVbY+BQ1SUAajLEey7y7YgE5e4+nfiHlpocv/7Io6E7TpjWUGMDQNAPa7em/H/BfFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T22:53:44.534629Z"},"content_sha256":"1c137985ccfc4bacbe25b93717734e5a7a7951ba60432e3c014ebd3ba66c97f3","schema_version":"1.0","event_id":"sha256:1c137985ccfc4bacbe25b93717734e5a7a7951ba60432e3c014ebd3ba66c97f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MHJSWUHTQAUIISFL4JC5KY5YAT/bundle.json","state_url":"https://pith.science/pith/MHJSWUHTQAUIISFL4JC5KY5YAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MHJSWUHTQAUIISFL4JC5KY5YAT/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-22T22:53:44Z","links":{"resolver":"https://pith.science/pith/MHJSWUHTQAUIISFL4JC5KY5YAT","bundle":"https://pith.science/pith/MHJSWUHTQAUIISFL4JC5KY5YAT/bundle.json","state":"https://pith.science/pith/MHJSWUHTQAUIISFL4JC5KY5YAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MHJSWUHTQAUIISFL4JC5KY5YAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MHJSWUHTQAUIISFL4JC5KY5YAT","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":"79893360edd5b105a9204ff03b6408703f24b2326e9e983cf3294c0dee558577","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-30T07:24:00Z","title_canon_sha256":"ff12444139c9bf34684c6baf7710396ea66472c4560fc7a765e127fb1cd7a98f"},"schema_version":"1.0","source":{"id":"1312.7646","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7646","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7646v1","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7646","created_at":"2026-05-18T03:03:34Z"},{"alias_kind":"pith_short_12","alias_value":"MHJSWUHTQAUI","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MHJSWUHTQAUIISFL","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MHJSWUHT","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:1c137985ccfc4bacbe25b93717734e5a7a7951ba60432e3c014ebd3ba66c97f3","target":"graph","created_at":"2026-05-18T03:03:34Z","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":"We study the encoding complexity for quantum error correcting codes with large rate and distance. We prove that random Clifford circuits with $O(n \\log^2 n)$ gates can be used to encode $k$ qubits in $n$ qubits with a distance $d$ provided $\\frac{k}{n} < 1 - \\frac{d}{n} \\log_2 3 - h(\\frac{d}{n})$. In addition, we prove that such circuits typically have a depth of $O( \\log^3 n)$.","authors_text":"Omar Fawzi, Winton Brown","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-30T07:24:00Z","title":"Short random circuits define good quantum error correcting codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7646","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:2881c05e870ad62a61351e176445fa387335942c48e0e2ed3a7715fdc5e12619","target":"record","created_at":"2026-05-18T03:03:34Z","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":"79893360edd5b105a9204ff03b6408703f24b2326e9e983cf3294c0dee558577","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-12-30T07:24:00Z","title_canon_sha256":"ff12444139c9bf34684c6baf7710396ea66472c4560fc7a765e127fb1cd7a98f"},"schema_version":"1.0","source":{"id":"1312.7646","kind":"arxiv","version":1}},"canonical_sha256":"61d32b50f380288448abe245d563b804e5ce6b5e2df010d511dcdae17e395bcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61d32b50f380288448abe245d563b804e5ce6b5e2df010d511dcdae17e395bcb","first_computed_at":"2026-05-18T03:03:34.104932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:34.104932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E5L7llAwDQUo5QYGY1H1JdGsmM56tPEoHMms6Xswdm1OYBRw6eER7us9BLIsoSU7RtCBPhoeRlKx43DaoSOaAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:34.105644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7646","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2881c05e870ad62a61351e176445fa387335942c48e0e2ed3a7715fdc5e12619","sha256:1c137985ccfc4bacbe25b93717734e5a7a7951ba60432e3c014ebd3ba66c97f3"],"state_sha256":"f6de9d36b051d87a5b33e82e7aca26eed3efc2d015ef7931c6fce85772644d0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jOFGmfPdIwyHsKe7bi/mimKZf/LUOkTKL3+uKr8u8UVy7bwIuWMLua/Z/xi11pTAK7Rl4aaxfkstzZnjoEvODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T22:53:44.538482Z","bundle_sha256":"52d820daadfac0bbadc354869256af4ffdb6a43407c46e3d679ac2a696985081"}}