{"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/prefix-allowed-tokens-fn","entry":"prefix_allowed_tokens_fn","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":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":3,"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_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"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":1,"ran_fixture":0,"ran":2,"unverified":0},"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":"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/generation_trie.py","file_url":"https://github.com/Linxyhaha/AtSpeed/blob/HEAD/code/generation_trie.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":"3e27e1971d49a1a8","code_sha256_prefix":"3e27e1971d49a1a8","mcp_get_code":{"code_sha256":"3e27e1971d49a1a8"}},{"arxiv_id":"2403.19021","arxiv_id_is_arxiv":true,"paper":"/paper/towards-llm-recsys-alignment-with-textual-id","title":"IDGenRec: LLM-RecSys Alignment with Textual ID Learning","date":"2024-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"agiresearch/idgenrec","path":"src/utils/generation_trie.py","file_url":"https://github.com/agiresearch/idgenrec/blob/HEAD/src/utils/generation_trie.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, agiresearch/idgenrec when it was checked","code_sha256":"3e27e1971d49a1a8","code_sha256_prefix":"3e27e1971d49a1a8","mcp_get_code":{"code_sha256":"3e27e1971d49a1a8"}},{"arxiv_id":"2312.03463","arxiv_id_is_arxiv":true,"paper":"/paper/dbcopilot-scaling-natural-language-querying","title":"DBCopilot: Natural Language Querying over Massive Databases via Schema Routing","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tshu-w/dbcopilot","path":"src/models/schema_routing.py","file_url":"https://github.com/tshu-w/dbcopilot/blob/HEAD/src/models/schema_routing.py","status":"ran","verification_level":1,"contract_check":null,"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, tshu-w/dbcopilot when it was checked","code_sha256":"1d59379d97927c9d","code_sha256_prefix":"1d59379d97927c9d","mcp_get_code":{"code_sha256":"1d59379d97927c9d"}},{"arxiv_id":"2306.11134","arxiv_id_is_arxiv":true,"paper":"/paper/openp5-benchmarking-foundation-models-for","title":"OpenP5: An Open-Source Platform for Developing, Training, and Evaluating LLM-based Recommender Systems","date":"2023-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Wenyueh/LLMforRS_item_representation","path":"generation_trie.py","file_url":"https://github.com/Wenyueh/LLMforRS_item_representation/blob/HEAD/generation_trie.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Linxyhaha/AtSpeed, and GitHub detected no licence in that repository when it was checked","code_sha256":"3e27e1971d49a1a8","code_sha256_prefix":"3e27e1971d49a1a8","mcp_get_code":{"code_sha256":"3e27e1971d49a1a8"}},{"arxiv_id":"2207.06300","arxiv_id_is_arxiv":true,"paper":"/paper/re2g-retrieve-rerank-generate-2","title":"Re2G: Retrieve, Rerank, Generate","date":"2022-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/kgi-slot-filling","path":"slot_filling/rag_client_server_apply.py","file_url":"https://github.com/ibm/kgi-slot-filling/blob/HEAD/slot_filling/rag_client_server_apply.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d4a7d4d6e3eb7e0","code_sha256_prefix":"1d4a7d4d6e3eb7e0","mcp_get_code":{"code_sha256":"1d4a7d4d6e3eb7e0"}},{"arxiv_id":"2108.13934","arxiv_id_is_arxiv":true,"paper":"/paper/robust-retrieval-augmented-generation-for","title":"Robust Retrieval Augmented Generation for Zero-shot Slot Filling","date":"2021-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/retrieve-write-slot-filling","path":"slot_filling/rag_client_server_apply.py","file_url":"https://github.com/IBM/retrieve-write-slot-filling/blob/HEAD/slot_filling/rag_client_server_apply.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d4a7d4d6e3eb7e0","code_sha256_prefix":"1d4a7d4d6e3eb7e0","mcp_get_code":{"code_sha256":"1d4a7d4d6e3eb7e0"}}],"record_sha256":"143b8257f28dd57be7c9a2eb01e5ea186bddeff3ed706a0060c882ebb8ae96b0","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}