{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6HK5Z6YJKCPAOY6KTLBOS4WIQY","short_pith_number":"pith:6HK5Z6YJ","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"},"canonical_sha256":"f1d5dcfb09509e0763ca9ac2e972c8860b158b8d55a39eebbc74e46641877883","source":{"kind":"arxiv","id":"1707.08325","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08325","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08325v1","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08325","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"6HK5Z6YJKCPA","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6HK5Z6YJKCPAOY6K","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6HK5Z6YJ","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6HK5Z6YJKCPAOY6KTLBOS4WIQY","target":"record","payload":{"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"},"canonical_sha256":"f1d5dcfb09509e0763ca9ac2e972c8860b158b8d55a39eebbc74e46641877883","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"},"source_kind":"arxiv","source_id":"1707.08325","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:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/Kty35FTPUXqxni9EW10XeIl/fQiz2mxb+se1U11Rtqx3PoEHgPy5WBapdXh9iiiNIGzoWrnUsboZMiWcKyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:55:11.894161Z"},"content_sha256":"19143fc4dce12c67d808978fcd76179d46fa5dd789855577c095fc5fdd0e8caa","schema_version":"1.0","event_id":"sha256:19143fc4dce12c67d808978fcd76179d46fa5dd789855577c095fc5fdd0e8caa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6HK5Z6YJKCPAOY6KTLBOS4WIQY","target":"graph","payload":{"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"},"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:39:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7F0XQhF7KZefPhC20mM2kZQTvOzxBFcHhtUowJuoWVqwP508xqoN3eCPmJ0AokM9GzIQ9vHkIhrsnN3u76o9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:55:11.894534Z"},"content_sha256":"69bd32c4bcff4419598f6cdfb6b083ac16f51b364afc9bfe75fb4559d38b295b","schema_version":"1.0","event_id":"sha256:69bd32c4bcff4419598f6cdfb6b083ac16f51b364afc9bfe75fb4559d38b295b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HK5Z6YJKCPAOY6KTLBOS4WIQY/bundle.json","state_url":"https://pith.science/pith/6HK5Z6YJKCPAOY6KTLBOS4WIQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HK5Z6YJKCPAOY6KTLBOS4WIQY/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-06-27T17:55:11Z","links":{"resolver":"https://pith.science/pith/6HK5Z6YJKCPAOY6KTLBOS4WIQY","bundle":"https://pith.science/pith/6HK5Z6YJKCPAOY6KTLBOS4WIQY/bundle.json","state":"https://pith.science/pith/6HK5Z6YJKCPAOY6KTLBOS4WIQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HK5Z6YJKCPAOY6KTLBOS4WIQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6HK5Z6YJKCPAOY6KTLBOS4WIQY","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":"0ee729eaa410b818cef53e40bbd6df9328a84b7e9b5fd55a404e9a32892a8ef4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-26T09:07:48Z","title_canon_sha256":"6e6a8de64c74ca638bb75319742f60304e48e46934f78333390c610872934951"},"schema_version":"1.0","source":{"id":"1707.08325","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.08325","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"arxiv_version","alias_value":"1707.08325v1","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08325","created_at":"2026-05-18T00:39:24Z"},{"alias_kind":"pith_short_12","alias_value":"6HK5Z6YJKCPA","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6HK5Z6YJKCPAOY6K","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6HK5Z6YJ","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:69bd32c4bcff4419598f6cdfb6b083ac16f51b364afc9bfe75fb4559d38b295b","target":"graph","created_at":"2026-05-18T00:39:24Z","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":"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","authors_text":"Qing-Yuan Jiang, Wu-Jun Li","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-26T09:07:48Z","title":"Asymmetric Deep Supervised Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08325","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:19143fc4dce12c67d808978fcd76179d46fa5dd789855577c095fc5fdd0e8caa","target":"record","created_at":"2026-05-18T00:39:24Z","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":"0ee729eaa410b818cef53e40bbd6df9328a84b7e9b5fd55a404e9a32892a8ef4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-26T09:07:48Z","title_canon_sha256":"6e6a8de64c74ca638bb75319742f60304e48e46934f78333390c610872934951"},"schema_version":"1.0","source":{"id":"1707.08325","kind":"arxiv","version":1}},"canonical_sha256":"f1d5dcfb09509e0763ca9ac2e972c8860b158b8d55a39eebbc74e46641877883","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1d5dcfb09509e0763ca9ac2e972c8860b158b8d55a39eebbc74e46641877883","first_computed_at":"2026-05-18T00:39:24.586561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:24.586561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LoUbf7ZUNYO0ddQ9jiehOWe9bhMCeesWSd+m7HvUsJyelezFtO1wp5qRDGC3BvTa6wJU2bKd0jZRP79huZpWCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:24.587168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.08325","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19143fc4dce12c67d808978fcd76179d46fa5dd789855577c095fc5fdd0e8caa","sha256:69bd32c4bcff4419598f6cdfb6b083ac16f51b364afc9bfe75fb4559d38b295b"],"state_sha256":"ccafefb25594467e689a30e1692eeb5279317ebfd434f75d309f3e45e13cb81f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iJoBE3w88xHlQLsm1aVkK9S+Ge95IBntZmnGYSZODD/KkP3b2Q3hnJ51BIH7A1nGCFv/VTdmt+HNYBcR8x2CBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:55:11.896303Z","bundle_sha256":"d359608b37a4448ff226efa78373cd323d5a14b79ac92eef30377c4bee4ff5db"}}