{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QT7V6WAS4XXMYQKMI77TPZG6CV","short_pith_number":"pith:QT7V6WAS","schema_version":"1.0","canonical_sha256":"84ff5f5812e5eecc414c47ff37e4de157f60376c36a912db4282edf8b014dc7e","source":{"kind":"arxiv","id":"1702.00758","version":4},"attestation_state":"computed","paper":{"title":"HashNet: Deep Learning to Hash by Continuation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Jianmin Wang, Mingsheng Long, Philip S. Yu, Zhangjie Cao","submitted_at":"2017-02-02T17:29:24Z","abstract_excerpt":"Learning to hash has been widely applied to approximate nearest neighbor search for large-scale multimedia retrieval, due to its computation efficiency and retrieval quality. Deep learning to hash, which improves retrieval quality by end-to-end representation learning and hash encoding, has received increasing attention recently. Subject to the ill-posed gradient difficulty in the optimization with sign activations, existing deep learning to hash methods need to first learn continuous representations and then generate binary hash codes in a separated binarization step, which suffer from substa"},"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":"1702.00758","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-02T17:29:24Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"f4ae08f17b2bdb9fa831958c73ca0dd3181f5d72e595b08198d880c578270b8f","abstract_canon_sha256":"b36013dbe625a529ea25297b92e0f2b5f26cb39e98971684863c3932506b57c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:12.710772Z","signature_b64":"innmNQIY4HHo0G1rBj4yYXLc3/rAGqgFYRqXZzT6+yJWEi/JFsD94Sh7X63YeCfde6JLOyA4rmAUGRIL8nr6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84ff5f5812e5eecc414c47ff37e4de157f60376c36a912db4282edf8b014dc7e","last_reissued_at":"2026-05-18T00:39:12.710183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:12.710183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HashNet: Deep Learning to Hash by Continuation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Jianmin Wang, Mingsheng Long, Philip S. Yu, Zhangjie Cao","submitted_at":"2017-02-02T17:29:24Z","abstract_excerpt":"Learning to hash has been widely applied to approximate nearest neighbor search for large-scale multimedia retrieval, due to its computation efficiency and retrieval quality. Deep learning to hash, which improves retrieval quality by end-to-end representation learning and hash encoding, has received increasing attention recently. Subject to the ill-posed gradient difficulty in the optimization with sign activations, existing deep learning to hash methods need to first learn continuous representations and then generate binary hash codes in a separated binarization step, which suffer from substa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00758","kind":"arxiv","version":4},"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":"1702.00758","created_at":"2026-05-18T00:39:12.710273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00758v4","created_at":"2026-05-18T00:39:12.710273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00758","created_at":"2026-05-18T00:39:12.710273+00:00"},{"alias_kind":"pith_short_12","alias_value":"QT7V6WAS4XXM","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QT7V6WAS4XXMYQKM","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QT7V6WAS","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00382","citing_title":"Adversarially Trained Deep Neural Semantic Hashing Scheme for Subjective Search in Fashion Inventory","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QT7V6WAS4XXMYQKMI77TPZG6CV","json":"https://pith.science/pith/QT7V6WAS4XXMYQKMI77TPZG6CV.json","graph_json":"https://pith.science/api/pith-number/QT7V6WAS4XXMYQKMI77TPZG6CV/graph.json","events_json":"https://pith.science/api/pith-number/QT7V6WAS4XXMYQKMI77TPZG6CV/events.json","paper":"https://pith.science/paper/QT7V6WAS"},"agent_actions":{"view_html":"https://pith.science/pith/QT7V6WAS4XXMYQKMI77TPZG6CV","download_json":"https://pith.science/pith/QT7V6WAS4XXMYQKMI77TPZG6CV.json","view_paper":"https://pith.science/paper/QT7V6WAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00758&json=true","fetch_graph":"https://pith.science/api/pith-number/QT7V6WAS4XXMYQKMI77TPZG6CV/graph.json","fetch_events":"https://pith.science/api/pith-number/QT7V6WAS4XXMYQKMI77TPZG6CV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QT7V6WAS4XXMYQKMI77TPZG6CV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QT7V6WAS4XXMYQKMI77TPZG6CV/action/storage_attestation","attest_author":"https://pith.science/pith/QT7V6WAS4XXMYQKMI77TPZG6CV/action/author_attestation","sign_citation":"https://pith.science/pith/QT7V6WAS4XXMYQKMI77TPZG6CV/action/citation_signature","submit_replication":"https://pith.science/pith/QT7V6WAS4XXMYQKMI77TPZG6CV/action/replication_record"}},"created_at":"2026-05-18T00:39:12.710273+00:00","updated_at":"2026-05-18T00:39:12.710273+00:00"}