{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:W63NZLIBOCQXOP65CTNLPYO2GY","short_pith_number":"pith:W63NZLIB","schema_version":"1.0","canonical_sha256":"b7b6dcad0170a1773fdd14dab7e1da362ef3a9785c5811964f43cebf1d1d7251","source":{"kind":"arxiv","id":"1905.07570","version":1},"attestation_state":"computed","paper":{"title":"RaFM: Rank-Aware Factorization Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jiaxing Wang, Junzhou Huang, Wenye Ma, Xiaoshuang Chen, Yin Zheng","submitted_at":"2019-05-18T10:03:34Z","abstract_excerpt":"Factorization machines (FM) are a popular model class to learn pairwise interactions by a low-rank approximation. Different from existing FM-based approaches which use a fixed rank for all features, this paper proposes a Rank-Aware FM (RaFM) model which adopts pairwise interactions from embeddings with different ranks. The proposed model achieves a better performance on real-world datasets where different features have significantly varying frequencies of occurrences. Moreover, we prove that the RaFM model can be stored, evaluated, and trained as efficiently as one single FM, and under some re"},"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":"1905.07570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-18T10:03:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8593aad6bb8cf3ae39f491cc347ca068f21d2cb221aac2237caba77218e46b41","abstract_canon_sha256":"41683c093c1de59ef261241c7d5c947e1e27c3fd60c05f3722c5ca16008d204c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:49.272256Z","signature_b64":"CLqB3cMK/YqKbh/wGFpOSF40N5HSfMZg4W4wUchuSo0bB0lkWXpxw7Jijc0mer7I52f7Fo/V7PAUehgGY1SuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7b6dcad0170a1773fdd14dab7e1da362ef3a9785c5811964f43cebf1d1d7251","last_reissued_at":"2026-05-17T23:45:49.271696Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:49.271696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RaFM: Rank-Aware Factorization Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jiaxing Wang, Junzhou Huang, Wenye Ma, Xiaoshuang Chen, Yin Zheng","submitted_at":"2019-05-18T10:03:34Z","abstract_excerpt":"Factorization machines (FM) are a popular model class to learn pairwise interactions by a low-rank approximation. Different from existing FM-based approaches which use a fixed rank for all features, this paper proposes a Rank-Aware FM (RaFM) model which adopts pairwise interactions from embeddings with different ranks. The proposed model achieves a better performance on real-world datasets where different features have significantly varying frequencies of occurrences. Moreover, we prove that the RaFM model can be stored, evaluated, and trained as efficiently as one single FM, and under some re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07570","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":"1905.07570","created_at":"2026-05-17T23:45:49.271802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.07570v1","created_at":"2026-05-17T23:45:49.271802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07570","created_at":"2026-05-17T23:45:49.271802+00:00"},{"alias_kind":"pith_short_12","alias_value":"W63NZLIBOCQX","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"W63NZLIBOCQXOP65","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"W63NZLIB","created_at":"2026-05-18T12:33:30.264802+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/W63NZLIBOCQXOP65CTNLPYO2GY","json":"https://pith.science/pith/W63NZLIBOCQXOP65CTNLPYO2GY.json","graph_json":"https://pith.science/api/pith-number/W63NZLIBOCQXOP65CTNLPYO2GY/graph.json","events_json":"https://pith.science/api/pith-number/W63NZLIBOCQXOP65CTNLPYO2GY/events.json","paper":"https://pith.science/paper/1905.07570"},"agent_actions":{"view_html":"https://pith.science/pith/W63NZLIBOCQXOP65CTNLPYO2GY","download_json":"https://pith.science/pith/W63NZLIBOCQXOP65CTNLPYO2GY.json","view_paper":"https://pith.science/paper/1905.07570","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.07570&json=true","fetch_graph":"https://pith.science/api/pith-number/W63NZLIBOCQXOP65CTNLPYO2GY/graph.json","fetch_events":"https://pith.science/api/pith-number/W63NZLIBOCQXOP65CTNLPYO2GY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W63NZLIBOCQXOP65CTNLPYO2GY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W63NZLIBOCQXOP65CTNLPYO2GY/action/storage_attestation","attest_author":"https://pith.science/pith/W63NZLIBOCQXOP65CTNLPYO2GY/action/author_attestation","sign_citation":"https://pith.science/pith/W63NZLIBOCQXOP65CTNLPYO2GY/action/citation_signature","submit_replication":"https://pith.science/pith/W63NZLIBOCQXOP65CTNLPYO2GY/action/replication_record"}},"created_at":"2026-05-17T23:45:49.271802+00:00","updated_at":"2026-05-17T23:45:49.271802+00:00"}