{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UZNLM5Z7W2RQNZVION6KVEZCJX","short_pith_number":"pith:UZNLM5Z7","schema_version":"1.0","canonical_sha256":"a65ab6773fb6a306e6a8737caa93224dea669c8b129b872398d88fbb0ee43c92","source":{"kind":"arxiv","id":"1905.02592","version":1},"attestation_state":"computed","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"},"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":"1905.02592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T14:02:14Z","cross_cats_sorted":[],"title_canon_sha256":"70a88b9109032a76612829e0db486c86c2b69c5966495d161b4e410141948ceb","abstract_canon_sha256":"4d2180e691dc6ffcb59a56e2817a111dca84a9cef7f8fff133cfc4d6d768739a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:50.959865Z","signature_b64":"ZYf4tqaP4IeDG6jkjl5wJR6n4AtU6Ezl8qwClOndAYl3jt9pPQEByg6A77njUuW/11E81oRjxlYqkFvWXC1JAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a65ab6773fb6a306e6a8737caa93224dea669c8b129b872398d88fbb0ee43c92","last_reissued_at":"2026-05-17T23:46:50.959361Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:50.959361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.02592","created_at":"2026-05-17T23:46:50.959451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.02592v1","created_at":"2026-05-17T23:46:50.959451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02592","created_at":"2026-05-17T23:46:50.959451+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZNLM5Z7W2RQ","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZNLM5Z7W2RQNZVI","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZNLM5Z7","created_at":"2026-05-18T12:33:30.264802+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/UZNLM5Z7W2RQNZVION6KVEZCJX","json":"https://pith.science/pith/UZNLM5Z7W2RQNZVION6KVEZCJX.json","graph_json":"https://pith.science/api/pith-number/UZNLM5Z7W2RQNZVION6KVEZCJX/graph.json","events_json":"https://pith.science/api/pith-number/UZNLM5Z7W2RQNZVION6KVEZCJX/events.json","paper":"https://pith.science/paper/UZNLM5Z7"},"agent_actions":{"view_html":"https://pith.science/pith/UZNLM5Z7W2RQNZVION6KVEZCJX","download_json":"https://pith.science/pith/UZNLM5Z7W2RQNZVION6KVEZCJX.json","view_paper":"https://pith.science/paper/UZNLM5Z7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.02592&json=true","fetch_graph":"https://pith.science/api/pith-number/UZNLM5Z7W2RQNZVION6KVEZCJX/graph.json","fetch_events":"https://pith.science/api/pith-number/UZNLM5Z7W2RQNZVION6KVEZCJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZNLM5Z7W2RQNZVION6KVEZCJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZNLM5Z7W2RQNZVION6KVEZCJX/action/storage_attestation","attest_author":"https://pith.science/pith/UZNLM5Z7W2RQNZVION6KVEZCJX/action/author_attestation","sign_citation":"https://pith.science/pith/UZNLM5Z7W2RQNZVION6KVEZCJX/action/citation_signature","submit_replication":"https://pith.science/pith/UZNLM5Z7W2RQNZVION6KVEZCJX/action/replication_record"}},"created_at":"2026-05-17T23:46:50.959451+00:00","updated_at":"2026-05-17T23:46:50.959451+00:00"}