{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:HMDAHOAQCYQK6JM2L4YEPOE7E5","short_pith_number":"pith:HMDAHOAQ","schema_version":"1.0","canonical_sha256":"3b0603b8101620af259a5f3047b89f274ac3b3bbee9351291e535f7d0db5cf96","source":{"kind":"arxiv","id":"cs/0610003","version":2},"attestation_state":"computed","paper":{"title":"Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ittai Abraham, Ofer Neiman, Yair Bartal","submitted_at":"2006-10-01T10:58:06Z","abstract_excerpt":"This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a graph which strongly preserves distances in the graph is a fundamental problem in network design. We present scaling distortion embeddings where the distortion scales as a function of $\\epsilon$, with the guarantee that for each $\\epsilon$ the distortion of a fraction $1-\\epsilon$ of all pairs is bounded accordingly. Such a bound implies, in particular, that the \\emph{average distortion} and $\\ell_q$-distortions are s"},"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":"cs/0610003","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.DM","submitted_at":"2006-10-01T10:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"e13e7ecb9f202231d6476f117d7c0b0c0d843b02c05607a069d60a3dcc6ee10e","abstract_canon_sha256":"44e460a2a048023bc52062e9718131133ab883429f32c7db6eedd920ea6add65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:48.923911Z","signature_b64":"QYZnHTOB97oqOKhb/VyaRb4TNqwxK/lmPEoUTHbnUMUAhhJy4h2BQY7sdiA/axt6BHySyj5JanVou+IqK9vaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b0603b8101620af259a5f3047b89f274ac3b3bbee9351291e535f7d0db5cf96","last_reissued_at":"2026-05-18T01:06:48.923454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:48.923454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Ittai Abraham, Ofer Neiman, Yair Bartal","submitted_at":"2006-10-01T10:58:06Z","abstract_excerpt":"This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a graph which strongly preserves distances in the graph is a fundamental problem in network design. We present scaling distortion embeddings where the distortion scales as a function of $\\epsilon$, with the guarantee that for each $\\epsilon$ the distortion of a fraction $1-\\epsilon$ of all pairs is bounded accordingly. Such a bound implies, in particular, that the \\emph{average distortion} and $\\ell_q$-distortions are s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0610003","kind":"arxiv","version":2},"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":"cs/0610003","created_at":"2026-05-18T01:06:48.923528+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0610003v2","created_at":"2026-05-18T01:06:48.923528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610003","created_at":"2026-05-18T01:06:48.923528+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMDAHOAQCYQK","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMDAHOAQCYQK6JM2","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMDAHOAQ","created_at":"2026-05-18T12:25:53.939244+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/HMDAHOAQCYQK6JM2L4YEPOE7E5","json":"https://pith.science/pith/HMDAHOAQCYQK6JM2L4YEPOE7E5.json","graph_json":"https://pith.science/api/pith-number/HMDAHOAQCYQK6JM2L4YEPOE7E5/graph.json","events_json":"https://pith.science/api/pith-number/HMDAHOAQCYQK6JM2L4YEPOE7E5/events.json","paper":"https://pith.science/paper/HMDAHOAQ"},"agent_actions":{"view_html":"https://pith.science/pith/HMDAHOAQCYQK6JM2L4YEPOE7E5","download_json":"https://pith.science/pith/HMDAHOAQCYQK6JM2L4YEPOE7E5.json","view_paper":"https://pith.science/paper/HMDAHOAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0610003&json=true","fetch_graph":"https://pith.science/api/pith-number/HMDAHOAQCYQK6JM2L4YEPOE7E5/graph.json","fetch_events":"https://pith.science/api/pith-number/HMDAHOAQCYQK6JM2L4YEPOE7E5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMDAHOAQCYQK6JM2L4YEPOE7E5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMDAHOAQCYQK6JM2L4YEPOE7E5/action/storage_attestation","attest_author":"https://pith.science/pith/HMDAHOAQCYQK6JM2L4YEPOE7E5/action/author_attestation","sign_citation":"https://pith.science/pith/HMDAHOAQCYQK6JM2L4YEPOE7E5/action/citation_signature","submit_replication":"https://pith.science/pith/HMDAHOAQCYQK6JM2L4YEPOE7E5/action/replication_record"}},"created_at":"2026-05-18T01:06:48.923528+00:00","updated_at":"2026-05-18T01:06:48.923528+00:00"}