{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HMUS4A2KGS4TXTSQWFHMWBP5U4","short_pith_number":"pith:HMUS4A2K","schema_version":"1.0","canonical_sha256":"3b292e034a34b93bce50b14ecb05fda717d0943819a94945f50d8456100b51b4","source":{"kind":"arxiv","id":"2209.08285","version":2},"attestation_state":"computed","paper":{"title":"FR: Folded Rationalization with a Unified Encoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Chao Yue, Haozhao Wang, Jun Wang, Ruixuan Li, Wei Liu, Yuankai Zhang","submitted_at":"2022-09-17T08:49:45Z","abstract_excerpt":"Conventional works generally employ a two-phase model in which a generator selects the most important pieces, followed by a predictor that makes predictions based on the selected pieces. However, such a two-phase model may incur the degeneration problem where the predictor overfits to the noise generated by a not yet well-trained generator and in turn, leads the generator to converge to a sub-optimal model that tends to select senseless pieces. To tackle this challenge, we propose Folded Rationalization (FR) that folds the two phases of the rationale model into one from the perspective of text"},"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":"2209.08285","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-17T08:49:45Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"a277cf677e2b60fde5740c772cf51cf4f7a8da51ccfefb74256b5c9ee6fa7ba8","abstract_canon_sha256":"088bdf93daff72b81fcdcb903e9346dbf20340f3318bdccc873deff526842d67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:58:57.341244Z","signature_b64":"cYXlqTBMg0izga+PEea0KQchpHAxj40MqZiIRAHH26XNE0oBFlS5tujgcmMP8gx/3hrXTVp4KwnP0KwuJEL/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b292e034a34b93bce50b14ecb05fda717d0943819a94945f50d8456100b51b4","last_reissued_at":"2026-07-05T04:58:57.340745Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:58:57.340745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FR: Folded Rationalization with a Unified Encoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Chao Yue, Haozhao Wang, Jun Wang, Ruixuan Li, Wei Liu, Yuankai Zhang","submitted_at":"2022-09-17T08:49:45Z","abstract_excerpt":"Conventional works generally employ a two-phase model in which a generator selects the most important pieces, followed by a predictor that makes predictions based on the selected pieces. However, such a two-phase model may incur the degeneration problem where the predictor overfits to the noise generated by a not yet well-trained generator and in turn, leads the generator to converge to a sub-optimal model that tends to select senseless pieces. To tackle this challenge, we propose Folded Rationalization (FR) that folds the two phases of the rationale model into one from the perspective of text"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.08285","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/2209.08285/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":"2209.08285","created_at":"2026-07-05T04:58:57.340805+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.08285v2","created_at":"2026-07-05T04:58:57.340805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.08285","created_at":"2026-07-05T04:58:57.340805+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMUS4A2KGS4T","created_at":"2026-07-05T04:58:57.340805+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMUS4A2KGS4TXTSQ","created_at":"2026-07-05T04:58:57.340805+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMUS4A2K","created_at":"2026-07-05T04:58:57.340805+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.22769","citing_title":"Learning Efficient Robotic Garment Manipulation with Standardization","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HMUS4A2KGS4TXTSQWFHMWBP5U4","json":"https://pith.science/pith/HMUS4A2KGS4TXTSQWFHMWBP5U4.json","graph_json":"https://pith.science/api/pith-number/HMUS4A2KGS4TXTSQWFHMWBP5U4/graph.json","events_json":"https://pith.science/api/pith-number/HMUS4A2KGS4TXTSQWFHMWBP5U4/events.json","paper":"https://pith.science/paper/HMUS4A2K"},"agent_actions":{"view_html":"https://pith.science/pith/HMUS4A2KGS4TXTSQWFHMWBP5U4","download_json":"https://pith.science/pith/HMUS4A2KGS4TXTSQWFHMWBP5U4.json","view_paper":"https://pith.science/paper/HMUS4A2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.08285&json=true","fetch_graph":"https://pith.science/api/pith-number/HMUS4A2KGS4TXTSQWFHMWBP5U4/graph.json","fetch_events":"https://pith.science/api/pith-number/HMUS4A2KGS4TXTSQWFHMWBP5U4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMUS4A2KGS4TXTSQWFHMWBP5U4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMUS4A2KGS4TXTSQWFHMWBP5U4/action/storage_attestation","attest_author":"https://pith.science/pith/HMUS4A2KGS4TXTSQWFHMWBP5U4/action/author_attestation","sign_citation":"https://pith.science/pith/HMUS4A2KGS4TXTSQWFHMWBP5U4/action/citation_signature","submit_replication":"https://pith.science/pith/HMUS4A2KGS4TXTSQWFHMWBP5U4/action/replication_record"}},"created_at":"2026-07-05T04:58:57.340805+00:00","updated_at":"2026-07-05T04:58:57.340805+00:00"}