{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VKNUU26QUUZZFHJFXKRR6E26AR","short_pith_number":"pith:VKNUU26Q","schema_version":"1.0","canonical_sha256":"aa9b4a6bd0a533929d25baa31f135e04423af3bccbfd3ac5e032a1c99b51736a","source":{"kind":"arxiv","id":"2605.29986","version":1},"attestation_state":"computed","paper":{"title":"Accelerating Constrained Decoding with Token Space Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alexander Koller, Michael Sullivan","submitted_at":"2026-05-28T14:22:20Z","abstract_excerpt":"To guarantee that an LLM's outputs conform to a specified structure, context-free grammar (CFG) decoding engines force the selection of next tokens that produce strings that conform to a given CFG. While current CFG-constrained decoding engines are highly optimized, the inherent costs arising from the massive per-step search space -- i.e. the entire token vocabulary -- result in intractably high overhead for more complex CFGs: precisely the situation where CFG engines are most useful. In this paper, we introduce CFGzip, an offline technique for compressing the token search space, which massive"},"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":"2605.29986","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-28T14:22:20Z","cross_cats_sorted":[],"title_canon_sha256":"95ed2e90bfa74677bd2e0fa9146d2efef170268955be8e74ccff48f307f0b3ae","abstract_canon_sha256":"715b314abf9e66498b0a17a8ef6bb107d489c3aef417417cab438371a7956eb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T02:06:05.534790Z","signature_b64":"1QzvNdgqTd2+00fXgWoB4cS2zDC2z6t2B52TEKBEWgz2aMqM1eaItosqvTR8e9yRmfTNs14FDvlgkBrklfqmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa9b4a6bd0a533929d25baa31f135e04423af3bccbfd3ac5e032a1c99b51736a","last_reissued_at":"2026-05-29T02:06:05.534104Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T02:06:05.534104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Constrained Decoding with Token Space Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alexander Koller, Michael Sullivan","submitted_at":"2026-05-28T14:22:20Z","abstract_excerpt":"To guarantee that an LLM's outputs conform to a specified structure, context-free grammar (CFG) decoding engines force the selection of next tokens that produce strings that conform to a given CFG. While current CFG-constrained decoding engines are highly optimized, the inherent costs arising from the massive per-step search space -- i.e. the entire token vocabulary -- result in intractably high overhead for more complex CFGs: precisely the situation where CFG engines are most useful. In this paper, we introduce CFGzip, an offline technique for compressing the token search space, which massive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.29986","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/2605.29986/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":"2605.29986","created_at":"2026-05-29T02:06:05.534215+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.29986v1","created_at":"2026-05-29T02:06:05.534215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.29986","created_at":"2026-05-29T02:06:05.534215+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKNUU26QUUZZ","created_at":"2026-05-29T02:06:05.534215+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKNUU26QUUZZFHJF","created_at":"2026-05-29T02:06:05.534215+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKNUU26Q","created_at":"2026-05-29T02:06:05.534215+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/VKNUU26QUUZZFHJFXKRR6E26AR","json":"https://pith.science/pith/VKNUU26QUUZZFHJFXKRR6E26AR.json","graph_json":"https://pith.science/api/pith-number/VKNUU26QUUZZFHJFXKRR6E26AR/graph.json","events_json":"https://pith.science/api/pith-number/VKNUU26QUUZZFHJFXKRR6E26AR/events.json","paper":"https://pith.science/paper/VKNUU26Q"},"agent_actions":{"view_html":"https://pith.science/pith/VKNUU26QUUZZFHJFXKRR6E26AR","download_json":"https://pith.science/pith/VKNUU26QUUZZFHJFXKRR6E26AR.json","view_paper":"https://pith.science/paper/VKNUU26Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.29986&json=true","fetch_graph":"https://pith.science/api/pith-number/VKNUU26QUUZZFHJFXKRR6E26AR/graph.json","fetch_events":"https://pith.science/api/pith-number/VKNUU26QUUZZFHJFXKRR6E26AR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKNUU26QUUZZFHJFXKRR6E26AR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKNUU26QUUZZFHJFXKRR6E26AR/action/storage_attestation","attest_author":"https://pith.science/pith/VKNUU26QUUZZFHJFXKRR6E26AR/action/author_attestation","sign_citation":"https://pith.science/pith/VKNUU26QUUZZFHJFXKRR6E26AR/action/citation_signature","submit_replication":"https://pith.science/pith/VKNUU26QUUZZFHJFXKRR6E26AR/action/replication_record"}},"created_at":"2026-05-29T02:06:05.534215+00:00","updated_at":"2026-05-29T02:06:05.534215+00:00"}