{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/group","entry":"group","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":18,"n_papers_ran":14,"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":5,"n_samples_fingerprinted":0,"n_places":19,"n_places_pointer_only":6,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"unverified":5},"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","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,"code_sha256_prefix":"be4657e3537b2b6b","mcp_get_code":{"code_sha256":"be4657e3537b2b6b"}},{"arxiv_id":"2405.03943","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d8a87bbbd68ad508","mcp_get_code":{"code_sha256":"d8a87bbbd68ad508"}},{"arxiv_id":"2404.01365","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2402.16775","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2402.09398","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2311.04420","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,"code_sha256_prefix":"f672aab27d220c13","mcp_get_code":{"code_sha256":"f672aab27d220c13"}},{"arxiv_id":"2310.10603","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,"code_sha256_prefix":"9487a12f79643518","mcp_get_code":{"code_sha256":"9487a12f79643518"}},{"arxiv_id":"2310.05620","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2307.16039","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2305.14493","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2304.01196","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e859eeeeacc6d379","mcp_get_code":{"code_sha256":"e859eeeeacc6d379"}},{"arxiv_id":"2303.17003","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2110.04374","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}},{"arxiv_id":"2106.03993","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,"code_sha256_prefix":"f672aab27d220c13","mcp_get_code":{"code_sha256":"f672aab27d220c13"}},{"arxiv_id":"2004.05525","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"efc87750009b90de","mcp_get_code":{"code_sha256":"efc87750009b90de"}},{"arxiv_id":"2001.06588","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"eb7abab5b4404fe3","mcp_get_code":{"code_sha256":"eb7abab5b4404fe3"}},{"arxiv_id":"2001.06588","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"09486147ac624af7","mcp_get_code":{"code_sha256":"09486147ac624af7"}},{"arxiv_id":"1606.04934","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9ebdf8a2db9d5205","mcp_get_code":{"code_sha256":"9ebdf8a2db9d5205"}},{"arxiv_id":"2025.findings-acl.1384","paper":null,"title":"arXiv: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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"359c35fdcd7a0ee5","mcp_get_code":{"code_sha256":"359c35fdcd7a0ee5"}}]}