{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/mrr-2","entry":"mrr_","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":3,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":3},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2604.05379","paper":"/paper/arxiv-2604-05379","title":"Retrieve-then-Adapt: Test-Time Retrieval-Augmentation for Sequential Recommendation","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"xingt-tang/ReAd","path":"recbole/evaluator/metrics.py","file_url":"https://github.com/xingt-tang/ReAd/blob/HEAD/recbole/evaluator/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e9affbc7a45c4915","mcp_get_code":{"code_sha256":"e9affbc7a45c4915"}},{"arxiv_id":"2401.15635","paper":"/paper/recdcl-dual-contrastive-learning-for","title":"RecDCL: Dual Contrastive Learning for Recommendation","date":"2024-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thudm/recdcl","path":"recbole/evaluator/metrics.py","file_url":"https://github.com/thudm/recdcl/blob/HEAD/recbole/evaluator/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a7dd48dfe868e2d3","mcp_get_code":{"code_sha256":"a7dd48dfe868e2d3"}},{"arxiv_id":"2304.09184","paper":"/paper/frequency-enhanced-hybrid-attention-network","title":"Frequency Enhanced Hybrid Attention Network for Sequential Recommendation","date":"2023-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sudaada/fearec","path":"recbole/evaluator/metrics.py","file_url":"https://github.com/sudaada/fearec/blob/HEAD/recbole/evaluator/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a7dd48dfe868e2d3","mcp_get_code":{"code_sha256":"a7dd48dfe868e2d3"}},{"arxiv_id":"2206.12811","paper":"/paper/towards-representation-alignment-and","title":"Towards Representation Alignment and Uniformity in Collaborative Filtering","date":"2022-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuwangcy/directau","path":"recbole/evaluator/metrics.py","file_url":"https://github.com/thuwangcy/directau/blob/HEAD/recbole/evaluator/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a7dd48dfe868e2d3","mcp_get_code":{"code_sha256":"a7dd48dfe868e2d3"}},{"arxiv_id":"2111.12481","paper":"/paper/it-is-different-when-items-are-older","title":"It Is Different When Items Are Older: Debiasing Recommendations When Selection Bias and User Preferences Are Dynamic","date":"2021-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"betsyhj/dancer","path":"src/evaluator/evaluator.py","file_url":"https://github.com/betsyhj/dancer/blob/HEAD/src/evaluator/evaluator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6d02cbf6252387ee","mcp_get_code":{"code_sha256":"6d02cbf6252387ee"}},{"arxiv_id":"2110.05730","paper":"/paper/contrastive-learning-for-representation","title":"Contrastive Learning for Representation Degeneration Problem in Sequential Recommendation","date":"2021-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RuihongQiu/DuoRec","path":"recbole/evaluator/metrics.py","file_url":"https://github.com/RuihongQiu/DuoRec/blob/HEAD/recbole/evaluator/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a7dd48dfe868e2d3","mcp_get_code":{"code_sha256":"a7dd48dfe868e2d3"}}]}