{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JR442UVY4MWXZGXHYISGGM7ZTS","short_pith_number":"pith:JR442UVY","canonical_record":{"source":{"id":"1303.0339","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-03-02T03:01:46Z","cross_cats_sorted":[],"title_canon_sha256":"19ed4e59ba10821dc556ba55f99b4a2c028bc4dbad140780ba066a7f8e3ed3cd","abstract_canon_sha256":"54460b5fd1ef91c32933a00b0437a4c660ef50862bd4cf75f841eecf56530f8e"},"schema_version":"1.0"},"canonical_sha256":"4c79cd52b8e32d7c9ae7c2246333f99c89f0fbd078067fc3c986eff0d4bdcfd9","source":{"kind":"arxiv","id":"1303.0339","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0339","created_at":"2026-05-18T03:31:56Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0339v1","created_at":"2026-05-18T03:31:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0339","created_at":"2026-05-18T03:31:56Z"},{"alias_kind":"pith_short_12","alias_value":"JR442UVY4MWX","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JR442UVY4MWXZGXH","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JR442UVY","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JR442UVY4MWXZGXHYISGGM7ZTS","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0339","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-03-02T03:01:46Z","cross_cats_sorted":[],"title_canon_sha256":"19ed4e59ba10821dc556ba55f99b4a2c028bc4dbad140780ba066a7f8e3ed3cd","abstract_canon_sha256":"54460b5fd1ef91c32933a00b0437a4c660ef50862bd4cf75f841eecf56530f8e"},"schema_version":"1.0"},"canonical_sha256":"4c79cd52b8e32d7c9ae7c2246333f99c89f0fbd078067fc3c986eff0d4bdcfd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:56.446524Z","signature_b64":"n6sVwLTkmDpHJS1PkmgYpCQ/Gf5Wn7kCTMd6uUhA4CO4ZHzAbbR6NWwFscVJwJw8qpz3/fJfboKFysdC0EHZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c79cd52b8e32d7c9ae7c2246333f99c89f0fbd078067fc3c986eff0d4bdcfd9","last_reissued_at":"2026-05-18T03:31:56.445934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:56.445934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0339","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-18T03:31:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sKMiTPJGOdhMVC/U9jvxaieYL605sZbYFZfq4c8akEBDVM3n8TYYw2AD52C8R3QMxvGAs4qzpcWbYqJf+RhCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:13:17.889585Z"},"content_sha256":"f4ec4c02ed969b4a324aca65c3e2e8c1573c91076fb8232280fb55ed62e7b857","schema_version":"1.0","event_id":"sha256:f4ec4c02ed969b4a324aca65c3e2e8c1573c91076fb8232280fb55ed62e7b857"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JR442UVY4MWXZGXHYISGGM7ZTS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Hash Functions Using Column Generation","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anthony Dick, Anton van den Hengel, Chunhua Shen, Guosheng Lin, Xi Li","submitted_at":"2013-03-02T03:01:46Z","abstract_excerpt":"Fast nearest neighbor searching is becoming an increasingly important tool in solving many large-scale problems. Recently a number of approaches to learning data-dependent hash functions have been developed. In this work, we propose a column generation based method for learning data-dependent hash functions on the basis of proximity comparison information. Given a set of triplets that encode the pairwise proximity comparison information, our method learns hash functions that preserve the relative comparison relationships in the data as well as possible within the large-margin learning framewor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0339","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-18T03:31:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G67Ch8cSkIG7QwgBTLt7t2JLTCnmYHcYY9g+/AA/D/ReJ7AQAWHAHDgln0EZ7544s/FsIkbEKLSH5Y5GS1V/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:13:17.890230Z"},"content_sha256":"003807cd7fdd9783c057f294125a14b91e6df141806c5226a25eecd9613d963b","schema_version":"1.0","event_id":"sha256:003807cd7fdd9783c057f294125a14b91e6df141806c5226a25eecd9613d963b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JR442UVY4MWXZGXHYISGGM7ZTS/bundle.json","state_url":"https://pith.science/pith/JR442UVY4MWXZGXHYISGGM7ZTS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JR442UVY4MWXZGXHYISGGM7ZTS/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:13:17Z","links":{"resolver":"https://pith.science/pith/JR442UVY4MWXZGXHYISGGM7ZTS","bundle":"https://pith.science/pith/JR442UVY4MWXZGXHYISGGM7ZTS/bundle.json","state":"https://pith.science/pith/JR442UVY4MWXZGXHYISGGM7ZTS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JR442UVY4MWXZGXHYISGGM7ZTS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JR442UVY4MWXZGXHYISGGM7ZTS","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":"54460b5fd1ef91c32933a00b0437a4c660ef50862bd4cf75f841eecf56530f8e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-03-02T03:01:46Z","title_canon_sha256":"19ed4e59ba10821dc556ba55f99b4a2c028bc4dbad140780ba066a7f8e3ed3cd"},"schema_version":"1.0","source":{"id":"1303.0339","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0339","created_at":"2026-05-18T03:31:56Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0339v1","created_at":"2026-05-18T03:31:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0339","created_at":"2026-05-18T03:31:56Z"},{"alias_kind":"pith_short_12","alias_value":"JR442UVY4MWX","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JR442UVY4MWXZGXH","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JR442UVY","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:003807cd7fdd9783c057f294125a14b91e6df141806c5226a25eecd9613d963b","target":"graph","created_at":"2026-05-18T03:31:56Z","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":"Fast nearest neighbor searching is becoming an increasingly important tool in solving many large-scale problems. Recently a number of approaches to learning data-dependent hash functions have been developed. In this work, we propose a column generation based method for learning data-dependent hash functions on the basis of proximity comparison information. Given a set of triplets that encode the pairwise proximity comparison information, our method learns hash functions that preserve the relative comparison relationships in the data as well as possible within the large-margin learning framewor","authors_text":"Anthony Dick, Anton van den Hengel, Chunhua Shen, Guosheng Lin, Xi Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-03-02T03:01:46Z","title":"Learning Hash Functions Using Column Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0339","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:f4ec4c02ed969b4a324aca65c3e2e8c1573c91076fb8232280fb55ed62e7b857","target":"record","created_at":"2026-05-18T03:31:56Z","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":"54460b5fd1ef91c32933a00b0437a4c660ef50862bd4cf75f841eecf56530f8e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.LG","submitted_at":"2013-03-02T03:01:46Z","title_canon_sha256":"19ed4e59ba10821dc556ba55f99b4a2c028bc4dbad140780ba066a7f8e3ed3cd"},"schema_version":"1.0","source":{"id":"1303.0339","kind":"arxiv","version":1}},"canonical_sha256":"4c79cd52b8e32d7c9ae7c2246333f99c89f0fbd078067fc3c986eff0d4bdcfd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c79cd52b8e32d7c9ae7c2246333f99c89f0fbd078067fc3c986eff0d4bdcfd9","first_computed_at":"2026-05-18T03:31:56.445934Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:56.445934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n6sVwLTkmDpHJS1PkmgYpCQ/Gf5Wn7kCTMd6uUhA4CO4ZHzAbbR6NWwFscVJwJw8qpz3/fJfboKFysdC0EHZCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:56.446524Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0339","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4ec4c02ed969b4a324aca65c3e2e8c1573c91076fb8232280fb55ed62e7b857","sha256:003807cd7fdd9783c057f294125a14b91e6df141806c5226a25eecd9613d963b"],"state_sha256":"d8e13314e37a53f18d62f8ee131d52c0629ce8c9182dd80b1b70f83537787390"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oSw3kwyp8RdTqxBT1h31tid3KAoMPPxdGHeL/2NxazyzpVmCKdGdc4I8Zrg2fLWFYz9LnW9B68FPwdUPzHhjBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:13:17.893727Z","bundle_sha256":"36e38c24b2e19addaef787b62f2ad6ae63f6c372d59e00d6f5908b5daf2be261"}}