{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7UXT2LEXO7N2D4JD6MXESZVK7M","short_pith_number":"pith:7UXT2LEX","schema_version":"1.0","canonical_sha256":"fd2f3d2c9777dba1f123f32e4966aafb350ba4377684b7e9d4487792d8ee4401","source":{"kind":"arxiv","id":"2504.02749","version":3},"attestation_state":"computed","paper":{"title":"Bacon-Shor Board Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Jun Zen, M. Sohaib Alam, Thomas R. Scruby","submitted_at":"2025-04-03T16:36:03Z","abstract_excerpt":"We identify a period-4 measurement schedule for the checks of the Bacon-Shor code that fully covers spacetime with constant-weight detectors, and is numerically observed to provide the code with a threshold. Unlike previous approaches, our method does not rely on code concatenation and instead arises as the solution to a coloring game on a square grid. Under a uniform circuit-level noise model, we observe a threshold of approximately $0.3\\%$ when decoding with minimum weight perfect matching, and we conjecture that this could be improved using a more tailored decoder."},"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":"2504.02749","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-03T16:36:03Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"351c7055b203a86e25c4ef6a3a77026728654c09867e63f78bbb7e4fa8626128","abstract_canon_sha256":"e715b7987e5984cd47d54158b9c4e938bc7deac2e99e76f23879c20795e86702"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-13T01:24:33.082809Z","signature_b64":"soGOk4jeMxtDB3Fp0B0FYJvUGzhgizD2oXt8KWp3hkLLgXUZSamjdXIj6vNeCFdhrtYs3vvlhKNDS4penxlGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd2f3d2c9777dba1f123f32e4966aafb350ba4377684b7e9d4487792d8ee4401","last_reissued_at":"2026-08-13T01:24:33.080480Z","signature_status":"signed_v1","first_computed_at":"2026-08-13T01:24:33.080480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bacon-Shor Board Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Jun Zen, M. Sohaib Alam, Thomas R. Scruby","submitted_at":"2025-04-03T16:36:03Z","abstract_excerpt":"We identify a period-4 measurement schedule for the checks of the Bacon-Shor code that fully covers spacetime with constant-weight detectors, and is numerically observed to provide the code with a threshold. Unlike previous approaches, our method does not rely on code concatenation and instead arises as the solution to a coloring game on a square grid. Under a uniform circuit-level noise model, we observe a threshold of approximately $0.3\\%$ when decoding with minimum weight perfect matching, and we conjecture that this could be improved using a more tailored decoder."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.02749","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.02749/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2504.02749","created_at":"2026-08-13T01:24:33.081594+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.02749v3","created_at":"2026-08-13T01:24:33.081594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.02749","created_at":"2026-08-13T01:24:33.081594+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UXT2LEXO7N2","created_at":"2026-08-13T01:24:33.081594+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UXT2LEXO7N2D4JD","created_at":"2026-08-13T01:24:33.081594+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UXT2LEX","created_at":"2026-08-13T01:24:33.081594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2604.14296","citing_title":"Scalable quantum error correction tailored for a heavy-hex qubit array","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2604.14296","citing_title":"Scalable quantum error correction tailored for a heavy-hex qubit array","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2604.14299","citing_title":"Low-valency scalable quantum error correction with a dynamic compass code","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7UXT2LEXO7N2D4JD6MXESZVK7M","json":"https://pith.science/pith/7UXT2LEXO7N2D4JD6MXESZVK7M.json","graph_json":"https://pith.science/api/pith-number/7UXT2LEXO7N2D4JD6MXESZVK7M/graph.json","events_json":"https://pith.science/api/pith-number/7UXT2LEXO7N2D4JD6MXESZVK7M/events.json","paper":"https://pith.science/paper/7UXT2LEX"},"agent_actions":{"view_html":"https://pith.science/pith/7UXT2LEXO7N2D4JD6MXESZVK7M","download_json":"https://pith.science/pith/7UXT2LEXO7N2D4JD6MXESZVK7M.json","view_paper":"https://pith.science/paper/7UXT2LEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.02749&json=true","fetch_graph":"https://pith.science/api/pith-number/7UXT2LEXO7N2D4JD6MXESZVK7M/graph.json","fetch_events":"https://pith.science/api/pith-number/7UXT2LEXO7N2D4JD6MXESZVK7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UXT2LEXO7N2D4JD6MXESZVK7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UXT2LEXO7N2D4JD6MXESZVK7M/action/storage_attestation","attest_author":"https://pith.science/pith/7UXT2LEXO7N2D4JD6MXESZVK7M/action/author_attestation","sign_citation":"https://pith.science/pith/7UXT2LEXO7N2D4JD6MXESZVK7M/action/citation_signature","submit_replication":"https://pith.science/pith/7UXT2LEXO7N2D4JD6MXESZVK7M/action/replication_record"}},"created_at":"2026-08-13T01:24:33.081594+00:00","updated_at":"2026-08-13T01:24:33.081594+00:00"}