{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HRE62DXCTCAWMEITCBEDSRKARN","short_pith_number":"pith:HRE62DXC","canonical_record":{"source":{"id":"1405.4883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-19T20:33:08Z","cross_cats_sorted":[],"title_canon_sha256":"1cf1c9df1823bb239d2bc18e6ea662765e9d37b814b372475ad20890ad1aaed1","abstract_canon_sha256":"2e576884bd0d8de39423cc96c9e17b25efe05ef7dcc4fe27224eb50493d2a13d"},"schema_version":"1.0"},"canonical_sha256":"3c49ed0ee2988166111310483945408b7a051ecbab239eab6eee64d2e8fc250f","source":{"kind":"arxiv","id":"1405.4883","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4883","created_at":"2026-05-18T02:41:24Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4883v1","created_at":"2026-05-18T02:41:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4883","created_at":"2026-05-18T02:41:24Z"},{"alias_kind":"pith_short_12","alias_value":"HRE62DXCTCAW","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HRE62DXCTCAWMEIT","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HRE62DXC","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HRE62DXCTCAWMEITCBEDSRKARN","target":"record","payload":{"canonical_record":{"source":{"id":"1405.4883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-19T20:33:08Z","cross_cats_sorted":[],"title_canon_sha256":"1cf1c9df1823bb239d2bc18e6ea662765e9d37b814b372475ad20890ad1aaed1","abstract_canon_sha256":"2e576884bd0d8de39423cc96c9e17b25efe05ef7dcc4fe27224eb50493d2a13d"},"schema_version":"1.0"},"canonical_sha256":"3c49ed0ee2988166111310483945408b7a051ecbab239eab6eee64d2e8fc250f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:24.598838Z","signature_b64":"lF+bq7aJNQmAKO/IMWKSI6eJPWrI3x38EOGazS0ijImUDfVXVyn48DOG8EyASREMhnM5FCAbFjttAYPfi6qjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c49ed0ee2988166111310483945408b7a051ecbab239eab6eee64d2e8fc250f","last_reissued_at":"2026-05-18T02:41:24.598372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:24.598372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.4883","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-18T02:41:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KAZCKHrkcJJEUpz8sjTNYdlWEQ0ypBDU0Li4lqwalW5TSMjd4+pp3wWYNjBlVSt1A5lDFf0kZkCeTmYn3vZgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:59:07.753961Z"},"content_sha256":"513598fb72a536f720b52cb3bed87fd52f8c48afd481a6c4c4b0adbfdde2850d","schema_version":"1.0","event_id":"sha256:513598fb72a536f720b52cb3bed87fd52f8c48afd481a6c4c4b0adbfdde2850d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HRE62DXCTCAWMEITCBEDSRKARN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Vargo, Martin Suchara, Sergey Bravyi","submitted_at":"2014-05-19T20:33:08Z","abstract_excerpt":"We describe two implementations of the optimal error correction algorithm known as the maximum likelihood decoder (MLD) for the 2D surface code with a noiseless syndrome extraction. First, we show how to implement MLD exactly in time $O(n^2)$, where $n$ is the number of code qubits. Our implementation uses a reduction from MLD to simulation of matchgate quantum circuits. This reduction however requires a special noise model with independent bit-flip and phase-flip errors. Secondly, we show how to implement MLD approximately for more general noise models using matrix product states (MPS). Our i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4883","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-18T02:41:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aWRM/Ocu8JjdDAh0HhWinfoxQOTa726oo8HzbKCvD9UiMZUs/SAdNk9XVvWWBz+p/LfbtzhZDIIviKnnsUKQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:59:07.754666Z"},"content_sha256":"83b944d89c68ebc68d194c7f4a3902b3bcd013bae3d603af0192ba7595b76be9","schema_version":"1.0","event_id":"sha256:83b944d89c68ebc68d194c7f4a3902b3bcd013bae3d603af0192ba7595b76be9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRE62DXCTCAWMEITCBEDSRKARN/bundle.json","state_url":"https://pith.science/pith/HRE62DXCTCAWMEITCBEDSRKARN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRE62DXCTCAWMEITCBEDSRKARN/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-24T17:59:07Z","links":{"resolver":"https://pith.science/pith/HRE62DXCTCAWMEITCBEDSRKARN","bundle":"https://pith.science/pith/HRE62DXCTCAWMEITCBEDSRKARN/bundle.json","state":"https://pith.science/pith/HRE62DXCTCAWMEITCBEDSRKARN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRE62DXCTCAWMEITCBEDSRKARN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HRE62DXCTCAWMEITCBEDSRKARN","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":"2e576884bd0d8de39423cc96c9e17b25efe05ef7dcc4fe27224eb50493d2a13d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-19T20:33:08Z","title_canon_sha256":"1cf1c9df1823bb239d2bc18e6ea662765e9d37b814b372475ad20890ad1aaed1"},"schema_version":"1.0","source":{"id":"1405.4883","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4883","created_at":"2026-05-18T02:41:24Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4883v1","created_at":"2026-05-18T02:41:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4883","created_at":"2026-05-18T02:41:24Z"},{"alias_kind":"pith_short_12","alias_value":"HRE62DXCTCAW","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HRE62DXCTCAWMEIT","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HRE62DXC","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:83b944d89c68ebc68d194c7f4a3902b3bcd013bae3d603af0192ba7595b76be9","target":"graph","created_at":"2026-05-18T02:41:24Z","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 describe two implementations of the optimal error correction algorithm known as the maximum likelihood decoder (MLD) for the 2D surface code with a noiseless syndrome extraction. First, we show how to implement MLD exactly in time $O(n^2)$, where $n$ is the number of code qubits. Our implementation uses a reduction from MLD to simulation of matchgate quantum circuits. This reduction however requires a special noise model with independent bit-flip and phase-flip errors. Secondly, we show how to implement MLD approximately for more general noise models using matrix product states (MPS). Our i","authors_text":"Alexander Vargo, Martin Suchara, Sergey Bravyi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-19T20:33:08Z","title":"Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4883","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:513598fb72a536f720b52cb3bed87fd52f8c48afd481a6c4c4b0adbfdde2850d","target":"record","created_at":"2026-05-18T02:41:24Z","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":"2e576884bd0d8de39423cc96c9e17b25efe05ef7dcc4fe27224eb50493d2a13d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-19T20:33:08Z","title_canon_sha256":"1cf1c9df1823bb239d2bc18e6ea662765e9d37b814b372475ad20890ad1aaed1"},"schema_version":"1.0","source":{"id":"1405.4883","kind":"arxiv","version":1}},"canonical_sha256":"3c49ed0ee2988166111310483945408b7a051ecbab239eab6eee64d2e8fc250f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c49ed0ee2988166111310483945408b7a051ecbab239eab6eee64d2e8fc250f","first_computed_at":"2026-05-18T02:41:24.598372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:24.598372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lF+bq7aJNQmAKO/IMWKSI6eJPWrI3x38EOGazS0ijImUDfVXVyn48DOG8EyASREMhnM5FCAbFjttAYPfi6qjCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:24.598838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4883","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:513598fb72a536f720b52cb3bed87fd52f8c48afd481a6c4c4b0adbfdde2850d","sha256:83b944d89c68ebc68d194c7f4a3902b3bcd013bae3d603af0192ba7595b76be9"],"state_sha256":"654779ec2abf65add41266c7a5c51e7c3b97aaa68f2c4e292360c4c1ac73fab8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDSWSdsmWRlNPT7wwGWxRV+YFCdsqXkdpOkDqGjFsWdYaXSKrc50M0UirSTZZtzmp8byD6WXn3lUJg1HCRGxDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T17:59:07.758481Z","bundle_sha256":"f6aa8459b61b76f036398f30e6709a0392cc11101702de9903f1cfd6413ad191"}}