{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:TRDU3YCOZ5FGRIAU5LAN22A22U","short_pith_number":"pith:TRDU3YCO","schema_version":"1.0","canonical_sha256":"9c474de04ecf4a68a014eac0dd681ad51a2991a5e2702ca915c8122dd1bd1577","source":{"kind":"arxiv","id":"2210.17095","version":1},"attestation_state":"computed","paper":{"title":"RLET: A Reinforcement Learning Based Approach for Explainable QA with Entailment Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Qipeng Guo, Tengxiao Liu, Xiangkun Hu, Xipeng Qiu, Yue Zhang, Zheng Zhang","submitted_at":"2022-10-31T06:45:05Z","abstract_excerpt":"Interpreting the reasoning process from questions to answers poses a challenge in approaching explainable QA. A recently proposed structured reasoning format, entailment tree, manages to offer explicit logical deductions with entailment steps in a tree structure. To generate entailment trees, prior single pass sequence-to-sequence models lack visible internal decision probability, while stepwise approaches are supervised with extracted single step data and cannot model the tree as a whole. In this work, we propose RLET, a Reinforcement Learning based Entailment Tree generation framework, which"},"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":"2210.17095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-10-31T06:45:05Z","cross_cats_sorted":[],"title_canon_sha256":"2d711e0554de6532ee18bce77d8edec29a57086c06479f3d70ccc52847ad2078","abstract_canon_sha256":"d7b80fea20d354593f644371e3e60c07dbcbbd50e3654f2aa0c98379d7d14c14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:11:54.957044Z","signature_b64":"SyFWqaZ/Q2iuSi9juu2SXC9ifH6EPMR74heVuoDoZGr6avZ1z0EKAhYNbNYSgd3ldOxpYTdDIrcgMMmey/ibDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c474de04ecf4a68a014eac0dd681ad51a2991a5e2702ca915c8122dd1bd1577","last_reissued_at":"2026-07-05T05:11:54.956633Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:11:54.956633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RLET: A Reinforcement Learning Based Approach for Explainable QA with Entailment Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Qipeng Guo, Tengxiao Liu, Xiangkun Hu, Xipeng Qiu, Yue Zhang, Zheng Zhang","submitted_at":"2022-10-31T06:45:05Z","abstract_excerpt":"Interpreting the reasoning process from questions to answers poses a challenge in approaching explainable QA. A recently proposed structured reasoning format, entailment tree, manages to offer explicit logical deductions with entailment steps in a tree structure. To generate entailment trees, prior single pass sequence-to-sequence models lack visible internal decision probability, while stepwise approaches are supervised with extracted single step data and cannot model the tree as a whole. In this work, we propose RLET, a Reinforcement Learning based Entailment Tree generation framework, which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.17095","kind":"arxiv","version":1},"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/2210.17095/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":"2210.17095","created_at":"2026-07-05T05:11:54.956694+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.17095v1","created_at":"2026-07-05T05:11:54.956694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.17095","created_at":"2026-07-05T05:11:54.956694+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRDU3YCOZ5FG","created_at":"2026-07-05T05:11:54.956694+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRDU3YCOZ5FGRIAU","created_at":"2026-07-05T05:11:54.956694+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRDU3YCO","created_at":"2026-07-05T05:11:54.956694+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRDU3YCOZ5FGRIAU5LAN22A22U","json":"https://pith.science/pith/TRDU3YCOZ5FGRIAU5LAN22A22U.json","graph_json":"https://pith.science/api/pith-number/TRDU3YCOZ5FGRIAU5LAN22A22U/graph.json","events_json":"https://pith.science/api/pith-number/TRDU3YCOZ5FGRIAU5LAN22A22U/events.json","paper":"https://pith.science/paper/TRDU3YCO"},"agent_actions":{"view_html":"https://pith.science/pith/TRDU3YCOZ5FGRIAU5LAN22A22U","download_json":"https://pith.science/pith/TRDU3YCOZ5FGRIAU5LAN22A22U.json","view_paper":"https://pith.science/paper/TRDU3YCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.17095&json=true","fetch_graph":"https://pith.science/api/pith-number/TRDU3YCOZ5FGRIAU5LAN22A22U/graph.json","fetch_events":"https://pith.science/api/pith-number/TRDU3YCOZ5FGRIAU5LAN22A22U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRDU3YCOZ5FGRIAU5LAN22A22U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRDU3YCOZ5FGRIAU5LAN22A22U/action/storage_attestation","attest_author":"https://pith.science/pith/TRDU3YCOZ5FGRIAU5LAN22A22U/action/author_attestation","sign_citation":"https://pith.science/pith/TRDU3YCOZ5FGRIAU5LAN22A22U/action/citation_signature","submit_replication":"https://pith.science/pith/TRDU3YCOZ5FGRIAU5LAN22A22U/action/replication_record"}},"created_at":"2026-07-05T05:11:54.956694+00:00","updated_at":"2026-07-05T05:11:54.956694+00:00"}