{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:G3EPVDXA7NR3O6CTNIJRYR2XKF","short_pith_number":"pith:G3EPVDXA","canonical_record":{"source":{"id":"1302.2669","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-11T23:53:13Z","cross_cats_sorted":[],"title_canon_sha256":"0c898cacc1888bd6de4cf7cce31e6bfc71fc37def1a70674c4934bf442252b0e","abstract_canon_sha256":"7fd89ccde39b69968aab35f8976379b82468bda1f664a80de34bdaad1a6064f3"},"schema_version":"1.0"},"canonical_sha256":"36c8fa8ee0fb63b778536a131c475751540745a4b34dfc18f94974bbbef8d88a","source":{"kind":"arxiv","id":"1302.2669","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2669","created_at":"2026-05-18T02:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2669v2","created_at":"2026-05-18T02:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2669","created_at":"2026-05-18T02:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"G3EPVDXA7NR3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G3EPVDXA7NR3O6CT","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G3EPVDXA","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:G3EPVDXA7NR3O6CTNIJRYR2XKF","target":"record","payload":{"canonical_record":{"source":{"id":"1302.2669","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-11T23:53:13Z","cross_cats_sorted":[],"title_canon_sha256":"0c898cacc1888bd6de4cf7cce31e6bfc71fc37def1a70674c4934bf442252b0e","abstract_canon_sha256":"7fd89ccde39b69968aab35f8976379b82468bda1f664a80de34bdaad1a6064f3"},"schema_version":"1.0"},"canonical_sha256":"36c8fa8ee0fb63b778536a131c475751540745a4b34dfc18f94974bbbef8d88a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:43.411306Z","signature_b64":"aYPG9sC2JufFkdZHNrbhzyGHi8spQmH/ay/31QQaMeY80TNiRlu2V2FagGGHCSq6qvJvks2soHqAK78fYjKfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36c8fa8ee0fb63b778536a131c475751540745a4b34dfc18f94974bbbef8d88a","last_reissued_at":"2026-05-18T02:58:43.410638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:43.410638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.2669","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:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jsUDonOsDgPbRqzPM65hyZ0UAd746TdG9i6B56wRtygpSQrWYnprl/D8rMWdKNAYls0fOXOADKVm2uR1MAcFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:39:22.427958Z"},"content_sha256":"d0651ebc2f3840faa2a82a70c014b8d5687c5bc180136173b7b73cfa03c5e38c","schema_version":"1.0","event_id":"sha256:d0651ebc2f3840faa2a82a70c014b8d5687c5bc180136173b7b73cfa03c5e38c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:G3EPVDXA7NR3O6CTNIJRYR2XKF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient Markov chain Monte Carlo algorithm for the surface code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adrian Hutter, Daniel Loss, James R. Wootton","submitted_at":"2013-02-11T23:53:13Z","abstract_excerpt":"Minimum-weight perfect matching (MWPM) has been been the primary classical algorithm for error correction in the surface code, since it is of low runtime complexity and achieves relatively low logical error rates [Phys. Rev. Lett. 108, 180501 (2012)]. A Markov chain Monte Carlo (MCMC) algorithm [Phys. Rev. Lett. 109, 160503 (2012)] is able to achieve lower logical error rates and higher thresholds than MWPM, but requires a classical runtime complexity which is super-polynomial in L, the linear size of the code. In this work we present an MCMC algorithm that achieves significantly lower logical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2669","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:58:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kdVFozCeDe30nHRF/hMQBu5j6Figf2lbl7mkmvAeEx8eYJpq1M0D7AEevLksRyP/6TbYwZ2Fg+Su6K8rPXm1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:39:22.428298Z"},"content_sha256":"4da2cdec3143865e694b6128bb5b1285822ad00bb0d378eda4d4d1cf5a456b49","schema_version":"1.0","event_id":"sha256:4da2cdec3143865e694b6128bb5b1285822ad00bb0d378eda4d4d1cf5a456b49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G3EPVDXA7NR3O6CTNIJRYR2XKF/bundle.json","state_url":"https://pith.science/pith/G3EPVDXA7NR3O6CTNIJRYR2XKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G3EPVDXA7NR3O6CTNIJRYR2XKF/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-06-02T01:39:22Z","links":{"resolver":"https://pith.science/pith/G3EPVDXA7NR3O6CTNIJRYR2XKF","bundle":"https://pith.science/pith/G3EPVDXA7NR3O6CTNIJRYR2XKF/bundle.json","state":"https://pith.science/pith/G3EPVDXA7NR3O6CTNIJRYR2XKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G3EPVDXA7NR3O6CTNIJRYR2XKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:G3EPVDXA7NR3O6CTNIJRYR2XKF","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":"7fd89ccde39b69968aab35f8976379b82468bda1f664a80de34bdaad1a6064f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-11T23:53:13Z","title_canon_sha256":"0c898cacc1888bd6de4cf7cce31e6bfc71fc37def1a70674c4934bf442252b0e"},"schema_version":"1.0","source":{"id":"1302.2669","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2669","created_at":"2026-05-18T02:58:43Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2669v2","created_at":"2026-05-18T02:58:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2669","created_at":"2026-05-18T02:58:43Z"},{"alias_kind":"pith_short_12","alias_value":"G3EPVDXA7NR3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G3EPVDXA7NR3O6CT","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G3EPVDXA","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:4da2cdec3143865e694b6128bb5b1285822ad00bb0d378eda4d4d1cf5a456b49","target":"graph","created_at":"2026-05-18T02:58:43Z","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":"Minimum-weight perfect matching (MWPM) has been been the primary classical algorithm for error correction in the surface code, since it is of low runtime complexity and achieves relatively low logical error rates [Phys. Rev. Lett. 108, 180501 (2012)]. A Markov chain Monte Carlo (MCMC) algorithm [Phys. Rev. Lett. 109, 160503 (2012)] is able to achieve lower logical error rates and higher thresholds than MWPM, but requires a classical runtime complexity which is super-polynomial in L, the linear size of the code. In this work we present an MCMC algorithm that achieves significantly lower logical","authors_text":"Adrian Hutter, Daniel Loss, James R. Wootton","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-11T23:53:13Z","title":"An efficient Markov chain Monte Carlo algorithm for the surface code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2669","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:d0651ebc2f3840faa2a82a70c014b8d5687c5bc180136173b7b73cfa03c5e38c","target":"record","created_at":"2026-05-18T02:58:43Z","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":"7fd89ccde39b69968aab35f8976379b82468bda1f664a80de34bdaad1a6064f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-11T23:53:13Z","title_canon_sha256":"0c898cacc1888bd6de4cf7cce31e6bfc71fc37def1a70674c4934bf442252b0e"},"schema_version":"1.0","source":{"id":"1302.2669","kind":"arxiv","version":2}},"canonical_sha256":"36c8fa8ee0fb63b778536a131c475751540745a4b34dfc18f94974bbbef8d88a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36c8fa8ee0fb63b778536a131c475751540745a4b34dfc18f94974bbbef8d88a","first_computed_at":"2026-05-18T02:58:43.410638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:43.410638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aYPG9sC2JufFkdZHNrbhzyGHi8spQmH/ay/31QQaMeY80TNiRlu2V2FagGGHCSq6qvJvks2soHqAK78fYjKfBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:43.411306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2669","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0651ebc2f3840faa2a82a70c014b8d5687c5bc180136173b7b73cfa03c5e38c","sha256:4da2cdec3143865e694b6128bb5b1285822ad00bb0d378eda4d4d1cf5a456b49"],"state_sha256":"cf74b9a16cae23c097eba93d41c48bd8630f6e02aee852a6f6cc0ed1486dec56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/LvXKsuuZvVLv4027vCYuui7oTgi20g2xYSg+Hff8b2AJQB/jPJSJTysRZmzxaXdytIG8MY3bF8UQOF/f6BLCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:39:22.430756Z","bundle_sha256":"c3a0468e26dbb5e25d57df0cd21e0a9443394c2264210e955bd8f4afa6558b4b"}}