{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3PHXJTSJXZ3LGPGNELZCN7FWJB","short_pith_number":"pith:3PHXJTSJ","canonical_record":{"source":{"id":"1508.04535","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-08-19T06:26:34Z","cross_cats_sorted":[],"title_canon_sha256":"b9d11cbd49b05abfb81bf046f0388d5ad00c8654281ec4dbef040dd91d363bcd","abstract_canon_sha256":"cd820bf035cea958dc2c62cd69f3296c4679539c3e721585da2c519938f351a2"},"schema_version":"1.0"},"canonical_sha256":"dbcf74ce49be76b33ccd22f226fcb6484aafa248b180c7af70c2eebb10eaaa1c","source":{"kind":"arxiv","id":"1508.04535","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04535","created_at":"2026-05-18T01:28:46Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04535v2","created_at":"2026-05-18T01:28:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04535","created_at":"2026-05-18T01:28:46Z"},{"alias_kind":"pith_short_12","alias_value":"3PHXJTSJXZ3L","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3PHXJTSJXZ3LGPGN","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3PHXJTSJ","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3PHXJTSJXZ3LGPGNELZCN7FWJB","target":"record","payload":{"canonical_record":{"source":{"id":"1508.04535","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-08-19T06:26:34Z","cross_cats_sorted":[],"title_canon_sha256":"b9d11cbd49b05abfb81bf046f0388d5ad00c8654281ec4dbef040dd91d363bcd","abstract_canon_sha256":"cd820bf035cea958dc2c62cd69f3296c4679539c3e721585da2c519938f351a2"},"schema_version":"1.0"},"canonical_sha256":"dbcf74ce49be76b33ccd22f226fcb6484aafa248b180c7af70c2eebb10eaaa1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:46.846808Z","signature_b64":"EbioBxTn5eMSqy0fCjC/ErziRnEz7xCpQ7R3VzhyNGbvrs3MgYc4STSCWv3kZxTNdkRxb/mOVd+D77QkuTcpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbcf74ce49be76b33ccd22f226fcb6484aafa248b180c7af70c2eebb10eaaa1c","last_reissued_at":"2026-05-18T01:28:46.846157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:46.846157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.04535","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:28:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3BViVSx7c/A57BRVK2qpzPVCsyZVNyHd61XwG7r+dCyJdGzIH876/Pg5UGm9lulP5CWqJiPRZDpzuT4azptwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:11:54.116387Z"},"content_sha256":"57f8a996eddb5a709e398c7f2270a1b274f35402722d8bbfedd63a1d85b6efe9","schema_version":"1.0","event_id":"sha256:57f8a996eddb5a709e398c7f2270a1b274f35402722d8bbfedd63a1d85b6efe9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3PHXJTSJXZ3LGPGNELZCN7FWJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bit-Scalable Deep Hashing with Regularized Similarity Learning for Image Retrieval and Person Re-identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Lei Zhang, Liang Lin, Ruimao Zhang, Rui Zhang, Wangmeng Zuo","submitted_at":"2015-08-19T06:26:34Z","abstract_excerpt":"Extracting informative image features and learning effective approximate hashing functions are two crucial steps in image retrieval . Conventional methods often study these two steps separately, e.g., learning hash functions from a predefined hand-crafted feature space. Meanwhile, the bit lengths of output hashing codes are preset in most previous methods, neglecting the significance level of different bits and restricting their practical flexibility. To address these issues, we propose a supervised learning framework to generate compact and bit-scalable hashing codes directly from raw images."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04535","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:28:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6dDRivPJPxfGnV+4gOyWvMcDVxXTXqeMKw4Eo0VmWwQg2OHvxIFUb2UKuz3DERF5qkdf96lOSfjw0Z5yRe8tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:11:54.117107Z"},"content_sha256":"a80785813e1f93c6b69b1739ca135cbe4f67bbd014e4ea8df3c0e7440108874c","schema_version":"1.0","event_id":"sha256:a80785813e1f93c6b69b1739ca135cbe4f67bbd014e4ea8df3c0e7440108874c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3PHXJTSJXZ3LGPGNELZCN7FWJB/bundle.json","state_url":"https://pith.science/pith/3PHXJTSJXZ3LGPGNELZCN7FWJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3PHXJTSJXZ3LGPGNELZCN7FWJB/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-08T21:11:54Z","links":{"resolver":"https://pith.science/pith/3PHXJTSJXZ3LGPGNELZCN7FWJB","bundle":"https://pith.science/pith/3PHXJTSJXZ3LGPGNELZCN7FWJB/bundle.json","state":"https://pith.science/pith/3PHXJTSJXZ3LGPGNELZCN7FWJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3PHXJTSJXZ3LGPGNELZCN7FWJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3PHXJTSJXZ3LGPGNELZCN7FWJB","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":"cd820bf035cea958dc2c62cd69f3296c4679539c3e721585da2c519938f351a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-08-19T06:26:34Z","title_canon_sha256":"b9d11cbd49b05abfb81bf046f0388d5ad00c8654281ec4dbef040dd91d363bcd"},"schema_version":"1.0","source":{"id":"1508.04535","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04535","created_at":"2026-05-18T01:28:46Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04535v2","created_at":"2026-05-18T01:28:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04535","created_at":"2026-05-18T01:28:46Z"},{"alias_kind":"pith_short_12","alias_value":"3PHXJTSJXZ3L","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3PHXJTSJXZ3LGPGN","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3PHXJTSJ","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:a80785813e1f93c6b69b1739ca135cbe4f67bbd014e4ea8df3c0e7440108874c","target":"graph","created_at":"2026-05-18T01:28:46Z","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":"Extracting informative image features and learning effective approximate hashing functions are two crucial steps in image retrieval . Conventional methods often study these two steps separately, e.g., learning hash functions from a predefined hand-crafted feature space. Meanwhile, the bit lengths of output hashing codes are preset in most previous methods, neglecting the significance level of different bits and restricting their practical flexibility. To address these issues, we propose a supervised learning framework to generate compact and bit-scalable hashing codes directly from raw images.","authors_text":"Lei Zhang, Liang Lin, Ruimao Zhang, Rui Zhang, Wangmeng Zuo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-08-19T06:26:34Z","title":"Bit-Scalable Deep Hashing with Regularized Similarity Learning for Image Retrieval and Person Re-identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04535","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:57f8a996eddb5a709e398c7f2270a1b274f35402722d8bbfedd63a1d85b6efe9","target":"record","created_at":"2026-05-18T01:28:46Z","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":"cd820bf035cea958dc2c62cd69f3296c4679539c3e721585da2c519938f351a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-08-19T06:26:34Z","title_canon_sha256":"b9d11cbd49b05abfb81bf046f0388d5ad00c8654281ec4dbef040dd91d363bcd"},"schema_version":"1.0","source":{"id":"1508.04535","kind":"arxiv","version":2}},"canonical_sha256":"dbcf74ce49be76b33ccd22f226fcb6484aafa248b180c7af70c2eebb10eaaa1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbcf74ce49be76b33ccd22f226fcb6484aafa248b180c7af70c2eebb10eaaa1c","first_computed_at":"2026-05-18T01:28:46.846157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:46.846157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EbioBxTn5eMSqy0fCjC/ErziRnEz7xCpQ7R3VzhyNGbvrs3MgYc4STSCWv3kZxTNdkRxb/mOVd+D77QkuTcpBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:46.846808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04535","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57f8a996eddb5a709e398c7f2270a1b274f35402722d8bbfedd63a1d85b6efe9","sha256:a80785813e1f93c6b69b1739ca135cbe4f67bbd014e4ea8df3c0e7440108874c"],"state_sha256":"d0d87aee6811c4d4534cb4edec7a5ae9ac97088611401752b1e8a7fb52509ea2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5uSjscXEdkiAH21w5Vt4biK2Lu6v8hp6bV3AV0uRSArJbrsuOrBcT+77n/pJgEEAdml1nBtVG9XhtbVbn8duBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:11:54.121561Z","bundle_sha256":"f0768a7ddfd208fd9e1ff96b11ba89c5cba2e6f4cd057ec46d32df6d5988c4e5"}}