{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:56J632UTA3DWJRYPVB2WDBJG2Z","short_pith_number":"pith:56J632UT","canonical_record":{"source":{"id":"1711.00565","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-01T23:36:39Z","cross_cats_sorted":[],"title_canon_sha256":"5c087a25cbc403265fe4cac733274c592f3bcf9f7d86e63bd0519c5a5383ab12","abstract_canon_sha256":"3d587071bcd7094b3f6082fab56d4f6184cbbc35d5f27630c82c3bf517e1841f"},"schema_version":"1.0"},"canonical_sha256":"ef93edea9306c764c70fa875618526d6781cbfc025cfb9e9fee3fd510df3e0fb","source":{"kind":"arxiv","id":"1711.00565","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00565","created_at":"2026-05-17T23:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00565v3","created_at":"2026-05-17T23:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00565","created_at":"2026-05-17T23:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"56J632UTA3DW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"56J632UTA3DWJRYP","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"56J632UT","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:56J632UTA3DWJRYPVB2WDBJG2Z","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00565","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-01T23:36:39Z","cross_cats_sorted":[],"title_canon_sha256":"5c087a25cbc403265fe4cac733274c592f3bcf9f7d86e63bd0519c5a5383ab12","abstract_canon_sha256":"3d587071bcd7094b3f6082fab56d4f6184cbbc35d5f27630c82c3bf517e1841f"},"schema_version":"1.0"},"canonical_sha256":"ef93edea9306c764c70fa875618526d6781cbfc025cfb9e9fee3fd510df3e0fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:04.437122Z","signature_b64":"kSw769Ip4g7utAQAdY7L+DLFi9Xhgqj11TnSyF7mQM+06fp1SOeBTr16B3TupbXfZdCKDfm1J9cHKViQ0JWYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef93edea9306c764c70fa875618526d6781cbfc025cfb9e9fee3fd510df3e0fb","last_reissued_at":"2026-05-17T23:46:04.434794Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:04.434794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00565","source_version":3,"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-17T23:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+y4DVXfhdgsGYZuXNOoZcOj3YDDv2nnLwu9ZIqw0S2pPjL972EYnFCsMKZedHLt6ePxwKdSZF7YPFKJ8G1uBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:49:38.297625Z"},"content_sha256":"94b6e638f0827f444d023fc6f79eb893103510917834f71b0b380baa678a8f90","schema_version":"1.0","event_id":"sha256:94b6e638f0827f444d023fc6f79eb893103510917834f71b0b380baa678a8f90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:56J632UTA3DWJRYPVB2WDBJG2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Typically-Correct Derandomization for Small Time and Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"William M. Hoza","submitted_at":"2017-11-01T23:36:39Z","abstract_excerpt":"Suppose a language $L$ can be decided by a bounded-error randomized algorithm that runs in space $S$ and time $n \\cdot \\text{poly}(S)$. We give a randomized algorithm for $L$ that still runs in space $O(S)$ and time $n \\cdot \\text{poly}(S)$ that uses only $O(S)$ random bits; our algorithm has a low failure probability on all but a negligible fraction of inputs of each length. An immediate corollary is a deterministic algorithm for $L$ that runs in space $O(S)$ and succeeds on all but a negligible fraction of inputs of each length. We also give several other complexity-theoretic applications of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00565","kind":"arxiv","version":3},"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-17T23:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wo8P6xsxz+n2WzlV7TJzcIVdryrzDZpCghcXHo3l3UUffQQ1EZBdsmFz8oL3ACjA3Q2nzAt55B3R+kJiakbmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:49:38.297970Z"},"content_sha256":"599d98bb5cb5e1edf8404735d0a1ea60ef9e943363f76aeba0540eee269a028d","schema_version":"1.0","event_id":"sha256:599d98bb5cb5e1edf8404735d0a1ea60ef9e943363f76aeba0540eee269a028d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56J632UTA3DWJRYPVB2WDBJG2Z/bundle.json","state_url":"https://pith.science/pith/56J632UTA3DWJRYPVB2WDBJG2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56J632UTA3DWJRYPVB2WDBJG2Z/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-24T04:49:38Z","links":{"resolver":"https://pith.science/pith/56J632UTA3DWJRYPVB2WDBJG2Z","bundle":"https://pith.science/pith/56J632UTA3DWJRYPVB2WDBJG2Z/bundle.json","state":"https://pith.science/pith/56J632UTA3DWJRYPVB2WDBJG2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56J632UTA3DWJRYPVB2WDBJG2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:56J632UTA3DWJRYPVB2WDBJG2Z","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":"3d587071bcd7094b3f6082fab56d4f6184cbbc35d5f27630c82c3bf517e1841f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-01T23:36:39Z","title_canon_sha256":"5c087a25cbc403265fe4cac733274c592f3bcf9f7d86e63bd0519c5a5383ab12"},"schema_version":"1.0","source":{"id":"1711.00565","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00565","created_at":"2026-05-17T23:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00565v3","created_at":"2026-05-17T23:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00565","created_at":"2026-05-17T23:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"56J632UTA3DW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"56J632UTA3DWJRYP","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"56J632UT","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:599d98bb5cb5e1edf8404735d0a1ea60ef9e943363f76aeba0540eee269a028d","target":"graph","created_at":"2026-05-17T23:46:04Z","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":"Suppose a language $L$ can be decided by a bounded-error randomized algorithm that runs in space $S$ and time $n \\cdot \\text{poly}(S)$. We give a randomized algorithm for $L$ that still runs in space $O(S)$ and time $n \\cdot \\text{poly}(S)$ that uses only $O(S)$ random bits; our algorithm has a low failure probability on all but a negligible fraction of inputs of each length. An immediate corollary is a deterministic algorithm for $L$ that runs in space $O(S)$ and succeeds on all but a negligible fraction of inputs of each length. We also give several other complexity-theoretic applications of","authors_text":"William M. Hoza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-01T23:36:39Z","title":"Typically-Correct Derandomization for Small Time and Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00565","kind":"arxiv","version":3},"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:94b6e638f0827f444d023fc6f79eb893103510917834f71b0b380baa678a8f90","target":"record","created_at":"2026-05-17T23:46:04Z","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":"3d587071bcd7094b3f6082fab56d4f6184cbbc35d5f27630c82c3bf517e1841f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-01T23:36:39Z","title_canon_sha256":"5c087a25cbc403265fe4cac733274c592f3bcf9f7d86e63bd0519c5a5383ab12"},"schema_version":"1.0","source":{"id":"1711.00565","kind":"arxiv","version":3}},"canonical_sha256":"ef93edea9306c764c70fa875618526d6781cbfc025cfb9e9fee3fd510df3e0fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef93edea9306c764c70fa875618526d6781cbfc025cfb9e9fee3fd510df3e0fb","first_computed_at":"2026-05-17T23:46:04.434794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:04.434794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kSw769Ip4g7utAQAdY7L+DLFi9Xhgqj11TnSyF7mQM+06fp1SOeBTr16B3TupbXfZdCKDfm1J9cHKViQ0JWYAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:04.437122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00565","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94b6e638f0827f444d023fc6f79eb893103510917834f71b0b380baa678a8f90","sha256:599d98bb5cb5e1edf8404735d0a1ea60ef9e943363f76aeba0540eee269a028d"],"state_sha256":"0ac3e342375192ec3cde2980681a655972151ddf82c6f7f66546b590f6d808f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e6VOXPF2N/fbMID1UwMngbgAHVCBuJa+6g3olp+tXPFF6ucL2J93kgHTX4ccxOUrjhUgEWY5nGvevu4wH8xICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:49:38.299876Z","bundle_sha256":"cf5c975b14caffa91290c79cab678296f156ac89d82648d6726b493b046a4ef9"}}