{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SI3ETR7JM67SJ2RUBNL4GAR5NV","short_pith_number":"pith:SI3ETR7J","schema_version":"1.0","canonical_sha256":"923649c7e967bf24ea340b57c3023d6d54934910db38539bb05f4bcc916aa34e","source":{"kind":"arxiv","id":"1905.12717","version":1},"attestation_state":"computed","paper":{"title":"An adaptive nearest neighbor rule for classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Akshay Balsubramani, Sanjoy Dasgupta, Shay Moran, Yoav Freund","submitted_at":"2019-05-29T20:46:58Z","abstract_excerpt":"We introduce a variant of the $k$-nearest neighbor classifier in which $k$ is chosen adaptively for each query, rather than supplied as a parameter. The choice of $k$ depends on properties of each neighborhood, and therefore may significantly vary between different points. (For example, the algorithm will use larger $k$ for predicting the labels of points in noisy regions.)\n  We provide theory and experiments that demonstrate that the algorithm performs comparably to, and sometimes better than, $k$-NN with an optimal choice of $k$. In particular, we derive bounds on the convergence rates of ou"},"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":"1905.12717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T20:46:58Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"7afef9ad76599226e06afd3d761bc244042f7fe98c806d635391cabd6e4725ea","abstract_canon_sha256":"b46f01fdf71f064721819487d3417e8f09d85eb13773098153aede6b1ea4e843"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:39.809816Z","signature_b64":"0YXKmCAPWULjw/UBQRpzEBb6oDy1Z9PSQa7eQ5XtFEecR6hUjAoQFIRA+sRqW7ZZ+/LjRdOV5NNIWfTxlKm0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"923649c7e967bf24ea340b57c3023d6d54934910db38539bb05f4bcc916aa34e","last_reissued_at":"2026-05-17T23:44:39.809244Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:39.809244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An adaptive nearest neighbor rule for classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Akshay Balsubramani, Sanjoy Dasgupta, Shay Moran, Yoav Freund","submitted_at":"2019-05-29T20:46:58Z","abstract_excerpt":"We introduce a variant of the $k$-nearest neighbor classifier in which $k$ is chosen adaptively for each query, rather than supplied as a parameter. The choice of $k$ depends on properties of each neighborhood, and therefore may significantly vary between different points. (For example, the algorithm will use larger $k$ for predicting the labels of points in noisy regions.)\n  We provide theory and experiments that demonstrate that the algorithm performs comparably to, and sometimes better than, $k$-NN with an optimal choice of $k$. In particular, we derive bounds on the convergence rates of ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12717","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":"1905.12717","created_at":"2026-05-17T23:44:39.809336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12717v1","created_at":"2026-05-17T23:44:39.809336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12717","created_at":"2026-05-17T23:44:39.809336+00:00"},{"alias_kind":"pith_short_12","alias_value":"SI3ETR7JM67S","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SI3ETR7JM67SJ2RU","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SI3ETR7J","created_at":"2026-05-18T12:33:27.125529+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/SI3ETR7JM67SJ2RUBNL4GAR5NV","json":"https://pith.science/pith/SI3ETR7JM67SJ2RUBNL4GAR5NV.json","graph_json":"https://pith.science/api/pith-number/SI3ETR7JM67SJ2RUBNL4GAR5NV/graph.json","events_json":"https://pith.science/api/pith-number/SI3ETR7JM67SJ2RUBNL4GAR5NV/events.json","paper":"https://pith.science/paper/SI3ETR7J"},"agent_actions":{"view_html":"https://pith.science/pith/SI3ETR7JM67SJ2RUBNL4GAR5NV","download_json":"https://pith.science/pith/SI3ETR7JM67SJ2RUBNL4GAR5NV.json","view_paper":"https://pith.science/paper/SI3ETR7J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12717&json=true","fetch_graph":"https://pith.science/api/pith-number/SI3ETR7JM67SJ2RUBNL4GAR5NV/graph.json","fetch_events":"https://pith.science/api/pith-number/SI3ETR7JM67SJ2RUBNL4GAR5NV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SI3ETR7JM67SJ2RUBNL4GAR5NV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SI3ETR7JM67SJ2RUBNL4GAR5NV/action/storage_attestation","attest_author":"https://pith.science/pith/SI3ETR7JM67SJ2RUBNL4GAR5NV/action/author_attestation","sign_citation":"https://pith.science/pith/SI3ETR7JM67SJ2RUBNL4GAR5NV/action/citation_signature","submit_replication":"https://pith.science/pith/SI3ETR7JM67SJ2RUBNL4GAR5NV/action/replication_record"}},"created_at":"2026-05-17T23:44:39.809336+00:00","updated_at":"2026-05-17T23:44:39.809336+00:00"}