{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:25Z722WALUQLIGH6A5EKPPK7JG","short_pith_number":"pith:25Z722WA","canonical_record":{"source":{"id":"1901.03060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-10T08:53:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d609ce041cc45f5ae3879b4177b83cbc0d3affeb000340a15881db7868b5e1d5","abstract_canon_sha256":"8407d84c421609d4d3e774912e002307d6f7fd3bf77542cf3068f4d403f6fce1"},"schema_version":"1.0"},"canonical_sha256":"d773fd6ac05d20b418fe0748a7bd5f49a4296b998803f2ab36d09b672f067a0a","source":{"kind":"arxiv","id":"1901.03060","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03060","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03060v2","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03060","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"pith_short_12","alias_value":"25Z722WALUQL","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"25Z722WALUQLIGH6","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"25Z722WA","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:25Z722WALUQLIGH6A5EKPPK7JG","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-10T08:53:19Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d609ce041cc45f5ae3879b4177b83cbc0d3affeb000340a15881db7868b5e1d5","abstract_canon_sha256":"8407d84c421609d4d3e774912e002307d6f7fd3bf77542cf3068f4d403f6fce1"},"schema_version":"1.0"},"canonical_sha256":"d773fd6ac05d20b418fe0748a7bd5f49a4296b998803f2ab36d09b672f067a0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:33.139173Z","signature_b64":"7O4lB/mAC2HW6GwBPeibehnxdTeoqqhwvaWTgVFYA2DgJIebI01mNTD0EwRQvrMOmbv9RlNLUvg0RnUlCQPZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d773fd6ac05d20b418fe0748a7bd5f49a4296b998803f2ab36d09b672f067a0a","last_reissued_at":"2026-05-17T23:56:33.138700Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:33.138700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03060","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-17T23:56:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wW+PWFhsdWGS+JMpjTN73wby5awTmt4n2pXSDFLKiM6W/4b9dFE8lQNMdxazq5C5nFl5jqSBVCx7qSSUw/d1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:28:32.269802Z"},"content_sha256":"2bf9ab5e7c2d90ea74f15c189a4943992ca156acfce2370ade6742f2cf332d62","schema_version":"1.0","event_id":"sha256:2bf9ab5e7c2d90ea74f15c189a4943992ca156acfce2370ade6742f2cf332d62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:25Z722WALUQLIGH6A5EKPPK7JG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchy Neighborhood Discriminative Hashing for An Unified View of Single-Label and Multi-Label Image retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Fanman Meng, Hongliang Li, King Ngi Ngan, Lei Ma, Qingbo Wu","submitted_at":"2019-01-10T08:53:19Z","abstract_excerpt":"Recently, deep supervised hashing methods have become popular for large-scale image retrieval task. To preserve the semantic similarity notion between examples, they typically utilize the pairwise supervision or the triplet supervised information for hash learning. However, these methods usually ignore the semantic class information which can help the improvement of the semantic discriminative ability of hash codes. In this paper, we propose a novel hierarchy neighborhood discriminative hashing method. Specifically, we construct a bipartite graph to build coarse semantic neighbourhood relation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03060","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-17T23:56:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CgAhPXCOKh62HO81KLWz6Pv48Mx7RCiIBxiYgLw6XayNURR20Vb6H5o6e0h8zJsRWOcAe+vuf548xoKiHkYtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:28:32.270469Z"},"content_sha256":"04267390433603c2e35b06abc63bf23329ab946221a05e7e4e430fe23b680076","schema_version":"1.0","event_id":"sha256:04267390433603c2e35b06abc63bf23329ab946221a05e7e4e430fe23b680076"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25Z722WALUQLIGH6A5EKPPK7JG/bundle.json","state_url":"https://pith.science/pith/25Z722WALUQLIGH6A5EKPPK7JG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25Z722WALUQLIGH6A5EKPPK7JG/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-25T18:28:32Z","links":{"resolver":"https://pith.science/pith/25Z722WALUQLIGH6A5EKPPK7JG","bundle":"https://pith.science/pith/25Z722WALUQLIGH6A5EKPPK7JG/bundle.json","state":"https://pith.science/pith/25Z722WALUQLIGH6A5EKPPK7JG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25Z722WALUQLIGH6A5EKPPK7JG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:25Z722WALUQLIGH6A5EKPPK7JG","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":"8407d84c421609d4d3e774912e002307d6f7fd3bf77542cf3068f4d403f6fce1","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-10T08:53:19Z","title_canon_sha256":"d609ce041cc45f5ae3879b4177b83cbc0d3affeb000340a15881db7868b5e1d5"},"schema_version":"1.0","source":{"id":"1901.03060","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03060","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03060v2","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03060","created_at":"2026-05-17T23:56:33Z"},{"alias_kind":"pith_short_12","alias_value":"25Z722WALUQL","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"25Z722WALUQLIGH6","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"25Z722WA","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:04267390433603c2e35b06abc63bf23329ab946221a05e7e4e430fe23b680076","target":"graph","created_at":"2026-05-17T23:56:33Z","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":"Recently, deep supervised hashing methods have become popular for large-scale image retrieval task. To preserve the semantic similarity notion between examples, they typically utilize the pairwise supervision or the triplet supervised information for hash learning. However, these methods usually ignore the semantic class information which can help the improvement of the semantic discriminative ability of hash codes. In this paper, we propose a novel hierarchy neighborhood discriminative hashing method. Specifically, we construct a bipartite graph to build coarse semantic neighbourhood relation","authors_text":"Fanman Meng, Hongliang Li, King Ngi Ngan, Lei Ma, Qingbo Wu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-10T08:53:19Z","title":"Hierarchy Neighborhood Discriminative Hashing for An Unified View of Single-Label and Multi-Label Image retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03060","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:2bf9ab5e7c2d90ea74f15c189a4943992ca156acfce2370ade6742f2cf332d62","target":"record","created_at":"2026-05-17T23:56:33Z","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":"8407d84c421609d4d3e774912e002307d6f7fd3bf77542cf3068f4d403f6fce1","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-10T08:53:19Z","title_canon_sha256":"d609ce041cc45f5ae3879b4177b83cbc0d3affeb000340a15881db7868b5e1d5"},"schema_version":"1.0","source":{"id":"1901.03060","kind":"arxiv","version":2}},"canonical_sha256":"d773fd6ac05d20b418fe0748a7bd5f49a4296b998803f2ab36d09b672f067a0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d773fd6ac05d20b418fe0748a7bd5f49a4296b998803f2ab36d09b672f067a0a","first_computed_at":"2026-05-17T23:56:33.138700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:33.138700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7O4lB/mAC2HW6GwBPeibehnxdTeoqqhwvaWTgVFYA2DgJIebI01mNTD0EwRQvrMOmbv9RlNLUvg0RnUlCQPZAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:33.139173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03060","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bf9ab5e7c2d90ea74f15c189a4943992ca156acfce2370ade6742f2cf332d62","sha256:04267390433603c2e35b06abc63bf23329ab946221a05e7e4e430fe23b680076"],"state_sha256":"797a7615b026cfa3437c376ee65bbd736a904811a53a0a94a827ff4accfa6115"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QjMfTu4tfBOkz2k2K8u45irH4RfuVavJl0DC18Mlvg1cmdxA0f17oUuU4Ue9aOhsMtzDyEaJh+jI/qkwC5Q5AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:28:32.273989Z","bundle_sha256":"8b0356c4bfeebf40838ae0ea37e7cb5e21a0cfc25a58e3036ec87d243ac5a644"}}