{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:Z6NL4KCSXUSWGTODKW54R25JRE","short_pith_number":"pith:Z6NL4KCS","schema_version":"1.0","canonical_sha256":"cf9abe2852bd25634dc355bbc8eba9890babb180efb3dea8ddd1fd10f96e7740","source":{"kind":"arxiv","id":"2105.03300","version":1},"attestation_state":"computed","paper":{"title":"DA-GCN: A Domain-aware Attentive Graph Convolution Network for Shared-account Cross-domain Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Hongzhi Yin, Lei Guo, Lei Zhu, Li Tang, Quoc Viet Hung Nguyen, Tong Chen","submitted_at":"2021-05-07T14:52:06Z","abstract_excerpt":"Shared-account Cross-domain Sequential recommendation (SCSR) is the task of recommending the next item based on a sequence of recorded user behaviors, where multiple users share a single account, and their behaviours are available in multiple domains. Existing work on solving SCSR mainly relies on mining sequential patterns via RNN-based models, which are not expressive enough to capture the relationships among multiple entities. Moreover, all existing algorithms try to bridge two domains via knowledge transfer in the latent space, and the explicit cross-domain graph structure is unexploited. "},"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":"2105.03300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-05-07T14:52:06Z","cross_cats_sorted":[],"title_canon_sha256":"c531d60ec55522cd9d23b80d2acb66217b6482feb5ec6dcdcbe9544ef4e49ae2","abstract_canon_sha256":"e5b38ffe88f5d44c4052c64f8d9313165f2c419db0dd1820ee53fa1ef6898308"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:38:24.168102Z","signature_b64":"XTkVj7tuFT1i8RKy2U18a5uwGihWhw3ywFWPZdLe1IpVVMfPpBxEEHm1V8kr257kX/s8YAD6/boE3pTq5gbGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf9abe2852bd25634dc355bbc8eba9890babb180efb3dea8ddd1fd10f96e7740","last_reissued_at":"2026-07-05T02:38:24.167612Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:38:24.167612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DA-GCN: A Domain-aware Attentive Graph Convolution Network for Shared-account Cross-domain Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Hongzhi Yin, Lei Guo, Lei Zhu, Li Tang, Quoc Viet Hung Nguyen, Tong Chen","submitted_at":"2021-05-07T14:52:06Z","abstract_excerpt":"Shared-account Cross-domain Sequential recommendation (SCSR) is the task of recommending the next item based on a sequence of recorded user behaviors, where multiple users share a single account, and their behaviours are available in multiple domains. Existing work on solving SCSR mainly relies on mining sequential patterns via RNN-based models, which are not expressive enough to capture the relationships among multiple entities. Moreover, all existing algorithms try to bridge two domains via knowledge transfer in the latent space, and the explicit cross-domain graph structure is unexploited. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.03300","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/2105.03300/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":"2105.03300","created_at":"2026-07-05T02:38:24.167669+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.03300v1","created_at":"2026-07-05T02:38:24.167669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.03300","created_at":"2026-07-05T02:38:24.167669+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z6NL4KCSXUSW","created_at":"2026-07-05T02:38:24.167669+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z6NL4KCSXUSWGTOD","created_at":"2026-07-05T02:38:24.167669+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z6NL4KCS","created_at":"2026-07-05T02:38:24.167669+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10357","citing_title":"Atomic Intent Reasoning: Bringing LLM Semantics to Industrial Cross-Domain Recommendations","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2511.19931","citing_title":"LLM-EDT: Large Language Model Enhanced Cross-domain Sequential Recommendation with Dual-phase Training","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09551","citing_title":"SemaCDR: LLM-Powered Transferable Semantics for Cross-Domain Sequential Recommendation","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14833","citing_title":"Federated User Behavior Modeling for Privacy-Preserving LLM Recommendation","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z6NL4KCSXUSWGTODKW54R25JRE","json":"https://pith.science/pith/Z6NL4KCSXUSWGTODKW54R25JRE.json","graph_json":"https://pith.science/api/pith-number/Z6NL4KCSXUSWGTODKW54R25JRE/graph.json","events_json":"https://pith.science/api/pith-number/Z6NL4KCSXUSWGTODKW54R25JRE/events.json","paper":"https://pith.science/paper/Z6NL4KCS"},"agent_actions":{"view_html":"https://pith.science/pith/Z6NL4KCSXUSWGTODKW54R25JRE","download_json":"https://pith.science/pith/Z6NL4KCSXUSWGTODKW54R25JRE.json","view_paper":"https://pith.science/paper/Z6NL4KCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.03300&json=true","fetch_graph":"https://pith.science/api/pith-number/Z6NL4KCSXUSWGTODKW54R25JRE/graph.json","fetch_events":"https://pith.science/api/pith-number/Z6NL4KCSXUSWGTODKW54R25JRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z6NL4KCSXUSWGTODKW54R25JRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z6NL4KCSXUSWGTODKW54R25JRE/action/storage_attestation","attest_author":"https://pith.science/pith/Z6NL4KCSXUSWGTODKW54R25JRE/action/author_attestation","sign_citation":"https://pith.science/pith/Z6NL4KCSXUSWGTODKW54R25JRE/action/citation_signature","submit_replication":"https://pith.science/pith/Z6NL4KCSXUSWGTODKW54R25JRE/action/replication_record"}},"created_at":"2026-07-05T02:38:24.167669+00:00","updated_at":"2026-07-05T02:38:24.167669+00:00"}