{
  "schema_version": 1,
  "builder_plan": {
    "scenario": "Start with one repeated product task that has a measurable failure or cost.",
    "change": "Read the methods and identify one change you can isolate in that workflow.",
    "baseline": "Your current implementation on the same held-out tasks.",
    "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": "Successful outcomes, response time, human rework, and total cost per successful task.",
    "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.08367",
  "title": "Evolutionary One-Step Generators: Fast and Diverse Sampling for Discrete Design",
  "summary": "EGO replaces multi-step iterative sampling (autoregressive, diffusion, or flow-map generation) for discrete structures with a compact generator trained via distribution matching plus antithetic low-rank evolution strategies, emitting the full graph in one forward pass. Training requires an evolutionary optimization loop with non-differentiable reward evaluation (validity, diversity, history-dependent criteria), which adds implementation complexity and many reward evaluations, though inference itself is cheap and fits a single GPU. It can fail when the reward signal is misspecified or evaluation is expensive per sample, mode collapse is not prevented by the diversity rewards, or the target task lacks a reliable post-decoding validity check.",
  "rationale": "The method targets a niche production problem (discrete candidate generation under validity and diversity constraints) where the claimed efficiency is real but depends on workload-specific rewards, so it merits a small-scale pilot rather than direct adoption.",
  "technique": "Evolutionary one-step discrete generators (EGO)",
  "family": "outro",
  "recommendation": "testar",
  "published": "2026-10-06",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.08367",
  "independent_implementations": 0,
  "total_implementations": 1,
  "stars": 2,
  "citations": null,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "EGO replaces multi-step iterative sampling (autoregressive, diffusion, or flow-map generation) for discrete structures with a compact generator trained via distribution matching plus antithetic low-rank evolution strategies, emitting the full graph in one forward pass. Training requires an evolutionary optimization loop with non-differentiable reward evaluation (validity, diversity, history-dependent criteria), which adds implementation complexity and many reward evaluations, though inference itself is cheap and fits a single GPU. It can fail when the reward signal is misspecified or evaluation is expensive per sample, mode collapse is not prevented by the diversity rewards, or the target task lacks a reliable post-decoding validity check.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.08367",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "Over 50x the valid-and-unique yield per estimated dense operation versus one-step flow-map baselines on molecular generation; 44.3x faster than MoLeR in scaffold completion to SMILES, with roughly 10x filter-passing proposals in matched time budgets.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.08367",
      "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": ""
}