{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IXKDBUP5JRBDWEDYG3DA4L6ZAD","short_pith_number":"pith:IXKDBUP5","schema_version":"1.0","canonical_sha256":"45d430d1fd4c423b107836c60e2fd900c2e381ebbd0a2dc8a919bddee224cc38","source":{"kind":"arxiv","id":"1806.03365","version":1},"attestation_state":"computed","paper":{"title":"Distributed Algorithms for Minimum Degree Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Calvin Newport, Magn\\'us M. Halld\\'orsson, Michael Dinitz","submitted_at":"2018-06-08T22:21:53Z","abstract_excerpt":"The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree $T$ for graph $G=(V,E)$ with $n$ vertices, such that the maximum degree $d$ of $T$ is the smallest among all spanning trees of $G$. In this paper, we present two new distributed approximation algorithms for the MDST problem. Our first result is a randomized distributed algorithm that constructs a spanning tree of maximum degree $\\hat d = O(d\\log{n})$. It requires $O((D + \\sqrt{n}) \\log^2 n)$ rounds (w.h.p.), where $D$ is the graph diameter, which matches (within log factors) the optimal round complexit"},"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":"1806.03365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-08T22:21:53Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"1925f299147995bba16de5431fa59c20eeb069234716324ca48c91e51cb77503","abstract_canon_sha256":"59c5b95d534c1b26e2b2d09a9c292c6cb1c4735d219d8a5c8837a0a0860cac66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:43.611294Z","signature_b64":"A6YkQjmAqxLmRaW/KNIX59XrB3EFOhvHT0/TgstkKuew2dQmxq0vnwRSt/YOLhQWK/sMk+x0QDkhvwvuDm1QCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45d430d1fd4c423b107836c60e2fd900c2e381ebbd0a2dc8a919bddee224cc38","last_reissued_at":"2026-05-18T00:13:43.610666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:43.610666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Algorithms for Minimum Degree Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Calvin Newport, Magn\\'us M. Halld\\'orsson, Michael Dinitz","submitted_at":"2018-06-08T22:21:53Z","abstract_excerpt":"The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree $T$ for graph $G=(V,E)$ with $n$ vertices, such that the maximum degree $d$ of $T$ is the smallest among all spanning trees of $G$. In this paper, we present two new distributed approximation algorithms for the MDST problem. Our first result is a randomized distributed algorithm that constructs a spanning tree of maximum degree $\\hat d = O(d\\log{n})$. It requires $O((D + \\sqrt{n}) \\log^2 n)$ rounds (w.h.p.), where $D$ is the graph diameter, which matches (within log factors) the optimal round complexit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03365","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":"1806.03365","created_at":"2026-05-18T00:13:43.610778+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03365v1","created_at":"2026-05-18T00:13:43.610778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03365","created_at":"2026-05-18T00:13:43.610778+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXKDBUP5JRBD","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXKDBUP5JRBDWEDY","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXKDBUP5","created_at":"2026-05-18T12:32:31.084164+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/IXKDBUP5JRBDWEDYG3DA4L6ZAD","json":"https://pith.science/pith/IXKDBUP5JRBDWEDYG3DA4L6ZAD.json","graph_json":"https://pith.science/api/pith-number/IXKDBUP5JRBDWEDYG3DA4L6ZAD/graph.json","events_json":"https://pith.science/api/pith-number/IXKDBUP5JRBDWEDYG3DA4L6ZAD/events.json","paper":"https://pith.science/paper/IXKDBUP5"},"agent_actions":{"view_html":"https://pith.science/pith/IXKDBUP5JRBDWEDYG3DA4L6ZAD","download_json":"https://pith.science/pith/IXKDBUP5JRBDWEDYG3DA4L6ZAD.json","view_paper":"https://pith.science/paper/IXKDBUP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03365&json=true","fetch_graph":"https://pith.science/api/pith-number/IXKDBUP5JRBDWEDYG3DA4L6ZAD/graph.json","fetch_events":"https://pith.science/api/pith-number/IXKDBUP5JRBDWEDYG3DA4L6ZAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXKDBUP5JRBDWEDYG3DA4L6ZAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXKDBUP5JRBDWEDYG3DA4L6ZAD/action/storage_attestation","attest_author":"https://pith.science/pith/IXKDBUP5JRBDWEDYG3DA4L6ZAD/action/author_attestation","sign_citation":"https://pith.science/pith/IXKDBUP5JRBDWEDYG3DA4L6ZAD/action/citation_signature","submit_replication":"https://pith.science/pith/IXKDBUP5JRBDWEDYG3DA4L6ZAD/action/replication_record"}},"created_at":"2026-05-18T00:13:43.610778+00:00","updated_at":"2026-05-18T00:13:43.610778+00:00"}