{"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","entry":"get_task","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":28,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"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":14,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":10,"n_samples_fingerprinted":1,"n_places":28,"n_places_pointer_only":9,"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":1,"ran_fixture":0,"ran":3,"unverified":10},"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":"2609.12265","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-12265","title":"GTA: Graph Theory Agent and Benchmark for Algorithmic Graph Reasoning with LLMs","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"xzx34/GTA","path":"src/gtbench/tasks.py","file_url":"https://github.com/xzx34/GTA/blob/HEAD/src/gtbench/tasks.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":"61d7b30722025b3d","code_sha256_prefix":"61d7b30722025b3d","mcp_get_code":{"code_sha256":"61d7b30722025b3d"}},{"arxiv_id":"2607.07847","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-07847","title":"When Does Continual Learning Require Learning","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"anneharrington/studying-cl","path":"cl/tasks.py","file_url":"https://github.com/anneharrington/studying-cl/blob/HEAD/cl/tasks.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":"f387a906d3df00a6","code_sha256_prefix":"f387a906d3df00a6","mcp_get_code":{"code_sha256":"f387a906d3df00a6"}},{"arxiv_id":"2604.21454","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-21454","title":"Reasoning Primitives in Hybrid and Non-Hybrid LLMs: Do Architectural Differences Yield Advantages in State-Tracking and Recall?","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"ultor1996/reasoning_primitives","path":"src/templates.py","file_url":"https://github.com/ultor1996/reasoning_primitives/blob/HEAD/src/templates.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, ultor1996/reasoning_primitives when it was checked","code_sha256":"3a0a352c2bb0f352","code_sha256_prefix":"3a0a352c2bb0f352","mcp_get_code":{"code_sha256":"3a0a352c2bb0f352"}},{"arxiv_id":"2602.17155","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-17155","title":"Powering Up Zeroth-Order Training via Subspace Gradient Orthogonalization","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"OPTML-Group/ZO-Muon","path":"llm/tasks.py","file_url":"https://github.com/OPTML-Group/ZO-Muon/blob/HEAD/llm/tasks.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":"f7c384f1e681ea7a","code_sha256_prefix":"f7c384f1e681ea7a","mcp_get_code":{"code_sha256":"f7c384f1e681ea7a"}},{"arxiv_id":"2505.13430","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-quantized-neural-networks-with","title":"Fine-tuning Quantized Neural Networks with Zeroth-order Optimization","date":"2025-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maifoundations/qzo","path":"large_language_models/tasks.py","file_url":"https://github.com/maifoundations/qzo/blob/HEAD/large_language_models/tasks.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":"f7c384f1e681ea7a","code_sha256_prefix":"f7c384f1e681ea7a","mcp_get_code":{"code_sha256":"f7c384f1e681ea7a"}},{"arxiv_id":"2412.11499","arxiv_id_is_arxiv":true,"paper":"/paper/embodied-cot-distillation-from-llm-to-off-the","title":"Embodied CoT Distillation From LLM To Off-the-shelf Agents","date":"2024-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"osu-nlp-group/llm-planner","path":"e2e/alfred/env/tasks.py","file_url":"https://github.com/osu-nlp-group/llm-planner/blob/HEAD/e2e/alfred/env/tasks.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":"5ffac7b83a094577","code_sha256_prefix":"5ffac7b83a094577","mcp_get_code":{"code_sha256":"5ffac7b83a094577"}},{"arxiv_id":"2410.08989","arxiv_id_is_arxiv":true,"paper":"/paper/subzero-random-subspace-zeroth-order","title":"Zeroth-Order Fine-Tuning of LLMs in Random Subspaces","date":"2024-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zimingyy/subzero","path":"large_models/tasks.py","file_url":"https://github.com/zimingyy/subzero/blob/HEAD/large_models/tasks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, zimingyy/subzero, is not in the permissive set Syntology serves inline","code_sha256":"f7c384f1e681ea7a","code_sha256_prefix":"f7c384f1e681ea7a","mcp_get_code":{"code_sha256":"f7c384f1e681ea7a"}},{"arxiv_id":"2406.01382","arxiv_id_is_arxiv":true,"paper":"/paper/do-large-language-models-perform-the-way","title":"Do Large Language Models Perform the Way People Expect? Measuring the Human Generalization Function","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"keyonvafa/human-generalization-llms","path":"utils.py","file_url":"https://github.com/keyonvafa/human-generalization-llms/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0334516a40523434","code_sha256_prefix":"0334516a40523434","mcp_get_code":{"code_sha256":"0334516a40523434"}},{"arxiv_id":"2406.01006","arxiv_id_is_arxiv":true,"paper":"/paper/semcoder-training-code-language-models-with","title":"SemCoder: Training Code Language Models with Comprehensive Semantics Reasoning","date":"2024-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ARiSE-Lab/SemCoder","path":"experiments/cruxeval_utils.py","file_url":"https://github.com/ARiSE-Lab/SemCoder/blob/HEAD/experiments/cruxeval_utils.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":"0ea1d7ce8d9d3e2a","code_sha256_prefix":"0ea1d7ce8d9d3e2a","mcp_get_code":{"code_sha256":"0ea1d7ce8d9d3e2a"}},{"arxiv_id":"2406.00132","arxiv_id_is_arxiv":true,"paper":"/paper/quanta-efficient-high-rank-fine-tuning-of","title":"QuanTA: Efficient High-Rank Fine-Tuning of LLMs with Quantum-Informed Tensor Adaptation","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"quanta-fine-tuning/quanta","path":"run/utils/tasks.py","file_url":"https://github.com/quanta-fine-tuning/quanta/blob/HEAD/run/utils/tasks.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":"f7c384f1e681ea7a","code_sha256_prefix":"f7c384f1e681ea7a","mcp_get_code":{"code_sha256":"f7c384f1e681ea7a"}},{"arxiv_id":"2402.17453","arxiv_id_is_arxiv":true,"paper":"/paper/ds-agent-automated-data-science-by-empowering","title":"DS-Agent: Automated Data Science by Empowering Large Language Models with Case-Based Reasoning","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guosyjlu/DS-Agent","path":"deployment/prompt.py","file_url":"https://github.com/guosyjlu/DS-Agent/blob/HEAD/deployment/prompt.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, guosyjlu/DS-Agent when it was checked","code_sha256":"a45eb6f9978ac8b0","code_sha256_prefix":"a45eb6f9978ac8b0","mcp_get_code":{"code_sha256":"a45eb6f9978ac8b0"}},{"arxiv_id":"2402.11592","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-zeroth-order-optimization-for","title":"Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmark","date":"2024-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zo-bench/zo-llm","path":"zo-bench/tasks.py","file_url":"https://github.com/zo-bench/zo-llm/blob/HEAD/zo-bench/tasks.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, zo-bench/zo-llm, is not in the permissive set Syntology serves inline","code_sha256":"f7c384f1e681ea7a","code_sha256_prefix":"f7c384f1e681ea7a","mcp_get_code":{"code_sha256":"f7c384f1e681ea7a"}},{"arxiv_id":"2312.15184","arxiv_id_is_arxiv":true,"paper":"/paper/zo-adamu-optimizer-adapting-perturbation-by","title":"ZO-AdaMU Optimizer: Adapting Perturbation by the Momentum and Uncertainty in Zeroth-order Optimization","date":"2023-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mathisall/zo-adamu","path":"tasks.py","file_url":"https://github.com/mathisall/zo-adamu/blob/HEAD/tasks.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, mathisall/zo-adamu when it was checked","code_sha256":"f7c384f1e681ea7a","code_sha256_prefix":"f7c384f1e681ea7a","mcp_get_code":{"code_sha256":"f7c384f1e681ea7a"}},{"arxiv_id":"2310.12344","arxiv_id_is_arxiv":true,"paper":"/paper/lacma-language-aligning-contrastive-learning","title":"LACMA: Language-Aligning Contrastive Learning with Meta-Actions for Embodied Instruction Following","date":"2023-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joeyy5588/LACMA","path":"alfred/env/tasks.py","file_url":"https://github.com/joeyy5588/LACMA/blob/HEAD/alfred/env/tasks.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":"d11401259503326f","code_sha256_prefix":"d11401259503326f","mcp_get_code":{"code_sha256":"d11401259503326f"}},{"arxiv_id":"2310.09639","arxiv_id_is_arxiv":true,"paper":"/paper/dpzero-dimension-independent-and","title":"DPZero: Private Fine-Tuning of Language Models without Backpropagation","date":"2023-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liang137/DPZero","path":"opt/src/tasks.py","file_url":"https://github.com/Liang137/DPZero/blob/HEAD/opt/src/tasks.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":"f7c384f1e681ea7a","code_sha256_prefix":"f7c384f1e681ea7a","mcp_get_code":{"code_sha256":"f7c384f1e681ea7a"}},{"arxiv_id":"2308.09387","arxiv_id_is_arxiv":true,"paper":"/paper/multi-level-compositional-reasoning-for","title":"Multi-Level Compositional Reasoning for Interactive Instruction Following","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yonseivnl/mcr-agent","path":"env/tasks.py","file_url":"https://github.com/yonseivnl/mcr-agent/blob/HEAD/env/tasks.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, yonseivnl/mcr-agent when it was checked","code_sha256":"5ffac7b83a094577","code_sha256_prefix":"5ffac7b83a094577","mcp_get_code":{"code_sha256":"5ffac7b83a094577"}},{"arxiv_id":"2305.17333","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-language-models-with-just-forward-1","title":"Fine-Tuning Language Models with Just Forward Passes","date":"2023-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-nlp/mezo","path":"large_models/tasks.py","file_url":"https://github.com/princeton-nlp/mezo/blob/HEAD/large_models/tasks.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":"f7c384f1e681ea7a","code_sha256_prefix":"f7c384f1e681ea7a","mcp_get_code":{"code_sha256":"f7c384f1e681ea7a"}},{"arxiv_id":"2206.06614","arxiv_id_is_arxiv":true,"paper":"/paper/transformers-are-meta-reinforcement-learners-1","title":"Transformers are Meta-Reinforcement Learners","date":"2022-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luckeciano/transformers-metarl","path":"benchmarks/src/garage_benchmarks/benchmarks.py","file_url":"https://github.com/luckeciano/transformers-metarl/blob/HEAD/benchmarks/src/garage_benchmarks/benchmarks.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":"8574703c48d0d43d","code_sha256_prefix":"8574703c48d0d43d","mcp_get_code":{"code_sha256":"8574703c48d0d43d"}},{"arxiv_id":"2106.03427","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-task-learning-from-language","title":"Hierarchical Task Learning from Language Instructions with Unified Transformers and Self-Monitoring","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"594zyc/HiTUT","path":"env/tasks.py","file_url":"https://github.com/594zyc/HiTUT/blob/HEAD/env/tasks.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":"5ffac7b83a094577","code_sha256_prefix":"5ffac7b83a094577","mcp_get_code":{"code_sha256":"5ffac7b83a094577"}},{"arxiv_id":"2105.06453","arxiv_id_is_arxiv":true,"paper":"/paper/episodic-transformer-for-vision-and-language","title":"Episodic Transformer for Vision-and-Language Navigation","date":"2021-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexpashevich/E.T.","path":"alfred/env/tasks.py","file_url":"https://github.com/alexpashevich/E.T./blob/HEAD/alfred/env/tasks.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":"d11401259503326f","code_sha256_prefix":"d11401259503326f","mcp_get_code":{"code_sha256":"d11401259503326f"}},{"arxiv_id":"2006.04061","arxiv_id_is_arxiv":true,"paper":"/paper/dual-policy-distillation","title":"Dual Policy Distillation","date":"2020-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kiminh/dual-policy-distillation","path":"baselines/bench/benchmarks.py","file_url":"https://github.com/kiminh/dual-policy-distillation/blob/HEAD/baselines/bench/benchmarks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, kiminh/dual-policy-distillation, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"3e82b9de30b1625f","code_sha256_prefix":"3e82b9de30b1625f","mcp_get_code":{"code_sha256":"3e82b9de30b1625f"}},{"arxiv_id":"2001.03415","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-interactions-modeling-with-1","title":"Multi-Agent Interactions Modeling with Correlated Policies","date":"2020-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apexrl/codail","path":"multi-agent-irl/rl/bench/benchmarks.py","file_url":"https://github.com/apexrl/codail/blob/HEAD/multi-agent-irl/rl/bench/benchmarks.py","status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7e1a88346f1d7ae7","code_sha256_prefix":"7e1a88346f1d7ae7","mcp_get_code":{"code_sha256":"7e1a88346f1d7ae7"}},{"arxiv_id":"1912.01734","arxiv_id_is_arxiv":true,"paper":"/paper/alfred-a-benchmark-for-interpreting-grounded","title":"ALFRED: A Benchmark for Interpreting Grounded Instructions for Everyday Tasks","date":"2019-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"askforalfred/alfred","path":"env/tasks.py","file_url":"https://github.com/askforalfred/alfred/blob/HEAD/env/tasks.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":"5ffac7b83a094577","code_sha256_prefix":"5ffac7b83a094577","mcp_get_code":{"code_sha256":"5ffac7b83a094577"}},{"arxiv_id":"1905.02363","arxiv_id_is_arxiv":true,"paper":"/paper/dimension-wise-importance-sampling-weight","title":"Dimension-Wise Importance Sampling Weight Clipping for Sample-Efficient Reinforcement Learning","date":"2019-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seungyulhan/disc","path":"baselines/bench/benchmarks.py","file_url":"https://github.com/seungyulhan/disc/blob/HEAD/baselines/bench/benchmarks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, seungyulhan/disc, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"3e82b9de30b1625f","code_sha256_prefix":"3e82b9de30b1625f","mcp_get_code":{"code_sha256":"3e82b9de30b1625f"}},{"arxiv_id":"1606.03476","arxiv_id_is_arxiv":true,"paper":"/paper/generative-adversarial-imitation-learning","title":"Generative Adversarial Imitation Learning","date":"2016-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Techget/gail-tf-sc2","path":"gailtf/baselines/bench/benchmarks.py","file_url":"https://github.com/Techget/gail-tf-sc2/blob/HEAD/gailtf/baselines/bench/benchmarks.py","status":"ran","verification_level":1,"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 seungyulhan/disc, and MIT, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","code_sha256":"3e82b9de30b1625f","code_sha256_prefix":"3e82b9de30b1625f","mcp_get_code":{"code_sha256":"3e82b9de30b1625f"}},{"arxiv_id":"1604.06778","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-deep-reinforcement-learning-for","title":"Benchmarking Deep Reinforcement Learning for Continuous Control","date":"2016-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rlworkgroup/garage","path":"benchmarks/src/garage_benchmarks/benchmarks.py","file_url":"https://github.com/rlworkgroup/garage/blob/HEAD/benchmarks/src/garage_benchmarks/benchmarks.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":"8574703c48d0d43d","code_sha256_prefix":"8574703c48d0d43d","mcp_get_code":{"code_sha256":"8574703c48d0d43d"}},{"arxiv_id":"1301.3781","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-estimation-of-word-representations","title":"Efficient Estimation of Word Representations in Vector Space","date":"2013-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ringbdstack/socialed","path":"SocialED/detector/hcrc.py","file_url":"https://github.com/ringbdstack/socialed/blob/HEAD/SocialED/detector/hcrc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"410fc5e1b2944e14","code_sha256_prefix":"410fc5e1b2944e14","mcp_get_code":{"code_sha256":"410fc5e1b2944e14"}},{"arxiv_id":"2025.findings-emnlp.176","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-emnlp.176","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ContextualAI/LMUnit","path":"lmunit/tasks.py","file_url":"https://github.com/ContextualAI/LMUnit/blob/HEAD/lmunit/tasks.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":"a35da997d266a35c","code_sha256_prefix":"a35da997d266a35c","mcp_get_code":{"code_sha256":"a35da997d266a35c"}}],"record_sha256":"18d039fc937a99606a8e85a7cd373e6a8e1b11ae298053b99a275dbf74dc8722","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}