{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZXYWNFXBXTTEZT4JTRLGVPCLBF","short_pith_number":"pith:ZXYWNFXB","canonical_record":{"source":{"id":"1807.08824","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-23T20:51:42Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"4605631ed7173bc5fa3ef7f60782a4484f860d3737ba2857939c7150ff9d61a6","abstract_canon_sha256":"7fe8e1a7ae6621d869c11dbcad3b018b6d4d2adc61843d6ea07d98b19a060a83"},"schema_version":"1.0"},"canonical_sha256":"cdf16696e1bce64ccf899c566abc4b095c8dcd76f60390ef29fb8fca33a3cc02","source":{"kind":"arxiv","id":"1807.08824","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08824","created_at":"2026-05-18T00:02:39Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08824v3","created_at":"2026-05-18T00:02:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08824","created_at":"2026-05-18T00:02:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZXYWNFXBXTTE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZXYWNFXBXTTEZT4J","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZXYWNFXB","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZXYWNFXBXTTEZT4JTRLGVPCLBF","target":"record","payload":{"canonical_record":{"source":{"id":"1807.08824","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-23T20:51:42Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"4605631ed7173bc5fa3ef7f60782a4484f860d3737ba2857939c7150ff9d61a6","abstract_canon_sha256":"7fe8e1a7ae6621d869c11dbcad3b018b6d4d2adc61843d6ea07d98b19a060a83"},"schema_version":"1.0"},"canonical_sha256":"cdf16696e1bce64ccf899c566abc4b095c8dcd76f60390ef29fb8fca33a3cc02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:39.625202Z","signature_b64":"GzzeLdgQrH5hWKWxWxDBOE5cuUvuqoKawY4Bpp22mqlRGFLYIMpy5YyBNkzRbDODWhOg1yO/7/43jJnFpxi3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdf16696e1bce64ccf899c566abc4b095c8dcd76f60390ef29fb8fca33a3cc02","last_reissued_at":"2026-05-18T00:02:39.624635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:39.624635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.08824","source_version":3,"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:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2jwB8JfyPZ5EMQDZ5yQVuiyFDi9UfxK4ENYNvHlcnvh6KOO5hRQ/YHMRxHKDmswDryShDGfxOHe5nAWC/pxMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:22:13.588870Z"},"content_sha256":"459b786d8b6556505e247f0bc26b42067e741adc81976e83f3df89962fa075cd","schema_version":"1.0","event_id":"sha256:459b786d8b6556505e247f0bc26b42067e741adc81976e83f3df89962fa075cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZXYWNFXBXTTEZT4JTRLGVPCLBF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Deterministic Distributed Algorithm for Weighted All Pairs Shortest Paths Through Pipelining","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-07-23T20:51:42Z","abstract_excerpt":"We present a new pipelined approach to compute all pairs shortest paths (APSP) in a directed graph with nonnegative integer edge weights (including zero weights) in the CONGEST model in the distributed setting. Our deterministic distributed algorithm computes shortest paths of distance at most $\\Delta$ for all pairs of vertices in at most $2 n \\sqrt{\\Delta} + 2n$ rounds, and more generally, it computes h-hop shortest paths for k sources in $2\\sqrt{nkh} + n + k$ rounds. The algorithm is simple, and it has some novel features and a nontrivial analysis.It uses only the directed edges in the graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08824","kind":"arxiv","version":3},"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:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hsHw54oQJl3jPBq2+Gluh1rKxA7daQoh3CzlNAur3jH8wgf8Ery9biMPhcW+gwPRsbDaSsKlltOqizW31SUPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:22:13.589218Z"},"content_sha256":"0d8fe43c6b61a7970d67c7a50af3f98dc9fa1b58691a3c52c4b4194d117502ac","schema_version":"1.0","event_id":"sha256:0d8fe43c6b61a7970d67c7a50af3f98dc9fa1b58691a3c52c4b4194d117502ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXYWNFXBXTTEZT4JTRLGVPCLBF/bundle.json","state_url":"https://pith.science/pith/ZXYWNFXBXTTEZT4JTRLGVPCLBF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXYWNFXBXTTEZT4JTRLGVPCLBF/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-24T22:22:13Z","links":{"resolver":"https://pith.science/pith/ZXYWNFXBXTTEZT4JTRLGVPCLBF","bundle":"https://pith.science/pith/ZXYWNFXBXTTEZT4JTRLGVPCLBF/bundle.json","state":"https://pith.science/pith/ZXYWNFXBXTTEZT4JTRLGVPCLBF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXYWNFXBXTTEZT4JTRLGVPCLBF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZXYWNFXBXTTEZT4JTRLGVPCLBF","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":"7fe8e1a7ae6621d869c11dbcad3b018b6d4d2adc61843d6ea07d98b19a060a83","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-23T20:51:42Z","title_canon_sha256":"4605631ed7173bc5fa3ef7f60782a4484f860d3737ba2857939c7150ff9d61a6"},"schema_version":"1.0","source":{"id":"1807.08824","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08824","created_at":"2026-05-18T00:02:39Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08824v3","created_at":"2026-05-18T00:02:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08824","created_at":"2026-05-18T00:02:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZXYWNFXBXTTE","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZXYWNFXBXTTEZT4J","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZXYWNFXB","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:0d8fe43c6b61a7970d67c7a50af3f98dc9fa1b58691a3c52c4b4194d117502ac","target":"graph","created_at":"2026-05-18T00:02:39Z","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 new pipelined approach to compute all pairs shortest paths (APSP) in a directed graph with nonnegative integer edge weights (including zero weights) in the CONGEST model in the distributed setting. Our deterministic distributed algorithm computes shortest paths of distance at most $\\Delta$ for all pairs of vertices in at most $2 n \\sqrt{\\Delta} + 2n$ rounds, and more generally, it computes h-hop shortest paths for k sources in $2\\sqrt{nkh} + n + k$ rounds. The algorithm is simple, and it has some novel features and a nontrivial analysis.It uses only the directed edges in the graph","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-07-23T20:51:42Z","title":"A Deterministic Distributed Algorithm for Weighted All Pairs Shortest Paths Through Pipelining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08824","kind":"arxiv","version":3},"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:459b786d8b6556505e247f0bc26b42067e741adc81976e83f3df89962fa075cd","target":"record","created_at":"2026-05-18T00:02:39Z","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":"7fe8e1a7ae6621d869c11dbcad3b018b6d4d2adc61843d6ea07d98b19a060a83","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-23T20:51:42Z","title_canon_sha256":"4605631ed7173bc5fa3ef7f60782a4484f860d3737ba2857939c7150ff9d61a6"},"schema_version":"1.0","source":{"id":"1807.08824","kind":"arxiv","version":3}},"canonical_sha256":"cdf16696e1bce64ccf899c566abc4b095c8dcd76f60390ef29fb8fca33a3cc02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdf16696e1bce64ccf899c566abc4b095c8dcd76f60390ef29fb8fca33a3cc02","first_computed_at":"2026-05-18T00:02:39.624635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:39.624635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GzzeLdgQrH5hWKWxWxDBOE5cuUvuqoKawY4Bpp22mqlRGFLYIMpy5YyBNkzRbDODWhOg1yO/7/43jJnFpxi3DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:39.625202Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08824","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:459b786d8b6556505e247f0bc26b42067e741adc81976e83f3df89962fa075cd","sha256:0d8fe43c6b61a7970d67c7a50af3f98dc9fa1b58691a3c52c4b4194d117502ac"],"state_sha256":"d5cdc7c9334c731bcf994d0de86ffcfb487e2a3c40e2065be9d974ac3d3cb13a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4OibMZFg7Lhs7DUMlcMixSMcte2AKWuARX9Tw5dAUImcJBkyW4n7p1mZv3whtwEHwAUbNXgt1cPA+Ft4nR1gCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:22:13.591205Z","bundle_sha256":"440c00a121283d45ef2f2509fbcba629d0690427c95a4c0548f6e590394dce3b"}}