{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:52PFSL5O52YQG7FJMVSA3ZTRAI","short_pith_number":"pith:52PFSL5O","schema_version":"1.0","canonical_sha256":"ee9e592faeeeb1037ca965640de6710223004752ba487f465b98118fcdf90c0c","source":{"kind":"arxiv","id":"2112.08726","version":1},"attestation_state":"computed","paper":{"title":"NeuroLogic A*esque Decoding: Constrained Text Generation with Lookahead Heuristics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Daniel Khashabi, Jungo Kasai, Lianhui Qin, Liwei Jiang, Noah A. Smith, Peter West, Ronan Le Bras, Rowan Zellers, Sean Welleck, Ximing Lu, Yejin Choi, Youngjae Yu","submitted_at":"2021-12-16T09:22:54Z","abstract_excerpt":"The dominant paradigm for neural text generation is left-to-right decoding from autoregressive language models. Constrained or controllable generation under complex lexical constraints, however, requires foresight to plan ahead feasible future paths.\n  Drawing inspiration from the A* search algorithm, we propose NeuroLogic A*esque, a decoding algorithm that incorporates heuristic estimates of future cost. We develop efficient lookahead heuristics that are efficient for large-scale language models, making our method a drop-in replacement for common techniques such as beam search and top-k sampl"},"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":"2112.08726","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2021-12-16T09:22:54Z","cross_cats_sorted":[],"title_canon_sha256":"c51762da9700c22c4df97eb151c3616ac7efefd88bc0e31dc0cde3646cfb0f71","abstract_canon_sha256":"fadcd8eead4af5288396eccb1acb93f866735dc8c26b4c651d2835509ac7a193"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:41:32.076340Z","signature_b64":"l5KPeCC07wRqLpt7zgFiYhGXgG+awDcW1v9U6PDRjqllcptEEXg9mo5VmobiVx3j+jacjKXb18BNeW+4Hu8lAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee9e592faeeeb1037ca965640de6710223004752ba487f465b98118fcdf90c0c","last_reissued_at":"2026-07-05T03:41:32.075927Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:41:32.075927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NeuroLogic A*esque Decoding: Constrained Text Generation with Lookahead Heuristics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Daniel Khashabi, Jungo Kasai, Lianhui Qin, Liwei Jiang, Noah A. Smith, Peter West, Ronan Le Bras, Rowan Zellers, Sean Welleck, Ximing Lu, Yejin Choi, Youngjae Yu","submitted_at":"2021-12-16T09:22:54Z","abstract_excerpt":"The dominant paradigm for neural text generation is left-to-right decoding from autoregressive language models. Constrained or controllable generation under complex lexical constraints, however, requires foresight to plan ahead feasible future paths.\n  Drawing inspiration from the A* search algorithm, we propose NeuroLogic A*esque, a decoding algorithm that incorporates heuristic estimates of future cost. We develop efficient lookahead heuristics that are efficient for large-scale language models, making our method a drop-in replacement for common techniques such as beam search and top-k sampl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.08726","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/2112.08726/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":"2112.08726","created_at":"2026-07-05T03:41:32.075977+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.08726v1","created_at":"2026-07-05T03:41:32.075977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.08726","created_at":"2026-07-05T03:41:32.075977+00:00"},{"alias_kind":"pith_short_12","alias_value":"52PFSL5O52YQ","created_at":"2026-07-05T03:41:32.075977+00:00"},{"alias_kind":"pith_short_16","alias_value":"52PFSL5O52YQG7FJ","created_at":"2026-07-05T03:41:32.075977+00:00"},{"alias_kind":"pith_short_8","alias_value":"52PFSL5O","created_at":"2026-07-05T03:41:32.075977+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.08980","citing_title":"AdaDec: A Uncertainty-Guided Lookahead Decoding Framework for LLM-Based Code Generation","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/52PFSL5O52YQG7FJMVSA3ZTRAI","json":"https://pith.science/pith/52PFSL5O52YQG7FJMVSA3ZTRAI.json","graph_json":"https://pith.science/api/pith-number/52PFSL5O52YQG7FJMVSA3ZTRAI/graph.json","events_json":"https://pith.science/api/pith-number/52PFSL5O52YQG7FJMVSA3ZTRAI/events.json","paper":"https://pith.science/paper/52PFSL5O"},"agent_actions":{"view_html":"https://pith.science/pith/52PFSL5O52YQG7FJMVSA3ZTRAI","download_json":"https://pith.science/pith/52PFSL5O52YQG7FJMVSA3ZTRAI.json","view_paper":"https://pith.science/paper/52PFSL5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.08726&json=true","fetch_graph":"https://pith.science/api/pith-number/52PFSL5O52YQG7FJMVSA3ZTRAI/graph.json","fetch_events":"https://pith.science/api/pith-number/52PFSL5O52YQG7FJMVSA3ZTRAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52PFSL5O52YQG7FJMVSA3ZTRAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52PFSL5O52YQG7FJMVSA3ZTRAI/action/storage_attestation","attest_author":"https://pith.science/pith/52PFSL5O52YQG7FJMVSA3ZTRAI/action/author_attestation","sign_citation":"https://pith.science/pith/52PFSL5O52YQG7FJMVSA3ZTRAI/action/citation_signature","submit_replication":"https://pith.science/pith/52PFSL5O52YQG7FJMVSA3ZTRAI/action/replication_record"}},"created_at":"2026-07-05T03:41:32.075977+00:00","updated_at":"2026-07-05T03:41:32.075977+00:00"}