{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CGTWOOJVGXZOW7UYNOFXBZWJ3W","short_pith_number":"pith:CGTWOOJV","canonical_record":{"source":{"id":"1802.07437","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-21T06:20:59Z","cross_cats_sorted":[],"title_canon_sha256":"c36ea810d7c0a86c2c707b0c170bd2efbeb172e480247a4219afddb31f5622aa","abstract_canon_sha256":"e10b01919f723859541478eee3bb8b05848483c191a1cea3bb3eda1b27536805"},"schema_version":"1.0"},"canonical_sha256":"11a767393535f2eb7e986b8b70e6c9dda1b2cce0ac7c7352f52b96626c8dc70d","source":{"kind":"arxiv","id":"1802.07437","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07437","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07437v7","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07437","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"CGTWOOJVGXZO","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CGTWOOJVGXZOW7UY","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CGTWOOJV","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CGTWOOJVGXZOW7UYNOFXBZWJ3W","target":"record","payload":{"canonical_record":{"source":{"id":"1802.07437","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-21T06:20:59Z","cross_cats_sorted":[],"title_canon_sha256":"c36ea810d7c0a86c2c707b0c170bd2efbeb172e480247a4219afddb31f5622aa","abstract_canon_sha256":"e10b01919f723859541478eee3bb8b05848483c191a1cea3bb3eda1b27536805"},"schema_version":"1.0"},"canonical_sha256":"11a767393535f2eb7e986b8b70e6c9dda1b2cce0ac7c7352f52b96626c8dc70d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:08.695719Z","signature_b64":"vi9WVM8j7ut7K4I4FEM5+qo4oGUOq5kF/yoxGBffD9ilH4wkwcjAx2I4fAo1EZ9RaEKrm2mpDvOe2ZfmYF+3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11a767393535f2eb7e986b8b70e6c9dda1b2cce0ac7c7352f52b96626c8dc70d","last_reissued_at":"2026-05-17T23:58:08.695189Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:08.695189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.07437","source_version":7,"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:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5e5ENJcVFV2ClM0YavLnp4KxBl0/wYuhUpYA5Ns5Wz0uh949csqTFKFgPEY2UGlbH6idjmNbzPub1PiQCOgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:59:39.427580Z"},"content_sha256":"917fe74b0bbba45ad74f9fada26e1eda031f3150d524b0551344bada4451b46a","schema_version":"1.0","event_id":"sha256:917fe74b0bbba45ad74f9fada26e1eda031f3150d524b0551344bada4451b46a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CGTWOOJVGXZOW7UYNOFXBZWJ3W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary Constrained Deep Hashing Network for Image Retrieval without Manual Annotation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Dang-Khoa Le Tan, Huu Le, Ian Reid, Ngai-Man Cheung, Thanh-Toan Do, Trung Pham, Tuan Hoang","submitted_at":"2018-02-21T06:20:59Z","abstract_excerpt":"Learning compact binary codes for image retrieval task using deep neural networks has attracted increasing attention recently. However, training deep hashing networks for the task is challenging due to the binary constraints on the hash codes, the similarity preserving property, and the requirement for a vast amount of labelled images. To the best of our knowledge, none of the existing methods has tackled all of these challenges completely in a unified framework. In this work, we propose a novel end-to-end deep learning approach for the task, in which the network is trained to produce binary c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07437","kind":"arxiv","version":7},"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:58:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/IMc1mP1tetCRxLVKcR2kISZNvHG4hgpHN8hRm5UFSDxGxQk1kk8ZjWxjd5b0AV6AwEjNvOjPrN7dXbSCs4YCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:59:39.427918Z"},"content_sha256":"d268dd0648831070611b4762d6b79a0ffc076145fbf65786404dce34d8743c05","schema_version":"1.0","event_id":"sha256:d268dd0648831070611b4762d6b79a0ffc076145fbf65786404dce34d8743c05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGTWOOJVGXZOW7UYNOFXBZWJ3W/bundle.json","state_url":"https://pith.science/pith/CGTWOOJVGXZOW7UYNOFXBZWJ3W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGTWOOJVGXZOW7UYNOFXBZWJ3W/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-03T00:59:39Z","links":{"resolver":"https://pith.science/pith/CGTWOOJVGXZOW7UYNOFXBZWJ3W","bundle":"https://pith.science/pith/CGTWOOJVGXZOW7UYNOFXBZWJ3W/bundle.json","state":"https://pith.science/pith/CGTWOOJVGXZOW7UYNOFXBZWJ3W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGTWOOJVGXZOW7UYNOFXBZWJ3W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CGTWOOJVGXZOW7UYNOFXBZWJ3W","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":"e10b01919f723859541478eee3bb8b05848483c191a1cea3bb3eda1b27536805","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-21T06:20:59Z","title_canon_sha256":"c36ea810d7c0a86c2c707b0c170bd2efbeb172e480247a4219afddb31f5622aa"},"schema_version":"1.0","source":{"id":"1802.07437","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07437","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07437v7","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07437","created_at":"2026-05-17T23:58:08Z"},{"alias_kind":"pith_short_12","alias_value":"CGTWOOJVGXZO","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CGTWOOJVGXZOW7UY","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CGTWOOJV","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:d268dd0648831070611b4762d6b79a0ffc076145fbf65786404dce34d8743c05","target":"graph","created_at":"2026-05-17T23:58:08Z","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":"Learning compact binary codes for image retrieval task using deep neural networks has attracted increasing attention recently. However, training deep hashing networks for the task is challenging due to the binary constraints on the hash codes, the similarity preserving property, and the requirement for a vast amount of labelled images. To the best of our knowledge, none of the existing methods has tackled all of these challenges completely in a unified framework. In this work, we propose a novel end-to-end deep learning approach for the task, in which the network is trained to produce binary c","authors_text":"Dang-Khoa Le Tan, Huu Le, Ian Reid, Ngai-Man Cheung, Thanh-Toan Do, Trung Pham, Tuan Hoang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-21T06:20:59Z","title":"Binary Constrained Deep Hashing Network for Image Retrieval without Manual Annotation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07437","kind":"arxiv","version":7},"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:917fe74b0bbba45ad74f9fada26e1eda031f3150d524b0551344bada4451b46a","target":"record","created_at":"2026-05-17T23:58:08Z","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":"e10b01919f723859541478eee3bb8b05848483c191a1cea3bb3eda1b27536805","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-21T06:20:59Z","title_canon_sha256":"c36ea810d7c0a86c2c707b0c170bd2efbeb172e480247a4219afddb31f5622aa"},"schema_version":"1.0","source":{"id":"1802.07437","kind":"arxiv","version":7}},"canonical_sha256":"11a767393535f2eb7e986b8b70e6c9dda1b2cce0ac7c7352f52b96626c8dc70d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11a767393535f2eb7e986b8b70e6c9dda1b2cce0ac7c7352f52b96626c8dc70d","first_computed_at":"2026-05-17T23:58:08.695189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:08.695189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vi9WVM8j7ut7K4I4FEM5+qo4oGUOq5kF/yoxGBffD9ilH4wkwcjAx2I4fAo1EZ9RaEKrm2mpDvOe2ZfmYF+3Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:08.695719Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07437","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:917fe74b0bbba45ad74f9fada26e1eda031f3150d524b0551344bada4451b46a","sha256:d268dd0648831070611b4762d6b79a0ffc076145fbf65786404dce34d8743c05"],"state_sha256":"f28538d84174e795e0c66848924b61742fa10c51dc27420c7c13eec5888e4843"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4q2C+Hdg8dG1LggN4prPF2maQ6004R8bNsPQYwVTLL+NBxIDYKxB21jrdNfmJLnIh1nwbTRKkOU71ixJAuGzAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:59:39.429923Z","bundle_sha256":"f4113cf8c042adcc9f00a2386eeac007a730f8af8ff85488f82b9cd0c21bea3e"}}