{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:X7YND4NTVGZO4KLFA4YTOVVBQS","short_pith_number":"pith:X7YND4NT","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"},"canonical_sha256":"bff0d1f1b3a9b2ee296507313756a184ae4bf9ffaa828f53c2e42857884e13d5","source":{"kind":"arxiv","id":"1909.01464","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.01464","created_at":"2026-07-05T00:16:05Z"},{"alias_kind":"arxiv_version","alias_value":"1909.01464v2","created_at":"2026-07-05T00:16:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01464","created_at":"2026-07-05T00:16:05Z"},{"alias_kind":"pith_short_12","alias_value":"X7YND4NTVGZO","created_at":"2026-07-05T00:16:05Z"},{"alias_kind":"pith_short_16","alias_value":"X7YND4NTVGZO4KLF","created_at":"2026-07-05T00:16:05Z"},{"alias_kind":"pith_short_8","alias_value":"X7YND4NT","created_at":"2026-07-05T00:16:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:X7YND4NTVGZO4KLFA4YTOVVBQS","target":"record","payload":{"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"},"canonical_sha256":"bff0d1f1b3a9b2ee296507313756a184ae4bf9ffaa828f53c2e42857884e13d5","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"},"source_kind":"arxiv","source_id":"1909.01464","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:16:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pTj10auI/v1Y6QJBRNn5vmlRFNjtIIpI7IdMCujzr5oBXpOu9TrbO9o7Iuw+RgJzV/lhZ2MKRM94KMMJImLGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:39:46.735386Z"},"content_sha256":"5259701e818789615a8754b697797e71495a99cd7eebc2e5c26c1e324ef9d846","schema_version":"1.0","event_id":"sha256:5259701e818789615a8754b697797e71495a99cd7eebc2e5c26c1e324ef9d846"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:X7YND4NTVGZO4KLFA4YTOVVBQS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:16:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Io032QcZI5mz94/wc3YUsgCS4fig+NAnp6yZYU1KS5EwkbeeHncr29MRHQT5HCQw7O/xCIGhK/Rki0r/Zkw2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:39:46.736027Z"},"content_sha256":"9e8159b3af4db993e90aa6c9fe00d038b1825f751ed705e4ee44ca692053c8d4","schema_version":"1.0","event_id":"sha256:9e8159b3af4db993e90aa6c9fe00d038b1825f751ed705e4ee44ca692053c8d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X7YND4NTVGZO4KLFA4YTOVVBQS/bundle.json","state_url":"https://pith.science/pith/X7YND4NTVGZO4KLFA4YTOVVBQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X7YND4NTVGZO4KLFA4YTOVVBQS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T06:39:46Z","links":{"resolver":"https://pith.science/pith/X7YND4NTVGZO4KLFA4YTOVVBQS","bundle":"https://pith.science/pith/X7YND4NTVGZO4KLFA4YTOVVBQS/bundle.json","state":"https://pith.science/pith/X7YND4NTVGZO4KLFA4YTOVVBQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X7YND4NTVGZO4KLFA4YTOVVBQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:X7YND4NTVGZO4KLFA4YTOVVBQS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"be72c8dbcba33e94e4c9bf01e73c6a0ebce7068a48c4e03b29f002d3d8fa61aa","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-09-03T21:36:41Z","title_canon_sha256":"78b5caa977fc9abcd1bd42472aa13e16e248762c2c0bdc6935ac2cf7e53307aa"},"schema_version":"1.0","source":{"id":"1909.01464","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.01464","created_at":"2026-07-05T00:16:05Z"},{"alias_kind":"arxiv_version","alias_value":"1909.01464v2","created_at":"2026-07-05T00:16:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01464","created_at":"2026-07-05T00:16:05Z"},{"alias_kind":"pith_short_12","alias_value":"X7YND4NTVGZO","created_at":"2026-07-05T00:16:05Z"},{"alias_kind":"pith_short_16","alias_value":"X7YND4NTVGZO4KLF","created_at":"2026-07-05T00:16:05Z"},{"alias_kind":"pith_short_8","alias_value":"X7YND4NT","created_at":"2026-07-05T00:16:05Z"}],"graph_snapshots":[{"event_id":"sha256:9e8159b3af4db993e90aa6c9fe00d038b1825f751ed705e4ee44ca692053c8d4","target":"graph","created_at":"2026-07-05T00:16:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.01464/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Guang Cheng, Jiexin Duan, Xingye Qiao","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-09-03T21:36:41Z","title":"Rates of Convergence for Large-scale Nearest Neighbor Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01464","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5259701e818789615a8754b697797e71495a99cd7eebc2e5c26c1e324ef9d846","target":"record","created_at":"2026-07-05T00:16:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"be72c8dbcba33e94e4c9bf01e73c6a0ebce7068a48c4e03b29f002d3d8fa61aa","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-09-03T21:36:41Z","title_canon_sha256":"78b5caa977fc9abcd1bd42472aa13e16e248762c2c0bdc6935ac2cf7e53307aa"},"schema_version":"1.0","source":{"id":"1909.01464","kind":"arxiv","version":2}},"canonical_sha256":"bff0d1f1b3a9b2ee296507313756a184ae4bf9ffaa828f53c2e42857884e13d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bff0d1f1b3a9b2ee296507313756a184ae4bf9ffaa828f53c2e42857884e13d5","first_computed_at":"2026-07-05T00:16:05.419012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:16:05.419012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DY1A50hRzslupmNctA6HamSrSo3wVl1TtFV0KU8XP87+F1qZUfPBjg6AwemBxVq0J/No13hnEqEUp2mwv7PwBA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:16:05.419490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.01464","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5259701e818789615a8754b697797e71495a99cd7eebc2e5c26c1e324ef9d846","sha256:9e8159b3af4db993e90aa6c9fe00d038b1825f751ed705e4ee44ca692053c8d4"],"state_sha256":"42599243fb24a868d776cbe162a709cf5995987f7e791ffb134824b6900db693"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"09/ECoP3y5HSM7aYfJAeg+D1VCmvPp5zDqThBcNyh10qiCqgnwarKISN25so2y1BhichJ3Fr2Gu2qHUpATtCAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T06:39:46.741896Z","bundle_sha256":"10ce359f9cf932b1a5ce967c8afaed4a01b5da3d1610d4d634ca6fd93840865b"}}