{"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/generate-config","entry":"generate_config","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":5,"n_papers_ran":1,"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":6,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"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":"2411.06839","paper":"/paper/llm-neo-parameter-efficient-knowledge","title":"LLM-Neo: Parameter Efficient Knowledge Distillation for Large Language Models","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yang3121099/LLM-Neo","path":"script_Neo.py","file_url":"https://github.com/yang3121099/LLM-Neo/blob/HEAD/script_Neo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"53c3bbf282e709d0","mcp_get_code":{"code_sha256":"53c3bbf282e709d0"}},{"arxiv_id":"2406.01806","paper":"/paper/contextualized-sequence-likelihood-enhanced","title":"Contextualized Sequence Likelihood: Enhanced Confidence Scores for Natural Language Generation","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zlin7/contextsl","path":"dataeval/nq_open_new.py","file_url":"https://github.com/zlin7/contextsl/blob/HEAD/dataeval/nq_open_new.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2c38e83c3c6eb721","mcp_get_code":{"code_sha256":"2c38e83c3c6eb721"}},{"arxiv_id":"2310.08367","paper":"/paper/mcu-a-task-centric-framework-for-open-ended","title":"Towards Evaluating Generalist Agents: An Automated Benchmark in Open World","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"craftjarvis/mcu","path":"MCU_benchmark/config_generation/generate_atom_config.py","file_url":"https://github.com/craftjarvis/mcu/blob/HEAD/MCU_benchmark/config_generation/generate_atom_config.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cde29b4d57fad121","mcp_get_code":{"code_sha256":"cde29b4d57fad121"}},{"arxiv_id":"2310.08367","paper":"/paper/mcu-a-task-centric-framework-for-open-ended","title":"Towards Evaluating Generalist Agents: An Automated Benchmark in Open World","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"craftjarvis/mcu","path":"MCU_benchmark/config_generation/generate_com_config.py","file_url":"https://github.com/craftjarvis/mcu/blob/HEAD/MCU_benchmark/config_generation/generate_com_config.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ec79e52428507069","mcp_get_code":{"code_sha256":"ec79e52428507069"}},{"arxiv_id":"2111.04260","paper":"/paper/personalized-benchmarking-with-the-ludwig","title":"Personalized Benchmarking with the Ludwig Benchmarking Toolkit","date":"2021-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ludwig-ai/ludwig","path":"ludwig/config_generation.py","file_url":"https://github.com/ludwig-ai/ludwig/blob/HEAD/ludwig/config_generation.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":"b1bfc6cef2090fd7","mcp_get_code":{"code_sha256":"b1bfc6cef2090fd7"}},{"arxiv_id":"1905.10437","paper":"/paper/n-beats-neural-basis-expansion-analysis-for","title":"N-BEATS: Neural basis expansion analysis for interpretable time series forecasting","date":"2019-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"realdanielbyrne/N-BEATS-Lightning","path":"experiments/generate_basis_dim_sweep.py","file_url":"https://github.com/realdanielbyrne/N-BEATS-Lightning/blob/HEAD/experiments/generate_basis_dim_sweep.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f056b22e9df589de","mcp_get_code":{"code_sha256":"f056b22e9df589de"}}]}