{"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/get-task-info","entry":"get_task_info","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":0,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":0,"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":4,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"n_places_pointer_only_link_open":1,"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":0,"ran":0,"unverified":4},"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.14033","arxiv_id_is_arxiv":true,"paper":"/paper/mlr-copilot-autonomous-machine-learning","title":"MLR-Copilot: Autonomous Machine Learning Research based on Large Language Models Agents","date":"2024-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"du-nlp-lab/mlr-copilot","path":"reactagent/prepare_task.py","file_url":"https://github.com/du-nlp-lab/mlr-copilot/blob/HEAD/reactagent/prepare_task.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, du-nlp-lab/mlr-copilot when it was checked","code_sha256":"2868580e4a832fe7","code_sha256_prefix":"2868580e4a832fe7","mcp_get_code":{"code_sha256":"2868580e4a832fe7"}},{"arxiv_id":"2312.14472","arxiv_id_is_arxiv":true,"paper":"/paper/not-all-tasks-are-equally-difficult-multi","title":"Not All Tasks Are Equally Difficult: Multi-Task Deep Reinforcement Learning with Dynamic Depth Routing","date":"2023-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DarkDawn233/D2R_MTRL","path":"torchrl/env/get_env.py","file_url":"https://github.com/DarkDawn233/D2R_MTRL/blob/HEAD/torchrl/env/get_env.py","status":"unverified","verification_level":0,"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":"60be26f7786be240","code_sha256_prefix":"60be26f7786be240","mcp_get_code":{"code_sha256":"60be26f7786be240"}},{"arxiv_id":"2310.03302","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-large-language-models-as-ai","title":"MLAgentBench: Evaluating Language Agents on Machine Learning Experimentation","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-stanford/mlagentbench","path":"MLAgentBench/prepare_task.py","file_url":"https://github.com/snap-stanford/mlagentbench/blob/HEAD/MLAgentBench/prepare_task.py","status":"unverified","verification_level":0,"contract_check":null,"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 du-nlp-lab/mlr-copilot, and GitHub detected no licence in that repository when it was checked","code_sha256":"2868580e4a832fe7","code_sha256_prefix":"2868580e4a832fe7","mcp_get_code":{"code_sha256":"2868580e4a832fe7"}},{"arxiv_id":"2305.11938","arxiv_id_is_arxiv":true,"paper":"/paper/xtreme-up-a-user-centric-scarce-data","title":"XTREME-UP: A User-Centric Scarce-Data Benchmark for Under-Represented Languages","date":"2023-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research/xtreme-up","path":"baseline/jsonl_to_seqio_tsv_lib.py","file_url":"https://github.com/google-research/xtreme-up/blob/HEAD/baseline/jsonl_to_seqio_tsv_lib.py","status":"unverified","verification_level":0,"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":"dd148fcf0cf05289","code_sha256_prefix":"dd148fcf0cf05289","mcp_get_code":{"code_sha256":"dd148fcf0cf05289"}},{"arxiv_id":"2205.14082","arxiv_id_is_arxiv":true,"paper":"/paper/aang-automating-auxiliary-learning","title":"AANG: Automating Auxiliary Learning","date":"2022-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ldery/automating-auxiliary-learning","path":"hyperparam_search.py","file_url":"https://github.com/ldery/automating-auxiliary-learning/blob/HEAD/hyperparam_search.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, ldery/automating-auxiliary-learning when it was checked","code_sha256":"aa760044769995b0","code_sha256_prefix":"aa760044769995b0","mcp_get_code":{"code_sha256":"aa760044769995b0"}}],"record_sha256":"2c7050b5475f4a80498b0faf68dd6892672232e6134856f4a3ade399348fbbdb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}