{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Y67ESX4NEFDRCBEPUXC3PRKTSP","short_pith_number":"pith:Y67ESX4N","schema_version":"1.0","canonical_sha256":"c7be495f8d214711048fa5c5b7c55393cabb6d125f14222b5cbce1497ee1988f","source":{"kind":"arxiv","id":"2401.08574","version":2},"attestation_state":"computed","paper":{"title":"Deductive Closure Training of Language Models for Coherence, Accuracy, and Updatability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Afra Feyza Aky\\\"urek, Derry Wijaya, Ekin Aky\\\"urek, Jacob Andreas, Leshem Choshen","submitted_at":"2024-01-16T18:58:37Z","abstract_excerpt":"While language models (LMs) can sometimes generate factually correct text and estimate truth values of individual claims, these generally do not reflect a globally coherent, manipulable model of the world. As a consequence, current LMs also generate incorrect or nonsensical content, and are difficult to edit and bring up to date. We present a method called Deductive Closure Training (DCT) that uses LMs themselves to identify implications of (and contradictions within) the text that they generate, yielding an efficient self-supervised procedure for improving LM factuality. Given a collection of"},"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":"2401.08574","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-01-16T18:58:37Z","cross_cats_sorted":[],"title_canon_sha256":"c112ae044a32abf5e0b1ac543dfab9252415bc7081a27bda367349a6ebbd9c16","abstract_canon_sha256":"c5e9a757ed314b69681a00195652708a19a2c9a7d60dc47d62c233996a08e5b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:16.495221Z","signature_b64":"puX2rC/8VBYluvNDj6pAHVFbpuxx5F227UFA6s55DRxQqxT0Oynb6ry+hVh5Umlw8k7exHualcUk+Y1r99LhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7be495f8d214711048fa5c5b7c55393cabb6d125f14222b5cbce1497ee1988f","last_reissued_at":"2026-07-05T08:37:16.494696Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:16.494696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deductive Closure Training of Language Models for Coherence, Accuracy, and Updatability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Afra Feyza Aky\\\"urek, Derry Wijaya, Ekin Aky\\\"urek, Jacob Andreas, Leshem Choshen","submitted_at":"2024-01-16T18:58:37Z","abstract_excerpt":"While language models (LMs) can sometimes generate factually correct text and estimate truth values of individual claims, these generally do not reflect a globally coherent, manipulable model of the world. As a consequence, current LMs also generate incorrect or nonsensical content, and are difficult to edit and bring up to date. We present a method called Deductive Closure Training (DCT) that uses LMs themselves to identify implications of (and contradictions within) the text that they generate, yielding an efficient self-supervised procedure for improving LM factuality. Given a collection of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.08574","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/2401.08574/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":"2401.08574","created_at":"2026-07-05T08:37:16.494773+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.08574v2","created_at":"2026-07-05T08:37:16.494773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.08574","created_at":"2026-07-05T08:37:16.494773+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y67ESX4NEFDR","created_at":"2026-07-05T08:37:16.494773+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y67ESX4NEFDRCBEP","created_at":"2026-07-05T08:37:16.494773+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y67ESX4N","created_at":"2026-07-05T08:37:16.494773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.14634","citing_title":"Human-LLM Compound System for Scientific Ideation through Facet Recombination and Novelty Evaluation","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09471","citing_title":"The Statistical Cost of Adaptation in Multi-Source Transfer Learning","ref_index":141,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y67ESX4NEFDRCBEPUXC3PRKTSP","json":"https://pith.science/pith/Y67ESX4NEFDRCBEPUXC3PRKTSP.json","graph_json":"https://pith.science/api/pith-number/Y67ESX4NEFDRCBEPUXC3PRKTSP/graph.json","events_json":"https://pith.science/api/pith-number/Y67ESX4NEFDRCBEPUXC3PRKTSP/events.json","paper":"https://pith.science/paper/Y67ESX4N"},"agent_actions":{"view_html":"https://pith.science/pith/Y67ESX4NEFDRCBEPUXC3PRKTSP","download_json":"https://pith.science/pith/Y67ESX4NEFDRCBEPUXC3PRKTSP.json","view_paper":"https://pith.science/paper/Y67ESX4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.08574&json=true","fetch_graph":"https://pith.science/api/pith-number/Y67ESX4NEFDRCBEPUXC3PRKTSP/graph.json","fetch_events":"https://pith.science/api/pith-number/Y67ESX4NEFDRCBEPUXC3PRKTSP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y67ESX4NEFDRCBEPUXC3PRKTSP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y67ESX4NEFDRCBEPUXC3PRKTSP/action/storage_attestation","attest_author":"https://pith.science/pith/Y67ESX4NEFDRCBEPUXC3PRKTSP/action/author_attestation","sign_citation":"https://pith.science/pith/Y67ESX4NEFDRCBEPUXC3PRKTSP/action/citation_signature","submit_replication":"https://pith.science/pith/Y67ESX4NEFDRCBEPUXC3PRKTSP/action/replication_record"}},"created_at":"2026-07-05T08:37:16.494773+00:00","updated_at":"2026-07-05T08:37:16.494773+00:00"}