{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QHV4KWQRNRKCQKZTSZGUWZIW53","short_pith_number":"pith:QHV4KWQR","schema_version":"1.0","canonical_sha256":"81ebc55a116c54282b33964d4b6516eed0c1899fe165892a7c19b3ef51d4ee4d","source":{"kind":"arxiv","id":"1606.07792","version":1},"attestation_state":"computed","paper":{"title":"Wide & Deep Learning for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Glen Anderson, Greg Corrado, Hemal Shah, Heng-Tze Cheng, Hrishi Aradhye, Jeremiah Harmsen, Levent Koc, Lichan Hong, Mustafa Ispir, Rohan Anil, Tal Shaked, Tushar Chandra, Vihan Jain, Wei Chai, Xiaobing Liu, Zakaria Haque","submitted_at":"2016-06-24T19:07:02Z","abstract_excerpt":"Generalized linear models with nonlinear feature transformations are widely used for large-scale regression and classification problems with sparse inputs. Memorization of feature interactions through a wide set of cross-product feature transformations are effective and interpretable, while generalization requires more feature engineering effort. With less feature engineering, deep neural networks can generalize better to unseen feature combinations through low-dimensional dense embeddings learned for the sparse features. However, deep neural networks with embeddings can over-generalize and 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":"1606.07792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-24T19:07:02Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"448ea861f047038a24499efa9047f3a3c3b7e3a21bdd46236e5d013a18e37bc7","abstract_canon_sha256":"eef3ec0f2110291de461bb7b6c2c8486058ea67f393010a3d0260c5fd93e4848"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:55.720718Z","signature_b64":"h1FHnplX6QO0iorl2/i3SUCatfcsRBA7WnwfwicN6HYERp+54EXJTgW0WPw6uCIyKrqtqRQLiwy6nFg2b/2gDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81ebc55a116c54282b33964d4b6516eed0c1899fe165892a7c19b3ef51d4ee4d","last_reissued_at":"2026-05-18T01:11:55.720375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:55.720375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Wide & Deep Learning for Recommender Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Glen Anderson, Greg Corrado, Hemal Shah, Heng-Tze Cheng, Hrishi Aradhye, Jeremiah Harmsen, Levent Koc, Lichan Hong, Mustafa Ispir, Rohan Anil, Tal Shaked, Tushar Chandra, Vihan Jain, Wei Chai, Xiaobing Liu, Zakaria Haque","submitted_at":"2016-06-24T19:07:02Z","abstract_excerpt":"Generalized linear models with nonlinear feature transformations are widely used for large-scale regression and classification problems with sparse inputs. Memorization of feature interactions through a wide set of cross-product feature transformations are effective and interpretable, while generalization requires more feature engineering effort. With less feature engineering, deep neural networks can generalize better to unseen feature combinations through low-dimensional dense embeddings learned for the sparse features. However, deep neural networks with embeddings can over-generalize and re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07792","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":"1606.07792","created_at":"2026-05-18T01:11:55.720430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.07792v1","created_at":"2026-05-18T01:11:55.720430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07792","created_at":"2026-05-18T01:11:55.720430+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHV4KWQRNRKC","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHV4KWQRNRKCQKZT","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHV4KWQR","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.04924","citing_title":"Infer Implicit Contexts in Real-time Online-to-Offline Recommendation","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2604.04976","citing_title":"Tencent Advertising Algorithm Challenge 2025: All-Modality Generative Recommendation","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QHV4KWQRNRKCQKZTSZGUWZIW53","json":"https://pith.science/pith/QHV4KWQRNRKCQKZTSZGUWZIW53.json","graph_json":"https://pith.science/api/pith-number/QHV4KWQRNRKCQKZTSZGUWZIW53/graph.json","events_json":"https://pith.science/api/pith-number/QHV4KWQRNRKCQKZTSZGUWZIW53/events.json","paper":"https://pith.science/paper/QHV4KWQR"},"agent_actions":{"view_html":"https://pith.science/pith/QHV4KWQRNRKCQKZTSZGUWZIW53","download_json":"https://pith.science/pith/QHV4KWQRNRKCQKZTSZGUWZIW53.json","view_paper":"https://pith.science/paper/QHV4KWQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.07792&json=true","fetch_graph":"https://pith.science/api/pith-number/QHV4KWQRNRKCQKZTSZGUWZIW53/graph.json","fetch_events":"https://pith.science/api/pith-number/QHV4KWQRNRKCQKZTSZGUWZIW53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHV4KWQRNRKCQKZTSZGUWZIW53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHV4KWQRNRKCQKZTSZGUWZIW53/action/storage_attestation","attest_author":"https://pith.science/pith/QHV4KWQRNRKCQKZTSZGUWZIW53/action/author_attestation","sign_citation":"https://pith.science/pith/QHV4KWQRNRKCQKZTSZGUWZIW53/action/citation_signature","submit_replication":"https://pith.science/pith/QHV4KWQRNRKCQKZTSZGUWZIW53/action/replication_record"}},"created_at":"2026-05-18T01:11:55.720430+00:00","updated_at":"2026-05-18T01:11:55.720430+00:00"}