{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:TRDU3YCOZ5FGRIAU5LAN22A22U","short_pith_number":"pith:TRDU3YCO","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"},"canonical_sha256":"9c474de04ecf4a68a014eac0dd681ad51a2991a5e2702ca915c8122dd1bd1577","source":{"kind":"arxiv","id":"2210.17095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.17095","created_at":"2026-07-05T05:11:54Z"},{"alias_kind":"arxiv_version","alias_value":"2210.17095v1","created_at":"2026-07-05T05:11:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.17095","created_at":"2026-07-05T05:11:54Z"},{"alias_kind":"pith_short_12","alias_value":"TRDU3YCOZ5FG","created_at":"2026-07-05T05:11:54Z"},{"alias_kind":"pith_short_16","alias_value":"TRDU3YCOZ5FGRIAU","created_at":"2026-07-05T05:11:54Z"},{"alias_kind":"pith_short_8","alias_value":"TRDU3YCO","created_at":"2026-07-05T05:11:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:TRDU3YCOZ5FGRIAU5LAN22A22U","target":"record","payload":{"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"},"canonical_sha256":"9c474de04ecf4a68a014eac0dd681ad51a2991a5e2702ca915c8122dd1bd1577","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"},"source_kind":"arxiv","source_id":"2210.17095","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:11:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"58bnWqxOYATSCoj1y3RqFXw7zto7LHUfvd5Y7O7zZJlIft4qjV8ijb308lT4NY38UDypj5xXUccGjQF82CufAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T04:50:32.034278Z"},"content_sha256":"7486ee65f96d9c9c9b4c77e61f0728bf6bec89f6073041aca534a1db62ec57b3","schema_version":"1.0","event_id":"sha256:7486ee65f96d9c9c9b4c77e61f0728bf6bec89f6073041aca534a1db62ec57b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:TRDU3YCOZ5FGRIAU5LAN22A22U","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:11:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uSv+xrppW+rdgBOgSWTreRw+SWnWLmTJ64MVQI5DPfYuRt1UPAItcs9ZMkvLMG2ayXHZUX7OdNgdrVqFFLJVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T04:50:32.034772Z"},"content_sha256":"85497d44027adb5f18336e2a498bf97f59578f1f396f17cd72cbab58f9adc5cb","schema_version":"1.0","event_id":"sha256:85497d44027adb5f18336e2a498bf97f59578f1f396f17cd72cbab58f9adc5cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TRDU3YCOZ5FGRIAU5LAN22A22U/bundle.json","state_url":"https://pith.science/pith/TRDU3YCOZ5FGRIAU5LAN22A22U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TRDU3YCOZ5FGRIAU5LAN22A22U/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T04:50:32Z","links":{"resolver":"https://pith.science/pith/TRDU3YCOZ5FGRIAU5LAN22A22U","bundle":"https://pith.science/pith/TRDU3YCOZ5FGRIAU5LAN22A22U/bundle.json","state":"https://pith.science/pith/TRDU3YCOZ5FGRIAU5LAN22A22U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TRDU3YCOZ5FGRIAU5LAN22A22U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:TRDU3YCOZ5FGRIAU5LAN22A22U","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d7b80fea20d354593f644371e3e60c07dbcbbd50e3654f2aa0c98379d7d14c14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-10-31T06:45:05Z","title_canon_sha256":"2d711e0554de6532ee18bce77d8edec29a57086c06479f3d70ccc52847ad2078"},"schema_version":"1.0","source":{"id":"2210.17095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.17095","created_at":"2026-07-05T05:11:54Z"},{"alias_kind":"arxiv_version","alias_value":"2210.17095v1","created_at":"2026-07-05T05:11:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.17095","created_at":"2026-07-05T05:11:54Z"},{"alias_kind":"pith_short_12","alias_value":"TRDU3YCOZ5FG","created_at":"2026-07-05T05:11:54Z"},{"alias_kind":"pith_short_16","alias_value":"TRDU3YCOZ5FGRIAU","created_at":"2026-07-05T05:11:54Z"},{"alias_kind":"pith_short_8","alias_value":"TRDU3YCO","created_at":"2026-07-05T05:11:54Z"}],"graph_snapshots":[{"event_id":"sha256:85497d44027adb5f18336e2a498bf97f59578f1f396f17cd72cbab58f9adc5cb","target":"graph","created_at":"2026-07-05T05:11:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.17095/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Qipeng Guo, Tengxiao Liu, Xiangkun Hu, Xipeng Qiu, Yue Zhang, Zheng Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-10-31T06:45:05Z","title":"RLET: A Reinforcement Learning Based Approach for Explainable QA with Entailment Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.17095","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7486ee65f96d9c9c9b4c77e61f0728bf6bec89f6073041aca534a1db62ec57b3","target":"record","created_at":"2026-07-05T05:11:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d7b80fea20d354593f644371e3e60c07dbcbbd50e3654f2aa0c98379d7d14c14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-10-31T06:45:05Z","title_canon_sha256":"2d711e0554de6532ee18bce77d8edec29a57086c06479f3d70ccc52847ad2078"},"schema_version":"1.0","source":{"id":"2210.17095","kind":"arxiv","version":1}},"canonical_sha256":"9c474de04ecf4a68a014eac0dd681ad51a2991a5e2702ca915c8122dd1bd1577","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c474de04ecf4a68a014eac0dd681ad51a2991a5e2702ca915c8122dd1bd1577","first_computed_at":"2026-07-05T05:11:54.956633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:11:54.956633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SyFWqaZ/Q2iuSi9juu2SXC9ifH6EPMR74heVuoDoZGr6avZ1z0EKAhYNbNYSgd3ldOxpYTdDIrcgMMmey/ibDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:11:54.957044Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.17095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7486ee65f96d9c9c9b4c77e61f0728bf6bec89f6073041aca534a1db62ec57b3","sha256:85497d44027adb5f18336e2a498bf97f59578f1f396f17cd72cbab58f9adc5cb"],"state_sha256":"9ca82f054cb49364d6c1f0d36a1085712087f70c334b6f8d54dc661f253f89ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ke181f1lwszVSIreC5gGINY2A+Ej6z5fC4M0p6iTID1aQAIPJZw0WlG3GZJ/RYDmL3PHlP/SZvrEenEGPO8QBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T04:50:32.038709Z","bundle_sha256":"decea04ce78f72c8dafb290e7d54448560627fb49b7b6248cd29048684ea756b"}}