{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/sequential-recommendation","name":"Sequential Recommendation","slug":"sequential-recommendation","description_markdown":"Sequential recommendation is a sophisticated approach to providing personalized suggestions by analyzing users' historical interactions in a sequential manner. Unlike traditional recommendation systems, which consider items in isolation, sequential recommendation takes into account the temporal order of user actions. This method is particularly valuable in domains where the sequence of events matters, such as streaming services, e-commerce platforms, and social media.","categories":[{"name":"Graphs","url":"/area/graphs"},{"name":"Knowledge Base","url":"/area/knowledge-base"},{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":554,"papers_with_code":300,"benchmarks":13,"benchmark_tables_in_archive":13,"benchmark_tables_shown":13,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":11,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/sequential-recommendation-on-movielens-1m","slug":"sequential-recommendation-on-movielens-1m","dataset":"MovieLens 1M","dataset_url":"/dataset/movielens","rows_in_archive":4,"metrics":["HR@5","HR@10","HR@20","NDCG@5","NDCG@10","NDCG@20","HR@5 (99 Neg. Samples)","HR@10 (99 Neg. Samples)","NDCG@5 (99 Neg. Samples)","NDCG@10 (99 Neg. Samples)","MRR (99 Neg. Samples)","HR@50","MRR@10","MRR@20","MRR@50","NDCG@50"],"first_row_in_archive_order":{"model":"TiM4Rec","paper_title":"TiM4Rec: An Efficient Sequential Recommendation Model Based on Time-Aware Structured State Space Duality Model","paper_url":"/paper/tim4rec-an-efficient-sequential","paper_date":"2024-09-24","arxiv_id":"2409.16182","code_links":[{"title":"alwaysfhao/tim4rec","url":"https://github.com/alwaysfhao/tim4rec"}],"syntology":null}},{"leaderboard":"/sota/sequential-recommendation-on-amazon-beauty","slug":"sequential-recommendation-on-amazon-beauty","dataset":"Amazon-Beauty","dataset_url":null,"rows_in_archive":3,"metrics":["HR@10","nDCG@10","HR@20","HR@5","NDCG@20","NDCG@5","HR@50","MRR@10","MRR@20","MRR@50","NDCG@50"],"first_row_in_archive_order":{"model":"BSARec","paper_title":"An Attentive Inductive Bias for Sequential Recommendation beyond the Self-Attention","paper_url":"/paper/an-attentive-inductive-bias-for-sequential","paper_date":"2023-12-16","arxiv_id":"2312.10325","code_links":[{"title":"yehjin-shin/bsarec","url":"https://github.com/yehjin-shin/bsarec"},{"title":"jeongwhanchoi/BSARec","url":"https://github.com/jeongwhanchoi/BSARec"}],"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-attentive-inductive-bias-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2312.10325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.10325"}},"official":{"repos":["jeongwhanchoi/BSARec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/sequential-recommendation-on-amazon-sports","slug":"sequential-recommendation-on-amazon-sports","dataset":"Amazon-Sports","dataset_url":"/dataset/amazon-sports","rows_in_archive":3,"metrics":["HR@10","HR@5","HR@20","NDCG@10","NDCG@5","MRR@10"],"first_row_in_archive_order":{"model":"SS4Rec","paper_title":"SS4Rec: Continuous-Time Sequential Recommendation with State Space Models","paper_url":"/paper/ss4rec-continuous-time-sequential","paper_date":"2025-02-12","arxiv_id":"2502.08132","code_links":[{"title":"XiaoWei-i/SS4Rec","url":"https://github.com/XiaoWei-i/SS4Rec"}],"syntology":null}},{"leaderboard":"/sota/sequential-recommendation-on-amazon-beauty-1","slug":"sequential-recommendation-on-amazon-beauty-1","dataset":"Amazon Beauty","dataset_url":"/dataset/amazon-beauty","rows_in_archive":1,"metrics":["HR@10","NDCG@10"],"first_row_in_archive_order":{"model":"SASRec-SCE","paper_title":"Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogs","paper_url":"/paper/scalable-cross-entropy-loss-for-sequential","paper_date":"2024-09-27","arxiv_id":"2409.18721","code_links":[{"title":"AIRI-Institute/Scalable-SASRec","url":"https://github.com/AIRI-Institute/Scalable-SASRec"}],"syntology":null}},{"leaderboard":"/sota/sequential-recommendation-on-amazon-cell","slug":"sequential-recommendation-on-amazon-cell","dataset":"Amazon Cell Phones","dataset_url":null,"rows_in_archive":1,"metrics":["Hit@5"],"first_row_in_archive_order":{"model":"PERIS","paper_title":"Beyond Learning from Next Item: Sequential Recommendation via Personalized Interest Sustainability","paper_url":"/paper/beyond-learning-from-next-item-sequential","paper_date":"2022-09-14","arxiv_id":"2209.06644","code_links":[{"title":"dmhyun/PERIS","url":"https://github.com/dmhyun/PERIS"}],"syntology":null}},{"leaderboard":"/sota/sequential-recommendation-on-amazon-men","slug":"sequential-recommendation-on-amazon-men","dataset":"Amazon Men","dataset_url":"/dataset/amazon-men","rows_in_archive":1,"metrics":["Hit@10"],"first_row_in_archive_order":{"model":"CARCA","paper_title":"CARCA: Context and Attribute-Aware Next-Item Recommendation via Cross-Attention","paper_url":"/paper/carca-context-and-attribute-aware-next-item","paper_date":"2022-04-04","arxiv_id":"2204.06519","code_links":[{"title":"ahmedrashed-ml/carca","url":"https://github.com/ahmedrashed-ml/carca"},{"title":"ariaattar/CASM-PyTorch","url":"https://github.com/ariaattar/CASM-PyTorch"}],"syntology":null}},{"leaderboard":"/sota/sequential-recommendation-on-amazon-toys","slug":"sequential-recommendation-on-amazon-toys","dataset":"Amazon-Toys","dataset_url":null,"rows_in_archive":1,"metrics":["HR@5"],"first_row_in_archive_order":{"model":"BSARec","paper_title":"An Attentive Inductive Bias for Sequential Recommendation beyond the Self-Attention","paper_url":"/paper/an-attentive-inductive-bias-for-sequential","paper_date":"2023-12-16","arxiv_id":"2312.10325","code_links":[{"title":"yehjin-shin/bsarec","url":"https://github.com/yehjin-shin/bsarec"},{"title":"jeongwhanchoi/BSARec","url":"https://github.com/jeongwhanchoi/BSARec"}],"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-attentive-inductive-bias-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2312.10325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.10325"}},"official":{"repos":["jeongwhanchoi/BSARec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/sequential-recommendation-on-amazon-video","slug":"sequential-recommendation-on-amazon-video","dataset":"Amazon-Video-Games","dataset_url":null,"rows_in_archive":1,"metrics":["HR@10","NDCG@10","MRR@10"],"first_row_in_archive_order":{"model":"SS4Rec","paper_title":"SS4Rec: Continuous-Time Sequential Recommendation with State Space Models","paper_url":"/paper/ss4rec-continuous-time-sequential","paper_date":"2025-02-12","arxiv_id":"2502.08132","code_links":[{"title":"XiaoWei-i/SS4Rec","url":"https://github.com/XiaoWei-i/SS4Rec"}],"syntology":null}},{"leaderboard":"/sota/sequential-recommendation-on-behance","slug":"sequential-recommendation-on-behance","dataset":"Behance","dataset_url":null,"rows_in_archive":1,"metrics":["COV@1","COV@10","COV@5","HR@10","HR@5","NDCG@1","NDCG@10","NDCG@5"],"first_row_in_archive_order":{"model":"SASRec-SCE","paper_title":"Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogs","paper_url":"/paper/scalable-cross-entropy-loss-for-sequential","paper_date":"2024-09-27","arxiv_id":"2409.18721","code_links":[{"title":"AIRI-Institute/Scalable-SASRec","url":"https://github.com/AIRI-Institute/Scalable-SASRec"}],"syntology":null}},{"leaderboard":"/sota/sequential-recommendation-on-gowalla","slug":"sequential-recommendation-on-gowalla","dataset":"Gowalla","dataset_url":"/dataset/gowalla","rows_in_archive":1,"metrics":["COV@1","COV@10","COV@5","HR@10","HR@5","NDCG@1","NDCG@10","NDCG@5"],"first_row_in_archive_order":{"model":"SASRec-SCE","paper_title":"Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogs","paper_url":"/paper/scalable-cross-entropy-loss-for-sequential","paper_date":"2024-09-27","arxiv_id":"2409.18721","code_links":[{"title":"AIRI-Institute/Scalable-SASRec","url":"https://github.com/AIRI-Institute/Scalable-SASRec"}],"syntology":null}},{"leaderboard":"/sota/sequential-recommendation-on-kuairand","slug":"sequential-recommendation-on-kuairand","dataset":"KuaiRand","dataset_url":"/dataset/kuairand","rows_in_archive":1,"metrics":["HR@10","HR@20","HR@50","MRR@10","MRR@20","MRR@50","NDCG@10","NDCG@20","NDCG@50"],"first_row_in_archive_order":{"model":"TiM4Rec","paper_title":"TiM4Rec: An Efficient Sequential Recommendation Model Based on Time-Aware Structured State Space Duality Model","paper_url":"/paper/tim4rec-an-efficient-sequential","paper_date":"2024-09-24","arxiv_id":"2409.16182","code_links":[{"title":"alwaysfhao/tim4rec","url":"https://github.com/alwaysfhao/tim4rec"}],"syntology":null}},{"leaderboard":"/sota/sequential-recommendation-on-lastfm","slug":"sequential-recommendation-on-lastfm","dataset":"LastFM","dataset_url":null,"rows_in_archive":1,"metrics":["HR@5","HR@10","HR@20","NDCG@5","NDCG@10","NDCG@20","HR@5 (99 Neg. Samples)","HR@10 (99 Neg. Samples)","NDCG@5 (99 Neg. Samples)","NDCG@10 (99 Neg. Samples)","MRR (99 Neg. Samples)"],"first_row_in_archive_order":{"model":"BSARec","paper_title":"An Attentive Inductive Bias for Sequential Recommendation beyond the Self-Attention","paper_url":"/paper/an-attentive-inductive-bias-for-sequential","paper_date":"2023-12-16","arxiv_id":"2312.10325","code_links":[{"title":"yehjin-shin/bsarec","url":"https://github.com/yehjin-shin/bsarec"},{"title":"jeongwhanchoi/BSARec","url":"https://github.com/jeongwhanchoi/BSARec"}],"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-attentive-inductive-bias-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2312.10325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.10325"}},"official":{"repos":["jeongwhanchoi/BSARec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/sequential-recommendation-on-yelp","slug":"sequential-recommendation-on-yelp","dataset":"Yelp","dataset_url":"/dataset/yelp","rows_in_archive":1,"metrics":["HR@5","HR@10","HR@20","NDCG@5","NDCG@10","NDCG@20","HR@5 (99 Neg. Samples)","HR@10 (99 Neg. Samples)","NDCG@5 (99 Neg. Samples)","NDCG@10 (99 Neg. Samples)","MRR (99 Neg. Samples)"],"first_row_in_archive_order":{"model":"BSARec","paper_title":"An Attentive Inductive Bias for Sequential Recommendation beyond the Self-Attention","paper_url":"/paper/an-attentive-inductive-bias-for-sequential","paper_date":"2023-12-16","arxiv_id":"2312.10325","code_links":[{"title":"yehjin-shin/bsarec","url":"https://github.com/yehjin-shin/bsarec"},{"title":"jeongwhanchoi/BSARec","url":"https://github.com/jeongwhanchoi/BSARec"}],"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-attentive-inductive-bias-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2312.10325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.10325"}},"official":{"repos":["jeongwhanchoi/BSARec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}}}],"datasets":[{"url":"/dataset/movielens","name":"MovieLens","full_name":"MovieLens","num_papers_in_archive":1246},{"url":"/dataset/gowalla","name":"Gowalla","full_name":"Gowalla","num_papers_in_archive":203},{"url":"/dataset/yelp","name":"Yelp","full_name":"","num_papers_in_archive":86},{"url":"/dataset/kuairand","name":"KuaiRand","full_name":"","num_papers_in_archive":42},{"url":"/dataset/amazon-review","name":"Amazon Review","full_name":"","num_papers_in_archive":35},{"url":"/dataset/amazon-beauty","name":"Amazon Beauty","full_name":"Amazon Beauty 5-core","num_papers_in_archive":18},{"url":"/dataset/amazon-men","name":"Amazon Men","full_name":"Amazon Men","num_papers_in_archive":14},{"url":"/dataset/amazon-sports","name":"Amazon-Sports","full_name":"Amazon-Sports","num_papers_in_archive":14},{"url":"/dataset/pixelrec","name":"PixelRec","full_name":"","num_papers_in_archive":1},{"url":"/dataset/tida-gcn-data","name":"tida-gcn-data","full_name":"tida-gcn-data","num_papers_in_archive":1},{"url":"/dataset/x-wines","name":"X-Wines","full_name":"A Wine Dataset for Recommender Systems and Machine Learning","num_papers_in_archive":0}],"subtasks":[],"parent_tasks":[{"url":"/task/recommendation-systems","name":"Recommendation Systems"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":6,"rows_per_page":100,"shown":100,"of":554,"of_with_code":300,"tagged_in_all":554,"counts":{"archive_papers_tagged":554,"with_a_code_link":300,"where_syntology_ran_a_sample":69,"not_listed_spam_title":0,"listed":554,"listed_where_code_ran":69,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":52,"every_run_a_failure_of_syntologys_instrument":17,"listed_with_a_run_with_no_instrument_failure":52,"listed_every_run_a_failure_of_syntologys_instrument":17,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/bert4rec-sequential-recommendation-with","slug":"bert4rec-sequential-recommendation-with","title":"BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformer","date":"2019-04-14","arxiv_id":"1904.06690","repositories_listed":8,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bert4rec-sequential-recommendation-with#ran","syntology_url":"https://syntology.ai/paper/1904.06690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.06690"}},"official":{"repos":["FeiSun/BERT4Rec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/180809781","slug":"180809781","title":"Self-Attentive Sequential Recommendation","date":"2018-08-20","arxiv_id":"1808.09781","repositories_listed":8,"syntology":{"n":20,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":5,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/180809781#ran","syntology_url":"https://syntology.ai/paper/1808.09781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.09781"}},"official":null}},{"url":"/paper/tisasrec-time-interval-aware-self-attention","slug":"tisasrec-time-interval-aware-self-attention","title":"TiSASRec: Time Interval Aware Self-Attention for Sequential Recommendation","date":"2020-01-01","arxiv_id":null,"repositories_listed":5,"syntology":null},{"url":"/paper/personalized-top-n-sequential-recommendation","slug":"personalized-top-n-sequential-recommendation","title":"Personalized Top-N Sequential Recommendation via Convolutional Sequence Embedding","date":"2018-09-19","arxiv_id":"1809.07426","repositories_listed":5,"syntology":null},{"url":"/paper/openp5-benchmarking-foundation-models-for","slug":"openp5-benchmarking-foundation-models-for","title":"OpenP5: An Open-Source Platform for Developing, Training, and Evaluating LLM-based Recommender Systems","date":"2023-06-19","arxiv_id":"2306.11134","repositories_listed":4,"syntology":{"n":25,"n_ran":23,"n_constructed":0,"n_ran_checked":16,"n_instrument":7,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":14,"n_pointer_only":9,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 1 honoured, 1 violated, 14 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/openp5-benchmarking-foundation-models-for#ran","syntology_url":"https://syntology.ai/paper/2306.11134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.11134"}},"official":{"repos":["agiresearch/openp5"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/deeprec-an-open-source-toolkit-for-deep","slug":"deeprec-an-open-source-toolkit-for-deep","title":"DeepRec: An Open-source Toolkit for Deep Learning based Recommendation","date":"2019-05-25","arxiv_id":"1905.10536","repositories_listed":4,"syntology":null},{"url":"/paper/auto-encoding-or-auto-regression-a-reality","slug":"auto-encoding-or-auto-regression-a-reality","title":"Your Causal Self-Attentive Recommender Hosts a Lonely Neighborhood","date":"2024-06-04","arxiv_id":"2406.02048","repositories_listed":3,"syntology":null},{"url":"/paper/context-aware-sequential-model-for-multi","slug":"context-aware-sequential-model-for-multi","title":"Context-Aware Sequential Model for Multi-Behaviour Recommendation","date":"2023-12-15","arxiv_id":"2312.09684","repositories_listed":3,"syntology":null},{"url":"/paper/revisiting-self-attentive-sequential","slug":"revisiting-self-attentive-sequential","title":"Revisiting Self-Attentive Sequential Recommendation","date":"2025-04-13","arxiv_id":"2504.09596","repositories_listed":2,"syntology":null},{"url":"/paper/large-language-model-empowered-embedding","slug":"large-language-model-empowered-embedding","title":"LLMEmb: Large Language Model Can Be a Good Embedding Generator for Sequential Recommendation","date":"2024-09-30","arxiv_id":"2409.19925","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-language-model-empowered-embedding#ran","syntology_url":"https://syntology.ai/paper/2409.19925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19925"}},"official":{"repos":["applied-machine-learning-lab/llmemb","liuqidong07/LLMEmb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ssd4rec-a-structured-state-space-duality","slug":"ssd4rec-a-structured-state-space-duality","title":"SSD4Rec: A Structured State Space Duality Model for Efficient Sequential Recommendation","date":"2024-09-02","arxiv_id":"2409.01192","repositories_listed":2,"syntology":null},{"url":"/paper/bidirectional-gated-mamba-for-sequential","slug":"bidirectional-gated-mamba-for-sequential","title":"SIGMA: Selective Gated Mamba for Sequential Recommendation","date":"2024-08-21","arxiv_id":"2408.11451","repositories_listed":2,"syntology":null},{"url":"/paper/large-language-models-enhanced-sequential","slug":"large-language-models-enhanced-sequential","title":"LLM-ESR: Large Language Models Enhancement for Long-tailed Sequential Recommendation","date":"2024-05-31","arxiv_id":"2405.20646","repositories_listed":2,"syntology":null},{"url":"/paper/iisan-efficiently-adapting-multimodal","slug":"iisan-efficiently-adapting-multimodal","title":"IISAN: Efficiently Adapting Multimodal Representation for Sequential Recommendation with Decoupled PEFT","date":"2024-04-02","arxiv_id":"2404.02059","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/iisan-efficiently-adapting-multimodal#ran","syntology_url":"https://syntology.ai/paper/2404.02059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.02059"}},"official":{"repos":["gair-lab/iisan","jjgenailab/iisan"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mamba4rec-towards-efficient-sequential","slug":"mamba4rec-towards-efficient-sequential","title":"Mamba4Rec: Towards Efficient Sequential Recommendation with Selective State Space Models","date":"2024-03-06","arxiv_id":"2403.03900","repositories_listed":2,"syntology":null},{"url":"/paper/multi-agent-collaboration-framework-for","slug":"multi-agent-collaboration-framework-for","title":"MACRec: a Multi-Agent Collaboration Framework for Recommendation","date":"2024-02-23","arxiv_id":"2402.15235","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-agent-collaboration-framework-for#ran","syntology_url":"https://syntology.ai/paper/2402.15235","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15235"}},"official":{"repos":["wzf2000/macrec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-learnable-clustering-for-intent","slug":"end-to-end-learnable-clustering-for-intent","title":"End-to-end Learnable Clustering for Intent Learning in Recommendation","date":"2024-01-11","arxiv_id":"2401.05975","repositories_listed":2,"syntology":null},{"url":"/paper/an-attentive-inductive-bias-for-sequential","slug":"an-attentive-inductive-bias-for-sequential","title":"An Attentive Inductive Bias for Sequential Recommendation beyond the Self-Attention","date":"2023-12-16","arxiv_id":"2312.10325","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-attentive-inductive-bias-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2312.10325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.10325"}},"official":{"repos":["jeongwhanchoi/BSARec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/e4srec-an-elegant-effective-efficient","slug":"e4srec-an-elegant-effective-efficient","title":"E4SRec: An Elegant Effective Efficient Extensible Solution of Large Language Models for Sequential Recommendation","date":"2023-12-05","arxiv_id":"2312.02443","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/e4srec-an-elegant-effective-efficient#ran","syntology_url":"https://syntology.ai/paper/2312.02443","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02443"}},"official":{"repos":["hestiasky/e4srec"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-model-can-interpret-latent","slug":"large-language-model-can-interpret-latent","title":"Large Language Model Can Interpret Latent Space of Sequential Recommender","date":"2023-10-31","arxiv_id":"2310.20487","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/large-language-model-can-interpret-latent#ran","syntology_url":"https://syntology.ai/paper/2310.20487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.20487"}},"official":{"repos":["yangzhengyi98/recinterpreter"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/diffusion-augmentation-for-sequential","slug":"diffusion-augmentation-for-sequential","title":"Diffusion Augmentation for Sequential Recommendation","date":"2023-09-22","arxiv_id":"2309.12858","repositories_listed":2,"syntology":null},{"url":"/paper/gsasrec-reducing-overconfidence-in-sequential","slug":"gsasrec-reducing-overconfidence-in-sequential","title":"gSASRec: Reducing Overconfidence in Sequential Recommendation Trained with Negative Sampling","date":"2023-08-14","arxiv_id":"2308.07192","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gsasrec-reducing-overconfidence-in-sequential#ran","syntology_url":"https://syntology.ai/paper/2308.07192","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.07192"}},"official":{"repos":["asash/gsasrec"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/transact-transformer-based-realtime-user","slug":"transact-transformer-based-realtime-user","title":"TransAct: Transformer-based Realtime User Action Model for Recommendation at Pinterest","date":"2023-05-31","arxiv_id":"2306.00248","repositories_listed":2,"syntology":null},{"url":"/paper/graph-masked-autoencoder-for-sequential","slug":"graph-masked-autoencoder-for-sequential","title":"Graph Masked Autoencoder for Sequential Recommendation","date":"2023-05-08","arxiv_id":"2305.04619","repositories_listed":2,"syntology":null},{"url":"/paper/carca-context-and-attribute-aware-next-item","slug":"carca-context-and-attribute-aware-next-item","title":"CARCA: Context and Attribute-Aware Next-Item Recommendation via Cross-Attention","date":"2022-04-04","arxiv_id":"2204.06519","repositories_listed":2,"syntology":null},{"url":"/paper/recommendation-as-language-processing-rlp-a","slug":"recommendation-as-language-processing-rlp-a","title":"Recommendation as Language Processing (RLP): A Unified Pretrain, Personalized Prompt & Predict Paradigm (P5)","date":"2022-03-24","arxiv_id":"2203.13366","repositories_listed":2,"syntology":null},{"url":"/paper/symmetry-structured-convolutional-neural","slug":"symmetry-structured-convolutional-neural","title":"Symmetry Structured Convolutional Neural Networks","date":"2022-03-03","arxiv_id":"2203.02056","repositories_listed":2,"syntology":null},{"url":"/paper/filter-enhanced-mlp-is-all-you-need-for","slug":"filter-enhanced-mlp-is-all-you-need-for","title":"Filter-enhanced MLP is All You Need for Sequential Recommendation","date":"2022-02-28","arxiv_id":"2202.13556","repositories_listed":2,"syntology":null},{"url":"/paper/c-2-rec-an-effective-consistency-constraint","slug":"c-2-rec-an-effective-consistency-constraint","title":"CT4Rec: Simple yet Effective Consistency Training for Sequential Recommendation","date":"2021-12-13","arxiv_id":"2112.06668","repositories_listed":2,"syntology":null},{"url":"/paper/contrastive-learning-for-representation","slug":"contrastive-learning-for-representation","title":"Contrastive Learning for Representation Degeneration Problem in Sequential Recommendation","date":"2021-10-12","arxiv_id":"2110.05730","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/contrastive-learning-for-representation#ran","syntology_url":"https://syntology.ai/paper/2110.05730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.05730"}},"official":{"repos":["RuihongQiu/DuoRec"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/memory-augmented-multi-instance-contrastive","slug":"memory-augmented-multi-instance-contrastive","title":"Memory Augmented Multi-Instance Contrastive Predictive Coding for Sequential Recommendation","date":"2021-09-01","arxiv_id":"2109.00368","repositories_listed":2,"syntology":null},{"url":"/paper/a-large-scale-rich-context-query-and","slug":"a-large-scale-rich-context-query-and","title":"A Large-Scale Rich Context Query and Recommendation Dataset in Online Knowledge-Sharing","date":"2021-06-11","arxiv_id":"2106.06467","repositories_listed":2,"syntology":null},{"url":"/paper/s-3-rec-self-supervised-learning-for","slug":"s-3-rec-self-supervised-learning-for","title":"S^3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximization","date":"2020-08-18","arxiv_id":"2008.07873","repositories_listed":2,"syntology":null},{"url":"/paper/sequential-recommendation-with-self-attentive","slug":"sequential-recommendation-with-self-attentive","title":"Sequential Recommendation with Self-Attentive Multi-Adversarial Network","date":"2020-05-21","arxiv_id":"2005.10602","repositories_listed":2,"syntology":null},{"url":"/paper/controllable-multi-interest-framework-for","slug":"controllable-multi-interest-framework-for","title":"Controllable Multi-Interest Framework for Recommendation","date":"2020-05-19","arxiv_id":"2005.09347","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/controllable-multi-interest-framework-for#ran","syntology_url":"https://syntology.ai/paper/2005.09347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09347"}},"official":{"repos":["THUDM/ComiRec"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/ham-hybrid-associations-model-with-pooling","slug":"ham-hybrid-associations-model-with-pooling","title":"HAM: Hybrid Associations Models for Sequential Recommendation","date":"2020-02-27","arxiv_id":"2002.11890","repositories_listed":2,"syntology":null},{"url":"/paper/sse-pt-sequential-recommendation-via","slug":"sse-pt-sequential-recommendation-via","title":"SSE-PT: Sequential Recommendation Via Personalized Transformer","date":"2019-09-25","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/cosrec-2d-convolutional-neural-networks-for","slug":"cosrec-2d-convolutional-neural-networks-for","title":"CosRec: 2D Convolutional Neural Networks for Sequential Recommendation","date":"2019-08-27","arxiv_id":"1908.09972","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cosrec-2d-convolutional-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/1908.09972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09972"}},"official":{"repos":["zzxslp/CosRec"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-gating-networks-for-sequential","slug":"hierarchical-gating-networks-for-sequential","title":"Hierarchical Gating Networks for Sequential Recommendation","date":"2019-06-21","arxiv_id":"1906.09217","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-gating-networks-for-sequential#ran","syntology_url":"https://syntology.ai/paper/1906.09217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.09217"}},"official":{"repos":["allenjack/HGN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/190513127","slug":"190513127","title":"Topic-Enhanced Memory Networks for Personalised Point-of-Interest Recommendation","date":"2019-05-19","arxiv_id":"1905.13127","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-user-modeling-with-long-and-short","slug":"adaptive-user-modeling-with-long-and-short","title":"Adaptive User Modeling with Long and Short-Term Preferences for Personalized Recommendation","date":"2019-01-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/findrec-stein-guided-entropic-flow-for-multi","slug":"findrec-stein-guided-entropic-flow-for-multi","title":"FindRec: Stein-Guided Entropic Flow for Multi-Modal Sequential Recommendation","date":"2025-07-07","arxiv_id":"2507.04651","repositories_listed":1,"syntology":null},{"url":"/paper/c-tlsan-content-enhanced-time-aware-long-and","slug":"c-tlsan-content-enhanced-time-aware-long-and","title":"C-TLSAN: Content-Enhanced Time-Aware Long- and Short-Term Attention Network for Personalized Recommendation","date":"2025-06-16","arxiv_id":"2506.13021","repositories_listed":1,"syntology":null},{"url":"/paper/llm2rec-large-language-models-are-powerful","slug":"llm2rec-large-language-models-are-powerful","title":"LLM2Rec: Large Language Models Are Powerful Embedding Models for Sequential Recommendation","date":"2025-06-16","arxiv_id":"2506.21579","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/llm2rec-large-language-models-are-powerful#ran","syntology_url":"https://syntology.ai/paper/2506.21579","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.21579"}},"official":{"repos":["happypointer/llm2rec"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/recgpt-a-foundation-model-for-sequential","slug":"recgpt-a-foundation-model-for-sequential","title":"RecGPT: A Foundation Model for Sequential Recommendation","date":"2025-06-06","arxiv_id":"2506.06270","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/recgpt-a-foundation-model-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2506.06270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.06270"}},"official":{"repos":["hkuds/recgpt"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/gloss-generative-language-models-with","slug":"gloss-generative-language-models-with","title":"GLoSS: Generative Language Models with Semantic Search for Sequential Recommendation","date":"2025-06-02","arxiv_id":"2506.01910","repositories_listed":1,"syntology":null},{"url":"/paper/unlocking-the-power-of-diffusion-models-in","slug":"unlocking-the-power-of-diffusion-models-in","title":"Unlocking the Power of Diffusion Models in Sequential Recommendation: A Simple and Effective Approach","date":"2025-05-26","arxiv_id":"2505.19544","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-enhanced-co-attention-prompt","slug":"semantic-enhanced-co-attention-prompt","title":"Semantic-enhanced Co-attention Prompt Learning for Non-overlapping Cross-Domain Recommendation","date":"2025-05-25","arxiv_id":"2505.19085","repositories_listed":1,"syntology":null},{"url":"/paper/flow-matching-based-sequential-recommender","slug":"flow-matching-based-sequential-recommender","title":"Flow Matching based Sequential Recommender Model","date":"2025-05-22","arxiv_id":"2505.16298","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/flow-matching-based-sequential-recommender#ran","syntology_url":"https://syntology.ai/paper/2505.16298","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16298"}},"official":{"repos":["fengliu-1/fmrec"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/diff-dual-side-information-filtering-and","slug":"diff-dual-side-information-filtering-and","title":"DIFF: Dual Side-Information Filtering and Fusion for Sequential Recommendation","date":"2025-05-20","arxiv_id":"2505.13974","repositories_listed":1,"syntology":null},{"url":"/paper/alphafuse-learn-id-embeddings-for-sequential","slug":"alphafuse-learn-id-embeddings-for-sequential","title":"AlphaFuse: Learn ID Embeddings for Sequential Recommendation in Null Space of Language Embeddings","date":"2025-04-27","arxiv_id":"2504.19218","repositories_listed":1,"syntology":null},{"url":"/paper/relative-contrastive-learning-for-sequential","slug":"relative-contrastive-learning-for-sequential","title":"Relative Contrastive Learning for Sequential Recommendation with Similarity-based Positive Pair Selection","date":"2025-04-27","arxiv_id":"2504.19178","repositories_listed":1,"syntology":null},{"url":"/paper/intent-aware-diffusion-with-contrastive","slug":"intent-aware-diffusion-with-contrastive","title":"Intent-aware Diffusion with Contrastive Learning for Sequential Recommendation","date":"2025-04-22","arxiv_id":"2504.16077","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-long-term-embedding-with-denoising","slug":"adaptive-long-term-embedding-with-denoising","title":"Adaptive Long-term Embedding with Denoising and Augmentation for Recommendation","date":"2025-04-18","arxiv_id":"2504.13614","repositories_listed":1,"syntology":null},{"url":"/paper/improving-sequential-recommenders-through","slug":"improving-sequential-recommenders-through","title":"Improving Sequential Recommenders through Counterfactual Augmentation of System Exposure","date":"2025-04-18","arxiv_id":"2504.13482","repositories_listed":1,"syntology":null},{"url":"/paper/crossan-towards-efficient-and-effective","slug":"crossan-towards-efficient-and-effective","title":"CROSSAN: Towards Efficient and Effective Adaptation of Multiple Multimodal Foundation Models for Sequential Recommendation","date":"2025-04-14","arxiv_id":"2504.10307","repositories_listed":1,"syntology":null},{"url":"/paper/data-augmentation-as-free-lunch-exploring-the","slug":"data-augmentation-as-free-lunch-exploring-the","title":"Data Augmentation as Free Lunch: Exploring the Test-Time Augmentation for Sequential Recommendation","date":"2025-04-07","arxiv_id":"2504.04843","repositories_listed":1,"syntology":null},{"url":"/paper/rec-r1-bridging-generative-large-language","slug":"rec-r1-bridging-generative-large-language","title":"Rec-R1: Bridging Generative Large Language Models and User-Centric Recommendation Systems via Reinforcement Learning","date":"2025-03-31","arxiv_id":"2503.24289","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rec-r1-bridging-generative-large-language#ran","syntology_url":"https://syntology.ai/paper/2503.24289","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.24289"}},"official":{"repos":["linjc16/Rec-R1"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/semantic-gaussian-mixture-variational","slug":"semantic-gaussian-mixture-variational","title":"Semantic Gaussian Mixture Variational Autoencoder for Sequential Recommendation","date":"2025-02-22","arxiv_id":"2502.16140","repositories_listed":1,"syntology":null},{"url":"/paper/lightweight-yet-efficient-an-external","slug":"lightweight-yet-efficient-an-external","title":"Lightweight yet Efficient: An External Attentive Graph Convolutional Network with Positional Prompts for Sequential Recommendation","date":"2025-02-21","arxiv_id":"2502.15331","repositories_listed":1,"syntology":null},{"url":"/paper/lost-in-sequence-do-large-language-models","slug":"lost-in-sequence-do-large-language-models","title":"Lost in Sequence: Do Large Language Models Understand Sequential Recommendation?","date":"2025-02-19","arxiv_id":"2502.13909","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-graph-embeddings-for-session","slug":"unsupervised-graph-embeddings-for-session","title":"Unsupervised Graph Embeddings for Session-based Recommendation with Item Features","date":"2025-02-19","arxiv_id":"2502.13763","repositories_listed":1,"syntology":null},{"url":"/paper/a-contextual-aware-position-encoding-for","slug":"a-contextual-aware-position-encoding-for","title":"A Contextual-Aware Position Encoding for Sequential Recommendation","date":"2025-02-13","arxiv_id":"2502.09027","repositories_listed":1,"syntology":null},{"url":"/paper/ss4rec-continuous-time-sequential","slug":"ss4rec-continuous-time-sequential","title":"SS4Rec: Continuous-Time Sequential Recommendation with State Space Models","date":"2025-02-12","arxiv_id":"2502.08132","repositories_listed":1,"syntology":null},{"url":"/paper/td3-tucker-decomposition-based-dataset","slug":"td3-tucker-decomposition-based-dataset","title":"TD3: Tucker Decomposition Based Dataset Distillation Method for Sequential Recommendation","date":"2025-02-05","arxiv_id":"2502.02854","repositories_listed":1,"syntology":null},{"url":"/paper/improving-minimax-group-fairness-in","slug":"improving-minimax-group-fairness-in","title":"Improving Minimax Group Fairness in Sequential Recommendation","date":"2025-01-30","arxiv_id":"2501.18117","repositories_listed":1,"syntology":null},{"url":"/paper/abxi-invariant-interest-adaptation-for-task","slug":"abxi-invariant-interest-adaptation-for-task","title":"ABXI: Invariant Interest Adaptation for Task-Guided Cross-Domain Sequential Recommendation","date":"2025-01-25","arxiv_id":"2501.15118","repositories_listed":1,"syntology":null},{"url":"/paper/patchrec-multi-grained-patching-for-efficient","slug":"patchrec-multi-grained-patching-for-efficient","title":"Multi-Grained Patch Training for Efficient LLM-based Recommendation","date":"2025-01-25","arxiv_id":"2501.15087","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/patchrec-multi-grained-patching-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2501.15087","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.15087"}},"official":{"repos":["ljy0ustc/patchrec"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-time-aware-mixture-of-experts","slug":"hierarchical-time-aware-mixture-of-experts","title":"Hierarchical Time-Aware Mixture of Experts for Multi-Modal Sequential Recommendation","date":"2025-01-24","arxiv_id":"2501.14269","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-time-aware-mixture-of-experts#ran","syntology_url":"https://syntology.ai/paper/2501.14269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.14269"}},"official":{"repos":["SStarCCat/HM4SR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/raserec-retrieval-augmented-sequential","slug":"raserec-retrieval-augmented-sequential","title":"RaSeRec: Retrieval-Augmented Sequential Recommendation","date":"2024-12-24","arxiv_id":"2412.18378","repositories_listed":1,"syntology":null},{"url":"/paper/lightweight-yet-fine-grained-a-graph-capsule","slug":"lightweight-yet-fine-grained-a-graph-capsule","title":"Lightweight yet Fine-grained: A Graph Capsule Convolutional Network with Subspace Alignment for Shared-account Sequential Recommendation","date":"2024-12-18","arxiv_id":"2412.13408","repositories_listed":1,"syntology":null},{"url":"/paper/future-sight-and-tough-fights-revolutionizing","slug":"future-sight-and-tough-fights-revolutionizing","title":"Future Sight and Tough Fights: Revolutionizing Sequential Recommendation with FENRec","date":"2024-12-16","arxiv_id":"2412.11589","repositories_listed":1,"syntology":null},{"url":"/paper/augmenting-sequential-recommendation-with-1","slug":"augmenting-sequential-recommendation-with-1","title":"Augmenting Sequential Recommendation with Balanced Relevance and Diversity","date":"2024-12-11","arxiv_id":"2412.08300","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-sequential-recommendation-models-with","slug":"scaling-sequential-recommendation-models-with","title":"Scaling Sequential Recommendation Models with Transformers","date":"2024-12-10","arxiv_id":"2412.07585","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-linear-item-item-model-for","slug":"temporal-linear-item-item-model-for","title":"Temporal Linear Item-Item Model for Sequential Recommendation","date":"2024-12-10","arxiv_id":"2412.07382","repositories_listed":1,"syntology":null},{"url":"/paper/pre-train-align-and-disentangle-empowering","slug":"pre-train-align-and-disentangle-empowering","title":"Pre-train, Align, and Disentangle: Empowering Sequential Recommendation with Large Language Models","date":"2024-12-05","arxiv_id":"2412.04107","repositories_listed":1,"syntology":null},{"url":"/paper/oracle-guided-dynamic-user-preference","slug":"oracle-guided-dynamic-user-preference","title":"Oracle-guided Dynamic User Preference Modeling for Sequential Recommendation","date":"2024-12-01","arxiv_id":"2412.00813","repositories_listed":1,"syntology":null},{"url":"/paper/data-watermarking-for-sequential-recommender","slug":"data-watermarking-for-sequential-recommender","title":"Data Watermarking for Sequential Recommender Systems","date":"2024-11-20","arxiv_id":"2411.12989","repositories_listed":1,"syntology":null},{"url":"/paper/multi-grained-preference-enhanced-transformer","slug":"multi-grained-preference-enhanced-transformer","title":"Multi-Grained Preference Enhanced Transformer for Multi-Behavior Sequential Recommendation","date":"2024-11-19","arxiv_id":"2411.12179","repositories_listed":1,"syntology":null},{"url":"/paper/linrec-linear-attention-mechanism-for-long","slug":"linrec-linear-attention-mechanism-for-long","title":"LinRec: Linear Attention Mechanism for Long-term Sequential Recommender Systems","date":"2024-11-03","arxiv_id":"2411.01537","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/linrec-linear-attention-mechanism-for-long#ran","syntology_url":"https://syntology.ai/paper/2411.01537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.01537"}},"official":{"repos":["Applied-Machine-Learning-Lab/LinRec"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/simrec-mitigating-the-cold-start-problem-in","slug":"simrec-mitigating-the-cold-start-problem-in","title":"SimRec: Mitigating the Cold-Start Problem in Sequential Recommendation by Integrating Item Similarity","date":"2024-10-29","arxiv_id":"2410.22136","repositories_listed":1,"syntology":null},{"url":"/paper/preference-diffusion-for-recommendation","slug":"preference-diffusion-for-recommendation","title":"Preference Diffusion for Recommendation","date":"2024-10-17","arxiv_id":"2410.13117","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":5,"n_ran_checked":10,"n_instrument":5,"n_unverified":4,"n_honours":4,"n_violates":0,"n_no_contract":6,"n_pointer_only":19,"phrase":"15 ran (of which 5 constructed an object rather than computing a result; 10 with no instrument failure: 4 honoured, 0 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/preference-diffusion-for-recommendation#ran","syntology_url":"https://syntology.ai/paper/2410.13117","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13117"}},"official":{"repos":["lswhim/preferdiff"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":5,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/evaluating-performance-and-bias-of-negative","slug":"evaluating-performance-and-bias-of-negative","title":"Evaluating Performance and Bias of Negative Sampling in Large-Scale Sequential Recommendation Models","date":"2024-10-08","arxiv_id":"2410.17276","repositories_listed":1,"syntology":null},{"url":"/paper/multi-behavioral-sequential-recommendation","slug":"multi-behavioral-sequential-recommendation","title":"Multi-Behavioral Sequential Recommendation","date":"2024-10-08","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scalable-cross-entropy-loss-for-sequential","slug":"scalable-cross-entropy-loss-for-sequential","title":"Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogs","date":"2024-09-27","arxiv_id":"2409.18721","repositories_listed":1,"syntology":null},{"url":"/paper/ttt4rec-a-test-time-training-approach-for","slug":"ttt4rec-a-test-time-training-approach-for","title":"TTT4Rec: A Test-Time Training Approach for Rapid Adaption in Sequential Recommendation","date":"2024-09-27","arxiv_id":"2409.19142","repositories_listed":1,"syntology":null},{"url":"/paper/train-once-deploy-anywhere-matryoshka","slug":"train-once-deploy-anywhere-matryoshka","title":"Train Once, Deploy Anywhere: Matryoshka Representation Learning for Multimodal Recommendation","date":"2024-09-25","arxiv_id":"2409.16627","repositories_listed":1,"syntology":null},{"url":"/paper/tim4rec-an-efficient-sequential","slug":"tim4rec-an-efficient-sequential","title":"TiM4Rec: An Efficient Sequential Recommendation Model Based on Time-Aware Structured State Space Duality Model","date":"2024-09-24","arxiv_id":"2409.16182","repositories_listed":1,"syntology":null},{"url":"/paper/data-augmentation-for-sequential","slug":"data-augmentation-for-sequential","title":"Data Augmentation for Sequential Recommendation: A Survey","date":"2024-09-20","arxiv_id":"2409.13545","repositories_listed":1,"syntology":null},{"url":"/paper/hllm-enhancing-sequential-recommendations-via","slug":"hllm-enhancing-sequential-recommendations-via","title":"HLLM: Enhancing Sequential Recommendations via Hierarchical Large Language Models for Item and User Modeling","date":"2024-09-19","arxiv_id":"2409.12740","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/hllm-enhancing-sequential-recommendations-via#ran","syntology_url":"https://syntology.ai/paper/2409.12740","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.12740"}},"official":{"repos":["bytedance/hllm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-sequential-music-recommendation-1","slug":"enhancing-sequential-music-recommendation-1","title":"Enhancing Sequential Music Recommendation with Negative Feedback-informed Contrastive Learning","date":"2024-09-11","arxiv_id":"2409.07367","repositories_listed":1,"syntology":null},{"url":"/paper/dv-fsr-a-dual-view-target-attack-framework","slug":"dv-fsr-a-dual-view-target-attack-framework","title":"DV-FSR: A Dual-View Target Attack Framework for Federated Sequential Recommendation","date":"2024-09-10","arxiv_id":"2409.07500","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-learnable-item-tokenization-for","slug":"end-to-end-learnable-item-tokenization-for","title":"Generative Recommender with End-to-End Learnable Item Tokenization","date":"2024-09-09","arxiv_id":"2409.05546","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-sequential-music-recommendation","slug":"enhancing-sequential-music-recommendation","title":"Enhancing Sequential Music Recommendation with Personalized Popularity Awareness","date":"2024-09-06","arxiv_id":"2409.04329","repositories_listed":1,"syntology":null},{"url":"/paper/mars-matching-attribute-aware-representations","slug":"mars-matching-attribute-aware-representations","title":"MARS: Matching Attribute-aware Representations for Text-based Sequential Recommendation","date":"2024-09-01","arxiv_id":"2409.00702","repositories_listed":1,"syntology":null},{"url":"/paper/transformers-meet-act-r-repeat-aware-and","slug":"transformers-meet-act-r-repeat-aware-and","title":"Transformers Meet ACT-R: Repeat-Aware and Sequential Listening Session Recommendation","date":"2024-08-29","arxiv_id":"2408.16578","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-and-analyzing-the-influence-of-non","slug":"modeling-and-analyzing-the-influence-of-non","title":"Modeling and Analyzing the Influence of Non-Item Pages on Sequential Next-Item Prediction","date":"2024-08-28","arxiv_id":"2408.15953","repositories_listed":1,"syntology":null},{"url":"/paper/are-llm-based-recommenders-already-the-best","slug":"are-llm-based-recommenders-already-the-best","title":"Are LLM-based Recommenders Already the Best? Simple Scaled Cross-entropy Unleashes the Potential of Traditional Sequential Recommenders","date":"2024-08-26","arxiv_id":"2408.14238","repositories_listed":1,"syntology":null},{"url":"/paper/csrec-rethinking-sequential-recommendation","slug":"csrec-rethinking-sequential-recommendation","title":"CSRec: Rethinking Sequential Recommendation from A Causal Perspective","date":"2024-08-23","arxiv_id":"2409.05872","repositories_listed":1,"syntology":null},{"url":"/paper/customizing-language-models-with-instance","slug":"customizing-language-models-with-instance","title":"Customizing Language Models with Instance-wise LoRA for Sequential Recommendation","date":"2024-08-19","arxiv_id":"2408.10159","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":7,"n_ran_checked":7,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":13,"phrase":"8 ran (of which 7 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/customizing-language-models-with-instance#ran","syntology_url":"https://syntology.ai/paper/2408.10159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.10159"}},"official":{"repos":["akalikong/ilora"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}}],"syntology_records":24,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":2,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/sequential-recommendation-on-movielens-1m","since_archive":"/sota/sequential-recommendation-on-movielens-1m#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/sequential-recommendation-on-lastfm","since_archive":"/sota/sequential-recommendation-on-lastfm#since-judged","papers_judged":1,"placed":0},{"leaderboard":"/sota/sequential-recommendation-on-yelp","since_archive":"/sota/sequential-recommendation-on-yelp#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":69,"papers_where_code_ran_first_page":"/task/sequential-recommendation/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":6,"url":"/task/sequential-recommendation/papers/2","json":"/task/sequential-recommendation/papers/2.json","rows":100},{"order":"archive","page":3,"of":6,"url":"/task/sequential-recommendation/papers/3","json":"/task/sequential-recommendation/papers/3.json","rows":100},{"order":"archive","page":4,"of":6,"url":"/task/sequential-recommendation/papers/4","json":"/task/sequential-recommendation/papers/4.json","rows":100},{"order":"archive","page":5,"of":6,"url":"/task/sequential-recommendation/papers/5","json":"/task/sequential-recommendation/papers/5.json","rows":100},{"order":"archive","page":6,"of":6,"url":"/task/sequential-recommendation/papers/6","json":"/task/sequential-recommendation/papers/6.json","rows":54},{"order":"ran","page":1,"of":1,"url":"/task/sequential-recommendation/papers/ran/1","json":"/task/sequential-recommendation/papers/ran/1.json","rows":69}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"bf6884aae1a4e45e4684c96d7626d1bfcdab45b7ab48e46a7726937a9df71cc8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}