{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4FTV6SQULQS4OVUGHLYMTI65CP","short_pith_number":"pith:4FTV6SQU","canonical_record":{"source":{"id":"1808.06265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-08-19T22:17:54Z","cross_cats_sorted":[],"title_canon_sha256":"71688beddfd9454d985e0ae5478686ac6af2b13b5d76bb1425a06b63ffe95483","abstract_canon_sha256":"2535c16fae3a65dc62e7a509a12ebd67b2ae6fee7f3ad897c53d3252fdecff79"},"schema_version":"1.0"},"canonical_sha256":"e1675f4a145c25c756863af0c9a3dd13cd4f956546878712c456883a65d89778","source":{"kind":"arxiv","id":"1808.06265","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06265","created_at":"2026-05-18T00:07:45Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06265v1","created_at":"2026-05-18T00:07:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06265","created_at":"2026-05-18T00:07:45Z"},{"alias_kind":"pith_short_12","alias_value":"4FTV6SQULQS4","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4FTV6SQULQS4OVUG","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4FTV6SQU","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4FTV6SQULQS4OVUGHLYMTI65CP","target":"record","payload":{"canonical_record":{"source":{"id":"1808.06265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-08-19T22:17:54Z","cross_cats_sorted":[],"title_canon_sha256":"71688beddfd9454d985e0ae5478686ac6af2b13b5d76bb1425a06b63ffe95483","abstract_canon_sha256":"2535c16fae3a65dc62e7a509a12ebd67b2ae6fee7f3ad897c53d3252fdecff79"},"schema_version":"1.0"},"canonical_sha256":"e1675f4a145c25c756863af0c9a3dd13cd4f956546878712c456883a65d89778","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:45.527211Z","signature_b64":"H8WccXCW9d6JjVlQc98hjfk0W7rEEq7lSubqoAc2DF4tXgVgY5yhBvf82ZkvN/z0CcB8ZhxIELJdJShVwdyWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1675f4a145c25c756863af0c9a3dd13cd4f956546878712c456883a65d89778","last_reissued_at":"2026-05-18T00:07:45.526586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:45.526586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.06265","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-18T00:07:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iSvxwQCanlJ+62hMDyFUc0bnId1qKvEtORBxAKQKI+CN1IEY+s3Lcisyq/Bcz1tx9TzfCsWpJL/xCIzqlYeLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:28:06.180848Z"},"content_sha256":"e239b2a038db5d3f8d475a1c8d17efb9de352346d8b281b6ad041d48b48134f6","schema_version":"1.0","event_id":"sha256:e239b2a038db5d3f8d475a1c8d17efb9de352346d8b281b6ad041d48b48134f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4FTV6SQULQS4OVUGHLYMTI65CP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pseudorandom Generators for Read-Once Branching Programs, in any Order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Michael A. Forbes, Zander Kelley","submitted_at":"2018-08-19T22:17:54Z","abstract_excerpt":"A central question in derandomization is whether randomized logspace (RL) equals deterministic logspace (L). To show that RL=L, it suffices to construct explicit pseudorandom generators (PRGs) that fool polynomial-size read-once (oblivious) branching programs (roBPs). Starting with the work of Nisan, pseudorandom generators with seed-length $O(\\log^2 n)$ were constructed. Unfortunately, improving on this seed-length in general has proven challenging and seems to require new ideas.\n  A recent line of inquiry has suggested focusing on a particular limitation of the existing PRGs, which is that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06265","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-18T00:07:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qAXpYRpqBcDF2bI67obUe+ekvad7ebEqfFRYVTcBAb5YukKCqOEhHmHiEFWuAVKPzJRvmr34qpGz0fKWV/GhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:28:06.181253Z"},"content_sha256":"c91f9d1bc22985bbeede43139c029c5571e6478a37b7c1118c8bf4475e89e518","schema_version":"1.0","event_id":"sha256:c91f9d1bc22985bbeede43139c029c5571e6478a37b7c1118c8bf4475e89e518"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FTV6SQULQS4OVUGHLYMTI65CP/bundle.json","state_url":"https://pith.science/pith/4FTV6SQULQS4OVUGHLYMTI65CP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FTV6SQULQS4OVUGHLYMTI65CP/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-08T19:28:06Z","links":{"resolver":"https://pith.science/pith/4FTV6SQULQS4OVUGHLYMTI65CP","bundle":"https://pith.science/pith/4FTV6SQULQS4OVUGHLYMTI65CP/bundle.json","state":"https://pith.science/pith/4FTV6SQULQS4OVUGHLYMTI65CP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FTV6SQULQS4OVUGHLYMTI65CP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4FTV6SQULQS4OVUGHLYMTI65CP","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":"2535c16fae3a65dc62e7a509a12ebd67b2ae6fee7f3ad897c53d3252fdecff79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-08-19T22:17:54Z","title_canon_sha256":"71688beddfd9454d985e0ae5478686ac6af2b13b5d76bb1425a06b63ffe95483"},"schema_version":"1.0","source":{"id":"1808.06265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06265","created_at":"2026-05-18T00:07:45Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06265v1","created_at":"2026-05-18T00:07:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06265","created_at":"2026-05-18T00:07:45Z"},{"alias_kind":"pith_short_12","alias_value":"4FTV6SQULQS4","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4FTV6SQULQS4OVUG","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4FTV6SQU","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:c91f9d1bc22985bbeede43139c029c5571e6478a37b7c1118c8bf4475e89e518","target":"graph","created_at":"2026-05-18T00:07:45Z","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":"A central question in derandomization is whether randomized logspace (RL) equals deterministic logspace (L). To show that RL=L, it suffices to construct explicit pseudorandom generators (PRGs) that fool polynomial-size read-once (oblivious) branching programs (roBPs). Starting with the work of Nisan, pseudorandom generators with seed-length $O(\\log^2 n)$ were constructed. Unfortunately, improving on this seed-length in general has proven challenging and seems to require new ideas.\n  A recent line of inquiry has suggested focusing on a particular limitation of the existing PRGs, which is that t","authors_text":"Michael A. Forbes, Zander Kelley","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-08-19T22:17:54Z","title":"Pseudorandom Generators for Read-Once Branching Programs, in any Order"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06265","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:e239b2a038db5d3f8d475a1c8d17efb9de352346d8b281b6ad041d48b48134f6","target":"record","created_at":"2026-05-18T00:07:45Z","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":"2535c16fae3a65dc62e7a509a12ebd67b2ae6fee7f3ad897c53d3252fdecff79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-08-19T22:17:54Z","title_canon_sha256":"71688beddfd9454d985e0ae5478686ac6af2b13b5d76bb1425a06b63ffe95483"},"schema_version":"1.0","source":{"id":"1808.06265","kind":"arxiv","version":1}},"canonical_sha256":"e1675f4a145c25c756863af0c9a3dd13cd4f956546878712c456883a65d89778","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1675f4a145c25c756863af0c9a3dd13cd4f956546878712c456883a65d89778","first_computed_at":"2026-05-18T00:07:45.526586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:45.526586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H8WccXCW9d6JjVlQc98hjfk0W7rEEq7lSubqoAc2DF4tXgVgY5yhBvf82ZkvN/z0CcB8ZhxIELJdJShVwdyWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:45.527211Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.06265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e239b2a038db5d3f8d475a1c8d17efb9de352346d8b281b6ad041d48b48134f6","sha256:c91f9d1bc22985bbeede43139c029c5571e6478a37b7c1118c8bf4475e89e518"],"state_sha256":"b2dfe96b1a5693b0b51d5b6ed1aa4b8b18e1c731b7ed64abeef74f4c1d7bcc65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3uUQtdPXqPncsGfWEB4n+FRXYdPR7h88q0LhfOwqqRmxw6rqFIATh61hQDdRw4b+zutdCZGhzgtMzVeH7llXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:28:06.183603Z","bundle_sha256":"4f410019422d87d49d1dfee0ada3d997f68f4253ced1f198d07250ddcf074af3"}}