{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AAUSS3NPIZUZN5GIEVSUWJP66B","short_pith_number":"pith:AAUSS3NP","schema_version":"1.0","canonical_sha256":"0029296daf466996f4c825654b25fef052d3bd3e4e85cc3d9c113f4e74366d0b","source":{"kind":"arxiv","id":"1805.02232","version":3},"attestation_state":"computed","paper":{"title":"Discrete Factorization Machines for Fast Feature-based Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Fuli Feng, Han Liu, Hanwang Zhang, Liqiang Nie, Rui Liu, Xiangnan He","submitted_at":"2018-05-06T15:24:54Z","abstract_excerpt":"User and item features of side information are crucial for accurate recommendation. However, the large number of feature dimensions, e.g., usually larger than 10^7, results in expensive storage and computational cost. This prohibits fast recommendation especially on mobile applications where the computational resource is very limited. In this paper, we develop a generic feature-based recommendation model, called Discrete Factorization Machine (DFM), for fast and accurate recommendation. DFM binarizes the real-valued model parameters (e.g., float32) of every feature embedding into binary codes "},"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":"1805.02232","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-05-06T15:24:54Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"40a32dd3b58acf620e5e8e63ae6dce951bb55c17bfb46825351789d4deb6e83e","abstract_canon_sha256":"3a749474f57cefb02bf8f76d3e00ae68d1f62c46e803c2b49c1c5831cd919479"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:23.556683Z","signature_b64":"ZdpFqb1xmTcbYkueb5IwKeCOhat94gqoyMUjAsi2s/eKfpC2nnhzBe7s97hSK1IB+zITNHMWPj9NMQv+86aCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0029296daf466996f4c825654b25fef052d3bd3e4e85cc3d9c113f4e74366d0b","last_reissued_at":"2026-05-18T00:05:23.556204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:23.556204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete Factorization Machines for Fast Feature-based Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Fuli Feng, Han Liu, Hanwang Zhang, Liqiang Nie, Rui Liu, Xiangnan He","submitted_at":"2018-05-06T15:24:54Z","abstract_excerpt":"User and item features of side information are crucial for accurate recommendation. However, the large number of feature dimensions, e.g., usually larger than 10^7, results in expensive storage and computational cost. This prohibits fast recommendation especially on mobile applications where the computational resource is very limited. In this paper, we develop a generic feature-based recommendation model, called Discrete Factorization Machine (DFM), for fast and accurate recommendation. DFM binarizes the real-valued model parameters (e.g., float32) of every feature embedding into binary codes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02232","kind":"arxiv","version":3},"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":"1805.02232","created_at":"2026-05-18T00:05:23.556276+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02232v3","created_at":"2026-05-18T00:05:23.556276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02232","created_at":"2026-05-18T00:05:23.556276+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAUSS3NPIZUZ","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAUSS3NPIZUZN5GI","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAUSS3NP","created_at":"2026-05-18T12:32:13.499390+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/AAUSS3NPIZUZN5GIEVSUWJP66B","json":"https://pith.science/pith/AAUSS3NPIZUZN5GIEVSUWJP66B.json","graph_json":"https://pith.science/api/pith-number/AAUSS3NPIZUZN5GIEVSUWJP66B/graph.json","events_json":"https://pith.science/api/pith-number/AAUSS3NPIZUZN5GIEVSUWJP66B/events.json","paper":"https://pith.science/paper/AAUSS3NP"},"agent_actions":{"view_html":"https://pith.science/pith/AAUSS3NPIZUZN5GIEVSUWJP66B","download_json":"https://pith.science/pith/AAUSS3NPIZUZN5GIEVSUWJP66B.json","view_paper":"https://pith.science/paper/AAUSS3NP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02232&json=true","fetch_graph":"https://pith.science/api/pith-number/AAUSS3NPIZUZN5GIEVSUWJP66B/graph.json","fetch_events":"https://pith.science/api/pith-number/AAUSS3NPIZUZN5GIEVSUWJP66B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAUSS3NPIZUZN5GIEVSUWJP66B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAUSS3NPIZUZN5GIEVSUWJP66B/action/storage_attestation","attest_author":"https://pith.science/pith/AAUSS3NPIZUZN5GIEVSUWJP66B/action/author_attestation","sign_citation":"https://pith.science/pith/AAUSS3NPIZUZN5GIEVSUWJP66B/action/citation_signature","submit_replication":"https://pith.science/pith/AAUSS3NPIZUZN5GIEVSUWJP66B/action/replication_record"}},"created_at":"2026-05-18T00:05:23.556276+00:00","updated_at":"2026-05-18T00:05:23.556276+00:00"}