{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FP2N77UBWQFPJXTQDSQUZPSHC5","short_pith_number":"pith:FP2N77UB","canonical_record":{"source":{"id":"1804.05441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-15T22:17:54Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"21361d71bf5cbfcc116f4aff6ab6f67bfc8058fa1a8e12fd725d9d5a3bf06a20","abstract_canon_sha256":"ea11f1074db374f5675adce67bdc9764a0861810433e7954f42b6835cdff125f"},"schema_version":"1.0"},"canonical_sha256":"2bf4dffe81b40af4de701ca14cbe471750f1462ea65d3d398f67870bf7f0a331","source":{"kind":"arxiv","id":"1804.05441","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05441","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05441v1","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05441","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"FP2N77UBWQFP","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FP2N77UBWQFPJXTQ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FP2N77UB","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FP2N77UBWQFPJXTQDSQUZPSHC5","target":"record","payload":{"canonical_record":{"source":{"id":"1804.05441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-15T22:17:54Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"21361d71bf5cbfcc116f4aff6ab6f67bfc8058fa1a8e12fd725d9d5a3bf06a20","abstract_canon_sha256":"ea11f1074db374f5675adce67bdc9764a0861810433e7954f42b6835cdff125f"},"schema_version":"1.0"},"canonical_sha256":"2bf4dffe81b40af4de701ca14cbe471750f1462ea65d3d398f67870bf7f0a331","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:28.124933Z","signature_b64":"KwxK3ERDkbCkt1tVa4cZ4A1JCfOc6btFoRIdGMGIOFE4Ws7uLRT+CE8NgehPH8y2ibe9QKAHN/49XEn5+1puCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bf4dffe81b40af4de701ca14cbe471750f1462ea65d3d398f67870bf7f0a331","last_reissued_at":"2026-05-18T00:18:28.124549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:28.124549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.05441","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:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VQQt2sdHCbqtSoOkVOyw39ml+tW21d5pHtzuatJ3Q2PsRvS8Ygc8dKbzfz6x0S4InLfeCp8hhlWbfxwrKm1cAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:51:07.152932Z"},"content_sha256":"f7f39f66f1b0f6a21cc82c2cbd396686ceae1d58808cc9c8dc1ea4eb500f9737","schema_version":"1.0","event_id":"sha256:f7f39f66f1b0f6a21cc82c2cbd396686ceae1d58808cc9c8dc1ea4eb500f9737"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FP2N77UBWQFPJXTQDSQUZPSHC5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\\tilde{O}(n^{3/2})$ Rounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Matteo Pontecorvi, Udit Agarwal, Valerie King, Vijaya Ramachandran","submitted_at":"2018-04-15T22:17:54Z","abstract_excerpt":"We present a deterministic distributed algorithm to compute all-pairs shortest paths(APSP) in an edge-weighted directed or undirected graph. Our algorithm runs in $\\tilde{O}(n^{3/2})$ rounds in the Congest model, where $n$ is the number of nodes in the graph. This is the first $o(n^2)$ rounds deterministic distributed algorithm for the weighted APSP problem. Our algorithm is fairly simple and incorporates a deterministic distributed algorithm we develop for computing a `blocker set' \\cite{King99}, which has been used earlier in sequential dynamic computation of APSP."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05441","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:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ouw9JpkK8veAWXJ/29/fS5C0NIYQpTwtnaYCMIKNbDD+ijcT90iKhLyatqR5n3GRQrVp1XvBKEXD54sKAtN1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:51:07.153283Z"},"content_sha256":"4311de6f70e564e318370c1cd008341d66401bcbffa05d536800da5f4edc119c","schema_version":"1.0","event_id":"sha256:4311de6f70e564e318370c1cd008341d66401bcbffa05d536800da5f4edc119c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FP2N77UBWQFPJXTQDSQUZPSHC5/bundle.json","state_url":"https://pith.science/pith/FP2N77UBWQFPJXTQDSQUZPSHC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FP2N77UBWQFPJXTQDSQUZPSHC5/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-24T23:51:07Z","links":{"resolver":"https://pith.science/pith/FP2N77UBWQFPJXTQDSQUZPSHC5","bundle":"https://pith.science/pith/FP2N77UBWQFPJXTQDSQUZPSHC5/bundle.json","state":"https://pith.science/pith/FP2N77UBWQFPJXTQDSQUZPSHC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FP2N77UBWQFPJXTQDSQUZPSHC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FP2N77UBWQFPJXTQDSQUZPSHC5","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":"ea11f1074db374f5675adce67bdc9764a0861810433e7954f42b6835cdff125f","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-15T22:17:54Z","title_canon_sha256":"21361d71bf5cbfcc116f4aff6ab6f67bfc8058fa1a8e12fd725d9d5a3bf06a20"},"schema_version":"1.0","source":{"id":"1804.05441","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05441","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05441v1","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05441","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"FP2N77UBWQFP","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FP2N77UBWQFPJXTQ","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FP2N77UB","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:4311de6f70e564e318370c1cd008341d66401bcbffa05d536800da5f4edc119c","target":"graph","created_at":"2026-05-18T00:18:28Z","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 present a deterministic distributed algorithm to compute all-pairs shortest paths(APSP) in an edge-weighted directed or undirected graph. Our algorithm runs in $\\tilde{O}(n^{3/2})$ rounds in the Congest model, where $n$ is the number of nodes in the graph. This is the first $o(n^2)$ rounds deterministic distributed algorithm for the weighted APSP problem. Our algorithm is fairly simple and incorporates a deterministic distributed algorithm we develop for computing a `blocker set' \\cite{King99}, which has been used earlier in sequential dynamic computation of APSP.","authors_text":"Matteo Pontecorvi, Udit Agarwal, Valerie King, Vijaya Ramachandran","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-15T22:17:54Z","title":"A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\\tilde{O}(n^{3/2})$ Rounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05441","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:f7f39f66f1b0f6a21cc82c2cbd396686ceae1d58808cc9c8dc1ea4eb500f9737","target":"record","created_at":"2026-05-18T00:18:28Z","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":"ea11f1074db374f5675adce67bdc9764a0861810433e7954f42b6835cdff125f","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-15T22:17:54Z","title_canon_sha256":"21361d71bf5cbfcc116f4aff6ab6f67bfc8058fa1a8e12fd725d9d5a3bf06a20"},"schema_version":"1.0","source":{"id":"1804.05441","kind":"arxiv","version":1}},"canonical_sha256":"2bf4dffe81b40af4de701ca14cbe471750f1462ea65d3d398f67870bf7f0a331","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bf4dffe81b40af4de701ca14cbe471750f1462ea65d3d398f67870bf7f0a331","first_computed_at":"2026-05-18T00:18:28.124549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:28.124549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KwxK3ERDkbCkt1tVa4cZ4A1JCfOc6btFoRIdGMGIOFE4Ws7uLRT+CE8NgehPH8y2ibe9QKAHN/49XEn5+1puCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:28.124933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05441","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7f39f66f1b0f6a21cc82c2cbd396686ceae1d58808cc9c8dc1ea4eb500f9737","sha256:4311de6f70e564e318370c1cd008341d66401bcbffa05d536800da5f4edc119c"],"state_sha256":"1cbff89c95d1ef965d530030b75eb3f881b3a2a84ae316d2f3644b5bab3efd6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/Fhzi3md1w8E0r5PhpgInju8yu7KAJX9ZAQ20lWEF9gGTHq2xn00M4zNKssFPq/XYfne5CONHeNKhaAqQvBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:51:07.155366Z","bundle_sha256":"c9742ee01d7153f7031aa10ba1baa540e00de490b227847c17ccbf90e5011772"}}