{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5ALN26H73EJM4WWBOHJZ56AJSP","short_pith_number":"pith:5ALN26H7","canonical_record":{"source":{"id":"1809.09776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-26T01:42:05Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"874e0f82fc4d4f106eec70f77ac6575f47ad5d907193ac39954809862419811d","abstract_canon_sha256":"69aa6318f4cabe6a8e1e5113076c0604101a01aad9289079c0e87b109488b964"},"schema_version":"1.0"},"canonical_sha256":"e816dd78ffd912ce5ac171d39ef80993fb7a2a96ba94abf06b7f1cf5bf210418","source":{"kind":"arxiv","id":"1809.09776","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09776","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09776v1","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09776","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"5ALN26H73EJM","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5ALN26H73EJM4WWB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5ALN26H7","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5ALN26H73EJM4WWBOHJZ56AJSP","target":"record","payload":{"canonical_record":{"source":{"id":"1809.09776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-26T01:42:05Z","cross_cats_sorted":["cs.CC","cs.CG"],"title_canon_sha256":"874e0f82fc4d4f106eec70f77ac6575f47ad5d907193ac39954809862419811d","abstract_canon_sha256":"69aa6318f4cabe6a8e1e5113076c0604101a01aad9289079c0e87b109488b964"},"schema_version":"1.0"},"canonical_sha256":"e816dd78ffd912ce5ac171d39ef80993fb7a2a96ba94abf06b7f1cf5bf210418","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:43.670340Z","signature_b64":"PF1G5FGYYwOmC09MO7VdLpO5B1QyM5PYihtnbzY7Xx356gGsGZfj5sg76lTHgMg6aTul0i8TPTeVuYqfS7zCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e816dd78ffd912ce5ac171d39ef80993fb7a2a96ba94abf06b7f1cf5bf210418","last_reissued_at":"2026-05-18T00:04:43.669604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:43.669604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.09776","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:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IhiObgfbEiGHtlEgQlxi3ZmimUZGGxOsFso7xXOkH+ca9/I76wxDCz2v9orxzYBpGJl6f9daY2C79X08cfDODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:30:00.586970Z"},"content_sha256":"fd7dd3207d5a240b9e5ae5aa7d84ef522772ce352329d1b98295babf453fb6d3","schema_version":"1.0","event_id":"sha256:fd7dd3207d5a240b9e5ae5aa7d84ef522772ce352329d1b98295babf453fb6d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5ALN26H73EJM4WWBOHJZ56AJSP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(logn) Query Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG"],"primary_cat":"cs.DS","authors_text":"Hengzhao Ma, Jianzhong Li","submitted_at":"2018-09-26T01:42:05Z","abstract_excerpt":"This paper proposes a new algorithm for reducing Approximate Nearest Neighbor problem to Approximate Near Neighbor problem. The advantage of this algorithm is that it achieves O(log n) query time. As a reduction problem, the uery time complexity is the times of invoking the algorithm for Approximate Near Neighbor problem. All former algorithms for the same reduction need polylog(n) query time. A box split method proposed by Vaidya is used in our paper to achieve the O(log n) query time complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09776","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:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btpe9O6y+BraQ3lxCz8eJVRSxvqqCFCHYCX3fsI9WAAOVt3PJcL6JaWARHkYVwWZ227Dm2gH+AF3Dc0wx61LCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:30:00.587684Z"},"content_sha256":"9ef1b822f77925bc1d00b46d88866b75e7f346c7045b3748fd183a33720a74a0","schema_version":"1.0","event_id":"sha256:9ef1b822f77925bc1d00b46d88866b75e7f346c7045b3748fd183a33720a74a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ALN26H73EJM4WWBOHJZ56AJSP/bundle.json","state_url":"https://pith.science/pith/5ALN26H73EJM4WWBOHJZ56AJSP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ALN26H73EJM4WWBOHJZ56AJSP/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-25T22:30:00Z","links":{"resolver":"https://pith.science/pith/5ALN26H73EJM4WWBOHJZ56AJSP","bundle":"https://pith.science/pith/5ALN26H73EJM4WWBOHJZ56AJSP/bundle.json","state":"https://pith.science/pith/5ALN26H73EJM4WWBOHJZ56AJSP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ALN26H73EJM4WWBOHJZ56AJSP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5ALN26H73EJM4WWBOHJZ56AJSP","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":"69aa6318f4cabe6a8e1e5113076c0604101a01aad9289079c0e87b109488b964","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-26T01:42:05Z","title_canon_sha256":"874e0f82fc4d4f106eec70f77ac6575f47ad5d907193ac39954809862419811d"},"schema_version":"1.0","source":{"id":"1809.09776","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09776","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09776v1","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09776","created_at":"2026-05-18T00:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"5ALN26H73EJM","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5ALN26H73EJM4WWB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5ALN26H7","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:9ef1b822f77925bc1d00b46d88866b75e7f346c7045b3748fd183a33720a74a0","target":"graph","created_at":"2026-05-18T00:04:43Z","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":"This paper proposes a new algorithm for reducing Approximate Nearest Neighbor problem to Approximate Near Neighbor problem. The advantage of this algorithm is that it achieves O(log n) query time. As a reduction problem, the uery time complexity is the times of invoking the algorithm for Approximate Near Neighbor problem. All former algorithms for the same reduction need polylog(n) query time. A box split method proposed by Vaidya is used in our paper to achieve the O(log n) query time complexity.","authors_text":"Hengzhao Ma, Jianzhong Li","cross_cats":["cs.CC","cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-26T01:42:05Z","title":"An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(logn) Query Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09776","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:fd7dd3207d5a240b9e5ae5aa7d84ef522772ce352329d1b98295babf453fb6d3","target":"record","created_at":"2026-05-18T00:04:43Z","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":"69aa6318f4cabe6a8e1e5113076c0604101a01aad9289079c0e87b109488b964","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-26T01:42:05Z","title_canon_sha256":"874e0f82fc4d4f106eec70f77ac6575f47ad5d907193ac39954809862419811d"},"schema_version":"1.0","source":{"id":"1809.09776","kind":"arxiv","version":1}},"canonical_sha256":"e816dd78ffd912ce5ac171d39ef80993fb7a2a96ba94abf06b7f1cf5bf210418","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e816dd78ffd912ce5ac171d39ef80993fb7a2a96ba94abf06b7f1cf5bf210418","first_computed_at":"2026-05-18T00:04:43.669604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:43.669604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PF1G5FGYYwOmC09MO7VdLpO5B1QyM5PYihtnbzY7Xx356gGsGZfj5sg76lTHgMg6aTul0i8TPTeVuYqfS7zCBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:43.670340Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09776","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd7dd3207d5a240b9e5ae5aa7d84ef522772ce352329d1b98295babf453fb6d3","sha256:9ef1b822f77925bc1d00b46d88866b75e7f346c7045b3748fd183a33720a74a0"],"state_sha256":"287520dc6e16f218360ee97dec751100214e05b5b07744420f50d356c0d98ac8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qwAZE7y9K1kzV/XjKigxl8hnqEALLf5t17ea2qWBtF9yJM5wP82+enNq8khQFAv4yHeNbZKkM+jI8wcRifRAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:30:00.591518Z","bundle_sha256":"bee67e0271f859cb3ecec45fd20ccd2bcadd7b3d88f84a155dcffdbd8623d884"}}