{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JX6IIDS5ELX2YIALIDRS6S3FO2","short_pith_number":"pith:JX6IIDS5","schema_version":"1.0","canonical_sha256":"4dfc840e5d22efac200b40e32f4b6576b87eea70cab2470237e53ebaf1a3b3e1","source":{"kind":"arxiv","id":"2311.15493","version":1},"attestation_state":"computed","paper":{"title":"UFIN: Universal Feature Interaction Network for Multi-Domain Click-Through Rate Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Changwang Zhang, Ji-Rong Wen, Wayne Xin Zhao, Xin Zhao, Zhao Cao, Zhen Tian","submitted_at":"2023-11-27T02:30:39Z","abstract_excerpt":"Click-Through Rate (CTR) prediction, which aims to estimate the probability of a user clicking on an item, is a key task in online advertising. Numerous existing CTR models concentrate on modeling the feature interactions within a solitary domain, thereby rendering them inadequate for fulfilling the requisites of multi-domain recommendations in real industrial scenarios. Some recent approaches propose intricate architectures to enhance knowledge sharing and augment model training across multiple domains. However, these approaches encounter difficulties when being transferred to new recommendat"},"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":"2311.15493","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-11-27T02:30:39Z","cross_cats_sorted":[],"title_canon_sha256":"2da3b5b60244c174524d871d7db5a6b628f63c9190476a774c18d4beb2c414c8","abstract_canon_sha256":"13733755530b3a5bed00195f40fff717695f302392259ce13e17e918ae4c8eaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:17:04.783371Z","signature_b64":"Py57Uw7NrLpYcygUrlWyvAKm/mEzL1C/xWexz0jlrSZMBsW4uUzOwi8z4UAI/ztwZPvXl5b/526gKSkJy1PeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dfc840e5d22efac200b40e32f4b6576b87eea70cab2470237e53ebaf1a3b3e1","last_reissued_at":"2026-07-05T07:17:04.782826Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:17:04.782826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"UFIN: Universal Feature Interaction Network for Multi-Domain Click-Through Rate Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Changwang Zhang, Ji-Rong Wen, Wayne Xin Zhao, Xin Zhao, Zhao Cao, Zhen Tian","submitted_at":"2023-11-27T02:30:39Z","abstract_excerpt":"Click-Through Rate (CTR) prediction, which aims to estimate the probability of a user clicking on an item, is a key task in online advertising. Numerous existing CTR models concentrate on modeling the feature interactions within a solitary domain, thereby rendering them inadequate for fulfilling the requisites of multi-domain recommendations in real industrial scenarios. Some recent approaches propose intricate architectures to enhance knowledge sharing and augment model training across multiple domains. However, these approaches encounter difficulties when being transferred to new recommendat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.15493","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/2311.15493/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":"2311.15493","created_at":"2026-07-05T07:17:04.782892+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.15493v1","created_at":"2026-07-05T07:17:04.782892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.15493","created_at":"2026-07-05T07:17:04.782892+00:00"},{"alias_kind":"pith_short_12","alias_value":"JX6IIDS5ELX2","created_at":"2026-07-05T07:17:04.782892+00:00"},{"alias_kind":"pith_short_16","alias_value":"JX6IIDS5ELX2YIAL","created_at":"2026-07-05T07:17:04.782892+00:00"},{"alias_kind":"pith_short_8","alias_value":"JX6IIDS5","created_at":"2026-07-05T07:17:04.782892+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10243","citing_title":"DUET -- Dual User Embedding Transformers for Offsite Conversion Prediction","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JX6IIDS5ELX2YIALIDRS6S3FO2","json":"https://pith.science/pith/JX6IIDS5ELX2YIALIDRS6S3FO2.json","graph_json":"https://pith.science/api/pith-number/JX6IIDS5ELX2YIALIDRS6S3FO2/graph.json","events_json":"https://pith.science/api/pith-number/JX6IIDS5ELX2YIALIDRS6S3FO2/events.json","paper":"https://pith.science/paper/JX6IIDS5"},"agent_actions":{"view_html":"https://pith.science/pith/JX6IIDS5ELX2YIALIDRS6S3FO2","download_json":"https://pith.science/pith/JX6IIDS5ELX2YIALIDRS6S3FO2.json","view_paper":"https://pith.science/paper/JX6IIDS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.15493&json=true","fetch_graph":"https://pith.science/api/pith-number/JX6IIDS5ELX2YIALIDRS6S3FO2/graph.json","fetch_events":"https://pith.science/api/pith-number/JX6IIDS5ELX2YIALIDRS6S3FO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JX6IIDS5ELX2YIALIDRS6S3FO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JX6IIDS5ELX2YIALIDRS6S3FO2/action/storage_attestation","attest_author":"https://pith.science/pith/JX6IIDS5ELX2YIALIDRS6S3FO2/action/author_attestation","sign_citation":"https://pith.science/pith/JX6IIDS5ELX2YIALIDRS6S3FO2/action/citation_signature","submit_replication":"https://pith.science/pith/JX6IIDS5ELX2YIALIDRS6S3FO2/action/replication_record"}},"created_at":"2026-07-05T07:17:04.782892+00:00","updated_at":"2026-07-05T07:17:04.782892+00:00"}