{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4FTV6SQULQS4OVUGHLYMTI65CP","short_pith_number":"pith:4FTV6SQU","schema_version":"1.0","canonical_sha256":"e1675f4a145c25c756863af0c9a3dd13cd4f956546878712c456883a65d89778","source":{"kind":"arxiv","id":"1808.06265","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.06265","created_at":"2026-05-18T00:07:45.526693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.06265v1","created_at":"2026-05-18T00:07:45.526693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06265","created_at":"2026-05-18T00:07:45.526693+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FTV6SQULQS4","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FTV6SQULQS4OVUG","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FTV6SQU","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4FTV6SQULQS4OVUGHLYMTI65CP","json":"https://pith.science/pith/4FTV6SQULQS4OVUGHLYMTI65CP.json","graph_json":"https://pith.science/api/pith-number/4FTV6SQULQS4OVUGHLYMTI65CP/graph.json","events_json":"https://pith.science/api/pith-number/4FTV6SQULQS4OVUGHLYMTI65CP/events.json","paper":"https://pith.science/paper/4FTV6SQU"},"agent_actions":{"view_html":"https://pith.science/pith/4FTV6SQULQS4OVUGHLYMTI65CP","download_json":"https://pith.science/pith/4FTV6SQULQS4OVUGHLYMTI65CP.json","view_paper":"https://pith.science/paper/4FTV6SQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.06265&json=true","fetch_graph":"https://pith.science/api/pith-number/4FTV6SQULQS4OVUGHLYMTI65CP/graph.json","fetch_events":"https://pith.science/api/pith-number/4FTV6SQULQS4OVUGHLYMTI65CP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FTV6SQULQS4OVUGHLYMTI65CP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FTV6SQULQS4OVUGHLYMTI65CP/action/storage_attestation","attest_author":"https://pith.science/pith/4FTV6SQULQS4OVUGHLYMTI65CP/action/author_attestation","sign_citation":"https://pith.science/pith/4FTV6SQULQS4OVUGHLYMTI65CP/action/citation_signature","submit_replication":"https://pith.science/pith/4FTV6SQULQS4OVUGHLYMTI65CP/action/replication_record"}},"created_at":"2026-05-18T00:07:45.526693+00:00","updated_at":"2026-05-18T00:07:45.526693+00:00"}