{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S4BQFR42AFTNJKOR556IFJULF4","short_pith_number":"pith:S4BQFR42","schema_version":"1.0","canonical_sha256":"970302c79a0166d4a9d1ef7c82a68b2f2f65e6264a0de93e3ddf84c1c8e7f0cd","source":{"kind":"arxiv","id":"1807.03721","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.03721","created_at":"2026-05-17T23:56:33.750277+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.03721v1","created_at":"2026-05-17T23:56:33.750277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03721","created_at":"2026-05-17T23:56:33.750277+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4BQFR42AFTN","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4BQFR42AFTNJKOR","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4BQFR42","created_at":"2026-05-18T12:32:50.500415+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/S4BQFR42AFTNJKOR556IFJULF4","json":"https://pith.science/pith/S4BQFR42AFTNJKOR556IFJULF4.json","graph_json":"https://pith.science/api/pith-number/S4BQFR42AFTNJKOR556IFJULF4/graph.json","events_json":"https://pith.science/api/pith-number/S4BQFR42AFTNJKOR556IFJULF4/events.json","paper":"https://pith.science/paper/S4BQFR42"},"agent_actions":{"view_html":"https://pith.science/pith/S4BQFR42AFTNJKOR556IFJULF4","download_json":"https://pith.science/pith/S4BQFR42AFTNJKOR556IFJULF4.json","view_paper":"https://pith.science/paper/S4BQFR42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.03721&json=true","fetch_graph":"https://pith.science/api/pith-number/S4BQFR42AFTNJKOR556IFJULF4/graph.json","fetch_events":"https://pith.science/api/pith-number/S4BQFR42AFTNJKOR556IFJULF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4BQFR42AFTNJKOR556IFJULF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4BQFR42AFTNJKOR556IFJULF4/action/storage_attestation","attest_author":"https://pith.science/pith/S4BQFR42AFTNJKOR556IFJULF4/action/author_attestation","sign_citation":"https://pith.science/pith/S4BQFR42AFTNJKOR556IFJULF4/action/citation_signature","submit_replication":"https://pith.science/pith/S4BQFR42AFTNJKOR556IFJULF4/action/replication_record"}},"created_at":"2026-05-17T23:56:33.750277+00:00","updated_at":"2026-05-17T23:56:33.750277+00:00"}