{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KFZXOIRHDY2MKI3RUHHJ5EOMIC","short_pith_number":"pith:KFZXOIRH","canonical_record":{"source":{"id":"1202.5602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-25T02:40:30Z","cross_cats_sorted":[],"title_canon_sha256":"ed58f557d82752aae1a73c40d95585ff9b07756d0eb20605f9e27a7462a56b82","abstract_canon_sha256":"d69ae691042506aa1351c82311f53a5f6444d5ae615bb3da875b3f9cf2d0d24a"},"schema_version":"1.0"},"canonical_sha256":"51737722271e34c52371a1ce9e91cc40aa7ee68e26ef5297f8f3d6ecc03934ff","source":{"kind":"arxiv","id":"1202.5602","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5602","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5602v2","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5602","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"KFZXOIRHDY2M","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KFZXOIRHDY2MKI3R","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KFZXOIRH","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KFZXOIRHDY2MKI3RUHHJ5EOMIC","target":"record","payload":{"canonical_record":{"source":{"id":"1202.5602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-25T02:40:30Z","cross_cats_sorted":[],"title_canon_sha256":"ed58f557d82752aae1a73c40d95585ff9b07756d0eb20605f9e27a7462a56b82","abstract_canon_sha256":"d69ae691042506aa1351c82311f53a5f6444d5ae615bb3da875b3f9cf2d0d24a"},"schema_version":"1.0"},"canonical_sha256":"51737722271e34c52371a1ce9e91cc40aa7ee68e26ef5297f8f3d6ecc03934ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:17.555704Z","signature_b64":"yz6+lxWqwaizuGhH8NWQ1QuCuZiakZjYkvUj85yPMHIn8USRAyHmOIOpK/7y9AfSIUVNMdYskkgshtFSJpoKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51737722271e34c52371a1ce9e91cc40aa7ee68e26ef5297f8f3d6ecc03934ff","last_reissued_at":"2026-05-18T02:21:17.554981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:17.554981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.5602","source_version":2,"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-18T02:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3J81UPEUoJxv3T2do8bvL4kmKkKsUpO4H+UZbdqdlP6s7TTMjKTeU7u2ZcUDZGDUQ9efyyvgvvNWdpwGqaujBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:18:54.409047Z"},"content_sha256":"c8f367c0d4c07eec66b6d3ad2e643f551acf13861539c502afd05bfe7d389a6d","schema_version":"1.0","event_id":"sha256:c8f367c0d4c07eec66b6d3ad2e643f551acf13861539c502afd05bfe7d389a6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KFZXOIRHDY2MKI3RUHHJ5EOMIC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards practical classical processing for the surface code: timing analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam C. Whiteside, Austin G. Fowler, Lloyd C. L. Hollenberg","submitted_at":"2012-02-25T02:40:30Z","abstract_excerpt":"Topological quantum error correction codes have high thresholds and are well suited to physical implementation. The minimum weight perfect matching algorithm can be used to efficiently handle errors in such codes. We perform a timing analysis of our current implementation of the minimum weight perfect matching algorithm. Our implementation performs the classical processing associated with an nxn lattice of qubits realizing a square surface code storing a single logical qubit of information in a fault-tolerant manner. We empirically demonstrate that our implementation requires only O(n^2) avera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5602","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"},"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-18T02:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7+CFicIh5L5P9zEKv+q0MWpdvQdJ9gP0z5duoPVZUlIenC8fTPY9p3uYKBe5xg+Z3ya2cQpTHZY8FhPljjsvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:18:54.409487Z"},"content_sha256":"3adfeb707a3f80910d4a366dbd15a17089dace1684ab75b4794d6a54bc002672","schema_version":"1.0","event_id":"sha256:3adfeb707a3f80910d4a366dbd15a17089dace1684ab75b4794d6a54bc002672"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KFZXOIRHDY2MKI3RUHHJ5EOMIC/bundle.json","state_url":"https://pith.science/pith/KFZXOIRHDY2MKI3RUHHJ5EOMIC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KFZXOIRHDY2MKI3RUHHJ5EOMIC/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-27T10:18:54Z","links":{"resolver":"https://pith.science/pith/KFZXOIRHDY2MKI3RUHHJ5EOMIC","bundle":"https://pith.science/pith/KFZXOIRHDY2MKI3RUHHJ5EOMIC/bundle.json","state":"https://pith.science/pith/KFZXOIRHDY2MKI3RUHHJ5EOMIC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KFZXOIRHDY2MKI3RUHHJ5EOMIC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KFZXOIRHDY2MKI3RUHHJ5EOMIC","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":"d69ae691042506aa1351c82311f53a5f6444d5ae615bb3da875b3f9cf2d0d24a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-25T02:40:30Z","title_canon_sha256":"ed58f557d82752aae1a73c40d95585ff9b07756d0eb20605f9e27a7462a56b82"},"schema_version":"1.0","source":{"id":"1202.5602","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5602","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5602v2","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5602","created_at":"2026-05-18T02:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"KFZXOIRHDY2M","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KFZXOIRHDY2MKI3R","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KFZXOIRH","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:3adfeb707a3f80910d4a366dbd15a17089dace1684ab75b4794d6a54bc002672","target":"graph","created_at":"2026-05-18T02:21:17Z","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":"Topological quantum error correction codes have high thresholds and are well suited to physical implementation. The minimum weight perfect matching algorithm can be used to efficiently handle errors in such codes. We perform a timing analysis of our current implementation of the minimum weight perfect matching algorithm. Our implementation performs the classical processing associated with an nxn lattice of qubits realizing a square surface code storing a single logical qubit of information in a fault-tolerant manner. We empirically demonstrate that our implementation requires only O(n^2) avera","authors_text":"Adam C. Whiteside, Austin G. Fowler, Lloyd C. L. Hollenberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-25T02:40:30Z","title":"Towards practical classical processing for the surface code: timing analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5602","kind":"arxiv","version":2},"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:c8f367c0d4c07eec66b6d3ad2e643f551acf13861539c502afd05bfe7d389a6d","target":"record","created_at":"2026-05-18T02:21:17Z","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":"d69ae691042506aa1351c82311f53a5f6444d5ae615bb3da875b3f9cf2d0d24a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-02-25T02:40:30Z","title_canon_sha256":"ed58f557d82752aae1a73c40d95585ff9b07756d0eb20605f9e27a7462a56b82"},"schema_version":"1.0","source":{"id":"1202.5602","kind":"arxiv","version":2}},"canonical_sha256":"51737722271e34c52371a1ce9e91cc40aa7ee68e26ef5297f8f3d6ecc03934ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51737722271e34c52371a1ce9e91cc40aa7ee68e26ef5297f8f3d6ecc03934ff","first_computed_at":"2026-05-18T02:21:17.554981Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:17.554981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yz6+lxWqwaizuGhH8NWQ1QuCuZiakZjYkvUj85yPMHIn8USRAyHmOIOpK/7y9AfSIUVNMdYskkgshtFSJpoKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:17.555704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5602","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8f367c0d4c07eec66b6d3ad2e643f551acf13861539c502afd05bfe7d389a6d","sha256:3adfeb707a3f80910d4a366dbd15a17089dace1684ab75b4794d6a54bc002672"],"state_sha256":"c5dcd2f874d12e7cb94f453cb88c10339c2c5300f81345967b43dbf698114b11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RSwasbJS/O4oAqOTNx/gdd1jO5lZqZqBb74ieI+eL0NMLucichQKXfVpDhycJN9zyAhyTxFBoobcUOi7MBteAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:18:54.412294Z","bundle_sha256":"23a8305e780f9f27c2d48b7486bcc9a4c3a67278ada8dcfa9c78006704383c73"}}