{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:V5HA3FYCFDR7O4SGEKUFD2EKTY","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":"e8190af14a90d7126ab04d37890eff37fd7cd52c15f7be93cd437fd171fe80bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-20T15:30:46Z","title_canon_sha256":"6ae5a4231246479615e1d62acb191cbda168522a50ff9b6ded128e14ea244677"},"schema_version":"1.0","source":{"id":"1403.5171","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5171","created_at":"2026-05-18T02:51:22Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5171v2","created_at":"2026-05-18T02:51:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5171","created_at":"2026-05-18T02:51:22Z"},{"alias_kind":"pith_short_12","alias_value":"V5HA3FYCFDR7","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"V5HA3FYCFDR7O4SG","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"V5HA3FYC","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:7ee37f2b577cfd30b6bfc6a5f1d6b3fb3335b72e828221bf3715d23ea5efaea3","target":"graph","created_at":"2026-05-18T02:51:22Z","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":"A distributed network is modeled by a graph having $n$ nodes (processors) and diameter $D$. We study the time complexity of approximating {\\em weighted} (undirected) shortest paths on distributed networks with a $O(\\log n)$ {\\em bandwidth restriction} on edges (the standard synchronous \\congest model). The question whether approximation algorithms help speed up the shortest paths (more precisely distance computation) was raised since at least 2004 by Elkin (SIGACT News 2004). The unweighted case of this problem is well-understood while its weighted counterpart is fundamental problem in the are","authors_text":"Danupon Nanongkai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-20T15:30:46Z","title":"Distributed Approximation Algorithms for Weighted Shortest Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5171","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:66fe8756cc3a05147aa5dcd7f42b3d5258d5c73b6df50485a8a91555e6282b20","target":"record","created_at":"2026-05-18T02:51:22Z","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":"e8190af14a90d7126ab04d37890eff37fd7cd52c15f7be93cd437fd171fe80bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-20T15:30:46Z","title_canon_sha256":"6ae5a4231246479615e1d62acb191cbda168522a50ff9b6ded128e14ea244677"},"schema_version":"1.0","source":{"id":"1403.5171","kind":"arxiv","version":2}},"canonical_sha256":"af4e0d970228e3f7724622a851e88a9e081686cbbe8558ab55a22c1bf6255fb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af4e0d970228e3f7724622a851e88a9e081686cbbe8558ab55a22c1bf6255fb1","first_computed_at":"2026-05-18T02:51:22.821904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:22.821904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oW/uUcZ1paanZYM4edr5U+eQZFx6KoX76bt6PpUvRZLGwjZ64KMFDffbsG8DERIhC+dXpAdGjh2hYVaZpX4TAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:22.822396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.5171","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66fe8756cc3a05147aa5dcd7f42b3d5258d5c73b6df50485a8a91555e6282b20","sha256:7ee37f2b577cfd30b6bfc6a5f1d6b3fb3335b72e828221bf3715d23ea5efaea3"],"state_sha256":"b133462cbf974797cc0a371c713a4674bb73ff005076e137ef6357c9aca2c1d5"}