{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JSHZYJ6O4LGY7HNO5RLXZGLIPK","short_pith_number":"pith:JSHZYJ6O","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"},"canonical_sha256":"4c8f9c27cee2cd8f9daeec577c99687a9efca453a0344f39fe38f94c9c1010d2","source":{"kind":"arxiv","id":"1707.02414","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02414","created_at":"2026-05-18T00:36:38Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02414v2","created_at":"2026-05-18T00:36:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02414","created_at":"2026-05-18T00:36:38Z"},{"alias_kind":"pith_short_12","alias_value":"JSHZYJ6O4LGY","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JSHZYJ6O4LGY7HNO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JSHZYJ6O","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JSHZYJ6O4LGY7HNO5RLXZGLIPK","target":"record","payload":{"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"},"canonical_sha256":"4c8f9c27cee2cd8f9daeec577c99687a9efca453a0344f39fe38f94c9c1010d2","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"},"source_kind":"arxiv","source_id":"1707.02414","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:36:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9IhqxmfBTW7CPImKlQ5axOwRIFTkDvFC7bTI6KTy9YS+J5B1Cf/9ix9D9BqBTaTZGiTsviDx6xrcQKdtsppmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:42:20.757685Z"},"content_sha256":"6b774c2942a2298cba2e40c0a6427010255d91f0a7e20cc2418c6368b62ca20d","schema_version":"1.0","event_id":"sha256:6b774c2942a2298cba2e40c0a6427010255d91f0a7e20cc2418c6368b62ca20d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JSHZYJ6O4LGY7HNO5RLXZGLIPK","target":"graph","payload":{"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"},"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:36:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lyy0Ol9AwETPk3heFZfR2XTy8Vw6bFoXtR+5pL4rhnUJtbb9tYcu6a8nUYku6FSc8pMBJxEKoa64tlrf3l3qBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:42:20.758030Z"},"content_sha256":"40a8c92a6bf47c543afbec5c290478ebc911ab8bc0ba083c36775ccc24be5918","schema_version":"1.0","event_id":"sha256:40a8c92a6bf47c543afbec5c290478ebc911ab8bc0ba083c36775ccc24be5918"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JSHZYJ6O4LGY7HNO5RLXZGLIPK/bundle.json","state_url":"https://pith.science/pith/JSHZYJ6O4LGY7HNO5RLXZGLIPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JSHZYJ6O4LGY7HNO5RLXZGLIPK/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-01T18:42:20Z","links":{"resolver":"https://pith.science/pith/JSHZYJ6O4LGY7HNO5RLXZGLIPK","bundle":"https://pith.science/pith/JSHZYJ6O4LGY7HNO5RLXZGLIPK/bundle.json","state":"https://pith.science/pith/JSHZYJ6O4LGY7HNO5RLXZGLIPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JSHZYJ6O4LGY7HNO5RLXZGLIPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JSHZYJ6O4LGY7HNO5RLXZGLIPK","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":"c228f4475e41b3d7f6d684c32aabe615e8bdc849eaadf94a03142ea68165a73b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-08T08:22:23Z","title_canon_sha256":"7bb05aa08b15f836be09c81f5e12c19a8866e4f0a604f4ab6fd6de9bba10d279"},"schema_version":"1.0","source":{"id":"1707.02414","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02414","created_at":"2026-05-18T00:36:38Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02414v2","created_at":"2026-05-18T00:36:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02414","created_at":"2026-05-18T00:36:38Z"},{"alias_kind":"pith_short_12","alias_value":"JSHZYJ6O4LGY","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JSHZYJ6O4LGY7HNO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JSHZYJ6O","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:40a8c92a6bf47c543afbec5c290478ebc911ab8bc0ba083c36775ccc24be5918","target":"graph","created_at":"2026-05-18T00:36:38Z","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 $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.","authors_text":"Itay Laish, Shay Mozes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-08T08:22:23Z","title":"Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02414","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:6b774c2942a2298cba2e40c0a6427010255d91f0a7e20cc2418c6368b62ca20d","target":"record","created_at":"2026-05-18T00:36:38Z","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":"c228f4475e41b3d7f6d684c32aabe615e8bdc849eaadf94a03142ea68165a73b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-08T08:22:23Z","title_canon_sha256":"7bb05aa08b15f836be09c81f5e12c19a8866e4f0a604f4ab6fd6de9bba10d279"},"schema_version":"1.0","source":{"id":"1707.02414","kind":"arxiv","version":2}},"canonical_sha256":"4c8f9c27cee2cd8f9daeec577c99687a9efca453a0344f39fe38f94c9c1010d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c8f9c27cee2cd8f9daeec577c99687a9efca453a0344f39fe38f94c9c1010d2","first_computed_at":"2026-05-18T00:36:38.278573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:38.278573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qYuIs5v5x14t7XOaF1g91P/DQG+103MD5Qdtg8mHc547UrbAYWgsqj3XMwUhnRiJykIqNFkSGsKs0AA5zQLSCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:38.279194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02414","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b774c2942a2298cba2e40c0a6427010255d91f0a7e20cc2418c6368b62ca20d","sha256:40a8c92a6bf47c543afbec5c290478ebc911ab8bc0ba083c36775ccc24be5918"],"state_sha256":"ad50661e5fd3f26c8c8befcfe0763796bafc9bfde84173833609ece586b3e059"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9psYAMf+b+/sztNOs2P5sNIWXxLMMotYRyL4xeB6PhCu9e1KZcLK1n2+uYG5bRpR2hBus4KltsO48NwY+jOWDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:42:20.760012Z","bundle_sha256":"c2e882fa866ffc7eb561ac31d47982c2fbbbaa2be378522f7eb7255f9cd2dc63"}}