{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UBIYWET2XOCSVD4RM225L737CE","short_pith_number":"pith:UBIYWET2","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"},"canonical_sha256":"a0518b127abb852a8f9166b5d5ff7f1139402608d5c6d7586bb11461590bfa7a","source":{"kind":"arxiv","id":"1504.04690","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04690","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04690v2","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04690","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"pith_short_12","alias_value":"UBIYWET2XOCS","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UBIYWET2XOCSVD4R","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UBIYWET2","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UBIYWET2XOCSVD4RM225L737CE","target":"record","payload":{"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"},"canonical_sha256":"a0518b127abb852a8f9166b5d5ff7f1139402608d5c6d7586bb11461590bfa7a","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"},"source_kind":"arxiv","source_id":"1504.04690","source_version":2,"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:27:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7AsyX9vK8UEL5pFmvsKd9mXGloM193/U7fldwPZWgXEqCbFVJYSs9P687fBPV2XT0JOyYVAuKqgF2GeKbLriDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:41:43.447813Z"},"content_sha256":"a44cdbc99f74f41e7166c2cb17f12fda1363aa31fe11fc27953e3f1fd2f664aa","schema_version":"1.0","event_id":"sha256:a44cdbc99f74f41e7166c2cb17f12fda1363aa31fe11fc27953e3f1fd2f664aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UBIYWET2XOCSVD4RM225L737CE","target":"graph","payload":{"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"},"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:27:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1L9UhmqrhaJFmxf4qEcp690RK8sdX71rG7tE7V1be5uOnq8Dx7zylgOWIpDPpHZORF+DYkxlJMC3V0DDvjd3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:41:43.448158Z"},"content_sha256":"dc74302cfbeeef9360c4abd0298eb088fb576556baa16794ae9cae8410dbdae2","schema_version":"1.0","event_id":"sha256:dc74302cfbeeef9360c4abd0298eb088fb576556baa16794ae9cae8410dbdae2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UBIYWET2XOCSVD4RM225L737CE/bundle.json","state_url":"https://pith.science/pith/UBIYWET2XOCSVD4RM225L737CE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UBIYWET2XOCSVD4RM225L737CE/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-06-20T02:41:43Z","links":{"resolver":"https://pith.science/pith/UBIYWET2XOCSVD4RM225L737CE","bundle":"https://pith.science/pith/UBIYWET2XOCSVD4RM225L737CE/bundle.json","state":"https://pith.science/pith/UBIYWET2XOCSVD4RM225L737CE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UBIYWET2XOCSVD4RM225L737CE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UBIYWET2XOCSVD4RM225L737CE","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":"b10dab58373fe050b243ad4bede754617992b92de143075ff697e4b34937e14a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-18T07:24:00Z","title_canon_sha256":"42f3d561ef5bd866ceedfcb941cc55043adc3c264a6dc0611235672317627a78"},"schema_version":"1.0","source":{"id":"1504.04690","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04690","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04690v2","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04690","created_at":"2026-05-18T00:27:55Z"},{"alias_kind":"pith_short_12","alias_value":"UBIYWET2XOCS","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UBIYWET2XOCSVD4R","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UBIYWET2","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:dc74302cfbeeef9360c4abd0298eb088fb576556baa16794ae9cae8410dbdae2","target":"graph","created_at":"2026-05-18T00:27:55Z","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":"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","authors_text":"Eyal E. Skop, Shay Mozes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-18T07:24:00Z","title":"Efficient Vertex-Label Distance Oracles for Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04690","kind":"arxiv","version":2},"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:a44cdbc99f74f41e7166c2cb17f12fda1363aa31fe11fc27953e3f1fd2f664aa","target":"record","created_at":"2026-05-18T00:27:55Z","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":"b10dab58373fe050b243ad4bede754617992b92de143075ff697e4b34937e14a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-18T07:24:00Z","title_canon_sha256":"42f3d561ef5bd866ceedfcb941cc55043adc3c264a6dc0611235672317627a78"},"schema_version":"1.0","source":{"id":"1504.04690","kind":"arxiv","version":2}},"canonical_sha256":"a0518b127abb852a8f9166b5d5ff7f1139402608d5c6d7586bb11461590bfa7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0518b127abb852a8f9166b5d5ff7f1139402608d5c6d7586bb11461590bfa7a","first_computed_at":"2026-05-18T00:27:55.481200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:55.481200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qd1AeHOFMxYz7okmV/WA+kCa+AZRn/anv6Wq44nD7ZSQBi//UgAZl5Npzli+NNxWdq+FhOlcsem2AMg6e6u+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:55.481839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04690","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a44cdbc99f74f41e7166c2cb17f12fda1363aa31fe11fc27953e3f1fd2f664aa","sha256:dc74302cfbeeef9360c4abd0298eb088fb576556baa16794ae9cae8410dbdae2"],"state_sha256":"f209a756d2daccee2308761e366bcd16f0355fa18845428fc79d76a48e781f82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gTbQxCODSBOxqVD3Ygop4z2SJ4VGQEH7l+A2UC/EpfQum0die845b3jP8aiRhfRoILjmBDhfkrgvVX+rloLICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T02:41:43.450136Z","bundle_sha256":"8e5e37f080c60762a5867b3490905abb3b85ae0aa86486b5409027320f06a5d3"}}