{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RE5AQ2P3TEB425KIPMGZ5QI24B","short_pith_number":"pith:RE5AQ2P3","schema_version":"1.0","canonical_sha256":"893a0869fb9903cd75487b0d9ec11ae07283e969ba0b38cb17d78b0cf881e0c7","source":{"kind":"arxiv","id":"2508.15866","version":1},"attestation_state":"computed","paper":{"title":"Correctness-Guaranteed Code Generation via Constrained Decoding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SE"],"primary_cat":"cs.PL","authors_text":"Lingxiao Li, Salar Rahili, Yiwei Zhao","submitted_at":"2025-08-20T20:48:18Z","abstract_excerpt":"Language Models (LMs) are increasingly being used for code generation, but ensuring the correctness of generated programs remains a significant challenge. Although imperfect code may be acceptable during software development with human oversight, domains such as video games and robotics require one-shot correctness for runtime-critical components. We present a constrained decoding algorithm for generating semantically correct programs that incorporates a context-sensitive parser, which, at each step, outputs a regular expression that satisfies a critical non-extensible property to guide the ge"},"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":"2508.15866","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-08-20T20:48:18Z","cross_cats_sorted":["cs.LG","cs.SE"],"title_canon_sha256":"777c8ed1e3bf077a43dd12cce00ec309cc37dde68b6eeecee5f3cfc7c6c8c983","abstract_canon_sha256":"378d8d27dbd9a8ab911a39381bd90028c13a371dc96d88d22b2c8392964401e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:39.822181Z","signature_b64":"nki2VZdvEEiYVMoeVYx6YqZ8iLOcVzO6RCRliASnP/cZl/tobWlbk7sSeO7QJxS4LJ3zeai2NhhZ48XxmUX6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"893a0869fb9903cd75487b0d9ec11ae07283e969ba0b38cb17d78b0cf881e0c7","last_reissued_at":"2026-07-05T11:57:39.821708Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:39.821708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Correctness-Guaranteed Code Generation via Constrained Decoding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SE"],"primary_cat":"cs.PL","authors_text":"Lingxiao Li, Salar Rahili, Yiwei Zhao","submitted_at":"2025-08-20T20:48:18Z","abstract_excerpt":"Language Models (LMs) are increasingly being used for code generation, but ensuring the correctness of generated programs remains a significant challenge. Although imperfect code may be acceptable during software development with human oversight, domains such as video games and robotics require one-shot correctness for runtime-critical components. We present a constrained decoding algorithm for generating semantically correct programs that incorporates a context-sensitive parser, which, at each step, outputs a regular expression that satisfies a critical non-extensible property to guide the ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.15866","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/2508.15866/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":"2508.15866","created_at":"2026-07-05T11:57:39.821766+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.15866v1","created_at":"2026-07-05T11:57:39.821766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.15866","created_at":"2026-07-05T11:57:39.821766+00:00"},{"alias_kind":"pith_short_12","alias_value":"RE5AQ2P3TEB4","created_at":"2026-07-05T11:57:39.821766+00:00"},{"alias_kind":"pith_short_16","alias_value":"RE5AQ2P3TEB425KI","created_at":"2026-07-05T11:57:39.821766+00:00"},{"alias_kind":"pith_short_8","alias_value":"RE5AQ2P3","created_at":"2026-07-05T11:57:39.821766+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21619","citing_title":"The Alignment Problem in Constrained Code Generation","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RE5AQ2P3TEB425KIPMGZ5QI24B","json":"https://pith.science/pith/RE5AQ2P3TEB425KIPMGZ5QI24B.json","graph_json":"https://pith.science/api/pith-number/RE5AQ2P3TEB425KIPMGZ5QI24B/graph.json","events_json":"https://pith.science/api/pith-number/RE5AQ2P3TEB425KIPMGZ5QI24B/events.json","paper":"https://pith.science/paper/RE5AQ2P3"},"agent_actions":{"view_html":"https://pith.science/pith/RE5AQ2P3TEB425KIPMGZ5QI24B","download_json":"https://pith.science/pith/RE5AQ2P3TEB425KIPMGZ5QI24B.json","view_paper":"https://pith.science/paper/RE5AQ2P3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.15866&json=true","fetch_graph":"https://pith.science/api/pith-number/RE5AQ2P3TEB425KIPMGZ5QI24B/graph.json","fetch_events":"https://pith.science/api/pith-number/RE5AQ2P3TEB425KIPMGZ5QI24B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RE5AQ2P3TEB425KIPMGZ5QI24B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RE5AQ2P3TEB425KIPMGZ5QI24B/action/storage_attestation","attest_author":"https://pith.science/pith/RE5AQ2P3TEB425KIPMGZ5QI24B/action/author_attestation","sign_citation":"https://pith.science/pith/RE5AQ2P3TEB425KIPMGZ5QI24B/action/citation_signature","submit_replication":"https://pith.science/pith/RE5AQ2P3TEB425KIPMGZ5QI24B/action/replication_record"}},"created_at":"2026-07-05T11:57:39.821766+00:00","updated_at":"2026-07-05T11:57:39.821766+00:00"}