{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:URI4PAGDHZ7W4Y2RUELVIVXVE7","short_pith_number":"pith:URI4PAGD","schema_version":"1.0","canonical_sha256":"a451c780c33e7f6e6351a1175456f527de54225a0c0cc3f78becf136e8d629c5","source":{"kind":"arxiv","id":"2012.13048","version":2},"attestation_state":"computed","paper":{"title":"ProofWriter: Generating Implications, Proofs, and Abductive Statements over Natural Language","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Bhavana Dalvi Mishra, Oyvind Tafjord, Peter Clark","submitted_at":"2020-12-24T00:55:46Z","abstract_excerpt":"Transformers have been shown to emulate logical deduction over natural language theories (logical rules expressed in natural language), reliably assigning true/false labels to candidate implications. However, their ability to generate implications of a theory has not yet been demonstrated, and methods for reconstructing proofs of answers are imperfect. In this work we show that a generative model, called ProofWriter, can reliably generate both implications of a theory and the natural language proof(s) that support them. In particular, iterating a 1-step implication generator results in proofs "},"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":"2012.13048","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-12-24T00:55:46Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6db879fb6c6798caa9e6bff34a423a553aa3294f0c2d997d7e44cccc5ea23822","abstract_canon_sha256":"07805db07910d5d6b01400487e493c8e154f63cb2050f11dc654d1d1a96a4143"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:46:11.577464Z","signature_b64":"WWzsOFMbD8D3aAqFcuNneaNP7yswc/G2sSA76+Ape4oWNy9LRAHC2K1YClsim0QFE7loGFFN/T7YUEUsmXdOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a451c780c33e7f6e6351a1175456f527de54225a0c0cc3f78becf136e8d629c5","last_reissued_at":"2026-07-05T02:46:11.577036Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:46:11.577036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ProofWriter: Generating Implications, Proofs, and Abductive Statements over Natural Language","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Bhavana Dalvi Mishra, Oyvind Tafjord, Peter Clark","submitted_at":"2020-12-24T00:55:46Z","abstract_excerpt":"Transformers have been shown to emulate logical deduction over natural language theories (logical rules expressed in natural language), reliably assigning true/false labels to candidate implications. However, their ability to generate implications of a theory has not yet been demonstrated, and methods for reconstructing proofs of answers are imperfect. In this work we show that a generative model, called ProofWriter, can reliably generate both implications of a theory and the natural language proof(s) that support them. In particular, iterating a 1-step implication generator results in proofs "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.13048","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/2012.13048/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":"2012.13048","created_at":"2026-07-05T02:46:11.577089+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.13048v2","created_at":"2026-07-05T02:46:11.577089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.13048","created_at":"2026-07-05T02:46:11.577089+00:00"},{"alias_kind":"pith_short_12","alias_value":"URI4PAGDHZ7W","created_at":"2026-07-05T02:46:11.577089+00:00"},{"alias_kind":"pith_short_16","alias_value":"URI4PAGDHZ7W4Y2R","created_at":"2026-07-05T02:46:11.577089+00:00"},{"alias_kind":"pith_short_8","alias_value":"URI4PAGD","created_at":"2026-07-05T02:46:11.577089+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2211.14275","citing_title":"Solving math word problems with process- and outcome-based feedback","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2507.15707","citing_title":"Is Large Language Model Performance on Reasoning Tasks Impacted by Different Ways Questions Are Asked?","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2509.24765","citing_title":"Semantic-Aware Logical Reasoning via a Semiotic Framework","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2309.11495","citing_title":"Chain-of-Verification Reduces Hallucination in Large Language Models","ref_index":76,"is_internal_anchor":false},{"citing_arxiv_id":"2305.14992","citing_title":"Reasoning with Language Model is Planning with World Model","ref_index":64,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/URI4PAGDHZ7W4Y2RUELVIVXVE7","json":"https://pith.science/pith/URI4PAGDHZ7W4Y2RUELVIVXVE7.json","graph_json":"https://pith.science/api/pith-number/URI4PAGDHZ7W4Y2RUELVIVXVE7/graph.json","events_json":"https://pith.science/api/pith-number/URI4PAGDHZ7W4Y2RUELVIVXVE7/events.json","paper":"https://pith.science/paper/URI4PAGD"},"agent_actions":{"view_html":"https://pith.science/pith/URI4PAGDHZ7W4Y2RUELVIVXVE7","download_json":"https://pith.science/pith/URI4PAGDHZ7W4Y2RUELVIVXVE7.json","view_paper":"https://pith.science/paper/URI4PAGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.13048&json=true","fetch_graph":"https://pith.science/api/pith-number/URI4PAGDHZ7W4Y2RUELVIVXVE7/graph.json","fetch_events":"https://pith.science/api/pith-number/URI4PAGDHZ7W4Y2RUELVIVXVE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/URI4PAGDHZ7W4Y2RUELVIVXVE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/URI4PAGDHZ7W4Y2RUELVIVXVE7/action/storage_attestation","attest_author":"https://pith.science/pith/URI4PAGDHZ7W4Y2RUELVIVXVE7/action/author_attestation","sign_citation":"https://pith.science/pith/URI4PAGDHZ7W4Y2RUELVIVXVE7/action/citation_signature","submit_replication":"https://pith.science/pith/URI4PAGDHZ7W4Y2RUELVIVXVE7/action/replication_record"}},"created_at":"2026-07-05T02:46:11.577089+00:00","updated_at":"2026-07-05T02:46:11.577089+00:00"}