{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:H5BZYMAKO7RR444PCPNXMQIZUV","short_pith_number":"pith:H5BZYMAK","schema_version":"1.0","canonical_sha256":"3f439c300a77e31e738f13db764119a56350783a327557d5a1bcf73cac6ae41b","source":{"kind":"arxiv","id":"2205.11822","version":2},"attestation_state":"computed","paper":{"title":"Maieutic Prompting: Logically Consistent Reasoning with Recursive Explanations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chandra Bhagavatula, Faeze Brahman, Jaehun Jung, Lianhui Qin, Ronan Le Bras, Sean Welleck, Yejin Choi","submitted_at":"2022-05-24T06:36:42Z","abstract_excerpt":"Despite their impressive capabilities, large pre-trained language models (LMs) struggle with consistent reasoning; recently, prompting LMs to generate explanations that self-guide the inference has emerged as a promising direction to amend this. However, these approaches are fundamentally bounded by the correctness of explanations, which themselves are often noisy and inconsistent. In this work, we develop Maieutic Prompting, which infers a correct answer to a question even from the noisy and inconsistent generations of LM. Maieutic Prompting induces a tree of explanations abductively (e.g. X "},"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":"2205.11822","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-05-24T06:36:42Z","cross_cats_sorted":[],"title_canon_sha256":"3d62f88f00c3e6c90f0bd7c521cb3d53ab7a11d165b3df098bb2369e571e238e","abstract_canon_sha256":"d69c0209af24156387a5a9eba598187331c3f0abfee18fa03f238d8511684251"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:09:59.192406Z","signature_b64":"3xtYOuoXbumdClkkY3nEJKzXPFa+43ZhVbVoP8/CoxiEuP/brOSR3ey5w0mzjyd1e37Ihx7txU4cCGlRvxfPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f439c300a77e31e738f13db764119a56350783a327557d5a1bcf73cac6ae41b","last_reissued_at":"2026-07-05T05:09:59.191911Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:09:59.191911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maieutic Prompting: Logically Consistent Reasoning with Recursive Explanations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chandra Bhagavatula, Faeze Brahman, Jaehun Jung, Lianhui Qin, Ronan Le Bras, Sean Welleck, Yejin Choi","submitted_at":"2022-05-24T06:36:42Z","abstract_excerpt":"Despite their impressive capabilities, large pre-trained language models (LMs) struggle with consistent reasoning; recently, prompting LMs to generate explanations that self-guide the inference has emerged as a promising direction to amend this. However, these approaches are fundamentally bounded by the correctness of explanations, which themselves are often noisy and inconsistent. In this work, we develop Maieutic Prompting, which infers a correct answer to a question even from the noisy and inconsistent generations of LM. Maieutic Prompting induces a tree of explanations abductively (e.g. X "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.11822","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/2205.11822/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":"2205.11822","created_at":"2026-07-05T05:09:59.191972+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.11822v2","created_at":"2026-07-05T05:09:59.191972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.11822","created_at":"2026-07-05T05:09:59.191972+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5BZYMAKO7RR","created_at":"2026-07-05T05:09:59.191972+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5BZYMAKO7RR444P","created_at":"2026-07-05T05:09:59.191972+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5BZYMAK","created_at":"2026-07-05T05:09:59.191972+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2210.11610","citing_title":"Large Language Models Can Self-Improve","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2305.14992","citing_title":"Reasoning with Language Model is Planning with World Model","ref_index":90,"is_internal_anchor":false},{"citing_arxiv_id":"2212.03827","citing_title":"Discovering Latent Knowledge in Language Models Without Supervision","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2302.11382","citing_title":"A Prompt Pattern Catalog to Enhance Prompt Engineering with ChatGPT","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2305.10601","citing_title":"Tree of Thoughts: Deliberate Problem Solving with Large Language Models","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H5BZYMAKO7RR444PCPNXMQIZUV","json":"https://pith.science/pith/H5BZYMAKO7RR444PCPNXMQIZUV.json","graph_json":"https://pith.science/api/pith-number/H5BZYMAKO7RR444PCPNXMQIZUV/graph.json","events_json":"https://pith.science/api/pith-number/H5BZYMAKO7RR444PCPNXMQIZUV/events.json","paper":"https://pith.science/paper/H5BZYMAK"},"agent_actions":{"view_html":"https://pith.science/pith/H5BZYMAKO7RR444PCPNXMQIZUV","download_json":"https://pith.science/pith/H5BZYMAKO7RR444PCPNXMQIZUV.json","view_paper":"https://pith.science/paper/H5BZYMAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.11822&json=true","fetch_graph":"https://pith.science/api/pith-number/H5BZYMAKO7RR444PCPNXMQIZUV/graph.json","fetch_events":"https://pith.science/api/pith-number/H5BZYMAKO7RR444PCPNXMQIZUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5BZYMAKO7RR444PCPNXMQIZUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5BZYMAKO7RR444PCPNXMQIZUV/action/storage_attestation","attest_author":"https://pith.science/pith/H5BZYMAKO7RR444PCPNXMQIZUV/action/author_attestation","sign_citation":"https://pith.science/pith/H5BZYMAKO7RR444PCPNXMQIZUV/action/citation_signature","submit_replication":"https://pith.science/pith/H5BZYMAKO7RR444PCPNXMQIZUV/action/replication_record"}},"created_at":"2026-07-05T05:09:59.191972+00:00","updated_at":"2026-07-05T05:09:59.191972+00:00"}