{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:LRW3KIWFNJZA2UM4DDIAV2ZEAE","short_pith_number":"pith:LRW3KIWF","schema_version":"1.0","canonical_sha256":"5c6db522c56a720d519c18d00aeb240103e176b821d0f79b1f4858e17468cda4","source":{"kind":"arxiv","id":"2011.11938","version":1},"attestation_state":"computed","paper":{"title":"DADNN: Multi-Scene CTR Prediction via Domain-Aware Deep Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.AI","authors_text":"Feng Xing, Guibao Mei, Junyou He, Weipeng Yan, Xiaorui Yang, Yongjun Bao","submitted_at":"2020-11-24T07:30:52Z","abstract_excerpt":"Click through rate(CTR) prediction is a core task in advertising systems. The booming e-commerce business in our company, results in a growing number of scenes. Most of them are so-called long-tail scenes, which means that the traffic of a single scene is limited, but the overall traffic is considerable. Typical studies mainly focus on serving a single scene with a well designed model. However, this method brings excessive resource consumption both on offline training and online serving. Besides, simply training a single model with data from multiple scenes ignores the characteristics of their"},"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":"2011.11938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-11-24T07:30:52Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"ea9e2085bd87ea3a10761604e12e4a105043e775be32ce40d9163d72325f584e","abstract_canon_sha256":"a22dc4d7565bd4fb97eedf8fceb35747ad3f6ee664859d979117c7e6577b9a87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:06.478540Z","signature_b64":"lttR9schnukmjFqTtM5bAHeFjfiUexwucPPOSBfaJv98AmTb8pTtlxj2mOLGSqQNhEs1vrtRO3TLr+0EOds0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c6db522c56a720d519c18d00aeb240103e176b821d0f79b1f4858e17468cda4","last_reissued_at":"2026-07-05T01:54:06.478185Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:06.478185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DADNN: Multi-Scene CTR Prediction via Domain-Aware Deep Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.AI","authors_text":"Feng Xing, Guibao Mei, Junyou He, Weipeng Yan, Xiaorui Yang, Yongjun Bao","submitted_at":"2020-11-24T07:30:52Z","abstract_excerpt":"Click through rate(CTR) prediction is a core task in advertising systems. The booming e-commerce business in our company, results in a growing number of scenes. Most of them are so-called long-tail scenes, which means that the traffic of a single scene is limited, but the overall traffic is considerable. Typical studies mainly focus on serving a single scene with a well designed model. However, this method brings excessive resource consumption both on offline training and online serving. Besides, simply training a single model with data from multiple scenes ignores the characteristics of their"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.11938","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/2011.11938/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":"2011.11938","created_at":"2026-07-05T01:54:06.478240+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.11938v1","created_at":"2026-07-05T01:54:06.478240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.11938","created_at":"2026-07-05T01:54:06.478240+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRW3KIWFNJZA","created_at":"2026-07-05T01:54:06.478240+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRW3KIWFNJZA2UM4","created_at":"2026-07-05T01:54:06.478240+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRW3KIWF","created_at":"2026-07-05T01:54:06.478240+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.14268","citing_title":"Pre-train and Fine-tune: Recommenders as Large Models","ref_index":2020,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LRW3KIWFNJZA2UM4DDIAV2ZEAE","json":"https://pith.science/pith/LRW3KIWFNJZA2UM4DDIAV2ZEAE.json","graph_json":"https://pith.science/api/pith-number/LRW3KIWFNJZA2UM4DDIAV2ZEAE/graph.json","events_json":"https://pith.science/api/pith-number/LRW3KIWFNJZA2UM4DDIAV2ZEAE/events.json","paper":"https://pith.science/paper/LRW3KIWF"},"agent_actions":{"view_html":"https://pith.science/pith/LRW3KIWFNJZA2UM4DDIAV2ZEAE","download_json":"https://pith.science/pith/LRW3KIWFNJZA2UM4DDIAV2ZEAE.json","view_paper":"https://pith.science/paper/LRW3KIWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.11938&json=true","fetch_graph":"https://pith.science/api/pith-number/LRW3KIWFNJZA2UM4DDIAV2ZEAE/graph.json","fetch_events":"https://pith.science/api/pith-number/LRW3KIWFNJZA2UM4DDIAV2ZEAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRW3KIWFNJZA2UM4DDIAV2ZEAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRW3KIWFNJZA2UM4DDIAV2ZEAE/action/storage_attestation","attest_author":"https://pith.science/pith/LRW3KIWFNJZA2UM4DDIAV2ZEAE/action/author_attestation","sign_citation":"https://pith.science/pith/LRW3KIWFNJZA2UM4DDIAV2ZEAE/action/citation_signature","submit_replication":"https://pith.science/pith/LRW3KIWFNJZA2UM4DDIAV2ZEAE/action/replication_record"}},"created_at":"2026-07-05T01:54:06.478240+00:00","updated_at":"2026-07-05T01:54:06.478240+00:00"}