{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:LJWYJSMZYMUJP4RR6OPSV2GVBT","short_pith_number":"pith:LJWYJSMZ","schema_version":"1.0","canonical_sha256":"5a6d84c999c32897f231f39f2ae8d50cf3f5860f366b230308c156709823b8f1","source":{"kind":"arxiv","id":"2012.08536","version":3},"attestation_state":"computed","paper":{"title":"Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"D. E. Browne, M. Vasmer, P. Webster, T. R. Scruby","submitted_at":"2020-12-15T19:00:04Z","abstract_excerpt":"We build on recent work by B. Brown (Sci. Adv. 6, eaay4929 (2020)) to develop and simulate an explicit recipe for a just-in-time decoding scheme in three 3D surface codes, which can be used to implement a transversal (non-Clifford) $\\overline{CCZ}$ between three 2D surface codes in time linear in the code distance. We present a fully detailed set of bounded-height lattice slices through the 3D codes which retain the code distance and measurement-error detecting properties of the full 3D code and admit a dimension-jumping process which expands from/collapses to 2D surface codes supported on the"},"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":"2012.08536","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-12-15T19:00:04Z","cross_cats_sorted":[],"title_canon_sha256":"a023bd8015cac085549f91d89ed7a2ab65288dc9afd18ec422fa6c0c8acc4e49","abstract_canon_sha256":"8d696ad2e36823394fe4525abf26fa20d829bc6d0af64abf10d503e1e21c2941"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:27:41.628158Z","signature_b64":"mhF6yvDbvrz600gGT3OF+dppZeKm52taCsEvAqKx3WniInSz6C15jb2hs/oaYtoDbvtyk4Wl+GQ+jAOi+GIcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a6d84c999c32897f231f39f2ae8d50cf3f5860f366b230308c156709823b8f1","last_reissued_at":"2026-07-05T04:27:41.627773Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:27:41.627773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"D. E. Browne, M. Vasmer, P. Webster, T. R. Scruby","submitted_at":"2020-12-15T19:00:04Z","abstract_excerpt":"We build on recent work by B. Brown (Sci. Adv. 6, eaay4929 (2020)) to develop and simulate an explicit recipe for a just-in-time decoding scheme in three 3D surface codes, which can be used to implement a transversal (non-Clifford) $\\overline{CCZ}$ between three 2D surface codes in time linear in the code distance. We present a fully detailed set of bounded-height lattice slices through the 3D codes which retain the code distance and measurement-error detecting properties of the full 3D code and admit a dimension-jumping process which expands from/collapses to 2D surface codes supported on the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.08536","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/2012.08536/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":"2012.08536","created_at":"2026-07-05T04:27:41.627828+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.08536v3","created_at":"2026-07-05T04:27:41.627828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.08536","created_at":"2026-07-05T04:27:41.627828+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJWYJSMZYMUJ","created_at":"2026-07-05T04:27:41.627828+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJWYJSMZYMUJP4RR","created_at":"2026-07-05T04:27:41.627828+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJWYJSMZ","created_at":"2026-07-05T04:27:41.627828+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.05175","citing_title":"Planar fault-tolerant circuits for non-Clifford gates on the 2D color code","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LJWYJSMZYMUJP4RR6OPSV2GVBT","json":"https://pith.science/pith/LJWYJSMZYMUJP4RR6OPSV2GVBT.json","graph_json":"https://pith.science/api/pith-number/LJWYJSMZYMUJP4RR6OPSV2GVBT/graph.json","events_json":"https://pith.science/api/pith-number/LJWYJSMZYMUJP4RR6OPSV2GVBT/events.json","paper":"https://pith.science/paper/LJWYJSMZ"},"agent_actions":{"view_html":"https://pith.science/pith/LJWYJSMZYMUJP4RR6OPSV2GVBT","download_json":"https://pith.science/pith/LJWYJSMZYMUJP4RR6OPSV2GVBT.json","view_paper":"https://pith.science/paper/LJWYJSMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.08536&json=true","fetch_graph":"https://pith.science/api/pith-number/LJWYJSMZYMUJP4RR6OPSV2GVBT/graph.json","fetch_events":"https://pith.science/api/pith-number/LJWYJSMZYMUJP4RR6OPSV2GVBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJWYJSMZYMUJP4RR6OPSV2GVBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJWYJSMZYMUJP4RR6OPSV2GVBT/action/storage_attestation","attest_author":"https://pith.science/pith/LJWYJSMZYMUJP4RR6OPSV2GVBT/action/author_attestation","sign_citation":"https://pith.science/pith/LJWYJSMZYMUJP4RR6OPSV2GVBT/action/citation_signature","submit_replication":"https://pith.science/pith/LJWYJSMZYMUJP4RR6OPSV2GVBT/action/replication_record"}},"created_at":"2026-07-05T04:27:41.627828+00:00","updated_at":"2026-07-05T04:27:41.627828+00:00"}