{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Q7QH7UZV7QBDJMK3BA2UVY2HPW","short_pith_number":"pith:Q7QH7UZV","canonical_record":{"source":{"id":"1208.1334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-07T04:43:14Z","cross_cats_sorted":[],"title_canon_sha256":"555fd6c581f2b682eca96e8753a1e7f371118f86c8af60ca4004b5399b336376","abstract_canon_sha256":"74047df95d389436536cbc8c7005290a84c00e71783a0cb8f82a99e952b50ad2"},"schema_version":"1.0"},"canonical_sha256":"87e07fd335fc0234b15b08354ae3477d9479af19936c805fafb1453152075409","source":{"kind":"arxiv","id":"1208.1334","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1334","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1334v1","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1334","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"pith_short_12","alias_value":"Q7QH7UZV7QBD","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"Q7QH7UZV7QBDJMK3","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"Q7QH7UZV","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Q7QH7UZV7QBDJMK3BA2UVY2HPW","target":"record","payload":{"canonical_record":{"source":{"id":"1208.1334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-07T04:43:14Z","cross_cats_sorted":[],"title_canon_sha256":"555fd6c581f2b682eca96e8753a1e7f371118f86c8af60ca4004b5399b336376","abstract_canon_sha256":"74047df95d389436536cbc8c7005290a84c00e71783a0cb8f82a99e952b50ad2"},"schema_version":"1.0"},"canonical_sha256":"87e07fd335fc0234b15b08354ae3477d9479af19936c805fafb1453152075409","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:52.901292Z","signature_b64":"G0V7qnpQBQvJC4OWSAvM5ukiHV+FvUIRkMErEYxQNEm1sMVE/PvW79UNnjBstv5mCcQ3G+Eqy8BWeiGNMyxTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87e07fd335fc0234b15b08354ae3477d9479af19936c805fafb1453152075409","last_reissued_at":"2026-05-18T03:26:52.900788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:52.900788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.1334","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-18T03:26:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3j/lu/h9VBFjn9p0GSu5Oz87cNg4ntEVuFRGMu7KouAYGJtbJ5gx4rke4LHzMK5icxCGX0bmxn0oKaV9Rj/cDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:39:44.104828Z"},"content_sha256":"137c8b226c23f0d5f15f921c3897d821726dada7c3c1048e25105e01ae03215d","schema_version":"1.0","event_id":"sha256:137c8b226c23f0d5f15f921c3897d821726dada7c3c1048e25105e01ae03215d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Q7QH7UZV7QBDJMK3BA2UVY2HPW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analytic asymptotic performance of topological codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler","submitted_at":"2012-08-07T04:43:14Z","abstract_excerpt":"Topological quantum error correction codes are extremely practical, typically requiring only a 2-D lattice of qubits with tunable nearest neighbor interactions yet tolerating high physical error rates p. It is computationally expensive to simulate the performance of such codes at low p, yet this is a regime we wish to study as low physical error rates lead to low qubit overhead. We present a very general method of analytically estimating the low p performance of the most promising class of topological codes. Our method can handle arbitrary periodic quantum circuits implementing the error detec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1334","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-18T03:26:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4gUARoXySURYP0qVLvrZu8wScM2tajFunyXF8WEZ3t5hQZc6Fim7FJsbkUJk4RDCvejqjzrRU348NgfVBBsHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:39:44.105550Z"},"content_sha256":"fdaf6243d341b6273b80f2aab7ed0750243b9e5b1726409cdd3613482ba5f167","schema_version":"1.0","event_id":"sha256:fdaf6243d341b6273b80f2aab7ed0750243b9e5b1726409cdd3613482ba5f167"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q7QH7UZV7QBDJMK3BA2UVY2HPW/bundle.json","state_url":"https://pith.science/pith/Q7QH7UZV7QBDJMK3BA2UVY2HPW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q7QH7UZV7QBDJMK3BA2UVY2HPW/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-31T10:39:44Z","links":{"resolver":"https://pith.science/pith/Q7QH7UZV7QBDJMK3BA2UVY2HPW","bundle":"https://pith.science/pith/Q7QH7UZV7QBDJMK3BA2UVY2HPW/bundle.json","state":"https://pith.science/pith/Q7QH7UZV7QBDJMK3BA2UVY2HPW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q7QH7UZV7QBDJMK3BA2UVY2HPW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Q7QH7UZV7QBDJMK3BA2UVY2HPW","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":"74047df95d389436536cbc8c7005290a84c00e71783a0cb8f82a99e952b50ad2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-07T04:43:14Z","title_canon_sha256":"555fd6c581f2b682eca96e8753a1e7f371118f86c8af60ca4004b5399b336376"},"schema_version":"1.0","source":{"id":"1208.1334","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1334","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1334v1","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1334","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"pith_short_12","alias_value":"Q7QH7UZV7QBD","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"Q7QH7UZV7QBDJMK3","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"Q7QH7UZV","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:fdaf6243d341b6273b80f2aab7ed0750243b9e5b1726409cdd3613482ba5f167","target":"graph","created_at":"2026-05-18T03:26:52Z","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 are extremely practical, typically requiring only a 2-D lattice of qubits with tunable nearest neighbor interactions yet tolerating high physical error rates p. It is computationally expensive to simulate the performance of such codes at low p, yet this is a regime we wish to study as low physical error rates lead to low qubit overhead. We present a very general method of analytically estimating the low p performance of the most promising class of topological codes. Our method can handle arbitrary periodic quantum circuits implementing the error detec","authors_text":"Austin G. Fowler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-07T04:43:14Z","title":"Analytic asymptotic performance of topological codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1334","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:137c8b226c23f0d5f15f921c3897d821726dada7c3c1048e25105e01ae03215d","target":"record","created_at":"2026-05-18T03:26:52Z","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":"74047df95d389436536cbc8c7005290a84c00e71783a0cb8f82a99e952b50ad2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-08-07T04:43:14Z","title_canon_sha256":"555fd6c581f2b682eca96e8753a1e7f371118f86c8af60ca4004b5399b336376"},"schema_version":"1.0","source":{"id":"1208.1334","kind":"arxiv","version":1}},"canonical_sha256":"87e07fd335fc0234b15b08354ae3477d9479af19936c805fafb1453152075409","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87e07fd335fc0234b15b08354ae3477d9479af19936c805fafb1453152075409","first_computed_at":"2026-05-18T03:26:52.900788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:52.900788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G0V7qnpQBQvJC4OWSAvM5ukiHV+FvUIRkMErEYxQNEm1sMVE/PvW79UNnjBstv5mCcQ3G+Eqy8BWeiGNMyxTBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:52.901292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1334","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:137c8b226c23f0d5f15f921c3897d821726dada7c3c1048e25105e01ae03215d","sha256:fdaf6243d341b6273b80f2aab7ed0750243b9e5b1726409cdd3613482ba5f167"],"state_sha256":"86f8a5d0dae74a031866989bab317cf1435e0f07bd99b3cad35e5f192d9fb5cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jercI3KQ4xap/GoarkGoc4zfcucCGtsZxOivtmxn5V3cAFEdkYKzixFxavQhKUILht9ms+6V2ecnIe6+NV5nBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:39:44.109256Z","bundle_sha256":"74deb321f8199fbeb042512858542e8625f62feabb30294a29a62dc212ccc63d"}}