{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QIU2EGALVWDFUAKOPFH4F6GLR5","short_pith_number":"pith:QIU2EGAL","schema_version":"1.0","canonical_sha256":"8229a2180bad865a014e794fc2f8cb8f64f8dab5b4c1155ae460c71f5f14d3b1","source":{"kind":"arxiv","id":"1804.04950","version":2},"attestation_state":"computed","paper":{"title":"DeepFM: An End-to-End Wide & Deep Learning Framework for CTR Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Huifeng Guo, Ruiming Tang, Xiuqiang He, Yunming Ye, Zhenguo Li, Zhenhua Dong","submitted_at":"2018-04-12T01:12:13Z","abstract_excerpt":"Learning sophisticated feature interactions behind user behaviors is critical in maximizing CTR for recommender systems. Despite great progress, existing methods have a strong bias towards low- or high-order interactions, or rely on expertise feature engineering. In this paper, we show that it is possible to derive an end-to-end learning model that emphasizes both low- and high-order feature interactions. The proposed framework, DeepFM, combines the power of factorization machines for recommendation and deep learning for feature learning in a new neural network architecture. Compared to the la"},"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":"1804.04950","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2018-04-12T01:12:13Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"fb8d1db8ea58681b06d74e00ed702f45ec888e39e8dbfd8c098e45fcbd04fa09","abstract_canon_sha256":"871093292cfa4305cb5b92ab79e48475b4ed8e882b3292a89873c808163b5919"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:49.581268Z","signature_b64":"8mAI09w/KDB7IdObYdGuN8i3S/oguUJrHoq4qvWCoYIn5UDEmsaWl3o8PNDffanXJJI0O3nhUsD9aPvqtxy/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8229a2180bad865a014e794fc2f8cb8f64f8dab5b4c1155ae460c71f5f14d3b1","last_reissued_at":"2026-05-18T00:15:49.580795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:49.580795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DeepFM: An End-to-End Wide & Deep Learning Framework for CTR Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Huifeng Guo, Ruiming Tang, Xiuqiang He, Yunming Ye, Zhenguo Li, Zhenhua Dong","submitted_at":"2018-04-12T01:12:13Z","abstract_excerpt":"Learning sophisticated feature interactions behind user behaviors is critical in maximizing CTR for recommender systems. Despite great progress, existing methods have a strong bias towards low- or high-order interactions, or rely on expertise feature engineering. In this paper, we show that it is possible to derive an end-to-end learning model that emphasizes both low- and high-order feature interactions. The proposed framework, DeepFM, combines the power of factorization machines for recommendation and deep learning for feature learning in a new neural network architecture. Compared to the la"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04950","kind":"arxiv","version":2},"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":"1804.04950","created_at":"2026-05-18T00:15:49.580867+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.04950v2","created_at":"2026-05-18T00:15:49.580867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04950","created_at":"2026-05-18T00:15:49.580867+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIU2EGALVWDF","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIU2EGALVWDFUAKO","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIU2EGAL","created_at":"2026-05-18T12:32:46.962924+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2012.06678","citing_title":"TabTransformer: Tabular Data Modeling Using Contextual Embeddings","ref_index":77,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QIU2EGALVWDFUAKOPFH4F6GLR5","json":"https://pith.science/pith/QIU2EGALVWDFUAKOPFH4F6GLR5.json","graph_json":"https://pith.science/api/pith-number/QIU2EGALVWDFUAKOPFH4F6GLR5/graph.json","events_json":"https://pith.science/api/pith-number/QIU2EGALVWDFUAKOPFH4F6GLR5/events.json","paper":"https://pith.science/paper/QIU2EGAL"},"agent_actions":{"view_html":"https://pith.science/pith/QIU2EGALVWDFUAKOPFH4F6GLR5","download_json":"https://pith.science/pith/QIU2EGALVWDFUAKOPFH4F6GLR5.json","view_paper":"https://pith.science/paper/QIU2EGAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.04950&json=true","fetch_graph":"https://pith.science/api/pith-number/QIU2EGALVWDFUAKOPFH4F6GLR5/graph.json","fetch_events":"https://pith.science/api/pith-number/QIU2EGALVWDFUAKOPFH4F6GLR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIU2EGALVWDFUAKOPFH4F6GLR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIU2EGALVWDFUAKOPFH4F6GLR5/action/storage_attestation","attest_author":"https://pith.science/pith/QIU2EGALVWDFUAKOPFH4F6GLR5/action/author_attestation","sign_citation":"https://pith.science/pith/QIU2EGALVWDFUAKOPFH4F6GLR5/action/citation_signature","submit_replication":"https://pith.science/pith/QIU2EGALVWDFUAKOPFH4F6GLR5/action/replication_record"}},"created_at":"2026-05-18T00:15:49.580867+00:00","updated_at":"2026-05-18T00:15:49.580867+00:00"}