{
  "schema_version": 1,
  "builder_plan": {
    "scenario": "Your coding assistant makes changes that still need substantial repair before merging.",
    "change": "Try the technique on held-out issues from a repository with reliable tests.",
    "baseline": "The same coding agent, repository snapshot, tools, and token budget.",
    "steps": [
      "Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.",
      "Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.",
      "Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.",
      "Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test."
    ],
    "measure": "Correct patches, regression failures, human repair time, and total cost per accepted change.",
    "decision": "Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation."
  },
  "builder_review": null,
  "arxiv_id": "2610.00650",
  "title": "Self-Evolving Coding Rules for AI Coding Agents",
  "summary": "Replaces hand-crafted, static coding rules (system prompts and guidelines) for AI coding agents with an iterative mutate-and-judge loop that evolves a pool of rule candidates using an LLM mutator and an LLM judge. Costs include an offline optimization phase with repeated LLM calls for mutation and evaluation, which consumes API budget or GPU time, plus ongoing complexity of maintaining the candidate pool and evaluation harness; inference-time cost may decrease if evolved rules reduce token usage. Can fail if the judge's evaluations do not transfer to the reader's actual tasks and repositories, if evolved rules overfit the benchmarks used during optimization, or if the optimization budget is too small to converge on rules better than a well-written manual prompt.",
  "rationale": "The method runs through third-party APIs and requires no training or clusters, making it feasible on constrained infrastructure, but the claimed gains are benchmark-specific and must be validated against the reader's own codebase, models, and judge quality before production adoption.",
  "technique": "Self-evolving coding rule optimization for coding agents",
  "family": "agentes_de_codigo",
  "recommendation": "testar",
  "published": "2026-09-30",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.00650",
  "independent_implementations": 2,
  "total_implementations": 3,
  "stars": 135,
  "citations": 0,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "Replaces hand-crafted, static coding rules (system prompts and guidelines) for AI coding agents with an iterative mutate-and-judge loop that evolves a pool of rule candidates using an LLM mutator and an LLM judge. Costs include an offline optimization phase with repeated LLM calls for mutation and evaluation, which consumes API budget or GPU time, plus ongoing complexity of maintaining the candidate pool and evaluation harness; inference-time cost may decrease if evolved rules reduce token usage. Can fail if the judge's evaluations do not transfer to the reader's actual tasks and repositories, if evolved rules overfit the benchmarks used during optimization, or if the optimization budget is too small to converge on rules better than a well-written manual prompt.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.00650",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "RuleEvolve outperforms manual engineering and existing prompt optimization baselines on functional correctness, code length, and/or generation cost across two coding-agent frameworks, four backbone LLMs, and three benchmarks; no single multiplicative factor is stated in the abstract.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.00650",
      "source_page": null,
      "source_excerpt": ""
    }
  ],
  "exposure_map": [
    {
      "dimension": "quality",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "compute",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "latency",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "operations",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "compatibility",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "security",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "data_and_training",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "reproducibility",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    }
  ],
  "risks": [],
  "minimum_test": [],
  "open_questions": [],
  "independent_tests": [],
  "lab_reproductions": [],
  "report_available": false,
  "validation_tier": "unknown",
  "evidence_tier": "unknown",
  "infrastructure_basis": "unknown",
  "equations": [],
  "equations_status": "not_fetched",
  "core_kind": "",
  "equations_fetched_at": "",
  "equations_source_url": "",
  "equations_source_sha256": "",
  "exposures_reviewed_at": "",
  "exposures_source_sha256": ""
}