{
  "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.01685",
  "title": "MiLoop: Selective Memory Propagation for Neural Combinatorial Optimization",
  "summary": "MiLoop replaces deep per-step attention stacks and label-supervised or pruning-dependent training in constructive neural combinatorial optimization with a shallow RL policy that fuses and reuses historical embeddings across rollout steps via gated memory updates. The cost is additional per-node memory state carried through rollouts, gating logic complexity, and the instability typical of pure RL training, though it removes the need for solution labels, pseudo-labels, or training-time search-space pruning. Adoption can fail if RL training proves unstable or sample-inefficient on the reader's specific problem distribution, or if generalization claims from the four benchmark COPs do not transfer to the reader's domain.",
  "rationale": "The method trains a small policy without labels or clusters, which fits constrained infrastructure, but its RL-based training and COP-specific scope require workload-specific validation before production adoption.",
  "technique": "Memory-propagating shallow RL policy for combinatorial optimization",
  "family": "outro",
  "recommendation": "testar",
  "published": "2026-10-01",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.01685",
  "independent_implementations": 0,
  "total_implementations": 0,
  "stars": 0,
  "citations": null,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "MiLoop replaces deep per-step attention stacks and label-supervised or pruning-dependent training in constructive neural combinatorial optimization with a shallow RL policy that fuses and reuses historical embeddings across rollout steps via gated memory updates. The cost is additional per-node memory state carried through rollouts, gating logic complexity, and the instability typical of pure RL training, though it removes the need for solution labels, pseudo-labels, or training-time search-space pruning. Adoption can fail if RL training proves unstable or sample-inefficient on the reader's specific problem distribution, or if generalization claims from the four benchmark COPs do not transfer to the reader's domain.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.01685",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "The paper reports consistently high-quality solutions across four COPs on instances from 100 to 10 million nodes, with strong generalization, but provides no single multiplicative factor in the abstract.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.01685",
      "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": ""
}