{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DNOJSZAETMT5IBJ637I2SQJ4WA","short_pith_number":"pith:DNOJSZAE","schema_version":"1.0","canonical_sha256":"1b5c9964049b27d4053edfd1a9413cb0380f46b8eb5f4536ef3392c143510a7f","source":{"kind":"arxiv","id":"2603.03305","version":2},"attestation_state":"computed","paper":{"title":"The Hidden Cost of Structured Generation in LLMs: Draft-Conditioned Constrained Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Amrit Singh Bedi, Avinash Reddy, James S. Ide, Thayne T. Walker","submitted_at":"2026-02-08T03:52:24Z","abstract_excerpt":"Large language models (LLMs) are increasingly used to generate executable outputs, JSON objects, and API calls, where a single syntax error can make the output unusable. Constrained decoding enforces validity token-by-token via masking and renormalization, but it can distort generation when the model assigns low probability mass to valid continuations, pushing decoding toward locally valid yet semantically incorrect trajectories. We propose \\emph{Draft-Conditioned Constrained Decoding (DCCD)}, a simple two-step, training-free inference procedure that decouples semantic planning from structural"},"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":"2603.03305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-02-08T03:52:24Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"24754e2e847c749b245a7476590f381d99b9ea8a030ae35fc8d1d515d5e856dd","abstract_canon_sha256":"3abf27069e25de3f8e39b5c1099d1ac9bb56c63d3d3047622ff2abe176cfda13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:35.197944Z","signature_b64":"rGQKcj/d+dfS2Hmd6sR+QlQSXtUrAYFvET6YiVpBM7OTv7IYWawkQqD8GG7p3ZbJDm7QidBhH1K7xgIsMNPvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b5c9964049b27d4053edfd1a9413cb0380f46b8eb5f4536ef3392c143510a7f","last_reissued_at":"2026-06-30T01:17:35.197106Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:35.197106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Hidden Cost of Structured Generation in LLMs: Draft-Conditioned Constrained Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Amrit Singh Bedi, Avinash Reddy, James S. Ide, Thayne T. Walker","submitted_at":"2026-02-08T03:52:24Z","abstract_excerpt":"Large language models (LLMs) are increasingly used to generate executable outputs, JSON objects, and API calls, where a single syntax error can make the output unusable. Constrained decoding enforces validity token-by-token via masking and renormalization, but it can distort generation when the model assigns low probability mass to valid continuations, pushing decoding toward locally valid yet semantically incorrect trajectories. We propose \\emph{Draft-Conditioned Constrained Decoding (DCCD)}, a simple two-step, training-free inference procedure that decouples semantic planning from structural"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.03305","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/2603.03305/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":"2603.03305","created_at":"2026-06-30T01:17:35.197195+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.03305v2","created_at":"2026-06-30T01:17:35.197195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.03305","created_at":"2026-06-30T01:17:35.197195+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNOJSZAETMT5","created_at":"2026-06-30T01:17:35.197195+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNOJSZAETMT5IBJ6","created_at":"2026-06-30T01:17:35.197195+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNOJSZAE","created_at":"2026-06-30T01:17:35.197195+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2603.27905","citing_title":"ATLAS-RTC: Closing the Loop on LLM Agent Output with Token-Level Runtime Control","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08737","citing_title":"The Extrapolation Cliff in On-Policy Distillation of Near-Deterministic Structured Outputs","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2604.14862","citing_title":"Schema Key Wording as an Instruction Channel in Structured Generation under Constrained Decoding","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DNOJSZAETMT5IBJ637I2SQJ4WA","json":"https://pith.science/pith/DNOJSZAETMT5IBJ637I2SQJ4WA.json","graph_json":"https://pith.science/api/pith-number/DNOJSZAETMT5IBJ637I2SQJ4WA/graph.json","events_json":"https://pith.science/api/pith-number/DNOJSZAETMT5IBJ637I2SQJ4WA/events.json","paper":"https://pith.science/paper/DNOJSZAE"},"agent_actions":{"view_html":"https://pith.science/pith/DNOJSZAETMT5IBJ637I2SQJ4WA","download_json":"https://pith.science/pith/DNOJSZAETMT5IBJ637I2SQJ4WA.json","view_paper":"https://pith.science/paper/DNOJSZAE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.03305&json=true","fetch_graph":"https://pith.science/api/pith-number/DNOJSZAETMT5IBJ637I2SQJ4WA/graph.json","fetch_events":"https://pith.science/api/pith-number/DNOJSZAETMT5IBJ637I2SQJ4WA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNOJSZAETMT5IBJ637I2SQJ4WA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNOJSZAETMT5IBJ637I2SQJ4WA/action/storage_attestation","attest_author":"https://pith.science/pith/DNOJSZAETMT5IBJ637I2SQJ4WA/action/author_attestation","sign_citation":"https://pith.science/pith/DNOJSZAETMT5IBJ637I2SQJ4WA/action/citation_signature","submit_replication":"https://pith.science/pith/DNOJSZAETMT5IBJ637I2SQJ4WA/action/replication_record"}},"created_at":"2026-06-30T01:17:35.197195+00:00","updated_at":"2026-06-30T01:17:35.197195+00:00"}