{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:M6ZC7EFJQSH7ZCHQB3NH7FIIUS","short_pith_number":"pith:M6ZC7EFJ","schema_version":"1.0","canonical_sha256":"67b22f90a9848ffc88f00eda7f9508a4aeb4a83ff6854d57c2784edb4f56ccf2","source":{"kind":"arxiv","id":"1702.08833","version":1},"attestation_state":"computed","paper":{"title":"Learning Deep Nearest Neighbor Representations Using Differentiable Boundary Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Balaji Lakshminarayanan, Charles Blundell, Daniel Zoran","submitted_at":"2017-02-28T16:01:22Z","abstract_excerpt":"Nearest neighbor (kNN) methods have been gaining popularity in recent years in light of advances in hardware and efficiency of algorithms. There is a plethora of methods to choose from today, each with their own advantages and disadvantages. One requirement shared between all kNN based methods is the need for a good representation and distance measure between samples.\n  We introduce a new method called differentiable boundary tree which allows for learning deep kNN representations. We build on the recently proposed boundary tree algorithm which allows for efficient nearest neighbor classificat"},"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":"1702.08833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-28T16:01:22Z","cross_cats_sorted":[],"title_canon_sha256":"ea4f9e99816c396a88dbe71e7d0508489843789fa4c2d90a24a544c438d0eba2","abstract_canon_sha256":"39c4309a2a1399a2897442f1d113c0cfa6b9b11245fd1f32da38cd7e7e545e1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:47.787456Z","signature_b64":"IGUyuD0fl0fi3ddEfx5L9rCHt4AZY3kNi/DzTtv7WyQk1IT7ch5a1f9bt8bKuVaKNY5g18qcLyXKMyzYyWGLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67b22f90a9848ffc88f00eda7f9508a4aeb4a83ff6854d57c2784edb4f56ccf2","last_reissued_at":"2026-05-18T00:49:47.786751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:47.786751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Deep Nearest Neighbor Representations Using Differentiable Boundary Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Balaji Lakshminarayanan, Charles Blundell, Daniel Zoran","submitted_at":"2017-02-28T16:01:22Z","abstract_excerpt":"Nearest neighbor (kNN) methods have been gaining popularity in recent years in light of advances in hardware and efficiency of algorithms. There is a plethora of methods to choose from today, each with their own advantages and disadvantages. One requirement shared between all kNN based methods is the need for a good representation and distance measure between samples.\n  We introduce a new method called differentiable boundary tree which allows for learning deep kNN representations. We build on the recently proposed boundary tree algorithm which allows for efficient nearest neighbor classificat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08833","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":"1702.08833","created_at":"2026-05-18T00:49:47.786859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.08833v1","created_at":"2026-05-18T00:49:47.786859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08833","created_at":"2026-05-18T00:49:47.786859+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6ZC7EFJQSH7","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6ZC7EFJQSH7ZCHQ","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6ZC7EFJ","created_at":"2026-05-18T12:31:31.346846+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/M6ZC7EFJQSH7ZCHQB3NH7FIIUS","json":"https://pith.science/pith/M6ZC7EFJQSH7ZCHQB3NH7FIIUS.json","graph_json":"https://pith.science/api/pith-number/M6ZC7EFJQSH7ZCHQB3NH7FIIUS/graph.json","events_json":"https://pith.science/api/pith-number/M6ZC7EFJQSH7ZCHQB3NH7FIIUS/events.json","paper":"https://pith.science/paper/M6ZC7EFJ"},"agent_actions":{"view_html":"https://pith.science/pith/M6ZC7EFJQSH7ZCHQB3NH7FIIUS","download_json":"https://pith.science/pith/M6ZC7EFJQSH7ZCHQB3NH7FIIUS.json","view_paper":"https://pith.science/paper/M6ZC7EFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.08833&json=true","fetch_graph":"https://pith.science/api/pith-number/M6ZC7EFJQSH7ZCHQB3NH7FIIUS/graph.json","fetch_events":"https://pith.science/api/pith-number/M6ZC7EFJQSH7ZCHQB3NH7FIIUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6ZC7EFJQSH7ZCHQB3NH7FIIUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6ZC7EFJQSH7ZCHQB3NH7FIIUS/action/storage_attestation","attest_author":"https://pith.science/pith/M6ZC7EFJQSH7ZCHQB3NH7FIIUS/action/author_attestation","sign_citation":"https://pith.science/pith/M6ZC7EFJQSH7ZCHQB3NH7FIIUS/action/citation_signature","submit_replication":"https://pith.science/pith/M6ZC7EFJQSH7ZCHQB3NH7FIIUS/action/replication_record"}},"created_at":"2026-05-18T00:49:47.786859+00:00","updated_at":"2026-05-18T00:49:47.786859+00:00"}