{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PFL66LSYASJXZU3E2GRXSW3TGQ","short_pith_number":"pith:PFL66LSY","schema_version":"1.0","canonical_sha256":"7957ef2e5804937cd364d1a3795b733400e83ef0806b3bc745955a0bbb643c2a","source":{"kind":"arxiv","id":"1803.04025","version":1},"attestation_state":"computed","paper":{"title":"Reproducibility and Pseudo-Determinism in Log-Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ofer Grossman, Yang P. Liu","submitted_at":"2018-03-11T19:39:54Z","abstract_excerpt":"A curious property of randomized log-space search algorithms is that their outputs are often longer than their workspace. This leads to the question: how can we reproduce the results of a randomized log space computation without storing the output or randomness verbatim? Running the algorithm again with new random bits may result in a new (and potentially different) output.\n  We show that every problem in search-RL has a randomized log-space algorithm where the output can be reproduced. Specifically, we show that for every problem in search-RL, there are a pair of log-space randomized algorith"},"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":"1803.04025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-11T19:39:54Z","cross_cats_sorted":[],"title_canon_sha256":"9e2d8d65cf850904d7b28536854cec034935b78884a44e843b4fc2e56333580b","abstract_canon_sha256":"2296ac3e56c383676cb2302ff7191788b1b323f458aae7207475fa4114456da0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:05.590062Z","signature_b64":"4KMxWJ2JePFmE2z6ov7lv2ksHgC2Hot5dr0yhoXPCQC1LWEepjrEkQcwsn1iGemfLvene23cbYGoi7oHvxauCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7957ef2e5804937cd364d1a3795b733400e83ef0806b3bc745955a0bbb643c2a","last_reissued_at":"2026-05-18T00:21:05.589610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:05.589610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reproducibility and Pseudo-Determinism in Log-Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ofer Grossman, Yang P. Liu","submitted_at":"2018-03-11T19:39:54Z","abstract_excerpt":"A curious property of randomized log-space search algorithms is that their outputs are often longer than their workspace. This leads to the question: how can we reproduce the results of a randomized log space computation without storing the output or randomness verbatim? Running the algorithm again with new random bits may result in a new (and potentially different) output.\n  We show that every problem in search-RL has a randomized log-space algorithm where the output can be reproduced. Specifically, we show that for every problem in search-RL, there are a pair of log-space randomized algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04025","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":"1803.04025","created_at":"2026-05-18T00:21:05.589675+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04025v1","created_at":"2026-05-18T00:21:05.589675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04025","created_at":"2026-05-18T00:21:05.589675+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFL66LSYASJX","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFL66LSYASJXZU3E","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFL66LSY","created_at":"2026-05-18T12:32:43.782077+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/PFL66LSYASJXZU3E2GRXSW3TGQ","json":"https://pith.science/pith/PFL66LSYASJXZU3E2GRXSW3TGQ.json","graph_json":"https://pith.science/api/pith-number/PFL66LSYASJXZU3E2GRXSW3TGQ/graph.json","events_json":"https://pith.science/api/pith-number/PFL66LSYASJXZU3E2GRXSW3TGQ/events.json","paper":"https://pith.science/paper/PFL66LSY"},"agent_actions":{"view_html":"https://pith.science/pith/PFL66LSYASJXZU3E2GRXSW3TGQ","download_json":"https://pith.science/pith/PFL66LSYASJXZU3E2GRXSW3TGQ.json","view_paper":"https://pith.science/paper/PFL66LSY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04025&json=true","fetch_graph":"https://pith.science/api/pith-number/PFL66LSYASJXZU3E2GRXSW3TGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PFL66LSYASJXZU3E2GRXSW3TGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFL66LSYASJXZU3E2GRXSW3TGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFL66LSYASJXZU3E2GRXSW3TGQ/action/storage_attestation","attest_author":"https://pith.science/pith/PFL66LSYASJXZU3E2GRXSW3TGQ/action/author_attestation","sign_citation":"https://pith.science/pith/PFL66LSYASJXZU3E2GRXSW3TGQ/action/citation_signature","submit_replication":"https://pith.science/pith/PFL66LSYASJXZU3E2GRXSW3TGQ/action/replication_record"}},"created_at":"2026-05-18T00:21:05.589675+00:00","updated_at":"2026-05-18T00:21:05.589675+00:00"}