Pith Number

pith:RC5VFPV3

pith:2026:RC5VFPV3CMM3XBKXCBZLWBURLN

not attested not anchored not stored refs pending

A Theory of Time-Sensitive Language Generation: Sparse Hallucination Beats Mode Collapse

Atul Ganju, Shaddin Dughmi, Shang-Hua Teng, Travis McVoy

Timely generation of preferred strings is impossible for eventually consistent generators but possible with vanishing hallucination rates for superlinear deadlines.

arxiv:2605.11302 v2 · 2026-05-11 · cs.LG · cs.AI · cs.CL

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{RC5VFPV3CMM3XBKXCBZLWBURLN}

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

We show that timely generation is impossible in a strong sense for eventually consistent generators. Under a hallucination rate that vanishes over time, we can achieve optimal density with respect to any superlinear deadline function. We also show this is tight by ruling out timely generation with linear deadlines and vanishing hallucination rate.

C2weakest assumption

The assumption that there exists a generator achieving a hallucination rate that vanishes over time while still respecting the global preference ordering in the limit (the 'mildest natural relaxation of consistency' invoked to circumvent the impossibility result).

C3one line summary

Timely generation of preferred strings is impossible for eventually consistent generators but achievable with vanishing hallucination rates for any superlinear deadline function.

Formal links

1 machine-checked theorem link

Receipt and verification

First computed	2026-05-21T01:04:27.648500Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

88bb52bebb1319bb85571072bb06915b48da192b8dc5e50b48d014db3cf8e141

Aliases

arxiv: 2605.11302 · arxiv_version: 2605.11302v2 · doi: 10.48550/arxiv.2605.11302 · pith_short_12: RC5VFPV3CMM3 · pith_short_16: RC5VFPV3CMM3XBKX · pith_short_8: RC5VFPV3

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/RC5VFPV3CMM3XBKXCBZLWBURLN \
  | 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: 88bb52bebb1319bb85571072bb06915b48da192b8dc5e50b48d014db3cf8e141

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "fa7188c1dea54beca681b173b4435e6b33c0c0f246530103555adc6d07101ad3",
    "cross_cats_sorted": [
      "cs.AI",
      "cs.CL"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.LG",
    "submitted_at": "2026-05-11T22:42:24Z",
    "title_canon_sha256": "7de159b092bc85aabb9f6c63c753aa8dbeeee5b59a9a2bbd9e8f04b2c50a9933"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.11302",
    "kind": "arxiv",
    "version": 2
  }
}