{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:M6ZC7EFJQSH7ZCHQB3NH7FIIUS","short_pith_number":"pith:M6ZC7EFJ","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"},"canonical_sha256":"67b22f90a9848ffc88f00eda7f9508a4aeb4a83ff6854d57c2784edb4f56ccf2","source":{"kind":"arxiv","id":"1702.08833","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08833","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08833v1","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08833","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"pith_short_12","alias_value":"M6ZC7EFJQSH7","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"M6ZC7EFJQSH7ZCHQ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"M6ZC7EFJ","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:M6ZC7EFJQSH7ZCHQB3NH7FIIUS","target":"record","payload":{"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"},"canonical_sha256":"67b22f90a9848ffc88f00eda7f9508a4aeb4a83ff6854d57c2784edb4f56ccf2","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"},"source_kind":"arxiv","source_id":"1702.08833","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-18T00:49:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Od7rPxpiL/0579QysLxdaW/B7RF9UibrUWlzefV3PZx9HBz4GpGp7C7/FawsF9s+gC7jSBDxeMo3G79CRpZ8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:09:39.850066Z"},"content_sha256":"524d354464b8bc4b48efc9d43c5a502addfaa2612bebd51025159eb0b52ea739","schema_version":"1.0","event_id":"sha256:524d354464b8bc4b48efc9d43c5a502addfaa2612bebd51025159eb0b52ea739"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:M6ZC7EFJQSH7ZCHQB3NH7FIIUS","target":"graph","payload":{"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"},"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-18T00:49:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XX2li9mwvzWjXYaUHxGMxczwMxSEmjjw2HsvF03IHNp/9oftgmOsZBluj1y1VTfJpAhv2NGojSTnVhCOWiVaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T14:09:39.850713Z"},"content_sha256":"866b4806f5486bcb2eb70bdf3a19f1bf331ccac42b031bdd66df42ae0dd35e81","schema_version":"1.0","event_id":"sha256:866b4806f5486bcb2eb70bdf3a19f1bf331ccac42b031bdd66df42ae0dd35e81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6ZC7EFJQSH7ZCHQB3NH7FIIUS/bundle.json","state_url":"https://pith.science/pith/M6ZC7EFJQSH7ZCHQB3NH7FIIUS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6ZC7EFJQSH7ZCHQB3NH7FIIUS/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-06T14:09:39Z","links":{"resolver":"https://pith.science/pith/M6ZC7EFJQSH7ZCHQB3NH7FIIUS","bundle":"https://pith.science/pith/M6ZC7EFJQSH7ZCHQB3NH7FIIUS/bundle.json","state":"https://pith.science/pith/M6ZC7EFJQSH7ZCHQB3NH7FIIUS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6ZC7EFJQSH7ZCHQB3NH7FIIUS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:M6ZC7EFJQSH7ZCHQB3NH7FIIUS","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":"39c4309a2a1399a2897442f1d113c0cfa6b9b11245fd1f32da38cd7e7e545e1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-28T16:01:22Z","title_canon_sha256":"ea4f9e99816c396a88dbe71e7d0508489843789fa4c2d90a24a544c438d0eba2"},"schema_version":"1.0","source":{"id":"1702.08833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08833","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08833v1","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08833","created_at":"2026-05-18T00:49:47Z"},{"alias_kind":"pith_short_12","alias_value":"M6ZC7EFJQSH7","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"M6ZC7EFJQSH7ZCHQ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"M6ZC7EFJ","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:866b4806f5486bcb2eb70bdf3a19f1bf331ccac42b031bdd66df42ae0dd35e81","target":"graph","created_at":"2026-05-18T00:49:47Z","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":"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","authors_text":"Balaji Lakshminarayanan, Charles Blundell, Daniel Zoran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-28T16:01:22Z","title":"Learning Deep Nearest Neighbor Representations Using Differentiable Boundary Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08833","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:524d354464b8bc4b48efc9d43c5a502addfaa2612bebd51025159eb0b52ea739","target":"record","created_at":"2026-05-18T00:49:47Z","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":"39c4309a2a1399a2897442f1d113c0cfa6b9b11245fd1f32da38cd7e7e545e1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-28T16:01:22Z","title_canon_sha256":"ea4f9e99816c396a88dbe71e7d0508489843789fa4c2d90a24a544c438d0eba2"},"schema_version":"1.0","source":{"id":"1702.08833","kind":"arxiv","version":1}},"canonical_sha256":"67b22f90a9848ffc88f00eda7f9508a4aeb4a83ff6854d57c2784edb4f56ccf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67b22f90a9848ffc88f00eda7f9508a4aeb4a83ff6854d57c2784edb4f56ccf2","first_computed_at":"2026-05-18T00:49:47.786751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:47.786751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IGUyuD0fl0fi3ddEfx5L9rCHt4AZY3kNi/DzTtv7WyQk1IT7ch5a1f9bt8bKuVaKNY5g18qcLyXKMyzYyWGLBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:47.787456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:524d354464b8bc4b48efc9d43c5a502addfaa2612bebd51025159eb0b52ea739","sha256:866b4806f5486bcb2eb70bdf3a19f1bf331ccac42b031bdd66df42ae0dd35e81"],"state_sha256":"53557af70843b43b956391a08645296b07a9e6d853d34740c5fdf1eabf7c8fe1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0YB/aLNhDBmAfr/EehCbFp14inS2ZuCPr6NGTF/l+d4ULSqLpQTjqH05Y7RZhuBcQ7X5ubpftswUc5eyfiC0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T14:09:39.853986Z","bundle_sha256":"11704fa084c31c6d3620179745cf4277467fe7af2b707f461a17915e59e3ac0e"}}