{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MTP72EZ6Z4ABYKF5N7C5VPHHIQ","short_pith_number":"pith:MTP72EZ6","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"},"canonical_sha256":"64dffd133ecf001c28bd6fc5dabce74421d76c25d0f2cb0f49356cd793f7b11d","source":{"kind":"arxiv","id":"1803.02979","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02979","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02979v2","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02979","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"pith_short_12","alias_value":"MTP72EZ6Z4AB","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MTP72EZ6Z4ABYKF5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MTP72EZ6","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MTP72EZ6Z4ABYKF5N7C5VPHHIQ","target":"record","payload":{"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"},"canonical_sha256":"64dffd133ecf001c28bd6fc5dabce74421d76c25d0f2cb0f49356cd793f7b11d","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"},"source_kind":"arxiv","source_id":"1803.02979","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"whXxpQ3bY0fnIS4PnFRSieXrJvU9ck0L/uPaKvs0jkZbQ8xO5x8m8UmAq5zxFkJaPeKJlfAKNpqIrq7RLSt1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:03:00.440262Z"},"content_sha256":"7abee78ee6253718a8a1378f352d0cc04a867e5a55f2ea9e0115a96526e5d400","schema_version":"1.0","event_id":"sha256:7abee78ee6253718a8a1378f352d0cc04a867e5a55f2ea9e0115a96526e5d400"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MTP72EZ6Z4ABYKF5N7C5VPHHIQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:57:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ioAnlAMglwJgEmLOaDadEJYWr5z9zmI2NRG6F0oMSyDCcGbeySWtYbuRKFxKsxRn1636P6Tyrx3SJ3hFINZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:03:00.440970Z"},"content_sha256":"e5ee820d8cc787e74275cf218042711c1087f5c8546506c14faab1db4a9589c6","schema_version":"1.0","event_id":"sha256:e5ee820d8cc787e74275cf218042711c1087f5c8546506c14faab1db4a9589c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTP72EZ6Z4ABYKF5N7C5VPHHIQ/bundle.json","state_url":"https://pith.science/pith/MTP72EZ6Z4ABYKF5N7C5VPHHIQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTP72EZ6Z4ABYKF5N7C5VPHHIQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T17:03:00Z","links":{"resolver":"https://pith.science/pith/MTP72EZ6Z4ABYKF5N7C5VPHHIQ","bundle":"https://pith.science/pith/MTP72EZ6Z4ABYKF5N7C5VPHHIQ/bundle.json","state":"https://pith.science/pith/MTP72EZ6Z4ABYKF5N7C5VPHHIQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTP72EZ6Z4ABYKF5N7C5VPHHIQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MTP72EZ6Z4ABYKF5N7C5VPHHIQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d5eca0e9ede914f2accc08868873bd65d68b53bc5a67dd31523d0f6868c713ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-08T06:03:52Z","title_canon_sha256":"089b78922fe4bd41863fe8852f7e0a0e48b5210b837b8af9a500078cfeeedeab"},"schema_version":"1.0","source":{"id":"1803.02979","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02979","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02979v2","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02979","created_at":"2026-05-17T23:57:07Z"},{"alias_kind":"pith_short_12","alias_value":"MTP72EZ6Z4AB","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MTP72EZ6Z4ABYKF5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MTP72EZ6","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:e5ee820d8cc787e74275cf218042711c1087f5c8546506c14faab1db4a9589c6","target":"graph","created_at":"2026-05-17T23:57:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andr\\'e van Renssen, Matias Korman, Prosenjit Bose, Sander Verdonschot","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-08T06:03:52Z","title":"Routing on the Visibility Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02979","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7abee78ee6253718a8a1378f352d0cc04a867e5a55f2ea9e0115a96526e5d400","target":"record","created_at":"2026-05-17T23:57:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d5eca0e9ede914f2accc08868873bd65d68b53bc5a67dd31523d0f6868c713ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-08T06:03:52Z","title_canon_sha256":"089b78922fe4bd41863fe8852f7e0a0e48b5210b837b8af9a500078cfeeedeab"},"schema_version":"1.0","source":{"id":"1803.02979","kind":"arxiv","version":2}},"canonical_sha256":"64dffd133ecf001c28bd6fc5dabce74421d76c25d0f2cb0f49356cd793f7b11d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64dffd133ecf001c28bd6fc5dabce74421d76c25d0f2cb0f49356cd793f7b11d","first_computed_at":"2026-05-17T23:57:07.647309Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:07.647309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"raiRcXOyODtTw89q2vYNEBNDCGl5B12k5NK8AXhK4QKhVfhaRTMo2Y4EOBa5YCLamJjNVw643j9oJ11aDM68BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:07.647913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02979","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7abee78ee6253718a8a1378f352d0cc04a867e5a55f2ea9e0115a96526e5d400","sha256:e5ee820d8cc787e74275cf218042711c1087f5c8546506c14faab1db4a9589c6"],"state_sha256":"a834f5b2293a2bdc770f325a9a4137abfa064fb7dca0bacae44e713753136b25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+Hi2u5lEBPEQHLVcSCXDsnHdz56WMyPzn1SC2UiLmEQhdLHzOSLbMGKb1TBTsTKpVeHLax1LRdI7cXiDtKPDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:03:00.444013Z","bundle_sha256":"d551cfd8f8ed1c59adea04647d4f5cc344342d18d71f0e4091d6a715802cd66b"}}