{"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/top-k-filter","entry":"top_k_filter","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":7,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":9,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"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":0,"ran_fixture":3,"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":"2209.15162","arxiv_id_is_arxiv":true,"paper":"/paper/linearly-mapping-from-image-to-text-space","title":"Linearly Mapping from Image to Text Space","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jmerullo/limber","path":"sampling.py","file_url":"https://github.com/jmerullo/limber/blob/HEAD/sampling.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aa8cc3e8f125148a","code_sha256_prefix":"aa8cc3e8f125148a","mcp_get_code":{"code_sha256":"aa8cc3e8f125148a"}},{"arxiv_id":"2204.03084","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-infused-decoding-1","title":"Knowledge Infused Decoding","date":"2022-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/KID","path":"KID/agent/agent_utils.py","file_url":"https://github.com/microsoft/KID/blob/HEAD/KID/agent/agent_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8e41b557f3929df0","code_sha256_prefix":"8e41b557f3929df0","mcp_get_code":{"code_sha256":"8e41b557f3929df0"}},{"arxiv_id":"2202.11705","arxiv_id_is_arxiv":true,"paper":"/paper/cold-decoding-energy-based-constrained-text","title":"COLD Decoding: Energy-based Constrained Text Generation with Langevin Dynamics","date":"2022-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qkaren/COLD_decoding","path":"util.py","file_url":"https://github.com/qkaren/COLD_decoding/blob/HEAD/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00c3cfb8a63fc383","code_sha256_prefix":"00c3cfb8a63fc383","mcp_get_code":{"code_sha256":"00c3cfb8a63fc383"}},{"arxiv_id":"2112.05253","arxiv_id_is_arxiv":true,"paper":"/paper/magma-multimodal-augmentation-of-generative","title":"MAGMA -- Multimodal Augmentation of Generative Models through Adapter-based Finetuning","date":"2021-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aleph-Alpha/magma","path":"magma/sampling.py","file_url":"https://github.com/Aleph-Alpha/magma/blob/HEAD/magma/sampling.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aa8cc3e8f125148a","code_sha256_prefix":"aa8cc3e8f125148a","mcp_get_code":{"code_sha256":"aa8cc3e8f125148a"}},{"arxiv_id":"2105.00164","arxiv_id_is_arxiv":true,"paper":"/paper/hidden-backdoors-in-human-centric-language","title":"Hidden Backdoors in Human-Centric Language Models","date":"2021-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"ac71b1f4007ef1dd","code_sha256_prefix":"ac71b1f4007ef1dd","mcp_get_code":{"code_sha256":"ac71b1f4007ef1dd"}},{"arxiv_id":"2011.04000","arxiv_id_is_arxiv":true,"paper":"/paper/adapting-a-language-model-for-controlled","title":"Adapting a Language Model for Controlled Affective Text Generation","date":"2020-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"ac71b1f4007ef1dd","code_sha256_prefix":"ac71b1f4007ef1dd","mcp_get_code":{"code_sha256":"ac71b1f4007ef1dd"}},{"arxiv_id":"2010.05906","arxiv_id_is_arxiv":true,"paper":"/paper/back-to-the-future-unsupervised-backprop","title":"Back to the Future: Unsupervised Backprop-based Decoding for Counterfactual and Abductive Commonsense Reasoning","date":"2020-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qkaren/unsup_gen_for_cms_reasoning","path":"abductive_main.py","file_url":"https://github.com/qkaren/unsup_gen_for_cms_reasoning/blob/HEAD/abductive_main.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, qkaren/unsup_gen_for_cms_reasoning when it was checked","code_sha256":"66bb73836d7e23ad","code_sha256_prefix":"66bb73836d7e23ad","mcp_get_code":{"code_sha256":"66bb73836d7e23ad"}},{"arxiv_id":"2009.11462","arxiv_id_is_arxiv":true,"paper":"/paper/realtoxicityprompts-evaluating-neural-toxic","title":"RealToxicityPrompts: Evaluating Neural Toxic Degeneration in Language Models","date":"2020-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/real-toxicity-prompts","path":"generation/pplm_generation.py","file_url":"https://github.com/allenai/real-toxicity-prompts/blob/HEAD/generation/pplm_generation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ac71b1f4007ef1dd","code_sha256_prefix":"ac71b1f4007ef1dd","mcp_get_code":{"code_sha256":"ac71b1f4007ef1dd"}},{"arxiv_id":"1912.02164","arxiv_id_is_arxiv":true,"paper":"/paper/plug-and-play-language-models-a-simple","title":"Plug and Play Language Models: A Simple Approach to Controlled Text Generation","date":"2019-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uber-research/PPLM","path":"run_pplm.py","file_url":"https://github.com/uber-research/PPLM/blob/HEAD/run_pplm.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ac71b1f4007ef1dd","code_sha256_prefix":"ac71b1f4007ef1dd","mcp_get_code":{"code_sha256":"ac71b1f4007ef1dd"}}],"record_sha256":"761f21781f16fb8f37193dc1cd13aa9c9d71de561fcc9175b00630e61032516e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}