{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:B7NVDLR3ON2NSCZ4WYHH4ZG76W","short_pith_number":"pith:B7NVDLR3","canonical_record":{"source":{"id":"1210.0049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-28T21:58:10Z","cross_cats_sorted":[],"title_canon_sha256":"ff7d20da5488968abbf89f7166b03a0b0c5abf474f31d376062c42522e6ea87e","abstract_canon_sha256":"4f149f62e8dae81a1885314bb809b3867e6fc0285e292d25fffbb30c4156edff"},"schema_version":"1.0"},"canonical_sha256":"0fdb51ae3b7374d90b3cb60e7e64dff590cc86741ff6cc143543816274118ee1","source":{"kind":"arxiv","id":"1210.0049","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0049","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0049v1","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0049","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"B7NVDLR3ON2N","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"B7NVDLR3ON2NSCZ4","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"B7NVDLR3","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:B7NVDLR3ON2NSCZ4WYHH4ZG76W","target":"record","payload":{"canonical_record":{"source":{"id":"1210.0049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-28T21:58:10Z","cross_cats_sorted":[],"title_canon_sha256":"ff7d20da5488968abbf89f7166b03a0b0c5abf474f31d376062c42522e6ea87e","abstract_canon_sha256":"4f149f62e8dae81a1885314bb809b3867e6fc0285e292d25fffbb30c4156edff"},"schema_version":"1.0"},"canonical_sha256":"0fdb51ae3b7374d90b3cb60e7e64dff590cc86741ff6cc143543816274118ee1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:23.458706Z","signature_b64":"FgrkXE62enoIB/kOmCSnyJeiATALpEq8fvHc6he/oq4JDLe5th7CHndysqzuijRbaRm1eX9//KF6FenNRwqOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fdb51ae3b7374d90b3cb60e7e64dff590cc86741ff6cc143543816274118ee1","last_reissued_at":"2026-05-18T03:44:23.458197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:23.458197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.0049","source_version":1,"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:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ruoeV+wD2Be6CduZ9M3w1cB+6kGxffZfk8LG+3mBYmotA4V2IbSy/7BXZurJvIjDhupoKZkUwqikreg/8PdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:50:05.006584Z"},"content_sha256":"740c16cb7faf6c9ea4be94a72d5c089b6d94cf3677254a8bf58a04e5f4550d0c","schema_version":"1.0","event_id":"sha256:740c16cb7faf6c9ea4be94a72d5c089b6d94cf3677254a8bf58a04e5f4550d0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:B7NVDLR3ON2NSCZ4WYHH4ZG76W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Better Pseudorandom Generators from Milder Pseudorandom Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Luca Trevisan, Omer Reingold, Parikshit Gopalan, Raghu Meka, Salil Vadhan","submitted_at":"2012-09-28T21:58:10Z","abstract_excerpt":"We present an iterative approach to constructing pseudorandom generators, based on the repeated application of mild pseudorandom restrictions. We use this template to construct pseudorandom generators for combinatorial rectangles and read-once CNFs and a hitting set generator for width-3 branching programs, all of which achieve near-optimal seed-length even in the low-error regime: We get seed-length O(log (n/epsilon)) for error epsilon. Previously, only constructions with seed-length O(\\log^{3/2} n) or O(\\log^2 n) were known for these classes with polynomially small error.\n  The (pseudo)rando"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0049","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":""},"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:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YzbdQlXQwErfVb2roddZHBQTWadIdb7CcQb9TTTdYLyyfFTfEk52yju43OKew+jZlwd6KZgKta8Pe6u08f1bCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:50:05.006928Z"},"content_sha256":"c215ea0ba715c1d6d390d806a1e6f81c157ba3a7c86148b54d3a8747fb9824aa","schema_version":"1.0","event_id":"sha256:c215ea0ba715c1d6d390d806a1e6f81c157ba3a7c86148b54d3a8747fb9824aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7NVDLR3ON2NSCZ4WYHH4ZG76W/bundle.json","state_url":"https://pith.science/pith/B7NVDLR3ON2NSCZ4WYHH4ZG76W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7NVDLR3ON2NSCZ4WYHH4ZG76W/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-05-28T07:50:05Z","links":{"resolver":"https://pith.science/pith/B7NVDLR3ON2NSCZ4WYHH4ZG76W","bundle":"https://pith.science/pith/B7NVDLR3ON2NSCZ4WYHH4ZG76W/bundle.json","state":"https://pith.science/pith/B7NVDLR3ON2NSCZ4WYHH4ZG76W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7NVDLR3ON2NSCZ4WYHH4ZG76W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:B7NVDLR3ON2NSCZ4WYHH4ZG76W","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":"4f149f62e8dae81a1885314bb809b3867e6fc0285e292d25fffbb30c4156edff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-28T21:58:10Z","title_canon_sha256":"ff7d20da5488968abbf89f7166b03a0b0c5abf474f31d376062c42522e6ea87e"},"schema_version":"1.0","source":{"id":"1210.0049","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0049","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0049v1","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0049","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"B7NVDLR3ON2N","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"B7NVDLR3ON2NSCZ4","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"B7NVDLR3","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:c215ea0ba715c1d6d390d806a1e6f81c157ba3a7c86148b54d3a8747fb9824aa","target":"graph","created_at":"2026-05-18T03:44:23Z","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 iterative approach to constructing pseudorandom generators, based on the repeated application of mild pseudorandom restrictions. We use this template to construct pseudorandom generators for combinatorial rectangles and read-once CNFs and a hitting set generator for width-3 branching programs, all of which achieve near-optimal seed-length even in the low-error regime: We get seed-length O(log (n/epsilon)) for error epsilon. Previously, only constructions with seed-length O(\\log^{3/2} n) or O(\\log^2 n) were known for these classes with polynomially small error.\n  The (pseudo)rando","authors_text":"Luca Trevisan, Omer Reingold, Parikshit Gopalan, Raghu Meka, Salil Vadhan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-28T21:58:10Z","title":"Better Pseudorandom Generators from Milder Pseudorandom Restrictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0049","kind":"arxiv","version":1},"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:740c16cb7faf6c9ea4be94a72d5c089b6d94cf3677254a8bf58a04e5f4550d0c","target":"record","created_at":"2026-05-18T03:44:23Z","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":"4f149f62e8dae81a1885314bb809b3867e6fc0285e292d25fffbb30c4156edff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-28T21:58:10Z","title_canon_sha256":"ff7d20da5488968abbf89f7166b03a0b0c5abf474f31d376062c42522e6ea87e"},"schema_version":"1.0","source":{"id":"1210.0049","kind":"arxiv","version":1}},"canonical_sha256":"0fdb51ae3b7374d90b3cb60e7e64dff590cc86741ff6cc143543816274118ee1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fdb51ae3b7374d90b3cb60e7e64dff590cc86741ff6cc143543816274118ee1","first_computed_at":"2026-05-18T03:44:23.458197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:23.458197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FgrkXE62enoIB/kOmCSnyJeiATALpEq8fvHc6he/oq4JDLe5th7CHndysqzuijRbaRm1eX9//KF6FenNRwqOCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:23.458706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0049","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:740c16cb7faf6c9ea4be94a72d5c089b6d94cf3677254a8bf58a04e5f4550d0c","sha256:c215ea0ba715c1d6d390d806a1e6f81c157ba3a7c86148b54d3a8747fb9824aa"],"state_sha256":"e10c3d9a1fb8495012bea1c16c4ae28f4a0b97919e420ef282bc142ef15b2746"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PvYlSiEGrPcJaiKsPZqLqnDwN3w7AtZRsGFVK/4r1PORikcXg+NC/nZM1RfM+4IWqzUbgVwR8HP6euB1eGZhCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:50:05.009307Z","bundle_sha256":"6a75179985977a257c9df7332c5c770ff74741e54a170ed449de646c0df41385"}}