{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EQE5CS3PSQDCR7WKL54R274AYO","short_pith_number":"pith:EQE5CS3P","canonical_record":{"source":{"id":"1603.02844","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-09T11:10:12Z","cross_cats_sorted":[],"title_canon_sha256":"77a546c9d81880bf1c65340ec6ecc8f87591a8f49c59045c04f32990c8627ca6","abstract_canon_sha256":"cdbab0c7a74e1552d536cfdc75f135f83569e167f3202a615c9b808dacab4529"},"schema_version":"1.0"},"canonical_sha256":"2409d14b6f940628feca5f791d7f80c398ef7afdd9fad88f4e261cccb5789428","source":{"kind":"arxiv","id":"1603.02844","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02844","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02844v2","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02844","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"pith_short_12","alias_value":"EQE5CS3PSQDC","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EQE5CS3PSQDCR7WK","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EQE5CS3P","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EQE5CS3PSQDCR7WKL54R274AYO","target":"record","payload":{"canonical_record":{"source":{"id":"1603.02844","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-09T11:10:12Z","cross_cats_sorted":[],"title_canon_sha256":"77a546c9d81880bf1c65340ec6ecc8f87591a8f49c59045c04f32990c8627ca6","abstract_canon_sha256":"cdbab0c7a74e1552d536cfdc75f135f83569e167f3202a615c9b808dacab4529"},"schema_version":"1.0"},"canonical_sha256":"2409d14b6f940628feca5f791d7f80c398ef7afdd9fad88f4e261cccb5789428","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:14.665268Z","signature_b64":"1SHXzCWqeOCEvXJOLuc2YCEOV83A6mljjI7XkzXAmZm9m0515h0zP4LK8fe/6EvpqamUq343PdienSN0SZJ2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2409d14b6f940628feca5f791d7f80c398ef7afdd9fad88f4e261cccb5789428","last_reissued_at":"2026-05-18T01:10:14.664780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:14.664780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.02844","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-18T01:10:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qe3rOhSidb1VSK6ndhLsjCqrDLjOV0YguTBBbzstvc+9L6yH7Vj+g01mvMIRMzsEjnC6clTHK4nk4MC+UE+4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:07:52.757382Z"},"content_sha256":"1e6c23062a3ead3845a78e05681b657cd6b5588b099b75ccf25bcaa785ed06b4","schema_version":"1.0","event_id":"sha256:1e6c23062a3ead3845a78e05681b657cd6b5588b099b75ccf25bcaa785ed06b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EQE5CS3PSQDCR7WKL54R274AYO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Training of Triplet-based Deep Binary Embedding Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bohan Zhuang, Chunhua Shen, Guosheng Lin, Ian Reid","submitted_at":"2016-03-09T11:10:12Z","abstract_excerpt":"In this paper, we aim to learn a mapping (or embedding) from images to a compact binary space in which Hamming distances correspond to a ranking measure for the image retrieval task.\n  We make use of a triplet loss because this has been shown to be most effective for ranking problems.\n  However, training in previous works can be prohibitively expensive due to the fact that optimization is directly performed on the triplet space, where the number of possible triplets for training is cubic in the number of training examples.\n  To address this issue, we propose to formulate high-order binary code"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02844","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-18T01:10:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4OMtXvmtVg99XRJORoGJvh+ynz2E7bfX83/uGmRFz8cVRVBYmbBKBmTsAzfx0dopIP5ahO+ErpMb+7ynurhbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:07:52.758111Z"},"content_sha256":"3251748b59c9f9b56a1e0e6ec2afea4cb421a4c2f4048e1174d68f004b20ee16","schema_version":"1.0","event_id":"sha256:3251748b59c9f9b56a1e0e6ec2afea4cb421a4c2f4048e1174d68f004b20ee16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQE5CS3PSQDCR7WKL54R274AYO/bundle.json","state_url":"https://pith.science/pith/EQE5CS3PSQDCR7WKL54R274AYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQE5CS3PSQDCR7WKL54R274AYO/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-26T07:07:52Z","links":{"resolver":"https://pith.science/pith/EQE5CS3PSQDCR7WKL54R274AYO","bundle":"https://pith.science/pith/EQE5CS3PSQDCR7WKL54R274AYO/bundle.json","state":"https://pith.science/pith/EQE5CS3PSQDCR7WKL54R274AYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQE5CS3PSQDCR7WKL54R274AYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EQE5CS3PSQDCR7WKL54R274AYO","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":"cdbab0c7a74e1552d536cfdc75f135f83569e167f3202a615c9b808dacab4529","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-09T11:10:12Z","title_canon_sha256":"77a546c9d81880bf1c65340ec6ecc8f87591a8f49c59045c04f32990c8627ca6"},"schema_version":"1.0","source":{"id":"1603.02844","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02844","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02844v2","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02844","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"pith_short_12","alias_value":"EQE5CS3PSQDC","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EQE5CS3PSQDCR7WK","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EQE5CS3P","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:3251748b59c9f9b56a1e0e6ec2afea4cb421a4c2f4048e1174d68f004b20ee16","target":"graph","created_at":"2026-05-18T01:10:14Z","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":"In this paper, we aim to learn a mapping (or embedding) from images to a compact binary space in which Hamming distances correspond to a ranking measure for the image retrieval task.\n  We make use of a triplet loss because this has been shown to be most effective for ranking problems.\n  However, training in previous works can be prohibitively expensive due to the fact that optimization is directly performed on the triplet space, where the number of possible triplets for training is cubic in the number of training examples.\n  To address this issue, we propose to formulate high-order binary code","authors_text":"Bohan Zhuang, Chunhua Shen, Guosheng Lin, Ian Reid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-09T11:10:12Z","title":"Fast Training of Triplet-based Deep Binary Embedding Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02844","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:1e6c23062a3ead3845a78e05681b657cd6b5588b099b75ccf25bcaa785ed06b4","target":"record","created_at":"2026-05-18T01:10:14Z","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":"cdbab0c7a74e1552d536cfdc75f135f83569e167f3202a615c9b808dacab4529","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-09T11:10:12Z","title_canon_sha256":"77a546c9d81880bf1c65340ec6ecc8f87591a8f49c59045c04f32990c8627ca6"},"schema_version":"1.0","source":{"id":"1603.02844","kind":"arxiv","version":2}},"canonical_sha256":"2409d14b6f940628feca5f791d7f80c398ef7afdd9fad88f4e261cccb5789428","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2409d14b6f940628feca5f791d7f80c398ef7afdd9fad88f4e261cccb5789428","first_computed_at":"2026-05-18T01:10:14.664780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:14.664780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1SHXzCWqeOCEvXJOLuc2YCEOV83A6mljjI7XkzXAmZm9m0515h0zP4LK8fe/6EvpqamUq343PdienSN0SZJ2CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:14.665268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02844","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e6c23062a3ead3845a78e05681b657cd6b5588b099b75ccf25bcaa785ed06b4","sha256:3251748b59c9f9b56a1e0e6ec2afea4cb421a4c2f4048e1174d68f004b20ee16"],"state_sha256":"c3f7a9f37406a13ebca0c36cda84327b68704168358519f9c58974ddf567e6ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XcsQrMDRlAPHy/3hZM1CXFtqzRoKNltwBw3BlADDSJ2ZOK8VzIr6TuH+lonolYO/7jbFBHbloHpeBwj9+XxlDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:07:52.762079Z","bundle_sha256":"3f80d885f687cbf686ff9880993b739781dcbba0772108366588da9845fddc05"}}