Pith Number

pith:3BDSMIKO

pith:2026:3BDSMIKOLLH3ZSM6UOUSOTKFFY

not attested not anchored not stored refs pending

From Textual Columns to Query Plans: A Unified Relational-Semantic Execution Framework for Hybrid Query Processing

Estevam Hruschka, Nikita Bhutani, Nima Shahbazi, Seiji Maekawa

OmniTQA turns LLM semantic reasoning into an optimizable operator inside relational query plans to process mixed structured and textual tables more accurately and at lower cost than pure symbolic or pure semantic methods.

arxiv:2604.02444 v2 · 2026-04-02 · cs.DB

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{3BDSMIKOLLH3ZSM6UOUSOTKFFY}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

Extensive experiments across a diverse suite of structured and semi-structured table question answering benchmarks demonstrate that OmniTQA consistently outperforms existing symbolic, semantic, and hybrid baselines in both accuracy and cost efficiency. These gains are particularly pronounced for complex queries, large tables and multi-relation schemas.

C2weakest assumption

The assumption that LLM inference latency and cost can be sufficiently controlled through atomic decomposition, operator reordering, and batching without introducing unacceptable accuracy trade-offs or requiring extensive per-workload tuning.

C3one line summary

OmniTQA integrates LLM semantic reasoning as a first-class query operator with classical relational operators in a cost-aware planner for hybrid structured and semi-structured data.

Cited by

1 paper in Pith

Large Databases Need Small, Open-Weight Language Models

Receipt and verification

First computed	2026-07-03T00:16:53.600140Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

d84726214e5acfbcc99ea3a9274d452e08fb495790f2f6fea7e98a9d85fff237

Aliases

arxiv: 2604.02444 · arxiv_version: 2604.02444v2 · doi: 10.48550/arxiv.2604.02444 · pith_short_12: 3BDSMIKOLLH3 · pith_short_16: 3BDSMIKOLLH3ZSM6 · pith_short_8: 3BDSMIKO

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/3BDSMIKOLLH3ZSM6UOUSOTKFFY \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: d84726214e5acfbcc99ea3a9274d452e08fb495790f2f6fea7e98a9d85fff237

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "32308099e9d9f880dec8400cd550924678fe9306ebe166cbd9ead0d4032fecec",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.DB",
    "submitted_at": "2026-04-02T18:16:11Z",
    "title_canon_sha256": "600d4be57bdf5693c01b6235766228b652682584fa6b559f24c71af986f45cf8"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2604.02444",
    "kind": "arxiv",
    "version": 2
  }
}