{
  "schema_version": 1,
  "builder_plan": {
    "scenario": "A self-hosted assistant is too expensive because its model uses most of the GPU memory.",
    "change": "Try the paper's supported lower-precision weights on a copy of your serving setup.",
    "baseline": "The same model at its original precision, on the same GPU.",
    "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": "Peak memory, task pass rate, latency, and total serving cost at the same context and load.",
    "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.09212",
  "title": "CurveTQ: Rotation-Free Trellis Quantization of LLM Weights via Curvature-Weighted Search",
  "summary": "CurveTQ replaces the random orthogonal rotation used by state-of-the-art 2-bit trellis quantizers (QTIP, Proteus) with a curvature-weighted Viterbi branch metric in the native basis, plus a start state per coding block that alone lifts baselines by 1-3 points. It costs no runtime rotation to undo during decoding, making inference faster, but requires implementing or adopting a new codec with a factored scale field, quantile table, and per-block state storage. It can fail if the accuracy claims do not transfer beyond the three 4-8B models and one 35B MoE tested, if the implementation is not yet mature or integrated with the reader's inference stack, or if the small residual gap to full rotation-based methods matters for a specific workload.",
  "rationale": "The method targets exactly the constrained-infrastructure setting (2-bit quantization of models that fit a 24 GB GPU) with better accuracy and decoding speed than current baselines, but as a new codec it needs workload-specific validation of accuracy, integration maturity, and tooling support before production adoption.",
  "technique": "Rotation-free trellis weight quantization with curvature-weighted Viterbi search",
  "family": "quantizacao",
  "recommendation": "testar",
  "published": "2026-10-06",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.09212",
  "independent_implementations": 0,
  "total_implementations": 0,
  "stars": 0,
  "citations": 0,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "CurveTQ replaces the random orthogonal rotation used by state-of-the-art 2-bit trellis quantizers (QTIP, Proteus) with a curvature-weighted Viterbi branch metric in the native basis, plus a start state per coding block that alone lifts baselines by 1-3 points. It costs no runtime rotation to undo during decoding, making inference faster, but requires implementing or adopting a new codec with a factored scale field, quantile table, and per-block state storage. It can fail if the accuracy claims do not transfer beyond the three 4-8B models and one 35B MoE tested, if the implementation is not yet mature or integrated with the reader's inference stack, or if the small residual gap to full rotation-based methods matters for a specific workload.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.09212",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "At 2 bits, 1-3 points higher mean downstream accuracy than QTIP and Proteus on three 4-8B Instruct models, and the fastest decoder of the three at all tested batch sizes and bit widths (no speedup factor reported).",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.09212",
      "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": ""
}