{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UJLWPJENCZ5BY4YBHBFYYC6AS2","short_pith_number":"pith:UJLWPJEN","schema_version":"1.0","canonical_sha256":"a25767a48d167a1c7301384b8c0bc09684e69f09a226177d3d6fdf8df82fe0ce","source":{"kind":"arxiv","id":"2606.30281","version":1},"attestation_state":"computed","paper":{"title":"Quantum Lazy Sampling and Path Recording for Any Group","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"quant-ph","authors_text":"Alex Lombardi, Barak Nehoran, Ben Foxman, Fermi Ma, John Wright","submitted_at":"2026-06-29T13:23:17Z","abstract_excerpt":"A central challenge in quantum algorithms and cryptography is reasoning about algorithms with oracle access to a random group element (e.g. a random function, permutation, or unitary). Can we efficiently simulate such algorithms? Can we determine what they know after t queries? A classical tool for this is lazy sampling: the oracle does not commit to the full group element upfront, but rather samples partial information about it on the fly. We study a quantum analog of lazy sampling: compressed oracles (or recording oracles). These are quantum data structures that allow on-the-fly simulation f"},"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":"2606.30281","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-29T13:23:17Z","cross_cats_sorted":["cs.CC","cs.CR"],"title_canon_sha256":"06b66b384e4b47b214f3480e8e00d4dcf0e560397bde6bb0506cda66bdb24c9b","abstract_canon_sha256":"279e5cea9e58faf9f9ec681166034d1f7adb9ea271ff7468117581fcb1b6e949"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:17:57.339705Z","signature_b64":"fyeLEoCi8dO0jjrUa5uY6ucEDXhMMqWuSq3H5fAQ5nPRJ/4pnx2LohGOuwwsgb7MFwyWSX29PvFXhPpnMCE+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a25767a48d167a1c7301384b8c0bc09684e69f09a226177d3d6fdf8df82fe0ce","last_reissued_at":"2026-06-30T02:17:57.339088Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:17:57.339088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Lazy Sampling and Path Recording for Any Group","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"quant-ph","authors_text":"Alex Lombardi, Barak Nehoran, Ben Foxman, Fermi Ma, John Wright","submitted_at":"2026-06-29T13:23:17Z","abstract_excerpt":"A central challenge in quantum algorithms and cryptography is reasoning about algorithms with oracle access to a random group element (e.g. a random function, permutation, or unitary). Can we efficiently simulate such algorithms? Can we determine what they know after t queries? A classical tool for this is lazy sampling: the oracle does not commit to the full group element upfront, but rather samples partial information about it on the fly. We study a quantum analog of lazy sampling: compressed oracles (or recording oracles). These are quantum data structures that allow on-the-fly simulation f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30281","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/2606.30281/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":"2606.30281","created_at":"2026-06-30T02:17:57.339187+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.30281v1","created_at":"2026-06-30T02:17:57.339187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30281","created_at":"2026-06-30T02:17:57.339187+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJLWPJENCZ5B","created_at":"2026-06-30T02:17:57.339187+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJLWPJENCZ5BY4YB","created_at":"2026-06-30T02:17:57.339187+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJLWPJEN","created_at":"2026-06-30T02:17:57.339187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UJLWPJENCZ5BY4YBHBFYYC6AS2","json":"https://pith.science/pith/UJLWPJENCZ5BY4YBHBFYYC6AS2.json","graph_json":"https://pith.science/api/pith-number/UJLWPJENCZ5BY4YBHBFYYC6AS2/graph.json","events_json":"https://pith.science/api/pith-number/UJLWPJENCZ5BY4YBHBFYYC6AS2/events.json","paper":"https://pith.science/paper/UJLWPJEN"},"agent_actions":{"view_html":"https://pith.science/pith/UJLWPJENCZ5BY4YBHBFYYC6AS2","download_json":"https://pith.science/pith/UJLWPJENCZ5BY4YBHBFYYC6AS2.json","view_paper":"https://pith.science/paper/UJLWPJEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.30281&json=true","fetch_graph":"https://pith.science/api/pith-number/UJLWPJENCZ5BY4YBHBFYYC6AS2/graph.json","fetch_events":"https://pith.science/api/pith-number/UJLWPJENCZ5BY4YBHBFYYC6AS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJLWPJENCZ5BY4YBHBFYYC6AS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJLWPJENCZ5BY4YBHBFYYC6AS2/action/storage_attestation","attest_author":"https://pith.science/pith/UJLWPJENCZ5BY4YBHBFYYC6AS2/action/author_attestation","sign_citation":"https://pith.science/pith/UJLWPJENCZ5BY4YBHBFYYC6AS2/action/citation_signature","submit_replication":"https://pith.science/pith/UJLWPJENCZ5BY4YBHBFYYC6AS2/action/replication_record"}},"created_at":"2026-06-30T02:17:57.339187+00:00","updated_at":"2026-06-30T02:17:57.339187+00:00"}