{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:H3F67J4SLCTOJE72N3IFZJDJ3A","short_pith_number":"pith:H3F67J4S","schema_version":"1.0","canonical_sha256":"3ecbefa79258a6e493fa6ed05ca469d81d7b0b5521c9bcd9da652d3d207e12cc","source":{"kind":"arxiv","id":"0801.3581","version":1},"attestation_state":"computed","paper":{"title":"Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners","license":"","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Michael Elkin, Shay Solomon, Yefim Dinitz","submitted_at":"2008-01-23T13:57:00Z","abstract_excerpt":"We show that for every $n$-point metric space $M$ there exists a spanning tree $T$ with unweighted diameter $O(\\log n)$ and weight $\\omega(T) = O(\\log n) \\cdot \\omega(MST(M))$. Moreover, there is a designated point $rt$ such that for every point $v$, $dist_T(rt,v) \\le (1+\\epsilon) \\cdot dist_M(rt,v)$, for an arbitrarily small constant $\\epsilon > 0$. We extend this result, and provide a tradeoff between unweighted diameter and weight, and prove that this tradeoff is \\emph{tight up to constant factors} in the entire range of parameters. These results enable us to settle a long-standing open que"},"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":"0801.3581","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CG","submitted_at":"2008-01-23T13:57:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"759ebdec693b7dc49ecfb2070f52ac9ebbc4c98573972220ace80f3a2c5ca3c0","abstract_canon_sha256":"86b875fe2665f0a6c266658245daf424b8de5068fddfa71f06a86e9fcc00bbd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:36.667561Z","signature_b64":"Em1LOQEhBDSgU9DhS2GksS9VgmwNHgcuHRzkd8n0I1+cIPbBT7dTv+h2fFtXJ2OKE2IxKmygjY0SR7Ha+nIqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ecbefa79258a6e493fa6ed05ca469d81d7b0b5521c9bcd9da652d3d207e12cc","last_reissued_at":"2026-05-18T04:14:36.666961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:36.666961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners","license":"","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Michael Elkin, Shay Solomon, Yefim Dinitz","submitted_at":"2008-01-23T13:57:00Z","abstract_excerpt":"We show that for every $n$-point metric space $M$ there exists a spanning tree $T$ with unweighted diameter $O(\\log n)$ and weight $\\omega(T) = O(\\log n) \\cdot \\omega(MST(M))$. Moreover, there is a designated point $rt$ such that for every point $v$, $dist_T(rt,v) \\le (1+\\epsilon) \\cdot dist_M(rt,v)$, for an arbitrarily small constant $\\epsilon > 0$. We extend this result, and provide a tradeoff between unweighted diameter and weight, and prove that this tradeoff is \\emph{tight up to constant factors} in the entire range of parameters. These results enable us to settle a long-standing open que"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.3581","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":"0801.3581","created_at":"2026-05-18T04:14:36.667048+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.3581v1","created_at":"2026-05-18T04:14:36.667048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.3581","created_at":"2026-05-18T04:14:36.667048+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3F67J4SLCTO","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3F67J4SLCTOJE72","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3F67J4S","created_at":"2026-05-18T12:25:57.157939+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/H3F67J4SLCTOJE72N3IFZJDJ3A","json":"https://pith.science/pith/H3F67J4SLCTOJE72N3IFZJDJ3A.json","graph_json":"https://pith.science/api/pith-number/H3F67J4SLCTOJE72N3IFZJDJ3A/graph.json","events_json":"https://pith.science/api/pith-number/H3F67J4SLCTOJE72N3IFZJDJ3A/events.json","paper":"https://pith.science/paper/H3F67J4S"},"agent_actions":{"view_html":"https://pith.science/pith/H3F67J4SLCTOJE72N3IFZJDJ3A","download_json":"https://pith.science/pith/H3F67J4SLCTOJE72N3IFZJDJ3A.json","view_paper":"https://pith.science/paper/H3F67J4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.3581&json=true","fetch_graph":"https://pith.science/api/pith-number/H3F67J4SLCTOJE72N3IFZJDJ3A/graph.json","fetch_events":"https://pith.science/api/pith-number/H3F67J4SLCTOJE72N3IFZJDJ3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3F67J4SLCTOJE72N3IFZJDJ3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3F67J4SLCTOJE72N3IFZJDJ3A/action/storage_attestation","attest_author":"https://pith.science/pith/H3F67J4SLCTOJE72N3IFZJDJ3A/action/author_attestation","sign_citation":"https://pith.science/pith/H3F67J4SLCTOJE72N3IFZJDJ3A/action/citation_signature","submit_replication":"https://pith.science/pith/H3F67J4SLCTOJE72N3IFZJDJ3A/action/replication_record"}},"created_at":"2026-05-18T04:14:36.667048+00:00","updated_at":"2026-05-18T04:14:36.667048+00:00"}