{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UE7JNNRYA4KQOLM72RHYSWAFCJ","short_pith_number":"pith:UE7JNNRY","schema_version":"1.0","canonical_sha256":"a13e96b6380715072d9fd44f895805125a9c18279a873949fb41555566a02ed3","source":{"kind":"arxiv","id":"2511.06758","version":2},"attestation_state":"computed","paper":{"title":"Dense packing of the surface code: code deformation procedures and hook-error-avoiding gate scheduling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hideaki Kawaguchi, Kohei Fujiu, Shin Nishio, Shota Nagayama, Takahiko satoh","submitted_at":"2025-11-10T06:36:55Z","abstract_excerpt":"The surface code is one of the leading quantum error correction codes for realizing large-scale fault-tolerant quantum computing (FTQC). One major challenge in realizing surface-code-based FTQC is the extremely large number of qubits required. To mitigate this problem, fusing multiple codewords of the surface code into a densely packed configuration has been proposed. It is known that by using dense packing, the number of physical qubits required per logical qubit can be reduced to approximately three-fourths compared to simply placing surface-code patches side by side. Despite its potential, "},"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":"2511.06758","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-11-10T06:36:55Z","cross_cats_sorted":[],"title_canon_sha256":"0fa1c4c9701ac94b7668d8a405fb567fe12771e6688112599997f71821e3d47f","abstract_canon_sha256":"2c590a2a44b062534ce4bdca062fc0270f063c50f9b20b6e67e1a430e48a649a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:58.338525Z","signature_b64":"jtu+I/vFpWSJFdBfCUXUqPtWv/srhTwheJ6NB7rFO0JmiPSET96O3ArDSdZFKxtk5PEklODoiDNLVUAuMTZyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a13e96b6380715072d9fd44f895805125a9c18279a873949fb41555566a02ed3","last_reissued_at":"2026-05-20T00:02:58.337720Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:58.337720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dense packing of the surface code: code deformation procedures and hook-error-avoiding gate scheduling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hideaki Kawaguchi, Kohei Fujiu, Shin Nishio, Shota Nagayama, Takahiko satoh","submitted_at":"2025-11-10T06:36:55Z","abstract_excerpt":"The surface code is one of the leading quantum error correction codes for realizing large-scale fault-tolerant quantum computing (FTQC). One major challenge in realizing surface-code-based FTQC is the extremely large number of qubits required. To mitigate this problem, fusing multiple codewords of the surface code into a densely packed configuration has been proposed. It is known that by using dense packing, the number of physical qubits required per logical qubit can be reduced to approximately three-fourths compared to simply placing surface-code patches side by side. Despite its potential, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.06758","kind":"arxiv","version":2},"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/2511.06758/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":"2511.06758","created_at":"2026-05-20T00:02:58.337854+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.06758v2","created_at":"2026-05-20T00:02:58.337854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.06758","created_at":"2026-05-20T00:02:58.337854+00:00"},{"alias_kind":"pith_short_12","alias_value":"UE7JNNRYA4KQ","created_at":"2026-05-20T00:02:58.337854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UE7JNNRYA4KQOLM7","created_at":"2026-05-20T00:02:58.337854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UE7JNNRY","created_at":"2026-05-20T00:02:58.337854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.04049","citing_title":"FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UE7JNNRYA4KQOLM72RHYSWAFCJ","json":"https://pith.science/pith/UE7JNNRYA4KQOLM72RHYSWAFCJ.json","graph_json":"https://pith.science/api/pith-number/UE7JNNRYA4KQOLM72RHYSWAFCJ/graph.json","events_json":"https://pith.science/api/pith-number/UE7JNNRYA4KQOLM72RHYSWAFCJ/events.json","paper":"https://pith.science/paper/UE7JNNRY"},"agent_actions":{"view_html":"https://pith.science/pith/UE7JNNRYA4KQOLM72RHYSWAFCJ","download_json":"https://pith.science/pith/UE7JNNRYA4KQOLM72RHYSWAFCJ.json","view_paper":"https://pith.science/paper/UE7JNNRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.06758&json=true","fetch_graph":"https://pith.science/api/pith-number/UE7JNNRYA4KQOLM72RHYSWAFCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/UE7JNNRYA4KQOLM72RHYSWAFCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UE7JNNRYA4KQOLM72RHYSWAFCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UE7JNNRYA4KQOLM72RHYSWAFCJ/action/storage_attestation","attest_author":"https://pith.science/pith/UE7JNNRYA4KQOLM72RHYSWAFCJ/action/author_attestation","sign_citation":"https://pith.science/pith/UE7JNNRYA4KQOLM72RHYSWAFCJ/action/citation_signature","submit_replication":"https://pith.science/pith/UE7JNNRYA4KQOLM72RHYSWAFCJ/action/replication_record"}},"created_at":"2026-05-20T00:02:58.337854+00:00","updated_at":"2026-05-20T00:02:58.337854+00:00"}