{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:33UFIKH3YQAX42MNLSE56CTX6D","short_pith_number":"pith:33UFIKH3","canonical_record":{"source":{"id":"1305.1002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-05-05T09:44:08Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a21f4f914b3c259bd0ee472dfb33b2800eac5d434d7e638eb73b0c2910eceb1b","abstract_canon_sha256":"05047d0d524a6cd0d754ce80fc665834d2ad3c649e79603d9c12964106d63d49"},"schema_version":"1.0"},"canonical_sha256":"dee85428fbc4017e698d5c89df0a77f0ddf22e47dd2098f2a0670835437b0fdc","source":{"kind":"arxiv","id":"1305.1002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1002","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1002v1","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1002","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"33UFIKH3YQAX","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"33UFIKH3YQAX42MN","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"33UFIKH3","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:33UFIKH3YQAX42MNLSE56CTX6D","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-05-05T09:44:08Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a21f4f914b3c259bd0ee472dfb33b2800eac5d434d7e638eb73b0c2910eceb1b","abstract_canon_sha256":"05047d0d524a6cd0d754ce80fc665834d2ad3c649e79603d9c12964106d63d49"},"schema_version":"1.0"},"canonical_sha256":"dee85428fbc4017e698d5c89df0a77f0ddf22e47dd2098f2a0670835437b0fdc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:31.149696Z","signature_b64":"7nKP69XgfWWTLkB7Rw48xz3rmJioESU7KvSvEBPUzX0XusnkGz55ru7H6J/Wrugogvk3jayARSieIjYnxFxTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dee85428fbc4017e698d5c89df0a77f0ddf22e47dd2098f2a0670835437b0fdc","last_reissued_at":"2026-05-18T03:26:31.149130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:31.149130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1002","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-18T03:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tIInq7+GWwpocP6PkX/5H4kEDFzcDENUlj1IsVUYRufNgYpJ1u3ODvSLcBo3WXGlp4/aO/uD2fYCnG0Eg37QBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:24:15.343666Z"},"content_sha256":"69c8f32314ebb5d62ae849a6a9614706cf663aee660c1718e2ee2ac4acd04522","schema_version":"1.0","event_id":"sha256:69c8f32314ebb5d62ae849a6a9614706cf663aee660c1718e2ee2ac4acd04522"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:33UFIKH3YQAX42MNLSE56CTX6D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Estimation of the number of neighbours in Probabilistic K Nearest Neighbour Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ji Won Yoon, Nial Friel","submitted_at":"2013-05-05T09:44:08Z","abstract_excerpt":"Probabilistic k-nearest neighbour (PKNN) classification has been introduced to improve the performance of original k-nearest neighbour (KNN) classification algorithm by explicitly modelling uncertainty in the classification of each feature vector. However, an issue common to both KNN and PKNN is to select the optimal number of neighbours, $k$. The contribution of this paper is to incorporate the uncertainty in $k$ into the decision making, and in so doing use Bayesian model averaging to provide improved classification. Indeed the problem of assessing the uncertainty in $k$ can be viewed as one"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1002","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-18T03:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wRdz3/XPYqwtApZ+liI+4AMEfKpViILb+k/eWqxQrzvnlueSgHS9XS82XEI+jxaPrOCZj3s0JeaI7xq3H5paCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:24:15.343996Z"},"content_sha256":"21a15d9ad6263fcb9c51859652c322aceb621959a15a7dd8fe2acefb3a0d84b0","schema_version":"1.0","event_id":"sha256:21a15d9ad6263fcb9c51859652c322aceb621959a15a7dd8fe2acefb3a0d84b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33UFIKH3YQAX42MNLSE56CTX6D/bundle.json","state_url":"https://pith.science/pith/33UFIKH3YQAX42MNLSE56CTX6D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33UFIKH3YQAX42MNLSE56CTX6D/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-06-29T21:24:15Z","links":{"resolver":"https://pith.science/pith/33UFIKH3YQAX42MNLSE56CTX6D","bundle":"https://pith.science/pith/33UFIKH3YQAX42MNLSE56CTX6D/bundle.json","state":"https://pith.science/pith/33UFIKH3YQAX42MNLSE56CTX6D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33UFIKH3YQAX42MNLSE56CTX6D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:33UFIKH3YQAX42MNLSE56CTX6D","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":"05047d0d524a6cd0d754ce80fc665834d2ad3c649e79603d9c12964106d63d49","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-05-05T09:44:08Z","title_canon_sha256":"a21f4f914b3c259bd0ee472dfb33b2800eac5d434d7e638eb73b0c2910eceb1b"},"schema_version":"1.0","source":{"id":"1305.1002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1002","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1002v1","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1002","created_at":"2026-05-18T03:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"33UFIKH3YQAX","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"33UFIKH3YQAX42MN","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"33UFIKH3","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:21a15d9ad6263fcb9c51859652c322aceb621959a15a7dd8fe2acefb3a0d84b0","target":"graph","created_at":"2026-05-18T03:26:31Z","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":"Probabilistic k-nearest neighbour (PKNN) classification has been introduced to improve the performance of original k-nearest neighbour (KNN) classification algorithm by explicitly modelling uncertainty in the classification of each feature vector. However, an issue common to both KNN and PKNN is to select the optimal number of neighbours, $k$. The contribution of this paper is to incorporate the uncertainty in $k$ into the decision making, and in so doing use Bayesian model averaging to provide improved classification. Indeed the problem of assessing the uncertainty in $k$ can be viewed as one","authors_text":"Ji Won Yoon, Nial Friel","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-05-05T09:44:08Z","title":"Efficient Estimation of the number of neighbours in Probabilistic K Nearest Neighbour Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1002","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:69c8f32314ebb5d62ae849a6a9614706cf663aee660c1718e2ee2ac4acd04522","target":"record","created_at":"2026-05-18T03:26:31Z","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":"05047d0d524a6cd0d754ce80fc665834d2ad3c649e79603d9c12964106d63d49","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-05-05T09:44:08Z","title_canon_sha256":"a21f4f914b3c259bd0ee472dfb33b2800eac5d434d7e638eb73b0c2910eceb1b"},"schema_version":"1.0","source":{"id":"1305.1002","kind":"arxiv","version":1}},"canonical_sha256":"dee85428fbc4017e698d5c89df0a77f0ddf22e47dd2098f2a0670835437b0fdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dee85428fbc4017e698d5c89df0a77f0ddf22e47dd2098f2a0670835437b0fdc","first_computed_at":"2026-05-18T03:26:31.149130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:31.149130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7nKP69XgfWWTLkB7Rw48xz3rmJioESU7KvSvEBPUzX0XusnkGz55ru7H6J/Wrugogvk3jayARSieIjYnxFxTCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:31.149696Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69c8f32314ebb5d62ae849a6a9614706cf663aee660c1718e2ee2ac4acd04522","sha256:21a15d9ad6263fcb9c51859652c322aceb621959a15a7dd8fe2acefb3a0d84b0"],"state_sha256":"2aa6898a4bc04dddcdd5974b6a79676303876ef60d436b6a23765784cd480e93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ezSaJ5k5k9CHfmp5hKxoniJmfcUqtE+1TdNMCw94ssKQNs2SkBxzQFgwMVt++tX7Qnuc46bbOlazOjAHGp2aCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T21:24:15.346021Z","bundle_sha256":"228a05b9fe2c8e777ab0fb2978ff1a32374651eb715d705cb6b9df9708cc4b56"}}