{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PDJYOIKFWARWMJHGGNT3UNGUEE","short_pith_number":"pith:PDJYOIKF","canonical_record":{"source":{"id":"1610.01199","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-04T20:56:10Z","cross_cats_sorted":[],"title_canon_sha256":"c2a1cfc69ab709805dd921c4cb2cf8bb89ea1a05c990e44643f7511d4461baaa","abstract_canon_sha256":"d7c88a1999d09fe7941ad14c4983be692c8dfdd25330c6e1b942f01b3c82edb9"},"schema_version":"1.0"},"canonical_sha256":"78d3872145b0236624e63367ba34d42125633e737c8d7067f40cd753bad98ad5","source":{"kind":"arxiv","id":"1610.01199","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01199","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01199v4","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01199","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"PDJYOIKFWARW","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PDJYOIKFWARWMJHG","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PDJYOIKF","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PDJYOIKFWARWMJHGGNT3UNGUEE","target":"record","payload":{"canonical_record":{"source":{"id":"1610.01199","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-04T20:56:10Z","cross_cats_sorted":[],"title_canon_sha256":"c2a1cfc69ab709805dd921c4cb2cf8bb89ea1a05c990e44643f7511d4461baaa","abstract_canon_sha256":"d7c88a1999d09fe7941ad14c4983be692c8dfdd25330c6e1b942f01b3c82edb9"},"schema_version":"1.0"},"canonical_sha256":"78d3872145b0236624e63367ba34d42125633e737c8d7067f40cd753bad98ad5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:49.019018Z","signature_b64":"wPi99ubLh6QvAPK+n77bfBSEV2qhEBHyU3koSsbp5Z6bGuvfrZKqTMMzMjhikolAZbUt9Z36VZlFC52DS/SRCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78d3872145b0236624e63367ba34d42125633e737c8d7067f40cd753bad98ad5","last_reissued_at":"2026-05-18T00:46:49.018393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:49.018393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.01199","source_version":4,"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-18T00:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0qKVTCtxDRHNqNioeQbykS+f2IOuR1/EtwXotj6NnNA1OUjiV1X58Ci6ANY3kdL3S4cEaxsQce/pOTmc1bZaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:21:18.509198Z"},"content_sha256":"dc4e54d43ad773810132608deb3214504a80f0f9318c2c5785f0667b5ece80bc","schema_version":"1.0","event_id":"sha256:dc4e54d43ad773810132608deb3214504a80f0f9318c2c5785f0667b5ece80bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PDJYOIKFWARWMJHGGNT3UNGUEE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Chris Umans, William M. Hoza","submitted_at":"2016-10-04T20:56:10Z","abstract_excerpt":"Assume that for every derandomization result for logspace algorithms, there is a pseudorandom generator strong enough to nearly recover the derandomization by iterating over all seeds and taking a majority vote. We prove under a precise version of this assumption that $\\mathbf{BPL} \\subseteq \\bigcap_{\\alpha > 0} \\mathbf{DSPACE}(\\log^{1 + \\alpha} n)$.\n  We strengthen the theorem to an equivalence by considering two generalizations of the concept of a pseudorandom generator against logspace. A targeted pseudorandom generator against logspace takes as input a short uniform random seed and a finit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01199","kind":"arxiv","version":4},"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-18T00:46:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QeGQXDhit3Ij78cBuR3uW4f3ovRQTuUP3RHTpuvcMIEokcr7qom2yRHN3cMWcppzC3LdDtk7c82kWP4J7s4AAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:21:18.509564Z"},"content_sha256":"1607e2bc804d8bd90d1ddd056badf65e98fb5639d2fee17c3a978c743665a06c","schema_version":"1.0","event_id":"sha256:1607e2bc804d8bd90d1ddd056badf65e98fb5639d2fee17c3a978c743665a06c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PDJYOIKFWARWMJHGGNT3UNGUEE/bundle.json","state_url":"https://pith.science/pith/PDJYOIKFWARWMJHGGNT3UNGUEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PDJYOIKFWARWMJHGGNT3UNGUEE/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-28T09:21:18Z","links":{"resolver":"https://pith.science/pith/PDJYOIKFWARWMJHGGNT3UNGUEE","bundle":"https://pith.science/pith/PDJYOIKFWARWMJHGGNT3UNGUEE/bundle.json","state":"https://pith.science/pith/PDJYOIKFWARWMJHGGNT3UNGUEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PDJYOIKFWARWMJHGGNT3UNGUEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PDJYOIKFWARWMJHGGNT3UNGUEE","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":"d7c88a1999d09fe7941ad14c4983be692c8dfdd25330c6e1b942f01b3c82edb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-04T20:56:10Z","title_canon_sha256":"c2a1cfc69ab709805dd921c4cb2cf8bb89ea1a05c990e44643f7511d4461baaa"},"schema_version":"1.0","source":{"id":"1610.01199","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01199","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01199v4","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01199","created_at":"2026-05-18T00:46:49Z"},{"alias_kind":"pith_short_12","alias_value":"PDJYOIKFWARW","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PDJYOIKFWARWMJHG","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PDJYOIKF","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:1607e2bc804d8bd90d1ddd056badf65e98fb5639d2fee17c3a978c743665a06c","target":"graph","created_at":"2026-05-18T00:46:49Z","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":"Assume that for every derandomization result for logspace algorithms, there is a pseudorandom generator strong enough to nearly recover the derandomization by iterating over all seeds and taking a majority vote. We prove under a precise version of this assumption that $\\mathbf{BPL} \\subseteq \\bigcap_{\\alpha > 0} \\mathbf{DSPACE}(\\log^{1 + \\alpha} n)$.\n  We strengthen the theorem to an equivalence by considering two generalizations of the concept of a pseudorandom generator against logspace. A targeted pseudorandom generator against logspace takes as input a short uniform random seed and a finit","authors_text":"Chris Umans, William M. Hoza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-04T20:56:10Z","title":"Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01199","kind":"arxiv","version":4},"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:dc4e54d43ad773810132608deb3214504a80f0f9318c2c5785f0667b5ece80bc","target":"record","created_at":"2026-05-18T00:46:49Z","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":"d7c88a1999d09fe7941ad14c4983be692c8dfdd25330c6e1b942f01b3c82edb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-04T20:56:10Z","title_canon_sha256":"c2a1cfc69ab709805dd921c4cb2cf8bb89ea1a05c990e44643f7511d4461baaa"},"schema_version":"1.0","source":{"id":"1610.01199","kind":"arxiv","version":4}},"canonical_sha256":"78d3872145b0236624e63367ba34d42125633e737c8d7067f40cd753bad98ad5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78d3872145b0236624e63367ba34d42125633e737c8d7067f40cd753bad98ad5","first_computed_at":"2026-05-18T00:46:49.018393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:49.018393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wPi99ubLh6QvAPK+n77bfBSEV2qhEBHyU3koSsbp5Z6bGuvfrZKqTMMzMjhikolAZbUt9Z36VZlFC52DS/SRCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:49.019018Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.01199","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc4e54d43ad773810132608deb3214504a80f0f9318c2c5785f0667b5ece80bc","sha256:1607e2bc804d8bd90d1ddd056badf65e98fb5639d2fee17c3a978c743665a06c"],"state_sha256":"b33a34b1748b7264c74e6162a7aab89574d989192da2765c51164bfb89d69ff0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHzwDqpa2TThkwjCtnhOtMjkqdFDj+xTJxuLdBCEmqSXnnYYxwAHpMIeaBSQZF/wAIyJ+jsjrwaQ4dbibwlbDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:21:18.511574Z","bundle_sha256":"e3fc5adbc67a860c6488a2668f11e4a2254a453896b99446f079ed55771d9d31"}}