{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O2WIEYAMHSVMX4VBZEIFILOTEA","short_pith_number":"pith:O2WIEYAM","canonical_record":{"source":{"id":"1810.11165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-26T02:01:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c2e0e1c468131c3fe8d49360ff283b08ae3cb10b98f784657909d8f1bb36d0ea","abstract_canon_sha256":"6fbcee31b9d03324238f252b60baa6ab99d556160b10c0507f637ba5cfdbaa42"},"schema_version":"1.0"},"canonical_sha256":"76ac82600c3caacbf2a1c910542dd320115ae07a4fb9fe85b758dfbcf88fb6bb","source":{"kind":"arxiv","id":"1810.11165","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11165","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11165v1","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11165","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"O2WIEYAMHSVM","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O2WIEYAMHSVMX4VB","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O2WIEYAM","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O2WIEYAMHSVMX4VBZEIFILOTEA","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-26T02:01:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c2e0e1c468131c3fe8d49360ff283b08ae3cb10b98f784657909d8f1bb36d0ea","abstract_canon_sha256":"6fbcee31b9d03324238f252b60baa6ab99d556160b10c0507f637ba5cfdbaa42"},"schema_version":"1.0"},"canonical_sha256":"76ac82600c3caacbf2a1c910542dd320115ae07a4fb9fe85b758dfbcf88fb6bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:15.031384Z","signature_b64":"FPinJ0ApWtpzQwcLILpSCjayCNEN5uEBZ6tEVpFhHzpg5U0dA+tNi8ffsmN/wFpX0s2oC+O3mUx1PHhyUKiaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76ac82600c3caacbf2a1c910542dd320115ae07a4fb9fe85b758dfbcf88fb6bb","last_reissued_at":"2026-05-18T00:02:15.030779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:15.030779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11165","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:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lK6Mt37Zjnam+6sQaAamukLQh7ZIuY69/WLXv0XEVyrPo1A7FwaETqIAFCSsNWiDbi5hOIouJOknwXx3auofDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:43:27.875826Z"},"content_sha256":"35d377984b698888494208a3032a47b8440ea2d1c6ba738eed0c1c3f48ee9aa9","schema_version":"1.0","event_id":"sha256:35d377984b698888494208a3032a47b8440ea2d1c6ba738eed0c1c3f48ee9aa9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O2WIEYAMHSVMX4VBZEIFILOTEA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient learning of neighbor representations for boundary trees and forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Stark C. Draper, Tharindu Adikari","submitted_at":"2018-10-26T02:01:30Z","abstract_excerpt":"We introduce a semiparametric approach to neighbor-based classification. We build off the recently proposed Boundary Trees algorithm by Mathy et al.(2015) which enables fast neighbor-based classification, regression and retrieval in large datasets. While boundary trees use an Euclidean measure of similarity, the Differentiable Boundary Tree algorithm by Zoran et al.(2017) was introduced to learn low-dimensional representations of complex input data, on which semantic similarity can be calculated to train boundary trees. As is pointed out by its authors, the differentiable boundary tree approac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11165","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:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F72Btbide0Ha/UlDakQO9TZvYHV3gmzih/3jVlSqyL8PO5PHFG/BZcC+P1ybKyqss5rqpJhvJGYYCqMe6PJ9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:43:27.876503Z"},"content_sha256":"54541800989fd548838c04d267600669dfaef203726ebba7b2a152bcf442731f","schema_version":"1.0","event_id":"sha256:54541800989fd548838c04d267600669dfaef203726ebba7b2a152bcf442731f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2WIEYAMHSVMX4VBZEIFILOTEA/bundle.json","state_url":"https://pith.science/pith/O2WIEYAMHSVMX4VBZEIFILOTEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2WIEYAMHSVMX4VBZEIFILOTEA/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-05T06:43:27Z","links":{"resolver":"https://pith.science/pith/O2WIEYAMHSVMX4VBZEIFILOTEA","bundle":"https://pith.science/pith/O2WIEYAMHSVMX4VBZEIFILOTEA/bundle.json","state":"https://pith.science/pith/O2WIEYAMHSVMX4VBZEIFILOTEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2WIEYAMHSVMX4VBZEIFILOTEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O2WIEYAMHSVMX4VBZEIFILOTEA","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":"6fbcee31b9d03324238f252b60baa6ab99d556160b10c0507f637ba5cfdbaa42","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-26T02:01:30Z","title_canon_sha256":"c2e0e1c468131c3fe8d49360ff283b08ae3cb10b98f784657909d8f1bb36d0ea"},"schema_version":"1.0","source":{"id":"1810.11165","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11165","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11165v1","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11165","created_at":"2026-05-18T00:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"O2WIEYAMHSVM","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O2WIEYAMHSVMX4VB","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O2WIEYAM","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:54541800989fd548838c04d267600669dfaef203726ebba7b2a152bcf442731f","target":"graph","created_at":"2026-05-18T00:02:15Z","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":"We introduce a semiparametric approach to neighbor-based classification. We build off the recently proposed Boundary Trees algorithm by Mathy et al.(2015) which enables fast neighbor-based classification, regression and retrieval in large datasets. While boundary trees use an Euclidean measure of similarity, the Differentiable Boundary Tree algorithm by Zoran et al.(2017) was introduced to learn low-dimensional representations of complex input data, on which semantic similarity can be calculated to train boundary trees. As is pointed out by its authors, the differentiable boundary tree approac","authors_text":"Stark C. Draper, Tharindu Adikari","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-26T02:01:30Z","title":"Efficient learning of neighbor representations for boundary trees and forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11165","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:35d377984b698888494208a3032a47b8440ea2d1c6ba738eed0c1c3f48ee9aa9","target":"record","created_at":"2026-05-18T00:02:15Z","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":"6fbcee31b9d03324238f252b60baa6ab99d556160b10c0507f637ba5cfdbaa42","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-26T02:01:30Z","title_canon_sha256":"c2e0e1c468131c3fe8d49360ff283b08ae3cb10b98f784657909d8f1bb36d0ea"},"schema_version":"1.0","source":{"id":"1810.11165","kind":"arxiv","version":1}},"canonical_sha256":"76ac82600c3caacbf2a1c910542dd320115ae07a4fb9fe85b758dfbcf88fb6bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76ac82600c3caacbf2a1c910542dd320115ae07a4fb9fe85b758dfbcf88fb6bb","first_computed_at":"2026-05-18T00:02:15.030779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:15.030779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FPinJ0ApWtpzQwcLILpSCjayCNEN5uEBZ6tEVpFhHzpg5U0dA+tNi8ffsmN/wFpX0s2oC+O3mUx1PHhyUKiaAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:15.031384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11165","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35d377984b698888494208a3032a47b8440ea2d1c6ba738eed0c1c3f48ee9aa9","sha256:54541800989fd548838c04d267600669dfaef203726ebba7b2a152bcf442731f"],"state_sha256":"7ffb4ae7b09db9ae706e5925e82fe8b49144b16b532f2f69cd47177fef293862"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YzggSYJcvCUxvaQFD4oM1+jtPta19GcM4zBOodo1xDsaagAnmb/DGhAi+AH7i/F5Q+G6QQLQFqYUwJM51c4ADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:43:27.879850Z","bundle_sha256":"db55442bcf4b93d349cbf44452f12cf9aaaf6e50e8c444546efa7961bd703687"}}