{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:HMDAHOAQCYQK6JM2L4YEPOE7E5","short_pith_number":"pith:HMDAHOAQ","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"},"canonical_sha256":"3b0603b8101620af259a5f3047b89f274ac3b3bbee9351291e535f7d0db5cf96","source":{"kind":"arxiv","id":"cs/0610003","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0610003","created_at":"2026-05-18T01:06:48Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0610003v2","created_at":"2026-05-18T01:06:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610003","created_at":"2026-05-18T01:06:48Z"},{"alias_kind":"pith_short_12","alias_value":"HMDAHOAQCYQK","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"HMDAHOAQCYQK6JM2","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"HMDAHOAQ","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:HMDAHOAQCYQK6JM2L4YEPOE7E5","target":"record","payload":{"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"},"canonical_sha256":"3b0603b8101620af259a5f3047b89f274ac3b3bbee9351291e535f7d0db5cf96","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"},"source_kind":"arxiv","source_id":"cs/0610003","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:06:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8zeqAoxxfAkr5H4Fjpy4CQ3gdNMOfHcy+NlUkv+4eGwRVK3FN+PUEraLpXPHdZrWXEu6VbvPheSEH0W7BZQyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:30:52.880819Z"},"content_sha256":"d71c52fdfa763d93a3efd978a55f3266ea66b86d70f289ff5242b58380f7fe2d","schema_version":"1.0","event_id":"sha256:d71c52fdfa763d93a3efd978a55f3266ea66b86d70f289ff5242b58380f7fe2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:HMDAHOAQCYQK6JM2L4YEPOE7E5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:06:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+4CA64MfxVcsA5nGA3m+ZGUkTy6B06+kPwY/CcfAYyh9Oy9lWIHYgk83a3GYdurK481SGfWNQ8qFvSA5D5sDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:30:52.881506Z"},"content_sha256":"c0f2108df8e6a9fa67405830019b335ce5a24d9b3215d97b06fcc703abb471cf","schema_version":"1.0","event_id":"sha256:c0f2108df8e6a9fa67405830019b335ce5a24d9b3215d97b06fcc703abb471cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMDAHOAQCYQK6JM2L4YEPOE7E5/bundle.json","state_url":"https://pith.science/pith/HMDAHOAQCYQK6JM2L4YEPOE7E5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMDAHOAQCYQK6JM2L4YEPOE7E5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T00:30:52Z","links":{"resolver":"https://pith.science/pith/HMDAHOAQCYQK6JM2L4YEPOE7E5","bundle":"https://pith.science/pith/HMDAHOAQCYQK6JM2L4YEPOE7E5/bundle.json","state":"https://pith.science/pith/HMDAHOAQCYQK6JM2L4YEPOE7E5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMDAHOAQCYQK6JM2L4YEPOE7E5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:HMDAHOAQCYQK6JM2L4YEPOE7E5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"44e460a2a048023bc52062e9718131133ab883429f32c7db6eedd920ea6add65","cross_cats_sorted":[],"license":"","primary_cat":"cs.DM","submitted_at":"2006-10-01T10:58:06Z","title_canon_sha256":"e13e7ecb9f202231d6476f117d7c0b0c0d843b02c05607a069d60a3dcc6ee10e"},"schema_version":"1.0","source":{"id":"cs/0610003","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0610003","created_at":"2026-05-18T01:06:48Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0610003v2","created_at":"2026-05-18T01:06:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0610003","created_at":"2026-05-18T01:06:48Z"},{"alias_kind":"pith_short_12","alias_value":"HMDAHOAQCYQK","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"HMDAHOAQCYQK6JM2","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"HMDAHOAQ","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:c0f2108df8e6a9fa67405830019b335ce5a24d9b3215d97b06fcc703abb471cf","target":"graph","created_at":"2026-05-18T01:06:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ittai Abraham, Ofer Neiman, Yair Bartal","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DM","submitted_at":"2006-10-01T10:58:06Z","title":"Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0610003","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d71c52fdfa763d93a3efd978a55f3266ea66b86d70f289ff5242b58380f7fe2d","target":"record","created_at":"2026-05-18T01:06:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"44e460a2a048023bc52062e9718131133ab883429f32c7db6eedd920ea6add65","cross_cats_sorted":[],"license":"","primary_cat":"cs.DM","submitted_at":"2006-10-01T10:58:06Z","title_canon_sha256":"e13e7ecb9f202231d6476f117d7c0b0c0d843b02c05607a069d60a3dcc6ee10e"},"schema_version":"1.0","source":{"id":"cs/0610003","kind":"arxiv","version":2}},"canonical_sha256":"3b0603b8101620af259a5f3047b89f274ac3b3bbee9351291e535f7d0db5cf96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b0603b8101620af259a5f3047b89f274ac3b3bbee9351291e535f7d0db5cf96","first_computed_at":"2026-05-18T01:06:48.923454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:48.923454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QYZnHTOB97oqOKhb/VyaRb4TNqwxK/lmPEoUTHbnUMUAhhJy4h2BQY7sdiA/axt6BHySyj5JanVou+IqK9vaDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:48.923911Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0610003","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d71c52fdfa763d93a3efd978a55f3266ea66b86d70f289ff5242b58380f7fe2d","sha256:c0f2108df8e6a9fa67405830019b335ce5a24d9b3215d97b06fcc703abb471cf"],"state_sha256":"4fa2647581c404233a2ebd929fe3e6387f2d293cc4f3438e175a8263b998e865"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0dJ8zZOTM/68SzCeKDFxReT7ZVNetnYwj/F1QsugbQTlsF9wycSO3cEHZQmPf459TCJy1TSIBT+8OC0bHUGgDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:30:52.885140Z","bundle_sha256":"8c3eea054128caf6f4967faac816396a52b976120df7bfff9888a29828dd2780"}}