{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6YQCLZNELHTU52HBUSFNKZWAE5","short_pith_number":"pith:6YQCLZNE","canonical_record":{"source":{"id":"1602.06654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-22T06:02:25Z","cross_cats_sorted":[],"title_canon_sha256":"be438242b38a31c5eec01307eda3794a11b57c6419ddfd676007bb3315cae18d","abstract_canon_sha256":"bfb7cc631bbec443a642f2e7fbef756415450c001116631638037e5f2eac53df"},"schema_version":"1.0"},"canonical_sha256":"f62025e5a459e74ee8e1a48ad566c0274204eab4944ce18f6a1fe37a81da47e9","source":{"kind":"arxiv","id":"1602.06654","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06654","created_at":"2026-05-18T01:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06654v1","created_at":"2026-05-18T01:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06654","created_at":"2026-05-18T01:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"6YQCLZNELHTU","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6YQCLZNELHTU52HB","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6YQCLZNE","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6YQCLZNELHTU52HBUSFNKZWAE5","target":"record","payload":{"canonical_record":{"source":{"id":"1602.06654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-22T06:02:25Z","cross_cats_sorted":[],"title_canon_sha256":"be438242b38a31c5eec01307eda3794a11b57c6419ddfd676007bb3315cae18d","abstract_canon_sha256":"bfb7cc631bbec443a642f2e7fbef756415450c001116631638037e5f2eac53df"},"schema_version":"1.0"},"canonical_sha256":"f62025e5a459e74ee8e1a48ad566c0274204eab4944ce18f6a1fe37a81da47e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:13.420576Z","signature_b64":"yytQWx7+t2T0fF2gueMzWvnMkyMhznIvze1wJsVBxYGmYOTMNryeJbo6+nNLZrjrLhgqIFIq4cOJBKONlZWsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f62025e5a459e74ee8e1a48ad566c0274204eab4944ce18f6a1fe37a81da47e9","last_reissued_at":"2026-05-18T01:20:13.420019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:13.420019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.06654","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-18T01:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JcXdEpvZ5LsXuxjIucoa1jG9W1gmBikvXyySZFP3ar4uah/VJkETBLX2hn6DPxW38fy8mf6AzCmBunekUst3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:22:06.638768Z"},"content_sha256":"085734df5a139ad336191d2b2510be58e0945f25abcd258c305f0813f251c09b","schema_version":"1.0","event_id":"sha256:085734df5a139ad336191d2b2510be58e0945f25abcd258c305f0813f251c09b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6YQCLZNELHTU52HBUSFNKZWAE5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structured Learning of Binary Codes with Column Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chunhua Shen, Fayao Liu, Guosheng Lin, Heng Tao Shen, Jianxin Wu","submitted_at":"2016-02-22T06:02:25Z","abstract_excerpt":"Hashing methods aim to learn a set of hash functions which map the original features to compact binary codes with similarity preserving in the Hamming space. Hashing has proven a valuable tool for large-scale information retrieval. We propose a column generation based binary code learning framework for data-dependent hash function learning. Given a set of triplets that encode the pairwise similarity comparison information, our column generation based method learns hash functions that preserve the relative comparison relations within the large-margin learning framework. Our method iteratively l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06654","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-18T01:20:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pnA9fQbvh3e1o5juXtiP60VqXrLeBtMoC4Xb8c7xcgx3oVEpXv5VJI+iaXC0EnHaIH3MQ3oIB/UtdGmPeUWuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:22:06.639458Z"},"content_sha256":"26ff89b6584eeca12580d90e5a9b30a3f6cdb35e4c1355ea65624e835196f3cf","schema_version":"1.0","event_id":"sha256:26ff89b6584eeca12580d90e5a9b30a3f6cdb35e4c1355ea65624e835196f3cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YQCLZNELHTU52HBUSFNKZWAE5/bundle.json","state_url":"https://pith.science/pith/6YQCLZNELHTU52HBUSFNKZWAE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YQCLZNELHTU52HBUSFNKZWAE5/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:22:06Z","links":{"resolver":"https://pith.science/pith/6YQCLZNELHTU52HBUSFNKZWAE5","bundle":"https://pith.science/pith/6YQCLZNELHTU52HBUSFNKZWAE5/bundle.json","state":"https://pith.science/pith/6YQCLZNELHTU52HBUSFNKZWAE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YQCLZNELHTU52HBUSFNKZWAE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6YQCLZNELHTU52HBUSFNKZWAE5","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":"bfb7cc631bbec443a642f2e7fbef756415450c001116631638037e5f2eac53df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-22T06:02:25Z","title_canon_sha256":"be438242b38a31c5eec01307eda3794a11b57c6419ddfd676007bb3315cae18d"},"schema_version":"1.0","source":{"id":"1602.06654","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06654","created_at":"2026-05-18T01:20:13Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06654v1","created_at":"2026-05-18T01:20:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06654","created_at":"2026-05-18T01:20:13Z"},{"alias_kind":"pith_short_12","alias_value":"6YQCLZNELHTU","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6YQCLZNELHTU52HB","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6YQCLZNE","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:26ff89b6584eeca12580d90e5a9b30a3f6cdb35e4c1355ea65624e835196f3cf","target":"graph","created_at":"2026-05-18T01:20:13Z","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 methods aim to learn a set of hash functions which map the original features to compact binary codes with similarity preserving in the Hamming space. Hashing has proven a valuable tool for large-scale information retrieval. We propose a column generation based binary code learning framework for data-dependent hash function learning. Given a set of triplets that encode the pairwise similarity comparison information, our column generation based method learns hash functions that preserve the relative comparison relations within the large-margin learning framework. Our method iteratively l","authors_text":"Chunhua Shen, Fayao Liu, Guosheng Lin, Heng Tao Shen, Jianxin Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-22T06:02:25Z","title":"Structured Learning of Binary Codes with Column Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06654","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:085734df5a139ad336191d2b2510be58e0945f25abcd258c305f0813f251c09b","target":"record","created_at":"2026-05-18T01:20:13Z","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":"bfb7cc631bbec443a642f2e7fbef756415450c001116631638037e5f2eac53df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-22T06:02:25Z","title_canon_sha256":"be438242b38a31c5eec01307eda3794a11b57c6419ddfd676007bb3315cae18d"},"schema_version":"1.0","source":{"id":"1602.06654","kind":"arxiv","version":1}},"canonical_sha256":"f62025e5a459e74ee8e1a48ad566c0274204eab4944ce18f6a1fe37a81da47e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f62025e5a459e74ee8e1a48ad566c0274204eab4944ce18f6a1fe37a81da47e9","first_computed_at":"2026-05-18T01:20:13.420019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:13.420019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yytQWx7+t2T0fF2gueMzWvnMkyMhznIvze1wJsVBxYGmYOTMNryeJbo6+nNLZrjrLhgqIFIq4cOJBKONlZWsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:13.420576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06654","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:085734df5a139ad336191d2b2510be58e0945f25abcd258c305f0813f251c09b","sha256:26ff89b6584eeca12580d90e5a9b30a3f6cdb35e4c1355ea65624e835196f3cf"],"state_sha256":"ac78276dc14b772485eef7bfa223300f03ff3e30979e51bae5dba4b53460a54b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iVkuYgj1ehBuOuFPu21hERZGpWyvqQX7e4aYCkkIyATEbvjZUlDX94n3dkVEqvuEtYZ4fCoKLEwTyATMOsHICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:22:06.643068Z","bundle_sha256":"1d36835c14251ddeced99c99e05f451df0c9c21abdc16165cbd5478c6ba39e20"}}