{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YVQ7DN5X7TLAYSDEQV4OLQAEEM","short_pith_number":"pith:YVQ7DN5X","schema_version":"1.0","canonical_sha256":"c561f1b7b7fcd60c48648578e5c004231ac6923191e32dc435257bc59b3f0847","source":{"kind":"arxiv","id":"1309.7676","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.7676","created_at":"2026-05-18T03:11:48.749733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7676v1","created_at":"2026-05-18T03:11:48.749733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7676","created_at":"2026-05-18T03:11:48.749733+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVQ7DN5X7TLA","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVQ7DN5X7TLAYSDE","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVQ7DN5X","created_at":"2026-05-18T12:28:09.283467+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/YVQ7DN5X7TLAYSDEQV4OLQAEEM","json":"https://pith.science/pith/YVQ7DN5X7TLAYSDEQV4OLQAEEM.json","graph_json":"https://pith.science/api/pith-number/YVQ7DN5X7TLAYSDEQV4OLQAEEM/graph.json","events_json":"https://pith.science/api/pith-number/YVQ7DN5X7TLAYSDEQV4OLQAEEM/events.json","paper":"https://pith.science/paper/YVQ7DN5X"},"agent_actions":{"view_html":"https://pith.science/pith/YVQ7DN5X7TLAYSDEQV4OLQAEEM","download_json":"https://pith.science/pith/YVQ7DN5X7TLAYSDEQV4OLQAEEM.json","view_paper":"https://pith.science/paper/YVQ7DN5X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7676&json=true","fetch_graph":"https://pith.science/api/pith-number/YVQ7DN5X7TLAYSDEQV4OLQAEEM/graph.json","fetch_events":"https://pith.science/api/pith-number/YVQ7DN5X7TLAYSDEQV4OLQAEEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVQ7DN5X7TLAYSDEQV4OLQAEEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVQ7DN5X7TLAYSDEQV4OLQAEEM/action/storage_attestation","attest_author":"https://pith.science/pith/YVQ7DN5X7TLAYSDEQV4OLQAEEM/action/author_attestation","sign_citation":"https://pith.science/pith/YVQ7DN5X7TLAYSDEQV4OLQAEEM/action/citation_signature","submit_replication":"https://pith.science/pith/YVQ7DN5X7TLAYSDEQV4OLQAEEM/action/replication_record"}},"created_at":"2026-05-18T03:11:48.749733+00:00","updated_at":"2026-05-18T03:11:48.749733+00:00"}