{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UKFENWGIVN6ZROS4AHVXSMQZZN","short_pith_number":"pith:UKFENWGI","canonical_record":{"source":{"id":"1506.08392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-28T12:56:32Z","cross_cats_sorted":[],"title_canon_sha256":"93b5917244ba1c3806d311010601746cfc32aea6b88cb0127f33d798cb600d06","abstract_canon_sha256":"6c9ddad14f25b93c9639d91b6cc7bc5bfe88cd2247173b326398b3eab5cb83f0"},"schema_version":"1.0"},"canonical_sha256":"a28a46d8c8ab7d98ba5c01eb793219cb6217e0b799c79ac91fc6a9c07cac796d","source":{"kind":"arxiv","id":"1506.08392","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08392","created_at":"2026-05-18T01:37:45Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08392v1","created_at":"2026-05-18T01:37:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08392","created_at":"2026-05-18T01:37:45Z"},{"alias_kind":"pith_short_12","alias_value":"UKFENWGIVN6Z","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UKFENWGIVN6ZROS4","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UKFENWGI","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UKFENWGIVN6ZROS4AHVXSMQZZN","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-28T12:56:32Z","cross_cats_sorted":[],"title_canon_sha256":"93b5917244ba1c3806d311010601746cfc32aea6b88cb0127f33d798cb600d06","abstract_canon_sha256":"6c9ddad14f25b93c9639d91b6cc7bc5bfe88cd2247173b326398b3eab5cb83f0"},"schema_version":"1.0"},"canonical_sha256":"a28a46d8c8ab7d98ba5c01eb793219cb6217e0b799c79ac91fc6a9c07cac796d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:45.409084Z","signature_b64":"81y+J0wV+7BMV7TX+I2Wqt7QfNSamnDPmDOD8kZqUpABtdH5rT4qC0RhVf2mE2Fd7a+nZKV2yRPV7TJu7AvfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a28a46d8c8ab7d98ba5c01eb793219cb6217e0b799c79ac91fc6a9c07cac796d","last_reissued_at":"2026-05-18T01:37:45.408686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:45.408686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08392","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-18T01:37:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLZ8rP1A5xAo5F4K0mcimmRgO97yf6/QDMgKc0gbbicaMm8p+NjAVDH4g0L4c2cO2amUd5QJn9KS6UTsRO4uDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:02:13.044747Z"},"content_sha256":"de49fbe970c9f2217383af75d70bf081399e5a58fdbb3bc36847f326b162a6a7","schema_version":"1.0","event_id":"sha256:de49fbe970c9f2217383af75d70bf081399e5a58fdbb3bc36847f326b162a6a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UKFENWGIVN6ZROS4AHVXSMQZZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Elkin, Seth Pettie","submitted_at":"2015-06-28T12:56:32Z","abstract_excerpt":"In 2001 Thorup and Zwick devised a distance oracle, which given an $n$-vertex undirected graph and a parameter $k$, has size $O(k n^{1+1/k})$. Upon a query $(u,v)$ their oracle constructs a $(2k-1)$-approximate path $\\Pi$ between $u$ and $v$. The query time of the Thorup-Zwick's oracle is $O(k)$, and it was subsequently improved to $O(1)$ by Chechik. A major drawback of the oracle of Thorup and Zwick is that its space is $\\Omega(n \\cdot \\log n)$. Mendel and Naor devised an oracle with space $O(n^{1+1/k})$ and stretch $O(k)$, but their oracle can only report distance estimates and not actual pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08392","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-18T01:37:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0vNYY4zKB6/cavv0ZghSdsw7oDAt8rg6LlBB681EaX9y7KjP4HRZWPe2Lb+q686PFeWNN1d2HgVFOacl+uzhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:02:13.045104Z"},"content_sha256":"643d9d15fcc6346fe768ca3b8767255d818b955c5b0ddf4cd7d8b2711497c552","schema_version":"1.0","event_id":"sha256:643d9d15fcc6346fe768ca3b8767255d818b955c5b0ddf4cd7d8b2711497c552"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKFENWGIVN6ZROS4AHVXSMQZZN/bundle.json","state_url":"https://pith.science/pith/UKFENWGIVN6ZROS4AHVXSMQZZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKFENWGIVN6ZROS4AHVXSMQZZN/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-23T03:02:13Z","links":{"resolver":"https://pith.science/pith/UKFENWGIVN6ZROS4AHVXSMQZZN","bundle":"https://pith.science/pith/UKFENWGIVN6ZROS4AHVXSMQZZN/bundle.json","state":"https://pith.science/pith/UKFENWGIVN6ZROS4AHVXSMQZZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKFENWGIVN6ZROS4AHVXSMQZZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UKFENWGIVN6ZROS4AHVXSMQZZN","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":"6c9ddad14f25b93c9639d91b6cc7bc5bfe88cd2247173b326398b3eab5cb83f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-28T12:56:32Z","title_canon_sha256":"93b5917244ba1c3806d311010601746cfc32aea6b88cb0127f33d798cb600d06"},"schema_version":"1.0","source":{"id":"1506.08392","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08392","created_at":"2026-05-18T01:37:45Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08392v1","created_at":"2026-05-18T01:37:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08392","created_at":"2026-05-18T01:37:45Z"},{"alias_kind":"pith_short_12","alias_value":"UKFENWGIVN6Z","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UKFENWGIVN6ZROS4","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UKFENWGI","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:643d9d15fcc6346fe768ca3b8767255d818b955c5b0ddf4cd7d8b2711497c552","target":"graph","created_at":"2026-05-18T01:37:45Z","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":"In 2001 Thorup and Zwick devised a distance oracle, which given an $n$-vertex undirected graph and a parameter $k$, has size $O(k n^{1+1/k})$. Upon a query $(u,v)$ their oracle constructs a $(2k-1)$-approximate path $\\Pi$ between $u$ and $v$. The query time of the Thorup-Zwick's oracle is $O(k)$, and it was subsequently improved to $O(1)$ by Chechik. A major drawback of the oracle of Thorup and Zwick is that its space is $\\Omega(n \\cdot \\log n)$. Mendel and Naor devised an oracle with space $O(n^{1+1/k})$ and stretch $O(k)$, but their oracle can only report distance estimates and not actual pa","authors_text":"Michael Elkin, Seth Pettie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-28T12:56:32Z","title":"A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08392","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:de49fbe970c9f2217383af75d70bf081399e5a58fdbb3bc36847f326b162a6a7","target":"record","created_at":"2026-05-18T01:37:45Z","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":"6c9ddad14f25b93c9639d91b6cc7bc5bfe88cd2247173b326398b3eab5cb83f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-28T12:56:32Z","title_canon_sha256":"93b5917244ba1c3806d311010601746cfc32aea6b88cb0127f33d798cb600d06"},"schema_version":"1.0","source":{"id":"1506.08392","kind":"arxiv","version":1}},"canonical_sha256":"a28a46d8c8ab7d98ba5c01eb793219cb6217e0b799c79ac91fc6a9c07cac796d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a28a46d8c8ab7d98ba5c01eb793219cb6217e0b799c79ac91fc6a9c07cac796d","first_computed_at":"2026-05-18T01:37:45.408686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:45.408686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"81y+J0wV+7BMV7TX+I2Wqt7QfNSamnDPmDOD8kZqUpABtdH5rT4qC0RhVf2mE2Fd7a+nZKV2yRPV7TJu7AvfDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:45.409084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08392","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de49fbe970c9f2217383af75d70bf081399e5a58fdbb3bc36847f326b162a6a7","sha256:643d9d15fcc6346fe768ca3b8767255d818b955c5b0ddf4cd7d8b2711497c552"],"state_sha256":"aa531184fe838ddb8350097d6967bf5801570ed80e2ef1eff4895dd79f2b93fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PcJvTvb/EA+KJ09jwyu0Ik3dRabBulKjVHLUZtlMn98/BAE3yNi+GERcd3wPXZfWav9XPFBR0TAgwuY/8YkZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T03:02:13.046970Z","bundle_sha256":"980051a5730ddb613a1dd538a6ca6c63d7c5ed2358827010b1106b5baec8904e"}}