{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PDB3V2QRGVRQXUQ3M6B3FSTEWO","short_pith_number":"pith:PDB3V2QR","canonical_record":{"source":{"id":"1810.08544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-18T15:53:23Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"37f7825fc808b8c74fded88ed560602d20d6a5b9345219360c29b58a876d37ad","abstract_canon_sha256":"7f12b9ddc109fe5606d1ddaea403a0f20fdef0a453cce737c04a24ed2fbf3be2"},"schema_version":"1.0"},"canonical_sha256":"78c3baea1135630bd21b6783b2ca64b38b61b691974e086ea6f5f1e03dda3982","source":{"kind":"arxiv","id":"1810.08544","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08544","created_at":"2026-05-18T00:02:47Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08544v1","created_at":"2026-05-18T00:02:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08544","created_at":"2026-05-18T00:02:47Z"},{"alias_kind":"pith_short_12","alias_value":"PDB3V2QRGVRQ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PDB3V2QRGVRQXUQ3","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PDB3V2QR","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PDB3V2QRGVRQXUQ3M6B3FSTEWO","target":"record","payload":{"canonical_record":{"source":{"id":"1810.08544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-18T15:53:23Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"37f7825fc808b8c74fded88ed560602d20d6a5b9345219360c29b58a876d37ad","abstract_canon_sha256":"7f12b9ddc109fe5606d1ddaea403a0f20fdef0a453cce737c04a24ed2fbf3be2"},"schema_version":"1.0"},"canonical_sha256":"78c3baea1135630bd21b6783b2ca64b38b61b691974e086ea6f5f1e03dda3982","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:47.826973Z","signature_b64":"NPmHrQXJhPGjS4NlpcE19gjKrllc0ZAf2MLXno3IQtet8ygbIm4jSPSnKkoMY44Z2k2v63sgf/Hc1epN4IMkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78c3baea1135630bd21b6783b2ca64b38b61b691974e086ea6f5f1e03dda3982","last_reissued_at":"2026-05-18T00:02:47.826596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:47.826596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.08544","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-18T00:02:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gZJUDu6vNxBFS6PfzeQ8Ke44zvoSSDPgaa2/M+1W7RRzmeLaB5pNbAHmyzqpP4EHI6MNtNrNvfv+0C5CI1nzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T00:02:51.752306Z"},"content_sha256":"9022c7c794bb2ffaf39389afa49a842d5a610bfaf9fa2c95c3799f5eda4480aa","schema_version":"1.0","event_id":"sha256:9022c7c794bb2ffaf39389afa49a842d5a610bfaf9fa2c95c3799f5eda4480aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PDB3V2QRGVRQXUQ3M6B3FSTEWO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths","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":"2018-10-18T15:53:23Z","abstract_excerpt":"We consider the problem of computing all pairs shortest paths (APSP) and shortest paths for k sources in a weighted graph in the distributed CONGEST model. For graphs with non-negative integer edge weights (including zero weights) we build on a recent pipelined algorithm to obtain $\\tilde{O}(\\lambda^{1/4}\\cdot n^{5/4})$ in graphs with non-negative integer edge-weight at most $\\lambda$, and $\\tilde{O}(n \\cdot \\bigtriangleup^{1/3})$ rounds for shortest path distances at most $\\bigtriangleup$. Additionally, we simplify some of the procedures in the earlier APSP algorithms for non-negative edge we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08544","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-18T00:02:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TbbiwjOCEwhFXAI4xlIKhaHass6sfBkjWEC+hxMyWF0qpkZk/K5tbPUeTMXKoFkq7/njED3WX7kBYbcxtGHCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T00:02:51.752665Z"},"content_sha256":"b2a2af805dc7839296839f335fde91b43b856c49b6458e115eccbf24f8ae0464","schema_version":"1.0","event_id":"sha256:b2a2af805dc7839296839f335fde91b43b856c49b6458e115eccbf24f8ae0464"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PDB3V2QRGVRQXUQ3M6B3FSTEWO/bundle.json","state_url":"https://pith.science/pith/PDB3V2QRGVRQXUQ3M6B3FSTEWO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PDB3V2QRGVRQXUQ3M6B3FSTEWO/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-25T00:02:51Z","links":{"resolver":"https://pith.science/pith/PDB3V2QRGVRQXUQ3M6B3FSTEWO","bundle":"https://pith.science/pith/PDB3V2QRGVRQXUQ3M6B3FSTEWO/bundle.json","state":"https://pith.science/pith/PDB3V2QRGVRQXUQ3M6B3FSTEWO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PDB3V2QRGVRQXUQ3M6B3FSTEWO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PDB3V2QRGVRQXUQ3M6B3FSTEWO","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":"7f12b9ddc109fe5606d1ddaea403a0f20fdef0a453cce737c04a24ed2fbf3be2","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-18T15:53:23Z","title_canon_sha256":"37f7825fc808b8c74fded88ed560602d20d6a5b9345219360c29b58a876d37ad"},"schema_version":"1.0","source":{"id":"1810.08544","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08544","created_at":"2026-05-18T00:02:47Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08544v1","created_at":"2026-05-18T00:02:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08544","created_at":"2026-05-18T00:02:47Z"},{"alias_kind":"pith_short_12","alias_value":"PDB3V2QRGVRQ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PDB3V2QRGVRQXUQ3","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PDB3V2QR","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:b2a2af805dc7839296839f335fde91b43b856c49b6458e115eccbf24f8ae0464","target":"graph","created_at":"2026-05-18T00:02:47Z","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 the problem of computing all pairs shortest paths (APSP) and shortest paths for k sources in a weighted graph in the distributed CONGEST model. For graphs with non-negative integer edge weights (including zero weights) we build on a recent pipelined algorithm to obtain $\\tilde{O}(\\lambda^{1/4}\\cdot n^{5/4})$ in graphs with non-negative integer edge-weight at most $\\lambda$, and $\\tilde{O}(n \\cdot \\bigtriangleup^{1/3})$ rounds for shortest path distances at most $\\bigtriangleup$. Additionally, we simplify some of the procedures in the earlier APSP algorithms for non-negative edge we","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":"2018-10-18T15:53:23Z","title":"New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08544","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:9022c7c794bb2ffaf39389afa49a842d5a610bfaf9fa2c95c3799f5eda4480aa","target":"record","created_at":"2026-05-18T00:02:47Z","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":"7f12b9ddc109fe5606d1ddaea403a0f20fdef0a453cce737c04a24ed2fbf3be2","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-18T15:53:23Z","title_canon_sha256":"37f7825fc808b8c74fded88ed560602d20d6a5b9345219360c29b58a876d37ad"},"schema_version":"1.0","source":{"id":"1810.08544","kind":"arxiv","version":1}},"canonical_sha256":"78c3baea1135630bd21b6783b2ca64b38b61b691974e086ea6f5f1e03dda3982","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78c3baea1135630bd21b6783b2ca64b38b61b691974e086ea6f5f1e03dda3982","first_computed_at":"2026-05-18T00:02:47.826596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:47.826596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NPmHrQXJhPGjS4NlpcE19gjKrllc0ZAf2MLXno3IQtet8ygbIm4jSPSnKkoMY44Z2k2v63sgf/Hc1epN4IMkCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:47.826973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.08544","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9022c7c794bb2ffaf39389afa49a842d5a610bfaf9fa2c95c3799f5eda4480aa","sha256:b2a2af805dc7839296839f335fde91b43b856c49b6458e115eccbf24f8ae0464"],"state_sha256":"640775296ab5f883c4ce675da3c102459241ac30dc19c1694353ffb63b3df62e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m5wKXOGUkHOfhodaxzs7WB0OxoLIPwm9n+g0fnZNStMPrN4ujXF1TdjwDPGwJP4zaBLHAoJ4DRu4ddcuLJGJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T00:02:51.754583Z","bundle_sha256":"08532e2182706f0cca82bc6abd18be73d041c5ed5645b16b521f8b5c6df44c93"}}