{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YLRHO325E3OIJKCBTBSMMYHNQH","short_pith_number":"pith:YLRHO325","schema_version":"1.0","canonical_sha256":"c2e2776f5d26dc84a8419864c660ed81f332b2b92df19dc0b051377e8a185b58","source":{"kind":"arxiv","id":"2102.02755","version":1},"attestation_state":"computed","paper":{"title":"Instance-based learning using the Half-Space Proximal Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ariana Talamantes, Edgar Chavez","submitted_at":"2021-02-04T17:36:59Z","abstract_excerpt":"The primary example of instance-based learning is the $k$-nearest neighbor rule (kNN), praised for its simplicity and the capacity to adapt to new unseen data and toss away old data. The main disadvantages often mentioned are the classification complexity, which is $O(n)$, and the estimation of the parameter $k$, the number of nearest neighbors to be used. The use of indexes at classification time lifts the former disadvantage, while there is no conclusive method for the latter.\n  This paper presents a parameter-free instance-based learning algorithm using the {\\em Half-Space Proximal} (HSP) g"},"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":"2102.02755","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-04T17:36:59Z","cross_cats_sorted":[],"title_canon_sha256":"d339e5f490eaaefbdf42af5b6d522be809538928b7143ce5264edd8e40cb1ca7","abstract_canon_sha256":"65cafef31c7d0c82cfcd71881f66556ddcd5a0435d6a595f66fb9a768b0d375b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:12:51.268392Z","signature_b64":"UQPjzQCZ90lEDyLKX6v3OTMBirGM/a16LvZX3OoM2voMekMIn7D3gW+g+CXN0YEggnp33OsLVeffafPwHWYKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2e2776f5d26dc84a8419864c660ed81f332b2b92df19dc0b051377e8a185b58","last_reissued_at":"2026-07-05T02:12:51.267953Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:12:51.267953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Instance-based learning using the Half-Space Proximal Graph","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ariana Talamantes, Edgar Chavez","submitted_at":"2021-02-04T17:36:59Z","abstract_excerpt":"The primary example of instance-based learning is the $k$-nearest neighbor rule (kNN), praised for its simplicity and the capacity to adapt to new unseen data and toss away old data. The main disadvantages often mentioned are the classification complexity, which is $O(n)$, and the estimation of the parameter $k$, the number of nearest neighbors to be used. The use of indexes at classification time lifts the former disadvantage, while there is no conclusive method for the latter.\n  This paper presents a parameter-free instance-based learning algorithm using the {\\em Half-Space Proximal} (HSP) g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.02755","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/2102.02755/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":"2102.02755","created_at":"2026-07-05T02:12:51.268009+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.02755v1","created_at":"2026-07-05T02:12:51.268009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.02755","created_at":"2026-07-05T02:12:51.268009+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLRHO325E3OI","created_at":"2026-07-05T02:12:51.268009+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLRHO325E3OIJKCB","created_at":"2026-07-05T02:12:51.268009+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLRHO325","created_at":"2026-07-05T02:12:51.268009+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/YLRHO325E3OIJKCBTBSMMYHNQH","json":"https://pith.science/pith/YLRHO325E3OIJKCBTBSMMYHNQH.json","graph_json":"https://pith.science/api/pith-number/YLRHO325E3OIJKCBTBSMMYHNQH/graph.json","events_json":"https://pith.science/api/pith-number/YLRHO325E3OIJKCBTBSMMYHNQH/events.json","paper":"https://pith.science/paper/YLRHO325"},"agent_actions":{"view_html":"https://pith.science/pith/YLRHO325E3OIJKCBTBSMMYHNQH","download_json":"https://pith.science/pith/YLRHO325E3OIJKCBTBSMMYHNQH.json","view_paper":"https://pith.science/paper/YLRHO325","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.02755&json=true","fetch_graph":"https://pith.science/api/pith-number/YLRHO325E3OIJKCBTBSMMYHNQH/graph.json","fetch_events":"https://pith.science/api/pith-number/YLRHO325E3OIJKCBTBSMMYHNQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLRHO325E3OIJKCBTBSMMYHNQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLRHO325E3OIJKCBTBSMMYHNQH/action/storage_attestation","attest_author":"https://pith.science/pith/YLRHO325E3OIJKCBTBSMMYHNQH/action/author_attestation","sign_citation":"https://pith.science/pith/YLRHO325E3OIJKCBTBSMMYHNQH/action/citation_signature","submit_replication":"https://pith.science/pith/YLRHO325E3OIJKCBTBSMMYHNQH/action/replication_record"}},"created_at":"2026-07-05T02:12:51.268009+00:00","updated_at":"2026-07-05T02:12:51.268009+00:00"}