{"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/extract-axis-1","entry":"extract_axis_1","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":6,"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":3,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":2,"ran":1,"unverified":0},"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":"2410.13117","paper":"/paper/preference-diffusion-for-recommendation","title":"Preference Diffusion for Recommendation","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lswhim/preferdiff","path":"models/PreferDiff/_model.py","file_url":"https://github.com/lswhim/preferdiff/blob/HEAD/models/PreferDiff/_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"dc3094c7e25c1afa","mcp_get_code":{"code_sha256":"dc3094c7e25c1afa"}},{"arxiv_id":"2408.10159","paper":"/paper/customizing-language-models-with-instance","title":"Customizing Language Models with Instance-wise LoRA for Sequential Recommendation","date":"2024-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AkaliKong/iLoRA","path":"recommender/A_SASRec_final_bce_llm.py","file_url":"https://github.com/AkaliKong/iLoRA/blob/HEAD/recommender/A_SASRec_final_bce_llm.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"66b65be6c96f7959","mcp_get_code":{"code_sha256":"66b65be6c96f7959"}},{"arxiv_id":"2405.00338","paper":"/paper/distillation-matters-empowering-sequential","title":"Distillation Matters: Empowering Sequential Recommenders to Match the Performance of Large Language Model","date":"2024-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"istarryn/dllm2rec","path":"utility.py","file_url":"https://github.com/istarryn/dllm2rec/blob/HEAD/utility.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"66b65be6c96f7959","mcp_get_code":{"code_sha256":"66b65be6c96f7959"}},{"arxiv_id":"2312.02445","paper":"/paper/llara-aligning-large-language-models-with","title":"LLaRA: Large Language-Recommendation Assistant","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ljy0ustc/llara","path":"recommender/A_SASRec_final_bce_llm.py","file_url":"https://github.com/ljy0ustc/llara/blob/HEAD/recommender/A_SASRec_final_bce_llm.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"66b65be6c96f7959","mcp_get_code":{"code_sha256":"66b65be6c96f7959"}},{"arxiv_id":"2310.20487","paper":"/paper/large-language-model-can-interpret-latent","title":"Large Language Model Can Interpret Latent Space of Sequential Recommender","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangzhengyi98/dreamrec","path":"utility.py","file_url":"https://github.com/yangzhengyi98/dreamrec/blob/HEAD/utility.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"66b65be6c96f7959","mcp_get_code":{"code_sha256":"66b65be6c96f7959"}},{"arxiv_id":"2308.08487","paper":"/paper/temporal-interest-network-for-click-through","title":"Temporal Interest Network for User Response Prediction","date":"2023-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhouxy1003/tin","path":"model/base_model/model.py","file_url":"https://github.com/zhouxy1003/tin/blob/HEAD/model/base_model/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"21b4500e6d91d348","mcp_get_code":{"code_sha256":"21b4500e6d91d348"}}]}