{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MUTLTJ7VHQ3TXHUEZZPF7547KH","short_pith_number":"pith:MUTLTJ7V","schema_version":"1.0","canonical_sha256":"6526b9a7f53c373b9e84ce5e5ff79f51f2c40b57ee5081334fd86dcf423ce456","source":{"kind":"arxiv","id":"1404.3368","version":4},"attestation_state":"computed","paper":{"title":"Near-optimal sample compression for nearest neighbors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LG","authors_text":"Aryeh Kontorovich, Lee-Ad Gottlieb, Pinhas Nisnevitch","submitted_at":"2014-04-13T11:13:02Z","abstract_excerpt":"We present the first sample compression algorithm for nearest neighbors with non-trivial performance guarantees. We complement these guarantees by demonstrating almost matching hardness lower bounds, which show that our bound is nearly optimal. Our result yields new insight into margin-based nearest neighbor classification in metric spaces and allows us to significantly sharpen and simplify existing bounds. Some encouraging empirical results are also presented."},"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":"1404.3368","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-13T11:13:02Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"eb9bf6b434669e6415f5517fff29f3068319d634c5b817c1cb7a325adc83c60d","abstract_canon_sha256":"6a518b5bad72408f29d4575d3e6b827acc97a658cef445aca32c51d7a3e5ce18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:18.099414Z","signature_b64":"Igj9YtU+kZKSIfVAMMYUgHpE93380njd/SXy9hdIbtW7KeegCkw62seDsztla5XHwr9fn3GxXoOh/L1Dy2PcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6526b9a7f53c373b9e84ce5e5ff79f51f2c40b57ee5081334fd86dcf423ce456","last_reissued_at":"2026-05-18T00:20:18.098831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:18.098831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-optimal sample compression for nearest neighbors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LG","authors_text":"Aryeh Kontorovich, Lee-Ad Gottlieb, Pinhas Nisnevitch","submitted_at":"2014-04-13T11:13:02Z","abstract_excerpt":"We present the first sample compression algorithm for nearest neighbors with non-trivial performance guarantees. We complement these guarantees by demonstrating almost matching hardness lower bounds, which show that our bound is nearly optimal. Our result yields new insight into margin-based nearest neighbor classification in metric spaces and allows us to significantly sharpen and simplify existing bounds. Some encouraging empirical results are also presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3368","kind":"arxiv","version":4},"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":"1404.3368","created_at":"2026-05-18T00:20:18.098922+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3368v4","created_at":"2026-05-18T00:20:18.098922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3368","created_at":"2026-05-18T00:20:18.098922+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUTLTJ7VHQ3T","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUTLTJ7VHQ3TXHUE","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUTLTJ7V","created_at":"2026-05-18T12:28:38.356838+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/MUTLTJ7VHQ3TXHUEZZPF7547KH","json":"https://pith.science/pith/MUTLTJ7VHQ3TXHUEZZPF7547KH.json","graph_json":"https://pith.science/api/pith-number/MUTLTJ7VHQ3TXHUEZZPF7547KH/graph.json","events_json":"https://pith.science/api/pith-number/MUTLTJ7VHQ3TXHUEZZPF7547KH/events.json","paper":"https://pith.science/paper/MUTLTJ7V"},"agent_actions":{"view_html":"https://pith.science/pith/MUTLTJ7VHQ3TXHUEZZPF7547KH","download_json":"https://pith.science/pith/MUTLTJ7VHQ3TXHUEZZPF7547KH.json","view_paper":"https://pith.science/paper/MUTLTJ7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3368&json=true","fetch_graph":"https://pith.science/api/pith-number/MUTLTJ7VHQ3TXHUEZZPF7547KH/graph.json","fetch_events":"https://pith.science/api/pith-number/MUTLTJ7VHQ3TXHUEZZPF7547KH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUTLTJ7VHQ3TXHUEZZPF7547KH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUTLTJ7VHQ3TXHUEZZPF7547KH/action/storage_attestation","attest_author":"https://pith.science/pith/MUTLTJ7VHQ3TXHUEZZPF7547KH/action/author_attestation","sign_citation":"https://pith.science/pith/MUTLTJ7VHQ3TXHUEZZPF7547KH/action/citation_signature","submit_replication":"https://pith.science/pith/MUTLTJ7VHQ3TXHUEZZPF7547KH/action/replication_record"}},"created_at":"2026-05-18T00:20:18.098922+00:00","updated_at":"2026-05-18T00:20:18.098922+00:00"}