{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4J5FETHPB4X6OUN3WYBQMJADB3","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":"8a7482a42dd08b8770a29a3ea818b0349fa1ed0a10e0a898a1cbf0bff03ff4f1","cross_cats_sorted":["cs.DC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-21T20:28:52Z","title_canon_sha256":"d501bd6010d1323704e8d2bb005e3a1362594afa0743b3f849719fbf29e6052b"},"schema_version":"1.0","source":{"id":"1703.07417","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07417","created_at":"2026-05-18T00:35:41Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07417v3","created_at":"2026-05-18T00:35:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07417","created_at":"2026-05-18T00:35:41Z"},{"alias_kind":"pith_short_12","alias_value":"4J5FETHPB4X6","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4J5FETHPB4X6OUN3","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4J5FETHP","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:67cb23ae176c8bb4d2d268205e16ac1c5703726282dfcec060174a7ff30f653d","target":"graph","created_at":"2026-05-18T00:35:41Z","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":"Solving linear programs is often a challenging task in distributed settings. While there are good algorithms for solving packing and covering linear programs in a distributed manner (Kuhn et al.~2006), this is essentially the only class of linear programs for which such an algorithm is known. In this work we provide a distributed algorithm for solving a different class of convex programs which we call \"distance-bounded network design convex programs\". These can be thought of as relaxations of network design problems in which the connectivity requirement includes a distance constraint (most not","authors_text":"Michael Dinitz, Yasamin Nazari","cross_cats":["cs.DC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-21T20:28:52Z","title":"Distributed Distance-Bounded Network Design Through Distributed Convex Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07417","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:7c8bb81ed03fd824fe706bbb3023ba1568dbb1835de6299f02c572062489fce6","target":"record","created_at":"2026-05-18T00:35:41Z","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":"8a7482a42dd08b8770a29a3ea818b0349fa1ed0a10e0a898a1cbf0bff03ff4f1","cross_cats_sorted":["cs.DC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-21T20:28:52Z","title_canon_sha256":"d501bd6010d1323704e8d2bb005e3a1362594afa0743b3f849719fbf29e6052b"},"schema_version":"1.0","source":{"id":"1703.07417","kind":"arxiv","version":3}},"canonical_sha256":"e27a524cef0f2fe751bbb6030624030efad5fff1cfea9fa1c93d8f3b7d2e7c7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e27a524cef0f2fe751bbb6030624030efad5fff1cfea9fa1c93d8f3b7d2e7c7d","first_computed_at":"2026-05-18T00:35:41.567778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:41.567778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ALhzkeTVFpk4GtbNfVZGdHNyKKoMXXcsyfeyJtPnxKPihsP7iSoA2eM8VtHFMs17TjjTZVOKPZv+7uvyxXBZBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:41.568389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07417","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c8bb81ed03fd824fe706bbb3023ba1568dbb1835de6299f02c572062489fce6","sha256:67cb23ae176c8bb4d2d268205e16ac1c5703726282dfcec060174a7ff30f653d"],"state_sha256":"a782e6996ff93904027dec4d5478d9f7f9cfb6d2ec4bae3ef17aedda79755d39"}