{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2IEXBN6MZTKCOLNZ2MOIDHWCPE","short_pith_number":"pith:2IEXBN6M","canonical_record":{"source":{"id":"2601.15470","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-01-21T21:09:18Z","cross_cats_sorted":[],"title_canon_sha256":"f70d843ef44489e722d87aa0ec97e0178242df4a3413ce90e917e6bae64fb163","abstract_canon_sha256":"cc555627d9e6178631eda62abcf88bfc3384dd2bf752b3dcd341cc39593c0159"},"schema_version":"1.0"},"canonical_sha256":"d20970b7ccccd4272db9d31c819ec2793b39c15b5760cc5030c6c5ab50b37d1a","source":{"kind":"arxiv","id":"2601.15470","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.15470","created_at":"2026-06-25T00:18:12Z"},{"alias_kind":"arxiv_version","alias_value":"2601.15470v3","created_at":"2026-06-25T00:18:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.15470","created_at":"2026-06-25T00:18:12Z"},{"alias_kind":"pith_short_12","alias_value":"2IEXBN6MZTKC","created_at":"2026-06-25T00:18:12Z"},{"alias_kind":"pith_short_16","alias_value":"2IEXBN6MZTKCOLNZ","created_at":"2026-06-25T00:18:12Z"},{"alias_kind":"pith_short_8","alias_value":"2IEXBN6M","created_at":"2026-06-25T00:18:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2IEXBN6MZTKCOLNZ2MOIDHWCPE","target":"record","payload":{"canonical_record":{"source":{"id":"2601.15470","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-01-21T21:09:18Z","cross_cats_sorted":[],"title_canon_sha256":"f70d843ef44489e722d87aa0ec97e0178242df4a3413ce90e917e6bae64fb163","abstract_canon_sha256":"cc555627d9e6178631eda62abcf88bfc3384dd2bf752b3dcd341cc39593c0159"},"schema_version":"1.0"},"canonical_sha256":"d20970b7ccccd4272db9d31c819ec2793b39c15b5760cc5030c6c5ab50b37d1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T00:18:12.396126Z","signature_b64":"LQimBYWd6uK70BbtToC9JLpqlw4WiIM0RU0GBzhPVRQjSdhHjmj46zQJ1mmeeqzugmPc2c82V6rUZ0hxt/mLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d20970b7ccccd4272db9d31c819ec2793b39c15b5760cc5030c6c5ab50b37d1a","last_reissued_at":"2026-06-25T00:18:12.395680Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T00:18:12.395680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.15470","source_version":3,"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-06-25T00:18:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jgfrSMV3BvHqhoUcxm3QHTPeROq6V33yVEMxtPELdvkplIl4LLVSVp88TtIZw1VYjGRDHSMMyj7HlqQyBNCADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T09:44:06.593818Z"},"content_sha256":"86e1f3fcc3b1737bd8643d1898b99628a817f6a6265a3aeb7ad888a3f559484c","schema_version":"1.0","event_id":"sha256:86e1f3fcc3b1737bd8643d1898b99628a817f6a6265a3aeb7ad888a3f559484c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2IEXBN6MZTKCOLNZ2MOIDHWCPE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bi-Lipschitz extensions and outlier embeddings into trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arnold Filtser, Kristin Sheridan, Shuchi Chawla, Yoni Trachtenberg","submitted_at":"2026-01-21T21:09:18Z","abstract_excerpt":"We develop low distortion embeddings with outliers from arbitrary metrics into hierarchically separated trees (HSTs). In particular, we develop an efficient algorithm that for any $\\epsilon>0$, given an input metric $(X,d)$, and a probabilistic embedding of all but $k$ points from $X$ into HSTs with distortion $c$, samples from a probabilistic embedding of all but $O(\\frac{k}{\\epsilon}\\log k)$ points into HSTs that achieves distortion at most $(32+\\epsilon)c$.\n  Our results are based on two key technical components. First, we extend an algorithm of Munagala et al. [2023] for minimizing the dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.15470","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.15470/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-25T00:18:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TIGUpB/sOtEgD1yjVXQKxHjRcLTACFpVwUdLlE7YqaPxvKo/EdCuB34pNHkC4u8qZ4QyUTFcsd8ePhcRcuuJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T09:44:06.594190Z"},"content_sha256":"5036ca9c2981a5270c8e386164e8e63e2a1d866b5e7c088cb79d6525a39b5dcb","schema_version":"1.0","event_id":"sha256:5036ca9c2981a5270c8e386164e8e63e2a1d866b5e7c088cb79d6525a39b5dcb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2IEXBN6MZTKCOLNZ2MOIDHWCPE/bundle.json","state_url":"https://pith.science/pith/2IEXBN6MZTKCOLNZ2MOIDHWCPE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2IEXBN6MZTKCOLNZ2MOIDHWCPE/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-28T09:44:06Z","links":{"resolver":"https://pith.science/pith/2IEXBN6MZTKCOLNZ2MOIDHWCPE","bundle":"https://pith.science/pith/2IEXBN6MZTKCOLNZ2MOIDHWCPE/bundle.json","state":"https://pith.science/pith/2IEXBN6MZTKCOLNZ2MOIDHWCPE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2IEXBN6MZTKCOLNZ2MOIDHWCPE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2IEXBN6MZTKCOLNZ2MOIDHWCPE","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":"cc555627d9e6178631eda62abcf88bfc3384dd2bf752b3dcd341cc39593c0159","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-01-21T21:09:18Z","title_canon_sha256":"f70d843ef44489e722d87aa0ec97e0178242df4a3413ce90e917e6bae64fb163"},"schema_version":"1.0","source":{"id":"2601.15470","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.15470","created_at":"2026-06-25T00:18:12Z"},{"alias_kind":"arxiv_version","alias_value":"2601.15470v3","created_at":"2026-06-25T00:18:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.15470","created_at":"2026-06-25T00:18:12Z"},{"alias_kind":"pith_short_12","alias_value":"2IEXBN6MZTKC","created_at":"2026-06-25T00:18:12Z"},{"alias_kind":"pith_short_16","alias_value":"2IEXBN6MZTKCOLNZ","created_at":"2026-06-25T00:18:12Z"},{"alias_kind":"pith_short_8","alias_value":"2IEXBN6M","created_at":"2026-06-25T00:18:12Z"}],"graph_snapshots":[{"event_id":"sha256:5036ca9c2981a5270c8e386164e8e63e2a1d866b5e7c088cb79d6525a39b5dcb","target":"graph","created_at":"2026-06-25T00:18:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2601.15470/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop low distortion embeddings with outliers from arbitrary metrics into hierarchically separated trees (HSTs). In particular, we develop an efficient algorithm that for any $\\epsilon>0$, given an input metric $(X,d)$, and a probabilistic embedding of all but $k$ points from $X$ into HSTs with distortion $c$, samples from a probabilistic embedding of all but $O(\\frac{k}{\\epsilon}\\log k)$ points into HSTs that achieves distortion at most $(32+\\epsilon)c$.\n  Our results are based on two key technical components. First, we extend an algorithm of Munagala et al. [2023] for minimizing the dis","authors_text":"Arnold Filtser, Kristin Sheridan, Shuchi Chawla, Yoni Trachtenberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-01-21T21:09:18Z","title":"Bi-Lipschitz extensions and outlier embeddings into trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.15470","kind":"arxiv","version":3},"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:86e1f3fcc3b1737bd8643d1898b99628a817f6a6265a3aeb7ad888a3f559484c","target":"record","created_at":"2026-06-25T00:18:12Z","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":"cc555627d9e6178631eda62abcf88bfc3384dd2bf752b3dcd341cc39593c0159","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-01-21T21:09:18Z","title_canon_sha256":"f70d843ef44489e722d87aa0ec97e0178242df4a3413ce90e917e6bae64fb163"},"schema_version":"1.0","source":{"id":"2601.15470","kind":"arxiv","version":3}},"canonical_sha256":"d20970b7ccccd4272db9d31c819ec2793b39c15b5760cc5030c6c5ab50b37d1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d20970b7ccccd4272db9d31c819ec2793b39c15b5760cc5030c6c5ab50b37d1a","first_computed_at":"2026-06-25T00:18:12.395680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T00:18:12.395680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LQimBYWd6uK70BbtToC9JLpqlw4WiIM0RU0GBzhPVRQjSdhHjmj46zQJ1mmeeqzugmPc2c82V6rUZ0hxt/mLCQ==","signature_status":"signed_v1","signed_at":"2026-06-25T00:18:12.396126Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.15470","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86e1f3fcc3b1737bd8643d1898b99628a817f6a6265a3aeb7ad888a3f559484c","sha256:5036ca9c2981a5270c8e386164e8e63e2a1d866b5e7c088cb79d6525a39b5dcb"],"state_sha256":"cf65bb35553249375e0c4454f51007744663c1675a3cb1db690a5660096f6dc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yOPzNBpPM3VlugCzbrj+25F1CBEA/tTCYSkQUoDxZ/f95JRc4/Uqtp6209hx1H+pDBFlPErPyxDBZ5TvK3/TDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T09:44:06.596493Z","bundle_sha256":"d328587a2981d2815ad5bf13a4856f8fccfeb92706f87e7b42d6360d51f8bb7b"}}