{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KDVKGKOYFW4YVRRH4X64WRTXUZ","short_pith_number":"pith:KDVKGKOY","schema_version":"1.0","canonical_sha256":"50eaa329d82db98ac627e5fdcb4677a646e6f35ca30f26990d1610b31cd6afe9","source":{"kind":"arxiv","id":"2411.15364","version":2},"attestation_state":"computed","paper":{"title":"Exploring Facets of Language Generation in the Limit","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.DS","authors_text":"Chirag Pabbaraju, Moses Charikar","submitted_at":"2024-11-22T22:13:40Z","abstract_excerpt":"The recent work of Kleinberg & Mullainathan [KM24] provides a concrete model for language generation in the limit: given a sequence of examples from an unknown target language, the goal is to generate new examples from the target language such that no incorrect examples are generated beyond some point. In sharp contrast to strong negative results for the closely related problem of language identification, they establish positive results for language generation in the limit for all countable collections of languages. Follow-up work by Raman & Tewari [RT24] studies bounds on the number of distin"},"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":"2411.15364","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-22T22:13:40Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"title_canon_sha256":"75937fd2a31c2cd6f7560aa18cddb144209f4db194fc85b69f28cfc7be68893d","abstract_canon_sha256":"680a5e73ab13bea6412a626c44f35dcb5efd64b3ef7bfb4fb50f16cf31afa82c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:46.467328Z","signature_b64":"ZzfKj+ytP4p04oWOpYFV+u8Psibzwgk5TfbwrIBiIQxct6XTIS5M6l1DWqwaNqTIgt2NuESAmLxh9mVFUWAkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50eaa329d82db98ac627e5fdcb4677a646e6f35ca30f26990d1610b31cd6afe9","last_reissued_at":"2026-07-05T09:53:46.466825Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:46.466825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Facets of Language Generation in the Limit","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.DS","authors_text":"Chirag Pabbaraju, Moses Charikar","submitted_at":"2024-11-22T22:13:40Z","abstract_excerpt":"The recent work of Kleinberg & Mullainathan [KM24] provides a concrete model for language generation in the limit: given a sequence of examples from an unknown target language, the goal is to generate new examples from the target language such that no incorrect examples are generated beyond some point. In sharp contrast to strong negative results for the closely related problem of language identification, they establish positive results for language generation in the limit for all countable collections of languages. Follow-up work by Raman & Tewari [RT24] studies bounds on the number of distin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15364","kind":"arxiv","version":2},"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/2411.15364/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":"2411.15364","created_at":"2026-07-05T09:53:46.466884+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.15364v2","created_at":"2026-07-05T09:53:46.466884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15364","created_at":"2026-07-05T09:53:46.466884+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDVKGKOYFW4Y","created_at":"2026-07-05T09:53:46.466884+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDVKGKOYFW4YVRRH","created_at":"2026-07-05T09:53:46.466884+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDVKGKOY","created_at":"2026-07-05T09:53:46.466884+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25777","citing_title":"Space-Efficient Language Generation in the Limit","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2602.13934","citing_title":"Why Code, Why Now: An Information-Theoretic Perspective on the Limits of Machine Learning","ref_index":6,"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":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10809","citing_title":"Mistake-Bounded Language Generation","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KDVKGKOYFW4YVRRH4X64WRTXUZ","json":"https://pith.science/pith/KDVKGKOYFW4YVRRH4X64WRTXUZ.json","graph_json":"https://pith.science/api/pith-number/KDVKGKOYFW4YVRRH4X64WRTXUZ/graph.json","events_json":"https://pith.science/api/pith-number/KDVKGKOYFW4YVRRH4X64WRTXUZ/events.json","paper":"https://pith.science/paper/KDVKGKOY"},"agent_actions":{"view_html":"https://pith.science/pith/KDVKGKOYFW4YVRRH4X64WRTXUZ","download_json":"https://pith.science/pith/KDVKGKOYFW4YVRRH4X64WRTXUZ.json","view_paper":"https://pith.science/paper/KDVKGKOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.15364&json=true","fetch_graph":"https://pith.science/api/pith-number/KDVKGKOYFW4YVRRH4X64WRTXUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KDVKGKOYFW4YVRRH4X64WRTXUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDVKGKOYFW4YVRRH4X64WRTXUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDVKGKOYFW4YVRRH4X64WRTXUZ/action/storage_attestation","attest_author":"https://pith.science/pith/KDVKGKOYFW4YVRRH4X64WRTXUZ/action/author_attestation","sign_citation":"https://pith.science/pith/KDVKGKOYFW4YVRRH4X64WRTXUZ/action/citation_signature","submit_replication":"https://pith.science/pith/KDVKGKOYFW4YVRRH4X64WRTXUZ/action/replication_record"}},"created_at":"2026-07-05T09:53:46.466884+00:00","updated_at":"2026-07-05T09:53:46.466884+00:00"}