{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:B3RPICAP2H5LKNS7WFQHZML6XI","short_pith_number":"pith:B3RPICAP","canonical_record":{"source":{"id":"1602.06697","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-02-22T09:31:45Z","cross_cats_sorted":[],"title_canon_sha256":"8295ac6172289b106c7a1e31d02f8ecf58cddc7ccc63caab2e8d96a19d211b08","abstract_canon_sha256":"7422be932094d83fa98cb0804d619bca9361f40dee00b44410d4ca338611d6b2"},"schema_version":"1.0"},"canonical_sha256":"0ee2f4080fd1fab5365fb1607cb17eba2058ba5124ef980a56938db3f1c218b6","source":{"kind":"arxiv","id":"1602.06697","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06697","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06697v2","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06697","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"pith_short_12","alias_value":"B3RPICAP2H5L","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B3RPICAP2H5LKNS7","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B3RPICAP","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:B3RPICAP2H5LKNS7WFQHZML6XI","target":"record","payload":{"canonical_record":{"source":{"id":"1602.06697","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-02-22T09:31:45Z","cross_cats_sorted":[],"title_canon_sha256":"8295ac6172289b106c7a1e31d02f8ecf58cddc7ccc63caab2e8d96a19d211b08","abstract_canon_sha256":"7422be932094d83fa98cb0804d619bca9361f40dee00b44410d4ca338611d6b2"},"schema_version":"1.0"},"canonical_sha256":"0ee2f4080fd1fab5365fb1607cb17eba2058ba5124ef980a56938db3f1c218b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:29.708281Z","signature_b64":"+U9QV/ALi5i+SmOq88enkyTonwKcRXoKHvCvyTDlgBWnj5OCQUusGVebMAExA72RS95R5fAUnKLyqrnV4xVdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ee2f4080fd1fab5365fb1607cb17eba2058ba5124ef980a56938db3f1c218b6","last_reissued_at":"2026-05-18T00:50:29.707590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:29.707590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.06697","source_version":2,"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:50:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AlsYjQqcw5jOujCJ1NKGx0+2dPcPBdfOslSs9oXmlv2yWD1JfYWipoIuyrdxWBaWfaL6KTRmY9hTrINQSw1gBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:23:16.170874Z"},"content_sha256":"23256d62bedfa907ef9d764af7667f8585e57245f8480b697fecadb5bd46a4e9","schema_version":"1.0","event_id":"sha256:23256d62bedfa907ef9d764af7667f8585e57245f8480b697fecadb5bd46a4e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:B3RPICAP2H5LKNS7WFQHZML6XI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Correlation Hashing Network for Efficient Cross-Modal Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jianmin Wang, Mingsheng Long, Philip S. Yu, Yue Cao","submitted_at":"2016-02-22T09:31:45Z","abstract_excerpt":"Hashing is widely applied to approximate nearest neighbor search for large-scale multimodal retrieval with storage and computation efficiency. Cross-modal hashing improves the quality of hash coding by exploiting semantic correlations across different modalities. Existing cross-modal hashing methods first transform data into low-dimensional feature vectors, and then generate binary codes by another separate quantization step. However, suboptimal hash codes may be generated since the quantization error is not explicitly minimized and the feature representation is not jointly optimized with the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06697","kind":"arxiv","version":2},"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:50:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zBeEqS+mvzLEbcc7QMWOxZ5OKkcAMtMjq1+abM/+8f325bOsK1ykPdoOnh6S1x4L+DSptYa28m10PBHD3VJsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:23:16.171461Z"},"content_sha256":"bfb749d02861d0fcfc2680e73656953c8c63cbe40e7ae13bfe4691f751d9b303","schema_version":"1.0","event_id":"sha256:bfb749d02861d0fcfc2680e73656953c8c63cbe40e7ae13bfe4691f751d9b303"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3RPICAP2H5LKNS7WFQHZML6XI/bundle.json","state_url":"https://pith.science/pith/B3RPICAP2H5LKNS7WFQHZML6XI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3RPICAP2H5LKNS7WFQHZML6XI/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-23T20:23:16Z","links":{"resolver":"https://pith.science/pith/B3RPICAP2H5LKNS7WFQHZML6XI","bundle":"https://pith.science/pith/B3RPICAP2H5LKNS7WFQHZML6XI/bundle.json","state":"https://pith.science/pith/B3RPICAP2H5LKNS7WFQHZML6XI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3RPICAP2H5LKNS7WFQHZML6XI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:B3RPICAP2H5LKNS7WFQHZML6XI","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":"7422be932094d83fa98cb0804d619bca9361f40dee00b44410d4ca338611d6b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-02-22T09:31:45Z","title_canon_sha256":"8295ac6172289b106c7a1e31d02f8ecf58cddc7ccc63caab2e8d96a19d211b08"},"schema_version":"1.0","source":{"id":"1602.06697","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06697","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06697v2","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06697","created_at":"2026-05-18T00:50:29Z"},{"alias_kind":"pith_short_12","alias_value":"B3RPICAP2H5L","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B3RPICAP2H5LKNS7","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B3RPICAP","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:bfb749d02861d0fcfc2680e73656953c8c63cbe40e7ae13bfe4691f751d9b303","target":"graph","created_at":"2026-05-18T00:50:29Z","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 is widely applied to approximate nearest neighbor search for large-scale multimodal retrieval with storage and computation efficiency. Cross-modal hashing improves the quality of hash coding by exploiting semantic correlations across different modalities. Existing cross-modal hashing methods first transform data into low-dimensional feature vectors, and then generate binary codes by another separate quantization step. However, suboptimal hash codes may be generated since the quantization error is not explicitly minimized and the feature representation is not jointly optimized with the ","authors_text":"Jianmin Wang, Mingsheng Long, Philip S. Yu, Yue Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-02-22T09:31:45Z","title":"Correlation Hashing Network for Efficient Cross-Modal Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06697","kind":"arxiv","version":2},"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:23256d62bedfa907ef9d764af7667f8585e57245f8480b697fecadb5bd46a4e9","target":"record","created_at":"2026-05-18T00:50:29Z","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":"7422be932094d83fa98cb0804d619bca9361f40dee00b44410d4ca338611d6b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-02-22T09:31:45Z","title_canon_sha256":"8295ac6172289b106c7a1e31d02f8ecf58cddc7ccc63caab2e8d96a19d211b08"},"schema_version":"1.0","source":{"id":"1602.06697","kind":"arxiv","version":2}},"canonical_sha256":"0ee2f4080fd1fab5365fb1607cb17eba2058ba5124ef980a56938db3f1c218b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ee2f4080fd1fab5365fb1607cb17eba2058ba5124ef980a56938db3f1c218b6","first_computed_at":"2026-05-18T00:50:29.707590Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:29.707590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+U9QV/ALi5i+SmOq88enkyTonwKcRXoKHvCvyTDlgBWnj5OCQUusGVebMAExA72RS95R5fAUnKLyqrnV4xVdCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:29.708281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06697","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23256d62bedfa907ef9d764af7667f8585e57245f8480b697fecadb5bd46a4e9","sha256:bfb749d02861d0fcfc2680e73656953c8c63cbe40e7ae13bfe4691f751d9b303"],"state_sha256":"44b448c0b33374ab2d3888562cba116c2a3756b303b8a293a859c8c6e7fb6f3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"veme+wEiAMP2rjIuO239BRyOXTxXyDMqqf/5KvGdjY4/HEZ0fBMjHp8Y05fK1yDPASb0T6jqmbJ/s9AO+9W4Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T20:23:16.175311Z","bundle_sha256":"3e80e7e1d25d88fa33bcf243645d13b6daa51a0b468d15feecffc1a812bc56df"}}