{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XMJKSZWUPANES6DO5MXHUEKVXA","short_pith_number":"pith:XMJKSZWU","canonical_record":{"source":{"id":"1811.03337","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-08T10:00:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"fd2f8547218c6b09db03dcb227982b325db16f65f4d44679ee97c84078a860a4","abstract_canon_sha256":"885d896e9d3d614bfe3af89b97792630ba879500cd8647b49a0748cb6c9bdbb7"},"schema_version":"1.0"},"canonical_sha256":"bb12a966d4781a49786eeb2e7a1155b83a665da001dc50eded8c2cd7f1fa189f","source":{"kind":"arxiv","id":"1811.03337","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03337","created_at":"2026-05-17T23:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03337v2","created_at":"2026-05-17T23:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03337","created_at":"2026-05-17T23:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"XMJKSZWUPANE","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XMJKSZWUPANES6DO","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XMJKSZWU","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XMJKSZWUPANES6DO5MXHUEKVXA","target":"record","payload":{"canonical_record":{"source":{"id":"1811.03337","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-08T10:00:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"fd2f8547218c6b09db03dcb227982b325db16f65f4d44679ee97c84078a860a4","abstract_canon_sha256":"885d896e9d3d614bfe3af89b97792630ba879500cd8647b49a0748cb6c9bdbb7"},"schema_version":"1.0"},"canonical_sha256":"bb12a966d4781a49786eeb2e7a1155b83a665da001dc50eded8c2cd7f1fa189f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:06.438996Z","signature_b64":"yjUwQkSzkZdhYpqPW+7mpl/oEJkwLMrYn45RE1Lll5vldattV+uNlbIw9ObELCQXs6swjswo22MT4v00cKlIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb12a966d4781a49786eeb2e7a1155b83a665da001dc50eded8c2cd7f1fa189f","last_reissued_at":"2026-05-17T23:48:06.438558Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:06.438558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.03337","source_version":2,"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-17T23:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMaiVxAyDOMIYvZQ2dv9909Zcl4q4jRxyAkz+wQ248BwKZ52icK3aUi5jBzsG8RRxWRyZq6z9ovq1RWw6nqZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:00:18.736335Z"},"content_sha256":"3ed2a85b5677a4b86e6c6e28ee3cc40333464e256ff00896a92a733d27b36a6b","schema_version":"1.0","event_id":"sha256:3ed2a85b5677a4b86e6c6e28ee3cc40333464e256ff00896a92a733d27b36a6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XMJKSZWUPANES6DO5MXHUEKVXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Aaron Bernstein, Danupon Nanongkai","submitted_at":"2018-11-08T10:00:29Z","abstract_excerpt":"In the {\\em distributed all-pairs shortest paths} problem (APSP), every node in the weighted undirected distributed network (the CONGEST model) needs to know the distance from every other node using least number of communication rounds (typically called {\\em time complexity}). The problem admits $(1+o(1))$-approximation $\\tilde\\Theta(n)$-time algorithm and a nearly-tight $\\tilde \\Omega(n)$ lower bound [Nanongkai, STOC'14; Lenzen and Patt-Shamir PODC'15]\\footnote{$\\tilde \\Theta$, $\\tilde O$ and $\\tilde \\Omega$ hide polylogarithmic factors. Note that the lower bounds also hold even in the unweig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03337","kind":"arxiv","version":2},"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-17T23:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ruLeJdOFm/Be3FtmrlEagNKCjAq/5mzTsQQdMR+42Vp3rh76LGD3ssyLXIP8f31gmcXnaVYEaeqsnHUxRIl3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:00:18.736988Z"},"content_sha256":"ff39cfd5f9da540120a08cca890edf754288a7df996537d6bae694184a74a7fc","schema_version":"1.0","event_id":"sha256:ff39cfd5f9da540120a08cca890edf754288a7df996537d6bae694184a74a7fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMJKSZWUPANES6DO5MXHUEKVXA/bundle.json","state_url":"https://pith.science/pith/XMJKSZWUPANES6DO5MXHUEKVXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMJKSZWUPANES6DO5MXHUEKVXA/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-05-31T07:00:18Z","links":{"resolver":"https://pith.science/pith/XMJKSZWUPANES6DO5MXHUEKVXA","bundle":"https://pith.science/pith/XMJKSZWUPANES6DO5MXHUEKVXA/bundle.json","state":"https://pith.science/pith/XMJKSZWUPANES6DO5MXHUEKVXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMJKSZWUPANES6DO5MXHUEKVXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XMJKSZWUPANES6DO5MXHUEKVXA","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":"885d896e9d3d614bfe3af89b97792630ba879500cd8647b49a0748cb6c9bdbb7","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-08T10:00:29Z","title_canon_sha256":"fd2f8547218c6b09db03dcb227982b325db16f65f4d44679ee97c84078a860a4"},"schema_version":"1.0","source":{"id":"1811.03337","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03337","created_at":"2026-05-17T23:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03337v2","created_at":"2026-05-17T23:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03337","created_at":"2026-05-17T23:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"XMJKSZWUPANE","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XMJKSZWUPANES6DO","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XMJKSZWU","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:ff39cfd5f9da540120a08cca890edf754288a7df996537d6bae694184a74a7fc","target":"graph","created_at":"2026-05-17T23:48:06Z","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 the {\\em distributed all-pairs shortest paths} problem (APSP), every node in the weighted undirected distributed network (the CONGEST model) needs to know the distance from every other node using least number of communication rounds (typically called {\\em time complexity}). The problem admits $(1+o(1))$-approximation $\\tilde\\Theta(n)$-time algorithm and a nearly-tight $\\tilde \\Omega(n)$ lower bound [Nanongkai, STOC'14; Lenzen and Patt-Shamir PODC'15]\\footnote{$\\tilde \\Theta$, $\\tilde O$ and $\\tilde \\Omega$ hide polylogarithmic factors. Note that the lower bounds also hold even in the unweig","authors_text":"Aaron Bernstein, Danupon Nanongkai","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-08T10:00:29Z","title":"Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03337","kind":"arxiv","version":2},"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:3ed2a85b5677a4b86e6c6e28ee3cc40333464e256ff00896a92a733d27b36a6b","target":"record","created_at":"2026-05-17T23:48:06Z","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":"885d896e9d3d614bfe3af89b97792630ba879500cd8647b49a0748cb6c9bdbb7","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-08T10:00:29Z","title_canon_sha256":"fd2f8547218c6b09db03dcb227982b325db16f65f4d44679ee97c84078a860a4"},"schema_version":"1.0","source":{"id":"1811.03337","kind":"arxiv","version":2}},"canonical_sha256":"bb12a966d4781a49786eeb2e7a1155b83a665da001dc50eded8c2cd7f1fa189f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb12a966d4781a49786eeb2e7a1155b83a665da001dc50eded8c2cd7f1fa189f","first_computed_at":"2026-05-17T23:48:06.438558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:06.438558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yjUwQkSzkZdhYpqPW+7mpl/oEJkwLMrYn45RE1Lll5vldattV+uNlbIw9ObELCQXs6swjswo22MT4v00cKlIDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:06.438996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03337","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ed2a85b5677a4b86e6c6e28ee3cc40333464e256ff00896a92a733d27b36a6b","sha256:ff39cfd5f9da540120a08cca890edf754288a7df996537d6bae694184a74a7fc"],"state_sha256":"92898b11eae8f34bd961433b81a6c973be403d19c96e415cdba79b2ffa756420"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5rPvkRkOiwo1Gypi69qlOIzvbH8DYw0siuGDEA+h1MOGAPHW4sWnm5MsxN31tow5LYjtaItxTdRiZ/ijFp7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:00:18.740303Z","bundle_sha256":"3fe4428f7be0329ceae9d773513b81dfda6ba5ca77eae7be1c996c837f5f0c97"}}