{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3IMIRKHP3DEK7DFN4BBDNXMVR5","short_pith_number":"pith:3IMIRKHP","schema_version":"1.0","canonical_sha256":"da1888a8efd8c8af8cade04236dd958f7d371444cb7580f8e4ead7d8834ec236","source":{"kind":"arxiv","id":"2502.07159","version":1},"attestation_state":"computed","paper":{"title":"Pseudorandomness Properties of Random Reversible Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.CR","authors_text":"Nicholas Kocurek, Ryan O'Donnell, William Gay, William He","submitted_at":"2025-02-11T00:54:24Z","abstract_excerpt":"Motivated by practical concerns in cryptography, we study pseudorandomness properties of permutations on $\\{0,1\\}^n$ computed by random circuits made from reversible $3$-bit gates (permutations on $\\{0,1\\}^3$). Our main result is that a random circuit of depth $\\sqrt{n} \\cdot \\tilde{O}(k^3)$, with each layer consisting of $\\Theta(n)$ random gates in a fixed two-dimensional nearest-neighbor architecture, yields approximate $k$-wise independent permutations.\n  Our result can be seen as a particularly simple/practical block cipher construction that gives provable statistical security against atta"},"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":"2502.07159","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2025-02-11T00:54:24Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e035b72824da7b0e592fb91c83ed76d5f8290a327d59dc49b954445b1fd47e71","abstract_canon_sha256":"368d4fc2020c328926ce3a636ec0e9f134f70bb5ec58a528d7570a66915bfe95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:12:52.252238Z","signature_b64":"RueqWoHyEKTvAz/t/unIGWn3TKw66vNvROdbt4WogbcJPZVjMJiwSA1OdAgBJzuCm54v+WURqfgXULYSCvAsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da1888a8efd8c8af8cade04236dd958f7d371444cb7580f8e4ead7d8834ec236","last_reissued_at":"2026-07-05T10:12:52.251762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:12:52.251762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pseudorandomness Properties of Random Reversible Circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.CR","authors_text":"Nicholas Kocurek, Ryan O'Donnell, William Gay, William He","submitted_at":"2025-02-11T00:54:24Z","abstract_excerpt":"Motivated by practical concerns in cryptography, we study pseudorandomness properties of permutations on $\\{0,1\\}^n$ computed by random circuits made from reversible $3$-bit gates (permutations on $\\{0,1\\}^3$). Our main result is that a random circuit of depth $\\sqrt{n} \\cdot \\tilde{O}(k^3)$, with each layer consisting of $\\Theta(n)$ random gates in a fixed two-dimensional nearest-neighbor architecture, yields approximate $k$-wise independent permutations.\n  Our result can be seen as a particularly simple/practical block cipher construction that gives provable statistical security against atta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.07159","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/2502.07159/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":"2502.07159","created_at":"2026-07-05T10:12:52.251820+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.07159v1","created_at":"2026-07-05T10:12:52.251820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.07159","created_at":"2026-07-05T10:12:52.251820+00:00"},{"alias_kind":"pith_short_12","alias_value":"3IMIRKHP3DEK","created_at":"2026-07-05T10:12:52.251820+00:00"},{"alias_kind":"pith_short_16","alias_value":"3IMIRKHP3DEK7DFN","created_at":"2026-07-05T10:12:52.251820+00:00"},{"alias_kind":"pith_short_8","alias_value":"3IMIRKHP","created_at":"2026-07-05T10:12:52.251820+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/3IMIRKHP3DEK7DFN4BBDNXMVR5","json":"https://pith.science/pith/3IMIRKHP3DEK7DFN4BBDNXMVR5.json","graph_json":"https://pith.science/api/pith-number/3IMIRKHP3DEK7DFN4BBDNXMVR5/graph.json","events_json":"https://pith.science/api/pith-number/3IMIRKHP3DEK7DFN4BBDNXMVR5/events.json","paper":"https://pith.science/paper/3IMIRKHP"},"agent_actions":{"view_html":"https://pith.science/pith/3IMIRKHP3DEK7DFN4BBDNXMVR5","download_json":"https://pith.science/pith/3IMIRKHP3DEK7DFN4BBDNXMVR5.json","view_paper":"https://pith.science/paper/3IMIRKHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.07159&json=true","fetch_graph":"https://pith.science/api/pith-number/3IMIRKHP3DEK7DFN4BBDNXMVR5/graph.json","fetch_events":"https://pith.science/api/pith-number/3IMIRKHP3DEK7DFN4BBDNXMVR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3IMIRKHP3DEK7DFN4BBDNXMVR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3IMIRKHP3DEK7DFN4BBDNXMVR5/action/storage_attestation","attest_author":"https://pith.science/pith/3IMIRKHP3DEK7DFN4BBDNXMVR5/action/author_attestation","sign_citation":"https://pith.science/pith/3IMIRKHP3DEK7DFN4BBDNXMVR5/action/citation_signature","submit_replication":"https://pith.science/pith/3IMIRKHP3DEK7DFN4BBDNXMVR5/action/replication_record"}},"created_at":"2026-07-05T10:12:52.251820+00:00","updated_at":"2026-07-05T10:12:52.251820+00:00"}