{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QI4STXSAST3XYQTZ3AODPYXREX","short_pith_number":"pith:QI4STXSA","schema_version":"1.0","canonical_sha256":"823929de4094f77c4279d81c37e2f125c802c5ee7e8397630403df3c28b5acc5","source":{"kind":"arxiv","id":"1609.06295","version":3},"attestation_state":"computed","paper":{"title":"Near-Optimal (Euclidean) Metric Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Piotr Indyk, Tal Wagner","submitted_at":"2016-09-20T19:18:08Z","abstract_excerpt":"The metric sketching problem is defined as follows. Given a metric on $n$ points, and $\\epsilon>0$, we wish to produce a small size data structure (sketch) that, given any pair of point indices, recovers the distance between the points up to a $1+\\epsilon$ distortion. In this paper we consider metrics induced by $\\ell_2$ and $\\ell_1$ norms whose spread (the ratio of the diameter to the closest pair distance) is bounded by $\\Phi>0$. A well-known dimensionality reduction theorem due to Johnson and Lindenstrauss yields a sketch of size $O(\\epsilon^{-2} \\log (\\Phi n) n\\log n)$, i.e., $O(\\epsilon^{"},"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":"1609.06295","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-09-20T19:18:08Z","cross_cats_sorted":[],"title_canon_sha256":"a55ad59f6d837064de040d60e0b1aa0106c010eda152de917075cca20e783c6b","abstract_canon_sha256":"3dd4274d111c026234134c2de8f7460f05630275e7bbb6ba14e723e82b8cfd7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:19.420915Z","signature_b64":"AVUgUfs+EP/TpSKK9J+4rnhKaT2KwGzjFAm9lAgXulCIzKqsPR5hsaHRbkAMRVRcNgGRsZgh0013RoMdpcNpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"823929de4094f77c4279d81c37e2f125c802c5ee7e8397630403df3c28b5acc5","last_reissued_at":"2026-05-18T00:56:19.420147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:19.420147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal (Euclidean) Metric Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Piotr Indyk, Tal Wagner","submitted_at":"2016-09-20T19:18:08Z","abstract_excerpt":"The metric sketching problem is defined as follows. Given a metric on $n$ points, and $\\epsilon>0$, we wish to produce a small size data structure (sketch) that, given any pair of point indices, recovers the distance between the points up to a $1+\\epsilon$ distortion. In this paper we consider metrics induced by $\\ell_2$ and $\\ell_1$ norms whose spread (the ratio of the diameter to the closest pair distance) is bounded by $\\Phi>0$. A well-known dimensionality reduction theorem due to Johnson and Lindenstrauss yields a sketch of size $O(\\epsilon^{-2} \\log (\\Phi n) n\\log n)$, i.e., $O(\\epsilon^{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06295","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":""},"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":"1609.06295","created_at":"2026-05-18T00:56:19.420282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.06295v3","created_at":"2026-05-18T00:56:19.420282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06295","created_at":"2026-05-18T00:56:19.420282+00:00"},{"alias_kind":"pith_short_12","alias_value":"QI4STXSAST3X","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QI4STXSAST3XYQTZ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QI4STXSA","created_at":"2026-05-18T12:30:39.010887+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/QI4STXSAST3XYQTZ3AODPYXREX","json":"https://pith.science/pith/QI4STXSAST3XYQTZ3AODPYXREX.json","graph_json":"https://pith.science/api/pith-number/QI4STXSAST3XYQTZ3AODPYXREX/graph.json","events_json":"https://pith.science/api/pith-number/QI4STXSAST3XYQTZ3AODPYXREX/events.json","paper":"https://pith.science/paper/QI4STXSA"},"agent_actions":{"view_html":"https://pith.science/pith/QI4STXSAST3XYQTZ3AODPYXREX","download_json":"https://pith.science/pith/QI4STXSAST3XYQTZ3AODPYXREX.json","view_paper":"https://pith.science/paper/QI4STXSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.06295&json=true","fetch_graph":"https://pith.science/api/pith-number/QI4STXSAST3XYQTZ3AODPYXREX/graph.json","fetch_events":"https://pith.science/api/pith-number/QI4STXSAST3XYQTZ3AODPYXREX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QI4STXSAST3XYQTZ3AODPYXREX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QI4STXSAST3XYQTZ3AODPYXREX/action/storage_attestation","attest_author":"https://pith.science/pith/QI4STXSAST3XYQTZ3AODPYXREX/action/author_attestation","sign_citation":"https://pith.science/pith/QI4STXSAST3XYQTZ3AODPYXREX/action/citation_signature","submit_replication":"https://pith.science/pith/QI4STXSAST3XYQTZ3AODPYXREX/action/replication_record"}},"created_at":"2026-05-18T00:56:19.420282+00:00","updated_at":"2026-05-18T00:56:19.420282+00:00"}