{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:S4BQFR42AFTNJKOR556IFJULF4","short_pith_number":"pith:S4BQFR42","canonical_record":{"source":{"id":"1807.03721","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T15:46:41Z","cross_cats_sorted":[],"title_canon_sha256":"b669d2651031fececb771cc23a94f91bc0c7011009ccf23d9ad31daa9aa28771","abstract_canon_sha256":"f6248e456eb77629766a03559a306aae3f4cb949d26edb2c58bfc16157aa5521"},"schema_version":"1.0"},"canonical_sha256":"970302c79a0166d4a9d1ef7c82a68b2f2f65e6264a0de93e3ddf84c1c8e7f0cd","source":{"kind":"arxiv","id":"1807.03721","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03721","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03721v1","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03721","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"pith_short_12","alias_value":"S4BQFR42AFTN","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S4BQFR42AFTNJKOR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S4BQFR42","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:S4BQFR42AFTNJKOR556IFJULF4","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03721","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T15:46:41Z","cross_cats_sorted":[],"title_canon_sha256":"b669d2651031fececb771cc23a94f91bc0c7011009ccf23d9ad31daa9aa28771","abstract_canon_sha256":"f6248e456eb77629766a03559a306aae3f4cb949d26edb2c58bfc16157aa5521"},"schema_version":"1.0"},"canonical_sha256":"970302c79a0166d4a9d1ef7c82a68b2f2f65e6264a0de93e3ddf84c1c8e7f0cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:33.750745Z","signature_b64":"F++BjrtmiSMORNlrQTX25gNtb5K/d89YcUGY6ftaso5pSSH9f9i1RCMLZpGDGjDaixY9tnr4sqxcqHuufs35BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"970302c79a0166d4a9d1ef7c82a68b2f2f65e6264a0de93e3ddf84c1c8e7f0cd","last_reissued_at":"2026-05-17T23:56:33.750179Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:33.750179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03721","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-17T23:56:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q0R3narAaOFGQxhop5WJ+Rut0mFHdSKJM1UhKOpnH8CFWAQ2qaN9VjvpiMXKUbJKjiXkEOGXqTf5fUbF9DufAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:46:03.656507Z"},"content_sha256":"1af7e75134d40c4bfa42afede804c70ebe451b3ae1a02eeca8094f58a167dfeb","schema_version":"1.0","event_id":"sha256:1af7e75134d40c4bfa42afede804c70ebe451b3ae1a02eeca8094f58a167dfeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:S4BQFR42AFTNJKOR556IFJULF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the complexity of the (approximate) nearest colored node problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Maximilian Probst","submitted_at":"2018-07-10T15:46:41Z","abstract_excerpt":"Given a graph $G=(V,E)$ where each vertex is assigned a color from the set $C=\\{c_1, c_2, .., c_\\sigma\\}$. In the (approximate) nearest colored node problem, we want to query, given $v \\in V$ and $c \\in C$, for the (approximate) distance $\\widehat{\\mathbf{dist}}(v, c)$ from $v$ to the nearest node of color $c$. For any integer $1 \\leq k \\leq \\log n$, we present a Color Distance Oracle (also often referred to as Vertex-label Distance Oracle) of stretch $4k-5$ using space $O(kn\\sigma^{1/k})$ and query time $O(\\log{k})$. This improves the query time from $O(k)$ to $O(\\log{k})$ over the best known"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03721","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-17T23:56:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cB3NJ9VfJo25WiPjPR3XbFgwauOxa3zwo4LVpYMWpyQ9dbFBmrGBDCkYXBTlW5d5lw77T/5tXiB/cAssPqEtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:46:03.656880Z"},"content_sha256":"7fb76ea2a943c8624d0c3ac1ecbadb154e83e82bc720fa458475776895ea9d1b","schema_version":"1.0","event_id":"sha256:7fb76ea2a943c8624d0c3ac1ecbadb154e83e82bc720fa458475776895ea9d1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4BQFR42AFTNJKOR556IFJULF4/bundle.json","state_url":"https://pith.science/pith/S4BQFR42AFTNJKOR556IFJULF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4BQFR42AFTNJKOR556IFJULF4/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-06T02:46:03Z","links":{"resolver":"https://pith.science/pith/S4BQFR42AFTNJKOR556IFJULF4","bundle":"https://pith.science/pith/S4BQFR42AFTNJKOR556IFJULF4/bundle.json","state":"https://pith.science/pith/S4BQFR42AFTNJKOR556IFJULF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4BQFR42AFTNJKOR556IFJULF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S4BQFR42AFTNJKOR556IFJULF4","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":"f6248e456eb77629766a03559a306aae3f4cb949d26edb2c58bfc16157aa5521","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T15:46:41Z","title_canon_sha256":"b669d2651031fececb771cc23a94f91bc0c7011009ccf23d9ad31daa9aa28771"},"schema_version":"1.0","source":{"id":"1807.03721","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03721","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03721v1","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03721","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"pith_short_12","alias_value":"S4BQFR42AFTN","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S4BQFR42AFTNJKOR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S4BQFR42","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:7fb76ea2a943c8624d0c3ac1ecbadb154e83e82bc720fa458475776895ea9d1b","target":"graph","created_at":"2026-05-17T23:56:33Z","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":"Given a graph $G=(V,E)$ where each vertex is assigned a color from the set $C=\\{c_1, c_2, .., c_\\sigma\\}$. In the (approximate) nearest colored node problem, we want to query, given $v \\in V$ and $c \\in C$, for the (approximate) distance $\\widehat{\\mathbf{dist}}(v, c)$ from $v$ to the nearest node of color $c$. For any integer $1 \\leq k \\leq \\log n$, we present a Color Distance Oracle (also often referred to as Vertex-label Distance Oracle) of stretch $4k-5$ using space $O(kn\\sigma^{1/k})$ and query time $O(\\log{k})$. This improves the query time from $O(k)$ to $O(\\log{k})$ over the best known","authors_text":"Maximilian Probst","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T15:46:41Z","title":"On the complexity of the (approximate) nearest colored node problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03721","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:1af7e75134d40c4bfa42afede804c70ebe451b3ae1a02eeca8094f58a167dfeb","target":"record","created_at":"2026-05-17T23:56:33Z","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":"f6248e456eb77629766a03559a306aae3f4cb949d26edb2c58bfc16157aa5521","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T15:46:41Z","title_canon_sha256":"b669d2651031fececb771cc23a94f91bc0c7011009ccf23d9ad31daa9aa28771"},"schema_version":"1.0","source":{"id":"1807.03721","kind":"arxiv","version":1}},"canonical_sha256":"970302c79a0166d4a9d1ef7c82a68b2f2f65e6264a0de93e3ddf84c1c8e7f0cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"970302c79a0166d4a9d1ef7c82a68b2f2f65e6264a0de93e3ddf84c1c8e7f0cd","first_computed_at":"2026-05-17T23:56:33.750179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:33.750179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F++BjrtmiSMORNlrQTX25gNtb5K/d89YcUGY6ftaso5pSSH9f9i1RCMLZpGDGjDaixY9tnr4sqxcqHuufs35BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:33.750745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03721","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1af7e75134d40c4bfa42afede804c70ebe451b3ae1a02eeca8094f58a167dfeb","sha256:7fb76ea2a943c8624d0c3ac1ecbadb154e83e82bc720fa458475776895ea9d1b"],"state_sha256":"ba3b17d392aa3937afd9186237b0ad0cb686017b0a7e2311fe1de3b4c595c69e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kthVpXUHvEb+xbBJ1QZgTy/QupMnyFPjFLQfhyeUp9ixNWPA1QFslFevqQ5e9Az6E9HJEfKc84siNxqiqj/ZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T02:46:03.660530Z","bundle_sha256":"6c14f1f890e52f47d2bbb1c438c134bb66ce6293710c478e84a11afbbeda15c9"}}