{
  "schema_version": 1,
  "builder_plan": {
    "scenario": "Your self-hosted model spends too long generating answers token by token.",
    "change": "Check whether a compatible draft model and serving integration exist before renting compute.",
    "baseline": "The same target with speculation off, then your existing drafter if you have one.",
    "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": "Accepted draft length, tokens per second, tail latency, output quality, and total GPU cost.",
    "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.18862",
  "title": "DoubtLess: Training-Free Contrastive Decoding for Efficient Reasoning",
  "summary": "Replaces per-model training for CoT compression, steering-vector methods, and heuristic early stopping by adding a scaled logit difference from a small model run twice (brief-prompted vs verbose-prompted) to the large model's logits at every decoding step. Costs two extra small-model forward passes per generated token plus per-step logit manipulation, which roughly triples inference compute per token even though total tokens fall, so net latency and cost savings depend on the small model being much cheaper than the large one. Can fail if the steering strength is mis-tuned (accuracy degradation on tasks needing extended verification), if no suitable smaller reasoning model in the same family is available, or on workloads where the claimed accuracy parity does not transfer.",
  "rationale": "The method is training-free and open-source with claimed accuracy-neutral token savings, but it requires a compatible small steering model and adds per-token overhead, so the reader should validate net cost and accuracy on their own workload before production adoption.",
  "technique": "Training-free contrastive decoding with small steering model",
  "family": "decodificacao_especulativa",
  "recommendation": "testar",
  "published": "2026-10-13",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.18862",
  "independent_implementations": 1,
  "total_implementations": 2,
  "stars": 0,
  "citations": null,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "Replaces per-model training for CoT compression, steering-vector methods, and heuristic early stopping by adding a scaled logit difference from a small model run twice (brief-prompted vs verbose-prompted) to the large model's logits at every decoding step. Costs two extra small-model forward passes per generated token plus per-step logit manipulation, which roughly triples inference compute per token even though total tokens fall, so net latency and cost savings depend on the small model being much cheaper than the large one. Can fail if the steering strength is mis-tuned (accuracy degradation on tasks needing extended verification), if no suitable smaller reasoning model in the same family is available, or on workloads where the claimed accuracy parity does not transfer.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.18862",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "Shortens Qwen3-32B chain-of-thought by 31% with unchanged accuracy across seven benchmarks; 20% thinking-token reduction per turn in a self-debugging coding agent with unchanged task performance.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.18862",
      "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": ""
}