{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LN46TTMFGWBPJW65VP3N3D6UFW","short_pith_number":"pith:LN46TTMF","schema_version":"1.0","canonical_sha256":"5b79e9cd853582f4dbddabf6dd8fd42db2ba3a03f46fda4767670455c3aac250","source":{"kind":"arxiv","id":"1607.07526","version":5},"attestation_state":"computed","paper":{"title":"On the Resistance of Nearest Neighbor to Random Noisy Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bin-Bin Yang, Wei Gao, Zhi-Hua Zhou","submitted_at":"2016-07-26T02:58:16Z","abstract_excerpt":"Nearest neighbor has always been one of the most appealing non-parametric approaches in machine learning, pattern recognition, computer vision, etc. Previous empirical studies partly shows that nearest neighbor is resistant to noise, yet there is a lack of deep analysis. This work presents the finite-sample and distribution-dependent bounds on the consistency of nearest neighbor in the random noise setting. The theoretical results show that, for asymmetric noises, k-nearest neighbor is robust enough to classify most data correctly, except for a handful of examples, whose labels are totally mis"},"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":"1607.07526","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-07-26T02:58:16Z","cross_cats_sorted":[],"title_canon_sha256":"08665ba51334ad18b6a195003e613dc086d81b030e16494b1390e5e29a695c14","abstract_canon_sha256":"807a4b0329e00f3f134147bd435a6217da50566624fe832df972f83977afbfe5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:51.561043Z","signature_b64":"cxV9kHf/Sj1yJsCUxwBZHI3gqo4bBTqTpYeDLN2kbWZokiQdK7krtHghI/KLL39I9T9uc4a6Soixuf9HvDmeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b79e9cd853582f4dbddabf6dd8fd42db2ba3a03f46fda4767670455c3aac250","last_reissued_at":"2026-05-18T00:05:51.560370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:51.560370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Resistance of Nearest Neighbor to Random Noisy Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bin-Bin Yang, Wei Gao, Zhi-Hua Zhou","submitted_at":"2016-07-26T02:58:16Z","abstract_excerpt":"Nearest neighbor has always been one of the most appealing non-parametric approaches in machine learning, pattern recognition, computer vision, etc. Previous empirical studies partly shows that nearest neighbor is resistant to noise, yet there is a lack of deep analysis. This work presents the finite-sample and distribution-dependent bounds on the consistency of nearest neighbor in the random noise setting. The theoretical results show that, for asymmetric noises, k-nearest neighbor is robust enough to classify most data correctly, except for a handful of examples, whose labels are totally mis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07526","kind":"arxiv","version":5},"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":"1607.07526","created_at":"2026-05-18T00:05:51.560487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07526v5","created_at":"2026-05-18T00:05:51.560487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07526","created_at":"2026-05-18T00:05:51.560487+00:00"},{"alias_kind":"pith_short_12","alias_value":"LN46TTMFGWBP","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LN46TTMFGWBPJW65","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LN46TTMF","created_at":"2026-05-18T12:30:29.479603+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/LN46TTMFGWBPJW65VP3N3D6UFW","json":"https://pith.science/pith/LN46TTMFGWBPJW65VP3N3D6UFW.json","graph_json":"https://pith.science/api/pith-number/LN46TTMFGWBPJW65VP3N3D6UFW/graph.json","events_json":"https://pith.science/api/pith-number/LN46TTMFGWBPJW65VP3N3D6UFW/events.json","paper":"https://pith.science/paper/LN46TTMF"},"agent_actions":{"view_html":"https://pith.science/pith/LN46TTMFGWBPJW65VP3N3D6UFW","download_json":"https://pith.science/pith/LN46TTMFGWBPJW65VP3N3D6UFW.json","view_paper":"https://pith.science/paper/LN46TTMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07526&json=true","fetch_graph":"https://pith.science/api/pith-number/LN46TTMFGWBPJW65VP3N3D6UFW/graph.json","fetch_events":"https://pith.science/api/pith-number/LN46TTMFGWBPJW65VP3N3D6UFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LN46TTMFGWBPJW65VP3N3D6UFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LN46TTMFGWBPJW65VP3N3D6UFW/action/storage_attestation","attest_author":"https://pith.science/pith/LN46TTMFGWBPJW65VP3N3D6UFW/action/author_attestation","sign_citation":"https://pith.science/pith/LN46TTMFGWBPJW65VP3N3D6UFW/action/citation_signature","submit_replication":"https://pith.science/pith/LN46TTMFGWBPJW65VP3N3D6UFW/action/replication_record"}},"created_at":"2026-05-18T00:05:51.560487+00:00","updated_at":"2026-05-18T00:05:51.560487+00:00"}