{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ERNHD45GBT4M53RDPXWBECYZY5","short_pith_number":"pith:ERNHD45G","canonical_record":{"source":{"id":"1310.0863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-02T23:16:22Z","cross_cats_sorted":[],"title_canon_sha256":"f2973e9218e53dcb22f32ae06065f11aa7daee8a5be1becbf9f1256c4a5061fa","abstract_canon_sha256":"49c957557c26eb6af2dc3d61ac1777198c67b0c0f4ab6706f2a618a90ee7d4f0"},"schema_version":"1.0"},"canonical_sha256":"245a71f3a60cf8ceee237dec120b19c76920a2fad5f8b57e3e069d1273677b8b","source":{"kind":"arxiv","id":"1310.0863","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0863","created_at":"2026-05-18T03:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0863v1","created_at":"2026-05-18T03:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0863","created_at":"2026-05-18T03:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"ERNHD45GBT4M","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ERNHD45GBT4M53RD","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ERNHD45G","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ERNHD45GBT4M53RDPXWBECYZY5","target":"record","payload":{"canonical_record":{"source":{"id":"1310.0863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-02T23:16:22Z","cross_cats_sorted":[],"title_canon_sha256":"f2973e9218e53dcb22f32ae06065f11aa7daee8a5be1becbf9f1256c4a5061fa","abstract_canon_sha256":"49c957557c26eb6af2dc3d61ac1777198c67b0c0f4ab6706f2a618a90ee7d4f0"},"schema_version":"1.0"},"canonical_sha256":"245a71f3a60cf8ceee237dec120b19c76920a2fad5f8b57e3e069d1273677b8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:25.271118Z","signature_b64":"B+HP/J3ef8Qe8RQWiYvla4y2zamgplVsf2WAMc04xkq32Nm/TmU8lvta1+auTIRNgO3VyaaUX0HRknFYaeexBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"245a71f3a60cf8ceee237dec120b19c76920a2fad5f8b57e3e069d1273677b8b","last_reissued_at":"2026-05-18T03:11:25.270391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:25.270391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.0863","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:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0K+TYAZA/TZ9XRpYqa/5Hly3EoBJOZRaWp9Wd5jweFO5b8tvVQIt1Gu5rrrkGv7qJoXm/yT4QABeVuCFalJRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:34:46.379308Z"},"content_sha256":"76f9b1641567220d110e734946f1080930d5b6f34d959dece8d1190da501f872","schema_version":"1.0","event_id":"sha256:76f9b1641567220d110e734946f1080930d5b6f34d959dece8d1190da501f872"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ERNHD45GBT4M53RDPXWBECYZY5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal complexity correction of correlated errors in the surface code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler","submitted_at":"2013-10-02T23:16:22Z","abstract_excerpt":"The surface code is designed to suppress errors in quantum computing hardware and currently offers the most believable pathway to large-scale quantum computation. The surface code requires a 2-D array of nearest-neighbor coupled qubits that are capable of implementing a universal set of gates with error rates below approximately 1%, requirements compatible with experimental reality. Consequently, a number of authors are attempting to squeeze additional performance out of the surface code. We describe an optimal complexity error suppression algorithm, parallelizable to O(1) given constant compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0863","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:11:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"elbLTxCo3N9b8ooiv4lLQpc78NEUiZR9ogq4KjDnCC6oy5R+35P50AcF6bE8yb33kbDw0kNXYCnyWmhrBjmfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:34:46.380002Z"},"content_sha256":"8bb65f52af96bdd96904267a18088e94df8cd0c879f07e38a19efaf5a68b165a","schema_version":"1.0","event_id":"sha256:8bb65f52af96bdd96904267a18088e94df8cd0c879f07e38a19efaf5a68b165a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ERNHD45GBT4M53RDPXWBECYZY5/bundle.json","state_url":"https://pith.science/pith/ERNHD45GBT4M53RDPXWBECYZY5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ERNHD45GBT4M53RDPXWBECYZY5/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-27T03:34:46Z","links":{"resolver":"https://pith.science/pith/ERNHD45GBT4M53RDPXWBECYZY5","bundle":"https://pith.science/pith/ERNHD45GBT4M53RDPXWBECYZY5/bundle.json","state":"https://pith.science/pith/ERNHD45GBT4M53RDPXWBECYZY5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ERNHD45GBT4M53RDPXWBECYZY5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ERNHD45GBT4M53RDPXWBECYZY5","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":"49c957557c26eb6af2dc3d61ac1777198c67b0c0f4ab6706f2a618a90ee7d4f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-02T23:16:22Z","title_canon_sha256":"f2973e9218e53dcb22f32ae06065f11aa7daee8a5be1becbf9f1256c4a5061fa"},"schema_version":"1.0","source":{"id":"1310.0863","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0863","created_at":"2026-05-18T03:11:25Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0863v1","created_at":"2026-05-18T03:11:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0863","created_at":"2026-05-18T03:11:25Z"},{"alias_kind":"pith_short_12","alias_value":"ERNHD45GBT4M","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"ERNHD45GBT4M53RD","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"ERNHD45G","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:8bb65f52af96bdd96904267a18088e94df8cd0c879f07e38a19efaf5a68b165a","target":"graph","created_at":"2026-05-18T03:11:25Z","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":"The surface code is designed to suppress errors in quantum computing hardware and currently offers the most believable pathway to large-scale quantum computation. The surface code requires a 2-D array of nearest-neighbor coupled qubits that are capable of implementing a universal set of gates with error rates below approximately 1%, requirements compatible with experimental reality. Consequently, a number of authors are attempting to squeeze additional performance out of the surface code. We describe an optimal complexity error suppression algorithm, parallelizable to O(1) given constant compu","authors_text":"Austin G. Fowler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-02T23:16:22Z","title":"Optimal complexity correction of correlated errors in the surface code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0863","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:76f9b1641567220d110e734946f1080930d5b6f34d959dece8d1190da501f872","target":"record","created_at":"2026-05-18T03:11:25Z","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":"49c957557c26eb6af2dc3d61ac1777198c67b0c0f4ab6706f2a618a90ee7d4f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-02T23:16:22Z","title_canon_sha256":"f2973e9218e53dcb22f32ae06065f11aa7daee8a5be1becbf9f1256c4a5061fa"},"schema_version":"1.0","source":{"id":"1310.0863","kind":"arxiv","version":1}},"canonical_sha256":"245a71f3a60cf8ceee237dec120b19c76920a2fad5f8b57e3e069d1273677b8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"245a71f3a60cf8ceee237dec120b19c76920a2fad5f8b57e3e069d1273677b8b","first_computed_at":"2026-05-18T03:11:25.270391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:25.270391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B+HP/J3ef8Qe8RQWiYvla4y2zamgplVsf2WAMc04xkq32Nm/TmU8lvta1+auTIRNgO3VyaaUX0HRknFYaeexBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:25.271118Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.0863","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76f9b1641567220d110e734946f1080930d5b6f34d959dece8d1190da501f872","sha256:8bb65f52af96bdd96904267a18088e94df8cd0c879f07e38a19efaf5a68b165a"],"state_sha256":"e5990b64e1449c481bac7d489b4c379b741862acf258666e07f9ec883d5eec25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0f18U8L/jmuX4yTvCyeXMtQjfYxr/Wbe3V1fv0ih7h/7YSgz0FIUDcFsJr2g/02c6tr8pQ4+V61J51mYFD2jBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:34:46.384024Z","bundle_sha256":"edc6207d39eafb309bc05625da404c03be6f3c9bc443c583f0d24d1b9425423d"}}