PairCoder++: Pair Programming as a Universal Paradigm for Verified Code-Driven Multimodal and Structured-Artifact Generation

• URL: http://arxiv.org/abs/2607.01883v1
• Date: Thu, 02 Jul 2026 08:36:02 GMT
• Title: PairCoder++: Pair Programming as a Universal Paradigm for Verified Code-Driven Multimodal and Structured-Artifact Generation
• Abstract summary: PairCoder improves essentially every benchmark whose artifact is verifiable, on full official metric suites rather than execution alone.<n>TikZ compile rate up 10 to 30 points on every model, at 2.9 to 9.2 times single model cost.
• Score: 51.92442051257354
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Code is the medium through which large language models generate structured artifacts: charts, scientific figures, vector graphics, CAD models, 3D scenes, and hardware designs are all produced by writing programs. In this regime single pass inference is brittle, because the compiler, renderer, or simulator that decides whether the artifact exists is invisible to the model. We present PairCoder, which grounds review in the toolchain and realizes it as two agent pair programming: a Driver agent writes the program, a Navigator agent reviews it against verification evidence (diagnostics, execution results, and renderings of the current artifact beside the target), and the two switch roles when errors persist. Across 17 public benchmarks and seven models from three vendors, PairCoder improves essentially every benchmark whose artifact is verifiable, on full official metric suites rather than execution alone (for example, Blender scene executability 0.20 to 0.78; TikZ compile rate up 10 to 30 points on every model), at 2.9 to 9.2 times single model cost (about 7 times overall). The improvements concentrate where the toolchain provides an informative oracle and the baseline leaves headroom, and the method ties or mildly regresses where the oracle is weak; we frame pair programming as a reliable recipe for verified code driven generation.

Related papers

• Procedura: Agentic 3D Modeling with Procedural Control [52.232812096564906]
  Procedura is a novel 3D modeling agent framework that writes an object as a procedural assembly.<n>From a text prompt, the agent plans the object as an assembly graph and writes the program part by part.<n>A decoupled vision critic then refines the assembly one diagnosed fix at a time.
  arXiv  Detail & Related papers  (2026-08-26T17:54:39Z)
• Rebuild Dossier: Mechanically-Enforced Specs for Agentic App Rebuilds, and What Model-Tier Failures Reveal [0.0]
  rebuild-dossier is an open-source tool that locks an application's real interface before any code is written.<n>It enforces one-test-at-a-time building through automated checks, not written instructions alone.
  arXiv  Detail & Related papers  (2026-08-22T01:26:56Z)
• CrackMeBench: Binary Reverse Engineering for Agents [3.93181912653522]
  CrackMeBench is a benchmark for evaluating language-model agents on educational reverse-engineering tasks.<n>The v0 benchmark combines eight public calibration CrackMes with twelve generated main-score tasks built from seeded C, Rust, and Go templates.<n>CrackMeBench records pass@1 and pass@3, scored submissions, wall-clock time, command traces, tool categories, provider-reported token usage, estimated cost, and qualitative failure labels.
  arXiv  Detail & Related papers  (2026-05-11T14:01:36Z)
• ProgramBench: Can Language Models Rebuild Programs From Scratch? [59.40748183470308]
  ProgramBench measures the ability of software engineering agents to develop software holisitically.<n>End-to-end behavioral tests are generated via agent-driven fuzzing.<n>Models favor monolithic, single-file implementations that diverge sharply from human-written code.
  arXiv  Detail & Related papers  (2026-05-05T09:17:02Z)
• 1D-Bench: A Benchmark for Iterative UI Code Generation with Visual Feedback in Real-World [5.904589000032003]
  We introduce 1D-Bench, a benchmark grounded in real e-commerce, where each instance provides a reference rendering and an exported intermediate representation.<n>1D is short for one day, representing the efficient completion of design-to-code tasks in less than one day.
  arXiv  Detail & Related papers  (2026-02-20T17:46:51Z)
• AlgoVeri: An Aligned Benchmark for Verified Code Generation on Classical Algorithms [54.99368693313797]
  Existing benchmarks test only individual languages/tools, so the performance numbers are not directly comparable.<n>We address this gap with AlgoVeri, a benchmark that evaluates vericoding of $77$ classical algorithms in Dafny, Verus, and Lean.
  arXiv  Detail & Related papers  (2026-02-10T06:58:26Z)
• VisCoder2: Building Multi-Language Visualization Coding Agents [63.63232038173407]
  We introduce three complementary resources for advancing visualization coding agents.<n>VisCoder2 significantly outperforms strong open-source baselines and approaches the performance of proprietary models.
  arXiv  Detail & Related papers  (2025-10-24T18:03:57Z)
• Paper2Code: Automating Code Generation from Scientific Papers in Machine Learning [70.04746094652653]
  We introduce PaperCoder, a framework that transforms machine learning papers into functional code repositories.<n>PaperCoder operates in three stages: planning, designs the system architecture with diagrams, identifies file dependencies, and generates configuration files.<n>We then evaluate PaperCoder on generating code implementations from machine learning papers based on both model-based and human evaluations.
  arXiv  Detail & Related papers  (2025-04-24T01:57:01Z)
• Stable Code Technical Report [7.303784606231683]
  Stable Code is a general-purpose base code language model targeting code completion, reasoning, math, and other software engineering-based tasks. Stable Code Instruct allows conversing with the model in a natural chat interface for performing question-answering and instruction-based tasks.
  arXiv  Detail & Related papers  (2024-04-01T16:39:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.