{"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/lmap","entry":"lmap","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":15,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":13,"n_papers_ran_instrument_only":2,"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":10,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":16,"n_places_pointer_only":3,"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":2,"ran_fixture":0,"ran":8,"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":"2401.10487","arxiv_id_is_arxiv":true,"paper":"/paper/generative-dense-retrieval-memory-can-be-a","title":"Generative Dense Retrieval: Memory Can Be a Burden","date":"2024-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ypw0102/gdr","path":"GDR_model/main_utils.py","file_url":"https://github.com/ypw0102/gdr/blob/HEAD/GDR_model/main_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, ypw0102/gdr when it was checked","code_sha256":"64e8746cf3f62e8e","code_sha256_prefix":"64e8746cf3f62e8e","mcp_get_code":{"code_sha256":"64e8746cf3f62e8e"}},{"arxiv_id":"2401.09840","arxiv_id_is_arxiv":true,"paper":"/paper/freed-improving-rl-agents-for-fragment-based","title":"FREED++: Improving RL Agents for Fragment-Based Molecule Generation by Thorough Reproduction","date":"2024-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"airi-institute/ffreed","path":"ffreed/utils.py","file_url":"https://github.com/airi-institute/ffreed/blob/HEAD/ffreed/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a18ae998f817f851","code_sha256_prefix":"a18ae998f817f851","mcp_get_code":{"code_sha256":"a18ae998f817f851"}},{"arxiv_id":"2302.05574","arxiv_id_is_arxiv":true,"paper":"/paper/napss-paragraph-level-medical-text","title":"NapSS: Paragraph-level Medical Text Simplification via Narrative Prompting and Sentence-matching Summarization","date":"2023-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LuJunru/NapSS","path":"modeling/utils.py","file_url":"https://github.com/LuJunru/NapSS/blob/HEAD/modeling/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c43af131a6f39a6","code_sha256_prefix":"7c43af131a6f39a6","mcp_get_code":{"code_sha256":"7c43af131a6f39a6"}},{"arxiv_id":"2210.00312","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-analogical-reasoning-over","title":"Multimodal Analogical Reasoning over Knowledge Graphs","date":"2022-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/MKGformer","path":"MKG/lit_models/transformer.py","file_url":"https://github.com/zjunlp/MKGformer/blob/HEAD/MKG/lit_models/transformer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cca3a1dc3db5bbf1","code_sha256_prefix":"cca3a1dc3db5bbf1","mcp_get_code":{"code_sha256":"cca3a1dc3db5bbf1"}},{"arxiv_id":"2109.08678","arxiv_id_is_arxiv":true,"paper":"/paper/rng-kbqa-generation-augmented-iterative","title":"RnG-KBQA: Generation Augmented Iterative Ranking for Knowledge Base Question Answering","date":"2021-09-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/rng-kbqa","path":"framework/run_generator.py","file_url":"https://github.com/salesforce/rng-kbqa/blob/HEAD/framework/run_generator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"599d7419b72e40aa","code_sha256_prefix":"599d7419b72e40aa","mcp_get_code":{"code_sha256":"599d7419b72e40aa"}},{"arxiv_id":"2109.04096","arxiv_id_is_arxiv":true,"paper":"/paper/a-three-stage-learning-framework-for-low","title":"A Three-Stage Learning Framework for Low-Resource Knowledge-Grounded Dialogue Generation","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neukg/kat-tslf","path":"run_kat.py","file_url":"https://github.com/neukg/kat-tslf/blob/HEAD/run_kat.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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 ypw0102/gdr, and GitHub detected no licence in that repository when it was checked","code_sha256":"64e8746cf3f62e8e","code_sha256_prefix":"64e8746cf3f62e8e","mcp_get_code":{"code_sha256":"64e8746cf3f62e8e"}},{"arxiv_id":"2109.04096","arxiv_id_is_arxiv":true,"paper":"/paper/a-three-stage-learning-framework-for-low","title":"A Three-Stage Learning Framework for Low-Resource Knowledge-Grounded Dialogue Generation","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neukg/kat-tslf","path":"dial/utils.py","file_url":"https://github.com/neukg/kat-tslf/blob/HEAD/dial/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c43af131a6f39a6","code_sha256_prefix":"7c43af131a6f39a6","mcp_get_code":{"code_sha256":"7c43af131a6f39a6"}},{"arxiv_id":"2109.03214","arxiv_id_is_arxiv":true,"paper":"/paper/robust-predictable-control","title":"Robust Predictable Control","date":"2021-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eleurent/highway-env","path":"highway_env/utils.py","file_url":"https://github.com/eleurent/highway-env/blob/HEAD/highway_env/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"56a643e4c0476688","code_sha256_prefix":"56a643e4c0476688","mcp_get_code":{"code_sha256":"56a643e4c0476688"}},{"arxiv_id":"2108.11846","arxiv_id_is_arxiv":true,"paper":"/paper/alleviating-exposure-bias-via-contrastive","title":"Alleviating Exposure Bias via Contrastive Learning for Abstractive Text Summarization","date":"2021-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shichaosun/conabssum","path":"src/utils.py","file_url":"https://github.com/shichaosun/conabssum/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c43af131a6f39a6","code_sha256_prefix":"7c43af131a6f39a6","mcp_get_code":{"code_sha256":"7c43af131a6f39a6"}},{"arxiv_id":"2108.02866","arxiv_id_is_arxiv":true,"paper":"/paper/dual-reader-parser-on-hybrid-textual-and","title":"Dual Reader-Parser on Hybrid Textual and Tabular Evidence for Open Domain Question Answering","date":"2021-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awslabs/durepa-hybrid-qa","path":"src/utils.py","file_url":"https://github.com/awslabs/durepa-hybrid-qa/blob/HEAD/src/utils.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":"e8f0c6a01a6823df","code_sha256_prefix":"e8f0c6a01a6823df","mcp_get_code":{"code_sha256":"e8f0c6a01a6823df"}},{"arxiv_id":"2105.11174","arxiv_id_is_arxiv":true,"paper":"/paper/retrieval-enhanced-model-for-commonsense","title":"Retrieval Enhanced Model for Commonsense Generation","date":"2021-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HanNight/RE-T5","path":"code/RE-T5/utils.py","file_url":"https://github.com/HanNight/RE-T5/blob/HEAD/code/RE-T5/utils.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":"7c43af131a6f39a6","code_sha256_prefix":"7c43af131a6f39a6","mcp_get_code":{"code_sha256":"7c43af131a6f39a6"}},{"arxiv_id":"2105.04779","arxiv_id_is_arxiv":true,"paper":"/paper/el-attention-memory-efficient-lossless","title":"EL-Attention: Memory Efficient Lossless Attention for Generation","date":"2021-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/fastseq","path":"fastseq_cli/transformers_utils.py","file_url":"https://github.com/microsoft/fastseq/blob/HEAD/fastseq_cli/transformers_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6a66f22f0034f9d3","code_sha256_prefix":"6a66f22f0034f9d3","mcp_get_code":{"code_sha256":"6a66f22f0034f9d3"}},{"arxiv_id":"2104.08691","arxiv_id_is_arxiv":true,"paper":"/paper/the-power-of-scale-for-parameter-efficient","title":"The Power of Scale for Parameter-Efficient Prompt Tuning","date":"2021-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"exelents/soft-prompt-tuning","path":"utils1.py","file_url":"https://github.com/exelents/soft-prompt-tuning/blob/HEAD/utils1.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c43af131a6f39a6","code_sha256_prefix":"7c43af131a6f39a6","mcp_get_code":{"code_sha256":"7c43af131a6f39a6"}},{"arxiv_id":"2104.08400","arxiv_id_is_arxiv":true,"paper":"/paper/structure-aware-abstractive-conversation","title":"Structure-Aware Abstractive Conversation Summarization via Discourse and Action Graphs","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GT-SALT/Structure-Aware-BART","path":"src/utils.py","file_url":"https://github.com/GT-SALT/Structure-Aware-BART/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b508796abb35571f","code_sha256_prefix":"b508796abb35571f","mcp_get_code":{"code_sha256":"b508796abb35571f"}},{"arxiv_id":"2010.08242","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-extractive-summarization-by-pre","title":"Unsupervised Extractive Summarization by Pre-training Hierarchical Transformers","date":"2020-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xssstory/STAS","path":"ensemble.py","file_url":"https://github.com/xssstory/STAS/blob/HEAD/ensemble.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, xssstory/STAS, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"c9934030622e1adf","code_sha256_prefix":"c9934030622e1adf","mcp_get_code":{"code_sha256":"c9934030622e1adf"}},{"arxiv_id":"2007.08426","arxiv_id_is_arxiv":true,"paper":"/paper/investigating-pretrained-language-models-for","title":"Investigating Pretrained Language Models for Graph-to-Text Generation","date":"2020-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UKPLab/plms-graph2text","path":"agenda/utils.py","file_url":"https://github.com/UKPLab/plms-graph2text/blob/HEAD/agenda/utils.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":"7c43af131a6f39a6","code_sha256_prefix":"7c43af131a6f39a6","mcp_get_code":{"code_sha256":"7c43af131a6f39a6"}}],"record_sha256":"3e53e57fdd03116d33b7b66151408d74b5caf6bc1c81fc39733bb36bc280852b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}