{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YT5ZUABCW3OGMFUZLDPC7NTBXL","short_pith_number":"pith:YT5ZUABC","schema_version":"1.0","canonical_sha256":"c4fb9a0022b6dc66169958de2fb661bad016d2d2c05c7e503131b4ee34ea721e","source":{"kind":"arxiv","id":"1904.04447","version":1},"attestation_state":"computed","paper":{"title":"Feature Generation by Convolutional Neural Network for Click-Through Rate Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Bin Liu, Huifeng Guo, Jinkai Yu, Ruiming Tang, Yingzhi Chen, Yuzhou Zhang","submitted_at":"2019-04-09T03:27:06Z","abstract_excerpt":"Click-Through Rate prediction is an important task in recommender systems, which aims to estimate the probability of a user to click on a given item. Recently, many deep models have been proposed to learn low-order and high-order feature interactions from original features. However, since useful interactions are always sparse, it is difficult for DNN to learn them effectively under a large number of parameters. In real scenarios, artificial features are able to improve the performance of deep models (such as Wide & Deep Learning), but feature engineering is expensive and requires domain knowle"},"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":"1904.04447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-09T03:27:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c19e9cfa5648094819f2072989e07e52d852bfa5b7034dfa2408e72baa504b2a","abstract_canon_sha256":"101d71c824fd743a51be875ad4a4e1be721afd90ec44829449798dcb11383391"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:35.599534Z","signature_b64":"zEBNT3pJfURY9JU47owW1ukCk0Y2byINRROVaxYaTw0UiqTbq4PIe0+x73FG50+lYpbOLpP89+Z+e1RxKbWiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4fb9a0022b6dc66169958de2fb661bad016d2d2c05c7e503131b4ee34ea721e","last_reissued_at":"2026-05-17T23:47:35.599063Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:35.599063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feature Generation by Convolutional Neural Network for Click-Through Rate Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Bin Liu, Huifeng Guo, Jinkai Yu, Ruiming Tang, Yingzhi Chen, Yuzhou Zhang","submitted_at":"2019-04-09T03:27:06Z","abstract_excerpt":"Click-Through Rate prediction is an important task in recommender systems, which aims to estimate the probability of a user to click on a given item. Recently, many deep models have been proposed to learn low-order and high-order feature interactions from original features. However, since useful interactions are always sparse, it is difficult for DNN to learn them effectively under a large number of parameters. In real scenarios, artificial features are able to improve the performance of deep models (such as Wide & Deep Learning), but feature engineering is expensive and requires domain knowle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04447","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":"1904.04447","created_at":"2026-05-17T23:47:35.599138+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.04447v1","created_at":"2026-05-17T23:47:35.599138+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04447","created_at":"2026-05-17T23:47:35.599138+00:00"},{"alias_kind":"pith_short_12","alias_value":"YT5ZUABCW3OG","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YT5ZUABCW3OGMFUZ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YT5ZUABC","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.02822","citing_title":"Deep Personalized Re-targeting","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL","json":"https://pith.science/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL.json","graph_json":"https://pith.science/api/pith-number/YT5ZUABCW3OGMFUZLDPC7NTBXL/graph.json","events_json":"https://pith.science/api/pith-number/YT5ZUABCW3OGMFUZLDPC7NTBXL/events.json","paper":"https://pith.science/paper/YT5ZUABC"},"agent_actions":{"view_html":"https://pith.science/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL","download_json":"https://pith.science/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL.json","view_paper":"https://pith.science/paper/YT5ZUABC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.04447&json=true","fetch_graph":"https://pith.science/api/pith-number/YT5ZUABCW3OGMFUZLDPC7NTBXL/graph.json","fetch_events":"https://pith.science/api/pith-number/YT5ZUABCW3OGMFUZLDPC7NTBXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL/action/storage_attestation","attest_author":"https://pith.science/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL/action/author_attestation","sign_citation":"https://pith.science/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL/action/citation_signature","submit_replication":"https://pith.science/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL/action/replication_record"}},"created_at":"2026-05-17T23:47:35.599138+00:00","updated_at":"2026-05-17T23:47:35.599138+00:00"}