{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4ZSDYO2J4ULBTQBMMVNZTO5WIJ","short_pith_number":"pith:4ZSDYO2J","schema_version":"1.0","canonical_sha256":"e6643c3b49e51619c02c655b99bbb6427731d1632497adad7a114e16e3961d2a","source":{"kind":"arxiv","id":"1708.05123","version":1},"attestation_state":"computed","paper":{"title":"Deep & Cross Network for Ad Click Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bin Fu, Gang Fu, Mingliang Wang, Ruoxi Wang","submitted_at":"2017-08-17T03:28:04Z","abstract_excerpt":"Feature engineering has been the key to the success of many prediction models. However, the process is non-trivial and often requires manual feature engineering or exhaustive searching. DNNs are able to automatically learn feature interactions; however, they generate all the interactions implicitly, and are not necessarily efficient in learning all types of cross features. In this paper, we propose the Deep & Cross Network (DCN) which keeps the benefits of a DNN model, and beyond that, it introduces a novel cross network that is more efficient in learning certain bounded-degree feature interac"},"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":"1708.05123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-17T03:28:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"31f076966ea592353666f7a4bc3e1c3dea990eb9b94ca316fba489b54edcf137","abstract_canon_sha256":"4e09f791efc4e3b60b586a20b3a28585cedac4cf07848bdda0dd6818e37b7d66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:53.797222Z","signature_b64":"Qnd6qNCYCUYkbkx8peyY7RqcYTtt1ygW6ADR/riTTGo7j+Ys1lG4tfznCGzWFBglv95R5fNtV886BvBYsUXqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6643c3b49e51619c02c655b99bbb6427731d1632497adad7a114e16e3961d2a","last_reissued_at":"2026-05-18T00:37:53.796746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:53.796746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep & Cross Network for Ad Click Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bin Fu, Gang Fu, Mingliang Wang, Ruoxi Wang","submitted_at":"2017-08-17T03:28:04Z","abstract_excerpt":"Feature engineering has been the key to the success of many prediction models. However, the process is non-trivial and often requires manual feature engineering or exhaustive searching. DNNs are able to automatically learn feature interactions; however, they generate all the interactions implicitly, and are not necessarily efficient in learning all types of cross features. In this paper, we propose the Deep & Cross Network (DCN) which keeps the benefits of a DNN model, and beyond that, it introduces a novel cross network that is more efficient in learning certain bounded-degree feature interac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05123","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":"1708.05123","created_at":"2026-05-18T00:37:53.796819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05123v1","created_at":"2026-05-18T00:37:53.796819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05123","created_at":"2026-05-18T00:37:53.796819+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZSDYO2J4ULB","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZSDYO2J4ULBTQBM","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZSDYO2J","created_at":"2026-05-18T12:31:00.734936+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/4ZSDYO2J4ULBTQBMMVNZTO5WIJ","json":"https://pith.science/pith/4ZSDYO2J4ULBTQBMMVNZTO5WIJ.json","graph_json":"https://pith.science/api/pith-number/4ZSDYO2J4ULBTQBMMVNZTO5WIJ/graph.json","events_json":"https://pith.science/api/pith-number/4ZSDYO2J4ULBTQBMMVNZTO5WIJ/events.json","paper":"https://pith.science/paper/4ZSDYO2J"},"agent_actions":{"view_html":"https://pith.science/pith/4ZSDYO2J4ULBTQBMMVNZTO5WIJ","download_json":"https://pith.science/pith/4ZSDYO2J4ULBTQBMMVNZTO5WIJ.json","view_paper":"https://pith.science/paper/4ZSDYO2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05123&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZSDYO2J4ULBTQBMMVNZTO5WIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZSDYO2J4ULBTQBMMVNZTO5WIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZSDYO2J4ULBTQBMMVNZTO5WIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZSDYO2J4ULBTQBMMVNZTO5WIJ/action/storage_attestation","attest_author":"https://pith.science/pith/4ZSDYO2J4ULBTQBMMVNZTO5WIJ/action/author_attestation","sign_citation":"https://pith.science/pith/4ZSDYO2J4ULBTQBMMVNZTO5WIJ/action/citation_signature","submit_replication":"https://pith.science/pith/4ZSDYO2J4ULBTQBMMVNZTO5WIJ/action/replication_record"}},"created_at":"2026-05-18T00:37:53.796819+00:00","updated_at":"2026-05-18T00:37:53.796819+00:00"}