{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:O3FBQO5JKY22TVLZY7747ZB6AC","short_pith_number":"pith:O3FBQO5J","schema_version":"1.0","canonical_sha256":"76ca183ba95635a9d579c7ffcfe43e00b061954c465edc2503d87e6a2eb1407d","source":{"kind":"arxiv","id":"2608.12903","version":1},"attestation_state":"computed","paper":{"title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Guoyin Wang, Hongxuan He, Lifeng Shen, Shuyin Xia, Xiaoyu Lian, Xinbo Gao","submitted_at":"2026-08-13T07:39:46Z","abstract_excerpt":"The $k$-Nearest Neighbor~(KNN) algorithm is widely used across various tasks. The selection of the $k$ value is a key issue because it significantly impacts performance. In this paper, an adaptive and efficient KNN approach via granular-ball computing is proposed. The method consists of two stages. \\textcolor{black}{In the training stage, the dataset is first coarsely partitioned to reduce the complexity of data distributions within a granular ball, and then the Fisher criterion is introduced to control ball splitting and stopping, yielding a multi-granularity granular ball representation. In "},"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":"2608.12903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-08-13T07:39:46Z","cross_cats_sorted":[],"title_canon_sha256":"40d710adc7bf66470847264c0b89f128f3c478956787bcfe93243d85ec7e5a9e","abstract_canon_sha256":"79469a000d081fb2acc75c6c284b637fb169203038c2a9b00745b724668acc5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-14T00:58:44.978434Z","signature_b64":"WwmQ/X/nCF1+sZq3cAcFWY6XzSypUMZBjB6gwVbtG6jd+UoLulsk5H+oroNRh38rt4r83QR/teN+3+Epa/9eDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76ca183ba95635a9d579c7ffcfe43e00b061954c465edc2503d87e6a2eb1407d","last_reissued_at":"2026-08-14T00:58:44.975811Z","signature_status":"signed_v1","first_computed_at":"2026-08-14T00:58:44.975811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive $k$ Nearest Neighbors Classifier via Granular Ball Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Guoyin Wang, Hongxuan He, Lifeng Shen, Shuyin Xia, Xiaoyu Lian, Xinbo Gao","submitted_at":"2026-08-13T07:39:46Z","abstract_excerpt":"The $k$-Nearest Neighbor~(KNN) algorithm is widely used across various tasks. The selection of the $k$ value is a key issue because it significantly impacts performance. In this paper, an adaptive and efficient KNN approach via granular-ball computing is proposed. The method consists of two stages. \\textcolor{black}{In the training stage, the dataset is first coarsely partitioned to reduce the complexity of data distributions within a granular ball, and then the Fisher criterion is introduced to control ball splitting and stopping, yielding a multi-granularity granular ball representation. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12903","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.12903/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":"2608.12903","created_at":"2026-08-14T00:58:44.977040+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.12903v1","created_at":"2026-08-14T00:58:44.977040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12903","created_at":"2026-08-14T00:58:44.977040+00:00"},{"alias_kind":"pith_short_12","alias_value":"O3FBQO5JKY22","created_at":"2026-08-14T00:58:44.977040+00:00"},{"alias_kind":"pith_short_16","alias_value":"O3FBQO5JKY22TVLZ","created_at":"2026-08-14T00:58:44.977040+00:00"},{"alias_kind":"pith_short_8","alias_value":"O3FBQO5J","created_at":"2026-08-14T00:58:44.977040+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/O3FBQO5JKY22TVLZY7747ZB6AC","json":"https://pith.science/pith/O3FBQO5JKY22TVLZY7747ZB6AC.json","graph_json":"https://pith.science/api/pith-number/O3FBQO5JKY22TVLZY7747ZB6AC/graph.json","events_json":"https://pith.science/api/pith-number/O3FBQO5JKY22TVLZY7747ZB6AC/events.json","paper":"https://pith.science/paper/O3FBQO5J"},"agent_actions":{"view_html":"https://pith.science/pith/O3FBQO5JKY22TVLZY7747ZB6AC","download_json":"https://pith.science/pith/O3FBQO5JKY22TVLZY7747ZB6AC.json","view_paper":"https://pith.science/paper/O3FBQO5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.12903&json=true","fetch_graph":"https://pith.science/api/pith-number/O3FBQO5JKY22TVLZY7747ZB6AC/graph.json","fetch_events":"https://pith.science/api/pith-number/O3FBQO5JKY22TVLZY7747ZB6AC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O3FBQO5JKY22TVLZY7747ZB6AC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O3FBQO5JKY22TVLZY7747ZB6AC/action/storage_attestation","attest_author":"https://pith.science/pith/O3FBQO5JKY22TVLZY7747ZB6AC/action/author_attestation","sign_citation":"https://pith.science/pith/O3FBQO5JKY22TVLZY7747ZB6AC/action/citation_signature","submit_replication":"https://pith.science/pith/O3FBQO5JKY22TVLZY7747ZB6AC/action/replication_record"}},"created_at":"2026-08-14T00:58:44.977040+00:00","updated_at":"2026-08-14T00:58:44.977040+00:00"}