{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MCHNFL3JBKWT42K3LLIL6SUWOR","short_pith_number":"pith:MCHNFL3J","schema_version":"1.0","canonical_sha256":"608ed2af690aad3e695b5ad0bf4a967473a7cd0a6c05fed75cd75813ef5b26d2","source":{"kind":"arxiv","id":"1503.05951","version":1},"attestation_state":"computed","paper":{"title":"Rank Subspace Learning for Compact Hash Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Guojun Qi, Jun Ye, Kai Li, Kien A. Hua","submitted_at":"2015-03-19T21:34:33Z","abstract_excerpt":"The era of Big Data has spawned unprecedented interests in developing hashing algorithms for efficient storage and fast nearest neighbor search. Most existing work learn hash functions that are numeric quantizations of feature values in projected feature space. In this work, we propose a novel hash learning framework that encodes feature's rank orders instead of numeric values in a number of optimal low-dimensional ranking subspaces. We formulate the ranking subspace learning problem as the optimization of a piece-wise linear convex-concave function and present two versions of our algorithm: o"},"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":"1503.05951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-19T21:34:33Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"f6b2acd043a44dfdfd1b1a910cee82d0f62e95e42bbe32bac5cdb73e9ec61394","abstract_canon_sha256":"09c5cc49681cac247745f6d52d6a9200eafb6db57f6ab1e8423713895634e717"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:49.041283Z","signature_b64":"HmY4j5Z0PydOpuw+Sh4tjhQQ7SmxB5c4kxQzrx+lSXAIPXF726NjjlsD8d58aM2ytmdmUvOCSbTbE57ufKHzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"608ed2af690aad3e695b5ad0bf4a967473a7cd0a6c05fed75cd75813ef5b26d2","last_reissued_at":"2026-05-18T02:20:49.040562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:49.040562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rank Subspace Learning for Compact Hash Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.LG","authors_text":"Guojun Qi, Jun Ye, Kai Li, Kien A. Hua","submitted_at":"2015-03-19T21:34:33Z","abstract_excerpt":"The era of Big Data has spawned unprecedented interests in developing hashing algorithms for efficient storage and fast nearest neighbor search. Most existing work learn hash functions that are numeric quantizations of feature values in projected feature space. In this work, we propose a novel hash learning framework that encodes feature's rank orders instead of numeric values in a number of optimal low-dimensional ranking subspaces. We formulate the ranking subspace learning problem as the optimization of a piece-wise linear convex-concave function and present two versions of our algorithm: o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05951","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":"1503.05951","created_at":"2026-05-18T02:20:49.040693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.05951v1","created_at":"2026-05-18T02:20:49.040693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05951","created_at":"2026-05-18T02:20:49.040693+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCHNFL3JBKWT","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCHNFL3JBKWT42K3","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCHNFL3J","created_at":"2026-05-18T12:29:32.376354+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/MCHNFL3JBKWT42K3LLIL6SUWOR","json":"https://pith.science/pith/MCHNFL3JBKWT42K3LLIL6SUWOR.json","graph_json":"https://pith.science/api/pith-number/MCHNFL3JBKWT42K3LLIL6SUWOR/graph.json","events_json":"https://pith.science/api/pith-number/MCHNFL3JBKWT42K3LLIL6SUWOR/events.json","paper":"https://pith.science/paper/MCHNFL3J"},"agent_actions":{"view_html":"https://pith.science/pith/MCHNFL3JBKWT42K3LLIL6SUWOR","download_json":"https://pith.science/pith/MCHNFL3JBKWT42K3LLIL6SUWOR.json","view_paper":"https://pith.science/paper/MCHNFL3J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.05951&json=true","fetch_graph":"https://pith.science/api/pith-number/MCHNFL3JBKWT42K3LLIL6SUWOR/graph.json","fetch_events":"https://pith.science/api/pith-number/MCHNFL3JBKWT42K3LLIL6SUWOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCHNFL3JBKWT42K3LLIL6SUWOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCHNFL3JBKWT42K3LLIL6SUWOR/action/storage_attestation","attest_author":"https://pith.science/pith/MCHNFL3JBKWT42K3LLIL6SUWOR/action/author_attestation","sign_citation":"https://pith.science/pith/MCHNFL3JBKWT42K3LLIL6SUWOR/action/citation_signature","submit_replication":"https://pith.science/pith/MCHNFL3JBKWT42K3LLIL6SUWOR/action/replication_record"}},"created_at":"2026-05-18T02:20:49.040693+00:00","updated_at":"2026-05-18T02:20:49.040693+00:00"}