{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:E4PBRVXS6LLJCPWF7CZFUALASR","short_pith_number":"pith:E4PBRVXS","schema_version":"1.0","canonical_sha256":"271e18d6f2f2d6913ec5f8b25a01609458f78f21f1a0d9209fe9386012f21e01","source":{"kind":"arxiv","id":"1508.03600","version":1},"attestation_state":"computed","paper":{"title":"Metric embedding with outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anastasios Sidiropoulos, Yusu Wang","submitted_at":"2015-08-14T18:38:05Z","abstract_excerpt":"We initiate the study of metric embeddings with \\emph{outliers}. Given some metric space $(X,\\rho)$ we wish to find a small set of outlier points $K \\subset X$ and either an isometric or a low-distortion embedding of $(X\\setminus K,\\rho)$ into some target metric space. This is a natural problem that captures scenarios where a small fraction of points in the input corresponds to noise.\n  For the case of isometric embeddings we derive polynomial-time approximation algorithms for minimizing the number of outliers when the target space is an ultrametric, a tree metric, or constant-dimensional Eucl"},"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":"1508.03600","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-14T18:38:05Z","cross_cats_sorted":[],"title_canon_sha256":"034dddb3bb20647218fdfff38f6ca8b2dbc0305fc1374a1bcb9da5477827dd69","abstract_canon_sha256":"945d7bdcf7314c4ef71887bd1eabbf0412993763baf635275af6d2f3d3493eaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:17.181502Z","signature_b64":"uMh6S8CgjD+DMDQvZW8AxW0kdCbbHzSLFe0SyjWsQng0FtMRGWQmUhyYhl9LOEaL8Ds8eEukvWV1B0wJ47X/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"271e18d6f2f2d6913ec5f8b25a01609458f78f21f1a0d9209fe9386012f21e01","last_reissued_at":"2026-05-18T01:35:17.180856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:17.180856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric embedding with outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anastasios Sidiropoulos, Yusu Wang","submitted_at":"2015-08-14T18:38:05Z","abstract_excerpt":"We initiate the study of metric embeddings with \\emph{outliers}. Given some metric space $(X,\\rho)$ we wish to find a small set of outlier points $K \\subset X$ and either an isometric or a low-distortion embedding of $(X\\setminus K,\\rho)$ into some target metric space. This is a natural problem that captures scenarios where a small fraction of points in the input corresponds to noise.\n  For the case of isometric embeddings we derive polynomial-time approximation algorithms for minimizing the number of outliers when the target space is an ultrametric, a tree metric, or constant-dimensional Eucl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03600","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":"1508.03600","created_at":"2026-05-18T01:35:17.180950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03600v1","created_at":"2026-05-18T01:35:17.180950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03600","created_at":"2026-05-18T01:35:17.180950+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4PBRVXS6LLJ","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4PBRVXS6LLJCPWF","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4PBRVXS","created_at":"2026-05-18T12:29:17.054201+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/E4PBRVXS6LLJCPWF7CZFUALASR","json":"https://pith.science/pith/E4PBRVXS6LLJCPWF7CZFUALASR.json","graph_json":"https://pith.science/api/pith-number/E4PBRVXS6LLJCPWF7CZFUALASR/graph.json","events_json":"https://pith.science/api/pith-number/E4PBRVXS6LLJCPWF7CZFUALASR/events.json","paper":"https://pith.science/paper/E4PBRVXS"},"agent_actions":{"view_html":"https://pith.science/pith/E4PBRVXS6LLJCPWF7CZFUALASR","download_json":"https://pith.science/pith/E4PBRVXS6LLJCPWF7CZFUALASR.json","view_paper":"https://pith.science/paper/E4PBRVXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03600&json=true","fetch_graph":"https://pith.science/api/pith-number/E4PBRVXS6LLJCPWF7CZFUALASR/graph.json","fetch_events":"https://pith.science/api/pith-number/E4PBRVXS6LLJCPWF7CZFUALASR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4PBRVXS6LLJCPWF7CZFUALASR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4PBRVXS6LLJCPWF7CZFUALASR/action/storage_attestation","attest_author":"https://pith.science/pith/E4PBRVXS6LLJCPWF7CZFUALASR/action/author_attestation","sign_citation":"https://pith.science/pith/E4PBRVXS6LLJCPWF7CZFUALASR/action/citation_signature","submit_replication":"https://pith.science/pith/E4PBRVXS6LLJCPWF7CZFUALASR/action/replication_record"}},"created_at":"2026-05-18T01:35:17.180950+00:00","updated_at":"2026-05-18T01:35:17.180950+00:00"}