pith. sign in

Title resolution pending

4 Pith papers cite this work. Polarity classification is still indexing.

4 Pith papers citing it

years

2026 4

verdicts

UNVERDICTED 4

representative citing papers

Fidelity Probes for Specification--Code Alignment

cs.LG · 2026-05-17 · unverdicted · novelty 7.0

Fidelity probes from code raise specification fidelity from 0.63 to 0.94 on a 12k-line COBOL benchmark over eight iterations, with convergence predicted by a two-state Markov fixed point from four iterations of rate data.

CoCoDA: Co-evolving Compositional DAG for Tool-Augmented Agents

cs.AI · 2026-05-08 · unverdicted · novelty 7.0

CoCoDA co-evolves a typed compositional DAG of primitive and composite tools with the agent planner, using signature-based retrieval and a size-based reward to scale libraries efficiently and let an 8B model match or beat a 32B model on math and code benchmarks.

citing papers explorer

Showing 4 of 4 citing papers.

  • Fidelity Probes for Specification--Code Alignment cs.LG · 2026-05-17 · unverdicted · none · ref 12

    Fidelity probes from code raise specification fidelity from 0.63 to 0.94 on a 12k-line COBOL benchmark over eight iterations, with convergence predicted by a two-state Markov fixed point from four iterations of rate data.

  • CoCoDA: Co-evolving Compositional DAG for Tool-Augmented Agents cs.AI · 2026-05-08 · unverdicted · none · ref 31

    CoCoDA co-evolves a typed compositional DAG of primitive and composite tools with the agent planner, using signature-based retrieval and a size-based reward to scale libraries efficiently and let an 8B model match or beat a 32B model on math and code benchmarks.

  • Prompt Optimization Enables Stable Algorithmic Collusion in LLM Agents cs.AI · 2026-04-20 · unverdicted · none · ref 99

    Meta-prompt optimization enables LLM agents to discover stable, generalizable tacit collusion strategies in market simulations that outperform hand-crafted prompt baselines.

  • Runtime-Structured Task Decomposition for Agentic Coding Systems cs.SE · 2026-05-14 · unverdicted · none · ref 11

    Runtime-structured task decomposition reduces retry costs in agentic coding systems by up to 51.7% versus monolithic prompts by rerunning only failed subtasks on two software engineering workloads.