{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JSHZYJ6O4LGY7HNO5RLXZGLIPK","short_pith_number":"pith:JSHZYJ6O","schema_version":"1.0","canonical_sha256":"4c8f9c27cee2cd8f9daeec577c99687a9efca453a0344f39fe38f94c9c1010d2","source":{"kind":"arxiv","id":"1707.02414","version":2},"attestation_state":"computed","paper":{"title":"Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Itay Laish, Shay Mozes","submitted_at":"2017-07-08T08:22:23Z","abstract_excerpt":"Let $G$ be a graph where each vertex is associated with a label. A Vertex-Labeled Approximate Distance Oracle is a data structure that, given a vertex $v$ and a label $\\lambda$, returns a $(1+\\varepsilon)$-approximation of the distance from $v$ to the closest vertex with label $\\lambda$ in $G$. Such an oracle is dynamic if it also supports label changes. In this paper we present three different dynamic approximate vertex-labeled distance oracles for planar graphs, all with polylogarithmic query and update times, and nearly linear space requirements."},"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":"1707.02414","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-08T08:22:23Z","cross_cats_sorted":[],"title_canon_sha256":"7bb05aa08b15f836be09c81f5e12c19a8866e4f0a604f4ab6fd6de9bba10d279","abstract_canon_sha256":"c228f4475e41b3d7f6d684c32aabe615e8bdc849eaadf94a03142ea68165a73b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:38.279194Z","signature_b64":"qYuIs5v5x14t7XOaF1g91P/DQG+103MD5Qdtg8mHc547UrbAYWgsqj3XMwUhnRiJykIqNFkSGsKs0AA5zQLSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c8f9c27cee2cd8f9daeec577c99687a9efca453a0344f39fe38f94c9c1010d2","last_reissued_at":"2026-05-18T00:36:38.278573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:38.278573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Itay Laish, Shay Mozes","submitted_at":"2017-07-08T08:22:23Z","abstract_excerpt":"Let $G$ be a graph where each vertex is associated with a label. A Vertex-Labeled Approximate Distance Oracle is a data structure that, given a vertex $v$ and a label $\\lambda$, returns a $(1+\\varepsilon)$-approximation of the distance from $v$ to the closest vertex with label $\\lambda$ in $G$. Such an oracle is dynamic if it also supports label changes. In this paper we present three different dynamic approximate vertex-labeled distance oracles for planar graphs, all with polylogarithmic query and update times, and nearly linear space requirements."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02414","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.02414","created_at":"2026-05-18T00:36:38.278663+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02414v2","created_at":"2026-05-18T00:36:38.278663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02414","created_at":"2026-05-18T00:36:38.278663+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSHZYJ6O4LGY","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSHZYJ6O4LGY7HNO","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSHZYJ6O","created_at":"2026-05-18T12:31:24.725408+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/JSHZYJ6O4LGY7HNO5RLXZGLIPK","json":"https://pith.science/pith/JSHZYJ6O4LGY7HNO5RLXZGLIPK.json","graph_json":"https://pith.science/api/pith-number/JSHZYJ6O4LGY7HNO5RLXZGLIPK/graph.json","events_json":"https://pith.science/api/pith-number/JSHZYJ6O4LGY7HNO5RLXZGLIPK/events.json","paper":"https://pith.science/paper/JSHZYJ6O"},"agent_actions":{"view_html":"https://pith.science/pith/JSHZYJ6O4LGY7HNO5RLXZGLIPK","download_json":"https://pith.science/pith/JSHZYJ6O4LGY7HNO5RLXZGLIPK.json","view_paper":"https://pith.science/paper/JSHZYJ6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02414&json=true","fetch_graph":"https://pith.science/api/pith-number/JSHZYJ6O4LGY7HNO5RLXZGLIPK/graph.json","fetch_events":"https://pith.science/api/pith-number/JSHZYJ6O4LGY7HNO5RLXZGLIPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSHZYJ6O4LGY7HNO5RLXZGLIPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSHZYJ6O4LGY7HNO5RLXZGLIPK/action/storage_attestation","attest_author":"https://pith.science/pith/JSHZYJ6O4LGY7HNO5RLXZGLIPK/action/author_attestation","sign_citation":"https://pith.science/pith/JSHZYJ6O4LGY7HNO5RLXZGLIPK/action/citation_signature","submit_replication":"https://pith.science/pith/JSHZYJ6O4LGY7HNO5RLXZGLIPK/action/replication_record"}},"created_at":"2026-05-18T00:36:38.278663+00:00","updated_at":"2026-05-18T00:36:38.278663+00:00"}