{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XZ4CPUL2L6JMVT5HNRCLK2ZSQU","short_pith_number":"pith:XZ4CPUL2","canonical_record":{"source":{"id":"1612.07545","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-22T11:17:55Z","cross_cats_sorted":[],"title_canon_sha256":"34300cd5ae9ccccfa6155d2efc808d0e7c4ce323361b85431a78d7936595c2a4","abstract_canon_sha256":"f0217da64fa23a92042c181f661ada4135fad7fe52790b73777a7d35500a0cc7"},"schema_version":"1.0"},"canonical_sha256":"be7827d17a5f92cacfa76c44b56b3285287a94c561e14827b08b2f5be86216c3","source":{"kind":"arxiv","id":"1612.07545","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07545","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07545v6","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07545","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"pith_short_12","alias_value":"XZ4CPUL2L6JM","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XZ4CPUL2L6JMVT5H","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XZ4CPUL2","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XZ4CPUL2L6JMVT5HNRCLK2ZSQU","target":"record","payload":{"canonical_record":{"source":{"id":"1612.07545","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-22T11:17:55Z","cross_cats_sorted":[],"title_canon_sha256":"34300cd5ae9ccccfa6155d2efc808d0e7c4ce323361b85431a78d7936595c2a4","abstract_canon_sha256":"f0217da64fa23a92042c181f661ada4135fad7fe52790b73777a7d35500a0cc7"},"schema_version":"1.0"},"canonical_sha256":"be7827d17a5f92cacfa76c44b56b3285287a94c561e14827b08b2f5be86216c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:59.234566Z","signature_b64":"E63X8zuD3HqxG/ArU1KLLNvdhp/Sl6bHLPA5u57bg4EFyVrW0Ee1g8Ek2blAtov05MHU6WteFKV+Ipel9ytGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be7827d17a5f92cacfa76c44b56b3285287a94c561e14827b08b2f5be86216c3","last_reissued_at":"2026-05-17T23:42:59.234168Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:59.234168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.07545","source_version":6,"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:42:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eFgANTD/Jw1AjLaGappQzR2XbX+Q6odplLtjAMNQ4R/7WZKxWiSPcHR90A9qR9p8UCUbXuG2i+JzDSQVD/zCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T20:06:24.447556Z"},"content_sha256":"4d677ebaa33784df63aa6b7491bc7efc9192ddcdd9b519892a2c5b7cd8a2b6a2","schema_version":"1.0","event_id":"sha256:4d677ebaa33784df63aa6b7491bc7efc9192ddcdd9b519892a2c5b7cd8a2b6a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XZ4CPUL2L6JMVT5HNRCLK2ZSQU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Revisit of Hashing Algorithms for Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Deng Cai","submitted_at":"2016-12-22T11:17:55Z","abstract_excerpt":"Approximate Nearest Neighbor Search (ANNS) is a fundamental problem in many areas of machine learning and data mining. During the past decade, numerous hashing algorithms are proposed to solve this problem. Every proposed algorithm claims outperform other state-of-the-art hashing methods. However, the evaluation of these hashing papers was not thorough enough, and those claims should be re-examined. The ultimate goal of an ANNS method is returning the most accurate answers (nearest neighbors) in the shortest time. If implemented correctly, almost all the hashing methods will have their perform"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07545","kind":"arxiv","version":6},"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:42:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OVrHhu1zvbFAqf5T8T0gI7AjNHtTw1AZlTGFu9vpZ9JhY9PmOIWl+6+MN+FrJ7OjJNvH28Uv/UYjLALohIuQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T20:06:24.447905Z"},"content_sha256":"c202e1823988193666c6de4ecc58b74b45d75320ff1fcdce6d341cda81c9d0f5","schema_version":"1.0","event_id":"sha256:c202e1823988193666c6de4ecc58b74b45d75320ff1fcdce6d341cda81c9d0f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZ4CPUL2L6JMVT5HNRCLK2ZSQU/bundle.json","state_url":"https://pith.science/pith/XZ4CPUL2L6JMVT5HNRCLK2ZSQU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZ4CPUL2L6JMVT5HNRCLK2ZSQU/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-20T20:06:24Z","links":{"resolver":"https://pith.science/pith/XZ4CPUL2L6JMVT5HNRCLK2ZSQU","bundle":"https://pith.science/pith/XZ4CPUL2L6JMVT5HNRCLK2ZSQU/bundle.json","state":"https://pith.science/pith/XZ4CPUL2L6JMVT5HNRCLK2ZSQU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZ4CPUL2L6JMVT5HNRCLK2ZSQU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XZ4CPUL2L6JMVT5HNRCLK2ZSQU","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":"f0217da64fa23a92042c181f661ada4135fad7fe52790b73777a7d35500a0cc7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-22T11:17:55Z","title_canon_sha256":"34300cd5ae9ccccfa6155d2efc808d0e7c4ce323361b85431a78d7936595c2a4"},"schema_version":"1.0","source":{"id":"1612.07545","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07545","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07545v6","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07545","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"pith_short_12","alias_value":"XZ4CPUL2L6JM","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XZ4CPUL2L6JMVT5H","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XZ4CPUL2","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:c202e1823988193666c6de4ecc58b74b45d75320ff1fcdce6d341cda81c9d0f5","target":"graph","created_at":"2026-05-17T23:42:59Z","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 Neighbor Search (ANNS) is a fundamental problem in many areas of machine learning and data mining. During the past decade, numerous hashing algorithms are proposed to solve this problem. Every proposed algorithm claims outperform other state-of-the-art hashing methods. However, the evaluation of these hashing papers was not thorough enough, and those claims should be re-examined. The ultimate goal of an ANNS method is returning the most accurate answers (nearest neighbors) in the shortest time. If implemented correctly, almost all the hashing methods will have their perform","authors_text":"Deng Cai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-22T11:17:55Z","title":"A Revisit of Hashing Algorithms for Approximate Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07545","kind":"arxiv","version":6},"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:4d677ebaa33784df63aa6b7491bc7efc9192ddcdd9b519892a2c5b7cd8a2b6a2","target":"record","created_at":"2026-05-17T23:42:59Z","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":"f0217da64fa23a92042c181f661ada4135fad7fe52790b73777a7d35500a0cc7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-22T11:17:55Z","title_canon_sha256":"34300cd5ae9ccccfa6155d2efc808d0e7c4ce323361b85431a78d7936595c2a4"},"schema_version":"1.0","source":{"id":"1612.07545","kind":"arxiv","version":6}},"canonical_sha256":"be7827d17a5f92cacfa76c44b56b3285287a94c561e14827b08b2f5be86216c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be7827d17a5f92cacfa76c44b56b3285287a94c561e14827b08b2f5be86216c3","first_computed_at":"2026-05-17T23:42:59.234168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:59.234168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E63X8zuD3HqxG/ArU1KLLNvdhp/Sl6bHLPA5u57bg4EFyVrW0Ee1g8Ek2blAtov05MHU6WteFKV+Ipel9ytGCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:59.234566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.07545","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d677ebaa33784df63aa6b7491bc7efc9192ddcdd9b519892a2c5b7cd8a2b6a2","sha256:c202e1823988193666c6de4ecc58b74b45d75320ff1fcdce6d341cda81c9d0f5"],"state_sha256":"340c31e26ba5f0b0d46dfc98df7b0dfa92140c8365e1e9a2d63c62cd6b72b4b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EUwuYHepZPAtTjS3MYOeBfsdE+WfVPP53SNrSyY0EKIrFO/A4NesU4eoE6X1jXT1KW0gdNdQE4H8TPu5hNCeDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T20:06:24.450042Z","bundle_sha256":"82d96d0efa9cb1b33619120f35a4d00823d47666e691a17fd4446a5f11ce0c9f"}}