{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:43W3K2FIDRKLKNGUCM5XZK5RBZ","short_pith_number":"pith:43W3K2FI","canonical_record":{"source":{"id":"2005.09588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-19T17:09:41Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6ef092a85de6d66ce725ff22acd3e92b1d69b81c5ad23618f16be05827a85376","abstract_canon_sha256":"9da5c44d4aad64d7fee96fd6590da5d9ce29a7b1fdfee45090e4c5bd95283a85"},"schema_version":"1.0"},"canonical_sha256":"e6edb568a81c54b534d4133b7cabb10e5e9bf36a1e5b099897a427257a7b7703","source":{"kind":"arxiv","id":"2005.09588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.09588","created_at":"2026-07-05T01:03:51Z"},{"alias_kind":"arxiv_version","alias_value":"2005.09588v1","created_at":"2026-07-05T01:03:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.09588","created_at":"2026-07-05T01:03:51Z"},{"alias_kind":"pith_short_12","alias_value":"43W3K2FIDRKL","created_at":"2026-07-05T01:03:51Z"},{"alias_kind":"pith_short_16","alias_value":"43W3K2FIDRKLKNGU","created_at":"2026-07-05T01:03:51Z"},{"alias_kind":"pith_short_8","alias_value":"43W3K2FI","created_at":"2026-07-05T01:03:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:43W3K2FIDRKLKNGUCM5XZK5RBZ","target":"record","payload":{"canonical_record":{"source":{"id":"2005.09588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-19T17:09:41Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6ef092a85de6d66ce725ff22acd3e92b1d69b81c5ad23618f16be05827a85376","abstract_canon_sha256":"9da5c44d4aad64d7fee96fd6590da5d9ce29a7b1fdfee45090e4c5bd95283a85"},"schema_version":"1.0"},"canonical_sha256":"e6edb568a81c54b534d4133b7cabb10e5e9bf36a1e5b099897a427257a7b7703","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:03:51.287013Z","signature_b64":"JcTqM2nVyx0oc9KEBhePA2nvISwCnW+oN6/l0xFt1sYcvKujIUgJdEBE7npiq+LvGYRHq3SOWkixLnkOotD6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6edb568a81c54b534d4133b7cabb10e5e9bf36a1e5b099897a427257a7b7703","last_reissued_at":"2026-07-05T01:03:51.286627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:03:51.286627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.09588","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-07-05T01:03:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AOOApn2/EVVamWe4XcrLZAWOUQxSe2Z87aq1g7fwVPj6DLjOJyi0OXuiz42zpwFpGfx2imUSJkzR+5JQ/DU4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:18:00.308951Z"},"content_sha256":"751147f236086891f72f11e2a685e5a153b5f34ecf382f33d16bdc43b96c0f97","schema_version":"1.0","event_id":"sha256:751147f236086891f72f11e2a685e5a153b5f34ecf382f33d16bdc43b96c0f97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:43W3K2FIDRKLKNGUCM5XZK5RBZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Deterministic All Pairs Shortest Paths in Congest Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Udit Agarwal, Vijaya Ramachandran","submitted_at":"2020-05-19T17:09:41Z","abstract_excerpt":"We present a new deterministic algorithm for distributed weighted all pairs shortest paths (APSP) in both undirected and directed graphs. Our algorithm runs in $\\tilde{O}(n^{4/3})$ rounds in the Congest models on graphs with arbitrary edge weights, and it improves on the previous $\\tilde{O}(n^{3/2})$ bound of Agarwal et al. [ARKP18]. The main components of our new algorithm are a new faster technique for constructing blocker set deterministically and a new pipelined method for deterministically propagating distance values from source nodes to the blocker set nodes in the network. Both of these"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.09588","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.09588/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:03:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+h3iinBD/2sXH911kcJ2WEn+AuiDjIJSSLEvkpH5TqBU1vSHUhe8jmhSpKQ388sogcCLdUIBwuEkK13yeK9rCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:18:00.309855Z"},"content_sha256":"0777dd454bfa8f0a8b3638db9df75c3ac4e2ff16ab00e72608c054879dddf07d","schema_version":"1.0","event_id":"sha256:0777dd454bfa8f0a8b3638db9df75c3ac4e2ff16ab00e72608c054879dddf07d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43W3K2FIDRKLKNGUCM5XZK5RBZ/bundle.json","state_url":"https://pith.science/pith/43W3K2FIDRKLKNGUCM5XZK5RBZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43W3K2FIDRKLKNGUCM5XZK5RBZ/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-08-03T18:18:00Z","links":{"resolver":"https://pith.science/pith/43W3K2FIDRKLKNGUCM5XZK5RBZ","bundle":"https://pith.science/pith/43W3K2FIDRKLKNGUCM5XZK5RBZ/bundle.json","state":"https://pith.science/pith/43W3K2FIDRKLKNGUCM5XZK5RBZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43W3K2FIDRKLKNGUCM5XZK5RBZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:43W3K2FIDRKLKNGUCM5XZK5RBZ","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":"9da5c44d4aad64d7fee96fd6590da5d9ce29a7b1fdfee45090e4c5bd95283a85","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-19T17:09:41Z","title_canon_sha256":"6ef092a85de6d66ce725ff22acd3e92b1d69b81c5ad23618f16be05827a85376"},"schema_version":"1.0","source":{"id":"2005.09588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.09588","created_at":"2026-07-05T01:03:51Z"},{"alias_kind":"arxiv_version","alias_value":"2005.09588v1","created_at":"2026-07-05T01:03:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.09588","created_at":"2026-07-05T01:03:51Z"},{"alias_kind":"pith_short_12","alias_value":"43W3K2FIDRKL","created_at":"2026-07-05T01:03:51Z"},{"alias_kind":"pith_short_16","alias_value":"43W3K2FIDRKLKNGU","created_at":"2026-07-05T01:03:51Z"},{"alias_kind":"pith_short_8","alias_value":"43W3K2FI","created_at":"2026-07-05T01:03:51Z"}],"graph_snapshots":[{"event_id":"sha256:0777dd454bfa8f0a8b3638db9df75c3ac4e2ff16ab00e72608c054879dddf07d","target":"graph","created_at":"2026-07-05T01:03:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.09588/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new deterministic algorithm for distributed weighted all pairs shortest paths (APSP) in both undirected and directed graphs. Our algorithm runs in $\\tilde{O}(n^{4/3})$ rounds in the Congest models on graphs with arbitrary edge weights, and it improves on the previous $\\tilde{O}(n^{3/2})$ bound of Agarwal et al. [ARKP18]. The main components of our new algorithm are a new faster technique for constructing blocker set deterministically and a new pipelined method for deterministically propagating distance values from source nodes to the blocker set nodes in the network. Both of these","authors_text":"Udit Agarwal, Vijaya Ramachandran","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-19T17:09:41Z","title":"Faster Deterministic All Pairs Shortest Paths in Congest Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.09588","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:751147f236086891f72f11e2a685e5a153b5f34ecf382f33d16bdc43b96c0f97","target":"record","created_at":"2026-07-05T01:03:51Z","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":"9da5c44d4aad64d7fee96fd6590da5d9ce29a7b1fdfee45090e4c5bd95283a85","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-19T17:09:41Z","title_canon_sha256":"6ef092a85de6d66ce725ff22acd3e92b1d69b81c5ad23618f16be05827a85376"},"schema_version":"1.0","source":{"id":"2005.09588","kind":"arxiv","version":1}},"canonical_sha256":"e6edb568a81c54b534d4133b7cabb10e5e9bf36a1e5b099897a427257a7b7703","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6edb568a81c54b534d4133b7cabb10e5e9bf36a1e5b099897a427257a7b7703","first_computed_at":"2026-07-05T01:03:51.286627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:03:51.286627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JcTqM2nVyx0oc9KEBhePA2nvISwCnW+oN6/l0xFt1sYcvKujIUgJdEBE7npiq+LvGYRHq3SOWkixLnkOotD6CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:03:51.287013Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.09588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:751147f236086891f72f11e2a685e5a153b5f34ecf382f33d16bdc43b96c0f97","sha256:0777dd454bfa8f0a8b3638db9df75c3ac4e2ff16ab00e72608c054879dddf07d"],"state_sha256":"ce1415b30e9cac15b9dda930116809d3dc009d513a8281b5952fdb10b4f6638c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cvq/HeJtLPRhLl20ckFKFA7O4ta0AG5WIvhyu8zGhqBWHoHooR82S2IdXRCRugVcSDAhUVInRxf/dpg4OvFCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:18:00.321693Z","bundle_sha256":"2f6de80879367bf81d3ec8b814611f4d3682def22c058e52f822918ced313be4"}}