{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4BYKIMRHMUY3OBWY4CHZNQ7X2D","short_pith_number":"pith:4BYKIMRH","schema_version":"1.0","canonical_sha256":"e070a432276531b706d8e08f96c3f7d0ce839996641a1d2c09d686d1acf1d38d","source":{"kind":"arxiv","id":"2504.14957","version":2},"attestation_state":"computed","paper":{"title":"Parallel Kac's Walk Generates PRU","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"quant-ph","authors_text":"Chuhan Lu, Fang Song, Minglong Qin, Mingnan Zhao, Penghui Yao","submitted_at":"2025-04-21T08:32:14Z","abstract_excerpt":"Ma and Huang recently proved that the PFC construction, introduced by Metger, Poremba, Sinha and Yuen [MPSY24], gives an adaptive-secure pseudorandom unitary family PRU. Their proof developed a new path recording technique [MH24].\n  In this work, we show that a linear number of sequential repetitions of the parallel Kac's Walk, introduced by Lu, Qin, Song, Yao and Zhao [LQSY+24], also forms an adaptive-secure PRU, confirming a conjecture therein. Moreover, it additionally satisfies strong security against adversaries making inverse queries. This gives an alternative PRU construction, and provi"},"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":"2504.14957","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-21T08:32:14Z","cross_cats_sorted":["cs.CC","cs.CR"],"title_canon_sha256":"7d78282d333d3c79c452e9d8b2805ff55bbed19a49d6961ba76349519a496be7","abstract_canon_sha256":"3f778bc5cc3651b197b4ae5411fe1ca9e18b56ab6264784b416df73eff6ee85c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:46.592875Z","signature_b64":"whXP+szexmuRdkvUu4rC4lztbeQc+wYVdVmAv9KJMrrpnwAglyojHOpqL/5u/aZib84f6Q/7TzXfU/cp78JzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e070a432276531b706d8e08f96c3f7d0ce839996641a1d2c09d686d1acf1d38d","last_reissued_at":"2026-07-05T11:09:46.592407Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:46.592407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Kac's Walk Generates PRU","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"quant-ph","authors_text":"Chuhan Lu, Fang Song, Minglong Qin, Mingnan Zhao, Penghui Yao","submitted_at":"2025-04-21T08:32:14Z","abstract_excerpt":"Ma and Huang recently proved that the PFC construction, introduced by Metger, Poremba, Sinha and Yuen [MPSY24], gives an adaptive-secure pseudorandom unitary family PRU. Their proof developed a new path recording technique [MH24].\n  In this work, we show that a linear number of sequential repetitions of the parallel Kac's Walk, introduced by Lu, Qin, Song, Yao and Zhao [LQSY+24], also forms an adaptive-secure PRU, confirming a conjecture therein. Moreover, it additionally satisfies strong security against adversaries making inverse queries. This gives an alternative PRU construction, and provi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.14957","kind":"arxiv","version":2},"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/2504.14957/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":"2504.14957","created_at":"2026-07-05T11:09:46.592471+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.14957v2","created_at":"2026-07-05T11:09:46.592471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.14957","created_at":"2026-07-05T11:09:46.592471+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BYKIMRHMUY3","created_at":"2026-07-05T11:09:46.592471+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BYKIMRHMUY3OBWY","created_at":"2026-07-05T11:09:46.592471+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BYKIMRH","created_at":"2026-07-05T11:09:46.592471+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.14277","citing_title":"Entanglement and circuit complexity in finite-depth random linear optical networks","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4BYKIMRHMUY3OBWY4CHZNQ7X2D","json":"https://pith.science/pith/4BYKIMRHMUY3OBWY4CHZNQ7X2D.json","graph_json":"https://pith.science/api/pith-number/4BYKIMRHMUY3OBWY4CHZNQ7X2D/graph.json","events_json":"https://pith.science/api/pith-number/4BYKIMRHMUY3OBWY4CHZNQ7X2D/events.json","paper":"https://pith.science/paper/4BYKIMRH"},"agent_actions":{"view_html":"https://pith.science/pith/4BYKIMRHMUY3OBWY4CHZNQ7X2D","download_json":"https://pith.science/pith/4BYKIMRHMUY3OBWY4CHZNQ7X2D.json","view_paper":"https://pith.science/paper/4BYKIMRH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.14957&json=true","fetch_graph":"https://pith.science/api/pith-number/4BYKIMRHMUY3OBWY4CHZNQ7X2D/graph.json","fetch_events":"https://pith.science/api/pith-number/4BYKIMRHMUY3OBWY4CHZNQ7X2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BYKIMRHMUY3OBWY4CHZNQ7X2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BYKIMRHMUY3OBWY4CHZNQ7X2D/action/storage_attestation","attest_author":"https://pith.science/pith/4BYKIMRHMUY3OBWY4CHZNQ7X2D/action/author_attestation","sign_citation":"https://pith.science/pith/4BYKIMRHMUY3OBWY4CHZNQ7X2D/action/citation_signature","submit_replication":"https://pith.science/pith/4BYKIMRHMUY3OBWY4CHZNQ7X2D/action/replication_record"}},"created_at":"2026-07-05T11:09:46.592471+00:00","updated_at":"2026-07-05T11:09:46.592471+00:00"}