{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:YLRHO325E3OIJKCBTBSMMYHNQH","short_pith_number":"pith:YLRHO325","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"},"canonical_sha256":"c2e2776f5d26dc84a8419864c660ed81f332b2b92df19dc0b051377e8a185b58","source":{"kind":"arxiv","id":"2102.02755","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.02755","created_at":"2026-07-05T02:12:51Z"},{"alias_kind":"arxiv_version","alias_value":"2102.02755v1","created_at":"2026-07-05T02:12:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.02755","created_at":"2026-07-05T02:12:51Z"},{"alias_kind":"pith_short_12","alias_value":"YLRHO325E3OI","created_at":"2026-07-05T02:12:51Z"},{"alias_kind":"pith_short_16","alias_value":"YLRHO325E3OIJKCB","created_at":"2026-07-05T02:12:51Z"},{"alias_kind":"pith_short_8","alias_value":"YLRHO325","created_at":"2026-07-05T02:12:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:YLRHO325E3OIJKCBTBSMMYHNQH","target":"record","payload":{"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"},"canonical_sha256":"c2e2776f5d26dc84a8419864c660ed81f332b2b92df19dc0b051377e8a185b58","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"},"source_kind":"arxiv","source_id":"2102.02755","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-07-05T02:12:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u7w/LCDIPQerP5yg/LvQsSwswR8QVXTEy3NTYCw9wzvzkVQZD5+Hzy5Mm5AVZR2GF7up1Gbb6uIJTVKmuVi9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:11:08.836338Z"},"content_sha256":"c9e92483f7c3861e8b5b6688f24177f94774eab8b926a39d38517ac7b3feed07","schema_version":"1.0","event_id":"sha256:c9e92483f7c3861e8b5b6688f24177f94774eab8b926a39d38517ac7b3feed07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:YLRHO325E3OIJKCBTBSMMYHNQH","target":"graph","payload":{"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"},"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-05T02:12:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SJownmjMkwFxR9xKnyIREvGuekBMPXuXdUtIlXS0fyDqeyRRDwDzBuXEraqdEeILNbchf69RKPVpjzmr/IehAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:11:08.836725Z"},"content_sha256":"9b1b7689dcbfd86911d866dd6f6a1feb46855b70133f3a4f86557e563120199e","schema_version":"1.0","event_id":"sha256:9b1b7689dcbfd86911d866dd6f6a1feb46855b70133f3a4f86557e563120199e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLRHO325E3OIJKCBTBSMMYHNQH/bundle.json","state_url":"https://pith.science/pith/YLRHO325E3OIJKCBTBSMMYHNQH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLRHO325E3OIJKCBTBSMMYHNQH/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-07-07T15:11:08Z","links":{"resolver":"https://pith.science/pith/YLRHO325E3OIJKCBTBSMMYHNQH","bundle":"https://pith.science/pith/YLRHO325E3OIJKCBTBSMMYHNQH/bundle.json","state":"https://pith.science/pith/YLRHO325E3OIJKCBTBSMMYHNQH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLRHO325E3OIJKCBTBSMMYHNQH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:YLRHO325E3OIJKCBTBSMMYHNQH","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":"65cafef31c7d0c82cfcd71881f66556ddcd5a0435d6a595f66fb9a768b0d375b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-04T17:36:59Z","title_canon_sha256":"d339e5f490eaaefbdf42af5b6d522be809538928b7143ce5264edd8e40cb1ca7"},"schema_version":"1.0","source":{"id":"2102.02755","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.02755","created_at":"2026-07-05T02:12:51Z"},{"alias_kind":"arxiv_version","alias_value":"2102.02755v1","created_at":"2026-07-05T02:12:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.02755","created_at":"2026-07-05T02:12:51Z"},{"alias_kind":"pith_short_12","alias_value":"YLRHO325E3OI","created_at":"2026-07-05T02:12:51Z"},{"alias_kind":"pith_short_16","alias_value":"YLRHO325E3OIJKCB","created_at":"2026-07-05T02:12:51Z"},{"alias_kind":"pith_short_8","alias_value":"YLRHO325","created_at":"2026-07-05T02:12:51Z"}],"graph_snapshots":[{"event_id":"sha256:9b1b7689dcbfd86911d866dd6f6a1feb46855b70133f3a4f86557e563120199e","target":"graph","created_at":"2026-07-05T02:12:51Z","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/2102.02755/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ariana Talamantes, Edgar Chavez","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-04T17:36:59Z","title":"Instance-based learning using the Half-Space Proximal Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.02755","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:c9e92483f7c3861e8b5b6688f24177f94774eab8b926a39d38517ac7b3feed07","target":"record","created_at":"2026-07-05T02:12:51Z","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":"65cafef31c7d0c82cfcd71881f66556ddcd5a0435d6a595f66fb9a768b0d375b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-02-04T17:36:59Z","title_canon_sha256":"d339e5f490eaaefbdf42af5b6d522be809538928b7143ce5264edd8e40cb1ca7"},"schema_version":"1.0","source":{"id":"2102.02755","kind":"arxiv","version":1}},"canonical_sha256":"c2e2776f5d26dc84a8419864c660ed81f332b2b92df19dc0b051377e8a185b58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2e2776f5d26dc84a8419864c660ed81f332b2b92df19dc0b051377e8a185b58","first_computed_at":"2026-07-05T02:12:51.267953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:12:51.267953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UQPjzQCZ90lEDyLKX6v3OTMBirGM/a16LvZX3OoM2voMekMIn7D3gW+g+CXN0YEggnp33OsLVeffafPwHWYKCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:12:51.268392Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.02755","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9e92483f7c3861e8b5b6688f24177f94774eab8b926a39d38517ac7b3feed07","sha256:9b1b7689dcbfd86911d866dd6f6a1feb46855b70133f3a4f86557e563120199e"],"state_sha256":"d4c54f8d5e47efd09413627979d7311c6e39728c867aaedf4c94dc1941dfbc32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BWNc79ax+Kzr4ogN8aWtlkHIkaEtvcDrcL+8yJhfVLrGz9pvtEMos8sCEgE+aRJlrHuoMWygbwci2VTzFUrTAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:11:08.838665Z","bundle_sha256":"343a3dd5afa039bce6b929625d2006d9acf5ecded82316a06b4514b7036eb017"}}