{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:I7WG5RMKB26TFKRLARVV6A3ZXD","short_pith_number":"pith:I7WG5RMK","canonical_record":{"source":{"id":"1709.02154","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2017-09-07T09:36:24Z","cross_cats_sorted":[],"title_canon_sha256":"bcc797d60be0ba3f4ead2731362efde83adc83f77c4be6847a292638d89145db","abstract_canon_sha256":"8d659f9af145a03067087c3e4894835c789b598871d2faa71d08aa586d1fa718"},"schema_version":"1.0"},"canonical_sha256":"47ec6ec58a0ebd32aa2b046b5f0379b8fc945a9830eb897dcca98eca57d4051e","source":{"kind":"arxiv","id":"1709.02154","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02154","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02154v6","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02154","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"I7WG5RMKB26T","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I7WG5RMKB26TFKRL","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I7WG5RMK","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:I7WG5RMKB26TFKRLARVV6A3ZXD","target":"record","payload":{"canonical_record":{"source":{"id":"1709.02154","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2017-09-07T09:36:24Z","cross_cats_sorted":[],"title_canon_sha256":"bcc797d60be0ba3f4ead2731362efde83adc83f77c4be6847a292638d89145db","abstract_canon_sha256":"8d659f9af145a03067087c3e4894835c789b598871d2faa71d08aa586d1fa718"},"schema_version":"1.0"},"canonical_sha256":"47ec6ec58a0ebd32aa2b046b5f0379b8fc945a9830eb897dcca98eca57d4051e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:45.610708Z","signature_b64":"E2UOe2M0ZSFbK5K6EaG3UQZrIeQdesUY0d+r0amu29P3BjrdmNbICBuUHfcGgwEe/EI7TWNxlSC79NBq+k/9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47ec6ec58a0ebd32aa2b046b5f0379b8fc945a9830eb897dcca98eca57d4051e","last_reissued_at":"2026-05-18T00:02:45.610289Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:45.610289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.02154","source_version":6,"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-18T00:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+lZdVOlcULsIm3A9r8gkRE45eivtodw99RvId0JtuyibfsfG+A0npUJA3jzdoRt/dT8X0s7P1bd1+3kWSpODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:58:36.887382Z"},"content_sha256":"035a3652c532e4351f5aa44e7daf3f40935133dd16eececbdb325ff27f5ed11a","schema_version":"1.0","event_id":"sha256:035a3652c532e4351f5aa44e7daf3f40935133dd16eececbdb325ff27f5ed11a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:I7WG5RMKB26TFKRLARVV6A3ZXD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-path Summation for Decoding 2D Topological Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ben Criger, Imran Ashraf","submitted_at":"2017-09-07T09:36:24Z","abstract_excerpt":"Fault tolerance is a prerequisite for scalable quantum computing. Architectures based on 2D topological codes are effective for near-term implementations of fault tolerance. To obtain high performance with these architectures, we require a decoder which can adapt to the wide variety of error models present in experiments. The typical approach to the problem of decoding the surface code is to reduce it to minimum-weight perfect matching in a way that provides a suboptimal threshold error rate, and is specialized to correct a specific error model. Recently, optimal threshold error rates for a va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02154","kind":"arxiv","version":6},"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-18T00:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4yxu/m1FMG8IzpeQXPrd674bV0XssblKPbVWk/hXt+HuKPIq3qFpq25U1BGJill84XCP6uykx5t5P6FkDy4qDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:58:36.887721Z"},"content_sha256":"d07fdc52eebfb3c6cb36beb12c79b3e04405bd22475c88b247b66edc3c09b8c9","schema_version":"1.0","event_id":"sha256:d07fdc52eebfb3c6cb36beb12c79b3e04405bd22475c88b247b66edc3c09b8c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7WG5RMKB26TFKRLARVV6A3ZXD/bundle.json","state_url":"https://pith.science/pith/I7WG5RMKB26TFKRLARVV6A3ZXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7WG5RMKB26TFKRLARVV6A3ZXD/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-03T20:58:36Z","links":{"resolver":"https://pith.science/pith/I7WG5RMKB26TFKRLARVV6A3ZXD","bundle":"https://pith.science/pith/I7WG5RMKB26TFKRLARVV6A3ZXD/bundle.json","state":"https://pith.science/pith/I7WG5RMKB26TFKRLARVV6A3ZXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7WG5RMKB26TFKRLARVV6A3ZXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:I7WG5RMKB26TFKRLARVV6A3ZXD","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":"8d659f9af145a03067087c3e4894835c789b598871d2faa71d08aa586d1fa718","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2017-09-07T09:36:24Z","title_canon_sha256":"bcc797d60be0ba3f4ead2731362efde83adc83f77c4be6847a292638d89145db"},"schema_version":"1.0","source":{"id":"1709.02154","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02154","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02154v6","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02154","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"I7WG5RMKB26T","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I7WG5RMKB26TFKRL","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I7WG5RMK","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:d07fdc52eebfb3c6cb36beb12c79b3e04405bd22475c88b247b66edc3c09b8c9","target":"graph","created_at":"2026-05-18T00:02:45Z","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":"Fault tolerance is a prerequisite for scalable quantum computing. Architectures based on 2D topological codes are effective for near-term implementations of fault tolerance. To obtain high performance with these architectures, we require a decoder which can adapt to the wide variety of error models present in experiments. The typical approach to the problem of decoding the surface code is to reduce it to minimum-weight perfect matching in a way that provides a suboptimal threshold error rate, and is specialized to correct a specific error model. Recently, optimal threshold error rates for a va","authors_text":"Ben Criger, Imran Ashraf","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2017-09-07T09:36:24Z","title":"Multi-path Summation for Decoding 2D Topological Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02154","kind":"arxiv","version":6},"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:035a3652c532e4351f5aa44e7daf3f40935133dd16eececbdb325ff27f5ed11a","target":"record","created_at":"2026-05-18T00:02:45Z","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":"8d659f9af145a03067087c3e4894835c789b598871d2faa71d08aa586d1fa718","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2017-09-07T09:36:24Z","title_canon_sha256":"bcc797d60be0ba3f4ead2731362efde83adc83f77c4be6847a292638d89145db"},"schema_version":"1.0","source":{"id":"1709.02154","kind":"arxiv","version":6}},"canonical_sha256":"47ec6ec58a0ebd32aa2b046b5f0379b8fc945a9830eb897dcca98eca57d4051e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47ec6ec58a0ebd32aa2b046b5f0379b8fc945a9830eb897dcca98eca57d4051e","first_computed_at":"2026-05-18T00:02:45.610289Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:45.610289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E2UOe2M0ZSFbK5K6EaG3UQZrIeQdesUY0d+r0amu29P3BjrdmNbICBuUHfcGgwEe/EI7TWNxlSC79NBq+k/9BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:45.610708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02154","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:035a3652c532e4351f5aa44e7daf3f40935133dd16eececbdb325ff27f5ed11a","sha256:d07fdc52eebfb3c6cb36beb12c79b3e04405bd22475c88b247b66edc3c09b8c9"],"state_sha256":"f98dcf67e590af1dc931f2227de1d303b51d9100b8d0e751b6529ae012c8e68d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dtdTDMhKEPOMoHfYWuanl43qAS4KBhTS310MXY8vywTPAHF4/rzcu3fTOFJJF5ZsvuzHffE3tn5xsO6yq2yIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:58:36.889773Z","bundle_sha256":"85ca739bda302be01e13f2266696f0e94c259567df95f82d086984df8b071d87"}}