{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OQ5SQPY7QAVCVKOWZG3L4JMHGJ","short_pith_number":"pith:OQ5SQPY7","schema_version":"1.0","canonical_sha256":"743b283f1f802a2aa9d6c9b6be2587324ac9e55b0b03951b6048441b7de7c940","source":{"kind":"arxiv","id":"1902.00488","version":3},"attestation_state":"computed","paper":{"title":"On Solving Reachability in Grid Digraphs using a Psuedoseparator","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Raghunath Tewari, Rahul Jain","submitted_at":"2019-02-01T18:22:11Z","abstract_excerpt":"The reachability problem asks to decide if there exists a path from one vertex to another in a digraph. In a grid digraph, the vertices are the points of a two-dimensional square grid, and an edge can occur between a vertex and its immediate horizontal and vertical neighbors only.\n  Asano and Doerr (CCCG'11) presented the first simultaneous time-space bound for reachability in grid digraphs by solving the problem in polynomial time and $O(n^{1/2 + \\epsilon})$ space. In 2018, the space complexity was improved to $\\tilde{O}(n^{1/3})$ by Ashida and Nakagawa (SoCG'18).\n  In this paper, we show tha"},"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":"1902.00488","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2019-02-01T18:22:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cef6294a3b30f0759a98a1adf9277df6098b5fd99694c3a32493d31ccbfc57ed","abstract_canon_sha256":"eae512d665cf78d88c2db9f9f5a1077c91fdd2de6cc7fdca7e8293378b2574de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:49.683880Z","signature_b64":"O+d6JaSLDzXWTuKVjcw99ghKmjicI8IBgPi0LWEOAd4sp0/3m7VA7S6p7HGvyZGQFd906avoPBMfHHMrUs8gDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"743b283f1f802a2aa9d6c9b6be2587324ac9e55b0b03951b6048441b7de7c940","last_reissued_at":"2026-07-05T09:55:49.683376Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:49.683376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Solving Reachability in Grid Digraphs using a Psuedoseparator","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Raghunath Tewari, Rahul Jain","submitted_at":"2019-02-01T18:22:11Z","abstract_excerpt":"The reachability problem asks to decide if there exists a path from one vertex to another in a digraph. In a grid digraph, the vertices are the points of a two-dimensional square grid, and an edge can occur between a vertex and its immediate horizontal and vertical neighbors only.\n  Asano and Doerr (CCCG'11) presented the first simultaneous time-space bound for reachability in grid digraphs by solving the problem in polynomial time and $O(n^{1/2 + \\epsilon})$ space. In 2018, the space complexity was improved to $\\tilde{O}(n^{1/3})$ by Ashida and Nakagawa (SoCG'18).\n  In this paper, we show tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00488","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.00488/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.00488","created_at":"2026-07-05T09:55:49.683437+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00488v3","created_at":"2026-07-05T09:55:49.683437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00488","created_at":"2026-07-05T09:55:49.683437+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQ5SQPY7QAVC","created_at":"2026-07-05T09:55:49.683437+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQ5SQPY7QAVCVKOW","created_at":"2026-07-05T09:55:49.683437+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQ5SQPY7","created_at":"2026-07-05T09:55:49.683437+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/OQ5SQPY7QAVCVKOWZG3L4JMHGJ","json":"https://pith.science/pith/OQ5SQPY7QAVCVKOWZG3L4JMHGJ.json","graph_json":"https://pith.science/api/pith-number/OQ5SQPY7QAVCVKOWZG3L4JMHGJ/graph.json","events_json":"https://pith.science/api/pith-number/OQ5SQPY7QAVCVKOWZG3L4JMHGJ/events.json","paper":"https://pith.science/paper/OQ5SQPY7"},"agent_actions":{"view_html":"https://pith.science/pith/OQ5SQPY7QAVCVKOWZG3L4JMHGJ","download_json":"https://pith.science/pith/OQ5SQPY7QAVCVKOWZG3L4JMHGJ.json","view_paper":"https://pith.science/paper/OQ5SQPY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00488&json=true","fetch_graph":"https://pith.science/api/pith-number/OQ5SQPY7QAVCVKOWZG3L4JMHGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/OQ5SQPY7QAVCVKOWZG3L4JMHGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQ5SQPY7QAVCVKOWZG3L4JMHGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQ5SQPY7QAVCVKOWZG3L4JMHGJ/action/storage_attestation","attest_author":"https://pith.science/pith/OQ5SQPY7QAVCVKOWZG3L4JMHGJ/action/author_attestation","sign_citation":"https://pith.science/pith/OQ5SQPY7QAVCVKOWZG3L4JMHGJ/action/citation_signature","submit_replication":"https://pith.science/pith/OQ5SQPY7QAVCVKOWZG3L4JMHGJ/action/replication_record"}},"created_at":"2026-07-05T09:55:49.683437+00:00","updated_at":"2026-07-05T09:55:49.683437+00:00"}