{"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":"/code/parse-global-args","entry":"parse_global_args","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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)"},"n_papers":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":5,"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":5,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":3,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":0,"unverified":2},"key_notes":{"n_samples_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_samples_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)"},"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":"2502.14735","arxiv_id_is_arxiv":true,"paper":"/paper/eager-llm-enhancing-large-language-models-as","title":"EAGER-LLM: Enhancing Large Language Models as Recommenders through Exogenous Behavior-Semantic Integration","date":"2025-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Indolent-Kawhi/EAGER-LLM","path":"src/utils.py","file_url":"https://github.com/Indolent-Kawhi/EAGER-LLM/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from honghuibao2000/letter, and GitHub detected no licence in that repository when it was checked","code_sha256":"2be50b7fb0f78745","code_sha256_prefix":"2be50b7fb0f78745","mcp_get_code":{"code_sha256":"2be50b7fb0f78745"}},{"arxiv_id":"2411.00331","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-utility-evaluating-llm-as-recommender","title":"Beyond Utility: Evaluating LLM as Recommender","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiangdeccc/evallmasrecommender","path":"eva/codes/llm_metrics.py","file_url":"https://github.com/jiangdeccc/evallmasrecommender/blob/HEAD/eva/codes/llm_metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jiangdeccc/evallmasrecommender when it was checked","code_sha256":"5974837c70df99e8","code_sha256_prefix":"5974837c70df99e8","mcp_get_code":{"code_sha256":"5974837c70df99e8"}},{"arxiv_id":"2410.05165","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-inference-for-large-language-model","title":"Efficient Inference for Large Language Model-based Generative Recommendation","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Linxyhaha/AtSpeed","path":"code/utils.py","file_url":"https://github.com/Linxyhaha/AtSpeed/blob/HEAD/code/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Linxyhaha/AtSpeed when it was checked","code_sha256":"38d59d157a39fe01","code_sha256_prefix":"38d59d157a39fe01","mcp_get_code":{"code_sha256":"38d59d157a39fe01"}},{"arxiv_id":"2405.07314","arxiv_id_is_arxiv":true,"paper":"/paper/learnable-tokenizer-for-llm-based-generative","title":"Learnable Item Tokenization for Generative Recommendation","date":"2024-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"honghuibao2000/letter","path":"LETTER-LC-Rec/utils.py","file_url":"https://github.com/honghuibao2000/letter/blob/HEAD/LETTER-LC-Rec/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, honghuibao2000/letter when it was checked","code_sha256":"2be50b7fb0f78745","code_sha256_prefix":"2be50b7fb0f78745","mcp_get_code":{"code_sha256":"2be50b7fb0f78745"}},{"arxiv_id":"2311.09049","arxiv_id_is_arxiv":true,"paper":"/paper/adapting-large-language-models-by-integrating","title":"Adapting Large Language Models by Integrating Collaborative Semantics for Recommendation","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rucaibox/lc-rec","path":"utils.py","file_url":"https://github.com/rucaibox/lc-rec/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, rucaibox/lc-rec when it was checked","code_sha256":"2be50b7fb0f78745","code_sha256_prefix":"2be50b7fb0f78745","mcp_get_code":{"code_sha256":"2be50b7fb0f78745"}},{"arxiv_id":"2306.10047","arxiv_id_is_arxiv":true,"paper":"/paper/neighborhood-based-hard-negative-mining-for","title":"Neighborhood-based Hard Negative Mining for Sequential Recommendation","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"floatsdsds/gnno","path":"src/run_TPGCL.py","file_url":"https://github.com/floatsdsds/gnno/blob/HEAD/src/run_TPGCL.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"05ebf887d85b332f","code_sha256_prefix":"05ebf887d85b332f","mcp_get_code":{"code_sha256":"05ebf887d85b332f"}},{"arxiv_id":"2306.10047","arxiv_id_is_arxiv":true,"paper":"/paper/neighborhood-based-hard-negative-mining-for","title":"Neighborhood-based Hard Negative Mining for Sequential Recommendation","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"floatsdsds/gnno","path":"src/topology.py","file_url":"https://github.com/floatsdsds/gnno/blob/HEAD/src/topology.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2dda82a29f4c260b","code_sha256_prefix":"2dda82a29f4c260b","mcp_get_code":{"code_sha256":"2dda82a29f4c260b"}}],"record_sha256":"bcc0195dfb72fbab9162d32d8bdbedd2f39d96739e58272fbbca04bdc2fbe11f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}