{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JUI3VSRBP2JGLNIUTIBVVMQU6G","short_pith_number":"pith:JUI3VSRB","canonical_record":{"source":{"id":"1904.08623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-18T07:49:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"69d81af32b47d0fb21e1d095a8f0caf1783b95eb082066284003ff611b2d5e1b","abstract_canon_sha256":"810d0525f55d14d42fd41dd8768701fd464e589d62c3725ee6f5e79a5c53703a"},"schema_version":"1.0"},"canonical_sha256":"4d11baca217e9265b5149a035ab214f1a1597a89fcf03deaf9d00f09762955c1","source":{"kind":"arxiv","id":"1904.08623","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08623","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08623v1","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08623","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"pith_short_12","alias_value":"JUI3VSRBP2JG","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JUI3VSRBP2JGLNIU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JUI3VSRB","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JUI3VSRBP2JGLNIUTIBVVMQU6G","target":"record","payload":{"canonical_record":{"source":{"id":"1904.08623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-18T07:49:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"69d81af32b47d0fb21e1d095a8f0caf1783b95eb082066284003ff611b2d5e1b","abstract_canon_sha256":"810d0525f55d14d42fd41dd8768701fd464e589d62c3725ee6f5e79a5c53703a"},"schema_version":"1.0"},"canonical_sha256":"4d11baca217e9265b5149a035ab214f1a1597a89fcf03deaf9d00f09762955c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:13.671206Z","signature_b64":"zMb4nsQ74F71cS1sENnH4cj7uw/obmFn3klVvvLe5kMpXuwRiQY1FGWwC9GeImB5dkyz0Uq92z9Tmx4ApvdHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d11baca217e9265b5149a035ab214f1a1597a89fcf03deaf9d00f09762955c1","last_reissued_at":"2026-05-17T23:48:13.670548Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:13.670548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.08623","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:48:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2aSBEV+Jmg4t9d9FIrxEmLhW4x1U52wDcltoXydpm4Th9obzu7onMgXZw2Eyk4rjTv+PzApnO39el7b28dMxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:13:45.114951Z"},"content_sha256":"25e814f2fd1b1650dc3d6304ff7c90b157b0807521ef214728ad2052e80019d9","schema_version":"1.0","event_id":"sha256:25e814f2fd1b1650dc3d6304ff7c90b157b0807521ef214728ad2052e80019d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JUI3VSRBP2JGLNIUTIBVVMQU6G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Query-Adaptive Hash Code Ranking for Large-Scale Multi-View Visual Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Bo Lang, Cheng Deng, Dacheng Tao, Lei Huang, Xianglong Liu","submitted_at":"2019-04-18T07:49:26Z","abstract_excerpt":"Hash based nearest neighbor search has become attractive in many applications. However, the quantization in hashing usually degenerates the discriminative power when using Hamming distance ranking. Besides, for large-scale visual search, existing hashing methods cannot directly support the efficient search over the data with multiple sources, and while the literature has shown that adaptively incorporating complementary information from diverse sources or views can significantly boost the search performance. To address the problems, this paper proposes a novel and generic approach to building "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08623","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:48:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FEKMCVdUTL08TJPHjIlmn916ZZ2eyiidPEJ/jBgBbSDt+wsHNZgQd+xc2xBIGR2JnXNAoGth4EfG9b7ab7PgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:13:45.115412Z"},"content_sha256":"de8d53e3fcf7c389c89257743133a86a12dc2e6a44ac3c3e8ebb689904ccf90a","schema_version":"1.0","event_id":"sha256:de8d53e3fcf7c389c89257743133a86a12dc2e6a44ac3c3e8ebb689904ccf90a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JUI3VSRBP2JGLNIUTIBVVMQU6G/bundle.json","state_url":"https://pith.science/pith/JUI3VSRBP2JGLNIUTIBVVMQU6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JUI3VSRBP2JGLNIUTIBVVMQU6G/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-31T18:13:45Z","links":{"resolver":"https://pith.science/pith/JUI3VSRBP2JGLNIUTIBVVMQU6G","bundle":"https://pith.science/pith/JUI3VSRBP2JGLNIUTIBVVMQU6G/bundle.json","state":"https://pith.science/pith/JUI3VSRBP2JGLNIUTIBVVMQU6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JUI3VSRBP2JGLNIUTIBVVMQU6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JUI3VSRBP2JGLNIUTIBVVMQU6G","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":"810d0525f55d14d42fd41dd8768701fd464e589d62c3725ee6f5e79a5c53703a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-18T07:49:26Z","title_canon_sha256":"69d81af32b47d0fb21e1d095a8f0caf1783b95eb082066284003ff611b2d5e1b"},"schema_version":"1.0","source":{"id":"1904.08623","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08623","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08623v1","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08623","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"pith_short_12","alias_value":"JUI3VSRBP2JG","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JUI3VSRBP2JGLNIU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JUI3VSRB","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:de8d53e3fcf7c389c89257743133a86a12dc2e6a44ac3c3e8ebb689904ccf90a","target":"graph","created_at":"2026-05-17T23:48:13Z","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":"Hash based nearest neighbor search has become attractive in many applications. However, the quantization in hashing usually degenerates the discriminative power when using Hamming distance ranking. Besides, for large-scale visual search, existing hashing methods cannot directly support the efficient search over the data with multiple sources, and while the literature has shown that adaptively incorporating complementary information from diverse sources or views can significantly boost the search performance. To address the problems, this paper proposes a novel and generic approach to building ","authors_text":"Bo Lang, Cheng Deng, Dacheng Tao, Lei Huang, Xianglong Liu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-18T07:49:26Z","title":"Query-Adaptive Hash Code Ranking for Large-Scale Multi-View Visual Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08623","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:25e814f2fd1b1650dc3d6304ff7c90b157b0807521ef214728ad2052e80019d9","target":"record","created_at":"2026-05-17T23:48:13Z","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":"810d0525f55d14d42fd41dd8768701fd464e589d62c3725ee6f5e79a5c53703a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-18T07:49:26Z","title_canon_sha256":"69d81af32b47d0fb21e1d095a8f0caf1783b95eb082066284003ff611b2d5e1b"},"schema_version":"1.0","source":{"id":"1904.08623","kind":"arxiv","version":1}},"canonical_sha256":"4d11baca217e9265b5149a035ab214f1a1597a89fcf03deaf9d00f09762955c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d11baca217e9265b5149a035ab214f1a1597a89fcf03deaf9d00f09762955c1","first_computed_at":"2026-05-17T23:48:13.670548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:13.670548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zMb4nsQ74F71cS1sENnH4cj7uw/obmFn3klVvvLe5kMpXuwRiQY1FGWwC9GeImB5dkyz0Uq92z9Tmx4ApvdHBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:13.671206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.08623","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25e814f2fd1b1650dc3d6304ff7c90b157b0807521ef214728ad2052e80019d9","sha256:de8d53e3fcf7c389c89257743133a86a12dc2e6a44ac3c3e8ebb689904ccf90a"],"state_sha256":"dd59b0daeb2bc09806cfee94bdc854b5da45d3fcc962e54d2b1652df9891ec0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6CNv5BHfjf4rfR13EFMtnd17a8ewOsmOzyVRpNqLBsHW95oUX+88KI2b59Jqn7YRNPEtvZwLL+LSoTYcQB++Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:13:45.118006Z","bundle_sha256":"680492126e5803630ffa39e822ee04c78511203a6541480d803c4c84e5079988"}}