{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:G7ZI3B4LFXSQRZF53I5VDXH66D","short_pith_number":"pith:G7ZI3B4L","schema_version":"1.0","canonical_sha256":"37f28d878b2de508e4bdda3b51dcfef0c703d928bd4f7505619ee26f34fbfb6b","source":{"kind":"arxiv","id":"2608.05029","version":1},"attestation_state":"computed","paper":{"title":"On Computational Hardness of Mistake-Bounded Language Generation: A Random-Oracle Query Separation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andi Han, Dai Shi, Jiaojiao Jiang, Junbin Gao, Xiaoyu Li","submitted_at":"2026-08-05T16:34:12Z","abstract_excerpt":"Generation in the limit guarantees eventual generation for every countable collection of infinite languages in the model of Kleinberg and Mullainathan [KM24], while closure dimension characterizes stronger information-theoretic guarantees [RLT25]. Neither restricts per-output computation. The cumulative-mistake objective in mistake-bounded generation makes finite failure prefixes quantitative [KPR26], and a per-output query budget exposes their computational source. Polynomial-time algorithms are known for parities, conjunctions, and monotone functions with polynomially many maxterms [JKO26]. "},"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":"2608.05029","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-05T16:34:12Z","cross_cats_sorted":[],"title_canon_sha256":"4adf2f85f74fc144c580af512456e633ab0ba4c85e286cb74605ec0950c37118","abstract_canon_sha256":"e658fd944a648784dc87d0944a4843f196c44964f640dcce1836a55eb952d03a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:48:04.677567Z","signature_b64":"rL6bxxousjtMuNVI/jWoZXjDCyymueTjGQOHpeuhFlkuq3242oAfK09Cpm7RW2sZT4zHiIeqUe76Kahtl0VBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37f28d878b2de508e4bdda3b51dcfef0c703d928bd4f7505619ee26f34fbfb6b","last_reissued_at":"2026-08-06T01:48:04.676210Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:48:04.676210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Computational Hardness of Mistake-Bounded Language Generation: A Random-Oracle Query Separation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andi Han, Dai Shi, Jiaojiao Jiang, Junbin Gao, Xiaoyu Li","submitted_at":"2026-08-05T16:34:12Z","abstract_excerpt":"Generation in the limit guarantees eventual generation for every countable collection of infinite languages in the model of Kleinberg and Mullainathan [KM24], while closure dimension characterizes stronger information-theoretic guarantees [RLT25]. Neither restricts per-output computation. The cumulative-mistake objective in mistake-bounded generation makes finite failure prefixes quantitative [KPR26], and a per-output query budget exposes their computational source. Polynomial-time algorithms are known for parities, conjunctions, and monotone functions with polynomially many maxterms [JKO26]. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.05029","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/2608.05029/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":"2608.05029","created_at":"2026-08-06T01:48:04.678011+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.05029v1","created_at":"2026-08-06T01:48:04.678011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05029","created_at":"2026-08-06T01:48:04.678011+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7ZI3B4LFXSQ","created_at":"2026-08-06T01:48:04.678011+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7ZI3B4LFXSQRZF5","created_at":"2026-08-06T01:48:04.678011+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7ZI3B4L","created_at":"2026-08-06T01:48:04.678011+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G7ZI3B4LFXSQRZF53I5VDXH66D","json":"https://pith.science/pith/G7ZI3B4LFXSQRZF53I5VDXH66D.json","graph_json":"https://pith.science/api/pith-number/G7ZI3B4LFXSQRZF53I5VDXH66D/graph.json","events_json":"https://pith.science/api/pith-number/G7ZI3B4LFXSQRZF53I5VDXH66D/events.json","paper":"https://pith.science/paper/G7ZI3B4L"},"agent_actions":{"view_html":"https://pith.science/pith/G7ZI3B4LFXSQRZF53I5VDXH66D","download_json":"https://pith.science/pith/G7ZI3B4LFXSQRZF53I5VDXH66D.json","view_paper":"https://pith.science/paper/G7ZI3B4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.05029&json=true","fetch_graph":"https://pith.science/api/pith-number/G7ZI3B4LFXSQRZF53I5VDXH66D/graph.json","fetch_events":"https://pith.science/api/pith-number/G7ZI3B4LFXSQRZF53I5VDXH66D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7ZI3B4LFXSQRZF53I5VDXH66D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7ZI3B4LFXSQRZF53I5VDXH66D/action/storage_attestation","attest_author":"https://pith.science/pith/G7ZI3B4LFXSQRZF53I5VDXH66D/action/author_attestation","sign_citation":"https://pith.science/pith/G7ZI3B4LFXSQRZF53I5VDXH66D/action/citation_signature","submit_replication":"https://pith.science/pith/G7ZI3B4LFXSQRZF53I5VDXH66D/action/replication_record"}},"created_at":"2026-08-06T01:48:04.678011+00:00","updated_at":"2026-08-06T01:48:04.678011+00:00"}