{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6HK5Z6YJKCPAOY6KTLBOS4WIQY","short_pith_number":"pith:6HK5Z6YJ","schema_version":"1.0","canonical_sha256":"f1d5dcfb09509e0763ca9ac2e972c8860b158b8d55a39eebbc74e46641877883","source":{"kind":"arxiv","id":"1707.08325","version":1},"attestation_state":"computed","paper":{"title":"Asymmetric Deep Supervised Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Qing-Yuan Jiang, Wu-Jun Li","submitted_at":"2017-07-26T09:07:48Z","abstract_excerpt":"Hashing has been widely used for large-scale approximate nearest neighbor search because of its storage and search efficiency. Recent work has found that deep supervised hashing can significantly outperform non-deep supervised hashing in many applications. However, most existing deep supervised hashing methods adopt a symmetric strategy to learn one deep hash function for both query points and database (retrieval) points. The training of these symmetric deep supervised hashing methods is typically time-consuming, which makes them hard to effectively utilize the supervised information for cases"},"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":"1707.08325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-26T09:07:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6e6a8de64c74ca638bb75319742f60304e48e46934f78333390c610872934951","abstract_canon_sha256":"0ee729eaa410b818cef53e40bbd6df9328a84b7e9b5fd55a404e9a32892a8ef4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:24.587168Z","signature_b64":"LoUbf7ZUNYO0ddQ9jiehOWe9bhMCeesWSd+m7HvUsJyelezFtO1wp5qRDGC3BvTa6wJU2bKd0jZRP79huZpWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1d5dcfb09509e0763ca9ac2e972c8860b158b8d55a39eebbc74e46641877883","last_reissued_at":"2026-05-18T00:39:24.586561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:24.586561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymmetric Deep Supervised Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Qing-Yuan Jiang, Wu-Jun Li","submitted_at":"2017-07-26T09:07:48Z","abstract_excerpt":"Hashing has been widely used for large-scale approximate nearest neighbor search because of its storage and search efficiency. Recent work has found that deep supervised hashing can significantly outperform non-deep supervised hashing in many applications. However, most existing deep supervised hashing methods adopt a symmetric strategy to learn one deep hash function for both query points and database (retrieval) points. The training of these symmetric deep supervised hashing methods is typically time-consuming, which makes them hard to effectively utilize the supervised information for cases"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08325","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":"1707.08325","created_at":"2026-05-18T00:39:24.586670+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08325v1","created_at":"2026-05-18T00:39:24.586670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08325","created_at":"2026-05-18T00:39:24.586670+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HK5Z6YJKCPA","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HK5Z6YJKCPAOY6K","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HK5Z6YJ","created_at":"2026-05-18T12:31:03.183658+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/6HK5Z6YJKCPAOY6KTLBOS4WIQY","json":"https://pith.science/pith/6HK5Z6YJKCPAOY6KTLBOS4WIQY.json","graph_json":"https://pith.science/api/pith-number/6HK5Z6YJKCPAOY6KTLBOS4WIQY/graph.json","events_json":"https://pith.science/api/pith-number/6HK5Z6YJKCPAOY6KTLBOS4WIQY/events.json","paper":"https://pith.science/paper/6HK5Z6YJ"},"agent_actions":{"view_html":"https://pith.science/pith/6HK5Z6YJKCPAOY6KTLBOS4WIQY","download_json":"https://pith.science/pith/6HK5Z6YJKCPAOY6KTLBOS4WIQY.json","view_paper":"https://pith.science/paper/6HK5Z6YJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08325&json=true","fetch_graph":"https://pith.science/api/pith-number/6HK5Z6YJKCPAOY6KTLBOS4WIQY/graph.json","fetch_events":"https://pith.science/api/pith-number/6HK5Z6YJKCPAOY6KTLBOS4WIQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HK5Z6YJKCPAOY6KTLBOS4WIQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HK5Z6YJKCPAOY6KTLBOS4WIQY/action/storage_attestation","attest_author":"https://pith.science/pith/6HK5Z6YJKCPAOY6KTLBOS4WIQY/action/author_attestation","sign_citation":"https://pith.science/pith/6HK5Z6YJKCPAOY6KTLBOS4WIQY/action/citation_signature","submit_replication":"https://pith.science/pith/6HK5Z6YJKCPAOY6KTLBOS4WIQY/action/replication_record"}},"created_at":"2026-05-18T00:39:24.586670+00:00","updated_at":"2026-05-18T00:39:24.586670+00:00"}