{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X7YND4NTVGZO4KLFA4YTOVVBQS","short_pith_number":"pith:X7YND4NT","schema_version":"1.0","canonical_sha256":"bff0d1f1b3a9b2ee296507313756a184ae4bf9ffaa828f53c2e42857884e13d5","source":{"kind":"arxiv","id":"1909.01464","version":2},"attestation_state":"computed","paper":{"title":"Rates of Convergence for Large-scale Nearest Neighbor Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Guang Cheng, Jiexin Duan, Xingye Qiao","submitted_at":"2019-09-03T21:36:41Z","abstract_excerpt":"Nearest neighbor is a popular class of classification methods with many desirable properties. For a large data set which cannot be loaded into the memory of a single machine due to computation, communication, privacy, or ownership limitations, we consider the divide and conquer scheme: the entire data set is divided into small subsamples, on which nearest neighbor predictions are made, and then a final decision is reached by aggregating the predictions on subsamples by majority voting. We name this method the big Nearest Neighbor (bigNN) classifier, and provide its rates of convergence under m"},"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":"1909.01464","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-09-03T21:36:41Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"78b5caa977fc9abcd1bd42472aa13e16e248762c2c0bdc6935ac2cf7e53307aa","abstract_canon_sha256":"be72c8dbcba33e94e4c9bf01e73c6a0ebce7068a48c4e03b29f002d3d8fa61aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:05.419490Z","signature_b64":"DY1A50hRzslupmNctA6HamSrSo3wVl1TtFV0KU8XP87+F1qZUfPBjg6AwemBxVq0J/No13hnEqEUp2mwv7PwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bff0d1f1b3a9b2ee296507313756a184ae4bf9ffaa828f53c2e42857884e13d5","last_reissued_at":"2026-07-05T00:16:05.419012Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:05.419012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rates of Convergence for Large-scale Nearest Neighbor Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Guang Cheng, Jiexin Duan, Xingye Qiao","submitted_at":"2019-09-03T21:36:41Z","abstract_excerpt":"Nearest neighbor is a popular class of classification methods with many desirable properties. For a large data set which cannot be loaded into the memory of a single machine due to computation, communication, privacy, or ownership limitations, we consider the divide and conquer scheme: the entire data set is divided into small subsamples, on which nearest neighbor predictions are made, and then a final decision is reached by aggregating the predictions on subsamples by majority voting. We name this method the big Nearest Neighbor (bigNN) classifier, and provide its rates of convergence under m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01464","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.01464/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":"1909.01464","created_at":"2026-07-05T00:16:05.419068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.01464v2","created_at":"2026-07-05T00:16:05.419068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01464","created_at":"2026-07-05T00:16:05.419068+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7YND4NTVGZO","created_at":"2026-07-05T00:16:05.419068+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7YND4NTVGZO4KLF","created_at":"2026-07-05T00:16:05.419068+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7YND4NT","created_at":"2026-07-05T00:16:05.419068+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/X7YND4NTVGZO4KLFA4YTOVVBQS","json":"https://pith.science/pith/X7YND4NTVGZO4KLFA4YTOVVBQS.json","graph_json":"https://pith.science/api/pith-number/X7YND4NTVGZO4KLFA4YTOVVBQS/graph.json","events_json":"https://pith.science/api/pith-number/X7YND4NTVGZO4KLFA4YTOVVBQS/events.json","paper":"https://pith.science/paper/X7YND4NT"},"agent_actions":{"view_html":"https://pith.science/pith/X7YND4NTVGZO4KLFA4YTOVVBQS","download_json":"https://pith.science/pith/X7YND4NTVGZO4KLFA4YTOVVBQS.json","view_paper":"https://pith.science/paper/X7YND4NT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.01464&json=true","fetch_graph":"https://pith.science/api/pith-number/X7YND4NTVGZO4KLFA4YTOVVBQS/graph.json","fetch_events":"https://pith.science/api/pith-number/X7YND4NTVGZO4KLFA4YTOVVBQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7YND4NTVGZO4KLFA4YTOVVBQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7YND4NTVGZO4KLFA4YTOVVBQS/action/storage_attestation","attest_author":"https://pith.science/pith/X7YND4NTVGZO4KLFA4YTOVVBQS/action/author_attestation","sign_citation":"https://pith.science/pith/X7YND4NTVGZO4KLFA4YTOVVBQS/action/citation_signature","submit_replication":"https://pith.science/pith/X7YND4NTVGZO4KLFA4YTOVVBQS/action/replication_record"}},"created_at":"2026-07-05T00:16:05.419068+00:00","updated_at":"2026-07-05T00:16:05.419068+00:00"}