{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FKKY2432P5K2NLPAHVDFZ3L4CY","short_pith_number":"pith:FKKY2432","canonical_record":{"source":{"id":"1905.04450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-11T05:13:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2a6bfbf2509ad8c65d99d8ad99df8f012d4723247d6b5849b94204c687578b6e","abstract_canon_sha256":"546211007014e211a64688426b61a69c2d84d59b5baebc5ff9151681f76b1d72"},"schema_version":"1.0"},"canonical_sha256":"2a958d737a7f55a6ade03d465ced7c160847baa8bd634e58b0af0925e2f64d9e","source":{"kind":"arxiv","id":"1905.04450","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04450","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04450v1","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04450","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"FKKY2432P5K2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FKKY2432P5K2NLPA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FKKY2432","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FKKY2432P5K2NLPAHVDFZ3L4CY","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-11T05:13:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2a6bfbf2509ad8c65d99d8ad99df8f012d4723247d6b5849b94204c687578b6e","abstract_canon_sha256":"546211007014e211a64688426b61a69c2d84d59b5baebc5ff9151681f76b1d72"},"schema_version":"1.0"},"canonical_sha256":"2a958d737a7f55a6ade03d465ced7c160847baa8bd634e58b0af0925e2f64d9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:24.809536Z","signature_b64":"nNfslF/6PEBN8EuNXIHQQSrKTAkFR/BXLBLyevOF81jayRT/2j9BLHUZ6IbPCNtHAGlmokZL6/2DKqc5dRJNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a958d737a7f55a6ade03d465ced7c160847baa8bd634e58b0af0925e2f64d9e","last_reissued_at":"2026-05-17T23:46:24.808834Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:24.808834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04450","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-17T23:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+JxLVtzhxchk90YVFBlOczud83rMnd9dTmhBLF1u0nFpAgfICm3EYhodEmdjMCcpLq9LC4j431BpLlWNIjF5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:23:17.609983Z"},"content_sha256":"070a7add108703ffe02441a759272c738384c461d8eb5b34693cb89b6c80d3bd","schema_version":"1.0","event_id":"sha256:070a7add108703ffe02441a759272c738384c461d8eb5b34693cb89b6c80d3bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FKKY2432P5K2NLPAHVDFZ3L4CY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ranking-based Deep Cross-modal Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Carlotta Domeniconi, Guoxian Yu, Jun Wang, Maozu Guo, Xuanwu Liu, Yazhou Ren","submitted_at":"2019-05-11T05:13:06Z","abstract_excerpt":"Cross-modal hashing has been receiving increasing interests for its low storage cost and fast query speed in multi-modal data retrievals. However, most existing hashing methods are based on hand-crafted or raw level features of objects, which may not be optimally compatible with the coding process. Besides, these hashing methods are mainly designed to handle simple pairwise similarity. The complex multilevel ranking semantic structure of instances associated with multiple labels has not been well explored yet. In this paper, we propose a ranking-based deep cross-modal hashing approach (RDCMH)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04450","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-17T23:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2w706Jmn7xAg048scRh1CGbPnXCte55GUq1q9f4TZN72mS+d9UuD0SCkDLA8MHOQhbeGP3lQCjLVQmf6uBj4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:23:17.610664Z"},"content_sha256":"526e5f14fc74a101206f439c8c648831ec9176aa16efd3ff40d44c7c0ea844b8","schema_version":"1.0","event_id":"sha256:526e5f14fc74a101206f439c8c648831ec9176aa16efd3ff40d44c7c0ea844b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FKKY2432P5K2NLPAHVDFZ3L4CY/bundle.json","state_url":"https://pith.science/pith/FKKY2432P5K2NLPAHVDFZ3L4CY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FKKY2432P5K2NLPAHVDFZ3L4CY/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-26T08:23:17Z","links":{"resolver":"https://pith.science/pith/FKKY2432P5K2NLPAHVDFZ3L4CY","bundle":"https://pith.science/pith/FKKY2432P5K2NLPAHVDFZ3L4CY/bundle.json","state":"https://pith.science/pith/FKKY2432P5K2NLPAHVDFZ3L4CY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FKKY2432P5K2NLPAHVDFZ3L4CY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FKKY2432P5K2NLPAHVDFZ3L4CY","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":"546211007014e211a64688426b61a69c2d84d59b5baebc5ff9151681f76b1d72","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-11T05:13:06Z","title_canon_sha256":"2a6bfbf2509ad8c65d99d8ad99df8f012d4723247d6b5849b94204c687578b6e"},"schema_version":"1.0","source":{"id":"1905.04450","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04450","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04450v1","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04450","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"FKKY2432P5K2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FKKY2432P5K2NLPA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FKKY2432","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:526e5f14fc74a101206f439c8c648831ec9176aa16efd3ff40d44c7c0ea844b8","target":"graph","created_at":"2026-05-17T23:46: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":"Cross-modal hashing has been receiving increasing interests for its low storage cost and fast query speed in multi-modal data retrievals. However, most existing hashing methods are based on hand-crafted or raw level features of objects, which may not be optimally compatible with the coding process. Besides, these hashing methods are mainly designed to handle simple pairwise similarity. The complex multilevel ranking semantic structure of instances associated with multiple labels has not been well explored yet. In this paper, we propose a ranking-based deep cross-modal hashing approach (RDCMH).","authors_text":"Carlotta Domeniconi, Guoxian Yu, Jun Wang, Maozu Guo, Xuanwu Liu, Yazhou Ren","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-11T05:13:06Z","title":"Ranking-based Deep Cross-modal Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04450","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:070a7add108703ffe02441a759272c738384c461d8eb5b34693cb89b6c80d3bd","target":"record","created_at":"2026-05-17T23:46: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":"546211007014e211a64688426b61a69c2d84d59b5baebc5ff9151681f76b1d72","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-11T05:13:06Z","title_canon_sha256":"2a6bfbf2509ad8c65d99d8ad99df8f012d4723247d6b5849b94204c687578b6e"},"schema_version":"1.0","source":{"id":"1905.04450","kind":"arxiv","version":1}},"canonical_sha256":"2a958d737a7f55a6ade03d465ced7c160847baa8bd634e58b0af0925e2f64d9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a958d737a7f55a6ade03d465ced7c160847baa8bd634e58b0af0925e2f64d9e","first_computed_at":"2026-05-17T23:46:24.808834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:24.808834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nNfslF/6PEBN8EuNXIHQQSrKTAkFR/BXLBLyevOF81jayRT/2j9BLHUZ6IbPCNtHAGlmokZL6/2DKqc5dRJNAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:24.809536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04450","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:070a7add108703ffe02441a759272c738384c461d8eb5b34693cb89b6c80d3bd","sha256:526e5f14fc74a101206f439c8c648831ec9176aa16efd3ff40d44c7c0ea844b8"],"state_sha256":"4c4c0e4d7bd161a74c9041d4521a361e590a926507db6294d86883752cf30140"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mB73OQXoJxWM+7YTNkl7OtMfJo5tLr4OhJ7xRc5DsBI1jhHHs0Q91QntixyDNbZpXK0QdCY5eMWsGKmVXz39Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:23:17.614220Z","bundle_sha256":"ce0db1d548de24823a1a324484da8398fb0ac1c3e411e26c49a0364da90bb900"}}