{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:B6IMQXVVD2ADYZYGDEIPTRTBD3","short_pith_number":"pith:B6IMQXVV","schema_version":"1.0","canonical_sha256":"0f90c85eb51e803c67061910f9c6611ee78f3e8f6728b80ae852a8da7481ddc7","source":{"kind":"arxiv","id":"1712.02369","version":2},"attestation_state":"computed","paper":{"title":"Achieving the time of $1$-NN, but the accuracy of $k$-NN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Lirong Xue, Samory Kpotufe","submitted_at":"2017-12-06T19:02:00Z","abstract_excerpt":"We propose a simple approach which, given distributed computing resources, can nearly achieve the accuracy of $k$-NN prediction, while matching (or improving) the faster prediction time of $1$-NN. The approach consists of aggregating denoised $1$-NN predictors over a small number of distributed subsamples. We show, both theoretically and experimentally, that small subsample sizes suffice to attain similar performance as $k$-NN, without sacrificing the computational efficiency of $1$-NN."},"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":"1712.02369","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-12-06T19:02:00Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"653f5867f989815ca2645ff3ba23c6614c6621499a13f30c326d480e742719d8","abstract_canon_sha256":"f3c53ae23fcddeffe9eadbaa54582b03f03fb719dbfaf91e3573eaf28c82b8fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:24.402958Z","signature_b64":"INQQXUWteoMlhXAiqI7GbTmXQFHljUjxgA0+iwYkNxWLM3Cycz9Q5sog3v8JZ6chtlQrYtc/Fta66fsxgv79CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f90c85eb51e803c67061910f9c6611ee78f3e8f6728b80ae852a8da7481ddc7","last_reissued_at":"2026-05-18T00:27:24.402334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:24.402334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving the time of $1$-NN, but the accuracy of $k$-NN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Lirong Xue, Samory Kpotufe","submitted_at":"2017-12-06T19:02:00Z","abstract_excerpt":"We propose a simple approach which, given distributed computing resources, can nearly achieve the accuracy of $k$-NN prediction, while matching (or improving) the faster prediction time of $1$-NN. The approach consists of aggregating denoised $1$-NN predictors over a small number of distributed subsamples. We show, both theoretically and experimentally, that small subsample sizes suffice to attain similar performance as $k$-NN, without sacrificing the computational efficiency of $1$-NN."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02369","kind":"arxiv","version":2},"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":"1712.02369","created_at":"2026-05-18T00:27:24.402432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.02369v2","created_at":"2026-05-18T00:27:24.402432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02369","created_at":"2026-05-18T00:27:24.402432+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6IMQXVVD2AD","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6IMQXVVD2ADYZYG","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6IMQXVV","created_at":"2026-05-18T12:31:08.081275+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/B6IMQXVVD2ADYZYGDEIPTRTBD3","json":"https://pith.science/pith/B6IMQXVVD2ADYZYGDEIPTRTBD3.json","graph_json":"https://pith.science/api/pith-number/B6IMQXVVD2ADYZYGDEIPTRTBD3/graph.json","events_json":"https://pith.science/api/pith-number/B6IMQXVVD2ADYZYGDEIPTRTBD3/events.json","paper":"https://pith.science/paper/B6IMQXVV"},"agent_actions":{"view_html":"https://pith.science/pith/B6IMQXVVD2ADYZYGDEIPTRTBD3","download_json":"https://pith.science/pith/B6IMQXVVD2ADYZYGDEIPTRTBD3.json","view_paper":"https://pith.science/paper/B6IMQXVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.02369&json=true","fetch_graph":"https://pith.science/api/pith-number/B6IMQXVVD2ADYZYGDEIPTRTBD3/graph.json","fetch_events":"https://pith.science/api/pith-number/B6IMQXVVD2ADYZYGDEIPTRTBD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6IMQXVVD2ADYZYGDEIPTRTBD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6IMQXVVD2ADYZYGDEIPTRTBD3/action/storage_attestation","attest_author":"https://pith.science/pith/B6IMQXVVD2ADYZYGDEIPTRTBD3/action/author_attestation","sign_citation":"https://pith.science/pith/B6IMQXVVD2ADYZYGDEIPTRTBD3/action/citation_signature","submit_replication":"https://pith.science/pith/B6IMQXVVD2ADYZYGDEIPTRTBD3/action/replication_record"}},"created_at":"2026-05-18T00:27:24.402432+00:00","updated_at":"2026-05-18T00:27:24.402432+00:00"}