{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WIXA26BXKXAJTOJ4HW5D2MRHJY","short_pith_number":"pith:WIXA26BX","schema_version":"1.0","canonical_sha256":"b22e0d783755c099b93c3dba3d32274e37e983be0c8e821d4ce83632e36185d4","source":{"kind":"arxiv","id":"2502.05523","version":3},"attestation_state":"computed","paper":{"title":"Adaptive Domain Scaling for Personalized Sequential Modeling in Recommenders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Di Chen, Hui Lu, Qin Ren, Xun Zhou, Yuchao Zheng, Zheng Chai","submitted_at":"2025-02-08T11:05:22Z","abstract_excerpt":"Users generally exhibit complex behavioral patterns and diverse intentions in multiple business scenarios of super applications like Douyin, presenting great challenges to current industrial multi-domain recommenders. To mitigate the discrepancies across diverse domains, researches and industrial practices generally emphasize sophisticated network structures to accomodate diverse data distributions, while neglecting the inherent understanding of user behavioral sequence from the multi-domain perspective. In this paper, we present Adaptive Domain Scaling (ADS) model, which comprehensively enhan"},"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":"2502.05523","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2025-02-08T11:05:22Z","cross_cats_sorted":[],"title_canon_sha256":"dc6921c4b4ce146029de1942983b0772ac87297451d676774ec1a8d8b783de2a","abstract_canon_sha256":"215269790d320bae9c4c0415cedf3d7365891e8f29b1274a6be8a232ad3a2ee9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:42.986821Z","signature_b64":"d5B31R8yoGo0xms7ROf5fpiuG4HEyg3ivZIkoxSzOnvvT9VHm1htkg4j6Zr1HS4QNyAd6otzTUAjwK5mz+CuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b22e0d783755c099b93c3dba3d32274e37e983be0c8e821d4ce83632e36185d4","last_reissued_at":"2026-07-05T10:54:42.986339Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:42.986339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Domain Scaling for Personalized Sequential Modeling in Recommenders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Di Chen, Hui Lu, Qin Ren, Xun Zhou, Yuchao Zheng, Zheng Chai","submitted_at":"2025-02-08T11:05:22Z","abstract_excerpt":"Users generally exhibit complex behavioral patterns and diverse intentions in multiple business scenarios of super applications like Douyin, presenting great challenges to current industrial multi-domain recommenders. To mitigate the discrepancies across diverse domains, researches and industrial practices generally emphasize sophisticated network structures to accomodate diverse data distributions, while neglecting the inherent understanding of user behavioral sequence from the multi-domain perspective. In this paper, we present Adaptive Domain Scaling (ADS) model, which comprehensively enhan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05523","kind":"arxiv","version":3},"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/2502.05523/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":"2502.05523","created_at":"2026-07-05T10:54:42.986398+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.05523v3","created_at":"2026-07-05T10:54:42.986398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05523","created_at":"2026-07-05T10:54:42.986398+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIXA26BXKXAJ","created_at":"2026-07-05T10:54:42.986398+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIXA26BXKXAJTOJ4","created_at":"2026-07-05T10:54:42.986398+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIXA26BX","created_at":"2026-07-05T10:54:42.986398+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.10455","citing_title":"Compute Only Once: UG-Separation for Efficient Large Recommendation Models","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WIXA26BXKXAJTOJ4HW5D2MRHJY","json":"https://pith.science/pith/WIXA26BXKXAJTOJ4HW5D2MRHJY.json","graph_json":"https://pith.science/api/pith-number/WIXA26BXKXAJTOJ4HW5D2MRHJY/graph.json","events_json":"https://pith.science/api/pith-number/WIXA26BXKXAJTOJ4HW5D2MRHJY/events.json","paper":"https://pith.science/paper/WIXA26BX"},"agent_actions":{"view_html":"https://pith.science/pith/WIXA26BXKXAJTOJ4HW5D2MRHJY","download_json":"https://pith.science/pith/WIXA26BXKXAJTOJ4HW5D2MRHJY.json","view_paper":"https://pith.science/paper/WIXA26BX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.05523&json=true","fetch_graph":"https://pith.science/api/pith-number/WIXA26BXKXAJTOJ4HW5D2MRHJY/graph.json","fetch_events":"https://pith.science/api/pith-number/WIXA26BXKXAJTOJ4HW5D2MRHJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIXA26BXKXAJTOJ4HW5D2MRHJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIXA26BXKXAJTOJ4HW5D2MRHJY/action/storage_attestation","attest_author":"https://pith.science/pith/WIXA26BXKXAJTOJ4HW5D2MRHJY/action/author_attestation","sign_citation":"https://pith.science/pith/WIXA26BXKXAJTOJ4HW5D2MRHJY/action/citation_signature","submit_replication":"https://pith.science/pith/WIXA26BXKXAJTOJ4HW5D2MRHJY/action/replication_record"}},"created_at":"2026-07-05T10:54:42.986398+00:00","updated_at":"2026-07-05T10:54:42.986398+00:00"}