{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QFHVP5WIXU5VUREXIT76XMMZNY","short_pith_number":"pith:QFHVP5WI","schema_version":"1.0","canonical_sha256":"814f57f6c8bd3b5a449744ffebb1996e3b40634eae6b566b80edad6fc4c8e22b","source":{"kind":"arxiv","id":"1410.5524","version":1},"attestation_state":"computed","paper":{"title":"Learning to Rank Binary Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jie Feng, Wei Liu, Yan Wang","submitted_at":"2014-10-21T03:09:17Z","abstract_excerpt":"Binary codes have been widely used in vision problems as a compact feature representation to achieve both space and time advantages. Various methods have been proposed to learn data-dependent hash functions which map a feature vector to a binary code. However, considerable data information is inevitably lost during the binarization step which also causes ambiguity in measuring sample similarity using Hamming distance. Besides, the learned hash functions cannot be changed after training, which makes them incapable of adapting to new data outside the training data set. To address both issues, in"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1410.5524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-10-21T03:09:17Z","cross_cats_sorted":[],"title_canon_sha256":"36fe6255cf6b5b0d31c236c6f29b7dc2eb7151eae8e08bec1f8d3cb86713ccd4","abstract_canon_sha256":"56705164a078fb3f352af17a7a31688758bba3ef25215c8bfadb131ef396a467"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:39.630659Z","signature_b64":"diCp6XGpd9zYZwKTiu4ElB/G2LSChU29Q82k/zRBkcqJJjMDFQklzq5VwpC7hfNqQR1OYzM2yKzVAn5TTosKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"814f57f6c8bd3b5a449744ffebb1996e3b40634eae6b566b80edad6fc4c8e22b","last_reissued_at":"2026-05-18T02:39:39.630242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:39.630242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Rank Binary Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jie Feng, Wei Liu, Yan Wang","submitted_at":"2014-10-21T03:09:17Z","abstract_excerpt":"Binary codes have been widely used in vision problems as a compact feature representation to achieve both space and time advantages. Various methods have been proposed to learn data-dependent hash functions which map a feature vector to a binary code. However, considerable data information is inevitably lost during the binarization step which also causes ambiguity in measuring sample similarity using Hamming distance. Besides, the learned hash functions cannot be changed after training, which makes them incapable of adapting to new data outside the training data set. To address both issues, in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5524","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.5524","created_at":"2026-05-18T02:39:39.630300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5524v1","created_at":"2026-05-18T02:39:39.630300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5524","created_at":"2026-05-18T02:39:39.630300+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFHVP5WIXU5V","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFHVP5WIXU5VUREX","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFHVP5WI","created_at":"2026-05-18T12:28:43.426989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QFHVP5WIXU5VUREXIT76XMMZNY","json":"https://pith.science/pith/QFHVP5WIXU5VUREXIT76XMMZNY.json","graph_json":"https://pith.science/api/pith-number/QFHVP5WIXU5VUREXIT76XMMZNY/graph.json","events_json":"https://pith.science/api/pith-number/QFHVP5WIXU5VUREXIT76XMMZNY/events.json","paper":"https://pith.science/paper/QFHVP5WI"},"agent_actions":{"view_html":"https://pith.science/pith/QFHVP5WIXU5VUREXIT76XMMZNY","download_json":"https://pith.science/pith/QFHVP5WIXU5VUREXIT76XMMZNY.json","view_paper":"https://pith.science/paper/QFHVP5WI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5524&json=true","fetch_graph":"https://pith.science/api/pith-number/QFHVP5WIXU5VUREXIT76XMMZNY/graph.json","fetch_events":"https://pith.science/api/pith-number/QFHVP5WIXU5VUREXIT76XMMZNY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFHVP5WIXU5VUREXIT76XMMZNY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFHVP5WIXU5VUREXIT76XMMZNY/action/storage_attestation","attest_author":"https://pith.science/pith/QFHVP5WIXU5VUREXIT76XMMZNY/action/author_attestation","sign_citation":"https://pith.science/pith/QFHVP5WIXU5VUREXIT76XMMZNY/action/citation_signature","submit_replication":"https://pith.science/pith/QFHVP5WIXU5VUREXIT76XMMZNY/action/replication_record"}},"created_at":"2026-05-18T02:39:39.630300+00:00","updated_at":"2026-05-18T02:39:39.630300+00:00"}