{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RC5VFPV3CMM3XBKXCBZLWBURLN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"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}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.11302","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"2605.11302v2","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11302","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"RC5VFPV3CMM3","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_16","alias_value":"RC5VFPV3CMM3XBKX","created_at":"2026-05-21T01:04:27Z"},{"alias_kind":"pith_short_8","alias_value":"RC5VFPV3","created_at":"2026-05-21T01:04:27Z"}],"graph_snapshots":[{"event_id":"sha256:ff4c58f55d177a872863da92fdd57ba418113b152ccd0a72d4a470637e79c088","target":"graph","created_at":"2026-05-21T01:04:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"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)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Timely generation of preferred strings is impossible for eventually consistent generators but achievable with vanishing hallucination rates for any superlinear deadline function."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Timely generation of preferred strings is impossible for eventually consistent generators but possible with vanishing hallucination rates for superlinear deadlines."}],"snapshot_sha256":"9192fa86f5c305f95aa947a9b35a33522f1d0ebffcf68216bcafaabcaec1fa41"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"e8f6b931fbcaae3b6dfb600b4794f47ba79d724acf68bc053016482385326029"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T04:42:00.696164Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T12:38:40.720501Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T10:01:17.105878Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T08:33:05.990430Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.11302/integrity.json","findings":[],"snapshot_sha256":"c461b061ff1ed105e991d01cb7e0c13a698b3c505ecad112115179f348e84e8c","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study language generation in the limit under a global preference ordering on strings, as introduced by Kleinberg and Wei. As is done in previous work, we aim for breadth, but impose an additional requirement of timeliness: higher-ranked strings should be generated earlier. A string is then only credited if it is generated before a deadline, where its deadline is defined by a function that maps a string's rank in the target language to the time by which it must be produced. This is in keeping with a central consideration in machine learning, where inductive bias favors ``simpler'' or ``more ","authors_text":"Atul Ganju, Shaddin Dughmi, Shang-Hua Teng, Travis McVoy","cross_cats":["cs.AI","cs.CL"],"headline":"Timely generation of preferred strings is impossible for eventually consistent generators but possible with vanishing hallucination rates for superlinear deadlines.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-11T22:42:24Z","title":"A Theory of Time-Sensitive Language Generation: Sparse Hallucination Beats Mode Collapse"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.11302","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-13T02:16:02.893239Z","id":"b843cd40-9adf-4af7-8830-c1d113d9292f","model_set":{"reader":"grok-4.3"},"one_line_summary":"Timely generation of preferred strings is impossible for eventually consistent generators but achievable with vanishing hallucination rates for any superlinear deadline function.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Timely generation of preferred strings is impossible for eventually consistent generators but possible with vanishing hallucination rates for superlinear deadlines.","strongest_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.","weakest_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)."}},"verdict_id":"b843cd40-9adf-4af7-8830-c1d113d9292f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:49f7d0683ba3aea35d6ece6bb8f5e6b76a929f68569b17e38ae84611802ba612","target":"record","created_at":"2026-05-21T01:04:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"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}},"canonical_sha256":"88bb52bebb1319bb85571072bb06915b48da192b8dc5e50b48d014db3cf8e141","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88bb52bebb1319bb85571072bb06915b48da192b8dc5e50b48d014db3cf8e141","first_computed_at":"2026-05-21T01:04:27.648500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:27.648500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DGTeHL0c3RgXKMzQwjefIpS26ZBR9/MK47FkuDW6N9speGu7sLVJHwSEoGkGK4hVD+syzUOF3rcu4N9I3pKUBQ==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:27.649194Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.11302","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49f7d0683ba3aea35d6ece6bb8f5e6b76a929f68569b17e38ae84611802ba612","sha256:ff4c58f55d177a872863da92fdd57ba418113b152ccd0a72d4a470637e79c088"],"state_sha256":"a039e437573264dbe6f48bc9cfd33782ba7a8fef57b7a8e985cd6c4ea0d14a5d"}