{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7QFMDFG4BQ5QPLYGK7YXTLNPVQ","short_pith_number":"pith:7QFMDFG4","schema_version":"1.0","canonical_sha256":"fc0ac194dc0c3b07af0657f179adafac20256b0a4e74a2d855fde3f80b923353","source":{"kind":"arxiv","id":"1210.4249","version":1},"attestation_state":"computed","paper":{"title":"Checking the error correction strength of arbitrary surface code logical gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler, Thomas J. Milburn","submitted_at":"2012-10-16T05:03:51Z","abstract_excerpt":"Topologically quantum error corrected logical gates are complex. Chains of errors can form in space and time and diagonally in spacetime. It is highly nontrivial to determine whether a given logical gate is free of low weight combinations of errors leading to failure. We report a new tool Nestcheck capable of analyzing an arbitrary topological computation and determining the minimum number of errors required to cause failure."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1210.4249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-10-16T05:03:51Z","cross_cats_sorted":[],"title_canon_sha256":"9aea86be77feb638945912ec895b38b96d9bc2c3cdf6595a85a94c69b24e43dd","abstract_canon_sha256":"ef1dff8e1008e7d7d67d706537511f2011ea9e67fd02fc4fecc64af0aa2b8b2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:06.521832Z","signature_b64":"EkIQ5EiQJujaJQm9j7heeliv4bfUL/WWMocXWHptNhyWz7xyy8qBs1vuXnfODhChmEl24Ix8R5UNTwcbrRrLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc0ac194dc0c3b07af0657f179adafac20256b0a4e74a2d855fde3f80b923353","last_reissued_at":"2026-05-18T03:43:06.521056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:06.521056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Checking the error correction strength of arbitrary surface code logical gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Austin G. Fowler, Thomas J. Milburn","submitted_at":"2012-10-16T05:03:51Z","abstract_excerpt":"Topologically quantum error corrected logical gates are complex. Chains of errors can form in space and time and diagonally in spacetime. It is highly nontrivial to determine whether a given logical gate is free of low weight combinations of errors leading to failure. We report a new tool Nestcheck capable of analyzing an arbitrary topological computation and determining the minimum number of errors required to cause failure."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4249","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.4249","created_at":"2026-05-18T03:43:06.521186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4249v1","created_at":"2026-05-18T03:43:06.521186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4249","created_at":"2026-05-18T03:43:06.521186+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QFMDFG4BQ5Q","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QFMDFG4BQ5QPLYG","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QFMDFG4","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7QFMDFG4BQ5QPLYGK7YXTLNPVQ","json":"https://pith.science/pith/7QFMDFG4BQ5QPLYGK7YXTLNPVQ.json","graph_json":"https://pith.science/api/pith-number/7QFMDFG4BQ5QPLYGK7YXTLNPVQ/graph.json","events_json":"https://pith.science/api/pith-number/7QFMDFG4BQ5QPLYGK7YXTLNPVQ/events.json","paper":"https://pith.science/paper/7QFMDFG4"},"agent_actions":{"view_html":"https://pith.science/pith/7QFMDFG4BQ5QPLYGK7YXTLNPVQ","download_json":"https://pith.science/pith/7QFMDFG4BQ5QPLYGK7YXTLNPVQ.json","view_paper":"https://pith.science/paper/7QFMDFG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4249&json=true","fetch_graph":"https://pith.science/api/pith-number/7QFMDFG4BQ5QPLYGK7YXTLNPVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7QFMDFG4BQ5QPLYGK7YXTLNPVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QFMDFG4BQ5QPLYGK7YXTLNPVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QFMDFG4BQ5QPLYGK7YXTLNPVQ/action/storage_attestation","attest_author":"https://pith.science/pith/7QFMDFG4BQ5QPLYGK7YXTLNPVQ/action/author_attestation","sign_citation":"https://pith.science/pith/7QFMDFG4BQ5QPLYGK7YXTLNPVQ/action/citation_signature","submit_replication":"https://pith.science/pith/7QFMDFG4BQ5QPLYGK7YXTLNPVQ/action/replication_record"}},"created_at":"2026-05-18T03:43:06.521186+00:00","updated_at":"2026-05-18T03:43:06.521186+00:00"}