{
  "abstract": "Coding agents now write simulation programs, but benchmarks usually judge only whether their output matches a reference. In manufactured-solution tasks the data determine the exact solution, so a matching output need not come from a solver. We introduce PDEViBench, a benchmark of 290 tasks in six equation families that traces each passing program to the computation behind its output and reruns unclear programs on changed data. A Codex agent (GPT-5.2) passed 80% of 1,450 runs, yet about one pass in ten returned the exact solution without solving the equation. Counting only solved passes changed which task features made problems seem hard and reversed the ranking of two prompts. Once the prompt forbade the shortcut, every pass was a numerical solve, and on tasks without a closed-form solution passing programs stayed correct on changed data. Scientific coding benchmarks should check how each answer was computed as well as whether it matches.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2611.12308",
  "author_total": 2,
  "authors": [
    {
      "name": "Jiale Linghu"
    },
    {
      "name": "Yangshuai Wang"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/ee4xr7tgjynd3.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2611.12308",
  "fulltext_url": null,
  "id": "ee4xr7tgjynd3",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2611.12308",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.NA"
    ],
    [
      "arxiv",
      "math.NA"
    ]
  ],
  "openalex": null,
  "pdf_url": "https://arxiv.org/pdf/2611.12308",
  "pmcid": null,
  "pmid": null,
  "published": "2026-11-09",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/ee4xr7tgjynd3.ris",
  "sources": [
    {
      "first_seen": "2026-11-10T06:21:34Z",
      "native_id": "2611.12308",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2611.12308"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.NA",
      "subfield": "numerical-analysis"
    }
  ],
  "title": "Unmasking shortcut solutions of coding agents on partial differential equations",
  "title_text": "Unmasking shortcut solutions of coding agents on partial differential equations",
  "type": "preprint",
  "updated_at": "2026-11-10T06:21:34Z",
  "url": "https://research.draconitic.com/paper/ee4xr7tgjynd3",
  "venue": "arXiv",
  "versions": []
}