{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UUMS6LXSXNAAPZRDOZ3UU2JECS","short_pith_number":"pith:UUMS6LXS","schema_version":"1.0","canonical_sha256":"a5192f2ef2bb4007e62376774a692414a8858edcb7b2bf57c2f6f35fbd0ff663","source":{"kind":"arxiv","id":"2506.01832","version":2},"attestation_state":"computed","paper":{"title":"Pseudorandom bits for non-commutative programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Chin Ho Lee, Emanuele Viola","submitted_at":"2025-06-02T16:21:30Z","abstract_excerpt":"We obtain new explicit pseudorandom generators for several computational models involving groups. Our main results are as follows:\n  1. We consider read-once group-products over a finite group $G$, i.e., tests of the form $\\prod_{i=1}^n g_i^{x_i}$ where $g_i\\in G$, a special case of read-once permutation branching programs. We give generators with optimal seed length $c_G \\log(n/\\varepsilon)$ over any $p$-group. The proof uses the small-bias plus noise paradigm, but derandomizes the noise to avoid the recursion in previous work. Our generator works when the bits are read in any order. Previous"},"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":"2506.01832","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-06-02T16:21:30Z","cross_cats_sorted":[],"title_canon_sha256":"420eb70de916d54259e1f10821db8edb744d6abb445ab04a4e0cdd9d5d1470a8","abstract_canon_sha256":"4fc537ba9a0ba43b60d9b61aa482078db21e704759e228f9896b0566d21418ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:47.620940Z","signature_b64":"zhRfrOT6osSKq+NhwVDwmQ3XnO7Op5EZr2U84TTsm2CRuaCjA9vXL8SUB++8zw20Y4OqkjR7heplHEO4UGseDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5192f2ef2bb4007e62376774a692414a8858edcb7b2bf57c2f6f35fbd0ff663","last_reissued_at":"2026-07-05T11:15:47.620435Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:47.620435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pseudorandom bits for non-commutative programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Chin Ho Lee, Emanuele Viola","submitted_at":"2025-06-02T16:21:30Z","abstract_excerpt":"We obtain new explicit pseudorandom generators for several computational models involving groups. Our main results are as follows:\n  1. We consider read-once group-products over a finite group $G$, i.e., tests of the form $\\prod_{i=1}^n g_i^{x_i}$ where $g_i\\in G$, a special case of read-once permutation branching programs. We give generators with optimal seed length $c_G \\log(n/\\varepsilon)$ over any $p$-group. The proof uses the small-bias plus noise paradigm, but derandomizes the noise to avoid the recursion in previous work. Our generator works when the bits are read in any order. Previous"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01832","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/2506.01832/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":"2506.01832","created_at":"2026-07-05T11:15:47.620507+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.01832v2","created_at":"2026-07-05T11:15:47.620507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01832","created_at":"2026-07-05T11:15:47.620507+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUMS6LXSXNAA","created_at":"2026-07-05T11:15:47.620507+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUMS6LXSXNAAPZRD","created_at":"2026-07-05T11:15:47.620507+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUMS6LXS","created_at":"2026-07-05T11:15:47.620507+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/UUMS6LXSXNAAPZRDOZ3UU2JECS","json":"https://pith.science/pith/UUMS6LXSXNAAPZRDOZ3UU2JECS.json","graph_json":"https://pith.science/api/pith-number/UUMS6LXSXNAAPZRDOZ3UU2JECS/graph.json","events_json":"https://pith.science/api/pith-number/UUMS6LXSXNAAPZRDOZ3UU2JECS/events.json","paper":"https://pith.science/paper/UUMS6LXS"},"agent_actions":{"view_html":"https://pith.science/pith/UUMS6LXSXNAAPZRDOZ3UU2JECS","download_json":"https://pith.science/pith/UUMS6LXSXNAAPZRDOZ3UU2JECS.json","view_paper":"https://pith.science/paper/UUMS6LXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.01832&json=true","fetch_graph":"https://pith.science/api/pith-number/UUMS6LXSXNAAPZRDOZ3UU2JECS/graph.json","fetch_events":"https://pith.science/api/pith-number/UUMS6LXSXNAAPZRDOZ3UU2JECS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUMS6LXSXNAAPZRDOZ3UU2JECS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUMS6LXSXNAAPZRDOZ3UU2JECS/action/storage_attestation","attest_author":"https://pith.science/pith/UUMS6LXSXNAAPZRDOZ3UU2JECS/action/author_attestation","sign_citation":"https://pith.science/pith/UUMS6LXSXNAAPZRDOZ3UU2JECS/action/citation_signature","submit_replication":"https://pith.science/pith/UUMS6LXSXNAAPZRDOZ3UU2JECS/action/replication_record"}},"created_at":"2026-07-05T11:15:47.620507+00:00","updated_at":"2026-07-05T11:15:47.620507+00:00"}