{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:CQ7ATVYNXDERANUYOP5ESQZNYE","short_pith_number":"pith:CQ7ATVYN","schema_version":"1.0","canonical_sha256":"143e09d70db8c910369873fa49432dc1104ad6c574aa05dc05e8ba570bdc9d43","source":{"kind":"arxiv","id":"2204.11510","version":1},"attestation_state":"computed","paper":{"title":"MLP4Rec: A Pure MLP Architecture for Sequential Recommendations","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chuan Lyu, Minghao Zhao, Muyang Li, Runze Wu, Ruocheng Guo, Xiangyu Zhao","submitted_at":"2022-04-25T08:42:47Z","abstract_excerpt":"Self-attention models have achieved state-of-the-art performance in sequential recommender systems by capturing the sequential dependencies among user-item interactions. However, they rely on positional embeddings to retain the sequential information, which may break the semantics of item embeddings. In addition, most existing works assume that such sequential dependencies exist solely in the item embeddings, but neglect their existence among the item features. In this work, we propose a novel sequential recommender system (MLP4Rec) based on the recent advances of MLP-based architectures, whic"},"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":"2204.11510","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IR","submitted_at":"2022-04-25T08:42:47Z","cross_cats_sorted":[],"title_canon_sha256":"44d3fa4cad4cbabf72e48c73404efa894bdc1d343475f08850b8b0a56ec4726e","abstract_canon_sha256":"e642f0a6d898eca573aeef39f3eded7df0b986a5fcceaf5a53135f4fc38989e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:17:28.843047Z","signature_b64":"+1F67G43Frlj82N48pcWMUzCdKA7TIMppe4+ECp/n++guEYMEoIjxu1dqhOTVjlVLnnQbACt+F6k537NY6MVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"143e09d70db8c910369873fa49432dc1104ad6c574aa05dc05e8ba570bdc9d43","last_reissued_at":"2026-07-05T04:17:28.842585Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:17:28.842585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MLP4Rec: A Pure MLP Architecture for Sequential Recommendations","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Chuan Lyu, Minghao Zhao, Muyang Li, Runze Wu, Ruocheng Guo, Xiangyu Zhao","submitted_at":"2022-04-25T08:42:47Z","abstract_excerpt":"Self-attention models have achieved state-of-the-art performance in sequential recommender systems by capturing the sequential dependencies among user-item interactions. However, they rely on positional embeddings to retain the sequential information, which may break the semantics of item embeddings. In addition, most existing works assume that such sequential dependencies exist solely in the item embeddings, but neglect their existence among the item features. In this work, we propose a novel sequential recommender system (MLP4Rec) based on the recent advances of MLP-based architectures, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.11510","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/2204.11510/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":"2204.11510","created_at":"2026-07-05T04:17:28.842636+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.11510v1","created_at":"2026-07-05T04:17:28.842636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.11510","created_at":"2026-07-05T04:17:28.842636+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQ7ATVYNXDER","created_at":"2026-07-05T04:17:28.842636+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQ7ATVYNXDERANUY","created_at":"2026-07-05T04:17:28.842636+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQ7ATVYN","created_at":"2026-07-05T04:17:28.842636+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.13368","citing_title":"BlossomRec: Block-level Fused Sparse Attention Mechanism for Sequential Recommendations","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27981","citing_title":"ITS-Mina: A Harris Hawks Optimization-Based All-MLP Framework with Iterative Refinement and External Attention for Multivariate Time Series Forecasting","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CQ7ATVYNXDERANUYOP5ESQZNYE","json":"https://pith.science/pith/CQ7ATVYNXDERANUYOP5ESQZNYE.json","graph_json":"https://pith.science/api/pith-number/CQ7ATVYNXDERANUYOP5ESQZNYE/graph.json","events_json":"https://pith.science/api/pith-number/CQ7ATVYNXDERANUYOP5ESQZNYE/events.json","paper":"https://pith.science/paper/CQ7ATVYN"},"agent_actions":{"view_html":"https://pith.science/pith/CQ7ATVYNXDERANUYOP5ESQZNYE","download_json":"https://pith.science/pith/CQ7ATVYNXDERANUYOP5ESQZNYE.json","view_paper":"https://pith.science/paper/CQ7ATVYN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.11510&json=true","fetch_graph":"https://pith.science/api/pith-number/CQ7ATVYNXDERANUYOP5ESQZNYE/graph.json","fetch_events":"https://pith.science/api/pith-number/CQ7ATVYNXDERANUYOP5ESQZNYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQ7ATVYNXDERANUYOP5ESQZNYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQ7ATVYNXDERANUYOP5ESQZNYE/action/storage_attestation","attest_author":"https://pith.science/pith/CQ7ATVYNXDERANUYOP5ESQZNYE/action/author_attestation","sign_citation":"https://pith.science/pith/CQ7ATVYNXDERANUYOP5ESQZNYE/action/citation_signature","submit_replication":"https://pith.science/pith/CQ7ATVYNXDERANUYOP5ESQZNYE/action/replication_record"}},"created_at":"2026-07-05T04:17:28.842636+00:00","updated_at":"2026-07-05T04:17:28.842636+00:00"}