{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LEUCQRGV7QOV3DV3NWMJWOVLBG","short_pith_number":"pith:LEUCQRGV","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"},"canonical_sha256":"59282844d5fc1d5d8ebb6d989b3aab09b6f72b44468de4b75ebe438494e4f64b","source":{"kind":"arxiv","id":"1809.07481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07481","created_at":"2026-05-18T00:05:16Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07481v1","created_at":"2026-05-18T00:05:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07481","created_at":"2026-05-18T00:05:16Z"},{"alias_kind":"pith_short_12","alias_value":"LEUCQRGV7QOV","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LEUCQRGV7QOV3DV3","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LEUCQRGV","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LEUCQRGV7QOV3DV3NWMJWOVLBG","target":"record","payload":{"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"},"canonical_sha256":"59282844d5fc1d5d8ebb6d989b3aab09b6f72b44468de4b75ebe438494e4f64b","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"},"source_kind":"arxiv","source_id":"1809.07481","source_version":1,"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-18T00:05:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tg6PQRhzXI7GNBblkNeNKF578bm0IwfHnlpiUrAi8Uim+PcUZbTgurv57UvVEozr9qzniW5ZfzYUodaKtaIuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:28:06.802699Z"},"content_sha256":"dadfe83ffff82f1f586812ac53d567726ffd390d98babf0a7ad290aa420e06a5","schema_version":"1.0","event_id":"sha256:dadfe83ffff82f1f586812ac53d567726ffd390d98babf0a7ad290aa420e06a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LEUCQRGV7QOV3DV3NWMJWOVLBG","target":"graph","payload":{"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"},"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-18T00:05:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CaztjHWIdfRq1KSOXhMEZfBacUYjH3JAymGXL5xQPyqz/atNW2YZGPUTZGzj0C+eXF4Fxvx2Um5GVXJQnYB5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:28:06.803337Z"},"content_sha256":"7883e32d577801948fb8a7227e2c0e20025c9d348e04d669a9609ed4ad95189f","schema_version":"1.0","event_id":"sha256:7883e32d577801948fb8a7227e2c0e20025c9d348e04d669a9609ed4ad95189f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LEUCQRGV7QOV3DV3NWMJWOVLBG/bundle.json","state_url":"https://pith.science/pith/LEUCQRGV7QOV3DV3NWMJWOVLBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LEUCQRGV7QOV3DV3NWMJWOVLBG/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-20T01:28:06Z","links":{"resolver":"https://pith.science/pith/LEUCQRGV7QOV3DV3NWMJWOVLBG","bundle":"https://pith.science/pith/LEUCQRGV7QOV3DV3NWMJWOVLBG/bundle.json","state":"https://pith.science/pith/LEUCQRGV7QOV3DV3NWMJWOVLBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LEUCQRGV7QOV3DV3NWMJWOVLBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LEUCQRGV7QOV3DV3NWMJWOVLBG","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":"8f26486bb03b26d20744e6eef9dcdb01c9e844327815bf10173cb4da8757f6ba","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-20T05:28:56Z","title_canon_sha256":"f78319a7bd753b2b0ca0be8497af7cc4da146478618a6ef13f2cc5fdfb31dd8f"},"schema_version":"1.0","source":{"id":"1809.07481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07481","created_at":"2026-05-18T00:05:16Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07481v1","created_at":"2026-05-18T00:05:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07481","created_at":"2026-05-18T00:05:16Z"},{"alias_kind":"pith_short_12","alias_value":"LEUCQRGV7QOV","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LEUCQRGV7QOV3DV3","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LEUCQRGV","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:7883e32d577801948fb8a7227e2c0e20025c9d348e04d669a9609ed4ad95189f","target":"graph","created_at":"2026-05-18T00:05:16Z","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":"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","authors_text":"Haitao Wang, Sang Won Bae","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-20T05:28:56Z","title":"$L_1$ Shortest Path Queries in Simple Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07481","kind":"arxiv","version":1},"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:dadfe83ffff82f1f586812ac53d567726ffd390d98babf0a7ad290aa420e06a5","target":"record","created_at":"2026-05-18T00:05:16Z","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":"8f26486bb03b26d20744e6eef9dcdb01c9e844327815bf10173cb4da8757f6ba","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-20T05:28:56Z","title_canon_sha256":"f78319a7bd753b2b0ca0be8497af7cc4da146478618a6ef13f2cc5fdfb31dd8f"},"schema_version":"1.0","source":{"id":"1809.07481","kind":"arxiv","version":1}},"canonical_sha256":"59282844d5fc1d5d8ebb6d989b3aab09b6f72b44468de4b75ebe438494e4f64b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59282844d5fc1d5d8ebb6d989b3aab09b6f72b44468de4b75ebe438494e4f64b","first_computed_at":"2026-05-18T00:05:16.164975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:16.164975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RyXytWa9vdrHf3mzyPK38sduFfEU45hHp29Dcy9dr8hgmsrBI5e9zrX0fwiR9b36BuC6ViuwLlps/QS9ffJ0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:16.165594Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.07481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dadfe83ffff82f1f586812ac53d567726ffd390d98babf0a7ad290aa420e06a5","sha256:7883e32d577801948fb8a7227e2c0e20025c9d348e04d669a9609ed4ad95189f"],"state_sha256":"25caf73c25701b8f7e48b9f233e71b0c17578236cddd1d4e378159587a81f70f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9rZRBIdXC/PBfF+6w9SU4D32uJ+1s3TfibcNdR64uWuddw1W8H0CVeQ+q6pmvBCCpQGoqqBEL5sWOK4MRmfsDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T01:28:06.806383Z","bundle_sha256":"bb9aa12794ffbea266bef8af95e838bc941575cb90a9c36f912d364e4dec8197"}}