{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SRRECEPPYATJNPUAPZT4NETTJQ","short_pith_number":"pith:SRRECEPP","schema_version":"1.0","canonical_sha256":"94624111efc02696be807e67c692734c2517c66604c851a9c69bd8c8c182238d","source":{"kind":"arxiv","id":"2306.03081","version":2},"attestation_state":"computed","paper":{"title":"Sequential Monte Carlo Steering of Large Language Models using Probabilistic Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.PL","stat.CO"],"primary_cat":"cs.AI","authors_text":"Alexander K. Lew, Gabriel Grand, Tan Zhi-Xuan, Vikash K. Mansinghka","submitted_at":"2023-06-05T17:55:05Z","abstract_excerpt":"Even after fine-tuning and reinforcement learning, large language models (LLMs) can be difficult, if not impossible, to control reliably with prompts alone. We propose a new inference-time approach to enforcing syntactic and semantic constraints on the outputs of LLMs, called sequential Monte Carlo (SMC) steering. The key idea is to specify language generation tasks as posterior inference problems in a class of discrete probabilistic sequence models, and replace standard decoding with sequential Monte Carlo inference. For a computational cost similar to that of beam search, SMC can steer LLMs "},"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":"2306.03081","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2023-06-05T17:55:05Z","cross_cats_sorted":["cs.CL","cs.PL","stat.CO"],"title_canon_sha256":"5d89a7e24576605c4bceb8c68f377e77e54070d3625680c3cb2d636dace14c1c","abstract_canon_sha256":"42a576647d942890631da89637b2bf22b576d63634f690c7edac498a174acc50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:42.589457Z","signature_b64":"Y7+bRFzzm0qkxpwtkWfeG6ufqHTZnjZu83bkvFANm6e9Ma7RBHho4ANnivKkUsGcxPk4ipB6RtUnsNhcuOVbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94624111efc02696be807e67c692734c2517c66604c851a9c69bd8c8c182238d","last_reissued_at":"2026-07-05T07:16:42.589018Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:42.589018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Monte Carlo Steering of Large Language Models using Probabilistic Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.PL","stat.CO"],"primary_cat":"cs.AI","authors_text":"Alexander K. Lew, Gabriel Grand, Tan Zhi-Xuan, Vikash K. Mansinghka","submitted_at":"2023-06-05T17:55:05Z","abstract_excerpt":"Even after fine-tuning and reinforcement learning, large language models (LLMs) can be difficult, if not impossible, to control reliably with prompts alone. We propose a new inference-time approach to enforcing syntactic and semantic constraints on the outputs of LLMs, called sequential Monte Carlo (SMC) steering. The key idea is to specify language generation tasks as posterior inference problems in a class of discrete probabilistic sequence models, and replace standard decoding with sequential Monte Carlo inference. For a computational cost similar to that of beam search, SMC can steer LLMs "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.03081","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/2306.03081/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":"2306.03081","created_at":"2026-07-05T07:16:42.589073+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.03081v2","created_at":"2026-07-05T07:16:42.589073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.03081","created_at":"2026-07-05T07:16:42.589073+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRRECEPPYATJ","created_at":"2026-07-05T07:16:42.589073+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRRECEPPYATJNPUA","created_at":"2026-07-05T07:16:42.589073+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRRECEPP","created_at":"2026-07-05T07:16:42.589073+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03731","citing_title":"Conformal Language Modeling via Posterior Sampling","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18563","citing_title":"Readers make targeted regressions to plausible errors in reanalysis of \"noisy-channel garden-path\" sentences","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15308","citing_title":"SMCEvolve: Principled Scientific Discovery via Sequential Monte Carlo Evolution","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15365","citing_title":"Greedy or not, here I come: Language production under vocabulary constraints in humans and resource-rational models","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2507.08390","citing_title":"Inference-Time Scaling of Diffusion Language Models via Trajectory Refinement","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12813","citing_title":"REALISTA: Realistic Latent Adversarial Attacks that Elicit LLM Hallucinations","ref_index":103,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16453","citing_title":"Sampling for Quality: Training-Free Reward-Guided LLM Decoding via Sequential Monte Carlo","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SRRECEPPYATJNPUAPZT4NETTJQ","json":"https://pith.science/pith/SRRECEPPYATJNPUAPZT4NETTJQ.json","graph_json":"https://pith.science/api/pith-number/SRRECEPPYATJNPUAPZT4NETTJQ/graph.json","events_json":"https://pith.science/api/pith-number/SRRECEPPYATJNPUAPZT4NETTJQ/events.json","paper":"https://pith.science/paper/SRRECEPP"},"agent_actions":{"view_html":"https://pith.science/pith/SRRECEPPYATJNPUAPZT4NETTJQ","download_json":"https://pith.science/pith/SRRECEPPYATJNPUAPZT4NETTJQ.json","view_paper":"https://pith.science/paper/SRRECEPP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.03081&json=true","fetch_graph":"https://pith.science/api/pith-number/SRRECEPPYATJNPUAPZT4NETTJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/SRRECEPPYATJNPUAPZT4NETTJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRRECEPPYATJNPUAPZT4NETTJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRRECEPPYATJNPUAPZT4NETTJQ/action/storage_attestation","attest_author":"https://pith.science/pith/SRRECEPPYATJNPUAPZT4NETTJQ/action/author_attestation","sign_citation":"https://pith.science/pith/SRRECEPPYATJNPUAPZT4NETTJQ/action/citation_signature","submit_replication":"https://pith.science/pith/SRRECEPPYATJNPUAPZT4NETTJQ/action/replication_record"}},"created_at":"2026-07-05T07:16:42.589073+00:00","updated_at":"2026-07-05T07:16:42.589073+00:00"}