{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XDLHBHS5R3N47E6VPEB6SFTRP3","short_pith_number":"pith:XDLHBHS5","schema_version":"1.0","canonical_sha256":"b8d6709e5d8edbcf93d57903e916717ee1ca3d66927c16f94cbecd3af3a9ed2e","source":{"kind":"arxiv","id":"1406.1244","version":1},"attestation_state":"computed","paper":{"title":"Distributed Approximation of Minimum Routing Cost Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alexandra Hochuli, Roger Wattenhofer, Stephan Holzer","submitted_at":"2014-06-05T00:08:07Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1406.1244","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-06-05T00:08:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0a3f5f63df38acb74a0c65161a50f4e630a5b0bd606eca81c3b9ec13f33fd065","abstract_canon_sha256":"dae99035dbe72e603e378c891bb198eb3888e932ec8b6ce6104750542aa55ce8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:23.690283Z","signature_b64":"feL4myTVGxI6VHkLOcCxwlR0zwVoEqs28Xj6otiu7js1q+MPlG7zwRt4eCDRn/FkzAZlFxsqLCmiFVtuG6gkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8d6709e5d8edbcf93d57903e916717ee1ca3d66927c16f94cbecd3af3a9ed2e","last_reissued_at":"2026-05-18T02:50:23.689653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:23.689653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Approximation of Minimum Routing Cost Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Alexandra Hochuli, Roger Wattenhofer, Stephan Holzer","submitted_at":"2014-06-05T00:08:07Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1244","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.1244","created_at":"2026-05-18T02:50:23.689739+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1244v1","created_at":"2026-05-18T02:50:23.689739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1244","created_at":"2026-05-18T02:50:23.689739+00:00"},{"alias_kind":"pith_short_12","alias_value":"XDLHBHS5R3N4","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XDLHBHS5R3N47E6V","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XDLHBHS5","created_at":"2026-05-18T12:28:57.508820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XDLHBHS5R3N47E6VPEB6SFTRP3","json":"https://pith.science/pith/XDLHBHS5R3N47E6VPEB6SFTRP3.json","graph_json":"https://pith.science/api/pith-number/XDLHBHS5R3N47E6VPEB6SFTRP3/graph.json","events_json":"https://pith.science/api/pith-number/XDLHBHS5R3N47E6VPEB6SFTRP3/events.json","paper":"https://pith.science/paper/XDLHBHS5"},"agent_actions":{"view_html":"https://pith.science/pith/XDLHBHS5R3N47E6VPEB6SFTRP3","download_json":"https://pith.science/pith/XDLHBHS5R3N47E6VPEB6SFTRP3.json","view_paper":"https://pith.science/paper/XDLHBHS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1244&json=true","fetch_graph":"https://pith.science/api/pith-number/XDLHBHS5R3N47E6VPEB6SFTRP3/graph.json","fetch_events":"https://pith.science/api/pith-number/XDLHBHS5R3N47E6VPEB6SFTRP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XDLHBHS5R3N47E6VPEB6SFTRP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XDLHBHS5R3N47E6VPEB6SFTRP3/action/storage_attestation","attest_author":"https://pith.science/pith/XDLHBHS5R3N47E6VPEB6SFTRP3/action/author_attestation","sign_citation":"https://pith.science/pith/XDLHBHS5R3N47E6VPEB6SFTRP3/action/citation_signature","submit_replication":"https://pith.science/pith/XDLHBHS5R3N47E6VPEB6SFTRP3/action/replication_record"}},"created_at":"2026-05-18T02:50:23.689739+00:00","updated_at":"2026-05-18T02:50:23.689739+00:00"}