{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ODGL4ADJGM3BW2AWVXHXQOEJDO","short_pith_number":"pith:ODGL4ADJ","canonical_record":{"source":{"id":"1810.05104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-11T16:14:24Z","cross_cats_sorted":[],"title_canon_sha256":"de5a9ff5acdcafe92bebb29c8417a21a9ed4e7b83e9c471cc848dfba922163d1","abstract_canon_sha256":"185e7c14fb730aaeaa4abed7c63c01f6b9f1ebb63dff1c63bbe2f0ae39d3644c"},"schema_version":"1.0"},"canonical_sha256":"70ccbe006933361b6816adcf7838891b977185c9f722ee0488dad0ad3bd154fd","source":{"kind":"arxiv","id":"1810.05104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05104","created_at":"2026-05-18T00:03:34Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05104v1","created_at":"2026-05-18T00:03:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05104","created_at":"2026-05-18T00:03:34Z"},{"alias_kind":"pith_short_12","alias_value":"ODGL4ADJGM3B","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"ODGL4ADJGM3BW2AW","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"ODGL4ADJ","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ODGL4ADJGM3BW2AWVXHXQOEJDO","target":"record","payload":{"canonical_record":{"source":{"id":"1810.05104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-11T16:14:24Z","cross_cats_sorted":[],"title_canon_sha256":"de5a9ff5acdcafe92bebb29c8417a21a9ed4e7b83e9c471cc848dfba922163d1","abstract_canon_sha256":"185e7c14fb730aaeaa4abed7c63c01f6b9f1ebb63dff1c63bbe2f0ae39d3644c"},"schema_version":"1.0"},"canonical_sha256":"70ccbe006933361b6816adcf7838891b977185c9f722ee0488dad0ad3bd154fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:34.861632Z","signature_b64":"r3DrBBue9eeQ40szqGhJ8p7F6SRf0LGTipMz/utGW3905Cj+R5COfHOZBgoAFoqf4++wiQD30kEuhwnnB20dCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70ccbe006933361b6816adcf7838891b977185c9f722ee0488dad0ad3bd154fd","last_reissued_at":"2026-05-18T00:03:34.861222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:34.861222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.05104","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-05-18T00:03:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uWEPs41DojlQA11jARPoFoR7IAYWj4pykGmi+3Car4dxw1QD36WAj+gZW8zASqs64wt3T2k+702lw/yiV5s2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:23:05.489563Z"},"content_sha256":"4afa81f449ec76edd39126996fc7503bebf06d8ec41356e8e7043f70861c101d","schema_version":"1.0","event_id":"sha256:4afa81f449ec76edd39126996fc7503bebf06d8ec41356e8e7043f70861c101d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ODGL4ADJGM3BW2AWVXHXQOEJDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple and Effective Text Simplification Using Semantic and Neural Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ari Rappoport, Elior Sulem, Omri Abend","submitted_at":"2018-10-11T16:14:24Z","abstract_excerpt":"Sentence splitting is a major simplification operator. Here we present a simple and efficient splitting algorithm based on an automatic semantic parser. After splitting, the text is amenable for further fine-tuned simplification operations. In particular, we show that neural Machine Translation can be effectively used in this situation. Previous application of Machine Translation for simplification suffers from a considerable disadvantage in that they are over-conservative, often failing to modify the source in any way. Splitting based on semantic parsing, as proposed here, alleviates this iss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05104","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":""},"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-05-18T00:03:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8HDZiHz29jx8f0IuYZLgJhaZqfxJBjCnW0DYEABn6gZuYr4ZgxLlTFMP2mgcwUatCYvnVGDhStIe00lQiMuBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:23:05.490034Z"},"content_sha256":"08a6d10ac031e97a10d8f430b25ef2d26925051169f8e89aed2461980bc394b1","schema_version":"1.0","event_id":"sha256:08a6d10ac031e97a10d8f430b25ef2d26925051169f8e89aed2461980bc394b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODGL4ADJGM3BW2AWVXHXQOEJDO/bundle.json","state_url":"https://pith.science/pith/ODGL4ADJGM3BW2AWVXHXQOEJDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODGL4ADJGM3BW2AWVXHXQOEJDO/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-05-27T11:23:05Z","links":{"resolver":"https://pith.science/pith/ODGL4ADJGM3BW2AWVXHXQOEJDO","bundle":"https://pith.science/pith/ODGL4ADJGM3BW2AWVXHXQOEJDO/bundle.json","state":"https://pith.science/pith/ODGL4ADJGM3BW2AWVXHXQOEJDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODGL4ADJGM3BW2AWVXHXQOEJDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ODGL4ADJGM3BW2AWVXHXQOEJDO","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":"185e7c14fb730aaeaa4abed7c63c01f6b9f1ebb63dff1c63bbe2f0ae39d3644c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-11T16:14:24Z","title_canon_sha256":"de5a9ff5acdcafe92bebb29c8417a21a9ed4e7b83e9c471cc848dfba922163d1"},"schema_version":"1.0","source":{"id":"1810.05104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05104","created_at":"2026-05-18T00:03:34Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05104v1","created_at":"2026-05-18T00:03:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05104","created_at":"2026-05-18T00:03:34Z"},{"alias_kind":"pith_short_12","alias_value":"ODGL4ADJGM3B","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"ODGL4ADJGM3BW2AW","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"ODGL4ADJ","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:08a6d10ac031e97a10d8f430b25ef2d26925051169f8e89aed2461980bc394b1","target":"graph","created_at":"2026-05-18T00:03:34Z","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"},"paper":{"abstract_excerpt":"Sentence splitting is a major simplification operator. Here we present a simple and efficient splitting algorithm based on an automatic semantic parser. After splitting, the text is amenable for further fine-tuned simplification operations. In particular, we show that neural Machine Translation can be effectively used in this situation. Previous application of Machine Translation for simplification suffers from a considerable disadvantage in that they are over-conservative, often failing to modify the source in any way. Splitting based on semantic parsing, as proposed here, alleviates this iss","authors_text":"Ari Rappoport, Elior Sulem, Omri Abend","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-11T16:14:24Z","title":"Simple and Effective Text Simplification Using Semantic and Neural Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05104","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:4afa81f449ec76edd39126996fc7503bebf06d8ec41356e8e7043f70861c101d","target":"record","created_at":"2026-05-18T00:03:34Z","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":"185e7c14fb730aaeaa4abed7c63c01f6b9f1ebb63dff1c63bbe2f0ae39d3644c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-11T16:14:24Z","title_canon_sha256":"de5a9ff5acdcafe92bebb29c8417a21a9ed4e7b83e9c471cc848dfba922163d1"},"schema_version":"1.0","source":{"id":"1810.05104","kind":"arxiv","version":1}},"canonical_sha256":"70ccbe006933361b6816adcf7838891b977185c9f722ee0488dad0ad3bd154fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70ccbe006933361b6816adcf7838891b977185c9f722ee0488dad0ad3bd154fd","first_computed_at":"2026-05-18T00:03:34.861222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:34.861222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r3DrBBue9eeQ40szqGhJ8p7F6SRf0LGTipMz/utGW3905Cj+R5COfHOZBgoAFoqf4++wiQD30kEuhwnnB20dCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:34.861632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4afa81f449ec76edd39126996fc7503bebf06d8ec41356e8e7043f70861c101d","sha256:08a6d10ac031e97a10d8f430b25ef2d26925051169f8e89aed2461980bc394b1"],"state_sha256":"68b8bbb1f22667dce9142fb7bfe2872cd3e598657a074de6e5d90fdd6224da69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ja4EamfLpS3RVTFnKlvCQ5Z9FTxowBF6CX0x/rUaV7avez2ckn8G4cB862AblNC5eJoIMDlIBtZMbVPJNxxXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:23:05.493313Z","bundle_sha256":"23aa25675c6bea68ea286038bee7248d5ec3e1766c9984948918ffdda83a4997"}}