{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:J4Z2KR27QFHPW6TSI7QKBCEQCK","short_pith_number":"pith:J4Z2KR27","schema_version":"1.0","canonical_sha256":"4f33a5475f814efb7a7247e0a0889012836070e502dabdc6f61c5bac65f0bde3","source":{"kind":"arxiv","id":"2410.10116","version":3},"attestation_state":"computed","paper":{"title":"How to Construct Random Unitaries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CL","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Fermi Ma, Hsin-Yuan Huang","submitted_at":"2024-10-14T03:07:36Z","abstract_excerpt":"The existence of pseudorandom unitaries (PRUs) -- efficient quantum circuits that are computationally indistinguishable from Haar-random unitaries -- has been a central open question, with significant implications for cryptography, complexity theory, and fundamental physics. In this work, we close this question by proving that PRUs exist, assuming that any quantum-secure one-way function exists. We establish this result for both (1) the standard notion of PRUs, which are secure against any efficient adversary that makes queries to the unitary $U$, and (2) a stronger notion of PRUs, which are s"},"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":"2410.10116","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-14T03:07:36Z","cross_cats_sorted":["cs.CC","cs.CL","math-ph","math.MP"],"title_canon_sha256":"8c26e9d203ab9f365d940f667ce1e38f81115a82ac1e7106258cea8a40370290","abstract_canon_sha256":"2a3c722def34a1c07b4b7361ca6abbbb7c6cf4a1760cae6ec364ccc427f7f8fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:24.059895Z","signature_b64":"8HexXoqOYRcYkbDSqCb0Oblob8OA17Iggy7414YnOpU29rNeqTcyQJKnf/UV0SCLI5OXsvjvGO1uWlJBtKK7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f33a5475f814efb7a7247e0a0889012836070e502dabdc6f61c5bac65f0bde3","last_reissued_at":"2026-07-05T11:06:24.059410Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:24.059410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Construct Random Unitaries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CL","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Fermi Ma, Hsin-Yuan Huang","submitted_at":"2024-10-14T03:07:36Z","abstract_excerpt":"The existence of pseudorandom unitaries (PRUs) -- efficient quantum circuits that are computationally indistinguishable from Haar-random unitaries -- has been a central open question, with significant implications for cryptography, complexity theory, and fundamental physics. In this work, we close this question by proving that PRUs exist, assuming that any quantum-secure one-way function exists. We establish this result for both (1) the standard notion of PRUs, which are secure against any efficient adversary that makes queries to the unitary $U$, and (2) a stronger notion of PRUs, which are s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10116","kind":"arxiv","version":3},"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/2410.10116/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":"2410.10116","created_at":"2026-07-05T11:06:24.059461+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.10116v3","created_at":"2026-07-05T11:06:24.059461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10116","created_at":"2026-07-05T11:06:24.059461+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4Z2KR27QFHP","created_at":"2026-07-05T11:06:24.059461+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4Z2KR27QFHPW6TS","created_at":"2026-07-05T11:06:24.059461+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4Z2KR27","created_at":"2026-07-05T11:06:24.059461+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.25178","citing_title":"Pseudorandom Dynamics in the SYK Model and Cryptographic Censorship in JT Gravity","ref_index":68,"is_internal_anchor":false},{"citing_arxiv_id":"2505.10110","citing_title":"Non-Clifford Cost of Random Unitaries","ref_index":62,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J4Z2KR27QFHPW6TSI7QKBCEQCK","json":"https://pith.science/pith/J4Z2KR27QFHPW6TSI7QKBCEQCK.json","graph_json":"https://pith.science/api/pith-number/J4Z2KR27QFHPW6TSI7QKBCEQCK/graph.json","events_json":"https://pith.science/api/pith-number/J4Z2KR27QFHPW6TSI7QKBCEQCK/events.json","paper":"https://pith.science/paper/J4Z2KR27"},"agent_actions":{"view_html":"https://pith.science/pith/J4Z2KR27QFHPW6TSI7QKBCEQCK","download_json":"https://pith.science/pith/J4Z2KR27QFHPW6TSI7QKBCEQCK.json","view_paper":"https://pith.science/paper/J4Z2KR27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.10116&json=true","fetch_graph":"https://pith.science/api/pith-number/J4Z2KR27QFHPW6TSI7QKBCEQCK/graph.json","fetch_events":"https://pith.science/api/pith-number/J4Z2KR27QFHPW6TSI7QKBCEQCK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4Z2KR27QFHPW6TSI7QKBCEQCK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4Z2KR27QFHPW6TSI7QKBCEQCK/action/storage_attestation","attest_author":"https://pith.science/pith/J4Z2KR27QFHPW6TSI7QKBCEQCK/action/author_attestation","sign_citation":"https://pith.science/pith/J4Z2KR27QFHPW6TSI7QKBCEQCK/action/citation_signature","submit_replication":"https://pith.science/pith/J4Z2KR27QFHPW6TSI7QKBCEQCK/action/replication_record"}},"created_at":"2026-07-05T11:06:24.059461+00:00","updated_at":"2026-07-05T11:06:24.059461+00:00"}