{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZU6YQ7YKDGKZ4LJMUWMREPUUX4","short_pith_number":"pith:ZU6YQ7YK","canonical_record":{"source":{"id":"2608.03315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T08:21:59Z","cross_cats_sorted":[],"title_canon_sha256":"1467979f943051de94b6c9ff868029423031eb284a7259b18464a2bdcc838ed4","abstract_canon_sha256":"eb29502cbb53ed13bcebf092d90ba0f0ed134b753e348c1c71e132e82ae63721"},"schema_version":"1.0"},"canonical_sha256":"cd3d887f0a19959e2d2ca599123e94bf20031b3918dd7acec4a2b4ca6c5423e3","source":{"kind":"arxiv","id":"2608.03315","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.03315","created_at":"2026-08-05T00:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"2608.03315v1","created_at":"2026-08-05T00:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.03315","created_at":"2026-08-05T00:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZU6YQ7YKDGKZ","created_at":"2026-08-05T00:46:49Z"},{"alias_kind":"pith_short_16","alias_value":"ZU6YQ7YKDGKZ4LJM","created_at":"2026-08-05T00:46:49Z"},{"alias_kind":"pith_short_8","alias_value":"ZU6YQ7YK","created_at":"2026-08-05T00:46:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZU6YQ7YKDGKZ4LJMUWMREPUUX4","target":"record","payload":{"canonical_record":{"source":{"id":"2608.03315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T08:21:59Z","cross_cats_sorted":[],"title_canon_sha256":"1467979f943051de94b6c9ff868029423031eb284a7259b18464a2bdcc838ed4","abstract_canon_sha256":"eb29502cbb53ed13bcebf092d90ba0f0ed134b753e348c1c71e132e82ae63721"},"schema_version":"1.0"},"canonical_sha256":"cd3d887f0a19959e2d2ca599123e94bf20031b3918dd7acec4a2b4ca6c5423e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-05T00:46:49.862020Z","signature_b64":"NU6Nvm8FyazM2r8rHA/thhIC/t3cY8t8zzgvXEEUzDN5gEClsSpmJkhQ75+f3O3is0uJUVE4eUi0flnDm5CHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd3d887f0a19959e2d2ca599123e94bf20031b3918dd7acec4a2b4ca6c5423e3","last_reissued_at":"2026-08-05T00:46:49.859684Z","signature_status":"signed_v1","first_computed_at":"2026-08-05T00:46:49.859684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.03315","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-05T00:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hmxSGADZGxAYlwbDcKdnWyBrZB9I3GcfjZPgjGDcMF8EL1NCn0KMOqKBmIz5mEQ66E7mF0yR3x0dgu/NcX9rBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:31:47.037354Z"},"content_sha256":"9c8b1660de00f5e10a1ff057ae21271789dd3aa08f579def2d6d1af384e107d1","schema_version":"1.0","event_id":"sha256:9c8b1660de00f5e10a1ff057ae21271789dd3aa08f579def2d6d1af384e107d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZU6YQ7YKDGKZ4LJMUWMREPUUX4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Harvest: Resource-Aware Quantum Compilation for Magic State Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksandra \\'Swierkowska, Emmanouil Giortamis, Jannik Pflieger, Pramod Bhatotia","submitted_at":"2026-08-04T08:21:59Z","abstract_excerpt":"Fault-tolerant quantum processors based on topological codes execute programs through lattice surgery, where operations must be mapped, routed, and supplied with magic states across a 2D grid of physical patches. Non-Clifford operations require these magic states, produced either by distillation factories or by cultivation, each trading footprint against preparation latency, and delivering a magic state to the data patches that consume it requires routing through the same shared layout as every other operation. Yet placement, routing, scheduling, and magic-state supply cannot be optimized in i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.03315","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/2608.03315/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-05T00:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pBD+5N5jriPy7p13TEV1U7JcosuA+6bNIzHz3uFBZlsL9KNKKLH6U/aP+SoSIkJi/D4w4P6qxOhnSqNDG22xCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:31:47.037848Z"},"content_sha256":"64e7838f14462861703ac0c662066c4287e5bfbf491fbbe21a513fb891549cec","schema_version":"1.0","event_id":"sha256:64e7838f14462861703ac0c662066c4287e5bfbf491fbbe21a513fb891549cec"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:ZU6YQ7YKDGKZ4LJMUWMREPUUX4","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1103/PRXQuantum.4.040344 resolves to 'Scalable Surface-Code Decoders with Parallelization in Time'. A reader following the printed text alone cannot reach it.","snippet":"X. Tan, F. Zhang, R. Chao, Y . Shi, and J. Chen, “Scalable surface-code decoders with parallelization in time,”PRX Quantum, vol. 4, p. 040344, Dec 2023. [Online]. Available: https://doi.org/10.1103/PRXQuantum.4. 040344","arxiv_id":"2608.03315","detector":"doi_compliance","evidence":{"ref_index":31,"verdict_class":"incontrovertible","resolved_title":"Scalable Surface-Code Decoders with Parallelization in Time","printed_excerpt":"10.1103/prxquantum.4","reconstructed_doi":"10.1103/PRXQuantum.4.040344"},"severity":"advisory","ref_index":31,"audited_at":"2026-08-05T21:18:06.117617Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/PRXQuantum.4.040344","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"c976ff2eda93aec25dd2e27a43c7482e943cb32d5f60b95bdbc269b1b975c073","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Scalable Surface-Code Decoders with Parallelization in Time","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18151,"payload_sha256":"864992ec7790bf9af3d405f0780133717334d781f76db71e7fc829107f33df97","signature_b64":"34Ie9gt+4yMbUkj192ADA78gYPAdcO915jO++8HHBwmNN9Kz+sLPdtJoSb6BUqzHR+864tDvn0pa+WaU0MnWCA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-05T21:18:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eH0L2qf7N8QYahSfoYvNF9kcAX79o/AbAnry6EGfAuDtM+zuFaoPLzciJqzPaOgza6lG19KYMb4K/uf57CNbDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:31:47.040719Z"},"content_sha256":"47f34e84c22cb6190a2dd50ef09d3d73e9dfdbee3a3ed772c416b8ddd685fffb","schema_version":"1.0","event_id":"sha256:47f34e84c22cb6190a2dd50ef09d3d73e9dfdbee3a3ed772c416b8ddd685fffb"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:ZU6YQ7YKDGKZ4LJMUWMREPUUX4","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.22331/q-2025-01-20-1600) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"O. Higgott and C. Gidney, “Sparse Blossom: correcting a million errors per core second with minimum-weight matching,”Quantum, vol. 9, p. 1600, 2025. [Online]. Available: https://doi.org/10.22331/q-2025-01- 20-1600","arxiv_id":"2608.03315","detector":"doi_compliance","evidence":{"ref_index":30,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.22331/q-2025-01-","reconstructed_doi":"10.22331/q-2025-01-20-1600"},"severity":"advisory","ref_index":30,"audited_at":"2026-08-05T21:18:06.117617Z","event_type":"pith.integrity.v1","detected_doi":"10.22331/q-2025-01-20-1600","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"d47a7a7dae33e6a6e78187e4e0c9510c95198334859fe9094cfa8b9a44628b9f","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18150,"payload_sha256":"eb194a59595f9e15d505d03e1bbb927612fa534bb865bc7c3bf62b35e731c624","signature_b64":"aFj6XDRubUNnI6QvLj08Ad9W085FFGeYfAnKOq0bs2ytoaBthJgRzvMQAc3nK/ZK4Y81jbT7dkbyZWKNJTEoCA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-05T21:18:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1B1SOAS1J8SUwcVtIgs8OBRNKQtCcBzLHJY5o3RTqsirQHnr2W53GUvbVtaHV3Hjfc901aUju8B05g20TNfBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:31:47.041168Z"},"content_sha256":"a39e32571df0e49bc2c689465461b1a7f3f693b798f7a4f1c7fcf396fce9b69a","schema_version":"1.0","event_id":"sha256:a39e32571df0e49bc2c689465461b1a7f3f693b798f7a4f1c7fcf396fce9b69a"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:ZU6YQ7YKDGKZ4LJMUWMREPUUX4","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1038/s41586-024-08449-y) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"R. Acharya, I. Aleiner, T. I. Andersen, M. Ansmann, F. Arute, and Google Quantum AI and Collaborators, “Quantum error correction below the surface code threshold,”Nature, vol. 638, no. 8052, pp. 920–926, Feb 2025. [Online]. Available: https","arxiv_id":"2608.03315","detector":"doi_compliance","evidence":{"ref_index":25,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1038/s41586-","reconstructed_doi":"10.1038/s41586-024-08449-y"},"severity":"advisory","ref_index":25,"audited_at":"2026-08-05T21:18:06.117617Z","event_type":"pith.integrity.v1","detected_doi":"10.1038/s41586-024-08449-y","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"2cd3eceee5333c65c82f84592aa7f713bc697b971177d43353b36a6027e4b32e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18149,"payload_sha256":"882b5b2b916025e8b094e3cab52a445aab8d01610c9b132773a01516420133c6","signature_b64":"7nn8+FLS98rN8hM1q+WnBsbIezEbddI7oGCZootxbIqLAFveqTfYZBQrmJWneslggcyPpi8QaNWAyX8cSffzDA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-05T21:18:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ytAbnX/pfqn1xmffySA2ifA3m5gYqly8/LCBhYdfN2wofuXGNMAAxRs+Xh1uHpJ/GsE5EGYU/7rTjXGwFSGeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:31:47.041537Z"},"content_sha256":"11d901607b11c5a673e00adb507ae6416aa8e419c217e8acdca0ffdd7b89b90e","schema_version":"1.0","event_id":"sha256:11d901607b11c5a673e00adb507ae6416aa8e419c217e8acdca0ffdd7b89b90e"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:ZU6YQ7YKDGKZ4LJMUWMREPUUX4","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1103/PhysRevA.71.022316 resolves to 'Universal quantum computation with ideal Clifford gates and noisy ancillas'. A reader following the printed text alone cannot reach it.","snippet":"S. Bravyi and A. Kitaev, “Universal quantum computation with ideal clifford gates and noisy ancillas,”Physical Review A, vol. 71, no. 2, Feb. 2005. [Online]. Available: http://dx.doi.org/10.1103/PhysRevA.71. 022316","arxiv_id":"2608.03315","detector":"doi_compliance","evidence":{"ref_index":11,"verdict_class":"incontrovertible","resolved_title":"Universal quantum computation with ideal Clifford gates and noisy ancillas","printed_excerpt":"10.1103/physreva.71","reconstructed_doi":"10.1103/PhysRevA.71.022316"},"severity":"advisory","ref_index":11,"audited_at":"2026-08-05T21:18:06.117617Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/PhysRevA.71.022316","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"136bf1cd44e69b18fec0ddefbe7272076895e4b73ac0e4e212adbe70ff7f34e9","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Universal quantum computation with ideal Clifford gates and noisy ancillas","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":18148,"payload_sha256":"47db7d55fa2372c6980f1e6072d4fcecb00024748dfc03e5592abeb61332f2d0","signature_b64":"nyxoHosYCa9tOyEH++3MukXxz2UWeUfuoTlj/8lX2q04+nYHZlw5vIv0iklD/GoppGyda1i7B6hhj0+jVxk9BQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-05T21:18:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8z7B+4Xg38OXXdlI20jxSRe4Z1ZKexj4ukFQwH6ryzzXAo/In5j/gloTMKiQnPKtiWZi3AJCdDOdD+Hq9+GlCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:31:47.041905Z"},"content_sha256":"9794a7504b8d53ab8958304fa76be8cc4586834ef1cc0400af26832ecea6dc3b","schema_version":"1.0","event_id":"sha256:9794a7504b8d53ab8958304fa76be8cc4586834ef1cc0400af26832ecea6dc3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZU6YQ7YKDGKZ4LJMUWMREPUUX4/bundle.json","state_url":"https://pith.science/pith/ZU6YQ7YKDGKZ4LJMUWMREPUUX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZU6YQ7YKDGKZ4LJMUWMREPUUX4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T03:31:47Z","links":{"resolver":"https://pith.science/pith/ZU6YQ7YKDGKZ4LJMUWMREPUUX4","bundle":"https://pith.science/pith/ZU6YQ7YKDGKZ4LJMUWMREPUUX4/bundle.json","state":"https://pith.science/pith/ZU6YQ7YKDGKZ4LJMUWMREPUUX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZU6YQ7YKDGKZ4LJMUWMREPUUX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZU6YQ7YKDGKZ4LJMUWMREPUUX4","merge_version":"pith-open-graph-merge-v1","event_count":6,"valid_event_count":6,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"eb29502cbb53ed13bcebf092d90ba0f0ed134b753e348c1c71e132e82ae63721","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T08:21:59Z","title_canon_sha256":"1467979f943051de94b6c9ff868029423031eb284a7259b18464a2bdcc838ed4"},"schema_version":"1.0","source":{"id":"2608.03315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.03315","created_at":"2026-08-05T00:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"2608.03315v1","created_at":"2026-08-05T00:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.03315","created_at":"2026-08-05T00:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"ZU6YQ7YKDGKZ","created_at":"2026-08-05T00:46:49Z"},{"alias_kind":"pith_short_16","alias_value":"ZU6YQ7YKDGKZ4LJM","created_at":"2026-08-05T00:46:49Z"},{"alias_kind":"pith_short_8","alias_value":"ZU6YQ7YK","created_at":"2026-08-05T00:46:49Z"}],"graph_snapshots":[{"event_id":"sha256:64e7838f14462861703ac0c662066c4287e5bfbf491fbbe21a513fb891549cec","target":"graph","created_at":"2026-08-05T00:46:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.03315/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fault-tolerant quantum processors based on topological codes execute programs through lattice surgery, where operations must be mapped, routed, and supplied with magic states across a 2D grid of physical patches. Non-Clifford operations require these magic states, produced either by distillation factories or by cultivation, each trading footprint against preparation latency, and delivering a magic state to the data patches that consume it requires routing through the same shared layout as every other operation. Yet placement, routing, scheduling, and magic-state supply cannot be optimized in i","authors_text":"Aleksandra \\'Swierkowska, Emmanouil Giortamis, Jannik Pflieger, Pramod Bhatotia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T08:21:59Z","title":"Harvest: Resource-Aware Quantum Compilation for Magic State Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.03315","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9c8b1660de00f5e10a1ff057ae21271789dd3aa08f579def2d6d1af384e107d1","target":"record","created_at":"2026-08-05T00:46:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"eb29502cbb53ed13bcebf092d90ba0f0ed134b753e348c1c71e132e82ae63721","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T08:21:59Z","title_canon_sha256":"1467979f943051de94b6c9ff868029423031eb284a7259b18464a2bdcc838ed4"},"schema_version":"1.0","source":{"id":"2608.03315","kind":"arxiv","version":1}},"canonical_sha256":"cd3d887f0a19959e2d2ca599123e94bf20031b3918dd7acec4a2b4ca6c5423e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd3d887f0a19959e2d2ca599123e94bf20031b3918dd7acec4a2b4ca6c5423e3","first_computed_at":"2026-08-05T00:46:49.859684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-05T00:46:49.859684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NU6Nvm8FyazM2r8rHA/thhIC/t3cY8t8zzgvXEEUzDN5gEClsSpmJkhQ75+f3O3is0uJUVE4eUi0flnDm5CHDA==","signature_status":"signed_v1","signed_at":"2026-08-05T00:46:49.862020Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.03315","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:11d901607b11c5a673e00adb507ae6416aa8e419c217e8acdca0ffdd7b89b90e","sha256:47f34e84c22cb6190a2dd50ef09d3d73e9dfdbee3a3ed772c416b8ddd685fffb","sha256:9794a7504b8d53ab8958304fa76be8cc4586834ef1cc0400af26832ecea6dc3b","sha256:a39e32571df0e49bc2c689465461b1a7f3f693b798f7a4f1c7fcf396fce9b69a"]}],"invalid_events":[],"applied_event_ids":["sha256:9c8b1660de00f5e10a1ff057ae21271789dd3aa08f579def2d6d1af384e107d1","sha256:64e7838f14462861703ac0c662066c4287e5bfbf491fbbe21a513fb891549cec"],"state_sha256":"bc810ecbebcc3bb4c823ad10f8e2bec41b868ba7a97dca2f7dee3211f03da271"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"caFp1D2jGUTMkbSRbXAub9RfE2FI7sACxwUy6BvPCPKQBNmFK2o3VhYylUFlc15m3+GOcc0LU2uN92Ff2VH7Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T03:31:47.045125Z","bundle_sha256":"448e55d0441595b881d7b6f40c3869564d5f06846a080caec33bc63028f8d127"}}