Home › Code › get_task

get_task

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

get_task appears in the code Syntology harvested for 28 papers, as 14 distinct code bodies found in 28 places (a place is one code body under one paper). Of the 28 papers, 7 with a sample that ran: 6 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument. 1 of the code bodies carries a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named get_task do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 14 distinct code bodies named get_task: 4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 10 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
1ran · our draft was wrong
0ran; the contract check could not run
3ran
10unverified
1fingerprinted

Licence is a property of each copy, so it is counted per place: 9 of the 28 places are pointer only (Syntology does not serve that copy's text); at 1 of them this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text (hover the licence cell for why). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

28 papers shown of 28, newest first; 28 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 4 papers added by Syntology; 1 papers have no page here and are shown by their id only (arXiv: for an arXiv id; an id from another venue, such as ACL Anthology or AAAI, is named as that venue's id, never as an arXiv id). Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
GTA: Graph Theory Agent and Benchmark for Algorithmic Graph Reasoning with LLMs added by Syntology 2026-09 (from id) xzx34/GTA/src/gtbench/tasks.py 61d7b30722025b3d unverified MIT (permissive)
When Does Continual Learning Require Learning added by Syntology 2026-07 (from id) anneharrington/studying-cl/cl/tasks.py f387a906d3df00a6 unverified MIT (permissive)
Reasoning Primitives in Hybrid and Non-Hybrid LLMs: Do Architectural Differences Yield Advantages in State-Tracking and Recall? added by Syntology 2026-04 (from id) ultor1996/reasoning_primitives/src/templates.py 3a0a352c2bb0f352 unverified no licence file found · pointer only
Powering Up Zeroth-Order Training via Subspace Gradient Orthogonalization added by Syntology 2026-02 (from id) OPTML-Group/ZO-Muon/llm/tasks.py f7c384f1e681ea7a unverified MIT (permissive)
Fine-tuning Quantized Neural Networks with Zeroth-order Optimization 19 May 2025 maifoundations/qzo/large_language_models/tasks.py f7c384f1e681ea7a unverified MIT (permissive)
Embodied CoT Distillation From LLM To Off-the-shelf Agents 16 Dec 2024 osu-nlp-group/llm-planner/e2e/alfred/env/tasks.py 5ffac7b83a094577 unverified MIT (permissive)
Zeroth-Order Fine-Tuning of LLMs in Random Subspaces 11 Oct 2024 zimingyy/subzero/large_models/tasks.py f7c384f1e681ea7a unverified GPL-3.0 (copyleft) · pointer only
Do Large Language Models Perform the Way People Expect? Measuring the Human Generalization Function 3 Jun 2024 keyonvafa/human-generalization-llms/utils.py 0334516a40523434 ran · our draft was wrong MIT (permissive)
SemCoder: Training Code Language Models with Comprehensive Semantics Reasoning 3 Jun 2024 ARiSE-Lab/SemCoder/experiments/cruxeval_utils.py 0ea1d7ce8d9d3e2a unverified MIT (permissive)
QuanTA: Efficient High-Rank Fine-Tuning of LLMs with Quantum-Informed Tensor Adaptation 31 May 2024 quanta-fine-tuning/quanta/run/utils/tasks.py f7c384f1e681ea7a unverified Apache-2.0 (permissive)
DS-Agent: Automated Data Science by Empowering Large Language Models with Case-Based Reasoning 27 Feb 2024 guosyjlu/DS-Agent/deployment/prompt.py a45eb6f9978ac8b0 unverified no licence file found · pointer only
Revisiting Zeroth-Order Optimization for Memory-Efficient LLM Fine-Tuning: A Benchmark 18 Feb 2024 zo-bench/zo-llm/zo-bench/tasks.py f7c384f1e681ea7a unverified GPL-3.0 (copyleft) · pointer only
ZO-AdaMU Optimizer: Adapting Perturbation by the Momentum and Uncertainty in Zeroth-order Optimization 23 Dec 2023 mathisall/zo-adamu/tasks.py f7c384f1e681ea7a unverified no licence file found · pointer only
LACMA: Language-Aligning Contrastive Learning with Meta-Actions for Embodied Instruction Following 18 Oct 2023 joeyy5588/LACMA/alfred/env/tasks.py d11401259503326f unverified MIT (permissive)
DPZero: Private Fine-Tuning of Language Models without Backpropagation 14 Oct 2023 Liang137/DPZero/opt/src/tasks.py f7c384f1e681ea7a unverified MIT (permissive)
Multi-Level Compositional Reasoning for Interactive Instruction Following 18 Aug 2023 yonseivnl/mcr-agent/env/tasks.py 5ffac7b83a094577 unverified no licence file found · pointer only
Fine-Tuning Language Models with Just Forward Passes 27 May 2023 princeton-nlp/mezo/large_models/tasks.py f7c384f1e681ea7a unverified MIT (permissive)
Transformers are Meta-Reinforcement Learners 14 Jun 2022 luckeciano/transformers-metarl/benchmarks/src/garage_benchmarks/benchmarks.py 8574703c48d0d43d ran MIT (permissive)
Hierarchical Task Learning from Language Instructions with Unified Transformers and Self-Monitoring 7 Jun 2021 594zyc/HiTUT/env/tasks.py 5ffac7b83a094577 unverified MIT (permissive)
Episodic Transformer for Vision-and-Language Navigation 13 May 2021 alexpashevich/E.T./alfred/env/tasks.py d11401259503326f unverified MIT (permissive)
Dual Policy Distillation 7 Jun 2020 kiminh/dual-policy-distillation/baselines/bench/benchmarks.py 3e82b9de30b1625f ran MIT recorded; this copy not marked cleared · pointer only
Multi-Agent Interactions Modeling with Correlated Policies 4 Jan 2020 apexrl/codail/multi-agent-irl/rl/bench/benchmarks.py 7e1a88346f1d7ae7 unverified Apache-2.0 (permissive)
ALFRED: A Benchmark for Interpreting Grounded Instructions for Everyday Tasks 3 Dec 2019 askforalfred/alfred/env/tasks.py 5ffac7b83a094577 unverified MIT (permissive)
Dimension-Wise Importance Sampling Weight Clipping for Sample-Efficient Reinforcement Learning 7 May 2019 seungyulhan/disc/baselines/bench/benchmarks.py 3e82b9de30b1625f ran MIT recorded; this copy not marked cleared · pointer only
Generative Adversarial Imitation Learning 10 Jun 2016 Techget/gail-tf-sc2/gailtf/baselines/bench/benchmarks.py 3e82b9de30b1625f ran MIT (permissive) here; the stored copy is pointer only
Benchmarking Deep Reinforcement Learning for Continuous Control 22 Apr 2016 rlworkgroup/garage/benchmarks/src/garage_benchmarks/benchmarks.py 8574703c48d0d43d ran MIT (permissive)
Efficient Estimation of Word Representations in Vector Space 16 Jan 2013 ringbdstack/socialed/SocialED/detector/hcrc.py 410fc5e1b2944e14 ran fingerprinted BSD-2-Clause (permissive)
ACL Anthology id 2025.findings-emnlp.176 ContextualAI/LMUnit/lmunit/tasks.py a35da997d266a35c unverified MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections