{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WUXJFAOKDXEYJBAL2PPEQYJF4M","short_pith_number":"pith:WUXJFAOK","schema_version":"1.0","canonical_sha256":"b52e9281ca1dc984840bd3de486125e333e23a08bf17685325ff3afd5e2bc075","source":{"kind":"arxiv","id":"1603.03234","version":1},"attestation_state":"computed","paper":{"title":"Instance-Aware Hashing for Multi-Label Image Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hanjiang Lai, Pan Yan, Shuicheng Yan, Xiangbo Shu, Yunchao Wei","submitted_at":"2016-03-10T12:21:50Z","abstract_excerpt":"Similarity-preserving hashing is a commonly used method for nearest neighbour search in large-scale image retrieval. For image retrieval, deep-networks-based hashing methods are appealing since they can simultaneously learn effective image representations and compact hash codes. This paper focuses on deep-networks-based hashing for multi-label images, each of which may contain objects of multiple categories. In most existing hashing methods, each image is represented by one piece of hash code, which is referred to as semantic hashing. This setting may be suboptimal for multi-label image retrie"},"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":"1603.03234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-10T12:21:50Z","cross_cats_sorted":[],"title_canon_sha256":"d1601b7880f67b73a346d6bc272fbe410aded24d95be174759a1a78c7e4b526d","abstract_canon_sha256":"5bfbcfbde3566b703fea1e2b949043b045c88e2a23dd82d13d5e2ba51fef72e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:41.827949Z","signature_b64":"q3RzhgVrj543RsmJtOMrWU+l/rJ3JIN9cu71mcxSh+NOag9uqPlallfx/4Dz91e2urSJGHzZQQ4gDz4Zg2soCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b52e9281ca1dc984840bd3de486125e333e23a08bf17685325ff3afd5e2bc075","last_reissued_at":"2026-05-18T01:15:41.827344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:41.827344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Instance-Aware Hashing for Multi-Label Image Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hanjiang Lai, Pan Yan, Shuicheng Yan, Xiangbo Shu, Yunchao Wei","submitted_at":"2016-03-10T12:21:50Z","abstract_excerpt":"Similarity-preserving hashing is a commonly used method for nearest neighbour search in large-scale image retrieval. For image retrieval, deep-networks-based hashing methods are appealing since they can simultaneously learn effective image representations and compact hash codes. This paper focuses on deep-networks-based hashing for multi-label images, each of which may contain objects of multiple categories. In most existing hashing methods, each image is represented by one piece of hash code, which is referred to as semantic hashing. This setting may be suboptimal for multi-label image retrie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03234","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.03234","created_at":"2026-05-18T01:15:41.827449+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.03234v1","created_at":"2026-05-18T01:15:41.827449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03234","created_at":"2026-05-18T01:15:41.827449+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUXJFAOKDXEY","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUXJFAOKDXEYJBAL","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUXJFAOK","created_at":"2026-05-18T12:30:51.357362+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/WUXJFAOKDXEYJBAL2PPEQYJF4M","json":"https://pith.science/pith/WUXJFAOKDXEYJBAL2PPEQYJF4M.json","graph_json":"https://pith.science/api/pith-number/WUXJFAOKDXEYJBAL2PPEQYJF4M/graph.json","events_json":"https://pith.science/api/pith-number/WUXJFAOKDXEYJBAL2PPEQYJF4M/events.json","paper":"https://pith.science/paper/WUXJFAOK"},"agent_actions":{"view_html":"https://pith.science/pith/WUXJFAOKDXEYJBAL2PPEQYJF4M","download_json":"https://pith.science/pith/WUXJFAOKDXEYJBAL2PPEQYJF4M.json","view_paper":"https://pith.science/paper/WUXJFAOK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.03234&json=true","fetch_graph":"https://pith.science/api/pith-number/WUXJFAOKDXEYJBAL2PPEQYJF4M/graph.json","fetch_events":"https://pith.science/api/pith-number/WUXJFAOKDXEYJBAL2PPEQYJF4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUXJFAOKDXEYJBAL2PPEQYJF4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUXJFAOKDXEYJBAL2PPEQYJF4M/action/storage_attestation","attest_author":"https://pith.science/pith/WUXJFAOKDXEYJBAL2PPEQYJF4M/action/author_attestation","sign_citation":"https://pith.science/pith/WUXJFAOKDXEYJBAL2PPEQYJF4M/action/citation_signature","submit_replication":"https://pith.science/pith/WUXJFAOKDXEYJBAL2PPEQYJF4M/action/replication_record"}},"created_at":"2026-05-18T01:15:41.827449+00:00","updated_at":"2026-05-18T01:15:41.827449+00:00"}