{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RHQNT6HSZCFXGTW46K2X36EN3L","short_pith_number":"pith:RHQNT6HS","schema_version":"1.0","canonical_sha256":"89e0d9f8f2c88b734edcf2b57df88ddac42a4b497c97459a0f1ca2ae16256355","source":{"kind":"arxiv","id":"2506.18642","version":1},"attestation_state":"computed","paper":{"title":"On Union-Closedness of Language Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amin Karbasi, Anay Mehrotra, Grigoris Velegkas, Steve Hanneke","submitted_at":"2025-06-23T13:42:25Z","abstract_excerpt":"We investigate language generation in the limit - a model by Kleinberg and Mullainathan [NeurIPS 2024] and extended by Li, Raman, and Tewari [COLT 2025]. While Kleinberg and Mullainathan proved generation is possible for all countable collections, Li et al. defined a hierarchy of generation notions (uniform, non-uniform, and generatable) and explored their feasibility for uncountable collections.\n  Our first set of results resolve two open questions of Li et al. by proving finite unions of generatable or non-uniformly generatable classes need not be generatable. These follow from a stronger re"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.18642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-06-23T13:42:25Z","cross_cats_sorted":[],"title_canon_sha256":"37b2615d5a6df03e2ff76278d8b08c1038d0281bcfd37d22efadea4d424b8b36","abstract_canon_sha256":"d28962863437c669b8a649365492cc5aad800df825734868091ca2e8f49e0f65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:25:53.577965Z","signature_b64":"MzaVvNEsvWckhJZq1clNdeId7T9jgutOu+uORndftB2Yk6rBNLL5EfGIyy3aeBDY1D6fXPAwTz44oO45vBI/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89e0d9f8f2c88b734edcf2b57df88ddac42a4b497c97459a0f1ca2ae16256355","last_reissued_at":"2026-07-05T11:25:53.577535Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:25:53.577535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Union-Closedness of Language Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amin Karbasi, Anay Mehrotra, Grigoris Velegkas, Steve Hanneke","submitted_at":"2025-06-23T13:42:25Z","abstract_excerpt":"We investigate language generation in the limit - a model by Kleinberg and Mullainathan [NeurIPS 2024] and extended by Li, Raman, and Tewari [COLT 2025]. While Kleinberg and Mullainathan proved generation is possible for all countable collections, Li et al. defined a hierarchy of generation notions (uniform, non-uniform, and generatable) and explored their feasibility for uncountable collections.\n  Our first set of results resolve two open questions of Li et al. by proving finite unions of generatable or non-uniformly generatable classes need not be generatable. These follow from a stronger re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.18642","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.18642/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.18642","created_at":"2026-07-05T11:25:53.577593+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.18642v1","created_at":"2026-07-05T11:25:53.577593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.18642","created_at":"2026-07-05T11:25:53.577593+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHQNT6HSZCFX","created_at":"2026-07-05T11:25:53.577593+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHQNT6HSZCFXGTW4","created_at":"2026-07-05T11:25:53.577593+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHQNT6HS","created_at":"2026-07-05T11:25:53.577593+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25777","citing_title":"Space-Efficient Language Generation in the Limit","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02385","citing_title":"Validity, Sparse Holes, and Breadth in Language Generation: Banach Density, Topology, and Geometry","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10809","citing_title":"Mistake-Bounded Language Generation","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RHQNT6HSZCFXGTW46K2X36EN3L","json":"https://pith.science/pith/RHQNT6HSZCFXGTW46K2X36EN3L.json","graph_json":"https://pith.science/api/pith-number/RHQNT6HSZCFXGTW46K2X36EN3L/graph.json","events_json":"https://pith.science/api/pith-number/RHQNT6HSZCFXGTW46K2X36EN3L/events.json","paper":"https://pith.science/paper/RHQNT6HS"},"agent_actions":{"view_html":"https://pith.science/pith/RHQNT6HSZCFXGTW46K2X36EN3L","download_json":"https://pith.science/pith/RHQNT6HSZCFXGTW46K2X36EN3L.json","view_paper":"https://pith.science/paper/RHQNT6HS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.18642&json=true","fetch_graph":"https://pith.science/api/pith-number/RHQNT6HSZCFXGTW46K2X36EN3L/graph.json","fetch_events":"https://pith.science/api/pith-number/RHQNT6HSZCFXGTW46K2X36EN3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHQNT6HSZCFXGTW46K2X36EN3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHQNT6HSZCFXGTW46K2X36EN3L/action/storage_attestation","attest_author":"https://pith.science/pith/RHQNT6HSZCFXGTW46K2X36EN3L/action/author_attestation","sign_citation":"https://pith.science/pith/RHQNT6HSZCFXGTW46K2X36EN3L/action/citation_signature","submit_replication":"https://pith.science/pith/RHQNT6HSZCFXGTW46K2X36EN3L/action/replication_record"}},"created_at":"2026-07-05T11:25:53.577593+00:00","updated_at":"2026-07-05T11:25:53.577593+00:00"}