{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UBIYWET2XOCSVD4RM225L737CE","short_pith_number":"pith:UBIYWET2","schema_version":"1.0","canonical_sha256":"a0518b127abb852a8f9166b5d5ff7f1139402608d5c6d7586bb11461590bfa7a","source":{"kind":"arxiv","id":"1504.04690","version":2},"attestation_state":"computed","paper":{"title":"Efficient Vertex-Label Distance Oracles for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eyal E. Skop, Shay Mozes","submitted_at":"2015-04-18T07:24:00Z","abstract_excerpt":"We consider distance queries in vertex-labeled planar graphs. For any fixed $0 < \\epsilon \\leq 1/2$ we show how to preprocess a directed planar graph with vertex labels and arc lengths into a data structure that answers queries of the following form. Given a vertex $u$ and a label $\\lambda$ return a $(1+\\epsilon)$-approximation of the distance from $u$ to its closest vertex with label $\\lambda$. For a directed planar graph with $n$ vertices, such that the ratio of the largest to smallest arc length is bounded by $N$, the preprocessing time is $O(\\epsilon^{-2}n\\lg^{3}{n}\\lg(nN))$, the data stru"},"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":"1504.04690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-18T07:24:00Z","cross_cats_sorted":[],"title_canon_sha256":"42f3d561ef5bd866ceedfcb941cc55043adc3c264a6dc0611235672317627a78","abstract_canon_sha256":"b10dab58373fe050b243ad4bede754617992b92de143075ff697e4b34937e14a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:55.481839Z","signature_b64":"Qd1AeHOFMxYz7okmV/WA+kCa+AZRn/anv6Wq44nD7ZSQBi//UgAZl5Npzli+NNxWdq+FhOlcsem2AMg6e6u+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0518b127abb852a8f9166b5d5ff7f1139402608d5c6d7586bb11461590bfa7a","last_reissued_at":"2026-05-18T00:27:55.481200Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:55.481200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Vertex-Label Distance Oracles for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eyal E. Skop, Shay Mozes","submitted_at":"2015-04-18T07:24:00Z","abstract_excerpt":"We consider distance queries in vertex-labeled planar graphs. For any fixed $0 < \\epsilon \\leq 1/2$ we show how to preprocess a directed planar graph with vertex labels and arc lengths into a data structure that answers queries of the following form. Given a vertex $u$ and a label $\\lambda$ return a $(1+\\epsilon)$-approximation of the distance from $u$ to its closest vertex with label $\\lambda$. For a directed planar graph with $n$ vertices, such that the ratio of the largest to smallest arc length is bounded by $N$, the preprocessing time is $O(\\epsilon^{-2}n\\lg^{3}{n}\\lg(nN))$, the data stru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04690","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":"1504.04690","created_at":"2026-05-18T00:27:55.481295+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04690v2","created_at":"2026-05-18T00:27:55.481295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04690","created_at":"2026-05-18T00:27:55.481295+00:00"},{"alias_kind":"pith_short_12","alias_value":"UBIYWET2XOCS","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UBIYWET2XOCSVD4R","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UBIYWET2","created_at":"2026-05-18T12:29:44.643036+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/UBIYWET2XOCSVD4RM225L737CE","json":"https://pith.science/pith/UBIYWET2XOCSVD4RM225L737CE.json","graph_json":"https://pith.science/api/pith-number/UBIYWET2XOCSVD4RM225L737CE/graph.json","events_json":"https://pith.science/api/pith-number/UBIYWET2XOCSVD4RM225L737CE/events.json","paper":"https://pith.science/paper/UBIYWET2"},"agent_actions":{"view_html":"https://pith.science/pith/UBIYWET2XOCSVD4RM225L737CE","download_json":"https://pith.science/pith/UBIYWET2XOCSVD4RM225L737CE.json","view_paper":"https://pith.science/paper/UBIYWET2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04690&json=true","fetch_graph":"https://pith.science/api/pith-number/UBIYWET2XOCSVD4RM225L737CE/graph.json","fetch_events":"https://pith.science/api/pith-number/UBIYWET2XOCSVD4RM225L737CE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UBIYWET2XOCSVD4RM225L737CE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UBIYWET2XOCSVD4RM225L737CE/action/storage_attestation","attest_author":"https://pith.science/pith/UBIYWET2XOCSVD4RM225L737CE/action/author_attestation","sign_citation":"https://pith.science/pith/UBIYWET2XOCSVD4RM225L737CE/action/citation_signature","submit_replication":"https://pith.science/pith/UBIYWET2XOCSVD4RM225L737CE/action/replication_record"}},"created_at":"2026-05-18T00:27:55.481295+00:00","updated_at":"2026-05-18T00:27:55.481295+00:00"}