{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DBM4D2IDZMDEMA57XILZQQLJFG","short_pith_number":"pith:DBM4D2ID","schema_version":"1.0","canonical_sha256":"1859c1e903cb064603bfba179841692987e0be436ed45f4b87a8a81d9482468d","source":{"kind":"arxiv","id":"2007.03519","version":1},"attestation_state":"computed","paper":{"title":"GateNet: Gating-Enhanced Deep Network for Click-Through Rate Prediction","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Junlin Zhang, Qingyun She, Tongwen Huang, Zhiqiang Wang","submitted_at":"2020-07-06T12:45:46Z","abstract_excerpt":"Advertising and feed ranking are essential to many Internet companies such as Facebook. Among many real-world advertising and feed ranking systems, click through rate (CTR) prediction plays a central role. In recent years, many neural network based CTR models have been proposed and achieved success such as Factorization-Machine Supported Neural Networks, DeepFM and xDeepFM. Many of them contain two commonly used components: embedding layer and MLP hidden layers. On the other side, gating mechanism is also widely applied in many research fields such as computer vision(CV) and natural language p"},"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":"2007.03519","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T12:45:46Z","cross_cats_sorted":[],"title_canon_sha256":"75306328de4715254fae8c140bca30f4c729ecebfb61028d986bf4e5c4edc13e","abstract_canon_sha256":"671320de9aef2f4a88588ca104d467339e77323a854d4e90694e4de880e43a34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:03.725259Z","signature_b64":"nYkCPTrq7qpeqkC5dkvP+kkPHiBzmP358PZckS2e+JfZ79DibqtGvK9J7fSbMohsAXnCInohm8op9wKUXUZyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1859c1e903cb064603bfba179841692987e0be436ed45f4b87a8a81d9482468d","last_reissued_at":"2026-07-05T01:17:03.724625Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:03.724625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GateNet: Gating-Enhanced Deep Network for Click-Through Rate Prediction","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Junlin Zhang, Qingyun She, Tongwen Huang, Zhiqiang Wang","submitted_at":"2020-07-06T12:45:46Z","abstract_excerpt":"Advertising and feed ranking are essential to many Internet companies such as Facebook. Among many real-world advertising and feed ranking systems, click through rate (CTR) prediction plays a central role. In recent years, many neural network based CTR models have been proposed and achieved success such as Factorization-Machine Supported Neural Networks, DeepFM and xDeepFM. Many of them contain two commonly used components: embedding layer and MLP hidden layers. On the other side, gating mechanism is also widely applied in many research fields such as computer vision(CV) and natural language p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03519","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.03519/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.03519","created_at":"2026-07-05T01:17:03.724701+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.03519v1","created_at":"2026-07-05T01:17:03.724701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03519","created_at":"2026-07-05T01:17:03.724701+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBM4D2IDZMDE","created_at":"2026-07-05T01:17:03.724701+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBM4D2IDZMDEMA57","created_at":"2026-07-05T01:17:03.724701+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBM4D2ID","created_at":"2026-07-05T01:17:03.724701+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.11037","citing_title":"Mini-Game Lifetime Value Prediction in WeChat","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DBM4D2IDZMDEMA57XILZQQLJFG","json":"https://pith.science/pith/DBM4D2IDZMDEMA57XILZQQLJFG.json","graph_json":"https://pith.science/api/pith-number/DBM4D2IDZMDEMA57XILZQQLJFG/graph.json","events_json":"https://pith.science/api/pith-number/DBM4D2IDZMDEMA57XILZQQLJFG/events.json","paper":"https://pith.science/paper/DBM4D2ID"},"agent_actions":{"view_html":"https://pith.science/pith/DBM4D2IDZMDEMA57XILZQQLJFG","download_json":"https://pith.science/pith/DBM4D2IDZMDEMA57XILZQQLJFG.json","view_paper":"https://pith.science/paper/DBM4D2ID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.03519&json=true","fetch_graph":"https://pith.science/api/pith-number/DBM4D2IDZMDEMA57XILZQQLJFG/graph.json","fetch_events":"https://pith.science/api/pith-number/DBM4D2IDZMDEMA57XILZQQLJFG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBM4D2IDZMDEMA57XILZQQLJFG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBM4D2IDZMDEMA57XILZQQLJFG/action/storage_attestation","attest_author":"https://pith.science/pith/DBM4D2IDZMDEMA57XILZQQLJFG/action/author_attestation","sign_citation":"https://pith.science/pith/DBM4D2IDZMDEMA57XILZQQLJFG/action/citation_signature","submit_replication":"https://pith.science/pith/DBM4D2IDZMDEMA57XILZQQLJFG/action/replication_record"}},"created_at":"2026-07-05T01:17:03.724701+00:00","updated_at":"2026-07-05T01:17:03.724701+00:00"}