{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:N3TSL76KTJLAPWMCKPJLYNCMMF","short_pith_number":"pith:N3TSL76K","schema_version":"1.0","canonical_sha256":"6ee725ffca9a5607d98253d2bc344c61557749f5f2244eb56cd8f11b65c70e53","source":{"kind":"arxiv","id":"2404.12647","version":1},"attestation_state":"computed","paper":{"title":"Simple constructions of linear-depth t-designs and pseudorandom unitaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Alexander Poremba, Henry Yuen, Makrand Sinha, Tony Metger","submitted_at":"2024-04-19T06:13:02Z","abstract_excerpt":"Uniformly random unitaries, i.e. unitaries drawn from the Haar measure, have many useful properties, but cannot be implemented efficiently. This has motivated a long line of research into random unitaries that \"look\" sufficiently Haar random while also being efficient to implement. Two different notions of derandomisation have emerged: $t$-designs are random unitaries that information-theoretically reproduce the first $t$ moments of the Haar measure, and pseudorandom unitaries (PRUs) are random unitaries that are computationally indistinguishable from Haar random.\n  In this work, we take a uni"},"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":"2404.12647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-04-19T06:13:02Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"e9de61b4b7bed917ee90401e7b6f17d5afae4204951b68a6d0160342a11df643","abstract_canon_sha256":"c73da3bb68f56d1017ccf127179b540689bb9a7e90b12978a50e9eb3f48c9366"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:09:56.784037Z","signature_b64":"mQ4gHm+KwVb7iOi4oaRoVO4Q7jzXZ5jDW01/BTfj2/IbnDfDUVV+OsmBz49jOkF6z4+TjSR45V+cSnVdmaJkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ee725ffca9a5607d98253d2bc344c61557749f5f2244eb56cd8f11b65c70e53","last_reissued_at":"2026-07-05T08:09:56.783567Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:09:56.783567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple constructions of linear-depth t-designs and pseudorandom unitaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Alexander Poremba, Henry Yuen, Makrand Sinha, Tony Metger","submitted_at":"2024-04-19T06:13:02Z","abstract_excerpt":"Uniformly random unitaries, i.e. unitaries drawn from the Haar measure, have many useful properties, but cannot be implemented efficiently. This has motivated a long line of research into random unitaries that \"look\" sufficiently Haar random while also being efficient to implement. Two different notions of derandomisation have emerged: $t$-designs are random unitaries that information-theoretically reproduce the first $t$ moments of the Haar measure, and pseudorandom unitaries (PRUs) are random unitaries that are computationally indistinguishable from Haar random.\n  In this work, we take a uni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.12647","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/2404.12647/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":"2404.12647","created_at":"2026-07-05T08:09:56.783625+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.12647v1","created_at":"2026-07-05T08:09:56.783625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.12647","created_at":"2026-07-05T08:09:56.783625+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3TSL76KTJLA","created_at":"2026-07-05T08:09:56.783625+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3TSL76KTJLAPWMC","created_at":"2026-07-05T08:09:56.783625+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3TSL76K","created_at":"2026-07-05T08:09:56.783625+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":69,"is_internal_anchor":false},{"citing_arxiv_id":"2410.16220","citing_title":"Sample Optimal and Memory Efficient Quantum State Tomography","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N3TSL76KTJLAPWMCKPJLYNCMMF","json":"https://pith.science/pith/N3TSL76KTJLAPWMCKPJLYNCMMF.json","graph_json":"https://pith.science/api/pith-number/N3TSL76KTJLAPWMCKPJLYNCMMF/graph.json","events_json":"https://pith.science/api/pith-number/N3TSL76KTJLAPWMCKPJLYNCMMF/events.json","paper":"https://pith.science/paper/N3TSL76K"},"agent_actions":{"view_html":"https://pith.science/pith/N3TSL76KTJLAPWMCKPJLYNCMMF","download_json":"https://pith.science/pith/N3TSL76KTJLAPWMCKPJLYNCMMF.json","view_paper":"https://pith.science/paper/N3TSL76K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.12647&json=true","fetch_graph":"https://pith.science/api/pith-number/N3TSL76KTJLAPWMCKPJLYNCMMF/graph.json","fetch_events":"https://pith.science/api/pith-number/N3TSL76KTJLAPWMCKPJLYNCMMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3TSL76KTJLAPWMCKPJLYNCMMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3TSL76KTJLAPWMCKPJLYNCMMF/action/storage_attestation","attest_author":"https://pith.science/pith/N3TSL76KTJLAPWMCKPJLYNCMMF/action/author_attestation","sign_citation":"https://pith.science/pith/N3TSL76KTJLAPWMCKPJLYNCMMF/action/citation_signature","submit_replication":"https://pith.science/pith/N3TSL76KTJLAPWMCKPJLYNCMMF/action/replication_record"}},"created_at":"2026-07-05T08:09:56.783625+00:00","updated_at":"2026-07-05T08:09:56.783625+00:00"}