{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SGHHXT5NFI7RG72GEJWHUQQTNU","short_pith_number":"pith:SGHHXT5N","schema_version":"1.0","canonical_sha256":"918e7bcfad2a3f137f46226c7a42136d3f52dce9d5b72616144b8544a64560d9","source":{"kind":"arxiv","id":"2101.05235","version":2},"attestation_state":"computed","paper":{"title":"Space-Efficient Algorithms for Reachability in Geometric Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CC","authors_text":"Rahul Jain, Sujoy Bhore","submitted_at":"2021-01-13T17:57:55Z","abstract_excerpt":"The problem of graph Reachability is to decide whether there is a path from one vertex to another in a given graph. In this paper, we study the Reachability problem on three distinct graph families - intersection graphs of Jordan regions, unit contact disk graphs (penny graphs), and chordal graphs. For each of these graph families, we present space-efficient algorithms for the Reachability problem.\n  For intersection graphs of Jordan regions, we show how to obtain a \"good\" vertex separator in a space-efficient manner and use it to solve the Reachability in polynomial time and $O(m^{1/2}\\log n)"},"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":"2101.05235","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2021-01-13T17:57:55Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"daec7cefdc27c5675e09747ee0b648fac46557d020ad5baad60eeda95aad7f5b","abstract_canon_sha256":"522fb4c7758908be07f119622bc6a8c82f3eeb24bf770ade8de592f3f56a69fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:54:53.227794Z","signature_b64":"1+cdcZFjX123ozlASbOzm2Am5s33GIK3UGdoQgseGJB04RctuT3bzqDmBLxzq5dFv3l+PbGIp0MSd6bZt1idDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"918e7bcfad2a3f137f46226c7a42136d3f52dce9d5b72616144b8544a64560d9","last_reissued_at":"2026-07-05T02:54:53.227404Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:54:53.227404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space-Efficient Algorithms for Reachability in Geometric Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CC","authors_text":"Rahul Jain, Sujoy Bhore","submitted_at":"2021-01-13T17:57:55Z","abstract_excerpt":"The problem of graph Reachability is to decide whether there is a path from one vertex to another in a given graph. In this paper, we study the Reachability problem on three distinct graph families - intersection graphs of Jordan regions, unit contact disk graphs (penny graphs), and chordal graphs. For each of these graph families, we present space-efficient algorithms for the Reachability problem.\n  For intersection graphs of Jordan regions, we show how to obtain a \"good\" vertex separator in a space-efficient manner and use it to solve the Reachability in polynomial time and $O(m^{1/2}\\log n)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.05235","kind":"arxiv","version":2},"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/2101.05235/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":"2101.05235","created_at":"2026-07-05T02:54:53.227453+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.05235v2","created_at":"2026-07-05T02:54:53.227453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.05235","created_at":"2026-07-05T02:54:53.227453+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGHHXT5NFI7R","created_at":"2026-07-05T02:54:53.227453+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGHHXT5NFI7RG72G","created_at":"2026-07-05T02:54:53.227453+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGHHXT5N","created_at":"2026-07-05T02:54:53.227453+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/SGHHXT5NFI7RG72GEJWHUQQTNU","json":"https://pith.science/pith/SGHHXT5NFI7RG72GEJWHUQQTNU.json","graph_json":"https://pith.science/api/pith-number/SGHHXT5NFI7RG72GEJWHUQQTNU/graph.json","events_json":"https://pith.science/api/pith-number/SGHHXT5NFI7RG72GEJWHUQQTNU/events.json","paper":"https://pith.science/paper/SGHHXT5N"},"agent_actions":{"view_html":"https://pith.science/pith/SGHHXT5NFI7RG72GEJWHUQQTNU","download_json":"https://pith.science/pith/SGHHXT5NFI7RG72GEJWHUQQTNU.json","view_paper":"https://pith.science/paper/SGHHXT5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.05235&json=true","fetch_graph":"https://pith.science/api/pith-number/SGHHXT5NFI7RG72GEJWHUQQTNU/graph.json","fetch_events":"https://pith.science/api/pith-number/SGHHXT5NFI7RG72GEJWHUQQTNU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGHHXT5NFI7RG72GEJWHUQQTNU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGHHXT5NFI7RG72GEJWHUQQTNU/action/storage_attestation","attest_author":"https://pith.science/pith/SGHHXT5NFI7RG72GEJWHUQQTNU/action/author_attestation","sign_citation":"https://pith.science/pith/SGHHXT5NFI7RG72GEJWHUQQTNU/action/citation_signature","submit_replication":"https://pith.science/pith/SGHHXT5NFI7RG72GEJWHUQQTNU/action/replication_record"}},"created_at":"2026-07-05T02:54:53.227453+00:00","updated_at":"2026-07-05T02:54:53.227453+00:00"}