{"paper":{"title":"Distributed Construction of Light Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arnold Filtser, Michael Elkin, Ofer Neiman","submitted_at":"2019-05-07T14:02:14Z","abstract_excerpt":"A $t$-{\\em spanner} $H$ of a weighted graph $G=(V,E,w)$ is a subgraph that approximates all pairwise distances up to a factor of $t$. The {\\em lightness} of $H$ is defined as the ratio between the weight of $H$ to that of the minimum spanning tree. An $(\\alpha,\\beta)$-{\\em Shallow Light Tree} (SLT) is a tree of lightness $\\beta$, that approximates all distances from a designated root vertex up to a factor of $\\alpha$. A long line of works resulted in efficient algorithms that produce (nearly) optimal light spanners and SLTs.\n  Some of the most notable algorithmic applications of light spanners"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02592","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"}