{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LEUCQRGV7QOV3DV3NWMJWOVLBG","short_pith_number":"pith:LEUCQRGV","schema_version":"1.0","canonical_sha256":"59282844d5fc1d5d8ebb6d989b3aab09b6f72b44468de4b75ebe438494e4f64b","source":{"kind":"arxiv","id":"1809.07481","version":1},"attestation_state":"computed","paper":{"title":"$L_1$ Shortest Path Queries in Simple Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haitao Wang, Sang Won Bae","submitted_at":"2018-09-20T05:28:56Z","abstract_excerpt":"Let $P$ be a simple polygon of $n$ vertices. We consider two-point $L_1$ shortest path queries in $P$. We build a data structure of $O(n)$ size in $O(n)$ time such that given any two query points $s$ and $t$, the length of an $L_1$ shortest path from $s$ to $t$ in $P$ can be computed in $O(\\log n)$ time, or in $O(1)$ time if both $s$ and $t$ are vertices of $P$, and an actual shortest path can be output in additional linear time in the number of edges of the path. To achieve the result, we propose a mountain decomposition of simple polygons, which may be interesting in its own right. Most impo"},"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":"1809.07481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-20T05:28:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f78319a7bd753b2b0ca0be8497af7cc4da146478618a6ef13f2cc5fdfb31dd8f","abstract_canon_sha256":"8f26486bb03b26d20744e6eef9dcdb01c9e844327815bf10173cb4da8757f6ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:16.165594Z","signature_b64":"RyXytWa9vdrHf3mzyPK38sduFfEU45hHp29Dcy9dr8hgmsrBI5e9zrX0fwiR9b36BuC6ViuwLlps/QS9ffJ0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59282844d5fc1d5d8ebb6d989b3aab09b6f72b44468de4b75ebe438494e4f64b","last_reissued_at":"2026-05-18T00:05:16.164975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:16.164975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$L_1$ Shortest Path Queries in Simple Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Haitao Wang, Sang Won Bae","submitted_at":"2018-09-20T05:28:56Z","abstract_excerpt":"Let $P$ be a simple polygon of $n$ vertices. We consider two-point $L_1$ shortest path queries in $P$. We build a data structure of $O(n)$ size in $O(n)$ time such that given any two query points $s$ and $t$, the length of an $L_1$ shortest path from $s$ to $t$ in $P$ can be computed in $O(\\log n)$ time, or in $O(1)$ time if both $s$ and $t$ are vertices of $P$, and an actual shortest path can be output in additional linear time in the number of edges of the path. To achieve the result, we propose a mountain decomposition of simple polygons, which may be interesting in its own right. Most impo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07481","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":"1809.07481","created_at":"2026-05-18T00:05:16.165065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.07481v1","created_at":"2026-05-18T00:05:16.165065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07481","created_at":"2026-05-18T00:05:16.165065+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEUCQRGV7QOV","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEUCQRGV7QOV3DV3","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEUCQRGV","created_at":"2026-05-18T12:32:37.024351+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/LEUCQRGV7QOV3DV3NWMJWOVLBG","json":"https://pith.science/pith/LEUCQRGV7QOV3DV3NWMJWOVLBG.json","graph_json":"https://pith.science/api/pith-number/LEUCQRGV7QOV3DV3NWMJWOVLBG/graph.json","events_json":"https://pith.science/api/pith-number/LEUCQRGV7QOV3DV3NWMJWOVLBG/events.json","paper":"https://pith.science/paper/LEUCQRGV"},"agent_actions":{"view_html":"https://pith.science/pith/LEUCQRGV7QOV3DV3NWMJWOVLBG","download_json":"https://pith.science/pith/LEUCQRGV7QOV3DV3NWMJWOVLBG.json","view_paper":"https://pith.science/paper/LEUCQRGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.07481&json=true","fetch_graph":"https://pith.science/api/pith-number/LEUCQRGV7QOV3DV3NWMJWOVLBG/graph.json","fetch_events":"https://pith.science/api/pith-number/LEUCQRGV7QOV3DV3NWMJWOVLBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEUCQRGV7QOV3DV3NWMJWOVLBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEUCQRGV7QOV3DV3NWMJWOVLBG/action/storage_attestation","attest_author":"https://pith.science/pith/LEUCQRGV7QOV3DV3NWMJWOVLBG/action/author_attestation","sign_citation":"https://pith.science/pith/LEUCQRGV7QOV3DV3NWMJWOVLBG/action/citation_signature","submit_replication":"https://pith.science/pith/LEUCQRGV7QOV3DV3NWMJWOVLBG/action/replication_record"}},"created_at":"2026-05-18T00:05:16.165065+00:00","updated_at":"2026-05-18T00:05:16.165065+00:00"}