{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DA2UEHDOMWVCN6L6LAS6F5TQEH","short_pith_number":"pith:DA2UEHDO","schema_version":"1.0","canonical_sha256":"1835421c6e65aa26f97e5825e2f67021c06d7aa0809713b46bf1fc129a240090","source":{"kind":"arxiv","id":"1109.4156","version":1},"attestation_state":"computed","paper":{"title":"Approximate Distance Oracles with Improved Preprocessing Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Christian Wulff-Nilsen","submitted_at":"2011-09-19T20:06:48Z","abstract_excerpt":"Given an undirected graph $G$ with $m$ edges, $n$ vertices, and non-negative edge weights, and given an integer $k\\geq 1$, we show that for some universal constant $c$, a $(2k-1)$-approximate distance oracle for $G$ of size $O(kn^{1 + 1/k})$ can be constructed in $O(\\sqrt km + kn^{1 + c/\\sqrt k})$ time and can answer queries in $O(k)$ time. We also give an oracle which is faster for smaller $k$. Our results break the quadratic preprocessing time bound of Baswana and Kavitha for all $k\\geq 6$ and improve the $O(kmn^{1/k})$ time bound of Thorup and Zwick except for very sparse graphs and small $"},"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":"1109.4156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-19T20:06:48Z","cross_cats_sorted":[],"title_canon_sha256":"414ae33f59e1dea81db4710e4517be21265372f2dc2190b817b3d62a00e85ef2","abstract_canon_sha256":"42f07736fa1f2ae817abcf59ce2141ceb647bd2238bb8442c67a505b7f4fa361"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:44.081368Z","signature_b64":"2+s/npjy9SanNVYZhnA2S+M/bEzeb4vipb0vG3DjajKATuQU6VX8KLk9CI2W1baMKIdZ06BJUpOML53XuJ4RAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1835421c6e65aa26f97e5825e2f67021c06d7aa0809713b46bf1fc129a240090","last_reissued_at":"2026-05-18T04:12:44.080661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:44.080661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Distance Oracles with Improved Preprocessing Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Christian Wulff-Nilsen","submitted_at":"2011-09-19T20:06:48Z","abstract_excerpt":"Given an undirected graph $G$ with $m$ edges, $n$ vertices, and non-negative edge weights, and given an integer $k\\geq 1$, we show that for some universal constant $c$, a $(2k-1)$-approximate distance oracle for $G$ of size $O(kn^{1 + 1/k})$ can be constructed in $O(\\sqrt km + kn^{1 + c/\\sqrt k})$ time and can answer queries in $O(k)$ time. We also give an oracle which is faster for smaller $k$. Our results break the quadratic preprocessing time bound of Baswana and Kavitha for all $k\\geq 6$ and improve the $O(kmn^{1/k})$ time bound of Thorup and Zwick except for very sparse graphs and small $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4156","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":"1109.4156","created_at":"2026-05-18T04:12:44.080766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4156v1","created_at":"2026-05-18T04:12:44.080766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4156","created_at":"2026-05-18T04:12:44.080766+00:00"},{"alias_kind":"pith_short_12","alias_value":"DA2UEHDOMWVC","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DA2UEHDOMWVCN6L6","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DA2UEHDO","created_at":"2026-05-18T12:26:26.731475+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/DA2UEHDOMWVCN6L6LAS6F5TQEH","json":"https://pith.science/pith/DA2UEHDOMWVCN6L6LAS6F5TQEH.json","graph_json":"https://pith.science/api/pith-number/DA2UEHDOMWVCN6L6LAS6F5TQEH/graph.json","events_json":"https://pith.science/api/pith-number/DA2UEHDOMWVCN6L6LAS6F5TQEH/events.json","paper":"https://pith.science/paper/DA2UEHDO"},"agent_actions":{"view_html":"https://pith.science/pith/DA2UEHDOMWVCN6L6LAS6F5TQEH","download_json":"https://pith.science/pith/DA2UEHDOMWVCN6L6LAS6F5TQEH.json","view_paper":"https://pith.science/paper/DA2UEHDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4156&json=true","fetch_graph":"https://pith.science/api/pith-number/DA2UEHDOMWVCN6L6LAS6F5TQEH/graph.json","fetch_events":"https://pith.science/api/pith-number/DA2UEHDOMWVCN6L6LAS6F5TQEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DA2UEHDOMWVCN6L6LAS6F5TQEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DA2UEHDOMWVCN6L6LAS6F5TQEH/action/storage_attestation","attest_author":"https://pith.science/pith/DA2UEHDOMWVCN6L6LAS6F5TQEH/action/author_attestation","sign_citation":"https://pith.science/pith/DA2UEHDOMWVCN6L6LAS6F5TQEH/action/citation_signature","submit_replication":"https://pith.science/pith/DA2UEHDOMWVCN6L6LAS6F5TQEH/action/replication_record"}},"created_at":"2026-05-18T04:12:44.080766+00:00","updated_at":"2026-05-18T04:12:44.080766+00:00"}