{"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/generate-config","entry":"generate_config","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":5,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":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":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"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":1,"ran_fixture":0,"ran":2,"unverified":3},"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":"2411.06839","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"53c3bbf282e709d0","code_sha256_prefix":"53c3bbf282e709d0","mcp_get_code":{"code_sha256":"53c3bbf282e709d0"}},{"arxiv_id":"2406.01806","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2c38e83c3c6eb721","code_sha256_prefix":"2c38e83c3c6eb721","mcp_get_code":{"code_sha256":"2c38e83c3c6eb721"}},{"arxiv_id":"2310.08367","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, craftjarvis/mcu when it was checked","code_sha256":"cde29b4d57fad121","code_sha256_prefix":"cde29b4d57fad121","mcp_get_code":{"code_sha256":"cde29b4d57fad121"}},{"arxiv_id":"2310.08367","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, craftjarvis/mcu when it was checked","code_sha256":"ec79e52428507069","code_sha256_prefix":"ec79e52428507069","mcp_get_code":{"code_sha256":"ec79e52428507069"}},{"arxiv_id":"2111.04260","arxiv_id_is_arxiv":true,"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":"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":"b1bfc6cef2090fd7","code_sha256_prefix":"b1bfc6cef2090fd7","mcp_get_code":{"code_sha256":"b1bfc6cef2090fd7"}},{"arxiv_id":"1905.10437","arxiv_id_is_arxiv":true,"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":"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":"f056b22e9df589de","code_sha256_prefix":"f056b22e9df589de","mcp_get_code":{"code_sha256":"f056b22e9df589de"}}],"record_sha256":"0fd14bf23d7c49b07d4a0775fcffb5ea3db44fb75d6990d42c2de45e661d330e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}