{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AGL5DKMLPYBMN4A4NTXEU2UO2N","short_pith_number":"pith:AGL5DKML","schema_version":"1.0","canonical_sha256":"0197d1a98b7e02c6f01c6cee4a6a8ed34b73a839fb5f0e9a9d9097f9dc98b6f6","source":{"kind":"arxiv","id":"1302.2752","version":3},"attestation_state":"computed","paper":{"title":"Adaptive Metric Dimensionality Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aryeh Kontorovich, Lee-Ad Gottlieb, Robert Krauthgamer","submitted_at":"2013-02-12T10:20:21Z","abstract_excerpt":"We study adaptive data-dependent dimensionality reduction in the context of supervised learning in general metric spaces. Our main statistical contribution is a generalization bound for Lipschitz functions in metric spaces that are doubling, or nearly doubling. On the algorithmic front, we describe an analogue of PCA for metric spaces: namely an efficient procedure that approximates the data's intrinsic dimension, which is often much lower than the ambient dimension. Our approach thus leverages the dual benefits of low dimensionality: (1) more efficient algorithms, e.g., for proximity search, "},"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":"1302.2752","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-12T10:20:21Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"dea4be192027d63fbd4cd2cf24774b440b6a36830fab2a7d5cc7b350e40b0cfb","abstract_canon_sha256":"281a878964038562996da5e2e7d60604c5375605f9fd3556a887d342f5e5d1ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:29.127009Z","signature_b64":"Vv/TGL2Anj2enZ/1H+Ne9Ai0iwHoFwPvhijUkR7uODqpYQ1BmcgpGGen4csC5n0v+1CWMJcUiEIOr3ZpJwO/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0197d1a98b7e02c6f01c6cee4a6a8ed34b73a839fb5f0e9a9d9097f9dc98b6f6","last_reissued_at":"2026-05-18T02:20:29.126512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:29.126512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Metric Dimensionality Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aryeh Kontorovich, Lee-Ad Gottlieb, Robert Krauthgamer","submitted_at":"2013-02-12T10:20:21Z","abstract_excerpt":"We study adaptive data-dependent dimensionality reduction in the context of supervised learning in general metric spaces. Our main statistical contribution is a generalization bound for Lipschitz functions in metric spaces that are doubling, or nearly doubling. On the algorithmic front, we describe an analogue of PCA for metric spaces: namely an efficient procedure that approximates the data's intrinsic dimension, which is often much lower than the ambient dimension. Our approach thus leverages the dual benefits of low dimensionality: (1) more efficient algorithms, e.g., for proximity search, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2752","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":"1302.2752","created_at":"2026-05-18T02:20:29.126594+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.2752v3","created_at":"2026-05-18T02:20:29.126594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2752","created_at":"2026-05-18T02:20:29.126594+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGL5DKMLPYBM","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGL5DKMLPYBMN4A4","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGL5DKML","created_at":"2026-05-18T12:27:38.830355+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/AGL5DKMLPYBMN4A4NTXEU2UO2N","json":"https://pith.science/pith/AGL5DKMLPYBMN4A4NTXEU2UO2N.json","graph_json":"https://pith.science/api/pith-number/AGL5DKMLPYBMN4A4NTXEU2UO2N/graph.json","events_json":"https://pith.science/api/pith-number/AGL5DKMLPYBMN4A4NTXEU2UO2N/events.json","paper":"https://pith.science/paper/AGL5DKML"},"agent_actions":{"view_html":"https://pith.science/pith/AGL5DKMLPYBMN4A4NTXEU2UO2N","download_json":"https://pith.science/pith/AGL5DKMLPYBMN4A4NTXEU2UO2N.json","view_paper":"https://pith.science/paper/AGL5DKML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.2752&json=true","fetch_graph":"https://pith.science/api/pith-number/AGL5DKMLPYBMN4A4NTXEU2UO2N/graph.json","fetch_events":"https://pith.science/api/pith-number/AGL5DKMLPYBMN4A4NTXEU2UO2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGL5DKMLPYBMN4A4NTXEU2UO2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGL5DKMLPYBMN4A4NTXEU2UO2N/action/storage_attestation","attest_author":"https://pith.science/pith/AGL5DKMLPYBMN4A4NTXEU2UO2N/action/author_attestation","sign_citation":"https://pith.science/pith/AGL5DKMLPYBMN4A4NTXEU2UO2N/action/citation_signature","submit_replication":"https://pith.science/pith/AGL5DKMLPYBMN4A4NTXEU2UO2N/action/replication_record"}},"created_at":"2026-05-18T02:20:29.126594+00:00","updated_at":"2026-05-18T02:20:29.126594+00:00"}