{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NEFANSBFVPFSEXFYKY5KDWYLCH","short_pith_number":"pith:NEFANSBF","schema_version":"1.0","canonical_sha256":"690a06c825abcb225cb8563aa1db0b11efdb2ed5157f15a69cd62ede6d08c6a0","source":{"kind":"arxiv","id":"2205.08084","version":2},"attestation_state":"computed","paper":{"title":"M6-Rec: Generative Pretrained Language Models are Open-Ended Recommender Systems","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chang Zhou, Hongxia Yang, Jianxin Ma, Jingren Zhou, Zeyu Cui","submitted_at":"2022-05-17T04:13:42Z","abstract_excerpt":"Industrial recommender systems have been growing increasingly complex, may involve \\emph{diverse domains} such as e-commerce products and user-generated contents, and can comprise \\emph{a myriad of tasks} such as retrieval, ranking, explanation generation, and even AI-assisted content production. The mainstream approach so far is to develop individual algorithms for each domain and each task. In this paper, we explore the possibility of developing a unified foundation model to support \\emph{open-ended domains and tasks} in an industrial recommender system, which may reduce the demand on downst"},"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":"2205.08084","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IR","submitted_at":"2022-05-17T04:13:42Z","cross_cats_sorted":[],"title_canon_sha256":"0bb9436712ca6cb53f7f43b5369be165c911bacf579037380e030f61c114de5e","abstract_canon_sha256":"32f7d7e0b08fdf26add6618745c94bd41cf2f9480d062f54f4666eda340ca213"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:24:40.934040Z","signature_b64":"qrMuj1VfYQHXhNck6ewBA9UMtCwj30HMLhEWh58TL5UZRtBGKbJjP51Q2nH2TMOaFt5GuAZsq/gEvCZ0gfi9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"690a06c825abcb225cb8563aa1db0b11efdb2ed5157f15a69cd62ede6d08c6a0","last_reissued_at":"2026-07-05T04:24:40.933618Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:24:40.933618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"M6-Rec: Generative Pretrained Language Models are Open-Ended Recommender Systems","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chang Zhou, Hongxia Yang, Jianxin Ma, Jingren Zhou, Zeyu Cui","submitted_at":"2022-05-17T04:13:42Z","abstract_excerpt":"Industrial recommender systems have been growing increasingly complex, may involve \\emph{diverse domains} such as e-commerce products and user-generated contents, and can comprise \\emph{a myriad of tasks} such as retrieval, ranking, explanation generation, and even AI-assisted content production. The mainstream approach so far is to develop individual algorithms for each domain and each task. In this paper, we explore the possibility of developing a unified foundation model to support \\emph{open-ended domains and tasks} in an industrial recommender system, which may reduce the demand on downst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.08084","kind":"arxiv","version":2},"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/2205.08084/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":"2205.08084","created_at":"2026-07-05T04:24:40.933676+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.08084v2","created_at":"2026-07-05T04:24:40.933676+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.08084","created_at":"2026-07-05T04:24:40.933676+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEFANSBFVPFS","created_at":"2026-07-05T04:24:40.933676+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEFANSBFVPFSEXFY","created_at":"2026-07-05T04:24:40.933676+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEFANSBF","created_at":"2026-07-05T04:24:40.933676+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":19,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27930","citing_title":"An LLM-Powered Semantic Alignment Framework for Journal Recommendation","ref_index":88,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25290","citing_title":"Limitations of LTI Koopman Modeling for Nonlinear Control Systems","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29500","citing_title":"Quotient DAGs for Off-Policy Evaluation:Forward-Flow Importance Sampling and Exact Slate Propensities","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00540","citing_title":"Trustworthy Recommendation in the Era of Large Language Models: Opportunities and Challenges","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2408.08686","citing_title":"MVIGER: Multi-View Variational Integration of Complementary Knowledge for Generative Recommender","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17994","citing_title":"Towards Sustainable Growth: A Multi-Value-Aware Retrieval Framework for E-Commerce Search","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2510.11317","citing_title":"Next Interest Flow: A Generative Pre-training Paradigm for Recommender Systems by Modeling All-domain Movelines","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2510.27157","citing_title":"A Survey on Generative Recommendation: Data, Model, and Tasks","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2508.20900","citing_title":"OneRec-V2 Technical Report","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2512.21863","citing_title":"Frozen LVLMs for Micro-Video Recommendation: A Systematic Study of Feature Extraction and Fusion","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2601.21986","citing_title":"SpecTran: Spectral-Aware Transformer-based Adapter for LLM-Enhanced Sequential Recommendation","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2601.22925","citing_title":"BEAR: Towards Beam-Search-Aware Optimization for Recommendation with Large Language Models","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2402.17152","citing_title":"Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations","ref_index":75,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11553","citing_title":"TwiSTAR:Think Fast, Think Slow, Then Act,Generative Recommendation with Adaptive Reasoning","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10207","citing_title":"LASAR: Latent Adaptive Semantic Aligned Reasoning for Generative Recommendation","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10527","citing_title":"UniRank: Unified List-wise Reranking via Confidence-Ordered Denoising","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25291","citing_title":"From Local Indices to Global Identifiers: Generative Reranking for Recommender Systems via Global Action Space","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23156","citing_title":"Birds of a Feather Cluster Nearby: a Proximity-Aware Geo-Codebook for Local Service Recommendation","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22169","citing_title":"ReCast: Recasting Learning Signals for Reinforcement Learning in Generative Recommendation","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NEFANSBFVPFSEXFYKY5KDWYLCH","json":"https://pith.science/pith/NEFANSBFVPFSEXFYKY5KDWYLCH.json","graph_json":"https://pith.science/api/pith-number/NEFANSBFVPFSEXFYKY5KDWYLCH/graph.json","events_json":"https://pith.science/api/pith-number/NEFANSBFVPFSEXFYKY5KDWYLCH/events.json","paper":"https://pith.science/paper/NEFANSBF"},"agent_actions":{"view_html":"https://pith.science/pith/NEFANSBFVPFSEXFYKY5KDWYLCH","download_json":"https://pith.science/pith/NEFANSBFVPFSEXFYKY5KDWYLCH.json","view_paper":"https://pith.science/paper/NEFANSBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.08084&json=true","fetch_graph":"https://pith.science/api/pith-number/NEFANSBFVPFSEXFYKY5KDWYLCH/graph.json","fetch_events":"https://pith.science/api/pith-number/NEFANSBFVPFSEXFYKY5KDWYLCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEFANSBFVPFSEXFYKY5KDWYLCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEFANSBFVPFSEXFYKY5KDWYLCH/action/storage_attestation","attest_author":"https://pith.science/pith/NEFANSBFVPFSEXFYKY5KDWYLCH/action/author_attestation","sign_citation":"https://pith.science/pith/NEFANSBFVPFSEXFYKY5KDWYLCH/action/citation_signature","submit_replication":"https://pith.science/pith/NEFANSBFVPFSEXFYKY5KDWYLCH/action/replication_record"}},"created_at":"2026-07-05T04:24:40.933676+00:00","updated_at":"2026-07-05T04:24:40.933676+00:00"}