{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MTP72EZ6Z4ABYKF5N7C5VPHHIQ","short_pith_number":"pith:MTP72EZ6","schema_version":"1.0","canonical_sha256":"64dffd133ecf001c28bd6fc5dabce74421d76c25d0f2cb0f49356cd793f7b11d","source":{"kind":"arxiv","id":"1803.02979","version":2},"attestation_state":"computed","paper":{"title":"Routing on the Visibility Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e van Renssen, Matias Korman, Prosenjit Bose, Sander Verdonschot","submitted_at":"2018-03-08T06:03:52Z","abstract_excerpt":"We consider the problem of routing on a network in the presence of line segment constraints (i.e., obstacles that edges in our network are not allowed to cross). Let $P$ be a set of $n$ points in the plane and let $S$ be a set of non-crossing line segments whose endpoints are in $P$. We present two deterministic 1-local $O(1)$-memory routing algorithms that are guaranteed to find a path of at most linear size between any pair of vertices of the \\emph{visibility graph} of $P$ with respect to a set of constraints $S$ (i.e., the algorithms never look beyond the direct neighbours of the current lo"},"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.02979","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-08T06:03:52Z","cross_cats_sorted":[],"title_canon_sha256":"089b78922fe4bd41863fe8852f7e0a0e48b5210b837b8af9a500078cfeeedeab","abstract_canon_sha256":"d5eca0e9ede914f2accc08868873bd65d68b53bc5a67dd31523d0f6868c713ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:07.647913Z","signature_b64":"raiRcXOyODtTw89q2vYNEBNDCGl5B12k5NK8AXhK4QKhVfhaRTMo2Y4EOBa5YCLamJjNVw643j9oJ11aDM68BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64dffd133ecf001c28bd6fc5dabce74421d76c25d0f2cb0f49356cd793f7b11d","last_reissued_at":"2026-05-17T23:57:07.647309Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:07.647309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Routing on the Visibility Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e van Renssen, Matias Korman, Prosenjit Bose, Sander Verdonschot","submitted_at":"2018-03-08T06:03:52Z","abstract_excerpt":"We consider the problem of routing on a network in the presence of line segment constraints (i.e., obstacles that edges in our network are not allowed to cross). Let $P$ be a set of $n$ points in the plane and let $S$ be a set of non-crossing line segments whose endpoints are in $P$. We present two deterministic 1-local $O(1)$-memory routing algorithms that are guaranteed to find a path of at most linear size between any pair of vertices of the \\emph{visibility graph} of $P$ with respect to a set of constraints $S$ (i.e., the algorithms never look beyond the direct neighbours of the current lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02979","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":""},"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.02979","created_at":"2026-05-17T23:57:07.647436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.02979v2","created_at":"2026-05-17T23:57:07.647436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02979","created_at":"2026-05-17T23:57:07.647436+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTP72EZ6Z4AB","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTP72EZ6Z4ABYKF5","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTP72EZ6","created_at":"2026-05-18T12:32:40.477152+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/MTP72EZ6Z4ABYKF5N7C5VPHHIQ","json":"https://pith.science/pith/MTP72EZ6Z4ABYKF5N7C5VPHHIQ.json","graph_json":"https://pith.science/api/pith-number/MTP72EZ6Z4ABYKF5N7C5VPHHIQ/graph.json","events_json":"https://pith.science/api/pith-number/MTP72EZ6Z4ABYKF5N7C5VPHHIQ/events.json","paper":"https://pith.science/paper/MTP72EZ6"},"agent_actions":{"view_html":"https://pith.science/pith/MTP72EZ6Z4ABYKF5N7C5VPHHIQ","download_json":"https://pith.science/pith/MTP72EZ6Z4ABYKF5N7C5VPHHIQ.json","view_paper":"https://pith.science/paper/MTP72EZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.02979&json=true","fetch_graph":"https://pith.science/api/pith-number/MTP72EZ6Z4ABYKF5N7C5VPHHIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/MTP72EZ6Z4ABYKF5N7C5VPHHIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTP72EZ6Z4ABYKF5N7C5VPHHIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTP72EZ6Z4ABYKF5N7C5VPHHIQ/action/storage_attestation","attest_author":"https://pith.science/pith/MTP72EZ6Z4ABYKF5N7C5VPHHIQ/action/author_attestation","sign_citation":"https://pith.science/pith/MTP72EZ6Z4ABYKF5N7C5VPHHIQ/action/citation_signature","submit_replication":"https://pith.science/pith/MTP72EZ6Z4ABYKF5N7C5VPHHIQ/action/replication_record"}},"created_at":"2026-05-17T23:57:07.647436+00:00","updated_at":"2026-05-17T23:57:07.647436+00:00"}