{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4X65NYBNK4FSFAIUGJTCCCBV4A","short_pith_number":"pith:4X65NYBN","canonical_record":{"source":{"id":"1710.06993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-19T02:51:12Z","cross_cats_sorted":[],"title_canon_sha256":"8753284a8a0d033d3668f6baa842a8bcbfe006616cb3e5be15c0dd6d4085ead3","abstract_canon_sha256":"2b73649b89f7fc5ff46fc6e9e9d5528b3387f815f17ceab77fe0e46892924774"},"schema_version":"1.0"},"canonical_sha256":"e5fdd6e02d570b2281143266210835e039d92943a38d4c7889b41129ca282c95","source":{"kind":"arxiv","id":"1710.06993","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06993","created_at":"2026-05-18T00:32:27Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06993v1","created_at":"2026-05-18T00:32:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06993","created_at":"2026-05-18T00:32:27Z"},{"alias_kind":"pith_short_12","alias_value":"4X65NYBNK4FS","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4X65NYBNK4FSFAIU","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4X65NYBN","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4X65NYBNK4FSFAIUGJTCCCBV4A","target":"record","payload":{"canonical_record":{"source":{"id":"1710.06993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-19T02:51:12Z","cross_cats_sorted":[],"title_canon_sha256":"8753284a8a0d033d3668f6baa842a8bcbfe006616cb3e5be15c0dd6d4085ead3","abstract_canon_sha256":"2b73649b89f7fc5ff46fc6e9e9d5528b3387f815f17ceab77fe0e46892924774"},"schema_version":"1.0"},"canonical_sha256":"e5fdd6e02d570b2281143266210835e039d92943a38d4c7889b41129ca282c95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:27.476220Z","signature_b64":"xinZpORbOGzbTAlXMMovFzqBPF9JaPgwlIPx2YOL3uBtWqSbR01etgmQFLkCHaK5QOHOv1pCPnymu9tEbjmCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5fdd6e02d570b2281143266210835e039d92943a38d4c7889b41129ca282c95","last_reissued_at":"2026-05-18T00:32:27.475504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:27.475504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.06993","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-18T00:32:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1g6Mbfdgi7NcwS2Oj/sqzwQ64VIVhWT1kqZ6qrdQWhSTM73Ewg354gRuJLDH8AON2JDx8c37EmSaw4KSvgKvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:20:34.406226Z"},"content_sha256":"73a933c77291105d84f340e3dd4374aabf076cf31e0b3ebe9491bbeadefec58f","schema_version":"1.0","event_id":"sha256:73a933c77291105d84f340e3dd4374aabf076cf31e0b3ebe9491bbeadefec58f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4X65NYBNK4FSFAIUGJTCCCBV4A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Search in Hamming Space using Deep Multi-Index Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hanjiang Lai, Yan Pan","submitted_at":"2017-10-19T02:51:12Z","abstract_excerpt":"Similarity-preserving hashing is a widely-used method for nearest neighbour search in large-scale image retrieval tasks. There has been considerable research on generating efficient image representation via the deep-network-based hashing methods. However, the issue of efficient searching in the deep representation space remains largely unsolved. To this end, we propose a simple yet efficient deep-network-based multi-index hashing method for simultaneously learning the powerful image representation and the efficient searching. To achieve these two goals, we introduce the multi-index hashing (MI"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06993","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-18T00:32:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XTo8qQnCPfzI5sQN1+JIhesfv3djfjmmviaM0Fsu8MKtoca+S3KSbMDskKWBMeGI4B0mrc9UB3Wb+E69VADvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:20:34.407156Z"},"content_sha256":"b1cba23a3d04f853c81b73f6d53648b190e7e65110bce03da2eb76f53421755a","schema_version":"1.0","event_id":"sha256:b1cba23a3d04f853c81b73f6d53648b190e7e65110bce03da2eb76f53421755a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4X65NYBNK4FSFAIUGJTCCCBV4A/bundle.json","state_url":"https://pith.science/pith/4X65NYBNK4FSFAIUGJTCCCBV4A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4X65NYBNK4FSFAIUGJTCCCBV4A/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-06-06T08:20:34Z","links":{"resolver":"https://pith.science/pith/4X65NYBNK4FSFAIUGJTCCCBV4A","bundle":"https://pith.science/pith/4X65NYBNK4FSFAIUGJTCCCBV4A/bundle.json","state":"https://pith.science/pith/4X65NYBNK4FSFAIUGJTCCCBV4A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4X65NYBNK4FSFAIUGJTCCCBV4A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4X65NYBNK4FSFAIUGJTCCCBV4A","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":"2b73649b89f7fc5ff46fc6e9e9d5528b3387f815f17ceab77fe0e46892924774","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-19T02:51:12Z","title_canon_sha256":"8753284a8a0d033d3668f6baa842a8bcbfe006616cb3e5be15c0dd6d4085ead3"},"schema_version":"1.0","source":{"id":"1710.06993","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.06993","created_at":"2026-05-18T00:32:27Z"},{"alias_kind":"arxiv_version","alias_value":"1710.06993v1","created_at":"2026-05-18T00:32:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06993","created_at":"2026-05-18T00:32:27Z"},{"alias_kind":"pith_short_12","alias_value":"4X65NYBNK4FS","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4X65NYBNK4FSFAIU","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4X65NYBN","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:b1cba23a3d04f853c81b73f6d53648b190e7e65110bce03da2eb76f53421755a","target":"graph","created_at":"2026-05-18T00:32:27Z","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":"Similarity-preserving hashing is a widely-used method for nearest neighbour search in large-scale image retrieval tasks. There has been considerable research on generating efficient image representation via the deep-network-based hashing methods. However, the issue of efficient searching in the deep representation space remains largely unsolved. To this end, we propose a simple yet efficient deep-network-based multi-index hashing method for simultaneously learning the powerful image representation and the efficient searching. To achieve these two goals, we introduce the multi-index hashing (MI","authors_text":"Hanjiang Lai, Yan Pan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-19T02:51:12Z","title":"Improved Search in Hamming Space using Deep Multi-Index Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06993","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:73a933c77291105d84f340e3dd4374aabf076cf31e0b3ebe9491bbeadefec58f","target":"record","created_at":"2026-05-18T00:32:27Z","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":"2b73649b89f7fc5ff46fc6e9e9d5528b3387f815f17ceab77fe0e46892924774","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-19T02:51:12Z","title_canon_sha256":"8753284a8a0d033d3668f6baa842a8bcbfe006616cb3e5be15c0dd6d4085ead3"},"schema_version":"1.0","source":{"id":"1710.06993","kind":"arxiv","version":1}},"canonical_sha256":"e5fdd6e02d570b2281143266210835e039d92943a38d4c7889b41129ca282c95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5fdd6e02d570b2281143266210835e039d92943a38d4c7889b41129ca282c95","first_computed_at":"2026-05-18T00:32:27.475504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:27.475504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xinZpORbOGzbTAlXMMovFzqBPF9JaPgwlIPx2YOL3uBtWqSbR01etgmQFLkCHaK5QOHOv1pCPnymu9tEbjmCBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:27.476220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.06993","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73a933c77291105d84f340e3dd4374aabf076cf31e0b3ebe9491bbeadefec58f","sha256:b1cba23a3d04f853c81b73f6d53648b190e7e65110bce03da2eb76f53421755a"],"state_sha256":"a5557bb1e91e00bb1bd1d0d9cbc277cea5fa7d1c7b79aaa09b690f3d1b2b3967"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KE4SNF6knAsX1XtWJHyJZ6K5PY8TFbbEfEq9kQmqAN+/fDrQ6AdrlW6iFeDw05J9a1sXt3wzzSJPulEJY2i4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:20:34.411746Z","bundle_sha256":"cdf0133cd5bbc500987a49118b8c6366bad866888bb4e9170827f968123eb0a8"}}