{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CS7VHQXUTXWIF254WRZVUVDB3K","short_pith_number":"pith:CS7VHQXU","schema_version":"1.0","canonical_sha256":"14bf53c2f49dec82ebbcb4735a5461da805b71eb8eaaaedb3f1b875063419364","source":{"kind":"arxiv","id":"1910.09182","version":1},"attestation_state":"computed","paper":{"title":"Hadamard Codebook Based Deep Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.CV","authors_text":"Chenglin Wu, Jingfei Qiu, Liujuan Cao, Mingbao Lin, Rongrong Ji, Shen Chen, Xiaoshuai Sun, Yan Wang","submitted_at":"2019-10-21T07:33:42Z","abstract_excerpt":"As an approximate nearest neighbor search technique, hashing has been widely applied in large-scale image retrieval due to its excellent efficiency. Most supervised deep hashing methods have similar loss designs with embedding learning, while quantizing the continuous high-dim feature into compact binary space. We argue that the existing deep hashing schemes are defective in two issues that seriously affect the performance, i.e., bit independence and bit balance. The former refers to hash codes of different classes should be independent of each other, while the latter means each bit should hav"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1910.09182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-10-21T07:33:42Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"ff176cc0e3a36ce9b18b96bf2477a80e25de7fe02d841ea23424c5d71830245c","abstract_canon_sha256":"f0f1bdbac32bca39eb9500ffc6931564043faa613103784d2eac719463a45275"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:13:23.328976Z","signature_b64":"YlFwsnnvAE3Rrj7718q0nrTqKIDy8PY7PF/XY82bLjVVSVCOcBQ0cTCBK1tAUK4isptuKeYnlpXMVYzpqirzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14bf53c2f49dec82ebbcb4735a5461da805b71eb8eaaaedb3f1b875063419364","last_reissued_at":"2026-07-05T00:13:23.328525Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:13:23.328525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hadamard Codebook Based Deep Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.CV","authors_text":"Chenglin Wu, Jingfei Qiu, Liujuan Cao, Mingbao Lin, Rongrong Ji, Shen Chen, Xiaoshuai Sun, Yan Wang","submitted_at":"2019-10-21T07:33:42Z","abstract_excerpt":"As an approximate nearest neighbor search technique, hashing has been widely applied in large-scale image retrieval due to its excellent efficiency. Most supervised deep hashing methods have similar loss designs with embedding learning, while quantizing the continuous high-dim feature into compact binary space. We argue that the existing deep hashing schemes are defective in two issues that seriously affect the performance, i.e., bit independence and bit balance. The former refers to hash codes of different classes should be independent of each other, while the latter means each bit should hav"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.09182","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.09182/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1910.09182","created_at":"2026-07-05T00:13:23.328592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.09182v1","created_at":"2026-07-05T00:13:23.328592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.09182","created_at":"2026-07-05T00:13:23.328592+00:00"},{"alias_kind":"pith_short_12","alias_value":"CS7VHQXUTXWI","created_at":"2026-07-05T00:13:23.328592+00:00"},{"alias_kind":"pith_short_16","alias_value":"CS7VHQXUTXWIF254","created_at":"2026-07-05T00:13:23.328592+00:00"},{"alias_kind":"pith_short_8","alias_value":"CS7VHQXU","created_at":"2026-07-05T00:13:23.328592+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CS7VHQXUTXWIF254WRZVUVDB3K","json":"https://pith.science/pith/CS7VHQXUTXWIF254WRZVUVDB3K.json","graph_json":"https://pith.science/api/pith-number/CS7VHQXUTXWIF254WRZVUVDB3K/graph.json","events_json":"https://pith.science/api/pith-number/CS7VHQXUTXWIF254WRZVUVDB3K/events.json","paper":"https://pith.science/paper/CS7VHQXU"},"agent_actions":{"view_html":"https://pith.science/pith/CS7VHQXUTXWIF254WRZVUVDB3K","download_json":"https://pith.science/pith/CS7VHQXUTXWIF254WRZVUVDB3K.json","view_paper":"https://pith.science/paper/CS7VHQXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.09182&json=true","fetch_graph":"https://pith.science/api/pith-number/CS7VHQXUTXWIF254WRZVUVDB3K/graph.json","fetch_events":"https://pith.science/api/pith-number/CS7VHQXUTXWIF254WRZVUVDB3K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CS7VHQXUTXWIF254WRZVUVDB3K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CS7VHQXUTXWIF254WRZVUVDB3K/action/storage_attestation","attest_author":"https://pith.science/pith/CS7VHQXUTXWIF254WRZVUVDB3K/action/author_attestation","sign_citation":"https://pith.science/pith/CS7VHQXUTXWIF254WRZVUVDB3K/action/citation_signature","submit_replication":"https://pith.science/pith/CS7VHQXUTXWIF254WRZVUVDB3K/action/replication_record"}},"created_at":"2026-07-05T00:13:23.328592+00:00","updated_at":"2026-07-05T00:13:23.328592+00:00"}