{
  "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.27019",
  "title": "MultiCard: Multiple Attribute Cardinality Estimation via Deep Learning",
  "summary": "MultiCard replaces PostgreSQL's default cardinality estimator and prior single-predicate learned estimators (histograms, LIKE-only or range-only models) with a single end-to-end neural model combining a Transformer, an LSTM, a numerical histogram encoder, and a predicate-interaction Transformer, trained on labeled queries. The cost is a supervised training pipeline requiring exact cardinality labels (produced by the UPCI workload generator), model maintenance as data and schema drift, and integration work with the query optimizer, plus small GPU or CPU inference overhead per query. It can fail on schema or data distributions not covered by the training workload, since learned estimators degrade under drift and the reported gains hold only on the five evaluated datasets and generated workloads.",
  "rationale": "The method targets database query optimization rather than LLM inference, so it is only relevant if the reader operates analytical databases, and even then its accuracy gains depend on workload-specific training labels that require validation before adoption.",
  "technique": "Learned multi-attribute cardinality estimation",
  "family": "outro",
  "recommendation": "testar",
  "published": "2026-10-19",
  "as_of": "2026-10-25",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.27019",
  "independent_implementations": 0,
  "total_implementations": 1,
  "stars": 0,
  "citations": 0,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "MultiCard replaces PostgreSQL's default cardinality estimator and prior single-predicate learned estimators (histograms, LIKE-only or range-only models) with a single end-to-end neural model combining a Transformer, an LSTM, a numerical histogram encoder, and a predicate-interaction Transformer, trained on labeled queries. The cost is a supervised training pipeline requiring exact cardinality labels (produced by the UPCI workload generator), model maintenance as data and schema drift, and integration work with the query optimizer, plus small GPU or CPU inference overhead per query. It can fail on schema or data distributions not covered by the training workload, since learned estimators degrade under drift and the reported gains hold only on the five evaluated datasets and generated workloads.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.27019",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "For mixed multi-attribute queries, MultiCard reduces PostgreSQL's mean Q-error by up to 16x while maintaining inference latency below 5 ms; for string-only workloads it achieves best or near-best Q-error across five datasets versus state-of-the-art methods.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.27019",
      "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": ""
}