{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:TSJVLCYV3UOQXSFL3G3FI6CPO3","short_pith_number":"pith:TSJVLCYV","canonical_record":{"source":{"id":"2303.16413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-03-29T02:42:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d94bf967620caae119862b9f907470e5287c74818f6ec8681a9dfe185f5cae59","abstract_canon_sha256":"46bff7876922980d012bb8d9c439a0d03ad4dd1ec1deaa9a7644f856c78f6c23"},"schema_version":"1.0"},"canonical_sha256":"9c93558b15dd1d0bc8abd9b654784f76c46e6934b680930147d83173d6ad8cc7","source":{"kind":"arxiv","id":"2303.16413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.16413","created_at":"2026-07-05T05:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"2303.16413v1","created_at":"2026-07-05T05:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16413","created_at":"2026-07-05T05:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"TSJVLCYV3UOQ","created_at":"2026-07-05T05:56:06Z"},{"alias_kind":"pith_short_16","alias_value":"TSJVLCYV3UOQXSFL","created_at":"2026-07-05T05:56:06Z"},{"alias_kind":"pith_short_8","alias_value":"TSJVLCYV","created_at":"2026-07-05T05:56:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:TSJVLCYV3UOQXSFL3G3FI6CPO3","target":"record","payload":{"canonical_record":{"source":{"id":"2303.16413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-03-29T02:42:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d94bf967620caae119862b9f907470e5287c74818f6ec8681a9dfe185f5cae59","abstract_canon_sha256":"46bff7876922980d012bb8d9c439a0d03ad4dd1ec1deaa9a7644f856c78f6c23"},"schema_version":"1.0"},"canonical_sha256":"9c93558b15dd1d0bc8abd9b654784f76c46e6934b680930147d83173d6ad8cc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:56:06.573616Z","signature_b64":"MPJ25RNLlRjv+v1t9m5vpa65SGTArWve1Ju10H2KncDogbktFVm2uGD0Cz3svg/RlcLggQAYsfMn6ngYFCuDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c93558b15dd1d0bc8abd9b654784f76c46e6934b680930147d83173d6ad8cc7","last_reissued_at":"2026-07-05T05:56:06.573096Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:56:06.573096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.16413","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-07-05T05:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"poYFKlbC/weZ8PtPxKLGjKRIUl9LNxLbMajt5NHfQETQcgJZ0geGeWsiFQkm0+DcPR9c8uONodBmW3kNfBrGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:55:27.204350Z"},"content_sha256":"4e8c344417f13cf2c32683cb52cb07b0135480813f12df0a68d129f359607eb7","schema_version":"1.0","event_id":"sha256:4e8c344417f13cf2c32683cb52cb07b0135480813f12df0a68d129f359607eb7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:TSJVLCYV3UOQXSFL3G3FI6CPO3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Certified Hardness vs. Randomness for Log-Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Edward Pyne, Ran Raz, Wei Zhan","submitted_at":"2023-03-29T02:42:36Z","abstract_excerpt":"Let $\\mathcal{L}$ be a language that can be decided in linear space and let $\\epsilon >0$ be any constant. Let $\\mathcal{A}$ be the exponential hardness assumption that for every $n$, membership in $\\mathcal{L}$ for inputs of length~$n$ cannot be decided by circuits of size smaller than $2^{\\epsilon n}$. We prove that for every function $f :\\{0,1\\}^* \\rightarrow \\{0,1\\}$, computable by a randomized logspace algorithm $R$, there exists a deterministic logspace algorithm $D$ (attempting to compute $f$), such that on every input $x$ of length $n$, the algorithm $D$ outputs one of the following:\n "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16413","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.16413/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+dcTgfpF3bVp7Le2gSGnNJ5kjbcTFrc3wuZhQk3U087QDNOo9jf3oCZd/ijrnVLo+T991gXKrqOneZ7uCURAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:55:27.205236Z"},"content_sha256":"76a2bd89fd25e5f84aa40c6714fe297764eed2bb1561c95095088145b203924b","schema_version":"1.0","event_id":"sha256:76a2bd89fd25e5f84aa40c6714fe297764eed2bb1561c95095088145b203924b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSJVLCYV3UOQXSFL3G3FI6CPO3/bundle.json","state_url":"https://pith.science/pith/TSJVLCYV3UOQXSFL3G3FI6CPO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSJVLCYV3UOQXSFL3G3FI6CPO3/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-07-07T04:55:27Z","links":{"resolver":"https://pith.science/pith/TSJVLCYV3UOQXSFL3G3FI6CPO3","bundle":"https://pith.science/pith/TSJVLCYV3UOQXSFL3G3FI6CPO3/bundle.json","state":"https://pith.science/pith/TSJVLCYV3UOQXSFL3G3FI6CPO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSJVLCYV3UOQXSFL3G3FI6CPO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:TSJVLCYV3UOQXSFL3G3FI6CPO3","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":"46bff7876922980d012bb8d9c439a0d03ad4dd1ec1deaa9a7644f856c78f6c23","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-03-29T02:42:36Z","title_canon_sha256":"d94bf967620caae119862b9f907470e5287c74818f6ec8681a9dfe185f5cae59"},"schema_version":"1.0","source":{"id":"2303.16413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.16413","created_at":"2026-07-05T05:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"2303.16413v1","created_at":"2026-07-05T05:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16413","created_at":"2026-07-05T05:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"TSJVLCYV3UOQ","created_at":"2026-07-05T05:56:06Z"},{"alias_kind":"pith_short_16","alias_value":"TSJVLCYV3UOQXSFL","created_at":"2026-07-05T05:56:06Z"},{"alias_kind":"pith_short_8","alias_value":"TSJVLCYV","created_at":"2026-07-05T05:56:06Z"}],"graph_snapshots":[{"event_id":"sha256:76a2bd89fd25e5f84aa40c6714fe297764eed2bb1561c95095088145b203924b","target":"graph","created_at":"2026-07-05T05:56:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.16413/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\mathcal{L}$ be a language that can be decided in linear space and let $\\epsilon >0$ be any constant. Let $\\mathcal{A}$ be the exponential hardness assumption that for every $n$, membership in $\\mathcal{L}$ for inputs of length~$n$ cannot be decided by circuits of size smaller than $2^{\\epsilon n}$. We prove that for every function $f :\\{0,1\\}^* \\rightarrow \\{0,1\\}$, computable by a randomized logspace algorithm $R$, there exists a deterministic logspace algorithm $D$ (attempting to compute $f$), such that on every input $x$ of length $n$, the algorithm $D$ outputs one of the following:\n ","authors_text":"Edward Pyne, Ran Raz, Wei Zhan","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-03-29T02:42:36Z","title":"Certified Hardness vs. Randomness for Log-Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16413","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:4e8c344417f13cf2c32683cb52cb07b0135480813f12df0a68d129f359607eb7","target":"record","created_at":"2026-07-05T05:56:06Z","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":"46bff7876922980d012bb8d9c439a0d03ad4dd1ec1deaa9a7644f856c78f6c23","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2023-03-29T02:42:36Z","title_canon_sha256":"d94bf967620caae119862b9f907470e5287c74818f6ec8681a9dfe185f5cae59"},"schema_version":"1.0","source":{"id":"2303.16413","kind":"arxiv","version":1}},"canonical_sha256":"9c93558b15dd1d0bc8abd9b654784f76c46e6934b680930147d83173d6ad8cc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c93558b15dd1d0bc8abd9b654784f76c46e6934b680930147d83173d6ad8cc7","first_computed_at":"2026-07-05T05:56:06.573096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:56:06.573096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MPJ25RNLlRjv+v1t9m5vpa65SGTArWve1Ju10H2KncDogbktFVm2uGD0Cz3svg/RlcLggQAYsfMn6ngYFCuDCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:56:06.573616Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.16413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e8c344417f13cf2c32683cb52cb07b0135480813f12df0a68d129f359607eb7","sha256:76a2bd89fd25e5f84aa40c6714fe297764eed2bb1561c95095088145b203924b"],"state_sha256":"5bb42541d0a22b989862116a40247bc0d714b481b1ed1aeb4f92fb9f07046cbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fjr63d1V4Iv6Nm+k0BWuo0MYsPNB5DOFTcSNGUpBg/KnfQwPLMWAqTaWz0k9UHplHlaoyVgXd2Z/1OL2jlE2Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:55:27.208887Z","bundle_sha256":"1efb184250a93642e3a9c5a0334cb51ef5c9f87dc9c5d6cb304932ebb8339bfb"}}