{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6W5LEZ4PBUCXHTCZ6HTTASAF3E","short_pith_number":"pith:6W5LEZ4P","canonical_record":{"source":{"id":"1603.09596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-31T14:04:30Z","cross_cats_sorted":[],"title_canon_sha256":"aea3b5f66d3cd8e92d400c573c0380a4364ff0a25089bd5985f2f48ae41904ce","abstract_canon_sha256":"a3b1c72985256cc4f636ae6405a66c2f8b0e94a671409c730d47bb97c5bec950"},"schema_version":"1.0"},"canonical_sha256":"f5bab2678f0d0573cc59f1e7304805d92a5feb08ea6c22beed1e5a42e29a23d0","source":{"kind":"arxiv","id":"1603.09596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09596","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09596v1","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09596","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"6W5LEZ4PBUCX","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6W5LEZ4PBUCXHTCZ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6W5LEZ4P","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6W5LEZ4PBUCXHTCZ6HTTASAF3E","target":"record","payload":{"canonical_record":{"source":{"id":"1603.09596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-31T14:04:30Z","cross_cats_sorted":[],"title_canon_sha256":"aea3b5f66d3cd8e92d400c573c0380a4364ff0a25089bd5985f2f48ae41904ce","abstract_canon_sha256":"a3b1c72985256cc4f636ae6405a66c2f8b0e94a671409c730d47bb97c5bec950"},"schema_version":"1.0"},"canonical_sha256":"f5bab2678f0d0573cc59f1e7304805d92a5feb08ea6c22beed1e5a42e29a23d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:58.090168Z","signature_b64":"Ms08gBt++IZwehF2oxcXHbFAYWJ2aqdcIwe25ovy8webLDnjIrt0kU5C5wwCVd1zuWRlhXSaCta2L17eEDfLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5bab2678f0d0573cc59f1e7304805d92a5feb08ea6c22beed1e5a42e29a23d0","last_reissued_at":"2026-05-18T01:17:58.089506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:58.089506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.09596","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-18T01:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wj0ZAYQzibBGqv0DajgXXD5PrRBxSqATCcDkASEGVJtpflff3m8Kn+AB/xLGSJSH8nbrJ4WPszDXVcCa2L0nBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:04:08.971681Z"},"content_sha256":"35b547655f6fd81c0ecc54acb8cf401777da39ee59d428871401f2604d0ca3b3","schema_version":"1.0","event_id":"sha256:35b547655f6fd81c0ecc54acb8cf401777da39ee59d428871401f2604d0ca3b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6W5LEZ4PBUCXHTCZ6HTTASAF3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-dimensional approximate nearest neighbor: k-d Generalized Randomized Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Georgios Samaras, Ioannis Z. Emiris, Yannis Avrithis","submitted_at":"2016-03-31T14:04:30Z","abstract_excerpt":"We propose a new data-structure, the generalized randomized kd forest, or kgeraf, for approximate nearest neighbor searching in high dimensions. In particular, we introduce new randomization techniques to specify a set of independently constructed trees where search is performed simultaneously, hence increasing accuracy. We omit backtracking, and we optimize distance computations, thus accelerating queries. We release public domain software geraf and we compare it to existing implementations of state-of-the-art methods including BBD-trees, Locality Sensitive Hashing, randomized kd forests, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09596","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-18T01:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"slc05X4w9kNOWS7pRyQ7JGfOJBwPCYlpzqmWmnfUCbvvTYRABPi3WFfvAOompEfTkQp9Fgipvrq+Dxfg6vaYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:04:08.972392Z"},"content_sha256":"ce2585583cb013bb2c218adfc4ade50b463a791b1445096339fbb9d9c1dc4a02","schema_version":"1.0","event_id":"sha256:ce2585583cb013bb2c218adfc4ade50b463a791b1445096339fbb9d9c1dc4a02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6W5LEZ4PBUCXHTCZ6HTTASAF3E/bundle.json","state_url":"https://pith.science/pith/6W5LEZ4PBUCXHTCZ6HTTASAF3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6W5LEZ4PBUCXHTCZ6HTTASAF3E/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-09T06:04:08Z","links":{"resolver":"https://pith.science/pith/6W5LEZ4PBUCXHTCZ6HTTASAF3E","bundle":"https://pith.science/pith/6W5LEZ4PBUCXHTCZ6HTTASAF3E/bundle.json","state":"https://pith.science/pith/6W5LEZ4PBUCXHTCZ6HTTASAF3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6W5LEZ4PBUCXHTCZ6HTTASAF3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6W5LEZ4PBUCXHTCZ6HTTASAF3E","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":"a3b1c72985256cc4f636ae6405a66c2f8b0e94a671409c730d47bb97c5bec950","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-31T14:04:30Z","title_canon_sha256":"aea3b5f66d3cd8e92d400c573c0380a4364ff0a25089bd5985f2f48ae41904ce"},"schema_version":"1.0","source":{"id":"1603.09596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09596","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09596v1","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09596","created_at":"2026-05-18T01:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"6W5LEZ4PBUCX","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6W5LEZ4PBUCXHTCZ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6W5LEZ4P","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:ce2585583cb013bb2c218adfc4ade50b463a791b1445096339fbb9d9c1dc4a02","target":"graph","created_at":"2026-05-18T01:17:58Z","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 propose a new data-structure, the generalized randomized kd forest, or kgeraf, for approximate nearest neighbor searching in high dimensions. In particular, we introduce new randomization techniques to specify a set of independently constructed trees where search is performed simultaneously, hence increasing accuracy. We omit backtracking, and we optimize distance computations, thus accelerating queries. We release public domain software geraf and we compare it to existing implementations of state-of-the-art methods including BBD-trees, Locality Sensitive Hashing, randomized kd forests, and","authors_text":"Georgios Samaras, Ioannis Z. Emiris, Yannis Avrithis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-31T14:04:30Z","title":"High-dimensional approximate nearest neighbor: k-d Generalized Randomized Forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09596","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:35b547655f6fd81c0ecc54acb8cf401777da39ee59d428871401f2604d0ca3b3","target":"record","created_at":"2026-05-18T01:17:58Z","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":"a3b1c72985256cc4f636ae6405a66c2f8b0e94a671409c730d47bb97c5bec950","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-31T14:04:30Z","title_canon_sha256":"aea3b5f66d3cd8e92d400c573c0380a4364ff0a25089bd5985f2f48ae41904ce"},"schema_version":"1.0","source":{"id":"1603.09596","kind":"arxiv","version":1}},"canonical_sha256":"f5bab2678f0d0573cc59f1e7304805d92a5feb08ea6c22beed1e5a42e29a23d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5bab2678f0d0573cc59f1e7304805d92a5feb08ea6c22beed1e5a42e29a23d0","first_computed_at":"2026-05-18T01:17:58.089506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:58.089506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ms08gBt++IZwehF2oxcXHbFAYWJ2aqdcIwe25ovy8webLDnjIrt0kU5C5wwCVd1zuWRlhXSaCta2L17eEDfLAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:58.090168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.09596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35b547655f6fd81c0ecc54acb8cf401777da39ee59d428871401f2604d0ca3b3","sha256:ce2585583cb013bb2c218adfc4ade50b463a791b1445096339fbb9d9c1dc4a02"],"state_sha256":"53a54eb2fd7d893b4f96ba7ed7a0f0c4ae2c28a0e1d705b2dc7a9ef1f061133b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bAZa14h49rL24Vbh25mnrf1Os0hex8h0C/RCEGCWXk2JoZHOhSB/IgDkX848E8XdlXApkVRciJF0xxpHPE8RDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:04:08.976382Z","bundle_sha256":"addc2bd3ee9aaa87c6dc8509fd4726e2ffae477f94dc3fcfc22265d715ee2d60"}}