{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6EBVHO5WYTBDU7OEZ3TKQX2X62","short_pith_number":"pith:6EBVHO5W","schema_version":"1.0","canonical_sha256":"f10353bbb6c4c23a7dc4cee6a85f57f694c1ec4ebda6cea00d3d147753a113a6","source":{"kind":"arxiv","id":"2504.09171","version":1},"attestation_state":"computed","paper":{"title":"Tile Codes: High-Efficiency Quantum Codes on a Lattice with Boundary","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Francisco Revson Fernandes Pereira, Jens Niklas Eberhardt, Nikolas P. Breuckmann, Shin Ho Choe, Vincent Steffan","submitted_at":"2025-04-12T10:25:26Z","abstract_excerpt":"We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D-lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer weight. Our construction does not compromise on the fact that the codes are local on a lattice with open boundary conditions. Despite its simplicity, we use our construction to find codes with parameters $[[288, 8, 12]]$ using weight-6 stabilizers and $[[288, 8, 14]]$ using weight-8 stabilizers, outperforming all previously known constructions in this direct"},"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.09171","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-12T10:25:26Z","cross_cats_sorted":[],"title_canon_sha256":"c4ed0e29834690fe07763df0afefe53c281660dcc3b1e2d161ecf5186700c083","abstract_canon_sha256":"94ee14f98e3cf788d35043c747b2db788ad8fef4fbd5be32f97056a896ff5837"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:48:32.699850Z","signature_b64":"cpHV7Lqt1AHeMNoixEmYnj5ZeCi+XTtslK9LleIVepgSIfQa3T1+y315KWv9m9agXK11uKbHNinmbtRE4ei/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f10353bbb6c4c23a7dc4cee6a85f57f694c1ec4ebda6cea00d3d147753a113a6","last_reissued_at":"2026-07-05T10:48:32.699394Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:48:32.699394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tile Codes: High-Efficiency Quantum Codes on a Lattice with Boundary","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Francisco Revson Fernandes Pereira, Jens Niklas Eberhardt, Nikolas P. Breuckmann, Shin Ho Choe, Vincent Steffan","submitted_at":"2025-04-12T10:25:26Z","abstract_excerpt":"We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D-lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer weight. Our construction does not compromise on the fact that the codes are local on a lattice with open boundary conditions. Despite its simplicity, we use our construction to find codes with parameters $[[288, 8, 12]]$ using weight-6 stabilizers and $[[288, 8, 14]]$ using weight-8 stabilizers, outperforming all previously known constructions in this direct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.09171","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.09171/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.09171","created_at":"2026-07-05T10:48:32.699453+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.09171v1","created_at":"2026-07-05T10:48:32.699453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.09171","created_at":"2026-07-05T10:48:32.699453+00:00"},{"alias_kind":"pith_short_12","alias_value":"6EBVHO5WYTBD","created_at":"2026-07-05T10:48:32.699453+00:00"},{"alias_kind":"pith_short_16","alias_value":"6EBVHO5WYTBDU7OE","created_at":"2026-07-05T10:48:32.699453+00:00"},{"alias_kind":"pith_short_8","alias_value":"6EBVHO5W","created_at":"2026-07-05T10:48:32.699453+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20263","citing_title":"Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08771","citing_title":"Algebra of Bivariate-Bicycle Surface Codes","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19298","citing_title":"Translation-invariant quantum low-density parity-check codes from compactified fracton models","ref_index":80,"is_internal_anchor":false},{"citing_arxiv_id":"2507.23011","citing_title":"Placing and routing quantum LDPC codes in multilayer superconducting hardware","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24739","citing_title":"CAbLECAR: efficiently scheduling QLDPC codes on a tileable spin qubit chip with shuttling","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6EBVHO5WYTBDU7OEZ3TKQX2X62","json":"https://pith.science/pith/6EBVHO5WYTBDU7OEZ3TKQX2X62.json","graph_json":"https://pith.science/api/pith-number/6EBVHO5WYTBDU7OEZ3TKQX2X62/graph.json","events_json":"https://pith.science/api/pith-number/6EBVHO5WYTBDU7OEZ3TKQX2X62/events.json","paper":"https://pith.science/paper/6EBVHO5W"},"agent_actions":{"view_html":"https://pith.science/pith/6EBVHO5WYTBDU7OEZ3TKQX2X62","download_json":"https://pith.science/pith/6EBVHO5WYTBDU7OEZ3TKQX2X62.json","view_paper":"https://pith.science/paper/6EBVHO5W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.09171&json=true","fetch_graph":"https://pith.science/api/pith-number/6EBVHO5WYTBDU7OEZ3TKQX2X62/graph.json","fetch_events":"https://pith.science/api/pith-number/6EBVHO5WYTBDU7OEZ3TKQX2X62/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6EBVHO5WYTBDU7OEZ3TKQX2X62/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6EBVHO5WYTBDU7OEZ3TKQX2X62/action/storage_attestation","attest_author":"https://pith.science/pith/6EBVHO5WYTBDU7OEZ3TKQX2X62/action/author_attestation","sign_citation":"https://pith.science/pith/6EBVHO5WYTBDU7OEZ3TKQX2X62/action/citation_signature","submit_replication":"https://pith.science/pith/6EBVHO5WYTBDU7OEZ3TKQX2X62/action/replication_record"}},"created_at":"2026-07-05T10:48:32.699453+00:00","updated_at":"2026-07-05T10:48:32.699453+00:00"}