{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5ZSOFRZSFPKK62ZEWLDI4S6F77","short_pith_number":"pith:5ZSOFRZS","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"},"canonical_sha256":"ee64e2c7322bd4af6b24b2c68e4bc5fff0fb189becda692d7a78d962acaf7367","source":{"kind":"arxiv","id":"1403.3458","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3458","created_at":"2026-05-18T02:56:20Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3458v1","created_at":"2026-05-18T02:56:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3458","created_at":"2026-05-18T02:56:20Z"},{"alias_kind":"pith_short_12","alias_value":"5ZSOFRZSFPKK","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5ZSOFRZSFPKK62ZE","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5ZSOFRZS","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5ZSOFRZSFPKK62ZEWLDI4S6F77","target":"record","payload":{"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"},"canonical_sha256":"ee64e2c7322bd4af6b24b2c68e4bc5fff0fb189becda692d7a78d962acaf7367","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"},"source_kind":"arxiv","source_id":"1403.3458","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-18T02:56:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4/Rpbbh3QpmqU6lSKmGwWSMSznxoYKMoC9xtAQ7uEGyTmXW/s5kaVb6ILAA943AyNEWtlHLJMYZ49/OYuQWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:30:08.484599Z"},"content_sha256":"265270b96ae780c5029837628959b6ed60e8e863dd574701e53353ee7f51f43e","schema_version":"1.0","event_id":"sha256:265270b96ae780c5029837628959b6ed60e8e863dd574701e53353ee7f51f43e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5ZSOFRZSFPKK62ZEWLDI4S6F77","target":"graph","payload":{"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"},"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-18T02:56:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ATB8de+bj3jyvjcL1yOcTDVFxL9VcYyB5WZzuyJQFzpoYS56Ae1HLfmF949tCFmcwnCIOYcwq3OupCBG1AACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:30:08.485287Z"},"content_sha256":"ffe9f30b1930534ba6511fbb81709902b0cca53e3b9a1d4cb7709555f4370d7b","schema_version":"1.0","event_id":"sha256:ffe9f30b1930534ba6511fbb81709902b0cca53e3b9a1d4cb7709555f4370d7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZSOFRZSFPKK62ZEWLDI4S6F77/bundle.json","state_url":"https://pith.science/pith/5ZSOFRZSFPKK62ZEWLDI4S6F77/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZSOFRZSFPKK62ZEWLDI4S6F77/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-27T18:30:08Z","links":{"resolver":"https://pith.science/pith/5ZSOFRZSFPKK62ZEWLDI4S6F77","bundle":"https://pith.science/pith/5ZSOFRZSFPKK62ZEWLDI4S6F77/bundle.json","state":"https://pith.science/pith/5ZSOFRZSFPKK62ZEWLDI4S6F77/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZSOFRZSFPKK62ZEWLDI4S6F77/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5ZSOFRZSFPKK62ZEWLDI4S6F77","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":"5401f32258bb5d76d666d155c7d75bab9182c91f5524ea966bb923ad1541c317","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-03-13T23:15:44Z","title_canon_sha256":"704878e12e67be5eb8e9937ea00a668a2ee1c5c4db2c8a9bfcc453dd115c31a5"},"schema_version":"1.0","source":{"id":"1403.3458","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3458","created_at":"2026-05-18T02:56:20Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3458v1","created_at":"2026-05-18T02:56:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3458","created_at":"2026-05-18T02:56:20Z"},{"alias_kind":"pith_short_12","alias_value":"5ZSOFRZSFPKK","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5ZSOFRZSFPKK62ZE","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5ZSOFRZS","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:ffe9f30b1930534ba6511fbb81709902b0cca53e3b9a1d4cb7709555f4370d7b","target":"graph","created_at":"2026-05-18T02:56:20Z","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 $\\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","authors_text":"Danny Z. Chen, Haitao Wang, Rajasekhar Inkulu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-03-13T23:15:44Z","title":"Two-Point $L_1$ Shortest Path Queries in the Plane"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3458","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:265270b96ae780c5029837628959b6ed60e8e863dd574701e53353ee7f51f43e","target":"record","created_at":"2026-05-18T02:56:20Z","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":"5401f32258bb5d76d666d155c7d75bab9182c91f5524ea966bb923ad1541c317","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-03-13T23:15:44Z","title_canon_sha256":"704878e12e67be5eb8e9937ea00a668a2ee1c5c4db2c8a9bfcc453dd115c31a5"},"schema_version":"1.0","source":{"id":"1403.3458","kind":"arxiv","version":1}},"canonical_sha256":"ee64e2c7322bd4af6b24b2c68e4bc5fff0fb189becda692d7a78d962acaf7367","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee64e2c7322bd4af6b24b2c68e4bc5fff0fb189becda692d7a78d962acaf7367","first_computed_at":"2026-05-18T02:56:20.376510Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:20.376510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qJsgvZzuDjP7u2nR6XnYpXJRspWC6w66v0/AsIHCKM4IE1PAC3lYea5V7T7UoWnKQV568h/aNeGsyeEZhOBpAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:20.377246Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.3458","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:265270b96ae780c5029837628959b6ed60e8e863dd574701e53353ee7f51f43e","sha256:ffe9f30b1930534ba6511fbb81709902b0cca53e3b9a1d4cb7709555f4370d7b"],"state_sha256":"e03b78fa05c9093581a966ac0a32bb5e17338948ccd4770f2a6a5bd4b2b5051b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"32CuqKet+Bk0PSI0PQudLy4cQAnE6KaKRuW5wibvIuy6eAUh94rEQ5HPuYLOKs+eElXfC1gwfSZeBDLhJO2FAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:30:08.488679Z","bundle_sha256":"025bbdec781f495b6177ad5e4077036ab37fee378afff1ded75afcb96a149825"}}