{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XDLHBHS5R3N47E6VPEB6SFTRP3","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":"dae99035dbe72e603e378c891bb198eb3888e932ec8b6ce6104750542aa55ce8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-06-05T00:08:07Z","title_canon_sha256":"0a3f5f63df38acb74a0c65161a50f4e630a5b0bd606eca81c3b9ec13f33fd065"},"schema_version":"1.0","source":{"id":"1406.1244","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.1244","created_at":"2026-05-18T02:50:23Z"},{"alias_kind":"arxiv_version","alias_value":"1406.1244v1","created_at":"2026-05-18T02:50:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1244","created_at":"2026-05-18T02:50:23Z"},{"alias_kind":"pith_short_12","alias_value":"XDLHBHS5R3N4","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XDLHBHS5R3N47E6V","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XDLHBHS5","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:2395c407dab1a408277943beca6b413990c788b5bbb1bf4f6445f6b0fa1f4d3c","target":"graph","created_at":"2026-05-18T02:50:23Z","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 study the NP-hard problem of approximating a Minimum Routing Cost Spanning Tree in the message passing model with limited bandwidth (CONGEST model). In this problem one tries to find a spanning tree of a graph $G$ over $n$ nodes that minimizes the sum of distances between all pairs of nodes. In the considered model every node can transmit a different (but short) message to each of its neighbors in each synchronous round. We provide a randomized $(2+\\epsilon)$-approximation with runtime $O(D+\\frac{\\log n}{\\epsilon})$ for unweighted graphs. Here, $D$ is the diameter of $G$. This improves over","authors_text":"Alexandra Hochuli, Roger Wattenhofer, Stephan Holzer","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-06-05T00:08:07Z","title":"Distributed Approximation of Minimum Routing Cost Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1244","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:16c43198bfd8a9c8049a4dbca7ad9a5e12e2148f1f8ef53f3492fefeb140eb1a","target":"record","created_at":"2026-05-18T02:50:23Z","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":"dae99035dbe72e603e378c891bb198eb3888e932ec8b6ce6104750542aa55ce8","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-06-05T00:08:07Z","title_canon_sha256":"0a3f5f63df38acb74a0c65161a50f4e630a5b0bd606eca81c3b9ec13f33fd065"},"schema_version":"1.0","source":{"id":"1406.1244","kind":"arxiv","version":1}},"canonical_sha256":"b8d6709e5d8edbcf93d57903e916717ee1ca3d66927c16f94cbecd3af3a9ed2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8d6709e5d8edbcf93d57903e916717ee1ca3d66927c16f94cbecd3af3a9ed2e","first_computed_at":"2026-05-18T02:50:23.689653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:23.689653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"feL4myTVGxI6VHkLOcCxwlR0zwVoEqs28Xj6otiu7js1q+MPlG7zwRt4eCDRn/FkzAZlFxsqLCmiFVtuG6gkDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:23.690283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.1244","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16c43198bfd8a9c8049a4dbca7ad9a5e12e2148f1f8ef53f3492fefeb140eb1a","sha256:2395c407dab1a408277943beca6b413990c788b5bbb1bf4f6445f6b0fa1f4d3c"],"state_sha256":"a7d7f0741486ab0494810ca2e25093535a24375dbb7d5f40069e777d89765cd3"}