{"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/group","entry":"group","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":18,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":10,"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":1,"n_places":19,"n_places_pointer_only":12,"n_places_pointer_only_link_open":6,"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":1,"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":"2408.10920","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-neural-networks-learn-to-store-and","title":"Recurrent Neural Networks Learn to Store and Generate Sequences using Non-Linear Representations","date":"2024-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robertcsordas/onion_representations","path":"paper/lib/common.py","file_url":"https://github.com/robertcsordas/onion_representations/blob/HEAD/paper/lib/common.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, robertcsordas/onion_representations when it was checked","code_sha256":"be4657e3537b2b6b","code_sha256_prefix":"be4657e3537b2b6b","mcp_get_code":{"code_sha256":"be4657e3537b2b6b"}},{"arxiv_id":"2405.03943","arxiv_id_is_arxiv":true,"paper":"/paper/predictive-modeling-with-temporal-graphical","title":"Predictive Modeling with Temporal Graphical Representation on Electronic Health Records","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"the-real-jerrychen/trans","path":"layers/HGC.py","file_url":"https://github.com/the-real-jerrychen/trans/blob/HEAD/layers/HGC.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, the-real-jerrychen/trans when it was checked","code_sha256":"d8a87bbbd68ad508","code_sha256_prefix":"d8a87bbbd68ad508","mcp_get_code":{"code_sha256":"d8a87bbbd68ad508"}},{"arxiv_id":"2404.01365","arxiv_id_is_arxiv":true,"paper":"/paper/prompt-prompted-mixture-of-experts-for","title":"Prompt-prompted Adaptive Structured Pruning for Efficient LLM Generation","date":"2024-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hdong920/griffin","path":"src/lm_eval/utils.py","file_url":"https://github.com/hdong920/griffin/blob/HEAD/src/lm_eval/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, hdong920/griffin when it was checked","code_sha256":"359c35fdcd7a0ee5","code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2402.16775","arxiv_id_is_arxiv":true,"paper":"/paper/a-comprehensive-evaluation-of-quantization","title":"A Comprehensive Evaluation of Quantization Strategies for Large Language Models","date":"2024-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cordercorder/quant_eval","path":"quant/SpQR/lm-evaluation-harness/lm_eval/utils.py","file_url":"https://github.com/cordercorder/quant_eval/blob/HEAD/quant/SpQR/lm-evaluation-harness/lm_eval/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, cordercorder/quant_eval when it was checked","code_sha256":"359c35fdcd7a0ee5","code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2402.09398","arxiv_id_is_arxiv":true,"paper":"/paper/get-more-with-less-synthesizing-recurrence","title":"Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hdong920/less","path":"src/lm_eval/utils.py","file_url":"https://github.com/hdong920/less/blob/HEAD/src/lm_eval/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, hdong920/less when it was checked","code_sha256":"359c35fdcd7a0ee5","code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2311.04420","arxiv_id_is_arxiv":true,"paper":"/paper/data-factors-for-better-compositional","title":"Data Factors for Better Compositional Generalization","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"owenzx/data4comp","path":"hlog.py","file_url":"https://github.com/owenzx/data4comp/blob/HEAD/hlog.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":"f672aab27d220c13","code_sha256_prefix":"f672aab27d220c13","mcp_get_code":{"code_sha256":"f672aab27d220c13"}},{"arxiv_id":"2310.10603","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-the-power-of-graph-neural-networks","title":"Exploring the Power of Graph Neural Networks in Solving Linear Optimization Problems","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chendiqian/IPM_MPNN","path":"models/hetero_conv.py","file_url":"https://github.com/chendiqian/IPM_MPNN/blob/HEAD/models/hetero_conv.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, chendiqian/IPM_MPNN when it was checked","code_sha256":"9487a12f79643518","code_sha256_prefix":"9487a12f79643518","mcp_get_code":{"code_sha256":"9487a12f79643518"}},{"arxiv_id":"2310.05620","arxiv_id_is_arxiv":true,"paper":"/paper/laiw-a-chinese-legal-large-language-models","title":"LAiW: A Chinese Legal Large Language Models Benchmark","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dai-shen/laiw","path":"src/financial-evaluation/lm_eval/utils.py","file_url":"https://github.com/dai-shen/laiw/blob/HEAD/src/financial-evaluation/lm_eval/utils.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 hdong920/griffin, and GitHub detected no licence in that repository when it was checked","code_sha256":"359c35fdcd7a0ee5","code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2307.16039","arxiv_id_is_arxiv":true,"paper":"/paper/okapi-instruction-tuned-large-language-models","title":"Okapi: Instruction-tuned Large Language Models in Multiple Languages with Reinforcement Learning from Human Feedback","date":"2023-07-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlp-uoregon/mlmm-evaluation","path":"lm_eval/utils.py","file_url":"https://github.com/nlp-uoregon/mlmm-evaluation/blob/HEAD/lm_eval/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 hdong920/griffin, and GitHub detected no licence in that repository when it was checked","code_sha256":"359c35fdcd7a0ee5","code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2305.14493","arxiv_id_is_arxiv":true,"paper":"/paper/prompt-position-really-matters-in-few-shot","title":"Do prompt positions really matter?","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milliemaoo/prompt-position","path":"lm_eval/utils.py","file_url":"https://github.com/milliemaoo/prompt-position/blob/HEAD/lm_eval/utils.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 hdong920/griffin, and GitHub detected no licence in that repository when it was checked","code_sha256":"359c35fdcd7a0ee5","code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2304.01196","arxiv_id_is_arxiv":true,"paper":"/paper/baize-an-open-source-chat-model-with","title":"Baize: An Open-Source Chat Model with Parameter-Efficient Tuning on Self-Chat Data","date":"2023-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ilyagusev/rulm","path":"rulm/preprocess.py","file_url":"https://github.com/ilyagusev/rulm/blob/HEAD/rulm/preprocess.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":"e859eeeeacc6d379","code_sha256_prefix":"e859eeeeacc6d379","mcp_get_code":{"code_sha256":"e859eeeeacc6d379"}},{"arxiv_id":"2303.17003","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-gpt-3-5-and-gpt-4-models-on","title":"Evaluating GPT-3.5 and GPT-4 Models on Brazilian University Admission Exams","date":"2023-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"piresramon/gpt-4-enem","path":"lm_eval/utils.py","file_url":"https://github.com/piresramon/gpt-4-enem/blob/HEAD/lm_eval/utils.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 hdong920/griffin, and GitHub detected no licence in that repository when it was checked","code_sha256":"359c35fdcd7a0ee5","code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2110.04374","arxiv_id_is_arxiv":true,"paper":"/paper/a-few-more-examples-may-be-worth-billions-of","title":"A Few More Examples May Be Worth Billions of Parameters","date":"2021-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuvalkirstain/lm-evaluation-harness","path":"lm_eval/utils.py","file_url":"https://github.com/yuvalkirstain/lm-evaluation-harness/blob/HEAD/lm_eval/utils.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 hdong920/griffin, and GitHub detected no licence in that repository when it was checked","code_sha256":"359c35fdcd7a0ee5","code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2106.03993","arxiv_id_is_arxiv":true,"paper":"/paper/lexicon-learning-for-few-shot-neural-sequence","title":"Lexicon Learning for Few-Shot Neural Sequence Modeling","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ekinakyurek/lexical","path":"hlog.py","file_url":"https://github.com/ekinakyurek/lexical/blob/HEAD/hlog.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":"f672aab27d220c13","code_sha256_prefix":"f672aab27d220c13","mcp_get_code":{"code_sha256":"f672aab27d220c13"}},{"arxiv_id":"2004.05525","arxiv_id_is_arxiv":true,"paper":"/paper/building-disaster-damage-assessment-in","title":"Building Disaster Damage Assessment in Satellite Imagery with Multi-Temporal Fusion","date":"2020-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethanweber/xview2","path":"deep_image_registration.py","file_url":"https://github.com/ethanweber/xview2/blob/HEAD/deep_image_registration.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":"efc87750009b90de","code_sha256_prefix":"efc87750009b90de","mcp_get_code":{"code_sha256":"efc87750009b90de"}},{"arxiv_id":"2001.06588","arxiv_id_is_arxiv":true,"paper":"/paper/flexibo-cost-aware-multi-objective","title":"FlexiBO: A Decoupled Cost-Aware Multi-Objective Optimization Approach for Deep Neural Networks","date":"2020-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"softsys4ai/FlexiBO","path":"networks/inceptionv1.py","file_url":"https://github.com/softsys4ai/FlexiBO/blob/HEAD/networks/inceptionv1.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":"eb7abab5b4404fe3","code_sha256_prefix":"eb7abab5b4404fe3","mcp_get_code":{"code_sha256":"eb7abab5b4404fe3"}},{"arxiv_id":"2001.06588","arxiv_id_is_arxiv":true,"paper":"/paper/flexibo-cost-aware-multi-objective","title":"FlexiBO: A Decoupled Cost-Aware Multi-Objective Optimization Approach for Deep Neural Networks","date":"2020-01-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"softsys4ai/FlexiBO","path":"networks/squeezenet.py","file_url":"https://github.com/softsys4ai/FlexiBO/blob/HEAD/networks/squeezenet.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":"09486147ac624af7","code_sha256_prefix":"09486147ac624af7","mcp_get_code":{"code_sha256":"09486147ac624af7"}},{"arxiv_id":"1606.04934","arxiv_id_is_arxiv":true,"paper":"/paper/improving-variational-inference-with-inverse","title":"Improving Variational Inference with Inverse Autoregressive Flow","date":"2016-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openai/iaf","path":"graphy/png.py","file_url":"https://github.com/openai/iaf/blob/HEAD/graphy/png.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":"9ebdf8a2db9d5205","code_sha256_prefix":"9ebdf8a2db9d5205","mcp_get_code":{"code_sha256":"9ebdf8a2db9d5205"}},{"arxiv_id":"2025.findings-acl.1384","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.1384","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Muennighoff/sgpt","path":"crossencoder/beir/sgptce.py","file_url":"https://github.com/Muennighoff/sgpt/blob/HEAD/crossencoder/beir/sgptce.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 hdong920/griffin, and GitHub detected no licence in that repository when it was checked","code_sha256":"359c35fdcd7a0ee5","code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}}],"record_sha256":"3ae0f73ca352cd938c2e5afef898054ff5ddccb08c4eda4764098a6ad56dcbe0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}