{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:N6LNCUYEWMOKROLXH3VZMCQP7I","short_pith_number":"pith:N6LNCUYE","canonical_record":{"source":{"id":"1708.02976","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-08-09T19:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"93365dd7c2119a0c0598f9737b3ba83fb5a644cfdedd0367fa21c6afb159de0b","abstract_canon_sha256":"9b6923d308a7ab1f15cc990eb504f08a40c253b028c326e1d1a027f3b27f4c82"},"schema_version":"1.0"},"canonical_sha256":"6f96d15304b31ca8b9773eeb960a0ffa08abda4f238d66ab17623f8363c29ee6","source":{"kind":"arxiv","id":"1708.02976","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02976","created_at":"2026-05-17T23:50:38Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02976v2","created_at":"2026-05-17T23:50:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02976","created_at":"2026-05-17T23:50:38Z"},{"alias_kind":"pith_short_12","alias_value":"N6LNCUYEWMOK","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N6LNCUYEWMOKROLX","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N6LNCUYE","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:N6LNCUYEWMOKROLXH3VZMCQP7I","target":"record","payload":{"canonical_record":{"source":{"id":"1708.02976","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-08-09T19:16:01Z","cross_cats_sorted":[],"title_canon_sha256":"93365dd7c2119a0c0598f9737b3ba83fb5a644cfdedd0367fa21c6afb159de0b","abstract_canon_sha256":"9b6923d308a7ab1f15cc990eb504f08a40c253b028c326e1d1a027f3b27f4c82"},"schema_version":"1.0"},"canonical_sha256":"6f96d15304b31ca8b9773eeb960a0ffa08abda4f238d66ab17623f8363c29ee6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:38.889673Z","signature_b64":"dA5HG76FAC1oASFpeFpc5eIR0lH0tjGVn2GjIiMfshtgr/mRPI8/cKxbJa5w1HIEIg2vJCEhmGgi8DZhSh4HCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f96d15304b31ca8b9773eeb960a0ffa08abda4f238d66ab17623f8363c29ee6","last_reissued_at":"2026-05-17T23:50:38.889187Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:38.889187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.02976","source_version":2,"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-17T23:50:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vP120p4XD1s6ZTI1sWTbU9nErJVa93BBJSO90yb+/5V5rKgm9PAg1D8UsO1BAPnWMM+sEBbWwW/hLBFSTZ2TBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:47:27.236070Z"},"content_sha256":"8f153249b68adfcddbfda8fb06ec59b355d92a556d2724b3da7ec16d38ee7aec","schema_version":"1.0","event_id":"sha256:8f153249b68adfcddbfda8fb06ec59b355d92a556d2724b3da7ec16d38ee7aec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:N6LNCUYEWMOKROLXH3VZMCQP7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Binary Trees for Approximate Nearest Neighbour Search in Binary Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Michal Komorowski, Tomasz Trzcinski","submitted_at":"2017-08-09T19:16:01Z","abstract_excerpt":"Approximate nearest neighbour (ANN) search is one of the most important problems in computer science fields such as data mining or computer vision. In this paper, we focus on ANN for high-dimensional binary vectors and we propose a simple yet powerful search method that uses Random Binary Search Trees (RBST). We apply our method to a dataset of 1.25M binary local feature descriptors obtained from a real-life image-based localisation system provided by Google as a part of Project Tango. An extensive evaluation of our method against the state-of-the-art variations of Locality Sensitive Hashing ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02976","kind":"arxiv","version":2},"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-17T23:50:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VrzEodS7cxejRJCp9WTS4CRaMnnxnlFtsv1CJ0jcgD3ti+XL6r6LOPDmJtFIzSzKSog1PSMb8g9npO1BDyYKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:47:27.236698Z"},"content_sha256":"f5295c55f0cf75fb7982a78fb6f77e003b5d280e8a2bd9d2adf326fd54e808d0","schema_version":"1.0","event_id":"sha256:f5295c55f0cf75fb7982a78fb6f77e003b5d280e8a2bd9d2adf326fd54e808d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N6LNCUYEWMOKROLXH3VZMCQP7I/bundle.json","state_url":"https://pith.science/pith/N6LNCUYEWMOKROLXH3VZMCQP7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N6LNCUYEWMOKROLXH3VZMCQP7I/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-05-27T00:47:27Z","links":{"resolver":"https://pith.science/pith/N6LNCUYEWMOKROLXH3VZMCQP7I","bundle":"https://pith.science/pith/N6LNCUYEWMOKROLXH3VZMCQP7I/bundle.json","state":"https://pith.science/pith/N6LNCUYEWMOKROLXH3VZMCQP7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N6LNCUYEWMOKROLXH3VZMCQP7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N6LNCUYEWMOKROLXH3VZMCQP7I","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":"9b6923d308a7ab1f15cc990eb504f08a40c253b028c326e1d1a027f3b27f4c82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-08-09T19:16:01Z","title_canon_sha256":"93365dd7c2119a0c0598f9737b3ba83fb5a644cfdedd0367fa21c6afb159de0b"},"schema_version":"1.0","source":{"id":"1708.02976","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.02976","created_at":"2026-05-17T23:50:38Z"},{"alias_kind":"arxiv_version","alias_value":"1708.02976v2","created_at":"2026-05-17T23:50:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.02976","created_at":"2026-05-17T23:50:38Z"},{"alias_kind":"pith_short_12","alias_value":"N6LNCUYEWMOK","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N6LNCUYEWMOKROLX","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N6LNCUYE","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:f5295c55f0cf75fb7982a78fb6f77e003b5d280e8a2bd9d2adf326fd54e808d0","target":"graph","created_at":"2026-05-17T23:50:38Z","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":"Approximate nearest neighbour (ANN) search is one of the most important problems in computer science fields such as data mining or computer vision. In this paper, we focus on ANN for high-dimensional binary vectors and we propose a simple yet powerful search method that uses Random Binary Search Trees (RBST). We apply our method to a dataset of 1.25M binary local feature descriptors obtained from a real-life image-based localisation system provided by Google as a part of Project Tango. An extensive evaluation of our method against the state-of-the-art variations of Locality Sensitive Hashing (","authors_text":"Michal Komorowski, Tomasz Trzcinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-08-09T19:16:01Z","title":"Random Binary Trees for Approximate Nearest Neighbour Search in Binary Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.02976","kind":"arxiv","version":2},"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:8f153249b68adfcddbfda8fb06ec59b355d92a556d2724b3da7ec16d38ee7aec","target":"record","created_at":"2026-05-17T23:50:38Z","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":"9b6923d308a7ab1f15cc990eb504f08a40c253b028c326e1d1a027f3b27f4c82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-08-09T19:16:01Z","title_canon_sha256":"93365dd7c2119a0c0598f9737b3ba83fb5a644cfdedd0367fa21c6afb159de0b"},"schema_version":"1.0","source":{"id":"1708.02976","kind":"arxiv","version":2}},"canonical_sha256":"6f96d15304b31ca8b9773eeb960a0ffa08abda4f238d66ab17623f8363c29ee6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f96d15304b31ca8b9773eeb960a0ffa08abda4f238d66ab17623f8363c29ee6","first_computed_at":"2026-05-17T23:50:38.889187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:38.889187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dA5HG76FAC1oASFpeFpc5eIR0lH0tjGVn2GjIiMfshtgr/mRPI8/cKxbJa5w1HIEIg2vJCEhmGgi8DZhSh4HCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:38.889673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.02976","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f153249b68adfcddbfda8fb06ec59b355d92a556d2724b3da7ec16d38ee7aec","sha256:f5295c55f0cf75fb7982a78fb6f77e003b5d280e8a2bd9d2adf326fd54e808d0"],"state_sha256":"0d0b19ca9268b5ef8a5785292e205d49b7612f459f1be3657bd6280a6f8ba6e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y52WquHWKX/13eCWb2EbL0hFF6CaHh/hEV4NcpBrQoZMaJxpWnUmMWc1A/ieuwSCbJoXU46d5a1MjsOjCZmyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:47:27.243727Z","bundle_sha256":"41bc6966e2a38db225b4f7ddd9be280f19286d01c6cd2b0918638d05848cd125"}}