{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7YVBZOIONLTXZAFBE54Y4EG6KQ","short_pith_number":"pith:7YVBZOIO","schema_version":"1.0","canonical_sha256":"fe2a1cb90e6ae77c80a127798e10de542879bb730020609f662ab1e999060662","source":{"kind":"arxiv","id":"2406.16568","version":1},"attestation_state":"computed","paper":{"title":"Star+: A New Multi-Domain Model for CTR Prediction","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"\\c{C}a\\u{g}r{\\i} Ye\\c{s}il, Kaya Turgut","submitted_at":"2024-06-24T12:03:35Z","abstract_excerpt":"In this paper, we introduce Star+, a novel multi-domain model for click-through rate (CTR) prediction inspired by the Star model. Traditional single-domain approaches and existing multi-task learning techniques face challenges in multi-domain environments due to their inability to capture domain-specific data distributions and complex inter-domain relationships. Star+ addresses these limitations by enhancing the interaction between shared and domain-specific information through various fusion strategies, such as add, adaptive add, concatenation, and gating fusions, to find the optimal balance "},"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":"2406.16568","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IR","submitted_at":"2024-06-24T12:03:35Z","cross_cats_sorted":[],"title_canon_sha256":"677a4423526e720fff9f01d4341af5f55caee5888fb23c431d3360673b5116e5","abstract_canon_sha256":"85945deabf1c1fef5f3d11367ae2314f821c4662e7b0b5e3152ba141f3be8108"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:36:00.710310Z","signature_b64":"x7oSs5GjS8d7mezuwo6BGUOkX6toF9tuv63vKVLfdpSiqLZ4BRfsxl2E+uAW+68X6OawM8wLlPfUwGwZ8NnLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe2a1cb90e6ae77c80a127798e10de542879bb730020609f662ab1e999060662","last_reissued_at":"2026-07-05T08:36:00.709839Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:36:00.709839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Star+: A New Multi-Domain Model for CTR Prediction","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"\\c{C}a\\u{g}r{\\i} Ye\\c{s}il, Kaya Turgut","submitted_at":"2024-06-24T12:03:35Z","abstract_excerpt":"In this paper, we introduce Star+, a novel multi-domain model for click-through rate (CTR) prediction inspired by the Star model. Traditional single-domain approaches and existing multi-task learning techniques face challenges in multi-domain environments due to their inability to capture domain-specific data distributions and complex inter-domain relationships. Star+ addresses these limitations by enhancing the interaction between shared and domain-specific information through various fusion strategies, such as add, adaptive add, concatenation, and gating fusions, to find the optimal balance "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16568","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/2406.16568/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":"2406.16568","created_at":"2026-07-05T08:36:00.709895+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.16568v1","created_at":"2026-07-05T08:36:00.709895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16568","created_at":"2026-07-05T08:36:00.709895+00:00"},{"alias_kind":"pith_short_12","alias_value":"7YVBZOIONLTX","created_at":"2026-07-05T08:36:00.709895+00:00"},{"alias_kind":"pith_short_16","alias_value":"7YVBZOIONLTXZAFB","created_at":"2026-07-05T08:36:00.709895+00:00"},{"alias_kind":"pith_short_8","alias_value":"7YVBZOIO","created_at":"2026-07-05T08:36:00.709895+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.08198","citing_title":"Adaptive$^2$: Adaptive Domain Mining for Fine-grained Domain Adaptation Modeling","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7YVBZOIONLTXZAFBE54Y4EG6KQ","json":"https://pith.science/pith/7YVBZOIONLTXZAFBE54Y4EG6KQ.json","graph_json":"https://pith.science/api/pith-number/7YVBZOIONLTXZAFBE54Y4EG6KQ/graph.json","events_json":"https://pith.science/api/pith-number/7YVBZOIONLTXZAFBE54Y4EG6KQ/events.json","paper":"https://pith.science/paper/7YVBZOIO"},"agent_actions":{"view_html":"https://pith.science/pith/7YVBZOIONLTXZAFBE54Y4EG6KQ","download_json":"https://pith.science/pith/7YVBZOIONLTXZAFBE54Y4EG6KQ.json","view_paper":"https://pith.science/paper/7YVBZOIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.16568&json=true","fetch_graph":"https://pith.science/api/pith-number/7YVBZOIONLTXZAFBE54Y4EG6KQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7YVBZOIONLTXZAFBE54Y4EG6KQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7YVBZOIONLTXZAFBE54Y4EG6KQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7YVBZOIONLTXZAFBE54Y4EG6KQ/action/storage_attestation","attest_author":"https://pith.science/pith/7YVBZOIONLTXZAFBE54Y4EG6KQ/action/author_attestation","sign_citation":"https://pith.science/pith/7YVBZOIONLTXZAFBE54Y4EG6KQ/action/citation_signature","submit_replication":"https://pith.science/pith/7YVBZOIONLTXZAFBE54Y4EG6KQ/action/replication_record"}},"created_at":"2026-07-05T08:36:00.709895+00:00","updated_at":"2026-07-05T08:36:00.709895+00:00"}