{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4563AGVXPNA2FT7USYJT4PXJEA","short_pith_number":"pith:4563AGVX","schema_version":"1.0","canonical_sha256":"e77db01ab77b41a2cff496133e3ee92023dc1d3fd3d8e85903b9e91bc8602ca2","source":{"kind":"arxiv","id":"2002.05304","version":1},"attestation_state":"computed","paper":{"title":"Predictive Power of Nearest Neighbors Algorithm under Random Perturbation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Guang Cheng, Qifan Song, Yue Xing","submitted_at":"2020-02-13T01:35:35Z","abstract_excerpt":"We consider a data corruption scenario in the classical $k$ Nearest Neighbors ($k$-NN) algorithm, that is, the testing data are randomly perturbed. Under such a scenario, the impact of corruption level on the asymptotic regret is carefully characterized. In particular, our theoretical analysis reveals a phase transition phenomenon that, when the corruption level $\\omega$ is below a critical order (i.e., small-$\\omega$ regime), the asymptotic regret remains the same; when it is beyond that order (i.e., large-$\\omega$ regime), the asymptotic regret deteriorates polynomially. Surprisingly, we obt"},"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":"2002.05304","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-02-13T01:35:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4dd01e3ba3b493395ed4dc45310362bf2898184bf4a3ed6ddfb701fb515526f3","abstract_canon_sha256":"33db77cdff6dd0444f29b37f8e041e6e91aa5636d46c28b25120a6901c961416"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:30.077331Z","signature_b64":"Wydg63dEaouc0qv5BJ0QKAEPsksYZR3qrf4UBMGEXu3zhLMFS8ZvtvWw2h/JPaRFsXi/XmWIsAkZyNorl5+4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e77db01ab77b41a2cff496133e3ee92023dc1d3fd3d8e85903b9e91bc8602ca2","last_reissued_at":"2026-07-05T00:40:30.076926Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:30.076926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predictive Power of Nearest Neighbors Algorithm under Random Perturbation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Guang Cheng, Qifan Song, Yue Xing","submitted_at":"2020-02-13T01:35:35Z","abstract_excerpt":"We consider a data corruption scenario in the classical $k$ Nearest Neighbors ($k$-NN) algorithm, that is, the testing data are randomly perturbed. Under such a scenario, the impact of corruption level on the asymptotic regret is carefully characterized. In particular, our theoretical analysis reveals a phase transition phenomenon that, when the corruption level $\\omega$ is below a critical order (i.e., small-$\\omega$ regime), the asymptotic regret remains the same; when it is beyond that order (i.e., large-$\\omega$ regime), the asymptotic regret deteriorates polynomially. Surprisingly, we obt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.05304","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.05304/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2002.05304","created_at":"2026-07-05T00:40:30.076985+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.05304v1","created_at":"2026-07-05T00:40:30.076985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.05304","created_at":"2026-07-05T00:40:30.076985+00:00"},{"alias_kind":"pith_short_12","alias_value":"4563AGVXPNA2","created_at":"2026-07-05T00:40:30.076985+00:00"},{"alias_kind":"pith_short_16","alias_value":"4563AGVXPNA2FT7U","created_at":"2026-07-05T00:40:30.076985+00:00"},{"alias_kind":"pith_short_8","alias_value":"4563AGVX","created_at":"2026-07-05T00:40:30.076985+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/4563AGVXPNA2FT7USYJT4PXJEA","json":"https://pith.science/pith/4563AGVXPNA2FT7USYJT4PXJEA.json","graph_json":"https://pith.science/api/pith-number/4563AGVXPNA2FT7USYJT4PXJEA/graph.json","events_json":"https://pith.science/api/pith-number/4563AGVXPNA2FT7USYJT4PXJEA/events.json","paper":"https://pith.science/paper/4563AGVX"},"agent_actions":{"view_html":"https://pith.science/pith/4563AGVXPNA2FT7USYJT4PXJEA","download_json":"https://pith.science/pith/4563AGVXPNA2FT7USYJT4PXJEA.json","view_paper":"https://pith.science/paper/4563AGVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.05304&json=true","fetch_graph":"https://pith.science/api/pith-number/4563AGVXPNA2FT7USYJT4PXJEA/graph.json","fetch_events":"https://pith.science/api/pith-number/4563AGVXPNA2FT7USYJT4PXJEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4563AGVXPNA2FT7USYJT4PXJEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4563AGVXPNA2FT7USYJT4PXJEA/action/storage_attestation","attest_author":"https://pith.science/pith/4563AGVXPNA2FT7USYJT4PXJEA/action/author_attestation","sign_citation":"https://pith.science/pith/4563AGVXPNA2FT7USYJT4PXJEA/action/citation_signature","submit_replication":"https://pith.science/pith/4563AGVXPNA2FT7USYJT4PXJEA/action/replication_record"}},"created_at":"2026-07-05T00:40:30.076985+00:00","updated_at":"2026-07-05T00:40:30.076985+00:00"}