{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DRXA4ALB3A2JSCAEVN33F36OJV","short_pith_number":"pith:DRXA4ALB","schema_version":"1.0","canonical_sha256":"1c6e0e0161d834990804ab77b2efce4d6eb8d87c7c54d603fa6b3ca87413c572","source":{"kind":"arxiv","id":"1607.03050","version":1},"attestation_state":"computed","paper":{"title":"Learning a metric for class-conditional KNN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Jiwoong Im, Graham W. Taylor","submitted_at":"2016-07-11T17:29:19Z","abstract_excerpt":"Naive Bayes Nearest Neighbour (NBNN) is a simple and effective framework which addresses many of the pitfalls of K-Nearest Neighbour (KNN) classification. It has yielded competitive results on several computer vision benchmarks. Its central tenet is that during NN search, a query is not compared to every example in a database, ignoring class information. Instead, NN searches are performed within each class, generating a score per class. A key problem with NN techniques, including NBNN, is that they fail when the data representation does not capture perceptual (e.g.~class-based) similarity. NBN"},"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":"1607.03050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-07-11T17:29:19Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dda5780f6ac9a107ecb112eaddefa9f5560138b804db756d70ba99a7c9a5fc8a","abstract_canon_sha256":"66164bb10be48dc0bca8095a27d0f232b6ec808f6675ad72648007ba217578f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:14.081297Z","signature_b64":"D9rRQtfrJfI45tQZky1oDRPVi1cX8hBubhcbC1KbNefeCGEoHoC1i8FuqinvdyCzLAP5rxE7FLqtHcLoe7P4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c6e0e0161d834990804ab77b2efce4d6eb8d87c7c54d603fa6b3ca87413c572","last_reissued_at":"2026-05-18T01:11:14.080691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:14.080691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning a metric for class-conditional KNN","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Jiwoong Im, Graham W. Taylor","submitted_at":"2016-07-11T17:29:19Z","abstract_excerpt":"Naive Bayes Nearest Neighbour (NBNN) is a simple and effective framework which addresses many of the pitfalls of K-Nearest Neighbour (KNN) classification. It has yielded competitive results on several computer vision benchmarks. Its central tenet is that during NN search, a query is not compared to every example in a database, ignoring class information. Instead, NN searches are performed within each class, generating a score per class. A key problem with NN techniques, including NBNN, is that they fail when the data representation does not capture perceptual (e.g.~class-based) similarity. NBN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03050","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":"1607.03050","created_at":"2026-05-18T01:11:14.080795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03050v1","created_at":"2026-05-18T01:11:14.080795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03050","created_at":"2026-05-18T01:11:14.080795+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRXA4ALB3A2J","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRXA4ALB3A2JSCAE","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRXA4ALB","created_at":"2026-05-18T12:30:12.583610+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/DRXA4ALB3A2JSCAEVN33F36OJV","json":"https://pith.science/pith/DRXA4ALB3A2JSCAEVN33F36OJV.json","graph_json":"https://pith.science/api/pith-number/DRXA4ALB3A2JSCAEVN33F36OJV/graph.json","events_json":"https://pith.science/api/pith-number/DRXA4ALB3A2JSCAEVN33F36OJV/events.json","paper":"https://pith.science/paper/DRXA4ALB"},"agent_actions":{"view_html":"https://pith.science/pith/DRXA4ALB3A2JSCAEVN33F36OJV","download_json":"https://pith.science/pith/DRXA4ALB3A2JSCAEVN33F36OJV.json","view_paper":"https://pith.science/paper/DRXA4ALB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03050&json=true","fetch_graph":"https://pith.science/api/pith-number/DRXA4ALB3A2JSCAEVN33F36OJV/graph.json","fetch_events":"https://pith.science/api/pith-number/DRXA4ALB3A2JSCAEVN33F36OJV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRXA4ALB3A2JSCAEVN33F36OJV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRXA4ALB3A2JSCAEVN33F36OJV/action/storage_attestation","attest_author":"https://pith.science/pith/DRXA4ALB3A2JSCAEVN33F36OJV/action/author_attestation","sign_citation":"https://pith.science/pith/DRXA4ALB3A2JSCAEVN33F36OJV/action/citation_signature","submit_replication":"https://pith.science/pith/DRXA4ALB3A2JSCAEVN33F36OJV/action/replication_record"}},"created_at":"2026-05-18T01:11:14.080795+00:00","updated_at":"2026-05-18T01:11:14.080795+00:00"}