{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/picard","slug":"picard","name":"PICARD","full_name":"Parsing Incrementally for Constrained Auto-Regressive Decoding","full_name_withheld":false,"description_markdown":null,"description_state":"absent","introduced_year":null,"introduced_by":{"title":"PICARD: Parsing Incrementally for Constrained Auto-Regressive Decoding from Language Models","paper":"/paper/picard-parsing-incrementally-for-constrained","first_author":"Torsten Scholak","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/picard-parsing-incrementally-for-constrained"},"source":{"url":"https://arxiv.org/abs/2109.05093v1","title":"PICARD: Parsing Incrementally for Constrained Auto-Regressive Decoding from Language Models","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Natural Language Processing","area_id":"natural-language-processing","collection":"Code Generation Transformers","url":"/methods/category/code-generation-transformers","pwc_aliases":[]}],"n_papers_tagged":18,"archive_num_papers":18,"papers_newest_first":[{"paper":"/paper/learning-to-integrate-diffusion-odes-by","slug":"learning-to-integrate-diffusion-odes-by","title":"Learning to Integrate Diffusion ODEs by Averaging the Derivatives","date":"2025-05-20","arxiv_id":"2505.14502","n_code_links":0,"syntology":{"ran":3,"of":6,"n_ran_checked":1,"n_instrument":2,"unverified":3,"pointer_only":6,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":null}},{"paper":"/paper/fastdup-a-scalable-duplicate-marking-tool","slug":"fastdup-a-scalable-duplicate-marking-tool","title":"FastDup: a scalable duplicate marking tool using speculation-and-test mechanism","date":"2025-05-09","arxiv_id":"2505.06127","n_code_links":1,"syntology":null},{"paper":null,"slug":"pcm-picard-consistency-model-for-fast","title":"PCM : Picard Consistency Model for Fast Parallel Sampling of Diffusion Models","date":"2025-03-25","arxiv_id":"2503.19731","n_code_links":0,"syntology":null},{"paper":null,"slug":"picard-kkt-hpinn-enforcing-nonlinear-enthalpy","title":"Picard-KKT-hPINN: Enforcing Nonlinear Enthalpy Balances for Physically Consistent Neural Networks","date":"2025-01-29","arxiv_id":"2501.17782","n_code_links":0,"syntology":null},{"paper":null,"slug":"parallel-simulation-for-sampling-under","title":"Parallel simulation for sampling under isoperimetry and score-based diffusion models","date":"2024-12-10","arxiv_id":"2412.07435","n_code_links":0,"syntology":null},{"paper":null,"slug":"multilevel-picard-approximations-and-deep","title":"Multilevel Picard approximations and deep neural networks with ReLU, leaky ReLU, and softplus activation overcome the curse of dimensionality when approximating semilinear parabolic partial differential equations in $L^p$-sense","date":"2024-09-30","arxiv_id":"2409.20431","n_code_links":0,"syntology":null},{"paper":null,"slug":"speeding-up-policy-simulation-in-supply-chain","title":"Speeding up Policy Simulation in Supply Chain RL","date":"2024-06-04","arxiv_id":"2406.01939","n_code_links":0,"syntology":null},{"paper":null,"slug":"accelerating-diffusion-models-with-parallel","title":"Accelerating Diffusion Models with Parallel Sampling: Inference at Sub-Linear Time Complexity","date":"2024-05-24","arxiv_id":"2405.15986","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-explicit-scheme-for-pathwise-xva","title":"An Explicit Scheme for Pathwise XVA Computations","date":"2024-01-24","arxiv_id":"2401.13314","n_code_links":0,"syntology":null},{"paper":null,"slug":"domain-adaptation-of-a-state-of-the-art-text","title":"Domain Adaptation of a State of the Art Text-to-SQL Model: Lessons Learned and Challenges Found","date":"2023-12-09","arxiv_id":"2312.05448","n_code_links":0,"syntology":null},{"paper":"/paper/dreampropeller-supercharge-text-to-3d","slug":"dreampropeller-supercharge-text-to-3d","title":"DreamPropeller: Supercharge Text-to-3D Generation with Parallel Sampling","date":"2023-11-28","arxiv_id":"2311.17082","n_code_links":1,"syntology":{"ran":16,"of":17,"n_ran_checked":15,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 4 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["alexzhou907/dreampropeller"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/machine-learning-detects-terminal","slug":"machine-learning-detects-terminal","title":"Machine learning detects terminal singularities","date":"2023-09-21","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"neural-partial-differential-equations-with-1","title":"Neural Partial Differential Equations with Functional Convolution","date":"2023-03-10","arxiv_id":"2303.07194","n_code_links":0,"syntology":null},{"paper":"/paper/pac-prediction-sets-for-large-language-models","slug":"pac-prediction-sets-for-large-language-models","title":"PAC Prediction Sets for Large Language Models of Code","date":"2023-02-17","arxiv_id":"2302.08703","n_code_links":1,"syntology":null},{"paper":"/paper/a-framework-to-evaluate-independent-component","slug":"a-framework-to-evaluate-independent-component","title":"A Framework to Evaluate Independent Component Analysis applied to EEG signal: testing on the Picard algorithm","date":"2022-10-16","arxiv_id":"2210.08409","n_code_links":1,"syntology":null},{"paper":null,"slug":"deep-learning-approximations-for-non-local","title":"Deep learning approximations for non-local nonlinear PDEs with Neumann boundary conditions","date":"2022-05-07","arxiv_id":"2205.03672","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-tutorial-on-solution-properties-of-state","title":"A Tutorial on Solution Properties of State Space Models of Dynamical Systems","date":"2022-04-12","arxiv_id":"2204.06104","n_code_links":0,"syntology":null},{"paper":"/paper/picard-parsing-incrementally-for-constrained","slug":"picard-parsing-incrementally-for-constrained","title":"PICARD: Parsing Incrementally for Constrained Auto-Regressive Decoding from Language Models","date":"2021-09-10","arxiv_id":"2109.05093","n_code_links":3,"syntology":{"ran":6,"of":7,"n_ran_checked":5,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 3 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["ElementAI/picard"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}}],"papers_shown":18,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":18,"with_a_code_link":6,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":18,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":3,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":3,"papers_where_code_ran_first_page":"/method/picard/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/picard/papers/ran/1","json":"/method/picard/papers/ran/1.json","rows":3}],"tasks":[{"task":null,"name":"GPU","papers":2},{"task":"/task/semantic-parsing","name":"Semantic Parsing","papers":2},{"task":"/task/text-to-sql","name":"Text to SQL","papers":2},{"task":"/task/text-to-sql","name":"Text-To-SQL","papers":2},{"task":"/task/3d-generation","name":"3D Generation","papers":1},{"task":"/task/code-generation","name":"Code Generation","papers":1},{"task":"/task/denoising","name":"Denoising","papers":1},{"task":"/task/dialogue-state-tracking","name":"Dialogue State Tracking","papers":1},{"task":"/task/domain-adaptation","name":"Domain Adaptation","papers":1},{"task":"/task/eeg-1","name":"EEG","papers":1},{"task":"/task/eeg","name":"Electroencephalogram (EEG)","papers":1},{"task":"/task/image-generation","name":"Image Generation","papers":1},{"task":"/task/language-modeling","name":"Language Modeling","papers":1},{"task":"/task/language-modelling","name":"Language Modelling","papers":1},{"task":"/task/prediction","name":"Prediction","papers":1},{"task":"/task/state-space-models","name":"State Space Models","papers":1},{"task":"/task/structured-prediction","name":"Structured Prediction","papers":1},{"task":"/task/text-to-3d","name":"Text to 3D","papers":1},{"task":"/task/translation","name":"Translation","papers":1},{"task":"/task/blind-source-separation","name":"blind source separation","papers":1}],"tasks_shown":20,"n_tasks":22,"usage_by_year":[{"year":"2021","papers":1},{"year":"2022","papers":3},{"year":"2023","papers":5},{"year":"2024","papers":5},{"year":"2025","papers":4}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/picard"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=PICARD","read_at":"2026-10-05T01:00:17+00:00","query":"PICARD","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"PICARD","origin_arxiv_id":"2109.05093"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"2109.05093","repositories":{"listed":3,"in_graph":3,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2109.05093","citations":677},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'PICARD'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[{"name":"Parallel Sampling with Picard iterations","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='Parallel Sampling with Picard iterations')","origin_arxiv_id":"2405.15986"}],"code_nearby_caption":"Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.","origin_paper":{"arxiv_id":"2109.05093","page":"/paper/picard-parsing-incrementally-for-constrained","syntology_url":"https://syntology.ai/paper/2109.05093","in_graph_layer":true,"samples":7,"ran":6,"n_ran_checked":5,"n_instrument":1,"unverified":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 3 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"repository known, no verified implementation (declared_code; repositories: 3 listed of 3 in the graph, strongest link: official). This answer is about arXiv:2109.05093, the paper the archive credits with this method.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"eb4d3176986d9678344d7db8d05e82f96ca0f36300887cb9114fc030156df9a3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}