{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6XPLO3L7V3NTSQSDHHFYMDTWRP","short_pith_number":"pith:6XPLO3L7","canonical_record":{"source":{"id":"1812.07660","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-06T04:28:31Z","cross_cats_sorted":["cs.CV","cs.MM"],"title_canon_sha256":"6bc74c9dad0a5ed7a5f7117cf163856d3fd96f64e6e597b9420418c47ea536f9","abstract_canon_sha256":"692d90da2fdd9e31c101aed0e3dd0b76babf9a59975ea4d803eab6329961bfd9"},"schema_version":"1.0"},"canonical_sha256":"f5deb76d7faedb39424339cb860e768bfd747dfa8303fcbc9f6c7d035bb9229b","source":{"kind":"arxiv","id":"1812.07660","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.07660","created_at":"2026-05-17T23:48:16Z"},{"alias_kind":"arxiv_version","alias_value":"1812.07660v3","created_at":"2026-05-17T23:48:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.07660","created_at":"2026-05-17T23:48:16Z"},{"alias_kind":"pith_short_12","alias_value":"6XPLO3L7V3NT","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6XPLO3L7V3NTSQSD","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6XPLO3L7","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6XPLO3L7V3NTSQSDHHFYMDTWRP","target":"record","payload":{"canonical_record":{"source":{"id":"1812.07660","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-06T04:28:31Z","cross_cats_sorted":["cs.CV","cs.MM"],"title_canon_sha256":"6bc74c9dad0a5ed7a5f7117cf163856d3fd96f64e6e597b9420418c47ea536f9","abstract_canon_sha256":"692d90da2fdd9e31c101aed0e3dd0b76babf9a59975ea4d803eab6329961bfd9"},"schema_version":"1.0"},"canonical_sha256":"f5deb76d7faedb39424339cb860e768bfd747dfa8303fcbc9f6c7d035bb9229b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:16.825716Z","signature_b64":"xY42T2LHHXXRz76Tz1ybRd6y45Fv0UoW7lhE+bfwCAfxOzHCkk7gImZrZV6H3N3w4GiAcHJje4mCWvGmeEQ/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5deb76d7faedb39424339cb860e768bfd747dfa8303fcbc9f6c7d035bb9229b","last_reissued_at":"2026-05-17T23:48:16.825152Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:16.825152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.07660","source_version":3,"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-17T23:48:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CNCqVZTMO1PkUKh+hIJSGwFtJ0pQYVaxBZg8nD8lDGLsxvDEg5H7riZKPAIV/kE4oAj7bTjsKF8pHphRfzguDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:32:55.541110Z"},"content_sha256":"6ddb9e7a4b2778e2e7072932f9dbd95e024bf06646e9cda248cdb0083438b745","schema_version":"1.0","event_id":"sha256:6ddb9e7a4b2778e2e7072932f9dbd95e024bf06646e9cda248cdb0083438b745"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6XPLO3L7V3NTSQSDHHFYMDTWRP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discriminative Supervised Hashing for Cross-Modal similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.MM"],"primary_cat":"cs.LG","authors_text":"Josef Kittler, Jun Yu, Xiao-Jun Wu","submitted_at":"2018-12-06T04:28:31Z","abstract_excerpt":"With the advantage of low storage cost and high retrieval efficiency, hashing techniques have recently been an emerging topic in cross-modal similarity search. As multiple modal data reflect similar semantic content, many researches aim at learning unified binary codes. However, discriminative hashing features learned by these methods are not adequate. This results in lower accuracy and robustness. We propose a novel hashing learning framework which jointly performs classifier learning, subspace learning and matrix factorization to preserve class-specific semantic content, termed Discriminativ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.07660","kind":"arxiv","version":3},"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-17T23:48:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uS0WU0J9foBXA1LkJKi/fcYKuDhsHWhuHUbIQu/pcAMrP/NTkUoPdoBsWfum1UH4koy3kRswKC+WxAsNwi4BCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:32:55.541696Z"},"content_sha256":"2d53564e209701cc5566c1d8a5e854ae3837b1f34a14c1c4a4164a5bacb3828a","schema_version":"1.0","event_id":"sha256:2d53564e209701cc5566c1d8a5e854ae3837b1f34a14c1c4a4164a5bacb3828a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6XPLO3L7V3NTSQSDHHFYMDTWRP/bundle.json","state_url":"https://pith.science/pith/6XPLO3L7V3NTSQSDHHFYMDTWRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6XPLO3L7V3NTSQSDHHFYMDTWRP/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-05-26T16:32:55Z","links":{"resolver":"https://pith.science/pith/6XPLO3L7V3NTSQSDHHFYMDTWRP","bundle":"https://pith.science/pith/6XPLO3L7V3NTSQSDHHFYMDTWRP/bundle.json","state":"https://pith.science/pith/6XPLO3L7V3NTSQSDHHFYMDTWRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6XPLO3L7V3NTSQSDHHFYMDTWRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6XPLO3L7V3NTSQSDHHFYMDTWRP","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":"692d90da2fdd9e31c101aed0e3dd0b76babf9a59975ea4d803eab6329961bfd9","cross_cats_sorted":["cs.CV","cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-06T04:28:31Z","title_canon_sha256":"6bc74c9dad0a5ed7a5f7117cf163856d3fd96f64e6e597b9420418c47ea536f9"},"schema_version":"1.0","source":{"id":"1812.07660","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.07660","created_at":"2026-05-17T23:48:16Z"},{"alias_kind":"arxiv_version","alias_value":"1812.07660v3","created_at":"2026-05-17T23:48:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.07660","created_at":"2026-05-17T23:48:16Z"},{"alias_kind":"pith_short_12","alias_value":"6XPLO3L7V3NT","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6XPLO3L7V3NTSQSD","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6XPLO3L7","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:2d53564e209701cc5566c1d8a5e854ae3837b1f34a14c1c4a4164a5bacb3828a","target":"graph","created_at":"2026-05-17T23:48:16Z","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":"With the advantage of low storage cost and high retrieval efficiency, hashing techniques have recently been an emerging topic in cross-modal similarity search. As multiple modal data reflect similar semantic content, many researches aim at learning unified binary codes. However, discriminative hashing features learned by these methods are not adequate. This results in lower accuracy and robustness. We propose a novel hashing learning framework which jointly performs classifier learning, subspace learning and matrix factorization to preserve class-specific semantic content, termed Discriminativ","authors_text":"Josef Kittler, Jun Yu, Xiao-Jun Wu","cross_cats":["cs.CV","cs.MM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-06T04:28:31Z","title":"Discriminative Supervised Hashing for Cross-Modal similarity Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.07660","kind":"arxiv","version":3},"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:6ddb9e7a4b2778e2e7072932f9dbd95e024bf06646e9cda248cdb0083438b745","target":"record","created_at":"2026-05-17T23:48:16Z","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":"692d90da2fdd9e31c101aed0e3dd0b76babf9a59975ea4d803eab6329961bfd9","cross_cats_sorted":["cs.CV","cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-06T04:28:31Z","title_canon_sha256":"6bc74c9dad0a5ed7a5f7117cf163856d3fd96f64e6e597b9420418c47ea536f9"},"schema_version":"1.0","source":{"id":"1812.07660","kind":"arxiv","version":3}},"canonical_sha256":"f5deb76d7faedb39424339cb860e768bfd747dfa8303fcbc9f6c7d035bb9229b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5deb76d7faedb39424339cb860e768bfd747dfa8303fcbc9f6c7d035bb9229b","first_computed_at":"2026-05-17T23:48:16.825152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:16.825152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xY42T2LHHXXRz76Tz1ybRd6y45Fv0UoW7lhE+bfwCAfxOzHCkk7gImZrZV6H3N3w4GiAcHJje4mCWvGmeEQ/Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:16.825716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.07660","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ddb9e7a4b2778e2e7072932f9dbd95e024bf06646e9cda248cdb0083438b745","sha256:2d53564e209701cc5566c1d8a5e854ae3837b1f34a14c1c4a4164a5bacb3828a"],"state_sha256":"ffdd8707e1bb7aacee7642726893cf0351331abf0e26bac5a07ea064d15fe891"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n95yXd+oEKEdlrD1FDCCa6tB1j4zw+WNWBZQS4qF6xBnQaD8DtDjwg7tH1HjaU0JA11D8P1fyAFDh5EC4pnEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:32:55.544809Z","bundle_sha256":"80ac683255135de3645cdb9107a64ecd0fcd96cff27a63d1009fdad3c536df98"}}