{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CJTKRP6CRNX2BTPBYNHAGC6V56","short_pith_number":"pith:CJTKRP6C","canonical_record":{"source":{"id":"1903.00252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-01T11:43:31Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"57adacc4ca05dc47dc14b7b0163baa6ad5cca9561411c748142b17e21f28bb49","abstract_canon_sha256":"359d2977e95b6a8d4fbc1a889df9a838e62856f1be22cf7b31584218c28796c4"},"schema_version":"1.0"},"canonical_sha256":"1266a8bfc28b6fa0cde1c34e030bd5efa06f3ff155fe89107c72d09994441fd7","source":{"kind":"arxiv","id":"1903.00252","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00252","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00252v1","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00252","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"pith_short_12","alias_value":"CJTKRP6CRNX2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CJTKRP6CRNX2BTPB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CJTKRP6C","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CJTKRP6CRNX2BTPBYNHAGC6V56","target":"record","payload":{"canonical_record":{"source":{"id":"1903.00252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-01T11:43:31Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"57adacc4ca05dc47dc14b7b0163baa6ad5cca9561411c748142b17e21f28bb49","abstract_canon_sha256":"359d2977e95b6a8d4fbc1a889df9a838e62856f1be22cf7b31584218c28796c4"},"schema_version":"1.0"},"canonical_sha256":"1266a8bfc28b6fa0cde1c34e030bd5efa06f3ff155fe89107c72d09994441fd7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:20.335669Z","signature_b64":"QKDhy1lcCj9BuSMFVKDC9nfZDBjB+z9qS3TzZBI7vgMBDUtq+oanCAayGtGQ7a1iY1bvXEFZgLF+w7X7BgFECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1266a8bfc28b6fa0cde1c34e030bd5efa06f3ff155fe89107c72d09994441fd7","last_reissued_at":"2026-05-17T23:52:20.335009Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:20.335009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.00252","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:52:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"In+c5Gv7gPgI2Kkj2KMw5ayNh9hBkBeaS3udCjIqsoPWVre0EpB9Q6iamhe5vEh5sGmPiYdHSPF6yhocxzOoDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:23:04.181113Z"},"content_sha256":"626807fcb28cd06adef8e76ed44699b17f682cbfd41faf2fd447e0312a17c400","schema_version":"1.0","event_id":"sha256:626807fcb28cd06adef8e76ed44699b17f682cbfd41faf2fd447e0312a17c400"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CJTKRP6CRNX2BTPBYNHAGC6V56","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Projection Guided Transfer Hashing for Image Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"cs.IR","authors_text":"Ji Liu, Lei Zhang","submitted_at":"2019-03-01T11:43:31Z","abstract_excerpt":"Recently, learning to hash has been widely studied for image retrieval thanks to the computation and storage efficiency of binary codes. For most existing learning to hash methods, sufficient training images are required and used to learn precise hashing codes. However, in some real-world applications, there are not always sufficient training images in the domain of interest. In addition, some existing supervised approaches need a amount of labeled data, which is an expensive process in term of time, label and human expertise. To handle such problems, inspired by transfer learning, we propose "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00252","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:52:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vEu0J0uRYscNY2MABL+F51np/KGRFgtlXcu3YggCloMJhjGJnLDojuZA0l6G7Qixoabe48VT7AqBeBJT3rnVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:23:04.181606Z"},"content_sha256":"be7f6c4c15e9d9b09b7d4dc5ae613c5628d0a8c7c89ed6e4d43cb723627ae570","schema_version":"1.0","event_id":"sha256:be7f6c4c15e9d9b09b7d4dc5ae613c5628d0a8c7c89ed6e4d43cb723627ae570"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJTKRP6CRNX2BTPBYNHAGC6V56/bundle.json","state_url":"https://pith.science/pith/CJTKRP6CRNX2BTPBYNHAGC6V56/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJTKRP6CRNX2BTPBYNHAGC6V56/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-09T06:23:04Z","links":{"resolver":"https://pith.science/pith/CJTKRP6CRNX2BTPBYNHAGC6V56","bundle":"https://pith.science/pith/CJTKRP6CRNX2BTPBYNHAGC6V56/bundle.json","state":"https://pith.science/pith/CJTKRP6CRNX2BTPBYNHAGC6V56/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJTKRP6CRNX2BTPBYNHAGC6V56/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CJTKRP6CRNX2BTPBYNHAGC6V56","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":"359d2977e95b6a8d4fbc1a889df9a838e62856f1be22cf7b31584218c28796c4","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-01T11:43:31Z","title_canon_sha256":"57adacc4ca05dc47dc14b7b0163baa6ad5cca9561411c748142b17e21f28bb49"},"schema_version":"1.0","source":{"id":"1903.00252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00252","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00252v1","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00252","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"pith_short_12","alias_value":"CJTKRP6CRNX2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CJTKRP6CRNX2BTPB","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CJTKRP6C","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:be7f6c4c15e9d9b09b7d4dc5ae613c5628d0a8c7c89ed6e4d43cb723627ae570","target":"graph","created_at":"2026-05-17T23:52:20Z","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":"Recently, learning to hash has been widely studied for image retrieval thanks to the computation and storage efficiency of binary codes. For most existing learning to hash methods, sufficient training images are required and used to learn precise hashing codes. However, in some real-world applications, there are not always sufficient training images in the domain of interest. In addition, some existing supervised approaches need a amount of labeled data, which is an expensive process in term of time, label and human expertise. To handle such problems, inspired by transfer learning, we propose ","authors_text":"Ji Liu, Lei Zhang","cross_cats":["cs.CV","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-01T11:43:31Z","title":"Optimal Projection Guided Transfer Hashing for Image Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00252","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:626807fcb28cd06adef8e76ed44699b17f682cbfd41faf2fd447e0312a17c400","target":"record","created_at":"2026-05-17T23:52:20Z","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":"359d2977e95b6a8d4fbc1a889df9a838e62856f1be22cf7b31584218c28796c4","cross_cats_sorted":["cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-03-01T11:43:31Z","title_canon_sha256":"57adacc4ca05dc47dc14b7b0163baa6ad5cca9561411c748142b17e21f28bb49"},"schema_version":"1.0","source":{"id":"1903.00252","kind":"arxiv","version":1}},"canonical_sha256":"1266a8bfc28b6fa0cde1c34e030bd5efa06f3ff155fe89107c72d09994441fd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1266a8bfc28b6fa0cde1c34e030bd5efa06f3ff155fe89107c72d09994441fd7","first_computed_at":"2026-05-17T23:52:20.335009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:20.335009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QKDhy1lcCj9BuSMFVKDC9nfZDBjB+z9qS3TzZBI7vgMBDUtq+oanCAayGtGQ7a1iY1bvXEFZgLF+w7X7BgFECA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:20.335669Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:626807fcb28cd06adef8e76ed44699b17f682cbfd41faf2fd447e0312a17c400","sha256:be7f6c4c15e9d9b09b7d4dc5ae613c5628d0a8c7c89ed6e4d43cb723627ae570"],"state_sha256":"e2e5bb028bd66a675b41ebb6b80f2fae0a8fb9522ef7f756f3e1c604e77ac016"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74gapVOwTmOOr32Q64ebath/k2yLGZiqoqnsYSf9pwhDRVCaiuGu9/AWpnUm2OnS96iZaFVRkJES3WKGpWgVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:23:04.185834Z","bundle_sha256":"3393454e176990d9c2005eda553dba293af7c4457dc7fbb6e98a1c4e7b415250"}}