{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TOLD5PAPTTMOYOJHCDHHUPHC5V","short_pith_number":"pith:TOLD5PAP","schema_version":"1.0","canonical_sha256":"9b963ebc0f9cd8ec392710ce7a3ce2ed613c1944c11ec6386fd853488ee70d19","source":{"kind":"arxiv","id":"2506.04620","version":1},"attestation_state":"computed","paper":{"title":"A Resource Allocating Compiler for Lattice Surgery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alan Robertson, Haowen Gao, Yuval R. Sanders","submitted_at":"2025-06-05T04:27:21Z","abstract_excerpt":"The emerging field of quantum resource estimation is aimed at providing estimates of the hardware requirements (`quantum resources') needed to execute a useful, fault-tolerant quantum computation. Given that quantum computers are intended to compete with supercomputers, useful quantum computations are likely to involve the use of millions of qubits and error correction clock cycles. The compilation and benchmarking of these circuits depends on placement and routing algorithms, which are infeasible to construct at scale by hand. We offer a compiler that transforms a quantum circuit into a seque"},"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":"2506.04620","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-05T04:27:21Z","cross_cats_sorted":[],"title_canon_sha256":"944d10bcd748865c3a0558556ef5cee92fa86ddf5c9626f958332946bcbd2318","abstract_canon_sha256":"e82a186605a017cd501eb85d84bd697702b7915d3aa8a08e71694fb66b6b9470"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:17.984992Z","signature_b64":"LnYmday8ta2cSL+hCI+YD31Z16ik9jDFppbAJeNpRKupN+Cyr8rLdHl89wq6NB2DUpvWTnxsfenb0yGEO3uODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b963ebc0f9cd8ec392710ce7a3ce2ed613c1944c11ec6386fd853488ee70d19","last_reissued_at":"2026-07-05T11:16:17.984436Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:17.984436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Resource Allocating Compiler for Lattice Surgery","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alan Robertson, Haowen Gao, Yuval R. Sanders","submitted_at":"2025-06-05T04:27:21Z","abstract_excerpt":"The emerging field of quantum resource estimation is aimed at providing estimates of the hardware requirements (`quantum resources') needed to execute a useful, fault-tolerant quantum computation. Given that quantum computers are intended to compete with supercomputers, useful quantum computations are likely to involve the use of millions of qubits and error correction clock cycles. The compilation and benchmarking of these circuits depends on placement and routing algorithms, which are infeasible to construct at scale by hand. We offer a compiler that transforms a quantum circuit into a seque"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04620","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/2506.04620/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":"2506.04620","created_at":"2026-07-05T11:16:17.984491+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.04620v1","created_at":"2026-07-05T11:16:17.984491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04620","created_at":"2026-07-05T11:16:17.984491+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOLD5PAPTTMO","created_at":"2026-07-05T11:16:17.984491+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOLD5PAPTTMOYOJH","created_at":"2026-07-05T11:16:17.984491+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOLD5PAP","created_at":"2026-07-05T11:16:17.984491+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.06319","citing_title":"Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TOLD5PAPTTMOYOJHCDHHUPHC5V","json":"https://pith.science/pith/TOLD5PAPTTMOYOJHCDHHUPHC5V.json","graph_json":"https://pith.science/api/pith-number/TOLD5PAPTTMOYOJHCDHHUPHC5V/graph.json","events_json":"https://pith.science/api/pith-number/TOLD5PAPTTMOYOJHCDHHUPHC5V/events.json","paper":"https://pith.science/paper/TOLD5PAP"},"agent_actions":{"view_html":"https://pith.science/pith/TOLD5PAPTTMOYOJHCDHHUPHC5V","download_json":"https://pith.science/pith/TOLD5PAPTTMOYOJHCDHHUPHC5V.json","view_paper":"https://pith.science/paper/TOLD5PAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.04620&json=true","fetch_graph":"https://pith.science/api/pith-number/TOLD5PAPTTMOYOJHCDHHUPHC5V/graph.json","fetch_events":"https://pith.science/api/pith-number/TOLD5PAPTTMOYOJHCDHHUPHC5V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOLD5PAPTTMOYOJHCDHHUPHC5V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOLD5PAPTTMOYOJHCDHHUPHC5V/action/storage_attestation","attest_author":"https://pith.science/pith/TOLD5PAPTTMOYOJHCDHHUPHC5V/action/author_attestation","sign_citation":"https://pith.science/pith/TOLD5PAPTTMOYOJHCDHHUPHC5V/action/citation_signature","submit_replication":"https://pith.science/pith/TOLD5PAPTTMOYOJHCDHHUPHC5V/action/replication_record"}},"created_at":"2026-07-05T11:16:17.984491+00:00","updated_at":"2026-07-05T11:16:17.984491+00:00"}