{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:PT6JB6XH77KZUVQPZJ5P26Q633","short_pith_number":"pith:PT6JB6XH","canonical_record":{"source":{"id":"2102.01486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-02-02T13:46:58Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"5b2cecbe6c9ae6ab7afd1d159d525821895e761c8fe120112350da5d6fd0df3b","abstract_canon_sha256":"62b631a36d3a0cd6f731b82bafba9137a89cfce80b5b2775ad667d318c165276"},"schema_version":"1.0"},"canonical_sha256":"7cfc90fae7ffd59a560fca7afd7a1ededd9a310b962e83d7519f4d2ffd421f93","source":{"kind":"arxiv","id":"2102.01486","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.01486","created_at":"2026-07-05T02:11:30Z"},{"alias_kind":"arxiv_version","alias_value":"2102.01486v1","created_at":"2026-07-05T02:11:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01486","created_at":"2026-07-05T02:11:30Z"},{"alias_kind":"pith_short_12","alias_value":"PT6JB6XH77KZ","created_at":"2026-07-05T02:11:30Z"},{"alias_kind":"pith_short_16","alias_value":"PT6JB6XH77KZUVQP","created_at":"2026-07-05T02:11:30Z"},{"alias_kind":"pith_short_8","alias_value":"PT6JB6XH","created_at":"2026-07-05T02:11:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:PT6JB6XH77KZUVQPZJ5P26Q633","target":"record","payload":{"canonical_record":{"source":{"id":"2102.01486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-02-02T13:46:58Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"5b2cecbe6c9ae6ab7afd1d159d525821895e761c8fe120112350da5d6fd0df3b","abstract_canon_sha256":"62b631a36d3a0cd6f731b82bafba9137a89cfce80b5b2775ad667d318c165276"},"schema_version":"1.0"},"canonical_sha256":"7cfc90fae7ffd59a560fca7afd7a1ededd9a310b962e83d7519f4d2ffd421f93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:11:30.990163Z","signature_b64":"s5cWtdnGAaChDeRRYYXDVzHm+nOUTBjMLsugg3NgTEEDwV97dfH+5VvKGWFFgzW6atUwf6HCjrpyx3xDCxbQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cfc90fae7ffd59a560fca7afd7a1ededd9a310b962e83d7519f4d2ffd421f93","last_reissued_at":"2026-07-05T02:11:30.989822Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:11:30.989822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.01486","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-07-05T02:11:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mafae1qJwVAkNMh+NojS21DJ7P9QMwv9uEGyk730B6WRlGQFjGJTr0o7/jQ3xu8Kd6Z3/iCqnFKSSOh3FdpCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T19:12:15.660949Z"},"content_sha256":"baa240a204c3391e906318fdc7d170ab5bb65469b1d9fc78fb6248fff7cf4f02","schema_version":"1.0","event_id":"sha256:baa240a204c3391e906318fdc7d170ab5bb65469b1d9fc78fb6248fff7cf4f02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:PT6JB6XH77KZUVQPZJ5P26Q633","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rank-Consistency Deep Hashing for Scalable Multi-Label Image Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.CV","authors_text":"Cheng Ma, Jie Zhou, Jiwen Lu","submitted_at":"2021-02-02T13:46:58Z","abstract_excerpt":"As hashing becomes an increasingly appealing technique for large-scale image retrieval, multi-label hashing is also attracting more attention for the ability to exploit multi-level semantic contents. In this paper, we propose a novel deep hashing method for scalable multi-label image search. Unlike existing approaches with conventional objectives such as contrast and triplet losses, we employ a rank list, rather than pairs or triplets, to provide sufficient global supervision information for all the samples. Specifically, a new rank-consistency objective is applied to align the similarity orde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.01486","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.01486/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:11:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wpu1QWn+O1xcKJMtkNM38zrrjWvgmlr/H3X5wg0gTgS0IKcBuC7uaJcOJVB5haBLKE4L2V61VRCotvVV/PImDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T19:12:15.662251Z"},"content_sha256":"1fc12712ca25e7d74e51438db87c3837db881ba23d4231786b74efb2088ea1ad","schema_version":"1.0","event_id":"sha256:1fc12712ca25e7d74e51438db87c3837db881ba23d4231786b74efb2088ea1ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PT6JB6XH77KZUVQPZJ5P26Q633/bundle.json","state_url":"https://pith.science/pith/PT6JB6XH77KZUVQPZJ5P26Q633/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PT6JB6XH77KZUVQPZJ5P26Q633/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-08-06T19:12:15Z","links":{"resolver":"https://pith.science/pith/PT6JB6XH77KZUVQPZJ5P26Q633","bundle":"https://pith.science/pith/PT6JB6XH77KZUVQPZJ5P26Q633/bundle.json","state":"https://pith.science/pith/PT6JB6XH77KZUVQPZJ5P26Q633/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PT6JB6XH77KZUVQPZJ5P26Q633/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:PT6JB6XH77KZUVQPZJ5P26Q633","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":"62b631a36d3a0cd6f731b82bafba9137a89cfce80b5b2775ad667d318c165276","cross_cats_sorted":["cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-02-02T13:46:58Z","title_canon_sha256":"5b2cecbe6c9ae6ab7afd1d159d525821895e761c8fe120112350da5d6fd0df3b"},"schema_version":"1.0","source":{"id":"2102.01486","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.01486","created_at":"2026-07-05T02:11:30Z"},{"alias_kind":"arxiv_version","alias_value":"2102.01486v1","created_at":"2026-07-05T02:11:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01486","created_at":"2026-07-05T02:11:30Z"},{"alias_kind":"pith_short_12","alias_value":"PT6JB6XH77KZ","created_at":"2026-07-05T02:11:30Z"},{"alias_kind":"pith_short_16","alias_value":"PT6JB6XH77KZUVQP","created_at":"2026-07-05T02:11:30Z"},{"alias_kind":"pith_short_8","alias_value":"PT6JB6XH","created_at":"2026-07-05T02:11:30Z"}],"graph_snapshots":[{"event_id":"sha256:1fc12712ca25e7d74e51438db87c3837db881ba23d4231786b74efb2088ea1ad","target":"graph","created_at":"2026-07-05T02:11:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2102.01486/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As hashing becomes an increasingly appealing technique for large-scale image retrieval, multi-label hashing is also attracting more attention for the ability to exploit multi-level semantic contents. In this paper, we propose a novel deep hashing method for scalable multi-label image search. Unlike existing approaches with conventional objectives such as contrast and triplet losses, we employ a rank list, rather than pairs or triplets, to provide sufficient global supervision information for all the samples. Specifically, a new rank-consistency objective is applied to align the similarity orde","authors_text":"Cheng Ma, Jie Zhou, Jiwen Lu","cross_cats":["cs.MM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-02-02T13:46:58Z","title":"Rank-Consistency Deep Hashing for Scalable Multi-Label Image Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.01486","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:baa240a204c3391e906318fdc7d170ab5bb65469b1d9fc78fb6248fff7cf4f02","target":"record","created_at":"2026-07-05T02:11:30Z","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":"62b631a36d3a0cd6f731b82bafba9137a89cfce80b5b2775ad667d318c165276","cross_cats_sorted":["cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-02-02T13:46:58Z","title_canon_sha256":"5b2cecbe6c9ae6ab7afd1d159d525821895e761c8fe120112350da5d6fd0df3b"},"schema_version":"1.0","source":{"id":"2102.01486","kind":"arxiv","version":1}},"canonical_sha256":"7cfc90fae7ffd59a560fca7afd7a1ededd9a310b962e83d7519f4d2ffd421f93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cfc90fae7ffd59a560fca7afd7a1ededd9a310b962e83d7519f4d2ffd421f93","first_computed_at":"2026-07-05T02:11:30.989822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:11:30.989822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s5cWtdnGAaChDeRRYYXDVzHm+nOUTBjMLsugg3NgTEEDwV97dfH+5VvKGWFFgzW6atUwf6HCjrpyx3xDCxbQAw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:11:30.990163Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.01486","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:baa240a204c3391e906318fdc7d170ab5bb65469b1d9fc78fb6248fff7cf4f02","sha256:1fc12712ca25e7d74e51438db87c3837db881ba23d4231786b74efb2088ea1ad"],"state_sha256":"9f54283fd825626c0a6508222cbab5e162215ef90f9bbfd6b401daff61af15be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GkI25aPbVyE51Zh60ud5kalqsHr7Wq2Kyv3QLB/D+r3Cp1PqdDLJbW/dWl4VWw09wXq93P0Ea3oRyz1q+6mKAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T19:12:15.671966Z","bundle_sha256":"9444c6fa94fa1e97987edc5a63f9f286ecd5c79d826bb9c403433b444e0d25bb"}}