{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5ZSOFRZSFPKK62ZEWLDI4S6F77","short_pith_number":"pith:5ZSOFRZS","schema_version":"1.0","canonical_sha256":"ee64e2c7322bd4af6b24b2c68e4bc5fff0fb189becda692d7a78d962acaf7367","source":{"kind":"arxiv","id":"1403.3458","version":1},"attestation_state":"computed","paper":{"title":"Two-Point $L_1$ Shortest Path Queries in the Plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Danny Z. Chen, Haitao Wang, Rajasekhar Inkulu","submitted_at":"2014-03-13T23:15:44Z","abstract_excerpt":"Let $\\mathcal{P}$ be a set of $h$ pairwise-disjoint polygonal obstacles with a total of $n$ vertices in the plane. We consider the problem of building a data structure that can quickly compute an $L_1$ shortest obstacle-avoiding path between any two query points $s$ and $t$. Previously, a data structure of size $O(n^2\\log n)$ was constructed in $O(n^2\\log^2 n)$ time that answers each two-point query in $O(\\log^2 n+k)$ time, i.e., the shortest path length is reported in $O(\\log^2 n)$ time and an actual path is reported in additional $O(k)$ time, where $k$ is the number of edges of the output pa"},"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":"1403.3458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-03-13T23:15:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"704878e12e67be5eb8e9937ea00a668a2ee1c5c4db2c8a9bfcc453dd115c31a5","abstract_canon_sha256":"5401f32258bb5d76d666d155c7d75bab9182c91f5524ea966bb923ad1541c317"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:20.377246Z","signature_b64":"qJsgvZzuDjP7u2nR6XnYpXJRspWC6w66v0/AsIHCKM4IE1PAC3lYea5V7T7UoWnKQV568h/aNeGsyeEZhOBpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee64e2c7322bd4af6b24b2c68e4bc5fff0fb189becda692d7a78d962acaf7367","last_reissued_at":"2026-05-18T02:56:20.376510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:20.376510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Point $L_1$ Shortest Path Queries in the Plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Danny Z. Chen, Haitao Wang, Rajasekhar Inkulu","submitted_at":"2014-03-13T23:15:44Z","abstract_excerpt":"Let $\\mathcal{P}$ be a set of $h$ pairwise-disjoint polygonal obstacles with a total of $n$ vertices in the plane. We consider the problem of building a data structure that can quickly compute an $L_1$ shortest obstacle-avoiding path between any two query points $s$ and $t$. Previously, a data structure of size $O(n^2\\log n)$ was constructed in $O(n^2\\log^2 n)$ time that answers each two-point query in $O(\\log^2 n+k)$ time, i.e., the shortest path length is reported in $O(\\log^2 n)$ time and an actual path is reported in additional $O(k)$ time, where $k$ is the number of edges of the output pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3458","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":"1403.3458","created_at":"2026-05-18T02:56:20.376612+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.3458v1","created_at":"2026-05-18T02:56:20.376612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3458","created_at":"2026-05-18T02:56:20.376612+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZSOFRZSFPKK","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZSOFRZSFPKK62ZE","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZSOFRZS","created_at":"2026-05-18T12:28:16.859392+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/5ZSOFRZSFPKK62ZEWLDI4S6F77","json":"https://pith.science/pith/5ZSOFRZSFPKK62ZEWLDI4S6F77.json","graph_json":"https://pith.science/api/pith-number/5ZSOFRZSFPKK62ZEWLDI4S6F77/graph.json","events_json":"https://pith.science/api/pith-number/5ZSOFRZSFPKK62ZEWLDI4S6F77/events.json","paper":"https://pith.science/paper/5ZSOFRZS"},"agent_actions":{"view_html":"https://pith.science/pith/5ZSOFRZSFPKK62ZEWLDI4S6F77","download_json":"https://pith.science/pith/5ZSOFRZSFPKK62ZEWLDI4S6F77.json","view_paper":"https://pith.science/paper/5ZSOFRZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.3458&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZSOFRZSFPKK62ZEWLDI4S6F77/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZSOFRZSFPKK62ZEWLDI4S6F77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZSOFRZSFPKK62ZEWLDI4S6F77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZSOFRZSFPKK62ZEWLDI4S6F77/action/storage_attestation","attest_author":"https://pith.science/pith/5ZSOFRZSFPKK62ZEWLDI4S6F77/action/author_attestation","sign_citation":"https://pith.science/pith/5ZSOFRZSFPKK62ZEWLDI4S6F77/action/citation_signature","submit_replication":"https://pith.science/pith/5ZSOFRZSFPKK62ZEWLDI4S6F77/action/replication_record"}},"created_at":"2026-05-18T02:56:20.376612+00:00","updated_at":"2026-05-18T02:56:20.376612+00:00"}