{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SI3ETR7JM67SJ2RUBNL4GAR5NV","short_pith_number":"pith:SI3ETR7J","canonical_record":{"source":{"id":"1905.12717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T20:46:58Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"7afef9ad76599226e06afd3d761bc244042f7fe98c806d635391cabd6e4725ea","abstract_canon_sha256":"b46f01fdf71f064721819487d3417e8f09d85eb13773098153aede6b1ea4e843"},"schema_version":"1.0"},"canonical_sha256":"923649c7e967bf24ea340b57c3023d6d54934910db38539bb05f4bcc916aa34e","source":{"kind":"arxiv","id":"1905.12717","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12717","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12717v1","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12717","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"SI3ETR7JM67S","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SI3ETR7JM67SJ2RU","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SI3ETR7J","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SI3ETR7JM67SJ2RUBNL4GAR5NV","target":"record","payload":{"canonical_record":{"source":{"id":"1905.12717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T20:46:58Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"7afef9ad76599226e06afd3d761bc244042f7fe98c806d635391cabd6e4725ea","abstract_canon_sha256":"b46f01fdf71f064721819487d3417e8f09d85eb13773098153aede6b1ea4e843"},"schema_version":"1.0"},"canonical_sha256":"923649c7e967bf24ea340b57c3023d6d54934910db38539bb05f4bcc916aa34e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:39.809816Z","signature_b64":"0YXKmCAPWULjw/UBQRpzEBb6oDy1Z9PSQa7eQ5XtFEecR6hUjAoQFIRA+sRqW7ZZ+/LjRdOV5NNIWfTxlKm0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"923649c7e967bf24ea340b57c3023d6d54934910db38539bb05f4bcc916aa34e","last_reissued_at":"2026-05-17T23:44:39.809244Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:39.809244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.12717","source_version":1,"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-05-17T23:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GCJ/jOEk+y78JTOe+ldZVlTl2vICuz29OSwhOD/WUl/Rmcm5MyAAXQBNErbgEduXxoij3M+dV2zaFJYzRw5yDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:55:26.910291Z"},"content_sha256":"fb8bf38e806be3a3f48f437eea9e3309acff033a4b121ee8497ee519f2ad088f","schema_version":"1.0","event_id":"sha256:fb8bf38e806be3a3f48f437eea9e3309acff033a4b121ee8497ee519f2ad088f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SI3ETR7JM67SJ2RUBNL4GAR5NV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An adaptive nearest neighbor rule for classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Akshay Balsubramani, Sanjoy Dasgupta, Shay Moran, Yoav Freund","submitted_at":"2019-05-29T20:46:58Z","abstract_excerpt":"We introduce a variant of the $k$-nearest neighbor classifier in which $k$ is chosen adaptively for each query, rather than supplied as a parameter. The choice of $k$ depends on properties of each neighborhood, and therefore may significantly vary between different points. (For example, the algorithm will use larger $k$ for predicting the labels of points in noisy regions.)\n  We provide theory and experiments that demonstrate that the algorithm performs comparably to, and sometimes better than, $k$-NN with an optimal choice of $k$. In particular, we derive bounds on the convergence rates of ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12717","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":""},"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-05-17T23:44:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h5QRRKRaa/V5xmlcfz/XvEFnGXYjhrpp4yZa4tNu6SnYR+AT3CfO1ixATuGxSErb6SG7GHm8j27oBv2D2Tf3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:55:26.911021Z"},"content_sha256":"abf8a9765daeb8bb9729fbbcc419d8a98cd4f7ba05bf97eeaca303606175e6bb","schema_version":"1.0","event_id":"sha256:abf8a9765daeb8bb9729fbbcc419d8a98cd4f7ba05bf97eeaca303606175e6bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SI3ETR7JM67SJ2RUBNL4GAR5NV/bundle.json","state_url":"https://pith.science/pith/SI3ETR7JM67SJ2RUBNL4GAR5NV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SI3ETR7JM67SJ2RUBNL4GAR5NV/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-05-25T19:55:26Z","links":{"resolver":"https://pith.science/pith/SI3ETR7JM67SJ2RUBNL4GAR5NV","bundle":"https://pith.science/pith/SI3ETR7JM67SJ2RUBNL4GAR5NV/bundle.json","state":"https://pith.science/pith/SI3ETR7JM67SJ2RUBNL4GAR5NV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SI3ETR7JM67SJ2RUBNL4GAR5NV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SI3ETR7JM67SJ2RUBNL4GAR5NV","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":"b46f01fdf71f064721819487d3417e8f09d85eb13773098153aede6b1ea4e843","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T20:46:58Z","title_canon_sha256":"7afef9ad76599226e06afd3d761bc244042f7fe98c806d635391cabd6e4725ea"},"schema_version":"1.0","source":{"id":"1905.12717","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.12717","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"arxiv_version","alias_value":"1905.12717v1","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12717","created_at":"2026-05-17T23:44:39Z"},{"alias_kind":"pith_short_12","alias_value":"SI3ETR7JM67S","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SI3ETR7JM67SJ2RU","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SI3ETR7J","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:abf8a9765daeb8bb9729fbbcc419d8a98cd4f7ba05bf97eeaca303606175e6bb","target":"graph","created_at":"2026-05-17T23:44:39Z","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"},"paper":{"abstract_excerpt":"We introduce a variant of the $k$-nearest neighbor classifier in which $k$ is chosen adaptively for each query, rather than supplied as a parameter. The choice of $k$ depends on properties of each neighborhood, and therefore may significantly vary between different points. (For example, the algorithm will use larger $k$ for predicting the labels of points in noisy regions.)\n  We provide theory and experiments that demonstrate that the algorithm performs comparably to, and sometimes better than, $k$-NN with an optimal choice of $k$. In particular, we derive bounds on the convergence rates of ou","authors_text":"Akshay Balsubramani, Sanjoy Dasgupta, Shay Moran, Yoav Freund","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T20:46:58Z","title":"An adaptive nearest neighbor rule for classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12717","kind":"arxiv","version":1},"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:fb8bf38e806be3a3f48f437eea9e3309acff033a4b121ee8497ee519f2ad088f","target":"record","created_at":"2026-05-17T23:44:39Z","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":"b46f01fdf71f064721819487d3417e8f09d85eb13773098153aede6b1ea4e843","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-29T20:46:58Z","title_canon_sha256":"7afef9ad76599226e06afd3d761bc244042f7fe98c806d635391cabd6e4725ea"},"schema_version":"1.0","source":{"id":"1905.12717","kind":"arxiv","version":1}},"canonical_sha256":"923649c7e967bf24ea340b57c3023d6d54934910db38539bb05f4bcc916aa34e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"923649c7e967bf24ea340b57c3023d6d54934910db38539bb05f4bcc916aa34e","first_computed_at":"2026-05-17T23:44:39.809244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:39.809244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0YXKmCAPWULjw/UBQRpzEBb6oDy1Z9PSQa7eQ5XtFEecR6hUjAoQFIRA+sRqW7ZZ+/LjRdOV5NNIWfTxlKm0BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:39.809816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.12717","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb8bf38e806be3a3f48f437eea9e3309acff033a4b121ee8497ee519f2ad088f","sha256:abf8a9765daeb8bb9729fbbcc419d8a98cd4f7ba05bf97eeaca303606175e6bb"],"state_sha256":"1e180ef1cf119787a5eb9485ef8801c979bf47d58108e56b51f87d9eb5a7ef83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTZYkKC6cVW7ZGqumtTaqkY9B5LyciyGmUgj5uesUxmRaMyGaJlj8QEW+MtF5MdZpW/MyusqMvUAa+2AMUZlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:55:26.915071Z","bundle_sha256":"be506d80e89fd627fdfaed9097dd0b950d0777ea17df186a492fc9f3df5b629d"}}