{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BGPGU45D2T5GIC6UGGOKFZ6RDW","short_pith_number":"pith:BGPGU45D","canonical_record":{"source":{"id":"1612.03900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-12T20:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"5a3e4b74229963934642e3dcf43a2f36175c06141596cafc1b65dfef5de29686","abstract_canon_sha256":"b6aec936743d4393a91aaf5f95210f7201f5be9c8bbb0635815afb8771ccad6c"},"schema_version":"1.0"},"canonical_sha256":"099e6a73a3d4fa640bd4319ca2e7d11da15d1fa9e2f97a1034d5c3eae35f378f","source":{"kind":"arxiv","id":"1612.03900","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03900","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03900v1","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03900","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"BGPGU45D2T5G","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BGPGU45D2T5GIC6U","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BGPGU45D","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BGPGU45D2T5GIC6UGGOKFZ6RDW","target":"record","payload":{"canonical_record":{"source":{"id":"1612.03900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-12T20:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"5a3e4b74229963934642e3dcf43a2f36175c06141596cafc1b65dfef5de29686","abstract_canon_sha256":"b6aec936743d4393a91aaf5f95210f7201f5be9c8bbb0635815afb8771ccad6c"},"schema_version":"1.0"},"canonical_sha256":"099e6a73a3d4fa640bd4319ca2e7d11da15d1fa9e2f97a1034d5c3eae35f378f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:18.097442Z","signature_b64":"JnUsbDgLzcdsU2LzZlQZ+YgsrTLxnQRPuTwArq663WkgNEsRJMDKHGoV+peKXGuISiZzlDdZ2LP9LeTh1sDuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"099e6a73a3d4fa640bd4319ca2e7d11da15d1fa9e2f97a1034d5c3eae35f378f","last_reissued_at":"2026-05-18T00:55:18.096892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:18.096892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.03900","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:55:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KgSoNR1iDT4lFyU4y8AzpTP8P6qpgCqiAVIXeY04hr2XTKMO+lyaNuFQzLB9HA+Xx3IV1gl2lkxx8IJpNpdqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:51:20.108140Z"},"content_sha256":"59cbf3e3d717d0f3102043f050fd056d22963526c82a7989047c886365b9f492","schema_version":"1.0","event_id":"sha256:59cbf3e3d717d0f3102043f050fd056d22963526c82a7989047c886365b9f492"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BGPGU45D2T5GIC6UGGOKFZ6RDW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Supervised Hashing with Triplet Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kris M. Kitani, Xiaofang Wang, Yi Shi","submitted_at":"2016-12-12T20:56:38Z","abstract_excerpt":"Hashing is one of the most popular and powerful approximate nearest neighbor search techniques for large-scale image retrieval. Most traditional hashing methods first represent images as off-the-shelf visual features and then produce hashing codes in a separate stage. However, off-the-shelf visual features may not be optimally compatible with the hash code learning procedure, which may result in sub-optimal hash codes. Recently, deep hashing methods have been proposed to simultaneously learn image features and hash codes using deep neural networks and have shown superior performance over tradi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03900","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:55:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fA/zeQTLi04rtCZpN5cUOK6CuWxW/NqWQQMu9Lh8Cu9Zkeyg+c8Ubnbwt23oP5FR56cIqRMrWDNNbw5KUNmgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T10:51:20.108508Z"},"content_sha256":"49c33891f4d6dbc90782621ea375f15f210a55fc8a00a7b8de28b1676915be2c","schema_version":"1.0","event_id":"sha256:49c33891f4d6dbc90782621ea375f15f210a55fc8a00a7b8de28b1676915be2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BGPGU45D2T5GIC6UGGOKFZ6RDW/bundle.json","state_url":"https://pith.science/pith/BGPGU45D2T5GIC6UGGOKFZ6RDW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BGPGU45D2T5GIC6UGGOKFZ6RDW/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-04T10:51:20Z","links":{"resolver":"https://pith.science/pith/BGPGU45D2T5GIC6UGGOKFZ6RDW","bundle":"https://pith.science/pith/BGPGU45D2T5GIC6UGGOKFZ6RDW/bundle.json","state":"https://pith.science/pith/BGPGU45D2T5GIC6UGGOKFZ6RDW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BGPGU45D2T5GIC6UGGOKFZ6RDW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BGPGU45D2T5GIC6UGGOKFZ6RDW","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":"b6aec936743d4393a91aaf5f95210f7201f5be9c8bbb0635815afb8771ccad6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-12T20:56:38Z","title_canon_sha256":"5a3e4b74229963934642e3dcf43a2f36175c06141596cafc1b65dfef5de29686"},"schema_version":"1.0","source":{"id":"1612.03900","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03900","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03900v1","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03900","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"BGPGU45D2T5G","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BGPGU45D2T5GIC6U","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BGPGU45D","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:49c33891f4d6dbc90782621ea375f15f210a55fc8a00a7b8de28b1676915be2c","target":"graph","created_at":"2026-05-18T00:55:18Z","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":"Hashing is one of the most popular and powerful approximate nearest neighbor search techniques for large-scale image retrieval. Most traditional hashing methods first represent images as off-the-shelf visual features and then produce hashing codes in a separate stage. However, off-the-shelf visual features may not be optimally compatible with the hash code learning procedure, which may result in sub-optimal hash codes. Recently, deep hashing methods have been proposed to simultaneously learn image features and hash codes using deep neural networks and have shown superior performance over tradi","authors_text":"Kris M. Kitani, Xiaofang Wang, Yi Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-12T20:56:38Z","title":"Deep Supervised Hashing with Triplet Labels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03900","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:59cbf3e3d717d0f3102043f050fd056d22963526c82a7989047c886365b9f492","target":"record","created_at":"2026-05-18T00:55:18Z","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":"b6aec936743d4393a91aaf5f95210f7201f5be9c8bbb0635815afb8771ccad6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-12T20:56:38Z","title_canon_sha256":"5a3e4b74229963934642e3dcf43a2f36175c06141596cafc1b65dfef5de29686"},"schema_version":"1.0","source":{"id":"1612.03900","kind":"arxiv","version":1}},"canonical_sha256":"099e6a73a3d4fa640bd4319ca2e7d11da15d1fa9e2f97a1034d5c3eae35f378f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"099e6a73a3d4fa640bd4319ca2e7d11da15d1fa9e2f97a1034d5c3eae35f378f","first_computed_at":"2026-05-18T00:55:18.096892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:18.096892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JnUsbDgLzcdsU2LzZlQZ+YgsrTLxnQRPuTwArq663WkgNEsRJMDKHGoV+peKXGuISiZzlDdZ2LP9LeTh1sDuDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:18.097442Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03900","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59cbf3e3d717d0f3102043f050fd056d22963526c82a7989047c886365b9f492","sha256:49c33891f4d6dbc90782621ea375f15f210a55fc8a00a7b8de28b1676915be2c"],"state_sha256":"44b5682243db15f66bb912792f133c383ad4b2b82d3d790c23e8f0a1146bdaed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+TVFquyhddAKi2jM5N2jimisj6ZaXrCMY162MbiCC9UgT6VCJTFVOdfV16Z/hoH1k6sxUm7gLk5YmUVd1pQKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T10:51:20.110483Z","bundle_sha256":"8273a7a3e3478791230ea87b001ebf1856e85cb4e1e8f84287078a14b25d67bb"}}