{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EPWHJJLABLQGFHNPP27HHUT626","short_pith_number":"pith:EPWHJJLA","schema_version":"1.0","canonical_sha256":"23ec74a5600ae0629daf7ebe73d27ed7b114939abd49e8de10299a4d882584b7","source":{"kind":"arxiv","id":"1606.02617","version":2},"attestation_state":"computed","paper":{"title":"Efficient Estimation of k for the Nearest Neighbors Class of Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aleksander Lodwich, Faisal Shafait, Thomas Breuel","submitted_at":"2016-06-08T16:11:53Z","abstract_excerpt":"The k Nearest Neighbors (kNN) method has received much attention in the past decades, where some theoretical bounds on its performance were identified and where practical optimizations were proposed for making it work fairly well in high dimensional spaces and on large datasets. From countless experiments of the past it became widely accepted that the value of k has a significant impact on the performance of this method. However, the efficient optimization of this parameter has not received so much attention in literature. Today, the most common approach is to cross-validate or bootstrap this "},"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":"1606.02617","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-08T16:11:53Z","cross_cats_sorted":[],"title_canon_sha256":"61d25f272afa9278ced6ac882a1d297b489d02b4109c95bb970cca8aa43ef833","abstract_canon_sha256":"bcab152bff001db4f1ed18f17c9804c674e57a6d7317ff75a32e7b5d5da99418"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:34.085308Z","signature_b64":"7PhMRZbimXdXLcJLb3rOa9zyw3WT0pK5y6LyYLq/nx/IjQMRegHEA9u/jXeYSnuYCOibw0uNL0PCwoXmopNQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23ec74a5600ae0629daf7ebe73d27ed7b114939abd49e8de10299a4d882584b7","last_reissued_at":"2026-05-18T01:12:34.084700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:34.084700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Estimation of k for the Nearest Neighbors Class of Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aleksander Lodwich, Faisal Shafait, Thomas Breuel","submitted_at":"2016-06-08T16:11:53Z","abstract_excerpt":"The k Nearest Neighbors (kNN) method has received much attention in the past decades, where some theoretical bounds on its performance were identified and where practical optimizations were proposed for making it work fairly well in high dimensional spaces and on large datasets. From countless experiments of the past it became widely accepted that the value of k has a significant impact on the performance of this method. However, the efficient optimization of this parameter has not received so much attention in literature. Today, the most common approach is to cross-validate or bootstrap this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02617","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":"1606.02617","created_at":"2026-05-18T01:12:34.084795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02617v2","created_at":"2026-05-18T01:12:34.084795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02617","created_at":"2026-05-18T01:12:34.084795+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPWHJJLABLQG","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPWHJJLABLQGFHNP","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPWHJJLA","created_at":"2026-05-18T12:30:12.583610+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/EPWHJJLABLQGFHNPP27HHUT626","json":"https://pith.science/pith/EPWHJJLABLQGFHNPP27HHUT626.json","graph_json":"https://pith.science/api/pith-number/EPWHJJLABLQGFHNPP27HHUT626/graph.json","events_json":"https://pith.science/api/pith-number/EPWHJJLABLQGFHNPP27HHUT626/events.json","paper":"https://pith.science/paper/EPWHJJLA"},"agent_actions":{"view_html":"https://pith.science/pith/EPWHJJLABLQGFHNPP27HHUT626","download_json":"https://pith.science/pith/EPWHJJLABLQGFHNPP27HHUT626.json","view_paper":"https://pith.science/paper/EPWHJJLA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02617&json=true","fetch_graph":"https://pith.science/api/pith-number/EPWHJJLABLQGFHNPP27HHUT626/graph.json","fetch_events":"https://pith.science/api/pith-number/EPWHJJLABLQGFHNPP27HHUT626/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPWHJJLABLQGFHNPP27HHUT626/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPWHJJLABLQGFHNPP27HHUT626/action/storage_attestation","attest_author":"https://pith.science/pith/EPWHJJLABLQGFHNPP27HHUT626/action/author_attestation","sign_citation":"https://pith.science/pith/EPWHJJLABLQGFHNPP27HHUT626/action/citation_signature","submit_replication":"https://pith.science/pith/EPWHJJLABLQGFHNPP27HHUT626/action/replication_record"}},"created_at":"2026-05-18T01:12:34.084795+00:00","updated_at":"2026-05-18T01:12:34.084795+00:00"}