{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JMH433EH6B4KRAUFRXPAFZV5CS","short_pith_number":"pith:JMH433EH","canonical_record":{"source":{"id":"1902.07248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-02-13T05:43:00Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"bdd1ff0ba6578540365be58d02e47655e15636492465dac75aa6b67dcfedb720","abstract_canon_sha256":"4256b7a31ecb56c1de9d54ab1ed156dd9453eaab05794fff4556902a28443067"},"schema_version":"1.0"},"canonical_sha256":"4b0fcdec87f078a882858dde02e6bd1485a97aa42f3354c12d6059bdabf61566","source":{"kind":"arxiv","id":"1902.07248","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07248","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07248v1","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07248","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"JMH433EH6B4K","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JMH433EH6B4KRAUF","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JMH433EH","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JMH433EH6B4KRAUFRXPAFZV5CS","target":"record","payload":{"canonical_record":{"source":{"id":"1902.07248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-02-13T05:43:00Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"bdd1ff0ba6578540365be58d02e47655e15636492465dac75aa6b67dcfedb720","abstract_canon_sha256":"4256b7a31ecb56c1de9d54ab1ed156dd9453eaab05794fff4556902a28443067"},"schema_version":"1.0"},"canonical_sha256":"4b0fcdec87f078a882858dde02e6bd1485a97aa42f3354c12d6059bdabf61566","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:08.486424Z","signature_b64":"AJmOqc/eQ1WESGPgd+TOr+MK8UmEehWkieccr3sGQoPh/MA7vYzEzNMdepVv+fdOlud3t6XX1ycK8D+Tu618Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b0fcdec87f078a882858dde02e6bd1485a97aa42f3354c12d6059bdabf61566","last_reissued_at":"2026-05-17T23:53:08.485776Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:08.485776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.07248","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-17T23:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tFJ6+BQQ3nVBOwItjg7/u2QT8xhd7qhfuBAYlvgp1cC0SOuUzczv9iZe0VTKZH+Icp3A3Sl65iRy3r2jfbtfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:19:05.815919Z"},"content_sha256":"85052e85506699dcda4227b71ef0f96f75fa23bda541f7cd92c07c7d1c40da1c","schema_version":"1.0","event_id":"sha256:85052e85506699dcda4227b71ef0f96f75fa23bda541f7cd92c07c7d1c40da1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JMH433EH6B4KRAUFRXPAFZV5CS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sentence Compression via DC Programming Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CL","authors_text":"Faouzi Mohamed Benammour, Hu Zhang, Xi-Wei Hu, Yi-Shuai Niu, Yu You","submitted_at":"2019-02-13T05:43:00Z","abstract_excerpt":"Sentence compression is an important problem in natural language processing. In this paper, we firstly establish a new sentence compression model based on the probability model and the parse tree model. Our sentence compression model is equivalent to an integer linear program (ILP) which can both guarantee the syntax correctness of the compression and save the main meaning. We propose using a DC (Difference of convex) programming approach (DCA) for finding local optimal solution of our model. Combing DCA with a parallel-branch-and-bound framework, we can find global optimal solution. Numerical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07248","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-17T23:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1PqYFpsxhaVWIS5sotoG4E8idK6i5EGTFG/3DeJGVNGB5zVsX8HsFY+BPmjnRPDNRigCZxlNv92+Aj1KYXDXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:19:05.816675Z"},"content_sha256":"a22693677ef38cc580a22667051eb43542326d31510679d791aa0e9ef5e820f0","schema_version":"1.0","event_id":"sha256:a22693677ef38cc580a22667051eb43542326d31510679d791aa0e9ef5e820f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JMH433EH6B4KRAUFRXPAFZV5CS/bundle.json","state_url":"https://pith.science/pith/JMH433EH6B4KRAUFRXPAFZV5CS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JMH433EH6B4KRAUFRXPAFZV5CS/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-25T21:19:05Z","links":{"resolver":"https://pith.science/pith/JMH433EH6B4KRAUFRXPAFZV5CS","bundle":"https://pith.science/pith/JMH433EH6B4KRAUFRXPAFZV5CS/bundle.json","state":"https://pith.science/pith/JMH433EH6B4KRAUFRXPAFZV5CS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JMH433EH6B4KRAUFRXPAFZV5CS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JMH433EH6B4KRAUFRXPAFZV5CS","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":"4256b7a31ecb56c1de9d54ab1ed156dd9453eaab05794fff4556902a28443067","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-02-13T05:43:00Z","title_canon_sha256":"bdd1ff0ba6578540365be58d02e47655e15636492465dac75aa6b67dcfedb720"},"schema_version":"1.0","source":{"id":"1902.07248","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07248","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07248v1","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07248","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"JMH433EH6B4K","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JMH433EH6B4KRAUF","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JMH433EH","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:a22693677ef38cc580a22667051eb43542326d31510679d791aa0e9ef5e820f0","target":"graph","created_at":"2026-05-17T23:53:08Z","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 compression is an important problem in natural language processing. In this paper, we firstly establish a new sentence compression model based on the probability model and the parse tree model. Our sentence compression model is equivalent to an integer linear program (ILP) which can both guarantee the syntax correctness of the compression and save the main meaning. We propose using a DC (Difference of convex) programming approach (DCA) for finding local optimal solution of our model. Combing DCA with a parallel-branch-and-bound framework, we can find global optimal solution. Numerical","authors_text":"Faouzi Mohamed Benammour, Hu Zhang, Xi-Wei Hu, Yi-Shuai Niu, Yu You","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-02-13T05:43:00Z","title":"Sentence Compression via DC Programming Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07248","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:85052e85506699dcda4227b71ef0f96f75fa23bda541f7cd92c07c7d1c40da1c","target":"record","created_at":"2026-05-17T23:53:08Z","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":"4256b7a31ecb56c1de9d54ab1ed156dd9453eaab05794fff4556902a28443067","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-02-13T05:43:00Z","title_canon_sha256":"bdd1ff0ba6578540365be58d02e47655e15636492465dac75aa6b67dcfedb720"},"schema_version":"1.0","source":{"id":"1902.07248","kind":"arxiv","version":1}},"canonical_sha256":"4b0fcdec87f078a882858dde02e6bd1485a97aa42f3354c12d6059bdabf61566","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b0fcdec87f078a882858dde02e6bd1485a97aa42f3354c12d6059bdabf61566","first_computed_at":"2026-05-17T23:53:08.485776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:08.485776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AJmOqc/eQ1WESGPgd+TOr+MK8UmEehWkieccr3sGQoPh/MA7vYzEzNMdepVv+fdOlud3t6XX1ycK8D+Tu618Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:08.486424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07248","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85052e85506699dcda4227b71ef0f96f75fa23bda541f7cd92c07c7d1c40da1c","sha256:a22693677ef38cc580a22667051eb43542326d31510679d791aa0e9ef5e820f0"],"state_sha256":"5a626ceeddbc7a3c8a880f3079eba82e3b5fd9a9aceae935f7bd7207aeba5ca7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H02nQayILYmEbL3KrD3bDNrNXXjRgeprpmfitp5SWy0opZMV7MDVRRxu/GwbiOMu29PFn8eQuBfS+MfFmQ/iAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:19:05.820746Z","bundle_sha256":"5689382d64de8e222ec362768777e5e75d20786a866bd95c4a6d6ba577924e7e"}}