{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:R56JGCJCA6V3WKBQCDRFSJC263","short_pith_number":"pith:R56JGCJC","schema_version":"1.0","canonical_sha256":"8f7c93092207abbb283010e259245af6ddf3d212d608c7ac00934d3ac28b5b12","source":{"kind":"arxiv","id":"1606.04649","version":1},"attestation_state":"computed","paper":{"title":"Trading Determinism for Time in Space Bounded Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Raghunath Tewari, Vivek Anand T Kallampally","submitted_at":"2016-06-15T05:51:08Z","abstract_excerpt":"Savitch showed in $1970$ that nondeterministic logspace (NL) is contained in deterministic $\\mathcal{O}(\\log^2 n)$ space but his algorithm requires quasipolynomial time. The question whether we can have a deterministic algorithm for every problem in NL that requires polylogarithmic space and simultaneously runs in polynomial time was left open.\n  In this paper we give a partial solution to this problem and show that for every language in NL there exists an unambiguous nondeterministic algorithm that requires $\\mathcal{O}(\\log^2 n)$ space and simultaneously runs in polynomial time."},"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":"1606.04649","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-06-15T05:51:08Z","cross_cats_sorted":[],"title_canon_sha256":"03ac9d5b9055c01f601f97c5aed2f19705ee77824564a11fb8f32afe6543127b","abstract_canon_sha256":"66bd1897360bdb20e4c9fe72fe121b516ae38cd1bc15d421e4bf27cf5929cf02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:24.635542Z","signature_b64":"enW6wGNiz8dsgShuPnqEGN14IPRQWo4kevmTp5Gxc7Hoeld9F79Hke3nhMn5L1CSyEUK6F4WRouPVYnRTt/vCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f7c93092207abbb283010e259245af6ddf3d212d608c7ac00934d3ac28b5b12","last_reissued_at":"2026-05-18T01:12:24.635050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:24.635050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trading Determinism for Time in Space Bounded Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Raghunath Tewari, Vivek Anand T Kallampally","submitted_at":"2016-06-15T05:51:08Z","abstract_excerpt":"Savitch showed in $1970$ that nondeterministic logspace (NL) is contained in deterministic $\\mathcal{O}(\\log^2 n)$ space but his algorithm requires quasipolynomial time. The question whether we can have a deterministic algorithm for every problem in NL that requires polylogarithmic space and simultaneously runs in polynomial time was left open.\n  In this paper we give a partial solution to this problem and show that for every language in NL there exists an unambiguous nondeterministic algorithm that requires $\\mathcal{O}(\\log^2 n)$ space and simultaneously runs in polynomial time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04649","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":"1606.04649","created_at":"2026-05-18T01:12:24.635125+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.04649v1","created_at":"2026-05-18T01:12:24.635125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04649","created_at":"2026-05-18T01:12:24.635125+00:00"},{"alias_kind":"pith_short_12","alias_value":"R56JGCJCA6V3","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"R56JGCJCA6V3WKBQ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"R56JGCJC","created_at":"2026-05-18T12:30:41.710351+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/R56JGCJCA6V3WKBQCDRFSJC263","json":"https://pith.science/pith/R56JGCJCA6V3WKBQCDRFSJC263.json","graph_json":"https://pith.science/api/pith-number/R56JGCJCA6V3WKBQCDRFSJC263/graph.json","events_json":"https://pith.science/api/pith-number/R56JGCJCA6V3WKBQCDRFSJC263/events.json","paper":"https://pith.science/paper/R56JGCJC"},"agent_actions":{"view_html":"https://pith.science/pith/R56JGCJCA6V3WKBQCDRFSJC263","download_json":"https://pith.science/pith/R56JGCJCA6V3WKBQCDRFSJC263.json","view_paper":"https://pith.science/paper/R56JGCJC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.04649&json=true","fetch_graph":"https://pith.science/api/pith-number/R56JGCJCA6V3WKBQCDRFSJC263/graph.json","fetch_events":"https://pith.science/api/pith-number/R56JGCJCA6V3WKBQCDRFSJC263/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R56JGCJCA6V3WKBQCDRFSJC263/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R56JGCJCA6V3WKBQCDRFSJC263/action/storage_attestation","attest_author":"https://pith.science/pith/R56JGCJCA6V3WKBQCDRFSJC263/action/author_attestation","sign_citation":"https://pith.science/pith/R56JGCJCA6V3WKBQCDRFSJC263/action/citation_signature","submit_replication":"https://pith.science/pith/R56JGCJCA6V3WKBQCDRFSJC263/action/replication_record"}},"created_at":"2026-05-18T01:12:24.635125+00:00","updated_at":"2026-05-18T01:12:24.635125+00:00"}