{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UJ5BGA4XKSXEW6PKWLREVDSMLB","short_pith_number":"pith:UJ5BGA4X","schema_version":"1.0","canonical_sha256":"a27a13039754ae4b79eab2e24a8e4c58408b978ae87dc557c0448a0976d6feb3","source":{"kind":"arxiv","id":"1202.2336","version":3},"attestation_state":"computed","paper":{"title":"Approximate Distance Oracles with Improved Query Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Christian Wulff-Nilsen","submitted_at":"2012-02-10T19:51:10Z","abstract_excerpt":"Given an undirected graph $G$ with $m$ edges, $n$ vertices, and non-negative edge weights, and given an integer $k\\geq 2$, we show that a $(2k-1)$-approximate distance oracle for $G$ of size $O(kn^{1 + 1/k})$ and with $O(\\log k)$ query time can be constructed in $O(\\min\\{kmn^{1/k},\\sqrt km + kn^{1 + c/\\sqrt k}\\})$ time for some constant $c$. This improves the $O(k)$ query time of Thorup and Zwick. Furthermore, for any $0 < \\epsilon \\leq 1$, we give an oracle of size $O(kn^{1 + 1/k})$ that answers $((2 + \\epsilon)k)$-approximate distance queries in $O(1/\\epsilon)$ time. At the cost of a $k$-fac"},"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":"1202.2336","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-02-10T19:51:10Z","cross_cats_sorted":[],"title_canon_sha256":"0c283e8d09b569e7ef9f55bbd8495fd6bc6c0cdb63f447c4e2427bfd48289492","abstract_canon_sha256":"5ed29d9d8a9c533287d318c6d92a24b9784876602ab0e07423c3a45d07c9d7a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:15.417828Z","signature_b64":"d6MzrNW/cI2F7aSB4d0q//bRFSH6HFxxU1e8XlD7/g1D+WuiKkBYjPiXijLcFjz4fEcX3XcJ1QJDkRF5r+YDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a27a13039754ae4b79eab2e24a8e4c58408b978ae87dc557c0448a0976d6feb3","last_reissued_at":"2026-05-18T03:44:15.417413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:15.417413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Distance Oracles with Improved Query Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Christian Wulff-Nilsen","submitted_at":"2012-02-10T19:51:10Z","abstract_excerpt":"Given an undirected graph $G$ with $m$ edges, $n$ vertices, and non-negative edge weights, and given an integer $k\\geq 2$, we show that a $(2k-1)$-approximate distance oracle for $G$ of size $O(kn^{1 + 1/k})$ and with $O(\\log k)$ query time can be constructed in $O(\\min\\{kmn^{1/k},\\sqrt km + kn^{1 + c/\\sqrt k}\\})$ time for some constant $c$. This improves the $O(k)$ query time of Thorup and Zwick. Furthermore, for any $0 < \\epsilon \\leq 1$, we give an oracle of size $O(kn^{1 + 1/k})$ that answers $((2 + \\epsilon)k)$-approximate distance queries in $O(1/\\epsilon)$ time. At the cost of a $k$-fac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2336","kind":"arxiv","version":3},"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":"1202.2336","created_at":"2026-05-18T03:44:15.417475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.2336v3","created_at":"2026-05-18T03:44:15.417475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2336","created_at":"2026-05-18T03:44:15.417475+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJ5BGA4XKSXE","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJ5BGA4XKSXEW6PK","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJ5BGA4X","created_at":"2026-05-18T12:27:23.164592+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/UJ5BGA4XKSXEW6PKWLREVDSMLB","json":"https://pith.science/pith/UJ5BGA4XKSXEW6PKWLREVDSMLB.json","graph_json":"https://pith.science/api/pith-number/UJ5BGA4XKSXEW6PKWLREVDSMLB/graph.json","events_json":"https://pith.science/api/pith-number/UJ5BGA4XKSXEW6PKWLREVDSMLB/events.json","paper":"https://pith.science/paper/UJ5BGA4X"},"agent_actions":{"view_html":"https://pith.science/pith/UJ5BGA4XKSXEW6PKWLREVDSMLB","download_json":"https://pith.science/pith/UJ5BGA4XKSXEW6PKWLREVDSMLB.json","view_paper":"https://pith.science/paper/UJ5BGA4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.2336&json=true","fetch_graph":"https://pith.science/api/pith-number/UJ5BGA4XKSXEW6PKWLREVDSMLB/graph.json","fetch_events":"https://pith.science/api/pith-number/UJ5BGA4XKSXEW6PKWLREVDSMLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJ5BGA4XKSXEW6PKWLREVDSMLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJ5BGA4XKSXEW6PKWLREVDSMLB/action/storage_attestation","attest_author":"https://pith.science/pith/UJ5BGA4XKSXEW6PKWLREVDSMLB/action/author_attestation","sign_citation":"https://pith.science/pith/UJ5BGA4XKSXEW6PKWLREVDSMLB/action/citation_signature","submit_replication":"https://pith.science/pith/UJ5BGA4XKSXEW6PKWLREVDSMLB/action/replication_record"}},"created_at":"2026-05-18T03:44:15.417475+00:00","updated_at":"2026-05-18T03:44:15.417475+00:00"}