{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:B7VS3MLADILWX3EIJBGJBVA722","short_pith_number":"pith:B7VS3MLA","canonical_record":{"source":{"id":"1606.00185","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-01T09:23:48Z","cross_cats_sorted":[],"title_canon_sha256":"39dd9c53ad43d3785eed72ef36f7c1a493bde89e45f5a9d08c56d05aba1b0e58","abstract_canon_sha256":"46ed4b8cab9eba3935181fb9432108e748d6216db7f7a7fe4f0f1661fa0dd4b0"},"schema_version":"1.0"},"canonical_sha256":"0feb2db1601a176bec88484c90d41fd6b450ec226f3af5cd6895a044bdb82084","source":{"kind":"arxiv","id":"1606.00185","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00185","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00185v2","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00185","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"pith_short_12","alias_value":"B7VS3MLADILW","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B7VS3MLADILWX3EI","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B7VS3MLA","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:B7VS3MLADILWX3EIJBGJBVA722","target":"record","payload":{"canonical_record":{"source":{"id":"1606.00185","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-01T09:23:48Z","cross_cats_sorted":[],"title_canon_sha256":"39dd9c53ad43d3785eed72ef36f7c1a493bde89e45f5a9d08c56d05aba1b0e58","abstract_canon_sha256":"46ed4b8cab9eba3935181fb9432108e748d6216db7f7a7fe4f0f1661fa0dd4b0"},"schema_version":"1.0"},"canonical_sha256":"0feb2db1601a176bec88484c90d41fd6b450ec226f3af5cd6895a044bdb82084","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:58.785371Z","signature_b64":"w/pOmx9noOhPPF5M59raRM6BPy1AHYFHPtqZQBPtdeKbgams4b1lQNvM8hq4+hxZAqm+wC4/WkeZrncFL/XBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0feb2db1601a176bec88484c90d41fd6b450ec226f3af5cd6895a044bdb82084","last_reissued_at":"2026-05-18T00:45:58.784899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:58.784899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.00185","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-18T00:45:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XDfWhrUQtn9mdvjG2FqpEw/0peSpIo8PgT8hpQC/r52bCE74jAkyJvmDSo+aEvWW5NsDHcd2CNHNUlRRgHpiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:33:36.227863Z"},"content_sha256":"440772dc84ba288e8e382687953b5c5a121dd32ab78c17c5e373800cf5db09ec","schema_version":"1.0","event_id":"sha256:440772dc84ba288e8e382687953b5c5a121dd32ab78c17c5e373800cf5db09ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:B7VS3MLADILWX3EIJBGJBVA722","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Survey on Learning to Hash","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Heng Tao Shen, Jingdong Wang, Jingkuan Song, Nicu Sebe, Ting Zhang","submitted_at":"2016-06-01T09:23:48Z","abstract_excerpt":"Nearest neighbor search is a problem of finding the data points from the database such that the distances from them to the query point are the smallest. Learning to hash is one of the major solutions to this problem and has been widely studied recently. In this paper, we present a comprehensive survey of the learning to hash algorithms, categorize them according to the manners of preserving the similarities into: pairwise similarity preserving, multiwise similarity preserving, implicit similarity preserving, as well as quantization, and discuss their relations. We separate quantization from pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00185","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-18T00:45:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gAAbp78rCaqVxarEnclUJs0jg1Os0CKEPf7mL+b/i2YBXVpjDF0wY5jE16ozMCktjsxAdvpdefFj9tK9hgdgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:33:36.228569Z"},"content_sha256":"786f1a31cd893a66720dd4466413755ad713ac509de5dbd2b0c19f96a356597c","schema_version":"1.0","event_id":"sha256:786f1a31cd893a66720dd4466413755ad713ac509de5dbd2b0c19f96a356597c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7VS3MLADILWX3EIJBGJBVA722/bundle.json","state_url":"https://pith.science/pith/B7VS3MLADILWX3EIJBGJBVA722/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7VS3MLADILWX3EIJBGJBVA722/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-30T20:33:36Z","links":{"resolver":"https://pith.science/pith/B7VS3MLADILWX3EIJBGJBVA722","bundle":"https://pith.science/pith/B7VS3MLADILWX3EIJBGJBVA722/bundle.json","state":"https://pith.science/pith/B7VS3MLADILWX3EIJBGJBVA722/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7VS3MLADILWX3EIJBGJBVA722/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:B7VS3MLADILWX3EIJBGJBVA722","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":"46ed4b8cab9eba3935181fb9432108e748d6216db7f7a7fe4f0f1661fa0dd4b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-01T09:23:48Z","title_canon_sha256":"39dd9c53ad43d3785eed72ef36f7c1a493bde89e45f5a9d08c56d05aba1b0e58"},"schema_version":"1.0","source":{"id":"1606.00185","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00185","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00185v2","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00185","created_at":"2026-05-18T00:45:58Z"},{"alias_kind":"pith_short_12","alias_value":"B7VS3MLADILW","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B7VS3MLADILWX3EI","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B7VS3MLA","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:786f1a31cd893a66720dd4466413755ad713ac509de5dbd2b0c19f96a356597c","target":"graph","created_at":"2026-05-18T00:45: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":"Nearest neighbor search is a problem of finding the data points from the database such that the distances from them to the query point are the smallest. Learning to hash is one of the major solutions to this problem and has been widely studied recently. In this paper, we present a comprehensive survey of the learning to hash algorithms, categorize them according to the manners of preserving the similarities into: pairwise similarity preserving, multiwise similarity preserving, implicit similarity preserving, as well as quantization, and discuss their relations. We separate quantization from pa","authors_text":"Heng Tao Shen, Jingdong Wang, Jingkuan Song, Nicu Sebe, Ting Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-01T09:23:48Z","title":"A Survey on Learning to Hash"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00185","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:440772dc84ba288e8e382687953b5c5a121dd32ab78c17c5e373800cf5db09ec","target":"record","created_at":"2026-05-18T00:45: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":"46ed4b8cab9eba3935181fb9432108e748d6216db7f7a7fe4f0f1661fa0dd4b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-01T09:23:48Z","title_canon_sha256":"39dd9c53ad43d3785eed72ef36f7c1a493bde89e45f5a9d08c56d05aba1b0e58"},"schema_version":"1.0","source":{"id":"1606.00185","kind":"arxiv","version":2}},"canonical_sha256":"0feb2db1601a176bec88484c90d41fd6b450ec226f3af5cd6895a044bdb82084","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0feb2db1601a176bec88484c90d41fd6b450ec226f3af5cd6895a044bdb82084","first_computed_at":"2026-05-18T00:45:58.784899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:58.784899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w/pOmx9noOhPPF5M59raRM6BPy1AHYFHPtqZQBPtdeKbgams4b1lQNvM8hq4+hxZAqm+wC4/WkeZrncFL/XBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:58.785371Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00185","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:440772dc84ba288e8e382687953b5c5a121dd32ab78c17c5e373800cf5db09ec","sha256:786f1a31cd893a66720dd4466413755ad713ac509de5dbd2b0c19f96a356597c"],"state_sha256":"b3b087dbf412c697fb944da670a4a303a4f12b905f6e4e7bf3e04c13a8a7972b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SNxjmwQPUhAGeFSaNNIfO7CJhgmbW6/Vt9LnyumhVUvCtqVnfthvQP/iApvXLPMhbCtN7XMVCuWX3MlnULgDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:33:36.232207Z","bundle_sha256":"860087d72ca80c427cdef9fcabb0559ab1cda1e0238f709ba28dbd5fae958e51"}}