{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:V5SHNXQJW6OZ7RRDF26A4G3M6B","short_pith_number":"pith:V5SHNXQJ","canonical_record":{"source":{"id":"1306.3004","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-13T01:41:14Z","cross_cats_sorted":[],"title_canon_sha256":"a60ff9cdaf8ceea1135b46835a4e069a33a338f59c629e9eb5c994759a59dd66","abstract_canon_sha256":"5ae2f50fffa09f758c3331d2c589b5362865ca6a27408d0dcef999e80750f698"},"schema_version":"1.0"},"canonical_sha256":"af6476de09b79d9fc6232ebc0e1b6cf063c6b9ae1fb19105b6e21221c339a250","source":{"kind":"arxiv","id":"1306.3004","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3004","created_at":"2026-05-18T03:20:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3004v2","created_at":"2026-05-18T03:20:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3004","created_at":"2026-05-18T03:20:22Z"},{"alias_kind":"pith_short_12","alias_value":"V5SHNXQJW6OZ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"V5SHNXQJW6OZ7RRD","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"V5SHNXQJ","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:V5SHNXQJW6OZ7RRDF26A4G3M6B","target":"record","payload":{"canonical_record":{"source":{"id":"1306.3004","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-13T01:41:14Z","cross_cats_sorted":[],"title_canon_sha256":"a60ff9cdaf8ceea1135b46835a4e069a33a338f59c629e9eb5c994759a59dd66","abstract_canon_sha256":"5ae2f50fffa09f758c3331d2c589b5362865ca6a27408d0dcef999e80750f698"},"schema_version":"1.0"},"canonical_sha256":"af6476de09b79d9fc6232ebc0e1b6cf063c6b9ae1fb19105b6e21221c339a250","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:22.089066Z","signature_b64":"rRHJRWzEKKxw5FvpAm/8XiL9eFH+xC+gmfRiKc8ZcaKxrrRbx2Gosa3kARonnRgAt/rqekXM3uO8kzYnMOJNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af6476de09b79d9fc6232ebc0e1b6cf063c6b9ae1fb19105b6e21221c339a250","last_reissued_at":"2026-05-18T03:20:22.088364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:22.088364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.3004","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-05-18T03:20:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bwXIwxH36g4BPztH9u1/W/IQISHtaClYZdzF/5Wxx2SqRO7ruyzJzAivyTNpsWPxjAlWf8ZDwTWnM9tKu7I+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:39:27.627914Z"},"content_sha256":"cbabafa7ba9b5cbf75c387d17d059229e7b50587ec73be59b9b8f9195efd3e38","schema_version":"1.0","event_id":"sha256:cbabafa7ba9b5cbf75c387d17d059229e7b50587ec73be59b9b8f9195efd3e38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:V5SHNXQJW6OZ7RRDF26A4G3M6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pseudorandomness for Regular Branching Programs via Fourier Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Omer Reingold, Salil Vadhan, Thomas Steinke","submitted_at":"2013-06-13T01:41:14Z","abstract_excerpt":"We present an explicit pseudorandom generator for oblivious, read-once, permutation branching programs of constant width that can read their input bits in any order. The seed length is $O(\\log^2 n)$, where $n$ is the length of the branching program. The previous best seed length known for this model was $n^{1/2+o(1)}$, which follows as a special case of a generator due to Impagliazzo, Meka, and Zuckerman (FOCS 2012) (which gives a seed length of $s^{1/2+o(1)}$ for arbitrary branching programs of size $s$). Our techniques also give seed length $n^{1/2+o(1)}$ for general oblivious, read-once bra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3004","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":""},"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-05-18T03:20:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mTHZSVFGmt6NQw3DcXKtO+L5PEauDxGpM9nZj43+JWomIdXvd44kpBZacZl/AWCFmPdP4opS2hhNc4Wb/hrxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:39:27.628414Z"},"content_sha256":"bcd9154034f4c96d78cb982156dd0fc2dc050dc4b1b3e9b4bf48d40416832e77","schema_version":"1.0","event_id":"sha256:bcd9154034f4c96d78cb982156dd0fc2dc050dc4b1b3e9b4bf48d40416832e77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V5SHNXQJW6OZ7RRDF26A4G3M6B/bundle.json","state_url":"https://pith.science/pith/V5SHNXQJW6OZ7RRDF26A4G3M6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V5SHNXQJW6OZ7RRDF26A4G3M6B/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-06-05T09:39:27Z","links":{"resolver":"https://pith.science/pith/V5SHNXQJW6OZ7RRDF26A4G3M6B","bundle":"https://pith.science/pith/V5SHNXQJW6OZ7RRDF26A4G3M6B/bundle.json","state":"https://pith.science/pith/V5SHNXQJW6OZ7RRDF26A4G3M6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V5SHNXQJW6OZ7RRDF26A4G3M6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:V5SHNXQJW6OZ7RRDF26A4G3M6B","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":"5ae2f50fffa09f758c3331d2c589b5362865ca6a27408d0dcef999e80750f698","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-13T01:41:14Z","title_canon_sha256":"a60ff9cdaf8ceea1135b46835a4e069a33a338f59c629e9eb5c994759a59dd66"},"schema_version":"1.0","source":{"id":"1306.3004","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3004","created_at":"2026-05-18T03:20:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3004v2","created_at":"2026-05-18T03:20:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3004","created_at":"2026-05-18T03:20:22Z"},{"alias_kind":"pith_short_12","alias_value":"V5SHNXQJW6OZ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"V5SHNXQJW6OZ7RRD","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"V5SHNXQJ","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:bcd9154034f4c96d78cb982156dd0fc2dc050dc4b1b3e9b4bf48d40416832e77","target":"graph","created_at":"2026-05-18T03:20:22Z","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"},"paper":{"abstract_excerpt":"We present an explicit pseudorandom generator for oblivious, read-once, permutation branching programs of constant width that can read their input bits in any order. The seed length is $O(\\log^2 n)$, where $n$ is the length of the branching program. The previous best seed length known for this model was $n^{1/2+o(1)}$, which follows as a special case of a generator due to Impagliazzo, Meka, and Zuckerman (FOCS 2012) (which gives a seed length of $s^{1/2+o(1)}$ for arbitrary branching programs of size $s$). Our techniques also give seed length $n^{1/2+o(1)}$ for general oblivious, read-once bra","authors_text":"Omer Reingold, Salil Vadhan, Thomas Steinke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-13T01:41:14Z","title":"Pseudorandomness for Regular Branching Programs via Fourier Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3004","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:cbabafa7ba9b5cbf75c387d17d059229e7b50587ec73be59b9b8f9195efd3e38","target":"record","created_at":"2026-05-18T03:20:22Z","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":"5ae2f50fffa09f758c3331d2c589b5362865ca6a27408d0dcef999e80750f698","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-13T01:41:14Z","title_canon_sha256":"a60ff9cdaf8ceea1135b46835a4e069a33a338f59c629e9eb5c994759a59dd66"},"schema_version":"1.0","source":{"id":"1306.3004","kind":"arxiv","version":2}},"canonical_sha256":"af6476de09b79d9fc6232ebc0e1b6cf063c6b9ae1fb19105b6e21221c339a250","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af6476de09b79d9fc6232ebc0e1b6cf063c6b9ae1fb19105b6e21221c339a250","first_computed_at":"2026-05-18T03:20:22.088364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:22.088364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rRHJRWzEKKxw5FvpAm/8XiL9eFH+xC+gmfRiKc8ZcaKxrrRbx2Gosa3kARonnRgAt/rqekXM3uO8kzYnMOJNCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:22.089066Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3004","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbabafa7ba9b5cbf75c387d17d059229e7b50587ec73be59b9b8f9195efd3e38","sha256:bcd9154034f4c96d78cb982156dd0fc2dc050dc4b1b3e9b4bf48d40416832e77"],"state_sha256":"96fd70f46d54cf8c78e3a8db37c321adcb49fa447f62b21d0bb72341b919fd8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KBD/YEvVJudfQepBBOIWvZkdRB43mXAc1eDtwiAM0q9N8URSQZgz2iY5F/Pvezo60Opccm4dU8D2wzbuB1u8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:39:27.633225Z","bundle_sha256":"23809134f9da12e28f2f6ae9434fa71790f394fe214f184a1ab2d62d21a9edc3"}}