{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2B2QZ432PPSPJWU5HKCGSGSGUT","short_pith_number":"pith:2B2QZ432","schema_version":"1.0","canonical_sha256":"d0750cf37a7be4f4da9d3a84691a46a4e8c32b2b009bd8e3ca4abb1251f623fb","source":{"kind":"arxiv","id":"1501.05828","version":1},"attestation_state":"computed","paper":{"title":"An $O(n^{\\epsilon})$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Diptarka Chakraborty, Raghunath Tewari","submitted_at":"2015-01-23T15:23:25Z","abstract_excerpt":"Given a graph $G$ and two vertices $s$ and $t$ in it, {\\em graph reachability} is the problem of checking whether there exists a path from $s$ to $t$ in $G$. We show that reachability in directed layered planar graphs can be decided in polynomial time and $O(n^\\epsilon)$ space, for any $\\epsilon > 0$. The previous best known space bound for this problem with polynomial time was approximately $O(\\sqrt{n})$ space \\cite{INPVW13}.\n  Deciding graph reachability in {\\SC} is an important open question in complexity theory and in this paper we make progress towards resolving this question."},"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":"1501.05828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-23T15:23:25Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e9c7215baeea4bad3ebf8f66d6757dd8c886fcf14596151753c7887093d5f0e1","abstract_canon_sha256":"fe7f74ddd7fcd9844480384a477e10875d4e99110e718c08cd17e1197a540d38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:48.875948Z","signature_b64":"zjrcd15iXCKGHaZ1junyBvUD+Z5LxplqWDyhbP/lyHzWRdDz2e0BRoPPHXViLA9wqr5Duv481I9UQ2vElbPQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0750cf37a7be4f4da9d3a84691a46a4e8c32b2b009bd8e3ca4abb1251f623fb","last_reissued_at":"2026-05-18T02:28:48.875610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:48.875610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An $O(n^{\\epsilon})$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Diptarka Chakraborty, Raghunath Tewari","submitted_at":"2015-01-23T15:23:25Z","abstract_excerpt":"Given a graph $G$ and two vertices $s$ and $t$ in it, {\\em graph reachability} is the problem of checking whether there exists a path from $s$ to $t$ in $G$. We show that reachability in directed layered planar graphs can be decided in polynomial time and $O(n^\\epsilon)$ space, for any $\\epsilon > 0$. The previous best known space bound for this problem with polynomial time was approximately $O(\\sqrt{n})$ space \\cite{INPVW13}.\n  Deciding graph reachability in {\\SC} is an important open question in complexity theory and in this paper we make progress towards resolving this question."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05828","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":"1501.05828","created_at":"2026-05-18T02:28:48.875664+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05828v1","created_at":"2026-05-18T02:28:48.875664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05828","created_at":"2026-05-18T02:28:48.875664+00:00"},{"alias_kind":"pith_short_12","alias_value":"2B2QZ432PPSP","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2B2QZ432PPSPJWU5","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2B2QZ432","created_at":"2026-05-18T12:28:59.999130+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/2B2QZ432PPSPJWU5HKCGSGSGUT","json":"https://pith.science/pith/2B2QZ432PPSPJWU5HKCGSGSGUT.json","graph_json":"https://pith.science/api/pith-number/2B2QZ432PPSPJWU5HKCGSGSGUT/graph.json","events_json":"https://pith.science/api/pith-number/2B2QZ432PPSPJWU5HKCGSGSGUT/events.json","paper":"https://pith.science/paper/2B2QZ432"},"agent_actions":{"view_html":"https://pith.science/pith/2B2QZ432PPSPJWU5HKCGSGSGUT","download_json":"https://pith.science/pith/2B2QZ432PPSPJWU5HKCGSGSGUT.json","view_paper":"https://pith.science/paper/2B2QZ432","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05828&json=true","fetch_graph":"https://pith.science/api/pith-number/2B2QZ432PPSPJWU5HKCGSGSGUT/graph.json","fetch_events":"https://pith.science/api/pith-number/2B2QZ432PPSPJWU5HKCGSGSGUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2B2QZ432PPSPJWU5HKCGSGSGUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2B2QZ432PPSPJWU5HKCGSGSGUT/action/storage_attestation","attest_author":"https://pith.science/pith/2B2QZ432PPSPJWU5HKCGSGSGUT/action/author_attestation","sign_citation":"https://pith.science/pith/2B2QZ432PPSPJWU5HKCGSGSGUT/action/citation_signature","submit_replication":"https://pith.science/pith/2B2QZ432PPSPJWU5HKCGSGSGUT/action/replication_record"}},"created_at":"2026-05-18T02:28:48.875664+00:00","updated_at":"2026-05-18T02:28:48.875664+00:00"}