{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VRXRQ7RKSZVDLEBZ44TBFYHK42","short_pith_number":"pith:VRXRQ7RK","canonical_record":{"source":{"id":"1602.00206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-31T06:36:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4ed9f06b192ec6398166d2f1abce665bd65f086f1f2631dcfdce47e0de99df76","abstract_canon_sha256":"6ed0575f2bf78067d6168cd1e3cc1eeb85693141c806b349a19b08bd049d45f2"},"schema_version":"1.0"},"canonical_sha256":"ac6f187e2a966a359039e72612e0eae695daba6a1c9bad3865d829ad67c76ad0","source":{"kind":"arxiv","id":"1602.00206","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00206","created_at":"2026-05-18T00:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00206v1","created_at":"2026-05-18T00:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00206","created_at":"2026-05-18T00:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"VRXRQ7RKSZVD","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VRXRQ7RKSZVDLEBZ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VRXRQ7RK","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VRXRQ7RKSZVDLEBZ44TBFYHK42","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-31T06:36:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4ed9f06b192ec6398166d2f1abce665bd65f086f1f2631dcfdce47e0de99df76","abstract_canon_sha256":"6ed0575f2bf78067d6168cd1e3cc1eeb85693141c806b349a19b08bd049d45f2"},"schema_version":"1.0"},"canonical_sha256":"ac6f187e2a966a359039e72612e0eae695daba6a1c9bad3865d829ad67c76ad0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:35.839188Z","signature_b64":"ZS/HnCsg5bpLwdkdufxHNcHUY9NAPIqoDf9OA2hgn45uzFB1AjOve3r8w474QAW1/s7+16LOVcNJ1vOD8EJ5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac6f187e2a966a359039e72612e0eae695daba6a1c9bad3865d829ad67c76ad0","last_reissued_at":"2026-05-18T00:17:35.838627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:35.838627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00206","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:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V7oOk8DIJLmp3lWvBo1v2+jYQ5ro8L6Rpy69qidyg1u87po/VHwR6N2Cn608JPYRvm2Bgp6SHJNon8dOwRQKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:52:54.987020Z"},"content_sha256":"83336e8c3dc69dcb725217785c78809d59b1b357315fb9c73ba610b31539eb84","schema_version":"1.0","event_id":"sha256:83336e8c3dc69dcb725217785c78809d59b1b357315fb9c73ba610b31539eb84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VRXRQ7RKSZVDLEBZ44TBFYHK42","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unsupervised Deep Hashing for Large-scale Visual Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Abdenour Hadid, Jinye Peng, Xiaoyi Feng, Zhaoqiang Xia","submitted_at":"2016-01-31T06:36:47Z","abstract_excerpt":"Learning based hashing plays a pivotal role in large-scale visual search. However, most existing hashing algorithms tend to learn shallow models that do not seek representative binary codes. In this paper, we propose a novel hashing approach based on unsupervised deep learning to hierarchically transform features into hash codes. Within the heterogeneous deep hashing framework, the autoencoder layers with specific constraints are considered to model the nonlinear mapping between features and binary codes. Then, a Restricted Boltzmann Machine (RBM) layer with constraints is utilized to reduce t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00206","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:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1tfLPNz/FFzva5/zBxafwVuSU7Abkek6iW1DcKtFmtc5QXnBQzEueqF8fzXlts33FJKb4QOz41RATzxLYD1PAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:52:54.987602Z"},"content_sha256":"50436b6134dd24e7f6e33afa0d54586256a882b59963f8dcfa61f98f06cc63b5","schema_version":"1.0","event_id":"sha256:50436b6134dd24e7f6e33afa0d54586256a882b59963f8dcfa61f98f06cc63b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VRXRQ7RKSZVDLEBZ44TBFYHK42/bundle.json","state_url":"https://pith.science/pith/VRXRQ7RKSZVDLEBZ44TBFYHK42/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VRXRQ7RKSZVDLEBZ44TBFYHK42/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-30T11:52:54Z","links":{"resolver":"https://pith.science/pith/VRXRQ7RKSZVDLEBZ44TBFYHK42","bundle":"https://pith.science/pith/VRXRQ7RKSZVDLEBZ44TBFYHK42/bundle.json","state":"https://pith.science/pith/VRXRQ7RKSZVDLEBZ44TBFYHK42/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VRXRQ7RKSZVDLEBZ44TBFYHK42/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VRXRQ7RKSZVDLEBZ44TBFYHK42","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":"6ed0575f2bf78067d6168cd1e3cc1eeb85693141c806b349a19b08bd049d45f2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-31T06:36:47Z","title_canon_sha256":"4ed9f06b192ec6398166d2f1abce665bd65f086f1f2631dcfdce47e0de99df76"},"schema_version":"1.0","source":{"id":"1602.00206","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00206","created_at":"2026-05-18T00:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00206v1","created_at":"2026-05-18T00:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00206","created_at":"2026-05-18T00:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"VRXRQ7RKSZVD","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VRXRQ7RKSZVDLEBZ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VRXRQ7RK","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:50436b6134dd24e7f6e33afa0d54586256a882b59963f8dcfa61f98f06cc63b5","target":"graph","created_at":"2026-05-18T00:17:35Z","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":"Learning based hashing plays a pivotal role in large-scale visual search. However, most existing hashing algorithms tend to learn shallow models that do not seek representative binary codes. In this paper, we propose a novel hashing approach based on unsupervised deep learning to hierarchically transform features into hash codes. Within the heterogeneous deep hashing framework, the autoencoder layers with specific constraints are considered to model the nonlinear mapping between features and binary codes. Then, a Restricted Boltzmann Machine (RBM) layer with constraints is utilized to reduce t","authors_text":"Abdenour Hadid, Jinye Peng, Xiaoyi Feng, Zhaoqiang Xia","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-31T06:36:47Z","title":"Unsupervised Deep Hashing for Large-scale Visual Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00206","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:83336e8c3dc69dcb725217785c78809d59b1b357315fb9c73ba610b31539eb84","target":"record","created_at":"2026-05-18T00:17:35Z","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":"6ed0575f2bf78067d6168cd1e3cc1eeb85693141c806b349a19b08bd049d45f2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-31T06:36:47Z","title_canon_sha256":"4ed9f06b192ec6398166d2f1abce665bd65f086f1f2631dcfdce47e0de99df76"},"schema_version":"1.0","source":{"id":"1602.00206","kind":"arxiv","version":1}},"canonical_sha256":"ac6f187e2a966a359039e72612e0eae695daba6a1c9bad3865d829ad67c76ad0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac6f187e2a966a359039e72612e0eae695daba6a1c9bad3865d829ad67c76ad0","first_computed_at":"2026-05-18T00:17:35.838627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:35.838627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZS/HnCsg5bpLwdkdufxHNcHUY9NAPIqoDf9OA2hgn45uzFB1AjOve3r8w474QAW1/s7+16LOVcNJ1vOD8EJ5BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:35.839188Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00206","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83336e8c3dc69dcb725217785c78809d59b1b357315fb9c73ba610b31539eb84","sha256:50436b6134dd24e7f6e33afa0d54586256a882b59963f8dcfa61f98f06cc63b5"],"state_sha256":"0535d6a368b8a6be832d0ad3c633f119bd049169d41a513be8896a8566d00e0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9my6badAO54aZ4hHS+ym7Pzhi+JMdE7X3rvOkTp/vbKeYVnehU2J0wfpLOvga3AHoV9W0gCbskuKBJOWJfjKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:52:54.990114Z","bundle_sha256":"a9a685805ec5a0ae916fbbaa52e44f33c57d84c09afcf988eba46811d3dccec4"}}