{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IM7623H3TXERW5CPJWKELZTDVO","short_pith_number":"pith:IM7623H3","canonical_record":{"source":{"id":"1605.05944","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-19T13:31:36Z","cross_cats_sorted":["cs.CG","cs.IR"],"title_canon_sha256":"d5a01ba7ea5f06a430621515ed4145e532fe44eabe7fb568e9f31b6af9a3b283","abstract_canon_sha256":"cca35133d99cbb8e3da7ad2ed4fd187bc15c6b9f77b4178f3b705c4dcfe0a411"},"schema_version":"1.0"},"canonical_sha256":"433fed6cfb9dc91b744f4d9445e663ab8bbd9355a2c451be5e52de0cb06a0a49","source":{"kind":"arxiv","id":"1605.05944","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05944","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05944v2","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05944","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"pith_short_12","alias_value":"IM7623H3TXER","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IM7623H3TXERW5CP","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IM7623H3","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IM7623H3TXERW5CPJWKELZTDVO","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05944","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-19T13:31:36Z","cross_cats_sorted":["cs.CG","cs.IR"],"title_canon_sha256":"d5a01ba7ea5f06a430621515ed4145e532fe44eabe7fb568e9f31b6af9a3b283","abstract_canon_sha256":"cca35133d99cbb8e3da7ad2ed4fd187bc15c6b9f77b4178f3b705c4dcfe0a411"},"schema_version":"1.0"},"canonical_sha256":"433fed6cfb9dc91b744f4d9445e663ab8bbd9355a2c451be5e52de0cb06a0a49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:20.093838Z","signature_b64":"PFr64RHS9ee+eFjGq2uphD/2gmwvQxKVstyi/0ZoEl4mRhcaEAehJtBWrsxc+ejLt32X85YzpJSFX07Rz3HcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"433fed6cfb9dc91b744f4d9445e663ab8bbd9355a2c451be5e52de0cb06a0a49","last_reissued_at":"2026-05-18T01:14:20.093135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:20.093135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05944","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-18T01:14:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krj461dIcG1dxmf6st0kvSgAeIJkJ19H52zSh9IXwsWooqPavzcJopewnZJJcFHokuULlMPwH63rCQyuaeCZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:11:34.805864Z"},"content_sha256":"4a85c0ad664cee5075d11213b49cdef74f27860d051ae66eaf1d776c9a76041d","schema_version":"1.0","event_id":"sha256:4a85c0ad664cee5075d11213b49cdef74f27860d051ae66eaf1d776c9a76041d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IM7623H3TXERW5CPJWKELZTDVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometric Near-neighbor Access Tree (GNAT) revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.IR"],"primary_cat":"cs.DS","authors_text":"Kimmo Fredriksson","submitted_at":"2016-05-19T13:31:36Z","abstract_excerpt":"Geometric Near-neighbor Access Tree (GNAT) is a metric space indexing method based on hierarchical hyperplane partitioning of the space. While GNAT is very efficient in proximity searching, it has a bad reputation of being a memory hog. We show that this is partially based on too coarse analysis, and that the memory requirements can be lowered while at the same time improving the search efficiency. We also show how to make GNAT memory adaptive in a smooth way, and that the hyperplane partitioning can be replaced with ball partitioning, which can further improve the search performance. We concl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05944","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-18T01:14:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o10KJLsqxy+9LA6KpgSSfnAgaR9KwMMGKzcmJYOT3yLEZGBCRP4XGnTc0YrA1dB5VLVEikDNDU/Td8rPr42pBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:11:34.806226Z"},"content_sha256":"3b487ef504935302fab066c7ebfe434cb008fcfaed30bee81615fb98309427ed","schema_version":"1.0","event_id":"sha256:3b487ef504935302fab066c7ebfe434cb008fcfaed30bee81615fb98309427ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IM7623H3TXERW5CPJWKELZTDVO/bundle.json","state_url":"https://pith.science/pith/IM7623H3TXERW5CPJWKELZTDVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IM7623H3TXERW5CPJWKELZTDVO/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-21T14:11:34Z","links":{"resolver":"https://pith.science/pith/IM7623H3TXERW5CPJWKELZTDVO","bundle":"https://pith.science/pith/IM7623H3TXERW5CPJWKELZTDVO/bundle.json","state":"https://pith.science/pith/IM7623H3TXERW5CPJWKELZTDVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IM7623H3TXERW5CPJWKELZTDVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IM7623H3TXERW5CPJWKELZTDVO","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":"cca35133d99cbb8e3da7ad2ed4fd187bc15c6b9f77b4178f3b705c4dcfe0a411","cross_cats_sorted":["cs.CG","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-19T13:31:36Z","title_canon_sha256":"d5a01ba7ea5f06a430621515ed4145e532fe44eabe7fb568e9f31b6af9a3b283"},"schema_version":"1.0","source":{"id":"1605.05944","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05944","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05944v2","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05944","created_at":"2026-05-18T01:14:20Z"},{"alias_kind":"pith_short_12","alias_value":"IM7623H3TXER","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IM7623H3TXERW5CP","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IM7623H3","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:3b487ef504935302fab066c7ebfe434cb008fcfaed30bee81615fb98309427ed","target":"graph","created_at":"2026-05-18T01:14:20Z","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":"Geometric Near-neighbor Access Tree (GNAT) is a metric space indexing method based on hierarchical hyperplane partitioning of the space. While GNAT is very efficient in proximity searching, it has a bad reputation of being a memory hog. We show that this is partially based on too coarse analysis, and that the memory requirements can be lowered while at the same time improving the search efficiency. We also show how to make GNAT memory adaptive in a smooth way, and that the hyperplane partitioning can be replaced with ball partitioning, which can further improve the search performance. We concl","authors_text":"Kimmo Fredriksson","cross_cats":["cs.CG","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-19T13:31:36Z","title":"Geometric Near-neighbor Access Tree (GNAT) revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05944","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:4a85c0ad664cee5075d11213b49cdef74f27860d051ae66eaf1d776c9a76041d","target":"record","created_at":"2026-05-18T01:14:20Z","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":"cca35133d99cbb8e3da7ad2ed4fd187bc15c6b9f77b4178f3b705c4dcfe0a411","cross_cats_sorted":["cs.CG","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-19T13:31:36Z","title_canon_sha256":"d5a01ba7ea5f06a430621515ed4145e532fe44eabe7fb568e9f31b6af9a3b283"},"schema_version":"1.0","source":{"id":"1605.05944","kind":"arxiv","version":2}},"canonical_sha256":"433fed6cfb9dc91b744f4d9445e663ab8bbd9355a2c451be5e52de0cb06a0a49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"433fed6cfb9dc91b744f4d9445e663ab8bbd9355a2c451be5e52de0cb06a0a49","first_computed_at":"2026-05-18T01:14:20.093135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:20.093135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PFr64RHS9ee+eFjGq2uphD/2gmwvQxKVstyi/0ZoEl4mRhcaEAehJtBWrsxc+ejLt32X85YzpJSFX07Rz3HcDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:20.093838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05944","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a85c0ad664cee5075d11213b49cdef74f27860d051ae66eaf1d776c9a76041d","sha256:3b487ef504935302fab066c7ebfe434cb008fcfaed30bee81615fb98309427ed"],"state_sha256":"496658b96df3edb5490a72f27fad6aa74292438301720339ec7a1a25fe9213c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eMqdNvE87vg/DSw/Evn0IH9oPRHDpM4TO8JyNAnbarI6EjQoemIssDKvWqfyHUZfN8Tb8xjLHripsqR/x/VUBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T14:11:34.808220Z","bundle_sha256":"cae57b8577ab9a69275dd7a94d0106da5730727e2cb0c75303f30c467f7f8c01"}}