{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZOAKXD6QHLEUUBL3LFQLRCS5RC","short_pith_number":"pith:ZOAKXD6Q","schema_version":"1.0","canonical_sha256":"cb80ab8fd03ac94a057b5960b88a5d88aa9816c7b25a4053abfd376034670c0a","source":{"kind":"arxiv","id":"1907.06226","version":5},"attestation_state":"computed","paper":{"title":"Lexical Simplification with Pretrained Encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.CL","authors_text":"Jipeng Qiang, Xindong Wu, Yi Zhu, Yunhao Yuan, Yun Li","submitted_at":"2019-07-14T14:19:22Z","abstract_excerpt":"Lexical simplification (LS) aims to replace complex words in a given sentence with their simpler alternatives of equivalent meaning. Recently unsupervised lexical simplification approaches only rely on the complex word itself regardless of the given sentence to generate candidate substitutions, which will inevitably produce a large number of spurious candidates. We present a simple LS approach that makes use of the Bidirectional Encoder Representations from Transformers (BERT) which can consider both the given sentence and the complex word during generating candidate substitutions for the comp"},"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":"1907.06226","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-07-14T14:19:22Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"0b65f1ebb74209a316b5c4088a35fcc5ff239cccd2319bc16fcf06bd475fb89a","abstract_canon_sha256":"69cf3bd23d2e275e0d8a4e546de44062d7fd0fd7d1568e8e0b4e4abe08417f22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:47:28.740803Z","signature_b64":"cg5eBW916bjcNCDGzuDf3GMbDIXtnJWJaHhV5KBaq8lt/ZN+jWMMJO8vXQRgqKOIK73UtHuTA++72jyphpB/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb80ab8fd03ac94a057b5960b88a5d88aa9816c7b25a4053abfd376034670c0a","last_reissued_at":"2026-07-05T01:47:28.740301Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:47:28.740301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lexical Simplification with Pretrained Encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.CL","authors_text":"Jipeng Qiang, Xindong Wu, Yi Zhu, Yunhao Yuan, Yun Li","submitted_at":"2019-07-14T14:19:22Z","abstract_excerpt":"Lexical simplification (LS) aims to replace complex words in a given sentence with their simpler alternatives of equivalent meaning. Recently unsupervised lexical simplification approaches only rely on the complex word itself regardless of the given sentence to generate candidate substitutions, which will inevitably produce a large number of spurious candidates. We present a simple LS approach that makes use of the Bidirectional Encoder Representations from Transformers (BERT) which can consider both the given sentence and the complex word during generating candidate substitutions for the comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06226","kind":"arxiv","version":5},"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/1907.06226/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":"1907.06226","created_at":"2026-07-05T01:47:28.740365+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.06226v5","created_at":"2026-07-05T01:47:28.740365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06226","created_at":"2026-07-05T01:47:28.740365+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOAKXD6QHLEU","created_at":"2026-07-05T01:47:28.740365+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOAKXD6QHLEUUBL3","created_at":"2026-07-05T01:47:28.740365+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOAKXD6Q","created_at":"2026-07-05T01:47:28.740365+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.02339","citing_title":"Specializing Unsupervised Pretraining Models for Word-Level Semantic Similarity","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZOAKXD6QHLEUUBL3LFQLRCS5RC","json":"https://pith.science/pith/ZOAKXD6QHLEUUBL3LFQLRCS5RC.json","graph_json":"https://pith.science/api/pith-number/ZOAKXD6QHLEUUBL3LFQLRCS5RC/graph.json","events_json":"https://pith.science/api/pith-number/ZOAKXD6QHLEUUBL3LFQLRCS5RC/events.json","paper":"https://pith.science/paper/ZOAKXD6Q"},"agent_actions":{"view_html":"https://pith.science/pith/ZOAKXD6QHLEUUBL3LFQLRCS5RC","download_json":"https://pith.science/pith/ZOAKXD6QHLEUUBL3LFQLRCS5RC.json","view_paper":"https://pith.science/paper/ZOAKXD6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.06226&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOAKXD6QHLEUUBL3LFQLRCS5RC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOAKXD6QHLEUUBL3LFQLRCS5RC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOAKXD6QHLEUUBL3LFQLRCS5RC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOAKXD6QHLEUUBL3LFQLRCS5RC/action/storage_attestation","attest_author":"https://pith.science/pith/ZOAKXD6QHLEUUBL3LFQLRCS5RC/action/author_attestation","sign_citation":"https://pith.science/pith/ZOAKXD6QHLEUUBL3LFQLRCS5RC/action/citation_signature","submit_replication":"https://pith.science/pith/ZOAKXD6QHLEUUBL3LFQLRCS5RC/action/replication_record"}},"created_at":"2026-07-05T01:47:28.740365+00:00","updated_at":"2026-07-05T01:47:28.740365+00:00"}