{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UUMS6LXSXNAAPZRDOZ3UU2JECS","short_pith_number":"pith:UUMS6LXS","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"},"canonical_sha256":"a5192f2ef2bb4007e62376774a692414a8858edcb7b2bf57c2f6f35fbd0ff663","source":{"kind":"arxiv","id":"2506.01832","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01832","created_at":"2026-07-05T11:15:47Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01832v2","created_at":"2026-07-05T11:15:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01832","created_at":"2026-07-05T11:15:47Z"},{"alias_kind":"pith_short_12","alias_value":"UUMS6LXSXNAA","created_at":"2026-07-05T11:15:47Z"},{"alias_kind":"pith_short_16","alias_value":"UUMS6LXSXNAAPZRD","created_at":"2026-07-05T11:15:47Z"},{"alias_kind":"pith_short_8","alias_value":"UUMS6LXS","created_at":"2026-07-05T11:15:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UUMS6LXSXNAAPZRDOZ3UU2JECS","target":"record","payload":{"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"},"canonical_sha256":"a5192f2ef2bb4007e62376774a692414a8858edcb7b2bf57c2f6f35fbd0ff663","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"},"source_kind":"arxiv","source_id":"2506.01832","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:15:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dF9nFGQSztNF70sXhbJX9FKHopQdl33V3wK7QdZKo3BwjbgE0u0BNIIWJ10ewVdhGYNoXluz8CK80mtniZcCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T21:00:17.872282Z"},"content_sha256":"85869f6427e833810da7001d66eb7d7e13756fd77ffd1948a95f97aa7722e07d","schema_version":"1.0","event_id":"sha256:85869f6427e833810da7001d66eb7d7e13756fd77ffd1948a95f97aa7722e07d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UUMS6LXSXNAAPZRDOZ3UU2JECS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:15:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZTFilQb/8wWMRlXSBhG0WQGzSylLZD3yaa/4GswHcH0SZIoDEx+8iJRhzeDkOFD5hlg8uRbPkGeLwRg5Cz9LCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T21:00:17.872797Z"},"content_sha256":"c24ab14650562c36a09b8957bd0a45b21078b0f55a5adb464771608854b69baf","schema_version":"1.0","event_id":"sha256:c24ab14650562c36a09b8957bd0a45b21078b0f55a5adb464771608854b69baf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UUMS6LXSXNAAPZRDOZ3UU2JECS/bundle.json","state_url":"https://pith.science/pith/UUMS6LXSXNAAPZRDOZ3UU2JECS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UUMS6LXSXNAAPZRDOZ3UU2JECS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T21:00:17Z","links":{"resolver":"https://pith.science/pith/UUMS6LXSXNAAPZRDOZ3UU2JECS","bundle":"https://pith.science/pith/UUMS6LXSXNAAPZRDOZ3UU2JECS/bundle.json","state":"https://pith.science/pith/UUMS6LXSXNAAPZRDOZ3UU2JECS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UUMS6LXSXNAAPZRDOZ3UU2JECS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UUMS6LXSXNAAPZRDOZ3UU2JECS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4fc537ba9a0ba43b60d9b61aa482078db21e704759e228f9896b0566d21418ea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-06-02T16:21:30Z","title_canon_sha256":"420eb70de916d54259e1f10821db8edb744d6abb445ab04a4e0cdd9d5d1470a8"},"schema_version":"1.0","source":{"id":"2506.01832","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01832","created_at":"2026-07-05T11:15:47Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01832v2","created_at":"2026-07-05T11:15:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01832","created_at":"2026-07-05T11:15:47Z"},{"alias_kind":"pith_short_12","alias_value":"UUMS6LXSXNAA","created_at":"2026-07-05T11:15:47Z"},{"alias_kind":"pith_short_16","alias_value":"UUMS6LXSXNAAPZRD","created_at":"2026-07-05T11:15:47Z"},{"alias_kind":"pith_short_8","alias_value":"UUMS6LXS","created_at":"2026-07-05T11:15:47Z"}],"graph_snapshots":[{"event_id":"sha256:c24ab14650562c36a09b8957bd0a45b21078b0f55a5adb464771608854b69baf","target":"graph","created_at":"2026-07-05T11:15:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.01832/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chin Ho Lee, Emanuele Viola","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-06-02T16:21:30Z","title":"Pseudorandom bits for non-commutative programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01832","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:85869f6427e833810da7001d66eb7d7e13756fd77ffd1948a95f97aa7722e07d","target":"record","created_at":"2026-07-05T11:15:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4fc537ba9a0ba43b60d9b61aa482078db21e704759e228f9896b0566d21418ea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-06-02T16:21:30Z","title_canon_sha256":"420eb70de916d54259e1f10821db8edb744d6abb445ab04a4e0cdd9d5d1470a8"},"schema_version":"1.0","source":{"id":"2506.01832","kind":"arxiv","version":2}},"canonical_sha256":"a5192f2ef2bb4007e62376774a692414a8858edcb7b2bf57c2f6f35fbd0ff663","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5192f2ef2bb4007e62376774a692414a8858edcb7b2bf57c2f6f35fbd0ff663","first_computed_at":"2026-07-05T11:15:47.620435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:47.620435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zhRfrOT6osSKq+NhwVDwmQ3XnO7Op5EZr2U84TTsm2CRuaCjA9vXL8SUB++8zw20Y4OqkjR7heplHEO4UGseDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:47.620940Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.01832","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85869f6427e833810da7001d66eb7d7e13756fd77ffd1948a95f97aa7722e07d","sha256:c24ab14650562c36a09b8957bd0a45b21078b0f55a5adb464771608854b69baf"],"state_sha256":"9bfc6ec75036e0e205658d5ed999ba6921e098300ec30909b9cfe283207992cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zB/VvAa2tL/0mAkujDGJ8PeIv3zUJjzPUVvd9U64HwfoDkiLIIi2gqVuIJGBXqzT2f2MY2LWq/aPtagGC3PhAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T21:00:17.876505Z","bundle_sha256":"e16a89f8a7e47699da4a1218a018681c086b5aad665ef840ea4b54af00cc20df"}}