{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:J2ADB5WHYQD6TFHFI56JSMCZPS","short_pith_number":"pith:J2ADB5WH","schema_version":"1.0","canonical_sha256":"4e8030f6c7c407e994e5477c9930597ca38890014e439633d081307c05927aff","source":{"kind":"arxiv","id":"2203.11014","version":1},"attestation_state":"computed","paper":{"title":"DHEN: A Deep and Hierarchical Ensemble Network for Large-Scale Click-Through Rate Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.IR","authors_text":"Buyun Zhang, Dheevatsa Mudigere, Ellie Wen, Huayu Li, Jay Li, Jiyan Yang, Jongsoo Park, Liang Luo, Michael Tsang, Weilin Zhang, Wenjun Wang, Xiaohan Wei, Xi Liu, Yang Liu, Yasmine Badr, Yuchen Hao, Zeliang Chen","submitted_at":"2022-03-11T21:19:31Z","abstract_excerpt":"Learning feature interactions is important to the model performance of online advertising services. As a result, extensive efforts have been devoted to designing effective architectures to learn feature interactions. However, we observe that the practical performance of those designs can vary from dataset to dataset, even when the order of interactions claimed to be captured is the same. That indicates different designs may have different advantages and the interactions captured by them have non-overlapping information. Motivated by this observation, we propose DHEN - a deep and hierarchical e"},"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":"2203.11014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-03-11T21:19:31Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"0d3a759a4ef30d8b13f4d3fb2f87ce5caef65e6188b059741417d436301c0b3f","abstract_canon_sha256":"6e3a51c9d2da92644787449312ceaefe0b57c62b6fd2d59e6912b74e9efc3b41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:59.788609Z","signature_b64":"gmLJH+MXOpSbWHpqiLkYfdfcLVAWfAvkcD319CotLhoCq3Nsy2H6yO+tOraMyrlwtN1GgUt/Q3lEqRwHA4qsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e8030f6c7c407e994e5477c9930597ca38890014e439633d081307c05927aff","last_reissued_at":"2026-07-05T04:06:59.788112Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:59.788112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DHEN: A Deep and Hierarchical Ensemble Network for Large-Scale Click-Through Rate Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.IR","authors_text":"Buyun Zhang, Dheevatsa Mudigere, Ellie Wen, Huayu Li, Jay Li, Jiyan Yang, Jongsoo Park, Liang Luo, Michael Tsang, Weilin Zhang, Wenjun Wang, Xiaohan Wei, Xi Liu, Yang Liu, Yasmine Badr, Yuchen Hao, Zeliang Chen","submitted_at":"2022-03-11T21:19:31Z","abstract_excerpt":"Learning feature interactions is important to the model performance of online advertising services. As a result, extensive efforts have been devoted to designing effective architectures to learn feature interactions. However, we observe that the practical performance of those designs can vary from dataset to dataset, even when the order of interactions claimed to be captured is the same. That indicates different designs may have different advantages and the interactions captured by them have non-overlapping information. Motivated by this observation, we propose DHEN - a deep and hierarchical e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.11014","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/2203.11014/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":"2203.11014","created_at":"2026-07-05T04:06:59.788172+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.11014v1","created_at":"2026-07-05T04:06:59.788172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.11014","created_at":"2026-07-05T04:06:59.788172+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2ADB5WHYQD6","created_at":"2026-07-05T04:06:59.788172+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2ADB5WHYQD6TFHF","created_at":"2026-07-05T04:06:59.788172+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2ADB5WH","created_at":"2026-07-05T04:06:59.788172+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":12,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11616","citing_title":"DeMix: Debugging Training Data with Mixed Data Error Types by Investigating Influence Vectors","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31984","citing_title":"GR2 Technical Report","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.24051","citing_title":"Memento: Personalized RAG-Style Long-Retention Data Scaling for META Ads Recommendation","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29232","citing_title":"On the Practice of Scaling Search Conversion Rate Prediction","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10886","citing_title":"LoKA: Low-precision Kernel Applications for Recommendation Models At Scale","ref_index":84,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04038","citing_title":"FLAME: Condensing Ensemble Diversity into a Single Network for Efficient Sequential Recommendation","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04976","citing_title":"Tencent Advertising Algorithm Challenge 2025: All-Modality Generative Recommendation","ref_index":67,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10886","citing_title":"LoKA: Low-precision Kernel Applications for Recommendation Models At Scale","ref_index":84,"is_internal_anchor":false},{"citing_arxiv_id":"2304.11277","citing_title":"PyTorch FSDP: Experiences on Scaling Fully Sharded Data Parallel","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19550","citing_title":"LoopCTR: Unlocking the Loop Scaling Power for Click-Through Rate Prediction","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12965","citing_title":"Efficient Retrieval Scaling with Hierarchical Indexing for Large Scale Recommendation","ref_index":72,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12110","citing_title":"SOLARIS: Speculative Offloading of Latent-bAsed Representation for Inference Scaling","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J2ADB5WHYQD6TFHFI56JSMCZPS","json":"https://pith.science/pith/J2ADB5WHYQD6TFHFI56JSMCZPS.json","graph_json":"https://pith.science/api/pith-number/J2ADB5WHYQD6TFHFI56JSMCZPS/graph.json","events_json":"https://pith.science/api/pith-number/J2ADB5WHYQD6TFHFI56JSMCZPS/events.json","paper":"https://pith.science/paper/J2ADB5WH"},"agent_actions":{"view_html":"https://pith.science/pith/J2ADB5WHYQD6TFHFI56JSMCZPS","download_json":"https://pith.science/pith/J2ADB5WHYQD6TFHFI56JSMCZPS.json","view_paper":"https://pith.science/paper/J2ADB5WH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.11014&json=true","fetch_graph":"https://pith.science/api/pith-number/J2ADB5WHYQD6TFHFI56JSMCZPS/graph.json","fetch_events":"https://pith.science/api/pith-number/J2ADB5WHYQD6TFHFI56JSMCZPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2ADB5WHYQD6TFHFI56JSMCZPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2ADB5WHYQD6TFHFI56JSMCZPS/action/storage_attestation","attest_author":"https://pith.science/pith/J2ADB5WHYQD6TFHFI56JSMCZPS/action/author_attestation","sign_citation":"https://pith.science/pith/J2ADB5WHYQD6TFHFI56JSMCZPS/action/citation_signature","submit_replication":"https://pith.science/pith/J2ADB5WHYQD6TFHFI56JSMCZPS/action/replication_record"}},"created_at":"2026-07-05T04:06:59.788172+00:00","updated_at":"2026-07-05T04:06:59.788172+00:00"}