{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5MWQOXEZS6PNP4E56GEW2BAFYD","short_pith_number":"pith:5MWQOXEZ","canonical_record":{"source":{"id":"2607.28260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T14:18:29Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"913719aeb32cfacf307845c62636fa9788257749e52a462f5dad15fb86852ec7","abstract_canon_sha256":"e2f0b77be03042d4af04d0f4fc330124ff8c62d0652f545be52ab43f135ab6d4"},"schema_version":"1.0"},"canonical_sha256":"eb2d075c99979ed7f09df1896d0405c0e664ec7b950809f4a75e72e24ac0c448","source":{"kind":"arxiv","id":"2607.28260","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28260","created_at":"2026-07-31T01:36:56Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28260v1","created_at":"2026-07-31T01:36:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28260","created_at":"2026-07-31T01:36:56Z"},{"alias_kind":"pith_short_12","alias_value":"5MWQOXEZS6PN","created_at":"2026-07-31T01:36:56Z"},{"alias_kind":"pith_short_16","alias_value":"5MWQOXEZS6PNP4E5","created_at":"2026-07-31T01:36:56Z"},{"alias_kind":"pith_short_8","alias_value":"5MWQOXEZ","created_at":"2026-07-31T01:36:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5MWQOXEZS6PNP4E56GEW2BAFYD","target":"record","payload":{"canonical_record":{"source":{"id":"2607.28260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T14:18:29Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"913719aeb32cfacf307845c62636fa9788257749e52a462f5dad15fb86852ec7","abstract_canon_sha256":"e2f0b77be03042d4af04d0f4fc330124ff8c62d0652f545be52ab43f135ab6d4"},"schema_version":"1.0"},"canonical_sha256":"eb2d075c99979ed7f09df1896d0405c0e664ec7b950809f4a75e72e24ac0c448","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb2d075c99979ed7f09df1896d0405c0e664ec7b950809f4a75e72e24ac0c448","last_reissued_at":"2026-07-31T01:36:56.838085Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:36:56.838085Z"},"source_kind":"arxiv","source_id":"2607.28260","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-07-31T01:36:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTK8XIiCCIt3ddW8De0anD7Ba+u5ZTkyykkWOeDINvj3CI6JInEHuj/vS3/aU0snLvj3TyBLU7Mfll4r+EVzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:10:45.370715Z"},"content_sha256":"43953596ca7bff30e4caaabeeb9f605bfe8e21d578950e90cb11f183a9458668","schema_version":"1.0","event_id":"sha256:43953596ca7bff30e4caaabeeb9f605bfe8e21d578950e90cb11f183a9458668"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5MWQOXEZS6PNP4E56GEW2BAFYD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Fengning Ou, Pei Yuan, Penghui Yao, Shengyu Zhang, Tongyang Li, Xinzhao Wang","submitted_at":"2026-07-30T14:18:29Z","abstract_excerpt":"Many quantum algorithms require coherent access to classical data, often modeled by quantum read-only memory (QROM). We initiate the study of the $T$ count of sparse QROM, in which only $s$ of the $2^n$ addresses store nonzero data. We prove asymptotically optimal $T$-count bounds $\\Theta(\\sqrt{sm} + \\sqrt{sn})$ with square-root dependence on the support size $s$ and message length $m$. Our upper bounds use a multilevel hashing scheme, while our lower bounds reduce sparse QROM to state preparation and use counting arguments for adaptive Clifford+$T$ circuits. The lower bounds thus hold even wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28260","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/2607.28260/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-07-31T01:36:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cdDWas/q5vI0al09AOLFSGrJuKEs9aLB+cYkOBl6gD7Vml+DqMcuGja+mzyFoqmCedZpUuhm/XTrvuNK+s2tBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:10:45.371100Z"},"content_sha256":"10a651543fb6ed47329a8e614dbaa51e379edc33208941f90fdb1121062532bc","schema_version":"1.0","event_id":"sha256:10a651543fb6ed47329a8e614dbaa51e379edc33208941f90fdb1121062532bc"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:5MWQOXEZS6PNP4E56GEW2BAFYD","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1103/PhysRevA.102.032608 resolves to 'Parallelizing the queries in a bucket-brigade quantum random access memory'. A reader following the printed text alone cannot reach it.","snippet":"Alexandru Paler, Oumarou Oumarou, and Robert Basmadjian. Parallelising the queries in bucket brigade quantum RAM.Phys. Rev. A, 102:032608, 2020. doi: 10.1103/PhysRevA.102. 032608. URLhttps://link.aps.org/doi/10.1103/PhysRevA.102.032608. 44","arxiv_id":"2607.28260","detector":"doi_compliance","evidence":{"ref_index":50,"verdict_class":"incontrovertible","resolved_title":"Parallelizing the queries in a bucket-brigade quantum random access memory","printed_excerpt":"10.1103/physreva.102","reconstructed_doi":"10.1103/PhysRevA.102.032608"},"severity":"advisory","ref_index":50,"audited_at":"2026-07-31T13:01:56.295422Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/PhysRevA.102.032608","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"29fd165bfd5cb1a68db77002582130592c67e33eecdeaa3664a9befe5620b871","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Parallelizing the queries in a bucket-brigade quantum random access memory","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14387,"payload_sha256":"884b1e4f76ab97d96312efc2358ee071c7503f1b2190725085cda652325e8690","signature_b64":"HUE92XcFs4YxE1UYlMZMTqDvsWVQ4BUu42Ukwu2uSvqZ8gtDyI7aqqkrKOrKxKgls7kT0OKQKrShcdQb+hMDAg==","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-07-31T13:06:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xuFQySkJpDkeP2sBzNHLY6XVfBsALUnYPFUm53ZA3cuAsJlo8P/4iHQNnLrpcA5JmmIA/cxHHSdS8lmpT+93AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:10:45.372764Z"},"content_sha256":"ff8485d771834e7b1fd5dc9eec1d4e36742c71367a12be8afa94495cb83fc2b3","schema_version":"1.0","event_id":"sha256:ff8485d771834e7b1fd5dc9eec1d4e36742c71367a12be8afa94495cb83fc2b3"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:5MWQOXEZS6PNP4E56GEW2BAFYD","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1103/PhysRevLett.103.150502 resolves to 'Quantum Algorithm for Linear Systems of Equations'. A reader following the printed text alone cannot reach it.","snippet":"Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd. Quantum algorithm for solving linear systems of equations.Phys. Rev. Lett., 103(15):150502, 2009. doi: 10.1103/PhysRevLett.103. 150502. URLhttps://doi.org/10.1103/PhysRevLett.103.150502","arxiv_id":"2607.28260","detector":"doi_compliance","evidence":{"ref_index":32,"verdict_class":"incontrovertible","resolved_title":"Quantum Algorithm for Linear Systems of Equations","printed_excerpt":"10.1103/physrevlett.103","reconstructed_doi":"10.1103/PhysRevLett.103.150502"},"severity":"advisory","ref_index":32,"audited_at":"2026-07-31T13:01:56.295422Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/PhysRevLett.103.150502","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"3d1ae795bab87a80ea1a51316cb8a1db756242653c3306cc371d1fa601fb594f","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Quantum Algorithm for Linear Systems of Equations","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14386,"payload_sha256":"ce9f2526c344120f2eee3af52e65a62160d5d65eb03ce2ff5e2a1c54845b8c3a","signature_b64":"YzvtZSGJ8HN2iCVei0IWZ3u68lIS64Xu11wNjKuZC0UpWyAc5q3FwIkpVYie9eOmVuxE5yJVwHy0bbFYgm0bAw==","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-07-31T13:06:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cxvPIbCB1vnWo5tT3IcDy1zA43+Xbd24emC7WHq48Tj+9oStF9FbOym/AXTQ6MLpw2pYbJyGHOHSwlbZVFftBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:10:45.373056Z"},"content_sha256":"178683bef3ec82a89cefccf579525f05150ae6eacb2728e425cfcd0db5e71e88","schema_version":"1.0","event_id":"sha256:178683bef3ec82a89cefccf579525f05150ae6eacb2728e425cfcd0db5e71e88"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:5MWQOXEZS6PNP4E56GEW2BAFYD","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1103/PRXQuantum.2.020311 resolves to 'Resilience of Quantum Random Access Memory to Generic Noise'. A reader following the printed text alone cannot reach it.","snippet":"Connor T. Hann, Gideon Lee, S.M. Girvin, and Liang Jiang. Resilience of quantum random ac- cess memory to generic noise.PRX Quantum, 2:020311, Apr 2021. doi: 10.1103/PRXQuantum. 2.020311. URLhttps://link.aps.org/doi/10.1103/PRXQuantum.2.020","arxiv_id":"2607.28260","detector":"doi_compliance","evidence":{"ref_index":29,"verdict_class":"incontrovertible","resolved_title":"Resilience of Quantum Random Access Memory to Generic Noise","printed_excerpt":"10.1103/prxquantum","reconstructed_doi":"10.1103/PRXQuantum.2.020311"},"severity":"advisory","ref_index":29,"audited_at":"2026-07-31T13:01:56.295422Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/PRXQuantum.2.020311","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"5f99f69fcefd663472ce07a913fb33123f9eac6e918462a9fa0c00da1aed6c5c","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Resilience of Quantum Random Access Memory to Generic Noise","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14385,"payload_sha256":"2e23822659b21c9e2b03ea8f129976a6fb247b6f7f44628afe93dcd125935bb8","signature_b64":"c6a2P70g4KdYvRDp2cNnmmvKa1OxvnDeH1hpzHcPa+5Kj5PMyhgHx51NjvgI9pAuRTkG2uTuuCf6/vXj00PXCg==","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-07-31T13:06:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7YDEj6kiitd7xOLfUj8ME7TtDIBfl0U61q0fOowxb4jxumqCw52N632FiEVJrrnwUho/Ggt6mTLJoTTwFDKbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:10:45.373333Z"},"content_sha256":"6aeae48aa7e9b19697a4e42fec80223d63b9ec8d77c58f964ae9224774a689b6","schema_version":"1.0","event_id":"sha256:6aeae48aa7e9b19697a4e42fec80223d63b9ec8d77c58f964ae9224774a689b6"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:5MWQOXEZS6PNP4E56GEW2BAFYD","target":"integrity","payload":{"note":"Identifier '10.1103/physreva.52' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter. Elementary gates for quantum computation.Phys. Rev. A, 52:3457–3467, Nov 1995. doi: ","arxiv_id":"2607.28260","detector":"doi_compliance","evidence":{"doi":"10.1103/physreva.52","arxiv_id":null,"ref_index":3,"raw_excerpt":"Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter. Elementary gates for quantum computation.Phys. Rev. A, 52:3457–3467, Nov 1995. doi: 10.1103/PhysRevA.52","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":3,"audited_at":"2026-07-31T13:01:56.295422Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/physreva.52","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"4e6212cca61b822a1fa6df0989e731cb7cbb25d8cc062078661408a5c8883f24","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14384,"payload_sha256":"f00016497432f130582ae05185c2a9fc529762669363057fc1177843f834c895","signature_b64":"cA+kmTJ9ugfPSdby0fY2oGfAirDOahw2bO7Vg1uzUXp/xK8AV2spdhWNbESmBcmZGp1q17LhKoWojwe5JbQ7Dg==","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-07-31T13:06:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RFjj/gPRD+r2eeUW/f60vKbYiFMN6fAiGmMDDpSSGqh5YRMDAWjluXXy87GsnPaqWb7gw9NpaAGsfJuSXr5OBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:10:45.373663Z"},"content_sha256":"3d38181b2e74e5f0149cfbb38fcf0ac51627c1976e8f22faf9e666e91a5cacc4","schema_version":"1.0","event_id":"sha256:3d38181b2e74e5f0149cfbb38fcf0ac51627c1976e8f22faf9e666e91a5cacc4"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:5MWQOXEZS6PNP4E56GEW2BAFYD","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1088/1367-2630/18/3/033032) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Ryan Babbush, Dominic W. Berry, Ian D. Kivlichan, Annie Y. Wei, Peter J. Love, and Al´ an Aspuru-Guzik. Exponentially more precise quantum simulation of fermions I: quantum chem- istry in second quantization.New J. Phys., 18:033032, 2016. d","arxiv_id":"2607.28260","detector":"doi_compliance","evidence":{"ref_index":1,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1088/1367-2630/18/3/","reconstructed_doi":"10.1088/1367-2630/18/3/033032"},"severity":"advisory","ref_index":1,"audited_at":"2026-07-31T13:01:56.295422Z","event_type":"pith.integrity.v1","detected_doi":"10.1088/1367-2630/18/3/033032","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"12cd7c7f6ba70291b748bad31c5a8576d8b9734f395ef3790d40739df6d68f91","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14383,"payload_sha256":"d7680d5a2af5e9144a6cd00cdff2acd83f2d868b728c9940eda321311db65199","signature_b64":"1g3V0/CDIArdgwRtr0D6u0/bkyd46aPTXNrSfp0FafHTOtNgviujF2B1oB0YR9QlFBZvpRc8qqjLoH3VJPocAA==","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-07-31T13:06:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0gsG48ORlC80JcFvf9PgHgzjzdNS6N8vsuQlHtrphjC3HQ1+zoZ0k9nsVr3EFgY9PFExjEuWeWiFf7lIW/w2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T19:10:45.373944Z"},"content_sha256":"cf2765059d8feb5d93bd5128cb5c1af48f6295e5fdba57334605b8940449d0b5","schema_version":"1.0","event_id":"sha256:cf2765059d8feb5d93bd5128cb5c1af48f6295e5fdba57334605b8940449d0b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5MWQOXEZS6PNP4E56GEW2BAFYD/bundle.json","state_url":"https://pith.science/pith/5MWQOXEZS6PNP4E56GEW2BAFYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5MWQOXEZS6PNP4E56GEW2BAFYD/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-04T19:10:45Z","links":{"resolver":"https://pith.science/pith/5MWQOXEZS6PNP4E56GEW2BAFYD","bundle":"https://pith.science/pith/5MWQOXEZS6PNP4E56GEW2BAFYD/bundle.json","state":"https://pith.science/pith/5MWQOXEZS6PNP4E56GEW2BAFYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5MWQOXEZS6PNP4E56GEW2BAFYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5MWQOXEZS6PNP4E56GEW2BAFYD","merge_version":"pith-open-graph-merge-v1","event_count":7,"valid_event_count":7,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e2f0b77be03042d4af04d0f4fc330124ff8c62d0652f545be52ab43f135ab6d4","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T14:18:29Z","title_canon_sha256":"913719aeb32cfacf307845c62636fa9788257749e52a462f5dad15fb86852ec7"},"schema_version":"1.0","source":{"id":"2607.28260","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28260","created_at":"2026-07-31T01:36:56Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28260v1","created_at":"2026-07-31T01:36:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28260","created_at":"2026-07-31T01:36:56Z"},{"alias_kind":"pith_short_12","alias_value":"5MWQOXEZS6PN","created_at":"2026-07-31T01:36:56Z"},{"alias_kind":"pith_short_16","alias_value":"5MWQOXEZS6PNP4E5","created_at":"2026-07-31T01:36:56Z"},{"alias_kind":"pith_short_8","alias_value":"5MWQOXEZ","created_at":"2026-07-31T01:36:56Z"}],"graph_snapshots":[{"event_id":"sha256:10a651543fb6ed47329a8e614dbaa51e379edc33208941f90fdb1121062532bc","target":"graph","created_at":"2026-07-31T01:36:56Z","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/2607.28260/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many quantum algorithms require coherent access to classical data, often modeled by quantum read-only memory (QROM). We initiate the study of the $T$ count of sparse QROM, in which only $s$ of the $2^n$ addresses store nonzero data. We prove asymptotically optimal $T$-count bounds $\\Theta(\\sqrt{sm} + \\sqrt{sn})$ with square-root dependence on the support size $s$ and message length $m$. Our upper bounds use a multilevel hashing scheme, while our lower bounds reduce sparse QROM to state preparation and use counting arguments for adaptive Clifford+$T$ circuits. The lower bounds thus hold even wh","authors_text":"Fengning Ou, Pei Yuan, Penghui Yao, Shengyu Zhang, Tongyang Li, Xinzhao Wang","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28260","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:43953596ca7bff30e4caaabeeb9f605bfe8e21d578950e90cb11f183a9458668","target":"record","created_at":"2026-07-31T01:36:56Z","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":"e2f0b77be03042d4af04d0f4fc330124ff8c62d0652f545be52ab43f135ab6d4","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-30T14:18:29Z","title_canon_sha256":"913719aeb32cfacf307845c62636fa9788257749e52a462f5dad15fb86852ec7"},"schema_version":"1.0","source":{"id":"2607.28260","kind":"arxiv","version":1}},"canonical_sha256":"eb2d075c99979ed7f09df1896d0405c0e664ec7b950809f4a75e72e24ac0c448","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb2d075c99979ed7f09df1896d0405c0e664ec7b950809f4a75e72e24ac0c448","first_computed_at":"2026-07-31T01:36:56.838085Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:36:56.838085Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28260","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:178683bef3ec82a89cefccf579525f05150ae6eacb2728e425cfcd0db5e71e88","sha256:3d38181b2e74e5f0149cfbb38fcf0ac51627c1976e8f22faf9e666e91a5cacc4","sha256:6aeae48aa7e9b19697a4e42fec80223d63b9ec8d77c58f964ae9224774a689b6","sha256:cf2765059d8feb5d93bd5128cb5c1af48f6295e5fdba57334605b8940449d0b5","sha256:ff8485d771834e7b1fd5dc9eec1d4e36742c71367a12be8afa94495cb83fc2b3"]}],"invalid_events":[],"applied_event_ids":["sha256:43953596ca7bff30e4caaabeeb9f605bfe8e21d578950e90cb11f183a9458668","sha256:10a651543fb6ed47329a8e614dbaa51e379edc33208941f90fdb1121062532bc"],"state_sha256":"84b140f9de3f8da142ccf7d6e17d768b3bf2a0d559528161da0f12165585db77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4tlW/QUDIXXg+u3u2m1wl1yjx1AVXOaXe/SotuUvsLTQHsaqZXcN/6lb+1cbmjLhXOsHsbHTF7N2SDtFjjNBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T19:10:45.376441Z","bundle_sha256":"8c37c07836009aaf5cfae47b26f3761af075eccaf652991c193346b0ca42d488"}}