{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UEWIYMNPWBEGPC76X73GXJO6G5","short_pith_number":"pith:UEWIYMNP","canonical_record":{"source":{"id":"1410.0768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-03T07:42:38Z","cross_cats_sorted":[],"title_canon_sha256":"f02ec794eb511a3bcdae82e265948f1aa8c9697bdb9a4ddddb7bca6d82268ceb","abstract_canon_sha256":"a7985631ff68909e18bb2e840eff52bc590d5be959a16ce9b569eacdf9440c6a"},"schema_version":"1.0"},"canonical_sha256":"a12c8c31afb048678bfebff66ba5de375b3f0adb46b9539578af7adaca41d635","source":{"kind":"arxiv","id":"1410.0768","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0768","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0768v1","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0768","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"UEWIYMNPWBEG","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UEWIYMNPWBEGPC76","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UEWIYMNP","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UEWIYMNPWBEGPC76X73GXJO6G5","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-03T07:42:38Z","cross_cats_sorted":[],"title_canon_sha256":"f02ec794eb511a3bcdae82e265948f1aa8c9697bdb9a4ddddb7bca6d82268ceb","abstract_canon_sha256":"a7985631ff68909e18bb2e840eff52bc590d5be959a16ce9b569eacdf9440c6a"},"schema_version":"1.0"},"canonical_sha256":"a12c8c31afb048678bfebff66ba5de375b3f0adb46b9539578af7adaca41d635","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:09.733008Z","signature_b64":"XlyURMiqOcspkUwZekCyHUudBuxahgrjsEEp90+qzSg+9+l6Y078joivkA9IHwfbd94FBSehCownY2x0a4ZlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a12c8c31afb048678bfebff66ba5de375b3f0adb46b9539578af7adaca41d635","last_reissued_at":"2026-05-18T02:41:09.732634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:09.732634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0768","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-18T02:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"heZgRofTmZ7fpzoy8o35tH2Obb6J61Vpr9qNDeF2GS4S/Q+80tXnJ13IvvQe+CJh3g1DIVFkJSKbBfecHCSZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:37:26.331509Z"},"content_sha256":"3f3d18d31e098ae988c4ddd33d41942448966b7baf4ad16551eb2f75c89116d5","schema_version":"1.0","event_id":"sha256:3f3d18d31e098ae988c4ddd33d41942448966b7baf4ad16551eb2f75c89116d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UEWIYMNPWBEGPC76X73GXJO6G5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space-Efficient Path-Reporting Approximate Distance Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Wulff-Nilsen, Michael Elkin, Ofer Neiman","submitted_at":"2014-10-03T07:42:38Z","abstract_excerpt":"We consider approximate {\\em path-reporting} distance oracles, distance labeling and labeled routing with extremely low space requirement, for general undirected graphs. For distance oracles, we show how to break the n\\log n space bound of Thorup and Zwick if approximate {\\em paths} rather than distances need to be reported. For approximate distance labeling and labeled routing, we break the previously best known space bound of O(log n) words per vertex. The cost for such space efficiency is an increased stretch."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0768","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-18T02:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t8QhZBjey8219sBlarLbmNN9iZDBAlL9YaOIDednivFHu92IrFBYA/ZLLJlV/3IptcgcN4PXOhpPb30eUfC3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:37:26.331862Z"},"content_sha256":"4bd07b1b6824e776b60d31b10429d0580ce33581dfa63e6d371e36d7cc7a76e3","schema_version":"1.0","event_id":"sha256:4bd07b1b6824e776b60d31b10429d0580ce33581dfa63e6d371e36d7cc7a76e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UEWIYMNPWBEGPC76X73GXJO6G5/bundle.json","state_url":"https://pith.science/pith/UEWIYMNPWBEGPC76X73GXJO6G5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UEWIYMNPWBEGPC76X73GXJO6G5/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-05T14:37:26Z","links":{"resolver":"https://pith.science/pith/UEWIYMNPWBEGPC76X73GXJO6G5","bundle":"https://pith.science/pith/UEWIYMNPWBEGPC76X73GXJO6G5/bundle.json","state":"https://pith.science/pith/UEWIYMNPWBEGPC76X73GXJO6G5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UEWIYMNPWBEGPC76X73GXJO6G5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UEWIYMNPWBEGPC76X73GXJO6G5","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":"a7985631ff68909e18bb2e840eff52bc590d5be959a16ce9b569eacdf9440c6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-03T07:42:38Z","title_canon_sha256":"f02ec794eb511a3bcdae82e265948f1aa8c9697bdb9a4ddddb7bca6d82268ceb"},"schema_version":"1.0","source":{"id":"1410.0768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0768","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0768v1","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0768","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"UEWIYMNPWBEG","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UEWIYMNPWBEGPC76","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UEWIYMNP","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:4bd07b1b6824e776b60d31b10429d0580ce33581dfa63e6d371e36d7cc7a76e3","target":"graph","created_at":"2026-05-18T02:41:09Z","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":"We consider approximate {\\em path-reporting} distance oracles, distance labeling and labeled routing with extremely low space requirement, for general undirected graphs. For distance oracles, we show how to break the n\\log n space bound of Thorup and Zwick if approximate {\\em paths} rather than distances need to be reported. For approximate distance labeling and labeled routing, we break the previously best known space bound of O(log n) words per vertex. The cost for such space efficiency is an increased stretch.","authors_text":"Christian Wulff-Nilsen, Michael Elkin, Ofer Neiman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-03T07:42:38Z","title":"Space-Efficient Path-Reporting Approximate Distance Oracles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0768","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:3f3d18d31e098ae988c4ddd33d41942448966b7baf4ad16551eb2f75c89116d5","target":"record","created_at":"2026-05-18T02:41:09Z","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":"a7985631ff68909e18bb2e840eff52bc590d5be959a16ce9b569eacdf9440c6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-03T07:42:38Z","title_canon_sha256":"f02ec794eb511a3bcdae82e265948f1aa8c9697bdb9a4ddddb7bca6d82268ceb"},"schema_version":"1.0","source":{"id":"1410.0768","kind":"arxiv","version":1}},"canonical_sha256":"a12c8c31afb048678bfebff66ba5de375b3f0adb46b9539578af7adaca41d635","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a12c8c31afb048678bfebff66ba5de375b3f0adb46b9539578af7adaca41d635","first_computed_at":"2026-05-18T02:41:09.732634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:09.732634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XlyURMiqOcspkUwZekCyHUudBuxahgrjsEEp90+qzSg+9+l6Y078joivkA9IHwfbd94FBSehCownY2x0a4ZlBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:09.733008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f3d18d31e098ae988c4ddd33d41942448966b7baf4ad16551eb2f75c89116d5","sha256:4bd07b1b6824e776b60d31b10429d0580ce33581dfa63e6d371e36d7cc7a76e3"],"state_sha256":"ca24b1aa683e501257ebf446ef9aabbd11fa63a7b400fb862de633c90e31b576"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uct0HbOjoNKzZP8/8/t9CZNQubGlLyOTThJOJ5q81FJZiwCSwSpHQttArWUq7wbfHDAIzaBLnmk477OcxokRAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:37:26.333834Z","bundle_sha256":"9e7050772adfee90867cf5dae59442125c2639b5f4cb38f126d4c5b654c93a9b"}}