{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YVQ7DN5X7TLAYSDEQV4OLQAEEM","short_pith_number":"pith:YVQ7DN5X","canonical_record":{"source":{"id":"1309.7676","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-09-29T23:45:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"601f28ce5faa5351a8524e9afa6ad68634a730d3206665aebf203fe9ee7ab855","abstract_canon_sha256":"ea3cb9217faf544913cd5f552c12137946df6d9117bf13d81f99cff4a2758026"},"schema_version":"1.0"},"canonical_sha256":"c561f1b7b7fcd60c48648578e5c004231ac6923191e32dc435257bc59b3f0847","source":{"kind":"arxiv","id":"1309.7676","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7676","created_at":"2026-05-18T03:11:48Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7676v1","created_at":"2026-05-18T03:11:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7676","created_at":"2026-05-18T03:11:48Z"},{"alias_kind":"pith_short_12","alias_value":"YVQ7DN5X7TLA","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YVQ7DN5X7TLAYSDE","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YVQ7DN5X","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YVQ7DN5X7TLAYSDEQV4OLQAEEM","target":"record","payload":{"canonical_record":{"source":{"id":"1309.7676","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-09-29T23:45:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"601f28ce5faa5351a8524e9afa6ad68634a730d3206665aebf203fe9ee7ab855","abstract_canon_sha256":"ea3cb9217faf544913cd5f552c12137946df6d9117bf13d81f99cff4a2758026"},"schema_version":"1.0"},"canonical_sha256":"c561f1b7b7fcd60c48648578e5c004231ac6923191e32dc435257bc59b3f0847","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:48.750231Z","signature_b64":"gf99+1ypMupNU5E1+XbEjZAygP1aqx3ErYF3osp/ToEpxnhb+WI3RozOBZVjNOYeQHUJdXKmtikUx8sK4lONCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c561f1b7b7fcd60c48648578e5c004231ac6923191e32dc435257bc59b3f0847","last_reissued_at":"2026-05-18T03:11:48.749656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:48.749656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.7676","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:11:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X9xWF5cDa705IHCt97wEdc8TEEGrAFvWr0Ty/XlVfqHxYyeP3vpr23evC5oiOmlh1uGoWDD3okdFPH5xMr9RDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:23.703064Z"},"content_sha256":"9fe8d9185ca621a3fa7ad9759a8336500997fd8c0390c5051812156466442ff9","schema_version":"1.0","event_id":"sha256:9fe8d9185ca621a3fa7ad9759a8336500997fd8c0390c5051812156466442ff9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YVQ7DN5X7TLAYSDEQV4OLQAEEM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An upper bound on prototype set size for condensed nearest neighbor","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eric Christiansen","submitted_at":"2013-09-29T23:45:59Z","abstract_excerpt":"The condensed nearest neighbor (CNN) algorithm is a heuristic for reducing the number of prototypical points stored by a nearest neighbor classifier, while keeping the classification rule given by the reduced prototypical set consistent with the full set. I present an upper bound on the number of prototypical points accumulated by CNN. The bound originates in a bound on the number of times the decision rule is updated during training in the multiclass perceptron algorithm, and thus is independent of training set size."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7676","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:11:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fjyDjjTrdJH1b+GZf79FxLnF0wHQlTo1GTApyqQv8P6qLq8wRqhhRmHTOscdqTb/i8iNJSjSx+XhA4Fdb6lRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:23.703721Z"},"content_sha256":"ffe2dc431f4b0aa06fe4264e828fca0e859cc5afc863ea0389d94aad883c6b2d","schema_version":"1.0","event_id":"sha256:ffe2dc431f4b0aa06fe4264e828fca0e859cc5afc863ea0389d94aad883c6b2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVQ7DN5X7TLAYSDEQV4OLQAEEM/bundle.json","state_url":"https://pith.science/pith/YVQ7DN5X7TLAYSDEQV4OLQAEEM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVQ7DN5X7TLAYSDEQV4OLQAEEM/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-05-27T23:18:23Z","links":{"resolver":"https://pith.science/pith/YVQ7DN5X7TLAYSDEQV4OLQAEEM","bundle":"https://pith.science/pith/YVQ7DN5X7TLAYSDEQV4OLQAEEM/bundle.json","state":"https://pith.science/pith/YVQ7DN5X7TLAYSDEQV4OLQAEEM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVQ7DN5X7TLAYSDEQV4OLQAEEM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YVQ7DN5X7TLAYSDEQV4OLQAEEM","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":"ea3cb9217faf544913cd5f552c12137946df6d9117bf13d81f99cff4a2758026","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-09-29T23:45:59Z","title_canon_sha256":"601f28ce5faa5351a8524e9afa6ad68634a730d3206665aebf203fe9ee7ab855"},"schema_version":"1.0","source":{"id":"1309.7676","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7676","created_at":"2026-05-18T03:11:48Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7676v1","created_at":"2026-05-18T03:11:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7676","created_at":"2026-05-18T03:11:48Z"},{"alias_kind":"pith_short_12","alias_value":"YVQ7DN5X7TLA","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YVQ7DN5X7TLAYSDE","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YVQ7DN5X","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:ffe2dc431f4b0aa06fe4264e828fca0e859cc5afc863ea0389d94aad883c6b2d","target":"graph","created_at":"2026-05-18T03:11:48Z","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":"The condensed nearest neighbor (CNN) algorithm is a heuristic for reducing the number of prototypical points stored by a nearest neighbor classifier, while keeping the classification rule given by the reduced prototypical set consistent with the full set. I present an upper bound on the number of prototypical points accumulated by CNN. The bound originates in a bound on the number of times the decision rule is updated during training in the multiclass perceptron algorithm, and thus is independent of training set size.","authors_text":"Eric Christiansen","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-09-29T23:45:59Z","title":"An upper bound on prototype set size for condensed nearest neighbor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7676","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:9fe8d9185ca621a3fa7ad9759a8336500997fd8c0390c5051812156466442ff9","target":"record","created_at":"2026-05-18T03:11:48Z","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":"ea3cb9217faf544913cd5f552c12137946df6d9117bf13d81f99cff4a2758026","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-09-29T23:45:59Z","title_canon_sha256":"601f28ce5faa5351a8524e9afa6ad68634a730d3206665aebf203fe9ee7ab855"},"schema_version":"1.0","source":{"id":"1309.7676","kind":"arxiv","version":1}},"canonical_sha256":"c561f1b7b7fcd60c48648578e5c004231ac6923191e32dc435257bc59b3f0847","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c561f1b7b7fcd60c48648578e5c004231ac6923191e32dc435257bc59b3f0847","first_computed_at":"2026-05-18T03:11:48.749656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:48.749656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gf99+1ypMupNU5E1+XbEjZAygP1aqx3ErYF3osp/ToEpxnhb+WI3RozOBZVjNOYeQHUJdXKmtikUx8sK4lONCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:48.750231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.7676","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fe8d9185ca621a3fa7ad9759a8336500997fd8c0390c5051812156466442ff9","sha256:ffe2dc431f4b0aa06fe4264e828fca0e859cc5afc863ea0389d94aad883c6b2d"],"state_sha256":"1bff4de5f92ce6b152976f80f0c9d132904bbb2747a374916ecfe820721f2c11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"16B99kwyRCwiHYvCi+U5DT0QAJSdbRPMQX/c+lth4S0A76OWZSPyD+ElM0pV9TfZnFfYDdtnR2lVKKCHNpxOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:18:23.707252Z","bundle_sha256":"066947234a3e709daa6dc1d9884bb7302a8256f63ae5cdf0676897f8bc055fbc"}}