{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:F7GGSK4PTZTKYPXM6WB2XGUQAN","short_pith_number":"pith:F7GGSK4P","schema_version":"1.0","canonical_sha256":"2fcc692b8f9e66ac3eecf583ab9a900362dc76ecdd8b99e724560351a316e79f","source":{"kind":"arxiv","id":"2410.07295","version":2},"attestation_state":"computed","paper":{"title":"IterGen: Iterative Semantic-aware Structured LLM Generation with Backtracking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.PL"],"primary_cat":"cs.SE","authors_text":"Gagandeep Singh, Rohan Gumaste, Sasa Misailovic, Shubham Ugare, Tarun Suresh","submitted_at":"2024-10-09T16:21:38Z","abstract_excerpt":"Large Language Models (LLMs) are widely used for tasks such as natural language and code generation, but their outputs often suffer from issues like hallucination, toxicity, and incorrect results. Current libraries for structured LLM generation rely on left-to-right decoding without support for backtracking, limiting the ability to correct or refine outputs mid-generation.\n  To address this, we introduce IterGen, a user-friendly library for iterative, grammar-guided LLM generation that enables users to move both forward and backward within the generated output based on grammar symbols. By leve"},"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":"2410.07295","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2024-10-09T16:21:38Z","cross_cats_sorted":["cs.LG","cs.PL"],"title_canon_sha256":"39fbd8745b23e39a70f6ed9fe8e3b6267e962ffb1922bf5bc1a3507cca21229b","abstract_canon_sha256":"a624252061ff13a167902399935a35e4ef4d18e4856d893419e7b16ff4d02968"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:22:07.085209Z","signature_b64":"t90vjR0FrAP4nvvOa7Bw+vo2gLAi1ZGR8XyKo3rrKjX2d+s3hKkbnQhAtiE0sa5MJWmw/OOOcNEc6ofUkrI/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fcc692b8f9e66ac3eecf583ab9a900362dc76ecdd8b99e724560351a316e79f","last_reissued_at":"2026-07-05T10:22:07.084643Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:22:07.084643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"IterGen: Iterative Semantic-aware Structured LLM Generation with Backtracking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.PL"],"primary_cat":"cs.SE","authors_text":"Gagandeep Singh, Rohan Gumaste, Sasa Misailovic, Shubham Ugare, Tarun Suresh","submitted_at":"2024-10-09T16:21:38Z","abstract_excerpt":"Large Language Models (LLMs) are widely used for tasks such as natural language and code generation, but their outputs often suffer from issues like hallucination, toxicity, and incorrect results. Current libraries for structured LLM generation rely on left-to-right decoding without support for backtracking, limiting the ability to correct or refine outputs mid-generation.\n  To address this, we introduce IterGen, a user-friendly library for iterative, grammar-guided LLM generation that enables users to move both forward and backward within the generated output based on grammar symbols. By leve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.07295","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/2410.07295/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":"2410.07295","created_at":"2026-07-05T10:22:07.084705+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.07295v2","created_at":"2026-07-05T10:22:07.084705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.07295","created_at":"2026-07-05T10:22:07.084705+00:00"},{"alias_kind":"pith_short_12","alias_value":"F7GGSK4PTZTK","created_at":"2026-07-05T10:22:07.084705+00:00"},{"alias_kind":"pith_short_16","alias_value":"F7GGSK4PTZTKYPXM","created_at":"2026-07-05T10:22:07.084705+00:00"},{"alias_kind":"pith_short_8","alias_value":"F7GGSK4P","created_at":"2026-07-05T10:22:07.084705+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.01082","citing_title":"RefineStat: Efficient Exploration for Probabilistic Program Synthesis","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2511.22277","citing_title":"TreeCoder: Systematic Exploration and Optimisation of Decoding and Constraints for LLM Code Generation","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2512.05439","citing_title":"BEAVER: An Efficient Deterministic LLM Verifier","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04066","citing_title":"Adapt to Thrive! Adaptive Power-Mean Policy Optimization for Improved LLM Reasoning","ref_index":113,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04065","citing_title":"Free Energy-Driven Reinforcement Learning with Adaptive Advantage Shaping for Unsupervised Reasoning in LLMs","ref_index":128,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F7GGSK4PTZTKYPXM6WB2XGUQAN","json":"https://pith.science/pith/F7GGSK4PTZTKYPXM6WB2XGUQAN.json","graph_json":"https://pith.science/api/pith-number/F7GGSK4PTZTKYPXM6WB2XGUQAN/graph.json","events_json":"https://pith.science/api/pith-number/F7GGSK4PTZTKYPXM6WB2XGUQAN/events.json","paper":"https://pith.science/paper/F7GGSK4P"},"agent_actions":{"view_html":"https://pith.science/pith/F7GGSK4PTZTKYPXM6WB2XGUQAN","download_json":"https://pith.science/pith/F7GGSK4PTZTKYPXM6WB2XGUQAN.json","view_paper":"https://pith.science/paper/F7GGSK4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.07295&json=true","fetch_graph":"https://pith.science/api/pith-number/F7GGSK4PTZTKYPXM6WB2XGUQAN/graph.json","fetch_events":"https://pith.science/api/pith-number/F7GGSK4PTZTKYPXM6WB2XGUQAN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F7GGSK4PTZTKYPXM6WB2XGUQAN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F7GGSK4PTZTKYPXM6WB2XGUQAN/action/storage_attestation","attest_author":"https://pith.science/pith/F7GGSK4PTZTKYPXM6WB2XGUQAN/action/author_attestation","sign_citation":"https://pith.science/pith/F7GGSK4PTZTKYPXM6WB2XGUQAN/action/citation_signature","submit_replication":"https://pith.science/pith/F7GGSK4PTZTKYPXM6WB2XGUQAN/action/replication_record"}},"created_at":"2026-07-05T10:22:07.084705+00:00","updated_at":"2026-07-05T10:22:07.084705+00:00"}