{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DA2UEHDOMWVCN6L6LAS6F5TQEH","short_pith_number":"pith:DA2UEHDO","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"},"canonical_sha256":"1835421c6e65aa26f97e5825e2f67021c06d7aa0809713b46bf1fc129a240090","source":{"kind":"arxiv","id":"1109.4156","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4156","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4156v1","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4156","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"DA2UEHDOMWVC","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DA2UEHDOMWVCN6L6","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DA2UEHDO","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DA2UEHDOMWVCN6L6LAS6F5TQEH","target":"record","payload":{"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"},"canonical_sha256":"1835421c6e65aa26f97e5825e2f67021c06d7aa0809713b46bf1fc129a240090","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"},"source_kind":"arxiv","source_id":"1109.4156","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-18T04:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jidJUVWBwuI7qanUcNcmmO2gzsS7Zy6LTbeRBciRyr3mbh2zHnCn/eLFUTPWP0lkLOL+RD303A1lI0YV6KH/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:19:30.088660Z"},"content_sha256":"7d76b32ebea7cb4e852023b83e4eceb5af6b87f1cccba7fc9b91e526afcb5862","schema_version":"1.0","event_id":"sha256:7d76b32ebea7cb4e852023b83e4eceb5af6b87f1cccba7fc9b91e526afcb5862"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DA2UEHDOMWVCN6L6LAS6F5TQEH","target":"graph","payload":{"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"},"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-18T04:12:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Zye+DapjfBEhIzkddoIvPdtX0wMhuBaK75G+uZ+o557XtoFAT1qhOuwt4tH5zTpH/TVH3wQEmHq0UYQSI81BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:19:30.089015Z"},"content_sha256":"38435c254969f3f8ebe2dee30d4f413415bbb0309dffb2712a3750bb13d964e7","schema_version":"1.0","event_id":"sha256:38435c254969f3f8ebe2dee30d4f413415bbb0309dffb2712a3750bb13d964e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DA2UEHDOMWVCN6L6LAS6F5TQEH/bundle.json","state_url":"https://pith.science/pith/DA2UEHDOMWVCN6L6LAS6F5TQEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DA2UEHDOMWVCN6L6LAS6F5TQEH/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-05T16:19:30Z","links":{"resolver":"https://pith.science/pith/DA2UEHDOMWVCN6L6LAS6F5TQEH","bundle":"https://pith.science/pith/DA2UEHDOMWVCN6L6LAS6F5TQEH/bundle.json","state":"https://pith.science/pith/DA2UEHDOMWVCN6L6LAS6F5TQEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DA2UEHDOMWVCN6L6LAS6F5TQEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DA2UEHDOMWVCN6L6LAS6F5TQEH","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":"42f07736fa1f2ae817abcf59ce2141ceb647bd2238bb8442c67a505b7f4fa361","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-19T20:06:48Z","title_canon_sha256":"414ae33f59e1dea81db4710e4517be21265372f2dc2190b817b3d62a00e85ef2"},"schema_version":"1.0","source":{"id":"1109.4156","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.4156","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"arxiv_version","alias_value":"1109.4156v1","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4156","created_at":"2026-05-18T04:12:44Z"},{"alias_kind":"pith_short_12","alias_value":"DA2UEHDOMWVC","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DA2UEHDOMWVCN6L6","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DA2UEHDO","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:38435c254969f3f8ebe2dee30d4f413415bbb0309dffb2712a3750bb13d964e7","target":"graph","created_at":"2026-05-18T04:12:44Z","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 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 $","authors_text":"Christian Wulff-Nilsen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-19T20:06:48Z","title":"Approximate Distance Oracles with Improved Preprocessing Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4156","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:7d76b32ebea7cb4e852023b83e4eceb5af6b87f1cccba7fc9b91e526afcb5862","target":"record","created_at":"2026-05-18T04:12:44Z","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":"42f07736fa1f2ae817abcf59ce2141ceb647bd2238bb8442c67a505b7f4fa361","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-19T20:06:48Z","title_canon_sha256":"414ae33f59e1dea81db4710e4517be21265372f2dc2190b817b3d62a00e85ef2"},"schema_version":"1.0","source":{"id":"1109.4156","kind":"arxiv","version":1}},"canonical_sha256":"1835421c6e65aa26f97e5825e2f67021c06d7aa0809713b46bf1fc129a240090","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1835421c6e65aa26f97e5825e2f67021c06d7aa0809713b46bf1fc129a240090","first_computed_at":"2026-05-18T04:12:44.080661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:44.080661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2+s/npjy9SanNVYZhnA2S+M/bEzeb4vipb0vG3DjajKATuQU6VX8KLk9CI2W1baMKIdZ06BJUpOML53XuJ4RAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:44.081368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.4156","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d76b32ebea7cb4e852023b83e4eceb5af6b87f1cccba7fc9b91e526afcb5862","sha256:38435c254969f3f8ebe2dee30d4f413415bbb0309dffb2712a3750bb13d964e7"],"state_sha256":"eb4b88e90bb4d782975af9b447682f16e9f1055a2d9b4665aded3215000ff495"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"298elPowJem18GXLdTkY9MiFFE0dqqCIqK+7SIs7mXlITmvGmAf1dRZ/xKa5ksnBNqBsxlb21hARPzX7c725CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:19:30.091063Z","bundle_sha256":"b9ac9d0ba4160a6f47ba466eeefa08bd655629db051c08ae6636b5bf724aedb8"}}