{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QOYZNFUYAAFLWEN4EMAZKTETSI","short_pith_number":"pith:QOYZNFUY","canonical_record":{"source":{"id":"1411.3028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-11-12T00:01:24Z","cross_cats_sorted":[],"title_canon_sha256":"017ddd9a7d26dacf9b1876c689634b33b4a4ca945254b520517086e029ab0a37","abstract_canon_sha256":"0c83eb462bd1ee34867b6994006985212d9cedad49c140a199d9ea1db986caba"},"schema_version":"1.0"},"canonical_sha256":"83b1969698000abb11bc2301954c939237ab69828850d55e581dcee96f88e3de","source":{"kind":"arxiv","id":"1411.3028","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3028","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3028v2","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3028","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"pith_short_12","alias_value":"QOYZNFUYAAFL","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QOYZNFUYAAFLWEN4","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QOYZNFUY","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QOYZNFUYAAFLWEN4EMAZKTETSI","target":"record","payload":{"canonical_record":{"source":{"id":"1411.3028","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-11-12T00:01:24Z","cross_cats_sorted":[],"title_canon_sha256":"017ddd9a7d26dacf9b1876c689634b33b4a4ca945254b520517086e029ab0a37","abstract_canon_sha256":"0c83eb462bd1ee34867b6994006985212d9cedad49c140a199d9ea1db986caba"},"schema_version":"1.0"},"canonical_sha256":"83b1969698000abb11bc2301954c939237ab69828850d55e581dcee96f88e3de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:16.353173Z","signature_b64":"3rJgFKh3oPb+hZL/4AG/ZSODaEhyM4qQ65R7OTkWWvFVm6R4lA98z2W40GhxLhgc0dlhoHHVr/pVGJOQNqqrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83b1969698000abb11bc2301954c939237ab69828850d55e581dcee96f88e3de","last_reissued_at":"2026-05-18T01:33:16.352533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:16.352533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.3028","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-18T01:33:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CBU+UkfLpHOAXMHhi7IrxdX6TSPC+Z81fmflrbMUkTprSSCjT5xXBW+LhRw9xduhZ6MSPLKCaLZhXP+1j99dBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:18:23.461309Z"},"content_sha256":"9f30f50b7ea6648290d4be8ea334504bfd49d2c36dcc3c0f2282356c3810e019","schema_version":"1.0","event_id":"sha256:9f30f50b7ea6648290d4be8ea334504bfd49d2c36dcc3c0f2282356c3810e019"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QOYZNFUYAAFLWEN4EMAZKTETSI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A fast fault-tolerant decoder for qubit and qudit surface codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dan E. Browne, Fern H.E. Watson, Hussain Anwar","submitted_at":"2014-11-12T00:01:24Z","abstract_excerpt":"The surface code is one of the most promising candidates for combating errors in large scale fault-tolerant quantum computation. A fault-tolerant decoder is a vital part of the error correction process---it is the algorithm which computes the operations needed to correct or compensate for the errors according to the measured syndrome, even when the measurement itself is error prone. Previously decoders based on minimum-weight perfect matching have been studied. However, these are not immediately generalizable from qubit to qudit codes. In this work, we develop a fault-tolerant decoder for the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3028","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-18T01:33:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A0pNwZjJ2XLXOjZn96jaSE13BSrAShSC0uJ41IrPwBZWRetzywri8osAOqnVuo4y4KiYwAbdzc0Xkmk0t+/ECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:18:23.461663Z"},"content_sha256":"d0b67b5222bb390c0f0a63dd4b1611ad05e8000bb54ef67b14bc82232bd59c2f","schema_version":"1.0","event_id":"sha256:d0b67b5222bb390c0f0a63dd4b1611ad05e8000bb54ef67b14bc82232bd59c2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QOYZNFUYAAFLWEN4EMAZKTETSI/bundle.json","state_url":"https://pith.science/pith/QOYZNFUYAAFLWEN4EMAZKTETSI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QOYZNFUYAAFLWEN4EMAZKTETSI/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-27T15:18:23Z","links":{"resolver":"https://pith.science/pith/QOYZNFUYAAFLWEN4EMAZKTETSI","bundle":"https://pith.science/pith/QOYZNFUYAAFLWEN4EMAZKTETSI/bundle.json","state":"https://pith.science/pith/QOYZNFUYAAFLWEN4EMAZKTETSI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QOYZNFUYAAFLWEN4EMAZKTETSI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QOYZNFUYAAFLWEN4EMAZKTETSI","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":"0c83eb462bd1ee34867b6994006985212d9cedad49c140a199d9ea1db986caba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-11-12T00:01:24Z","title_canon_sha256":"017ddd9a7d26dacf9b1876c689634b33b4a4ca945254b520517086e029ab0a37"},"schema_version":"1.0","source":{"id":"1411.3028","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3028","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3028v2","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3028","created_at":"2026-05-18T01:33:16Z"},{"alias_kind":"pith_short_12","alias_value":"QOYZNFUYAAFL","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QOYZNFUYAAFLWEN4","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QOYZNFUY","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:d0b67b5222bb390c0f0a63dd4b1611ad05e8000bb54ef67b14bc82232bd59c2f","target":"graph","created_at":"2026-05-18T01:33:16Z","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 one of the most promising candidates for combating errors in large scale fault-tolerant quantum computation. A fault-tolerant decoder is a vital part of the error correction process---it is the algorithm which computes the operations needed to correct or compensate for the errors according to the measured syndrome, even when the measurement itself is error prone. Previously decoders based on minimum-weight perfect matching have been studied. However, these are not immediately generalizable from qubit to qudit codes. In this work, we develop a fault-tolerant decoder for the ","authors_text":"Dan E. Browne, Fern H.E. Watson, Hussain Anwar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-11-12T00:01:24Z","title":"A fast fault-tolerant decoder for qubit and qudit surface codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3028","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:9f30f50b7ea6648290d4be8ea334504bfd49d2c36dcc3c0f2282356c3810e019","target":"record","created_at":"2026-05-18T01:33:16Z","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":"0c83eb462bd1ee34867b6994006985212d9cedad49c140a199d9ea1db986caba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-11-12T00:01:24Z","title_canon_sha256":"017ddd9a7d26dacf9b1876c689634b33b4a4ca945254b520517086e029ab0a37"},"schema_version":"1.0","source":{"id":"1411.3028","kind":"arxiv","version":2}},"canonical_sha256":"83b1969698000abb11bc2301954c939237ab69828850d55e581dcee96f88e3de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83b1969698000abb11bc2301954c939237ab69828850d55e581dcee96f88e3de","first_computed_at":"2026-05-18T01:33:16.352533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:16.352533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3rJgFKh3oPb+hZL/4AG/ZSODaEhyM4qQ65R7OTkWWvFVm6R4lA98z2W40GhxLhgc0dlhoHHVr/pVGJOQNqqrBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:16.353173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3028","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f30f50b7ea6648290d4be8ea334504bfd49d2c36dcc3c0f2282356c3810e019","sha256:d0b67b5222bb390c0f0a63dd4b1611ad05e8000bb54ef67b14bc82232bd59c2f"],"state_sha256":"03e4b32b0b6373da2d791411b382a2f11e3f45ad6e544efb2fe5e26dfd3b4da5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pyPs6z9xfw7V0m20XH3xp8B6EGcXPCd23ofuQ61QOpsYl521VFLY0RAtj8ntrW0yMM566qDh+C0GTWPzlyTlCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T15:18:23.463500Z","bundle_sha256":"1734a0f496d302bd590b5043b5c5dd3e0a63ac1885db643dbcb416d4dc7e9c52"}}