row_id string | section string | section_slug string | resource_type string | marker string | title string | url string | url_kind string | domain string | annotation string | description string | key_contribution string | novelty string | impact string | signal string | signal_strength string | source_readme string | source_line int64 | source_url string | date_added string | collection string | collection_slug string | user_goal string | lifecycle_stages string | audience string | loop_layer string | scope_fit string | evidence_class string | evidence_tier string | source_status string | canonical_url string | source_title string | source_description string | authors string | publication_date string | publication_year string | publication_venue string | publisher string | doi string | publication_note string | primary_category string | metadata_source string | github_repo string | github_stars string | github_forks string | github_license string | github_created_at string | github_updated_at string | arxiv_id string | audited_at timestamp[ms] |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ale-0801 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Do LLM-Generated Skills Make Better AI Data Scientists? A Component Ablation Across Data-Science Workflows | https://arxiv.org/abs/2607.07504 | external | arxiv.org | Negative result for low-curation skill libraries: across four data-science lifecycle stages (56 tasks), fully LLM-generated skill files show no reliable improvement over plain task prompting, and component ablations find no skill part that helps either (all p > 0.396). Useful counterweight to the skill-generation enthu... | Negative result for low-curation skill libraries: across four data-science lifecycle stages (56 tasks), fully LLM-generated skill files show no reliable improvement over plain task prompting, and component ablations find no skill part that helps either (all p > 0.396). Useful counterweight to the skill-generation enthu... | Negative result for low-curation skill libraries: across four data-science lifecycle stages (56 tasks), fully LLM-generated skill files show no reliable improvement over plain task prompting, and component ablations find no skill part that helps either (all p > 0.396). Useful counterweight to the skill-generation enthu... | Keeps adoption grounded in known failure modes, economics, and operational limits. Negative result for low-curation skill libraries: across four data-science lifecycle stages (56 tasks), fully LLM-generated skill files show no reliable improvement over plain task prompting, and component ablations find no skill part th... | Use Do LLM-Generated Skills Make Better AI Data Scientists? A Component Ablation Across Data-Science Workflows to bound risk before recurring or unattended execution. | Research source arXiv:2607.07504; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,554 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1554 | Govern | govern | Bound permissions, cost, failure, and escalation. | budget;escalation;exit | researcher;evaluator;operator;security | cross-layer | enabling | research-paper | A | ok | https://arxiv.org/abs/2607.07504 | [2607.07504] Do LLM-Generated Skills Make Better AI Data Scientists? A Component Ablation Across Data-Science Workflows | Product data scientists often ask LLM-based agents to help with recurring execution tasks such as cleaning data, writing SQL, choosing statistical tests, and formatting results. Reusable skill files are meant to avoid prompting from scratch by packaging guidance for a task family. Expert-written skills can encode high-... | Wei-Jung Huang | 2026 | 2026 | KDD Workshop on AI Data Scientist | ACM SIGKDD | Accepted at KDD Workshop on AI Data Scientist; the linked arXiv record is the available paper version. | cs.AI | Current arXiv acceptance note and official workshop page | 2607.07504 | 2026-07-31T18:10:45 | ||||||||
ale-0802 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | The Verification Horizon: No Silver Bullet for Coding Agent Rewards | https://arxiv.org/abs/2606.26300 | external | arxiv.org | Position paper arguing verification has become harder than generation for coding agents: every verifier is only a proxy for underspecified human intent, so reward design faces a horizon that no single verification mechanism crosses. | Position paper arguing verification has become harder than generation for coding agents: every verifier is only a proxy for underspecified human intent, so reward design faces a horizon that no single verification mechanism crosses. | Position paper arguing verification has become harder than generation for coding agents: every verifier is only a proxy for underspecified human intent, so reward design faces a horizon that no single verification mechanism crosses. | Verification is promoted from a final check to a loop-control signal. Position paper arguing verification has become harder than generation for coding agents: every verifier is only a proxy for underspecified human intent, so reward design faces a horizon that no single verification mechanism crosses. | Use The Verification Horizon: No Silver Bullet for Coding Agent Rewards to bound risk before recurring or unattended execution. | Research source arXiv:2606.26300; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,555 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1555 | Govern | govern | Bound permissions, cost, failure, and escalation. | verification;escalation | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2606.26300 | [2606.26300] The Verification Horizon: No Silver Bullet for Coding Agent Rewards | A classical intuition holds that verifying a solution is easier than producing one. For today's coding agents, this intuition is being inverted: as foundation models develop stronger reasoning capabilities and engineering harnesses grow more sophisticated, generating complex candidate solutions is no longer difficult -... | Binghai Wang; Chenlong Zhang; Dayiheng Liu; Jiajun Zhang; Jiawei Chen; Mingze Li; Mouxiang Chen; Rongyao Fang; Siyuan Zhang; Xuwu Wang; Yuheng Jing; Zeyao Ma; Zeyu Cui | 2026-06-24 | 2026 | arXiv | arXiv | Authors are listed alphabetically by their first names | cs.AI | arxiv-api | 2606.26300 | 2026-07-31T18:10:45 | ||||||||
ale-0803 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Critique | ⚠️ | Write Code Like a Human Will Maintain It | https://unstack.io/write-code-like-a-human-will-maintain-it | external | unstack.io | Argues that agent-driven codebases create a compounding feedback loop where every merged shortcut becomes training signal for the next generation of changes, so code quality standards matter more, not less, under automation. | Argues that agent-driven codebases create a compounding feedback loop where every merged shortcut becomes training signal for the next generation of changes, so code quality standards matter more, not less, under automation. | Argues that agent-driven codebases create a compounding feedback loop where every merged shortcut becomes training signal for the next generation of changes, so code quality standards matter more, not less, under automation. | Keeps adoption grounded in known failure modes, economics, and operational limits. Argues that agent-driven codebases create a compounding feedback loop where every merged shortcut becomes training signal for the next generation of changes, so code quality standards matter more, not less, under automation. | Use Write Code Like a Human Will Maintain It to bound risk before recurring or unattended execution. | Contextual source from unstack.io; useful for practice signals or boundary conditions, not independent validation. | contextual | README.md | 1,556 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1556 | Govern | govern | Bound permissions, cost, failure, and escalation. | escalation | operator;security | cross-layer | enabling | risk-analysis | B | ok | https://unstack.io/write-code-like-a-human-will-maintain-it | Write code like a human will maintain it | One of the best things about LLMs is that they'll write code for you, all day long. Who cares about DRY? You don't have to be the one updating the same long con... | 2026-07-10 | 2026 | Unstack | html-meta | 2026-07-31T18:10:45 | |||||||||||||
ale-0804 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Blog | 📝 | Claude Code Sends 33k Tokens Before Reading the Prompt | https://systima.ai/blog/claude-code-vs-opencode-token-overhead | external | systima.ai | July 12, 2026 proxy-interception study of per-turn harness overhead: Claude Code sends ~33k tokens of scaffolding before user input versus OpenCode's ~7k (a 4.7x gap that narrows to 3.3x on newer models), mid-session cache-block rewrites produce up to 54x more cache-write tokens on identical tasks, a 72KB instruction f... | July 12, 2026 proxy-interception study of per-turn harness overhead: Claude Code sends ~33k tokens of scaffolding before user input versus OpenCode's ~7k (a 4.7x gap that narrows to 3.3x on newer models), mid-session cache-block rewrites produce up to 54x more cache-write tokens on identical tasks, a 72KB instruction f... | July 12, 2026 proxy-interception study of per-turn harness overhead: Claude Code sends ~33k tokens of scaffolding before user input versus OpenCode's ~7k (a 4.7x gap that narrows to 3.3x on newer models), mid-session cache-block rewrites produce up to 54x more cache-write tokens on identical tasks, a 72KB instruction f... | The work separates roles across agents, verifiers, or orchestration layers. July 12, 2026 proxy-interception study of per-turn harness overhead: Claude Code sends ~33k tokens of scaffolding before user input versus OpenCode's ~7k (a 4.7x gap that narrows to 3.3x on newer models), mid-session cache-block rewrites produc... | Use Claude Code Sends 33k Tokens Before Reading the Prompt to bound risk before recurring or unattended execution. | Contextual source from systima.ai; useful for practice signals or boundary conditions, not independent validation. | contextual | README.md | 1,557 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1557 | Govern | govern | Bound permissions, cost, failure, and escalation. | delegation;budget | operator;security | cross-layer | enabling | practitioner-analysis | B | ok | https://systima.ai/blog/claude-code-vs-opencode-token-overhead | Claude Code Sends 4.7x More Tokens Than OpenCode Before Reading Your Prompt | Systima Blog | Claude Code vs OpenCode token overhead measured at the API boundary. Out-of-the-box baselines, instruction file weight, MCP schema tax, subagent multipliers, and cache-write behaviour. | Systima | 2026-07-12 | 2026 | Systima | html-meta | 2026-07-31T18:10:45 | ||||||||||||
ale-0805 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Rethinking the Evaluation of Harness Evolution for Agents | https://arxiv.org/abs/2607.12227 | external | arxiv.org | Re-evaluates harness evolution on Terminal-Bench 2.1 with GPT-5.4 and Claude Opus 4.6, finding that evolved harnesses do not consistently beat budget-matched search and transfer only weakly to held-out tasks. | Re-evaluates harness evolution on Terminal-Bench 2.1 with GPT-5.4 and Claude Opus 4.6, finding that evolved harnesses do not consistently beat budget-matched search and transfer only weakly to held-out tasks. | Re-evaluates harness evolution on Terminal-Bench 2.1 with GPT-5.4 and Claude Opus 4.6, finding that evolved harnesses do not consistently beat budget-matched search and transfer only weakly to held-out tasks. | Evaluation data is used as the feedback signal for improving loop behavior. Re-evaluates harness evolution on Terminal-Bench 2.1 with GPT-5.4 and Claude Opus 4.6, finding that evolved harnesses do not consistently beat budget-matched search and transfer only weakly to held-out tasks. | Use Rethinking the Evaluation of Harness Evolution for Agents to bound risk before recurring or unattended execution. | Research source arXiv:2607.12227; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,558 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1558 | 2026-07-17 | Govern | govern | Bound permissions, cost, failure, and escalation. | verification;budget | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.12227 | [2607.12227] Rethinking the Evaluation of Harness Evolution for Agents | We revisit the evaluation of automatic harness evolution for LLM agents. Existing harness evolution methods use unit test cases to search for harness configurations and then report final performance on the same public benchmark. This protocol raises two fundamental concerns. First, harness evolution is itself an iterat... | Yike Wang; Huaisheng Zhu; Zhengyu Hu; Yige Yuan; Zhengyu Chen; Shakti Senthil; Hannaneh Hajishirzi; Yulia Tsvetkov; Pradeep Dasigi; Teng Xiao | 2026-07-14 | 2026 | arXiv | arXiv | cs.AI | arxiv-api | 2607.12227 | 2026-07-31T18:10:45 | ||||||||
ale-0806 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Compaction as Epistemic Failure: How Agentic LLM Tools Fabricate Confirmed Results from Killed Processes | https://arxiv.org/abs/2607.13071 | external | arxiv.org | Documents a Claude Code failure in which partial output from a process killed with exit 143 becomes a confirmed claim after context compaction, without re-verification, showing why receipts and process status must survive summarization. | Documents a Claude Code failure in which partial output from a process killed with exit 143 becomes a confirmed claim after context compaction, without re-verification, showing why receipts and process status must survive summarization. | Documents a Claude Code failure in which partial output from a process killed with exit 143 becomes a confirmed claim after context compaction, without re-verification, showing why receipts and process status must survive summarization. | Verification is promoted from a final check to a loop-control signal. Documents a Claude Code failure in which partial output from a process killed with exit 143 becomes a confirmed claim after context compaction, without re-verification, showing why receipts and process status must survive summarization. | Use Compaction as Epistemic Failure: How Agentic LLM Tools Fabricate Confirmed Results from Killed Processes to bound risk before recurring or unattended execution. | Research source arXiv:2607.13071; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,559 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1559 | 2026-07-17 | Govern | govern | Bound permissions, cost, failure, and escalation. | workspace;context;verification;state;exit | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.13071 | [2607.13071] Compaction as Epistemic Failure: How Agentic LLM Tools Fabricate Confirmed Results from Killed Processes | Agentic LLM coding tools compress long session histories into compaction summaries that subsequent sessions inherit as ground truth. This paper documents a failure mode in Claude Code where partial standard output from timed-out commands (exit code 143) is recorded in compaction summaries as confirmed results, propagat... | Hiroki Tamba | 2026-07-11 | 2026 | arXiv | arXiv | 8 pages, companion to arXiv:2606.26185 | cs.SE | arxiv-api | 2607.13071 | 2026-07-31T18:10:45 | |||||||
ale-0807 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Do Agent Optimizers Compound? A Continual-Learning Evaluation on Terminal-Bench 2.0 | https://arxiv.org/abs/2607.14004 | external | arxiv.org | Compares GEPA, Meta Harness, and RELAI-VCL under matched continual-learning budgets; only the regression-controlled method keeps improving, reaching 76.4% lifelong performance versus 66.0%, 64.6%, and 58.7% for the reported alternatives. | Compares GEPA, Meta Harness, and RELAI-VCL under matched continual-learning budgets; only the regression-controlled method keeps improving, reaching 76.4% lifelong performance versus 66.0%, 64.6%, and 58.7% for the reported alternatives. | Compares GEPA, Meta Harness, and RELAI-VCL under matched continual-learning budgets; only the regression-controlled method keeps improving, reaching 76.4% lifelong performance versus 66.0%, 64.6%, and 58.7% for the reported alternatives. | Evaluation data is used as the feedback signal for improving loop behavior. Compares GEPA, Meta Harness, and RELAI-VCL under matched continual-learning budgets; only the regression-controlled method keeps improving, reaching 76.4% lifelong performance versus 66.0%, 64.6%, and 58.7% for the reported alternatives. | Use Do Agent Optimizers Compound? A Continual-Learning Evaluation on Terminal-Bench 2.0 to bound risk before recurring or unattended execution. | Research source arXiv:2607.14004; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,560 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1560 | 2026-07-17 | Govern | govern | Bound permissions, cost, failure, and escalation. | verification;budget | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.14004 | [2607.14004] Do Agent Optimizers Compound? A Continual-Learning Evaluation on Terminal-Bench 2.0 | Most reported gains from agent-optimization methods are one-shot: an agent is optimized against a fixed benchmark and the resulting improvement is reported as if it were a stable property of the method. This does not test the setting that matters for deployed agents, where optimization is applied recursively as new fai... | Wenxiao Wang; Priyatham Kattakinda; Soheil Feizi | 2026-07-15 | 2026 | arXiv | arXiv | Technical Report by RELAI (relai.ai) | cs.AI | arxiv-api | 2607.14004 | 2026-07-31T18:10:45 | |||||||
ale-0808 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Does Multi-Agent Debate Improve AI Feedback on Research Papers? | https://arxiv.org/abs/2607.14713 | external | arxiv.org | In a preregistered masked study with authors of 44 meta-analyses, participants prefer single-pass feedback to two multi-agent debate systems, one using about 30x more tokens; AI judges reverse the human preference, warning against self-evaluation alone. | In a preregistered masked study with authors of 44 meta-analyses, participants prefer single-pass feedback to two multi-agent debate systems, one using about 30x more tokens; AI judges reverse the human preference, warning against self-evaluation alone. | In a preregistered masked study with authors of 44 meta-analyses, participants prefer single-pass feedback to two multi-agent debate systems, one using about 30x more tokens; AI judges reverse the human preference, warning against self-evaluation alone. | Evaluation data is used as the feedback signal for improving loop behavior. In a preregistered masked study with authors of 44 meta-analyses, participants prefer single-pass feedback to two multi-agent debate systems, one using about 30x more tokens; AI judges reverse the human preference, warning against self-evaluati... | Use Does Multi-Agent Debate Improve AI Feedback on Research Papers? to bound risk before recurring or unattended execution. | Research source arXiv:2607.14713; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,561 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1561 | 2026-07-17 | Govern | govern | Bound permissions, cost, failure, and escalation. | delegation;verification;budget;escalation | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.14713 | [2607.14713] Does Multi-Agent Debate Improve AI Feedback on Research Papers? | Probably not, at least for meta-analyses in economics. In a pre-registered, identity-masked, within-paper experiment, the authors of 44 meta-analyses ranked three AI reports on their own paper by usefulness for improving it: a single pass by a frontier model against two multi-agent debate tools we built and expected to... | Tomas Havranek; Zuzana Irsova | 2026-07-16 | 2026 | arXiv | arXiv | 29 pages, 1 figure, 6 tables. Pre-registered on OSF; data, code, judge prompts, and blinded reports in the replication package on Zenodo. Project page: https://meta-analysis.cz/debate | econ.GN | arxiv-api | 2607.14713 | 2026-07-31T18:10:45 | |||||||
ale-0809 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Binding Drift in Multi-Step Tool-Augmented Agents | https://arxiv.org/abs/2607.18316 | external | arxiv.org | Isolates 'binding drift', entity bindings that start correct then silently go wrong across sequential tool-calling steps, from ordinary error propagation, using 200 workflows and 580 entity-binding-scored steps across four enterprise domains and eight model backends; a naive entity-lock persistence mechanism amplifies ... | Isolates 'binding drift', entity bindings that start correct then silently go wrong across sequential tool-calling steps, from ordinary error propagation, using 200 workflows and 580 entity-binding-scored steps across four enterprise domains and eight model backends; a naive entity-lock persistence mechanism amplifies ... | Isolates 'binding drift', entity bindings that start correct then silently go wrong across sequential tool-calling steps, from ordinary error propagation, using 200 workflows and 580 entity-binding-scored steps across four enterprise domains and eight model backends; a naive entity-lock persistence mechanism amplifies ... | Verification is promoted from a final check to a loop-control signal. Isolates 'binding drift', entity bindings that start correct then silently go wrong across sequential tool-calling steps, from ordinary error propagation, using 200 workflows and 580 entity-binding-scored steps across four enterprise domains and eigh... | Use Binding Drift in Multi-Step Tool-Augmented Agents to bound risk before recurring or unattended execution. | Research source arXiv:2607.18316; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,562 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1562 | 2026-07-22 | Govern | govern | Bound permissions, cost, failure, and escalation. | workspace;verification;state | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.18316 | [2607.18316] Binding Drift in Multi-Step Tool-Augmented Agents | Tool-augmented language-model agents execute multi-step workflows over external systems, resolving an entity once and then acting on it across subsequent steps. Prior work shows that in single-step actions, agents select the correct tool but bind it to the wrong entity 24-26% of the time. We study what happens to entit... | Rahul Suresh Babu; Shashank Indukuri | 2026-07-17 | 2026 | arXiv | arXiv | 14 pages, 5 tables, 1 figure. Equal contribution by both authors. Code and data: https://github.com/shashank-indukuri/binding-drift | cs.SE | arxiv-api | 2607.18316 | 2026-07-31T18:10:45 | |||||||
ale-0810 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | How Agent Skills Fail under Long Contexts: A White-Box Study in Code Auditing | https://arxiv.org/abs/2607.17937 | external | arxiv.org | White-box study of skill-following degradation over long tool-using trajectories in a code-audit workflow: pass rates fall from 8/10 in clean context to 3/10 at ~299K characters even though requirement coverage stays above 92%, a detailed external checklist restores 10/10 versus 5/10 for generic self-check, and the pap... | White-box study of skill-following degradation over long tool-using trajectories in a code-audit workflow: pass rates fall from 8/10 in clean context to 3/10 at ~299K characters even though requirement coverage stays above 92%, a detailed external checklist restores 10/10 versus 5/10 for generic self-check, and the pap... | White-box study of skill-following degradation over long tool-using trajectories in a code-audit workflow: pass rates fall from 8/10 in clean context to 3/10 at ~299K characters even though requirement coverage stays above 92%, a detailed external checklist restores 10/10 versus 5/10 for generic self-check, and the pap... | Context is managed as durable loop state rather than a single prompt payload. White-box study of skill-following degradation over long tool-using trajectories in a code-audit workflow: pass rates fall from 8/10 in clean context to 3/10 at ~299K characters even though requirement coverage stays above 92%, a detailed ext... | Use How Agent Skills Fail under Long Contexts: A White-Box Study in Code Auditing to bound risk before recurring or unattended execution. | Research source arXiv:2607.17937; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,563 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1563 | 2026-07-22 | Govern | govern | Bound permissions, cost, failure, and escalation. | workspace;context | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.17937 | [2607.17937] How Agent Skills Fail under Long Contexts: A White-Box Study in Code Auditing | Agent Skills package procedural instructions and checks for use by general-purpose agents, but loading a skill does not guarantee that every requirement remains active throughout a long tool-using trajectory. We study this problem in a production-derived, white-box code-audit workflow. Holding the task and 24 artifact ... | Yue Xue | 2026-07-20 | 2026 | arXiv | arXiv | cs.SE | arxiv-api | 2607.17937 | 2026-07-31T18:10:45 | ||||||||
ale-0811 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Phantom Guardrails: When Self-Improving Agent Harnesses Fix Failures That Never Happened | https://arxiv.org/abs/2607.13083 | external | arxiv.org | Names a failure mode of self-improving harness loops: the proposer LLM fabricates guardrails for failure classes that provably never occurred (15 of 60 runs when input merely resembles a familiar rule), and once inside an add-only accept loop the phantom guardrail persists; ships a deterministic micro-lab with byte-exa... | Names a failure mode of self-improving harness loops: the proposer LLM fabricates guardrails for failure classes that provably never occurred (15 of 60 runs when input merely resembles a familiar rule), and once inside an add-only accept loop the phantom guardrail persists; ships a deterministic micro-lab with byte-exa... | Names a failure mode of self-improving harness loops: the proposer LLM fabricates guardrails for failure classes that provably never occurred (15 of 60 runs when input merely resembles a familiar rule), and once inside an add-only accept loop the phantom guardrail persists; ships a deterministic micro-lab with byte-exa... | State persistence is explicit enough for repeated runs and handoff. Names a failure mode of self-improving harness loops: the proposer LLM fabricates guardrails for failure classes that provably never occurred (15 of 60 runs when input merely resembles a familiar rule), and once inside an add-only accept loop the phant... | Use Phantom Guardrails: When Self-Improving Agent Harnesses Fix Failures That Never Happened to bound risk before recurring or unattended execution. | Research source arXiv:2607.13083; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,564 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1564 | 2026-07-22 | Govern | govern | Bound permissions, cost, failure, and escalation. | state | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.13083 | [2607.13083] Phantom Guardrails: When Self-Improving Agent Harnesses Fix Failures That Never Happened | Self-improving AI agents are designed to learn from their mistakes. We show they can also hallucinate mistakes that never happened. We study this failure mode in automated harness optimization, where an LLM-based proposer edits an agent's scaffold, including prompts, parsers, filters, validators and guardrails, to elim... | Su Wang; Pin Qian; Yifan Lin; Jingzhou Xu; Yihang Chen; Xiaochong Jiang; Lifei Liu; Haoran Yu | 2026-07-13 | 2026 | arXiv | arXiv | cs.CR | arxiv-api | 2607.13083 | 2026-07-31T18:10:45 | ||||||||
ale-0812 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Skills That Don't Exist: A Large-Scale Study of Hallucinated Skill Recommendation | https://arxiv.org/abs/2607.12340 | external | arxiv.org | Measures a 36% average rate of agents recommending non-existent skills across 15,000 prompts, and shows the same fake names recur consistently, enabling slopsquatting-style supply-chain attacks where adversaries pre-register malicious skills under the hallucinated names agents will predictably ask for. | Measures a 36% average rate of agents recommending non-existent skills across 15,000 prompts, and shows the same fake names recur consistently, enabling slopsquatting-style supply-chain attacks where adversaries pre-register malicious skills under the hallucinated names agents will predictably ask for. | Measures a 36% average rate of agents recommending non-existent skills across 15,000 prompts, and shows the same fake names recur consistently, enabling slopsquatting-style supply-chain attacks where adversaries pre-register malicious skills under the hallucinated names agents will predictably ask for. | Keeps adoption grounded in known failure modes, economics, and operational limits. Measures a 36% average rate of agents recommending non-existent skills across 15,000 prompts, and shows the same fake names recur consistently, enabling slopsquatting-style supply-chain attacks where adversaries pre-register malicious sk... | Use Skills That Don't Exist: A Large-Scale Study of Hallucinated Skill Recommendation to bound risk before recurring or unattended execution. | Research source arXiv:2607.12340; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,565 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1565 | 2026-07-22 | Govern | govern | Bound permissions, cost, failure, and escalation. | budget;escalation;exit | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.12340 | [2607.12340] Skills That Don't Exist: A Large-Scale Study of Hallucinated Skill Recommendation in LLM Agents | LLM agents acquire new capabilities by downloading skills from open registries. Instead of browsing these catalogs manually, developers typically ask the agent to recommend and install a skill. This convenience hides a risk: agents frequently invent names for skills that exist in no registry. We term this flaw skill na... | Weifeng Yuan; Wenbo Guo; Feng Dong; Haoyu Wang; Yang Liu | 2026-07-14 | 2026 | arXiv | arXiv | cs.SE | arxiv-api | 2607.12340 | 2026-07-31T18:10:45 | ||||||||
ale-0813 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Token Reduction Is Not Cost Reduction | https://arxiv.org/abs/2607.12161 | external | arxiv.org | Analysis of 2,848 real Claude Code runs showing prompt-cache traffic accounts for ~87% of billed cost, so local token/context compression does not reliably lower the bill, argues loop cost engineering should optimize success-adjusted billed cost, not token counts. Directly actionable for anyone running high-volume agen... | Analysis of 2,848 real Claude Code runs showing prompt-cache traffic accounts for ~87% of billed cost, so local token/context compression does not reliably lower the bill, argues loop cost engineering should optimize success-adjusted billed cost, not token counts. Directly actionable for anyone running high-volume agen... | Analysis of 2,848 real Claude Code runs showing prompt-cache traffic accounts for ~87% of billed cost, so local token/context compression does not reliably lower the bill, argues loop cost engineering should optimize success-adjusted billed cost, not token counts. Directly actionable for anyone running high-volume agen... | Context is managed as durable loop state rather than a single prompt payload. Analysis of 2,848 real Claude Code runs showing prompt-cache traffic accounts for ~87% of billed cost, so local token/context compression does not reliably lower the bill, argues loop cost engineering should optimize success-adjusted billed c... | Use Token Reduction Is Not Cost Reduction to bound risk before recurring or unattended execution. | Research source arXiv:2607.12161; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,566 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1566 | 2026-07-22 | Govern | govern | Bound permissions, cost, failure, and escalation. | context;budget | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.12161 | [2607.12161] Token Reduction Is Not Cost Reduction | Context-reduction layers for API-based coding agents, including command-output compressors, retrieval rankers, and API-boundary proxies, are commonly evaluated by how much context or tool output they remove. We ask a different question: which interventions actually reduce end-to-end billed cost while preserving task su... | Sarel Weinberger; Amir Hozez | 2026-07-13 | 2026 | arXiv | arXiv | cs.CL | arxiv-api | 2607.12161 | 2026-07-31T18:10:45 | ||||||||
ale-0814 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Blog | 📝 | What xAI's Grok Build CLI Actually Sends: A Wire-Level Analysis | https://gist.github.com/cereblab/dc9a40bc26120f4540e4e09b75ffb547 | external | gist.github.com | Wire-level analysis of the telemetry and payloads Grok Build transmits, a reminder that agent harnesses carry their own data-flow surface worth auditing before unattended use. | Wire-level analysis of the telemetry and payloads Grok Build transmits, a reminder that agent harnesses carry their own data-flow surface worth auditing before unattended use. | Wire-level analysis of the telemetry and payloads Grok Build transmits, a reminder that agent harnesses carry their own data-flow surface worth auditing before unattended use. | Keeps adoption grounded in known failure modes, economics, and operational limits. Wire-level analysis of the telemetry and payloads Grok Build transmits, a reminder that agent harnesses carry their own data-flow surface worth auditing before unattended use. | Use What xAI's Grok Build CLI Actually Sends: A Wire-Level Analysis to bound risk before recurring or unattended execution. | Contextual source from gist.github.com; useful for practice signals or boundary conditions, not independent validation. | contextual | README.md | 1,567 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1567 | 2026-07-22 | Govern | govern | Bound permissions, cost, failure, and escalation. | budget;escalation;exit | operator;security | cross-layer | enabling | practitioner-analysis | B | ok | https://gist.github.com/cereblab/dc9a40bc26120f4540e4e09b75ffb547 | What xAI Grok Build CLI actually sends to xAI - a wire-level analysis (grok 0.2.93) · GitHub | What xAI Grok Build CLI actually sends to xAI - a wire-level analysis (grok 0.2.93) - grok-build-cli-wire-analysis.md | Gist | html-meta | 2026-07-31T18:10:45 | ||||||||||||||
ale-0815 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Critique | ⚠️ | The Tower Keeps Rising | https://lucumr.pocoo.org/2026/7/13/the-tower-keeps-rising/ | external | lucumr.pocoo.org | Armin Ronacher's follow-up to The Coming Loop, on abstraction layers accumulating faster than understanding as agent tooling stacks up, and what that does to a codebase's long-term comprehensibility. | Armin Ronacher's follow-up to The Coming Loop, on abstraction layers accumulating faster than understanding as agent tooling stacks up, and what that does to a codebase's long-term comprehensibility. | Armin Ronacher's follow-up to The Coming Loop, on abstraction layers accumulating faster than understanding as agent tooling stacks up, and what that does to a codebase's long-term comprehensibility. | Keeps adoption grounded in known failure modes, economics, and operational limits. Armin Ronacher's follow-up to The Coming Loop, on abstraction layers accumulating faster than understanding as agent tooling stacks up, and what that does to a codebase's long-term comprehensibility. | Use The Tower Keeps Rising to bound risk before recurring or unattended execution. | Contextual source from lucumr.pocoo.org; useful for practice signals or boundary conditions, not independent validation. | contextual | README.md | 1,568 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1568 | 2026-07-22 | Govern | govern | Bound permissions, cost, failure, and escalation. | budget;escalation;exit | operator;security | cross-layer | enabling | risk-analysis | B | ok | https://lucumr.pocoo.org/2026/7/13/the-tower-keeps-rising/ | The Tower Keeps Rising | Armin Ronacher's Thoughts and Writings | Vibecoding and the possible collapse of a shared language. | 2026-07-13 | 2026 | Armin Ronacher's Thoughts and Writings | html-meta | 2026-07-31T18:10:45 | ||||||||||||
ale-0816 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | The Dark Room in the Reward Channel: Dense Prediction Rewards Collapse GRPO-Trained LLM Agents -- and What Actually Works | https://arxiv.org/abs/2607.21273 | external | arxiv.org | Shows dense next-observation prediction rewards under GRPO drive long-horizon LLM agents into a degenerate "dark room" absorbing state (prediction accuracy 1.0, task success 0), with a single-factor ablation localizing the cause to std normalization and auxiliary-loss channels as a working fix. A crisp negative result ... | Shows dense next-observation prediction rewards under GRPO drive long-horizon LLM agents into a degenerate "dark room" absorbing state (prediction accuracy 1.0, task success 0), with a single-factor ablation localizing the cause to std normalization and auxiliary-loss channels as a working fix. A crisp negative result ... | Shows dense next-observation prediction rewards under GRPO drive long-horizon LLM agents into a degenerate "dark room" absorbing state (prediction accuracy 1.0, task success 0), with a single-factor ablation localizing the cause to std normalization and auxiliary-loss channels as a working fix. A crisp negative result ... | The work targets tasks that exceed a single context window or prompt session. Shows dense next-observation prediction rewards under GRPO drive long-horizon LLM agents into a degenerate "dark room" absorbing state (prediction accuracy 1.0, task success 0), with a single-factor ablation localizing the cause to std normal... | Use The Dark Room in the Reward Channel: Dense Prediction Rewards Collapse GRPO-Trained LLM Agents -- and What Actually Works to bound risk before recurring or unattended execution. | Research source arXiv:2607.21273; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,569 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1569 | 2026-07-24 | Govern | govern | Bound permissions, cost, failure, and escalation. | state | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.21273 | [2607.21273] The Dark Room in the Reward Channel: Dense Prediction Rewards Collapse GRPO-Trained LLM Agents -- and What Actually Works | Dense per-step supervision is an appealing remedy for sparse-reward, long-horizon LLM agents: reward the agent for predicting its next observation, and memory should follow. We show that under group-normalized RL (GRPO), this recipe does not merely fail -- it destroys the policy. Across Qwen3-1.7B/4B/8B on ALFWorld, a ... | Yu Wang | 2026-07-23 | 2026 | arXiv | arXiv | 10.5281/zenodo.21505228 | cs.LG | arxiv-api | 2607.21273 | 2026-07-31T18:10:45 | |||||||
ale-0817 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Blog | 📝 | Why Software Factories Fail (or: Harness Engineering Is Not Enough) | https://github.com/humanlayer/advanced-context-engineering-for-coding-agents/blob/main/wsff.md | external | github.com | Dex Horthy's essay from his AI Engineer World's Fair 2026 keynote arguing that lights-off software factories fail because RL training rewards passing tests with no penalty for eroding codebase maintainability, so long-horizon quality feedback cannot be trained on, proposing front-loaded human judgment gates (requiremen... | Dex Horthy's essay from his AI Engineer World's Fair 2026 keynote arguing that lights-off software factories fail because RL training rewards passing tests with no penalty for eroding codebase maintainability, so long-horizon quality feedback cannot be trained on, proposing front-loaded human judgment gates (requiremen... | Dex Horthy's essay from his AI Engineer World's Fair 2026 keynote arguing that lights-off software factories fail because RL training rewards passing tests with no penalty for eroding codebase maintainability, so long-horizon quality feedback cannot be trained on, proposing front-loaded human judgment gates (requiremen... | The work targets tasks that exceed a single context window or prompt session. Dex Horthy's essay from his AI Engineer World's Fair 2026 keynote arguing that lights-off software factories fail because RL training rewards passing tests with no penalty for eroding codebase maintainability, so long-horizon quality feedback... | Use Why Software Factories Fail (or: Harness Engineering Is Not Enough) to bound risk before recurring or unattended execution. | Inspectable GitHub source (2,247 stars; 162 forks; updated 2026-07-31); popularity is context, not proof of reliability. | medium | README.md | 1,570 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1570 | 2026-07-24 | Govern | govern | Bound permissions, cost, failure, and escalation. | verification;escalation | operator;security | cross-layer | enabling | practitioner-analysis | B | ok | https://github.com/humanlayer/advanced-context-engineering-for-coding-agents/blob/main/wsff.md | advanced-context-engineering-for-coding-agents/wsff.md at main · humanlayer/advanced-context-engineering-for-coding-agents · GitHub | Contribute to humanlayer/advanced-context-engineering-for-coding-agents development by creating an account on GitHub. | 2025-08-29 | 2025 | humanlayer/advanced-context-engineering-for-coding-agents | GitHub | github-api | humanlayer/advanced-context-engineering-for-coding-agents | 2247 | 162 | 2025-08-29T17:55:00Z | 2026-07-31T17:48:08Z | 2026-07-31T18:10:45 | ||||||
ale-0818 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | The Boundaries of Automation: A Theory of Persistent Human Participation | https://arxiv.org/abs/2607.21547 | external | arxiv.org | Theory paper from Fourati, Schütze, Hüllermeier, and Gurevych challenging the assumption that humans stay in the loop only until AI capability catches up: it identifies three grounds for persistent human participation, technical complementarity, normative/developmental value, and objectives that emerge through the inte... | Theory paper from Fourati, Schütze, Hüllermeier, and Gurevych challenging the assumption that humans stay in the loop only until AI capability catches up: it identifies three grounds for persistent human participation, technical complementarity, normative/developmental value, and objectives that emerge through the inte... | Theory paper from Fourati, Schütze, Hüllermeier, and Gurevych challenging the assumption that humans stay in the loop only until AI capability catches up: it identifies three grounds for persistent human participation, technical complementarity, normative/developmental value, and objectives that emerge through the inte... | Evaluation data is used as the feedback signal for improving loop behavior. Theory paper from Fourati, Schütze, Hüllermeier, and Gurevych challenging the assumption that humans stay in the loop only until AI capability catches up: it identifies three grounds for persistent human participation, technical complementarity... | Use The Boundaries of Automation: A Theory of Persistent Human Participation to bound risk before recurring or unattended execution. | Research source arXiv:2607.21547; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,571 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1571 | 2026-07-25 | Govern | govern | Bound permissions, cost, failure, and escalation. | objective;verification;state;escalation | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.21547 | [2607.21547] The Boundaries of Automation: A Theory of Persistent Human Participation | The rapid progress of AI has intensified the long-standing pursuit of automation: replacing human participation with algorithms wherever possible. Implicit in this pursuit is the assumption that humans remain in the loop only because current AI systems are not yet sufficiently capable. This paper challenges that assump... | Fares Fourati; Hinrich Schütze; Eyke Hüllermeier; Iryna Gurevych | 2026-07-23 | 2026 | arXiv | arXiv | cs.AI | arxiv-api | 2607.21547 | 2026-07-31T18:10:45 | ||||||||
ale-0819 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Tool | 🧰 | Reward Hacking in the Wild | https://rewardhacking.org | external | rewardhacking.org | Searchable corpus of 3,607 user-reported AI-agent misbehavior incidents collected from GitHub, Hacker News, LessWrong, and X, normalized and classified across fourteen misbehavior types with severity ratings. Despite the name, literal reward hacking is only about 6 percent of incidents, with overeagerness and other mis... | Searchable corpus of 3,607 user-reported AI-agent misbehavior incidents collected from GitHub, Hacker News, LessWrong, and X, normalized and classified across fourteen misbehavior types with severity ratings. Despite the name, literal reward hacking is only about 6 percent of incidents, with overeagerness and other mis... | Searchable corpus of 3,607 user-reported AI-agent misbehavior incidents collected from GitHub, Hacker News, LessWrong, and X, normalized and classified across fourteen misbehavior types with severity ratings. Despite the name, literal reward hacking is only about 6 percent of incidents, with overeagerness and other mis... | Keeps adoption grounded in known failure modes, economics, and operational limits. Searchable corpus of 3,607 user-reported AI-agent misbehavior incidents collected from GitHub, Hacker News, LessWrong, and X, normalized and classified across fourteen misbehavior types with severity ratings. Despite the name, literal re... | Use Reward Hacking in the Wild to bound risk before recurring or unattended execution. | Working implementation, framework, runtime, or repository; signal comes from usable code and ecosystem adoption. | high | README.md | 1,572 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1572 | 2026-07-25 | Govern | govern | Bound permissions, cost, failure, and escalation. | budget;escalation;exit | builder;operator;security | cross-layer | enabling | implementation | A | ok | https://rewardhacking.org | Your AIs don't do what you want. This is really bad negligible: 1,468 (40.7%) minor: 1,373 (38.1%) significant: 618 (17.1%) severe: 121 (3.4%) unrated: 27 (0.7%) | Thousands of user-reported incidents of AI agents misbehaving, collected from public posts. Reports, not verified events. | Reward Hacking in the Wild | html-meta | 2026-07-31T18:10:45 | ||||||||||||||
ale-0820 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | What AI Red-Team Evaluations Can and Cannot Prove | https://arxiv.org/abs/2607.21735 | external | arxiv.org | NEAR WINDOW (Jul 23, 2026), flagged because a duplicate grep on the README returns zero hits and the subject is squarely the verification layer. Bandana Kaur gives a formal treatment of the epistemic limits of red-teaming, the practice now serving as the industry's primary safety gate for agent deployment. Introduces a... | NEAR WINDOW (Jul 23, 2026), flagged because a duplicate grep on the README returns zero hits and the subject is squarely the verification layer. Bandana Kaur gives a formal treatment of the epistemic limits of red-teaming, the practice now serving as the industry's primary safety gate for agent deployment. Introduces a... | NEAR WINDOW (Jul 23, 2026), flagged because a duplicate grep on the README returns zero hits and the subject is squarely the verification layer. Bandana Kaur gives a formal treatment of the epistemic limits of red-teaming, the practice now serving as the industry's primary safety gate for agent deployment. Introduces a... | Verification is promoted from a final check to a loop-control signal. NEAR WINDOW (Jul 23, 2026), flagged because a duplicate grep on the README returns zero hits and the subject is squarely the verification layer. Bandana Kaur gives a formal treatment of the epistemic limits of red-teaming, the practice now serving as... | Use What AI Red-Team Evaluations Can and Cannot Prove to bound risk before recurring or unattended execution. | Research source arXiv:2607.21735; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,573 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1573 | 2026-07-28 | Govern | govern | Bound permissions, cost, failure, and escalation. | verification | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.21735 | [2607.21735] What AI Red-Team Evaluations Can and Cannot Prove | Red-team evaluations of AI models support some claims and not others, and the boundary between the two is calculable rather than merely a matter of judgment. We define the evidential ceiling of an evaluation as the largest factor by which one result can move belief under a fixed testing budget, derive it in closed form... | Bandana Kaur | 2026-07-23 | 2026 | arXiv | arXiv | 21 pages, 4 figures, 5 tables. Code and data links provided in the manuscript. v2: corrected Figure 1(b); corrected required sample sizes in Table 4 and in Sections 4.2, 4.6 and 5.2, which had been rounded rather than taken to the ceiling; corrected the sample-size expression stated in Methods; minor corrections to Tab... | cs.AI | arxiv-api | 2607.21735 | 2026-07-31T18:10:45 | |||||||
ale-0821 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | The Best Programming Language for Tokenmaxxing: An Investigation of Coding Agent Behavior Across Programming Languages | https://arxiv.org/abs/2607.22807 | external | arxiv.org | Shows coding-agent token cost varies starkly and consistently by programming language across five recent models on difficulty-controlled Python, Java, Rust, and OCaml problems. Explains why by re-executing every intermediate solution and abstracting each trajectory into test-outcome vectors: agents burn budget re-produ... | Shows coding-agent token cost varies starkly and consistently by programming language across five recent models on difficulty-controlled Python, Java, Rust, and OCaml problems. Explains why by re-executing every intermediate solution and abstracting each trajectory into test-outcome vectors: agents burn budget re-produ... | Shows coding-agent token cost varies starkly and consistently by programming language across five recent models on difficulty-controlled Python, Java, Rust, and OCaml problems. Explains why by re-executing every intermediate solution and abstracting each trajectory into test-outcome vectors: agents burn budget re-produ... | Keeps adoption grounded in known failure modes, economics, and operational limits. Shows coding-agent token cost varies starkly and consistently by programming language across five recent models on difficulty-controlled Python, Java, Rust, and OCaml problems. Explains why by re-executing every intermediate solution and... | Use The Best Programming Language for Tokenmaxxing: An Investigation of Coding Agent Behavior Across Programming Languages to bound risk before recurring or unattended execution. | Research source arXiv:2607.22807; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,574 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1574 | 2026-07-28 | Govern | govern | Bound permissions, cost, failure, and escalation. | verification;budget | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.22807 | [2607.22807] The Best Programming Language for Tokenmaxxing: An Investigation of Coding Agent Behavior Across Programming Languages | Although coding agents are now very effective in a variety of programming languages, this paper first shows that the cost (in tokens) can very significantly by programming language. We evaluate five recent models on programming problems in Python, Java, Rust, and OCaml. We carefully control for problem difficulty, and ... | Zixuan Wu; Carolyn Jane Anderson; Arjun Guha | 2026-07-24 | 2026 | arXiv | arXiv | cs.SE | arxiv-api | 2607.22807 | 2026-07-31T18:10:45 | ||||||||
ale-0822 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Where Is the Cost of Third-Party API Routers in Agentic Software Development? | https://arxiv.org/abs/2607.23624 | external | arxiv.org | Third-party LLM routers sit on the trusted path between a coding agent and its provider, able to inspect and modify every request and response, while nothing verifies that provider output matches the repository-level actions the agent ultimately executes -- so client-side permission mechanisms can silently stop working... | Third-party LLM routers sit on the trusted path between a coding agent and its provider, able to inspect and modify every request and response, while nothing verifies that provider output matches the repository-level actions the agent ultimately executes -- so client-side permission mechanisms can silently stop working... | Third-party LLM routers sit on the trusted path between a coding agent and its provider, able to inspect and modify every request and response, while nothing verifies that provider output matches the repository-level actions the agent ultimately executes -- so client-side permission mechanisms can silently stop working... | Keeps adoption grounded in known failure modes, economics, and operational limits. Third-party LLM routers sit on the trusted path between a coding agent and its provider, able to inspect and modify every request and response, while nothing verifies that provider output matches the repository-level actions the agent ul... | Use Where Is the Cost of Third-Party API Routers in Agentic Software Development? to bound risk before recurring or unattended execution. | Research source arXiv:2607.23624; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,575 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1575 | 2026-07-28 | Govern | govern | Bound permissions, cost, failure, and escalation. | workspace;verification;budget;exit | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.23624 | [2607.23624] Where Is the Cost of Third-Party API Routers in Agentic Software Development? | Third-party API routers have become a common layer that unifies access across increasingly diverse LLM providers. In coding-agent workflows, high-autonomy operation is widely adopted because it reduces interaction overhead. As a result, a third-party API router, which sits between the agent and the upstream provider, i... | Donghao Fu; Jingxin Li; Xue Jiang; Yihong Dong | 2026-07-26 | 2026 | arXiv | arXiv | cs.SE | arxiv-api | 2607.23624 | 2026-07-31T18:10:45 | ||||||||
ale-0823 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Efficiency Matters in Autonomous Research | https://arxiv.org/abs/2607.24647 | external | arxiv.org | Position paper arguing autonomous research systems are judged almost entirely on final outcome quality while search efficiency -- reaching that outcome on a small budget -- is an equally important and ignored dimension, and one that dominates as AR moves from cheap-verification domains like math and code into settings ... | Position paper arguing autonomous research systems are judged almost entirely on final outcome quality while search efficiency -- reaching that outcome on a small budget -- is an equally important and ignored dimension, and one that dominates as AR moves from cheap-verification domains like math and code into settings ... | Position paper arguing autonomous research systems are judged almost entirely on final outcome quality while search efficiency -- reaching that outcome on a small budget -- is an equally important and ignored dimension, and one that dominates as AR moves from cheap-verification domains like math and code into settings ... | Verification is promoted from a final check to a loop-control signal. Position paper arguing autonomous research systems are judged almost entirely on final outcome quality while search efficiency -- reaching that outcome on a small budget -- is an equally important and ignored dimension, and one that dominates as AR m... | Use Efficiency Matters in Autonomous Research to bound risk before recurring or unattended execution. | Research source arXiv:2607.24647; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,576 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1576 | 2026-07-28 | Govern | govern | Bound permissions, cost, failure, and escalation. | verification;budget | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.24647 | [2607.24647] Efficiency Matters in Autonomous Research | AI-driven autonomous research (AR) systems are becoming increasingly effective across a broad range of tasks. Their performance, however, is still evaluated primarily by the quality of the final outcome. In this paper, we argue that the efficiency of the solution-search process is an equally important but often overloo... | Haiqian Yang; Yuan Cao | 2026-07-27 | 2026 | arXiv | arXiv | cs.AI | arxiv-api | 2607.24647 | 2026-07-31T18:10:45 | ||||||||
ale-0824 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Reliability-Contagion Feasibility in LLM Multi-Agent Networks | https://arxiv.org/abs/2607.21912 | external | arxiv.org | Treats error propagation in multi-agent systems as an epidemic on the communication graph, with susceptible/exposed/infectious/corrected states and a derived early-invasion condition for heterogeneous topologies, then couples it to an analytic majority-vote benchmark where a clean-task reliability target imposes a mini... | Treats error propagation in multi-agent systems as an epidemic on the communication graph, with susceptible/exposed/infectious/corrected states and a derived early-invasion condition for heterogeneous topologies, then couples it to an analytic majority-vote benchmark where a clean-task reliability target imposes a mini... | Treats error propagation in multi-agent systems as an epidemic on the communication graph, with susceptible/exposed/infectious/corrected states and a derived early-invasion condition for heterogeneous topologies, then couples it to an analytic majority-vote benchmark where a clean-task reliability target imposes a mini... | Control flow is represented as an inspectable graph rather than an opaque prompt loop. Treats error propagation in multi-agent systems as an epidemic on the communication graph, with susceptible/exposed/infectious/corrected states and a derived early-invasion condition for heterogeneous topologies, then couples it to a... | Use Reliability-Contagion Feasibility in LLM Multi-Agent Networks to bound risk before recurring or unattended execution. | Research source arXiv:2607.21912; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,577 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1577 | 2026-07-28 | Govern | govern | Bound permissions, cost, failure, and escalation. | delegation;verification | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.21912 | [2607.21912] Reliability-Contagion Feasibility in LLM Multi-Agent Networks | Communication allows large language model agents to pool evidence, but it also creates paths along which an erroneous claim can spread. We formulate a correction-aware network model that tracks susceptible, exposed, infectious, and corrected agents and derive its early-invasion condition for heterogeneous communication... | Ruiwu Niu; Xincheng Shu; Ying Zhao | 2026-07-24 | 2026 | arXiv | arXiv | cs.MA | arxiv-api | 2607.21912 | 2026-07-31T18:10:45 | ||||||||
ale-0825 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Draining the Energy Commons: Self-Defeating Over-Appropriation as a Coordination Failure in Agentic LLM Collectives | https://arxiv.org/abs/2607.22188 | external | arxiv.org | When LLM agents share a persistent resource, one agent's decision changes the conditions later agents face. Four same-family GPT, Gemini, or Grok agents act as electricity prosumers instructed to maximize operational continuity, with aggregate demand and protocol held fixed while the regeneration rate varies. All three... | When LLM agents share a persistent resource, one agent's decision changes the conditions later agents face. Four same-family GPT, Gemini, or Grok agents act as electricity prosumers instructed to maximize operational continuity, with aggregate demand and protocol held fixed while the regeneration rate varies. All three... | When LLM agents share a persistent resource, one agent's decision changes the conditions later agents face. Four same-family GPT, Gemini, or Grok agents act as electricity prosumers instructed to maximize operational continuity, with aggregate demand and protocol held fixed while the regeneration rate varies. All three... | State persistence is explicit enough for repeated runs and handoff. When LLM agents share a persistent resource, one agent's decision changes the conditions later agents face. Four same-family GPT, Gemini, or Grok agents act as electricity prosumers instructed to maximize operational continuity, with aggregate demand a... | Use Draining the Energy Commons: Self-Defeating Over-Appropriation as a Coordination Failure in Agentic LLM Collectives to bound risk before recurring or unattended execution. | Research source arXiv:2607.22188; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,578 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1578 | 2026-07-28 | Govern | govern | Bound permissions, cost, failure, and escalation. | state;budget | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.22188 | [2607.22188] Draining the Energy Commons: Self-Defeating Over-Appropriation as a Coordination Failure in Agentic LLM Collectives | LLMs are increasingly deployed as agents that plan, use tools, and act over time. When they share persistent resources, such as compute pools or energy reserves, decisions by one agent affect the conditions faced by later agents. We study this coordination failure in a renewable energy commons. Four same-family GPT, Ge... | Marcantonio Bracale Syrnicov; Federico Pierucci; Matteo Prandi; Marcello Galisai; Piercosma Bisconti; Francesco Giarrusso; Daniele Nardi | 2026-07-24 | 2026 | arXiv | arXiv | cs.MA | arxiv-api | 2607.22188 | 2026-07-31T18:10:45 | ||||||||
ale-0826 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | "Go Home Copilot, You're Drunk": Understanding Developer Responses to Agent-Generated Code Review Comments | https://arxiv.org/abs/2607.21997 | external | arxiv.org | First large-scale empirical study of what happens after an agent posts a review comment: 54,791 comments from Copilot, Cursor, Codex, Devin, and Claude across 342 Python GitHub repositories, analyzed for resolution rates by agent and comment type, the effect of developer experience, and what makes a comment useful. Res... | First large-scale empirical study of what happens after an agent posts a review comment: 54,791 comments from Copilot, Cursor, Codex, Devin, and Claude across 342 Python GitHub repositories, analyzed for resolution rates by agent and comment type, the effect of developer experience, and what makes a comment useful. Res... | First large-scale empirical study of what happens after an agent posts a review comment: 54,791 comments from Copilot, Cursor, Codex, Devin, and Claude across 342 Python GitHub repositories, analyzed for resolution rates by agent and comment type, the effect of developer experience, and what makes a comment useful. Res... | Keeps adoption grounded in known failure modes, economics, and operational limits. First large-scale empirical study of what happens after an agent posts a review comment: 54,791 comments from Copilot, Cursor, Codex, Devin, and Claude across 342 Python GitHub repositories, analyzed for resolution rates by agent and com... | Use "Go Home Copilot, You're Drunk": Understanding Developer Responses to Agent-Generated Code Review Comments to bound risk before recurring or unattended execution. | Research source arXiv:2607.21997; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,579 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1579 | 2026-07-28 | Govern | govern | Bound permissions, cost, failure, and escalation. | escalation | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.21997 | [2607.21997] "Go Home Copilot, You're Drunk": Understanding Developer Responses to Agent-Generated Code Review Comments | Code review is a critical quality assurance practice in software engineering development, and AI coding agents are increasingly generating review comments on pull requests. However, little is known about how developers actually respond to such agent-generated feedback. In this paper, we present the first large-scale em... | Shamse Tasnim Cynthia; Ratnadira Widyasari; Banani Roy; Ting Zhang; David Lo | 2026-07-24 | 2026 | arXiv | arXiv | cs.SE | arxiv-api | 2607.21997 | 2026-07-31T18:10:45 | ||||||||
ale-0827 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Position: Evaluation Scores Are Perishable Knowledge Claims | https://arxiv.org/abs/2607.26191 | external | arxiv.org | Argues benchmark scores are epistemic claims with expiry dates and that averaging heterogeneous signals inflates confidence past the weakest component, proposing formality tiers, scope declarations, and expirations, HELM rankings shift materially under weakest-link aggregation. Sharp critique of how loop teams read eva... | Argues benchmark scores are epistemic claims with expiry dates and that averaging heterogeneous signals inflates confidence past the weakest component, proposing formality tiers, scope declarations, and expirations, HELM rankings shift materially under weakest-link aggregation. Sharp critique of how loop teams read eva... | Argues benchmark scores are epistemic claims with expiry dates and that averaging heterogeneous signals inflates confidence past the weakest component, proposing formality tiers, scope declarations, and expirations, HELM rankings shift materially under weakest-link aggregation. Sharp critique of how loop teams read eva... | Evaluation data is used as the feedback signal for improving loop behavior. Argues benchmark scores are epistemic claims with expiry dates and that averaging heterogeneous signals inflates confidence past the weakest component, proposing formality tiers, scope declarations, and expirations, HELM rankings shift material... | Use Position: Evaluation Scores Are Perishable Knowledge Claims to bound risk before recurring or unattended execution. | Research source arXiv:2607.26191; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,580 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1580 | 2026-07-30 | Govern | govern | Bound permissions, cost, failure, and escalation. | verification | researcher;evaluator;operator;security | cross-layer | enabling | research-paper | A | ok | https://doi.org/10.18653/v1/2026.gem-main.80 | [2607.26191] Position: Evaluation Scores Are Perishable Knowledge Claims | Evaluation methodologies for language models increasingly combine multiple signals, from automated metrics and LLM-as-judge ratings to human assessments and benchmark suite results. When these signals are aggregated via averaging, evaluation confidence can then substantially exceed the reliability of the weakest signal... | Sankalp Gilda; Shlok Gilda | 2026 | 2026 | Proceedings of the Fifth Workshop on Generation, Evaluation and Metrics (GEM) 2026 | Association for Computational Linguistics | 10.18653/v1/2026.gem-main.80 | Published in Proceedings of the Fifth Workshop on Generation, Evaluation and Metrics (GEM) 2026; the linked arXiv record remains available for open access. | cs.AI | Crossref API + DOI record | 2607.26191 | 2026-07-31T18:10:45 | ||||||
ale-0828 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | One Run Is Not an Idea: The Implementation Lottery in Automated Research | https://arxiv.org/abs/2607.26587 | external | arxiv.org | Shows automated research loops judge ideas on a single implementation, that implementation variance dwarfs rerun variance, and that winner reversal rates exceed 25%, then offers an Idea Reliability Audit. Directly undermines single-run selection in self-improving research agents. | Shows automated research loops judge ideas on a single implementation, that implementation variance dwarfs rerun variance, and that winner reversal rates exceed 25%, then offers an Idea Reliability Audit. Directly undermines single-run selection in self-improving research agents. | Shows automated research loops judge ideas on a single implementation, that implementation variance dwarfs rerun variance, and that winner reversal rates exceed 25%, then offers an Idea Reliability Audit. Directly undermines single-run selection in self-improving research agents. | Keeps adoption grounded in known failure modes, economics, and operational limits. Shows automated research loops judge ideas on a single implementation, that implementation variance dwarfs rerun variance, and that winner reversal rates exceed 25%, then offers an Idea Reliability Audit. Directly undermines single-run s... | Use One Run Is Not an Idea: The Implementation Lottery in Automated Research to bound risk before recurring or unattended execution. | Research source arXiv:2607.26587; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,581 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1581 | 2026-07-30 | Govern | govern | Bound permissions, cost, failure, and escalation. | budget;escalation;exit | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.26587 | [2607.26587] One Run Is Not an Idea: The Implementation Lottery in Automated Research | Automated research systems use experimental scores both to deliver artifacts and to decide which ideas to retain, transfer, and pursue. Yet one run scores one implementation of an idea. Crediting that realization-level score as evidence about the parent mechanism creates the \emph{implementation lottery}, in which an i... | Jingjie Ning; Shanshan Zhong; Xiaochuan Li; Ji Zeng; Chenyan Xiong | 2026-07-29 | 2026 | arXiv | arXiv | cs.MA | arxiv-api | 2607.26587 | 2026-07-31T18:10:45 | ||||||||
ale-0829 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Can AI agents conduct open-ended AI research? Early evidence from two case studies | https://arxiv.org/abs/2607.27191 | external | arxiv.org | Frontier agents ran six days of largely independent engineering on open research questions from unpublished NeurIPS 2026 papers, and the original authors unambiguously rejected both outputs, the gap was research judgment and creativity, not execution. A rigorous shadow-evaluation counterweight to autonomous-research op... | Frontier agents ran six days of largely independent engineering on open research questions from unpublished NeurIPS 2026 papers, and the original authors unambiguously rejected both outputs, the gap was research judgment and creativity, not execution. A rigorous shadow-evaluation counterweight to autonomous-research op... | Frontier agents ran six days of largely independent engineering on open research questions from unpublished NeurIPS 2026 papers, and the original authors unambiguously rejected both outputs, the gap was research judgment and creativity, not execution. A rigorous shadow-evaluation counterweight to autonomous-research op... | Evaluation data is used as the feedback signal for improving loop behavior. Frontier agents ran six days of largely independent engineering on open research questions from unpublished NeurIPS 2026 papers, and the original authors unambiguously rejected both outputs, the gap was research judgment and creativity, not exe... | Use Can AI agents conduct open-ended AI research? Early evidence from two case studies to bound risk before recurring or unattended execution. | Research source arXiv:2607.27191; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,582 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1582 | 2026-07-30 | Govern | govern | Bound permissions, cost, failure, and escalation. | verification | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.27191 | [2607.27191] Can AI agents conduct open-ended AI research? Early evidence from two case studies | Forecasts of explosive AI progress hinge on AI agents automating AI research. But evidence on whether agents can carry out open-ended AI research is thin. Current evaluations either test agents on narrow, verifiable tasks, which excludes open-ended research, or submit AI-generated papers to blind peer review, which is ... | Peter Kirgis; Sayash Kapoor; Andrew Schwartz; Stephan Rabanser; David Africa; Konstantinos Voudouris; Viet Nguyen; Toby Pilditch; Magda Dubois; Harry Coppock; Cozmin Ududec; Nitya Nadgir; Matilda Orona; Tilman Bayer; Derrick Chan-Sew; Yue Ling; Abhishek Shetty; Helen Toner; Gillian Hadfield; Seth Lazar; Steve Newman; S... | 2026-07-29 | 2026 | arXiv | arXiv | cs.AI | arxiv-api | 2607.27191 | 2026-07-31T18:10:45 | ||||||||
ale-0830 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Two Calls Beat Five Agents: Evaluating Multi-Agent Pipelines Against Self-Refinement for Local Language Models | https://arxiv.org/abs/2607.26922 | external | arxiv.org | On a 7B local model, two refinement iterations beat a five-agent architecture on math reasoning, with data formatting and task-specific tuning mattering more than topology. Practical argument against reaching for multi-agent structure before exhausting the simple loop. | On a 7B local model, two refinement iterations beat a five-agent architecture on math reasoning, with data formatting and task-specific tuning mattering more than topology. Practical argument against reaching for multi-agent structure before exhausting the simple loop. | On a 7B local model, two refinement iterations beat a five-agent architecture on math reasoning, with data formatting and task-specific tuning mattering more than topology. Practical argument against reaching for multi-agent structure before exhausting the simple loop. | The work separates roles across agents, verifiers, or orchestration layers. On a 7B local model, two refinement iterations beat a five-agent architecture on math reasoning, with data formatting and task-specific tuning mattering more than topology. Practical argument against reaching for multi-agent structure before ex... | Use Two Calls Beat Five Agents: Evaluating Multi-Agent Pipelines Against Self-Refinement for Local Language Models to bound risk before recurring or unattended execution. | Research source arXiv:2607.26922; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,583 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1583 | 2026-07-30 | Govern | govern | Bound permissions, cost, failure, and escalation. | delegation | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.26922 | [2607.26922] Two Calls Beat Five Agents: Evaluating Multi-Agent Pipelines Against Self-Refinement for Local Language Models | Multi-agent LLM pipeline systems break down the task among multiple roles for better reasoning, but are benchmarked mainly with large-scale commercial models. In this study, we investigate Parishad, a structured multi-agent system involving five roles, by deploying it on Qwen2.5-7B-Instruct, a local model, on two datas... | Ashish Prajapati; Om Mohite | 2026-07-29 | 2026 | arXiv | arXiv | cs.LG | arxiv-api | 2607.26922 | 2026-07-31T18:10:45 | ||||||||
ale-0831 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Try Again, Don't Look Back: Blind Resampling Outperforms Self-Repair in Small Code Models | https://arxiv.org/abs/2607.26117 | external | arxiv.org | Finds that resampling without showing the model its failed attempt beats self-repair, because conditioning on its own broken code anchors the model into reproducing near-identical flaws. A concrete case where the feedback in the feedback loop actively hurts. | Finds that resampling without showing the model its failed attempt beats self-repair, because conditioning on its own broken code anchors the model into reproducing near-identical flaws. A concrete case where the feedback in the feedback loop actively hurts. | Finds that resampling without showing the model its failed attempt beats self-repair, because conditioning on its own broken code anchors the model into reproducing near-identical flaws. A concrete case where the feedback in the feedback loop actively hurts. | Keeps adoption grounded in known failure modes, economics, and operational limits. Finds that resampling without showing the model its failed attempt beats self-repair, because conditioning on its own broken code anchors the model into reproducing near-identical flaws. A concrete case where the feedback in the feedback... | Use Try Again, Don't Look Back: Blind Resampling Outperforms Self-Repair in Small Code Models to bound risk before recurring or unattended execution. | Research source arXiv:2607.26117; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,584 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1584 | 2026-07-30 | Govern | govern | Bound permissions, cost, failure, and escalation. | budget;escalation;exit | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.26117 | [2607.26117] Try Again, Don't Look Back: Blind Resampling Outperforms Self-Repair in Small Code Models | Self-repair - returning a failed program to the model together with its test output and asking for a correction - is a standard component of code agents, and is almost always evaluated against a baseline that does not retry at all. We argue that this comparison confounds the value of the feedback with the value of the ... | Yuvraj Verma | 2026-07-28 | 2026 | arXiv | arXiv | Code, pre-registrations and run traces: https://github.com/vermayuvraj/self-improving-agent | cs.SE | arxiv-api | 2607.26117 | 2026-07-31T18:10:45 | |||||||
ale-0832 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Even More Deception: Objective Misalignment in Mixed-Motive LLM Multi-Agent Systems | https://arxiv.org/abs/2607.26120 | external | arxiv.org | In a Werewolf testbed, agents with hidden or conflicting objectives show detectable shifts in internal reasoning while public messages mask the change, degrading collective decisions. Evidence that monitoring inter-agent transcripts alone will not catch misaligned delegates. | In a Werewolf testbed, agents with hidden or conflicting objectives show detectable shifts in internal reasoning while public messages mask the change, degrading collective decisions. Evidence that monitoring inter-agent transcripts alone will not catch misaligned delegates. | In a Werewolf testbed, agents with hidden or conflicting objectives show detectable shifts in internal reasoning while public messages mask the change, degrading collective decisions. Evidence that monitoring inter-agent transcripts alone will not catch misaligned delegates. | The work separates roles across agents, verifiers, or orchestration layers. In a Werewolf testbed, agents with hidden or conflicting objectives show detectable shifts in internal reasoning while public messages mask the change, degrading collective decisions. Evidence that monitoring inter-agent transcripts alone will ... | Use Even More Deception: Objective Misalignment in Mixed-Motive LLM Multi-Agent Systems to bound risk before recurring or unattended execution. | Research source arXiv:2607.26120; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,585 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1585 | 2026-07-30 | Govern | govern | Bound permissions, cost, failure, and escalation. | objective;delegation | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.26120 | [2607.26120] Even More Deception: Objective Misalignment in Mixed-Motive LLM Multi-Agent Systems | Large Language Models (LLMs)-powered multi-agent systems are increasingly deployed in mixed-motive environments, where agents operate under asymmetric information and strategic deception due to conflicting or hidden objectives. In these settings, misalignment with collective goals becomes a central concern. We propose ... | Marylou Fauchard; Florian Carichon; Margarida Carvalho; Golnoosh Farnadi | 2026-07-28 | 2026 | arXiv | arXiv | Accepted at AIWILD@ICLR 2026 | cs.AI | arxiv-api | 2607.26120 | 2026-07-31T18:10:45 | |||||||
ale-0833 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | (Im)Paired Programming: Coding Agents Improve Productivity but Harm Understanding | https://arxiv.org/abs/2607.26375 | external | arxiv.org | Controlled study of 54 students comparing an agent-based system against a chatbot: agents raise completion speed but lower code comprehension and the ability to extend the work independently, with copy-paste prompting predicting the weakest understanding. Quantifies the comprehension debt that accrues inside sustained ... | Controlled study of 54 students comparing an agent-based system against a chatbot: agents raise completion speed but lower code comprehension and the ability to extend the work independently, with copy-paste prompting predicting the weakest understanding. Quantifies the comprehension debt that accrues inside sustained ... | Controlled study of 54 students comparing an agent-based system against a chatbot: agents raise completion speed but lower code comprehension and the ability to extend the work independently, with copy-paste prompting predicting the weakest understanding. Quantifies the comprehension debt that accrues inside sustained ... | Keeps adoption grounded in known failure modes, economics, and operational limits. Controlled study of 54 students comparing an agent-based system against a chatbot: agents raise completion speed but lower code comprehension and the ability to extend the work independently, with copy-paste prompting predicting the weak... | Use (Im)Paired Programming: Coding Agents Improve Productivity but Harm Understanding to bound risk before recurring or unattended execution. | Research source arXiv:2607.26375; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,586 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1586 | 2026-07-30 | Govern | govern | Bound permissions, cost, failure, and escalation. | exit | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.26375 | [2607.26375] (Im)Paired Programming: Coding Agents Improve Productivity but Harm Understanding | Coding agents (e.g., Cursor) improve developer productivity by optimizing task completion, but shifting users from writing code to prompting and reviewing may harm their understanding, impeding oversight, learning, and communication. To probe this, we have 54 students create a website with one of two AI systems: an age... | Nishant Balepur; Connor Baumler; Valerie Chen; Eunsol Choi; Rachel Rudinger; Jordan Lee Boyd-Graber | 2026-07-29 | 2026 | arXiv | arXiv | In-progress Preprint | cs.CL | arxiv-api | 2607.26375 | 2026-07-31T18:10:45 | |||||||
ale-0834 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Blog | 📝 | We Gave GPT-5.6 Sol a Real Business | https://www.bottlenecklabs.com/blog/autonomously-run-businesses | external | www.bottlenecklabs.com | Field report from handing a frontier model an actual operating business and letting it run unattended, recording where the loop held up and where it needed a human. Useful as evidence about long-horizon autonomy outside benchmark conditions. | Field report from handing a frontier model an actual operating business and letting it run unattended, recording where the loop held up and where it needed a human. Useful as evidence about long-horizon autonomy outside benchmark conditions. | Field report from handing a frontier model an actual operating business and letting it run unattended, recording where the loop held up and where it needed a human. Useful as evidence about long-horizon autonomy outside benchmark conditions. | The work turns loop quality into a measurable task or score. Field report from handing a frontier model an actual operating business and letting it run unattended, recording where the loop held up and where it needed a human. Useful as evidence about long-horizon autonomy outside benchmark conditions. | Use We Gave GPT-5.6 Sol a Real Business to bound risk before recurring or unattended execution. | Contextual source from www.bottlenecklabs.com; useful for practice signals or boundary conditions, not independent validation. | contextual | README.md | 1,587 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1587 | 2026-07-30 | Govern | govern | Bound permissions, cost, failure, and escalation. | verification;escalation | operator;security | cross-layer | enabling | practitioner-analysis | B | ok | https://www.bottlenecklabs.com/blog/autonomously-run-businesses | GPT 5.6 Sol Ran a Real Business | Bottleneck Labs | If an agent had a wallet, a computer, and 24 hours, could it run a profitable startup? | Bottleneck Labs | html-meta | 2026-07-31T18:10:45 | ||||||||||||||
ale-0835 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Blog | 📝 | GCC Steering Committee Announces AI Policy | https://lwn.net/Articles/1086041/ | external | lwn.net | LWN, 2026-07-29. The GCC steering committee will decline any legally significant contribution that includes or is derived from LLM-generated content, with 'legally significant' pegged at roughly 15 lines per GNU maintainer guidelines. LLMs remain permitted for research and analysis, bug discovery and reporting, and pat... | LWN, 2026-07-29. The GCC steering committee will decline any legally significant contribution that includes or is derived from LLM-generated content, with 'legally significant' pegged at roughly 15 lines per GNU maintainer guidelines. LLMs remain permitted for research and analysis, bug discovery and reporting, and pat... | LWN, 2026-07-29. The GCC steering committee will decline any legally significant contribution that includes or is derived from LLM-generated content, with 'legally significant' pegged at roughly 15 lines per GNU maintainer guidelines. LLMs remain permitted for research and analysis, bug discovery and reporting, and pat... | Keeps adoption grounded in known failure modes, economics, and operational limits. LWN, 2026-07-29. The GCC steering committee will decline any legally significant contribution that includes or is derived from LLM-generated content, with 'legally significant' pegged at roughly 15 lines per GNU maintainer guidelines. LL... | Use GCC Steering Committee Announces AI Policy to bound risk before recurring or unattended execution. | Contextual source from lwn.net; useful for practice signals or boundary conditions, not independent validation. | contextual | README.md | 1,588 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1588 | 2026-07-30 | Govern | govern | Bound permissions, cost, failure, and escalation. | intake;verification | operator;security | cross-layer | enabling | practitioner-analysis | B | ok | https://lwn.net/Articles/1086041/ | GCC steering committee announces AI policy [LWN.net] | The GCC steering committee has announced that it has accepted an AI contributions policy recomm [...] | LWN.net | html-meta | 2026-07-31T18:10:45 | ||||||||||||||
ale-0836 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Beyond the Leaderboard: A Synthesis of Tool-Use, Planning, and Reasoning Failures in Large Language Model Agents | https://arxiv.org/abs/2607.05775 | external | arxiv.org | OUT OF WINDOW (Jul 7, 2026), flagged; zero duplicate hits. A cross-cutting synthesis of 27 benchmark, taxonomy and audit papers from 2023-2026 spanning 19 distinct benchmarks, collapsed into six failure clusters: tool invocation and parameter-level errors, planning and constraint-satisfaction failures, long-horizon deg... | OUT OF WINDOW (Jul 7, 2026), flagged; zero duplicate hits. A cross-cutting synthesis of 27 benchmark, taxonomy and audit papers from 2023-2026 spanning 19 distinct benchmarks, collapsed into six failure clusters: tool invocation and parameter-level errors, planning and constraint-satisfaction failures, long-horizon deg... | OUT OF WINDOW (Jul 7, 2026), flagged; zero duplicate hits. A cross-cutting synthesis of 27 benchmark, taxonomy and audit papers from 2023-2026 spanning 19 distinct benchmarks, collapsed into six failure clusters: tool invocation and parameter-level errors, planning and constraint-satisfaction failures, long-horizon deg... | Evaluation data is used as the feedback signal for improving loop behavior. OUT OF WINDOW (Jul 7, 2026), flagged; zero duplicate hits. A cross-cutting synthesis of 27 benchmark, taxonomy and audit papers from 2023-2026 spanning 19 distinct benchmarks, collapsed into six failure clusters: tool invocation and parameter-l... | Use Beyond the Leaderboard: A Synthesis of Tool-Use, Planning, and Reasoning Failures in Large Language Model Agents to bound risk before recurring or unattended execution. | Research source arXiv:2607.05775; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,589 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1589 | 2026-07-30 | Govern | govern | Bound permissions, cost, failure, and escalation. | intake;workspace;context;delegation;verification;state | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.05775 | [2607.05775] Beyond the Leaderboard: A Synthesis of Tool-Use, Planning, and Reasoning Failures in Large Language Model Agents | Large language model (LLM) agents are increasingly evaluated on their ability to use tools, plan multi-step tasks, coordinate with other agents, and operate over extended horizons. Reported benchmark gains often obscure recurring failure modes documented across otherwise unrelated evaluation efforts. This paper synthes... | Wael Albayaydh; Rui Zhao; Ivan Flechais | 2026-07-07 | 2026 | arXiv | arXiv | 16 pages, 3 tables, 1 figure | cs.AI | arxiv-api | 2607.05775 | 2026-07-31T18:10:45 | |||||||
ale-0837 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Guardrails as Scapegoats: Auditing Unfaithful Safety Refusals in Tool-Augmented LLM Agents | https://arxiv.org/abs/2607.19449 | external | arxiv.org | NEAR WINDOW (Jul 23, 2026), flagged; zero duplicate hits. A black-box auditing framework for a failure mode that silently corrupts verification in unattended loops: an agent hits a silent infrastructure failure, a tool returning nothing, a timeout, a malformed response, and reports it to the user as a safety refusal ra... | NEAR WINDOW (Jul 23, 2026), flagged; zero duplicate hits. A black-box auditing framework for a failure mode that silently corrupts verification in unattended loops: an agent hits a silent infrastructure failure, a tool returning nothing, a timeout, a malformed response, and reports it to the user as a safety refusal ra... | NEAR WINDOW (Jul 23, 2026), flagged; zero duplicate hits. A black-box auditing framework for a failure mode that silently corrupts verification in unattended loops: an agent hits a silent infrastructure failure, a tool returning nothing, a timeout, a malformed response, and reports it to the user as a safety refusal ra... | Verification is promoted from a final check to a loop-control signal. NEAR WINDOW (Jul 23, 2026), flagged; zero duplicate hits. A black-box auditing framework for a failure mode that silently corrupts verification in unattended loops: an agent hits a silent infrastructure failure, a tool returning nothing, a timeout, a... | Use Guardrails as Scapegoats: Auditing Unfaithful Safety Refusals in Tool-Augmented LLM Agents to bound risk before recurring or unattended execution. | Research source arXiv:2607.19449; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,590 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1590 | 2026-07-30 | Govern | govern | Bound permissions, cost, failure, and escalation. | workspace;verification;state;budget | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2607.19449 | [2607.19449] Guardrails as Scapegoats: Auditing Unfaithful Safety Refusals in Tool-Augmented LLM Agents | Evaluation frameworks for tool-augmented LLM agents focus overwhelmingly on capability metrics or explicit tool crashes, leaving silent infrastructure failures and HTTP 200 responses with empty, null, or malformed payloads largely unaudited. We introduce a lightweight black-box auditing framework that injects four sile... | Aarushi Singh | 2026-07-21 | 2026 | arXiv | arXiv | 10 pages, 3 figures. Accepted at the ACM KDD 2026 Workshop on Evaluation and Trustworthiness of Agentic AI | cs.LG | arxiv-api | 2607.19449 | 2026-07-31T18:10:45 | |||||||
ale-0838 | Critiques, Risks, And Limitations | critiques-risks-and-limitations | Paper | 📄 | Towards a Science of AI Agent Reliability | https://arxiv.org/abs/2602.16666 | external | arxiv.org | OUT OF WINDOW (Feb 2026, revised Jun 2026), flagged; zero duplicate hits. The foundational negative result behind the reliability-versus-capability argument that several entries in this list gesture at without citing. Evaluating 15 models across two complementary benchmarks, the authors find that recent capability gain... | OUT OF WINDOW (Feb 2026, revised Jun 2026), flagged; zero duplicate hits. The foundational negative result behind the reliability-versus-capability argument that several entries in this list gesture at without citing. Evaluating 15 models across two complementary benchmarks, the authors find that recent capability gain... | OUT OF WINDOW (Feb 2026, revised Jun 2026), flagged; zero duplicate hits. The foundational negative result behind the reliability-versus-capability argument that several entries in this list gesture at without citing. Evaluating 15 models across two complementary benchmarks, the authors find that recent capability gain... | Verification is promoted from a final check to a loop-control signal. OUT OF WINDOW (Feb 2026, revised Jun 2026), flagged; zero duplicate hits. The foundational negative result behind the reliability-versus-capability argument that several entries in this list gesture at without citing. Evaluating 15 models across two ... | Use Towards a Science of AI Agent Reliability to bound risk before recurring or unattended execution. | Research source arXiv:2602.16666; inspect its method and evaluation before treating results as production evidence. | medium | README.md | 1,591 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1591 | 2026-07-30 | Govern | govern | Bound permissions, cost, failure, and escalation. | verification | researcher;evaluator;operator;security | cross-layer | enabling | research-preprint | A | ok | https://arxiv.org/abs/2602.16666 | [2602.16666] Towards a Science of AI Agent Reliability | AI agents are increasingly deployed to execute important tasks. While rising accuracy scores on standard benchmarks suggest rapid progress, many agents still continue to fail in practice. This discrepancy highlights a fundamental limitation of current evaluations: compressing agent behavior into a single success metric... | Stephan Rabanser; Sayash Kapoor; Peter Kirgis; Kangheng Liu; Saiteja Utpala; Arvind Narayanan | 2026-02-18 | 2026 | arXiv | arXiv | Accepted at ICML 2026. Interactive dashboard available at: https://hal.cs.princeton.edu/reliability | cs.AI | arxiv-api | 2602.16666 | 2026-07-31T18:10:45 | |||||||
ale-0839 | Adjacent Awesome Lists | adjacent-awesome-lists | List | 🧭 | Awesome Harness Engineering by ai-boost | https://github.com/ai-boost/awesome-harness-engineering | external | github.com | Comprehensive list for the agent harness layer that Loop Engineering builds on. | Comprehensive list for the agent harness layer that Loop Engineering builds on. | Comprehensive list for the agent harness layer that Loop Engineering builds on. | Connects neighboring ecosystems while preserving Loop Engineering as a narrower operating concept. Comprehensive list for the agent harness layer that Loop Engineering builds on. | Use Awesome Harness Engineering by ai-boost to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (3,338 stars; 375 forks; NOASSERTION license; updated 2026-07-31); popularity is context, not proof of reliability. | medium | README.md | 1,611 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1611 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | whole-loop | builder | cross-layer | adjacent | curated-index | C | ok | https://github.com/ai-boost/awesome-harness-engineering | GitHub - ai-boost/awesome-harness-engineering: Awesome list for AI agent harness engineering: tools, patterns, evals, memory, MCP, permissions, observability, and orchestration. · GitHub | Awesome list for AI agent harness engineering: tools, patterns, evals, memory, MCP, permissions, observability, and orchestration. - ai-boost/awesome-harness-engineering | 2026-03-29 | 2026 | ai-boost/awesome-harness-engineering | GitHub | github-api | ai-boost/awesome-harness-engineering | 3338 | 375 | NOASSERTION | 2026-03-29T15:39:49Z | 2026-07-31T14:40:52Z | 2026-07-31T18:10:45 | ||||||
ale-0840 | Adjacent Awesome Lists | adjacent-awesome-lists | List | 🧭 | Awesome Harness Engineering by walkinglabs | https://github.com/walkinglabs/awesome-harness-engineering | external | github.com | High-signal harness list with strong categories for context, guardrails, specs, evals, runtimes, and benchmarks. | High-signal harness list with strong categories for context, guardrails, specs, evals, runtimes, and benchmarks. | High-signal harness list with strong categories for context, guardrails, specs, evals, runtimes, and benchmarks. | Evaluation data is used as the feedback signal for improving loop behavior. High-signal harness list with strong categories for context, guardrails, specs, evals, runtimes, and benchmarks. | Use Awesome Harness Engineering by walkinglabs to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (3,725 stars; 306 forks; NOASSERTION license; updated 2026-07-31); popularity is context, not proof of reliability. | medium | README.md | 1,612 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1612 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | context;verification | builder | cross-layer | adjacent | curated-index | C | ok | https://github.com/walkinglabs/awesome-harness-engineering | GitHub - walkinglabs/awesome-harness-engineering: 🛠️ Awesome tools & guides for harness engineering. · GitHub | 🛠️ Awesome tools & guides for harness engineering. - walkinglabs/awesome-harness-engineering | 2026-03-29 | 2026 | walkinglabs/awesome-harness-engineering | GitHub | github-api | walkinglabs/awesome-harness-engineering | 3725 | 306 | NOASSERTION | 2026-03-29T11:29:37Z | 2026-07-31T18:06:39Z | 2026-07-31T18:10:45 | ||||||
ale-0841 | Adjacent Awesome Lists | adjacent-awesome-lists | List | 🧭 | Awesome Agent Harness | https://github.com/AutoJunjie/awesome-agent-harness | external | github.com | Curated tools and resources for environments, constraints, and feedback around coding agents. | Curated tools and resources for environments, constraints, and feedback around coding agents. | Curated tools and resources for environments, constraints, and feedback around coding agents. | Connects neighboring ecosystems while preserving Loop Engineering as a narrower operating concept. Curated tools and resources for environments, constraints, and feedback around coding agents. | Use Awesome Agent Harness to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (501 stars; 52 forks; updated 2026-07-30); popularity is context, not proof of reliability. | medium | README.md | 1,613 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1613 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | workspace | builder | cross-layer | adjacent | curated-index | C | ok | https://github.com/AutoJunjie/awesome-agent-harness | GitHub - AutoJunjie/awesome-agent-harness · GitHub | Contribute to AutoJunjie/awesome-agent-harness development by creating an account on GitHub. | 2026-03-05 | 2026 | AutoJunjie/awesome-agent-harness | GitHub | github-api | AutoJunjie/awesome-agent-harness | 501 | 52 | 2026-03-05T13:19:10Z | 2026-07-30T03:17:33Z | 2026-07-31T18:10:45 | |||||||
ale-0842 | Adjacent Awesome Lists | adjacent-awesome-lists | List | 🧭 | Awesome Context Engineering | https://github.com/Meirtz/Awesome-Context-Engineering | external | github.com | Survey-style list for context engineering across LLMs and agents. | Survey-style list for context engineering across LLMs and agents. | Survey-style list for context engineering across LLMs and agents. | Context is managed as durable loop state rather than a single prompt payload. Survey-style list for context engineering across LLMs and agents. | Use Awesome Context Engineering to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (3,260 stars; 266 forks; MIT license; updated 2026-07-31); popularity is context, not proof of reliability. | medium | README.md | 1,614 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1614 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | context | builder | cross-layer | adjacent | curated-index | C | ok | https://github.com/Meirtz/Awesome-Context-Engineering | GitHub - Meirtz/Awesome-Context-Engineering: 🔥 Comprehensive survey on Context Engineering: from prompt engineering to production-grade AI systems. hundreds of papers, frameworks, and implementation guides for LLMs and AI agents. · GitHub | 🔥 Comprehensive survey on Context Engineering: from prompt engineering to production-grade AI systems. hundreds of papers, frameworks, and implementation guides for LLMs and AI agents. - Meirtz/Awesome-Context-Engineering | 2025-07-02 | 2025 | Meirtz/Awesome-Context-Engineering | GitHub | github-api | Meirtz/Awesome-Context-Engineering | 3260 | 266 | MIT | 2025-07-02T17:46:03Z | 2026-07-31T05:30:17Z | 2026-07-31T18:10:45 | ||||||
ale-0843 | Adjacent Awesome Lists | adjacent-awesome-lists | List | 🧭 | Awesome Prompt Engineering | https://github.com/promptslab/Awesome-Prompt-Engineering | external | github.com | Classic adjacent list for prompt techniques and prompting resources. | Classic adjacent list for prompt techniques and prompting resources. | Classic adjacent list for prompt techniques and prompting resources. | Connects neighboring ecosystems while preserving Loop Engineering as a narrower operating concept. Classic adjacent list for prompt techniques and prompting resources. | Use Awesome Prompt Engineering to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (6,212 stars; 738 forks; Apache-2.0 license; updated 2026-07-31); popularity is context, not proof of reliability. | medium | README.md | 1,615 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1615 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | whole-loop | builder | cross-layer | adjacent | curated-index | C | ok | https://github.com/promptslab/Awesome-Prompt-Engineering | GitHub - promptslab/Awesome-Prompt-Engineering: This repository contains a hand-curated resources for Prompt Engineering with a focus on Generative Pre-trained Transformer (GPT), ChatGPT, PaLM etc · GitHub | This repository contains a hand-curated resources for Prompt Engineering with a focus on Generative Pre-trained Transformer (GPT), ChatGPT, PaLM etc - GitHub - promptslab/Awesome-Prompt-Engineering: This repository contains a hand-curated resources for Prompt Engineering with a focus on Generative Pre-trained Transform... | 2023-02-09 | 2023 | promptslab/Awesome-Prompt-Engineering | GitHub | github-api | promptslab/Awesome-Prompt-Engineering | 6212 | 738 | Apache-2.0 | 2023-02-09T18:22:52Z | 2026-07-31T13:52:14Z | 2026-07-31T18:10:45 | ||||||
ale-0844 | Adjacent Awesome Lists | adjacent-awesome-lists | List | 🧭 | Awesome LLM Agents | https://github.com/kaushikb11/awesome-llm-agents | external | github.com | General list of LLM agent papers, frameworks, and applications. | General list of LLM agent papers, frameworks, and applications. | General list of LLM agent papers, frameworks, and applications. | Connects neighboring ecosystems while preserving Loop Engineering as a narrower operating concept. General list of LLM agent papers, frameworks, and applications. | Use Awesome LLM Agents to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (1,547 stars; 332 forks; updated 2026-07-31); popularity is context, not proof of reliability. | medium | README.md | 1,616 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1616 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | whole-loop | builder | cross-layer | adjacent | curated-index | C | ok | https://github.com/kaushikb11/awesome-llm-agents | GitHub - kaushikb11/awesome-llm-agents: A curated list of awesome LLM agents frameworks. · GitHub | A curated list of awesome LLM agents frameworks. Contribute to kaushikb11/awesome-llm-agents development by creating an account on GitHub. | 2023-04-04 | 2023 | kaushikb11/awesome-llm-agents | GitHub | github-api | kaushikb11/awesome-llm-agents | 1547 | 332 | 2023-04-04T10:22:43Z | 2026-07-31T00:53:53Z | 2026-07-31T18:10:45 | |||||||
ale-0845 | Adjacent Awesome Lists | adjacent-awesome-lists | List | 🧭 | Awesome AI Agents | https://github.com/e2b-dev/awesome-ai-agents | external | github.com | Broad AI agent ecosystem map. | Broad AI agent ecosystem map. | Broad AI agent ecosystem map. | Connects neighboring ecosystems while preserving Loop Engineering as a narrower operating concept. Broad AI agent ecosystem map. | Use Awesome AI Agents to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (29,200 stars; 3,256 forks; NOASSERTION license; updated 2026-07-31); popularity is context, not proof of reliability. | medium | README.md | 1,617 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1617 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | whole-loop | builder | cross-layer | adjacent | curated-index | C | ok | https://github.com/e2b-dev/awesome-ai-agents | GitHub - e2b-dev/awesome-ai-agents: A list of AI autonomous agents · GitHub | A list of AI autonomous agents. Contribute to e2b-dev/awesome-ai-agents development by creating an account on GitHub. | 2023-06-19 | 2023 | e2b-dev/awesome-ai-agents | GitHub | github-api | e2b-dev/awesome-ai-agents | 29200 | 3256 | NOASSERTION | 2023-06-19T00:20:06Z | 2026-07-31T16:40:32Z | 2026-07-31T18:10:45 | ||||||
ale-0846 | Adjacent Awesome Lists | adjacent-awesome-lists | List | 🧭 | Awesome CLI Coding Agents | https://github.com/bradAGI/awesome-cli-coding-agents | external | github.com | Directory of terminal-native coding agents, parallel runners, autonomous loops, and the harnesses that orchestrate them. | Directory of terminal-native coding agents, parallel runners, autonomous loops, and the harnesses that orchestrate them. | Directory of terminal-native coding agents, parallel runners, autonomous loops, and the harnesses that orchestrate them. | Orchestration and control flow are made explicit and inspectable. Directory of terminal-native coding agents, parallel runners, autonomous loops, and the harnesses that orchestrate them. | Use Awesome CLI Coding Agents to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (910 stars; 245 forks; updated 2026-07-31); popularity is context, not proof of reliability. | medium | README.md | 1,618 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1618 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | delegation | builder | cross-layer | adjacent | curated-index | C | ok | https://github.com/bradAGI/awesome-cli-coding-agents | GitHub - bradAGI/awesome-cli-coding-agents: Curated directory of terminal-native AI coding agents and the harnesses that orchestrate them. Covers open-source tools (Pi, OpenCode, Aider, Goose), platform agents (Claude Code, Codex, Gemini CLI), parallel runners, autonomous loops, and agent infrastructure. · GitHub | Curated directory of terminal-native AI coding agents and the harnesses that orchestrate them. Covers open-source tools (Pi, OpenCode, Aider, Goose), platform agents (Claude Code, Codex, Gemini CLI), parallel runners, autonomous loops, and agent infrastructure. - GitHub - bradAGI/awesome-cli-coding-agents: Curated dire... | 2026-02-07 | 2026 | bradAGI/awesome-cli-coding-agents | GitHub | github-api | bradAGI/awesome-cli-coding-agents | 910 | 245 | 2026-02-07T00:53:24Z | 2026-07-31T16:55:16Z | 2026-07-31T18:10:45 | |||||||
ale-0847 | Adjacent Awesome Lists | adjacent-awesome-lists | List | 🧭 | Awesome Self-Evolving Agents | https://github.com/XMUDeepLIT/Awesome-Self-Evolving-Agents | external | github.com | Survey-style list of agents that improve themselves over repeated runs, an adjacent angle on long-running loops with memory and verification. | Survey-style list of agents that improve themselves over repeated runs, an adjacent angle on long-running loops with memory and verification. | Survey-style list of agents that improve themselves over repeated runs, an adjacent angle on long-running loops with memory and verification. | Verification is promoted from a final check to a loop-control signal. Survey-style list of agents that improve themselves over repeated runs, an adjacent angle on long-running loops with memory and verification. | Use Awesome Self-Evolving Agents to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (363 stars; 21 forks; updated 2026-07-31); popularity is context, not proof of reliability. | medium | README.md | 1,619 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1619 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | context;verification | builder | cross-layer | adjacent | curated-index | C | ok | https://github.com/XMUDeepLIT/Awesome-Self-Evolving-Agents | GitHub - XMUDeepLIT/Awesome-Self-Evolving-Agents: A Survey of Self-Evolving Agents | A curated list of resources (surveys, papers, benchmarks, and opensource projects) on Self-Evolving Agents. · GitHub | A Survey of Self-Evolving Agents | A curated list of resources (surveys, papers, benchmarks, and opensource projects) on Self-Evolving Agents. - XMUDeepLIT/Awesome-Self-Evolving-Agents | 2026-02-09 | 2026 | XMUDeepLIT/Awesome-Self-Evolving-Agents | GitHub | github-api | XMUDeepLIT/Awesome-Self-Evolving-Agents | 363 | 21 | 2026-02-09T10:57:30Z | 2026-07-31T14:39:42Z | 2026-07-31T18:10:45 | |||||||
ale-0848 | Adjacent Awesome Lists | adjacent-awesome-lists | List | 🧭 | Awesome AI Agent Papers | https://github.com/VoltAgent/awesome-ai-agent-papers | external | github.com | Curated 2026 research collection across agent engineering, memory, evaluation, workflows, and autonomous systems, a paper-level feeder for loop-design foundations. | Curated 2026 research collection across agent engineering, memory, evaluation, workflows, and autonomous systems, a paper-level feeder for loop-design foundations. | Curated 2026 research collection across agent engineering, memory, evaluation, workflows, and autonomous systems, a paper-level feeder for loop-design foundations. | Evaluation data is used as the feedback signal for improving loop behavior. Curated 2026 research collection across agent engineering, memory, evaluation, workflows, and autonomous systems, a paper-level feeder for loop-design foundations. | Use Awesome AI Agent Papers to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (1,639 stars; 169 forks; MIT license; updated 2026-07-31); popularity is context, not proof of reliability. | medium | README.md | 1,620 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1620 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | context;verification | builder | cross-layer | adjacent | curated-index | C | ok | https://github.com/VoltAgent/awesome-ai-agent-papers | GitHub - VoltAgent/awesome-ai-agent-papers: A curated collection of AI agent research papers released in 2026, covering agent engineering, memory, evaluation, workflows, and autonomous systems. · GitHub | A curated collection of AI agent research papers released in 2026, covering agent engineering, memory, evaluation, workflows, and autonomous systems. - VoltAgent/awesome-ai-agent-papers | 2026-02-10 | 2026 | VoltAgent/awesome-ai-agent-papers | GitHub | github-api | VoltAgent/awesome-ai-agent-papers | 1639 | 169 | MIT | 2026-02-10T10:58:31Z | 2026-07-31T12:50:04Z | 2026-07-31T18:10:45 | ||||||
ale-0849 | Adjacent Awesome Lists | adjacent-awesome-lists | List | 🧭 | awesome-ralph | https://github.com/snwfdhmp/awesome-ralph | external | github.com | Curated directory for the Ralph technique, collecting official resources, implementations, playbooks, tutorials, and community channels for running coding agents in automated loops until specifications are fulfilled. | Curated directory for the Ralph technique, collecting official resources, implementations, playbooks, tutorials, and community channels for running coding agents in automated loops until specifications are fulfilled. | Curated directory for the Ralph technique, collecting official resources, implementations, playbooks, tutorials, and community channels for running coding agents in automated loops until specifications are fulfilled. | Primary-source operational guidance rather than commentary. Curated directory for the Ralph technique, collecting official resources, implementations, playbooks, tutorials, and community channels for running coding agents in automated loops until specifications are fulfilled. | Use awesome-ralph to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (917 stars; 72 forks; updated 2026-07-23); popularity is context, not proof of reliability. | medium | README.md | 1,621 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1621 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | whole-loop | builder | cross-layer | adjacent | curated-index | C | ok | https://github.com/snwfdhmp/awesome-ralph | GitHub - snwfdhmp/awesome-ralph: A curated list of resources about Ralph, the AI coding technique that runs AI coding agents in automated loops until specifications are fulfilled. · GitHub | A curated list of resources about Ralph, the AI coding technique that runs AI coding agents in automated loops until specifications are fulfilled. - snwfdhmp/awesome-ralph | 2026-01-19 | 2026 | snwfdhmp/awesome-ralph | GitHub | github-api | snwfdhmp/awesome-ralph | 917 | 72 | 2026-01-19T08:42:54Z | 2026-07-23T20:46:09Z | 2026-07-31T18:10:45 | |||||||
ale-0850 | Adjacent Awesome Lists | adjacent-awesome-lists | List | 🧭 | Awesome Agent Loops | https://github.com/serenakeyitan/awesome-agent-loops | external | github.com | Curated collection of /loop, /goal, and /schedule commands for Claude Code and Codex sourced from practitioner posts, organized around trigger, condition, and skill structure. | Curated collection of /loop, /goal, and /schedule commands for Claude Code and Codex sourced from practitioner posts, organized around trigger, condition, and skill structure. | Curated collection of /loop, /goal, and /schedule commands for Claude Code and Codex sourced from practitioner posts, organized around trigger, condition, and skill structure. | The trigger or cadence is explicit, making the workflow recurring rather than one-off. Curated collection of /loop, /goal, and /schedule commands for Claude Code and Codex sourced from practitioner posts, organized around trigger, condition, and skill structure. | Use Awesome Agent Loops to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (198 stars; 16 forks; CC-BY-4.0 license; updated 2026-07-31); popularity is context, not proof of reliability. | medium | README.md | 1,622 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1622 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | objective;trigger | builder | cross-layer | adjacent | curated-index | C | ok | https://github.com/serenakeyitan/awesome-agent-loops | GitHub - serenakeyitan/awesome-agent-loops: A curated collection of the best /loop, /goal, and /schedule uses for Claude Code & Codex — real commands sourced from Twitter/X. The awesome-list of agent loops. · GitHub | A curated collection of the best /loop, /goal, and /schedule uses for Claude Code & Codex — real commands sourced from Twitter/X. The awesome-list of agent loops. - serenakeyitan/awesome-agent-loops | 2026-06-09 | 2026 | serenakeyitan/awesome-agent-loops | GitHub | github-api | serenakeyitan/awesome-agent-loops | 198 | 16 | CC-BY-4.0 | 2026-06-09T01:26:51Z | 2026-07-31T05:04:30Z | 2026-07-31T18:10:45 | ||||||
ale-0851 | Adjacent Awesome Lists | adjacent-awesome-lists | List | 🧭 | Awesome Loop Models | https://github.com/huskydoge/Awesome-Loop-Models | external | github.com | Dedicated catalog of architectures that reuse a learned layer, block, module, or operator within one forward process; use it for deeper model-level coverage while this repository focuses on the bridge to operational agent loops. | Dedicated catalog of architectures that reuse a learned layer, block, module, or operator within one forward process; use it for deeper model-level coverage while this repository focuses on the bridge to operational agent loops. | Dedicated catalog of architectures that reuse a learned layer, block, module, or operator within one forward process; use it for deeper model-level coverage while this repository focuses on the bridge to operational agent loops. | Connects neighboring ecosystems while preserving Loop Engineering as a narrower operating concept. Dedicated catalog of architectures that reuse a learned layer, block, module, or operator within one forward process; use it for deeper model-level coverage while this repository focuses on the bridge to operational agent... | Use Awesome Loop Models to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (237 stars; 7 forks; MIT license; updated 2026-07-30); popularity is context, not proof of reliability. | medium | README.md | 1,623 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1623 | 2026-07-18 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | whole-loop | builder | model | adjacent | curated-index | C | ok | https://github.com/huskydoge/Awesome-Loop-Models | GitHub - huskydoge/Awesome-Loop-Models: A curated list of papers and selected technical blogs on Loop Models. · GitHub | A curated list of papers and selected technical blogs on Loop Models. - huskydoge/Awesome-Loop-Models | 2026-04-24 | 2026 | huskydoge/Awesome-Loop-Models | GitHub | github-api | huskydoge/Awesome-Loop-Models | 237 | 7 | MIT | 2026-04-24T12:16:55Z | 2026-07-30T17:25:32Z | 2026-07-31T18:10:45 | |||||
ale-0852 | Adjacent Awesome Lists | adjacent-awesome-lists | List | 🧭 | harness-engineering (Ryan Lopopolo) | https://github.com/lopopolo/harness-engineering | external | github.com | Ryan Lopopolo's anthology, field guide, and agent context bundle for harness engineering, collecting primary sources on the layer directly beneath loop engineering. | Ryan Lopopolo's anthology, field guide, and agent context bundle for harness engineering, collecting primary sources on the layer directly beneath loop engineering. | Ryan Lopopolo's anthology, field guide, and agent context bundle for harness engineering, collecting primary sources on the layer directly beneath loop engineering. | Context is managed as durable loop state rather than a single prompt payload. Ryan Lopopolo's anthology, field guide, and agent context bundle for harness engineering, collecting primary sources on the layer directly beneath loop engineering. | Use harness-engineering (Ryan Lopopolo) to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (2,414 stars; 246 forks; CC-BY-4.0 license; updated 2026-07-31); popularity is context, not proof of reliability. | medium | README.md | 1,624 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1624 | 2026-07-22 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | context | builder | cross-layer | adjacent | curated-index | C | ok | https://github.com/lopopolo/harness-engineering | GitHub - lopopolo/harness-engineering: 🐎 Ryan Lopopolo’s anthology, field guide, and agent context bundle for harness engineering · GitHub | 🐎 Ryan Lopopolo’s anthology, field guide, and agent context bundle for harness engineering - lopopolo/harness-engineering | 2026-07-18 | 2026 | lopopolo/harness-engineering | GitHub | github-api | lopopolo/harness-engineering | 2414 | 246 | CC-BY-4.0 | 2026-07-18T21:42:28Z | 2026-07-31T16:23:03Z | 2026-07-31T18:10:45 | |||||
ale-0853 | Adjacent Awesome Lists | adjacent-awesome-lists | List | 🧭 | A Coding-Agent Reading List: Behind the Loops | https://insights.ml4trading.io/p/a-coding-agent-reading-list-behind | external | insights.ml4trading.io | Stefan Jansen's curated reading path of 60+ resources on coding-agent loops, organized to separate practitioner discourse, control-theory foundations, agent primitives, harness papers, adoption studies, and safety work by evidence type. | Stefan Jansen's curated reading path of 60+ resources on coding-agent loops, organized to separate practitioner discourse, control-theory foundations, agent primitives, harness papers, adoption studies, and safety work by evidence type. | Stefan Jansen's curated reading path of 60+ resources on coding-agent loops, organized to separate practitioner discourse, control-theory foundations, agent primitives, harness papers, adoption studies, and safety work by evidence type. | Connects neighboring ecosystems while preserving Loop Engineering as a narrower operating concept. Stefan Jansen's curated reading path of 60+ resources on coding-agent loops, organized to separate practitioner discourse, control-theory foundations, agent primitives, harness papers, adoption studies, and safety work by... | Use A Coding-Agent Reading List: Behind the Loops to reuse a concrete artifact or connect it to the wider ecosystem. | Contextual source from insights.ml4trading.io; useful for practice signals or boundary conditions, not independent validation. | contextual | README.md | 1,625 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1625 | 2026-07-23 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | whole-loop | builder | cross-layer | adjacent | curated-index | C | ok | https://insights.ml4trading.io/p/a-coding-agent-reading-list-behind | A Coding-Agent Reading List: Behind the Loops | Loop engineering is only the surface. A reading path through the older control problems underneath — and the line between what a coding agent may change and the experimental decisions that determine whether a result is valid. | Stefan Jansen | insights.ml4trading.io | html-meta | 2026-07-31T18:10:45 | |||||||||||||
ale-0854 | Explore And Reuse | explore-and-reuse | Template | 🧾 | Resource Atlas | https://chaoyue0307.github.io/awesome-loop-engineering/ | external | chaoyue0307.github.io | Filter 863 resources by goal, loop layer, lifecycle stage, artifact type, evidence class, and search query. | Filter 863 resources by goal, loop layer, lifecycle stage, artifact type, evidence class, and search query. | Filter 863 resources by goal, loop layer, lifecycle stage, artifact type, evidence class, and search query. | Turns the evidence into an interactive atlas and structured data. Filter 863 resources by goal, loop layer, lifecycle stage, artifact type, evidence class, and search query. | Use Resource Atlas to reuse a concrete artifact or connect it to the wider ecosystem. | Reusable template, schema, checklist, or guide; signal comes from concrete adaptation and validation. | medium | README.md | 1,633 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1633 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | objective | builder | cross-layer | enabling | reusable-artifact | A | ok | https://chaoyue0307.github.io/awesome-loop-engineering/ | Awesome Loop Engineering | Explore 797 resources from model recurrence to governed agent operations, then build with 22 patterns, 22 contracts, and 8 runtime starters. | Chaoyue He | chaoyue0307.github.io | html-meta | 2026-07-31T18:10:45 | ||||||||||||||
ale-0855 | Explore And Reuse | explore-and-reuse | List | 🧭 | Hugging Face dataset | https://huggingface.co/datasets/cy0307/awesome-loop-engineering | external | huggingface.co | Query the full collection as generated CSV and JSONL tables with publication, evidence, and lifecycle fields. | Query the full collection as generated CSV and JSONL tables with publication, evidence, and lifecycle fields. | Query the full collection as generated CSV and JSONL tables with publication, evidence, and lifecycle fields. | Packages the evidence as queryable CSV and JSONL rather than only a rendered page. Query the full collection as generated CSV and JSONL tables with publication, evidence, and lifecycle fields. | Use Hugging Face dataset to reuse a concrete artifact or connect it to the wider ecosystem. | Contextual source from huggingface.co; useful for practice signals or boundary conditions, not independent validation. | contextual | README.md | 1,634 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1634 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | whole-loop | builder | cross-layer | enabling | curated-index | C | ok | https://huggingface.co/datasets/cy0307/awesome-loop-engineering | cy0307/awesome-loop-engineering · Datasets at Hugging Face | We’re on a journey to advance and democratize artificial intelligence through open source and open science. | Hugging Face | domain-fallback | 2026-07-31T18:10:45 | |||||||||||||||
ale-0856 | Explore And Reuse | explore-and-reuse | Template | 🧾 | Dataset export guide | data/README.md | local_path | Load, query, regenerate, and audit the CSV, JSONL, and Resource Atlas data. | Load, query, regenerate, and audit the CSV, JSONL, and Resource Atlas data. | Load, query, regenerate, and audit the CSV, JSONL, and Resource Atlas data. | Packages the evidence as queryable CSV and JSONL rather than only a rendered page. Load, query, regenerate, and audit the CSV, JSONL, and Resource Atlas data. | Use Dataset export guide to reuse a concrete artifact or connect it to the wider ecosystem. | Repository file; inspect the linked schema, example, guide, or implementation. | medium | README.md | 1,635 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1635 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | whole-loop | builder | cross-layer | enabling | repository-native | A | local_ok | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/data/README.md | Dataset export guide | 2026 | GitHub | GitHub | repository | 2026-07-31T18:10:45 | |||||||||||||||
ale-0857 | Explore And Reuse | explore-and-reuse | Template | 🧾 | Runtime selection guide | meta/RUNTIME_SELECTION.md | local_path | Compare session, scheduled, CI, cron, and durable runtimes by persistence, isolation, permissions, and state. | Compare session, scheduled, CI, cron, and durable runtimes by persistence, isolation, permissions, and state. | Compare session, scheduled, CI, cron, and durable runtimes by persistence, isolation, permissions, and state. | Durable execution and replay are treated as first-class loop infrastructure. Compare session, scheduled, CI, cron, and durable runtimes by persistence, isolation, permissions, and state. | Use Runtime selection guide to reuse a concrete artifact or connect it to the wider ecosystem. | Repository file; inspect the linked schema, example, guide, or implementation. | medium | README.md | 1,636 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1636 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | trigger;workspace;state | builder | cross-layer | enabling | repository-native | A | local_ok | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/meta/RUNTIME_SELECTION.md | Runtime selection guide | 2026 | GitHub | GitHub | repository | 2026-07-31T18:10:45 | |||||||||||||||
ale-0858 | Explore And Reuse | explore-and-reuse | Template | 🧾 | Future Directions agenda | FUTURE-DIRECTIONS.md | local_path | Turn 15 open problems into measurable studies, runtime projects, product pilots, and shared standards. | Turn 15 open problems into measurable studies, runtime projects, product pilots, and shared standards. | Turn 15 open problems into measurable studies, runtime projects, product pilots, and shared standards. | Turns open gaps into measurable research, infrastructure, and product directions. Turn 15 open problems into measurable studies, runtime projects, product pilots, and shared standards. | Use Future Directions agenda to reuse a concrete artifact or connect it to the wider ecosystem. | Repository file; inspect the linked schema, example, guide, or implementation. | medium | README.md | 1,637 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1637 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | whole-loop | builder | cross-layer | enabling | repository-native | A | local_ok | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/FUTURE-DIRECTIONS.md | Future Directions agenda | 2026 | GitHub | GitHub | repository | 2026-07-31T18:10:45 | |||||||||||||||
ale-0859 | Shape What Comes Next | shape-what-comes-next | Template | 🧾 | Release notes | https://github.com/ChaoYue0307/awesome-loop-engineering/releases | external | github.com | Versioned changelog of new resources, patterns, and repository changes. | Versioned changelog of new resources, patterns, and repository changes. | Versioned changelog of new resources, patterns, and repository changes. | Turns open questions and operating lessons into visible next work. Versioned changelog of new resources, patterns, and repository changes. | Use Release notes to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (43 stars; 8 forks; CC0-1.0 license; updated 2026-07-30); popularity is context, not proof of reliability. | medium | README.md | 1,652 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1652 | 2026-07-15 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | whole-loop | builder | cross-layer | enabling | reusable-artifact | A | ok | https://github.com/ChaoYue0307/awesome-loop-engineering/releases | Releases · ChaoYue0307/awesome-loop-engineering · GitHub | 🔁 Build reliable recurring AI-agent systems: 797 resources, 22 operational patterns, 22 loop contracts, 8 runtime starters, an interactive atlas, and a structured dataset. - Releases · ChaoYue0307/awesome-loop-engineering | 2026-06-09 | 2026 | GitHub Releases | GitHub | github-api | ChaoYue0307/awesome-loop-engineering | 43 | 8 | CC0-1.0 | 2026-06-09T16:17:27Z | 2026-07-30T05:26:08Z | 2026-07-31T18:10:45 | |||||
ale-0860 | Shape What Comes Next | shape-what-comes-next | Template | 🧾 | Roadmap | ROADMAP.md | local_path | Near-term work, pattern priorities, gallery goals, and open questions. | Near-term work, pattern priorities, gallery goals, and open questions. | Near-term work, pattern priorities, gallery goals, and open questions. | Turns open questions and operating lessons into visible next work. Near-term work, pattern priorities, gallery goals, and open questions. | Use Roadmap to reuse a concrete artifact or connect it to the wider ecosystem. | Repository file; inspect the linked schema, example, guide, or implementation. | medium | README.md | 1,653 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1653 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | objective | builder | cross-layer | enabling | repository-native | A | local_ok | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/ROADMAP.md | Roadmap | 2026 | GitHub | GitHub | repository | 2026-07-31T18:10:45 | |||||||||||||||
ale-0861 | Shape What Comes Next | shape-what-comes-next | Template | 🧾 | Launch article | posts/launch.md | local_path | Concise explanation of the concept, implementation kit, and evidence base. | Concise explanation of the concept, implementation kit, and evidence base. | Concise explanation of the concept, implementation kit, and evidence base. | Turns open questions and operating lessons into visible next work. Concise explanation of the concept, implementation kit, and evidence base. | Use Launch article to reuse a concrete artifact or connect it to the wider ecosystem. | Repository file; inspect the linked schema, example, guide, or implementation. | medium | README.md | 1,654 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1654 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | whole-loop | builder | cross-layer | enabling | repository-native | A | local_ok | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/posts/launch.md | Launch article | 2026 | GitHub | GitHub | repository | 2026-07-31T18:10:45 | |||||||||||||||
ale-0862 | Shape What Comes Next | shape-what-comes-next | Template | 🧾 | Discussion guide | meta/DISCUSSIONS.md | local_path | Suggested discussion categories, starter prompts, and moderation standard. | Suggested discussion categories, starter prompts, and moderation standard. | Suggested discussion categories, starter prompts, and moderation standard. | The resource is directly reusable as a starting artifact. Suggested discussion categories, starter prompts, and moderation standard. | Use Discussion guide to reuse a concrete artifact or connect it to the wider ecosystem. | Repository file; inspect the linked schema, example, guide, or implementation. | medium | README.md | 1,655 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1655 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | whole-loop | builder | cross-layer | enabling | repository-native | A | local_ok | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/meta/DISCUSSIONS.md | Discussion guide | 2026 | GitHub | GitHub | repository | 2026-07-31T18:10:45 | |||||||||||||||
ale-0863 | Shape What Comes Next | shape-what-comes-next | Pattern | 🔁 | Show your Loop Engineering patterns | https://github.com/ChaoYue0307/awesome-loop-engineering/discussions/2 | external | github.com | Community discussion for real or anonymized loop examples. | Community discussion for real or anonymized loop examples. | Community discussion for real or anonymized loop examples. | Turns open questions and operating lessons into visible next work. Community discussion for real or anonymized loop examples. | Use Show your Loop Engineering patterns to reuse a concrete artifact or connect it to the wider ecosystem. | Inspectable GitHub source (43 stars; 8 forks; CC0-1.0 license; updated 2026-07-30); popularity is context, not proof of reliability. | medium | README.md | 1,656 | https://github.com/ChaoYue0307/awesome-loop-engineering/blob/main/README.md#L1656 | Apply | apply | Reuse, adapt, and contribute concrete loop artifacts. | whole-loop | builder | cross-layer | enabling | operational-pattern | B | ok | https://github.com/ChaoYue0307/awesome-loop-engineering/discussions/2 | Show your Loop Engineering patterns · ChaoYue0307/awesome-loop-engineering · Discussion #2 · GitHub | Show your Loop Engineering patterns | 2026-06-09 | 2026 | GitHub Discussions | GitHub | github-api | ChaoYue0307/awesome-loop-engineering | 43 | 8 | CC0-1.0 | 2026-06-09T16:17:27Z | 2026-07-30T05:26:08Z | 2026-07-31T18:10:45 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.