{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SXV5XAMD7HYGZS5PWRX4RXWTTR","short_pith_number":"pith:SXV5XAMD","canonical_record":{"source":{"id":"1510.08418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-10-28T19:04:30Z","cross_cats_sorted":[],"title_canon_sha256":"b3df865237dd902c26ff855127f5f1abcdc0111984a0fc1b2fd454f631d653ec","abstract_canon_sha256":"33e4eb1ae2b2a5564d83520434fef91ecd9b51abefe535f53959f3449863ef89"},"schema_version":"1.0"},"canonical_sha256":"95ebdb8183f9f06ccbafb46fc8ded39c7e81e0e29e396576b59db08844738cd1","source":{"kind":"arxiv","id":"1510.08418","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08418","created_at":"2026-05-18T01:28:36Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08418v1","created_at":"2026-05-18T01:28:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08418","created_at":"2026-05-18T01:28:36Z"},{"alias_kind":"pith_short_12","alias_value":"SXV5XAMD7HYG","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SXV5XAMD7HYGZS5P","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SXV5XAMD","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SXV5XAMD7HYGZS5PWRX4RXWTTR","target":"record","payload":{"canonical_record":{"source":{"id":"1510.08418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-10-28T19:04:30Z","cross_cats_sorted":[],"title_canon_sha256":"b3df865237dd902c26ff855127f5f1abcdc0111984a0fc1b2fd454f631d653ec","abstract_canon_sha256":"33e4eb1ae2b2a5564d83520434fef91ecd9b51abefe535f53959f3449863ef89"},"schema_version":"1.0"},"canonical_sha256":"95ebdb8183f9f06ccbafb46fc8ded39c7e81e0e29e396576b59db08844738cd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:36.005911Z","signature_b64":"Cai8KGroB9cFpHUl6vGinMo9ecJyFjrPElikONQlLCFimQxfdbId35jEPaVOVFQZuJqxK7nM/VOyKAB1vEg2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95ebdb8183f9f06ccbafb46fc8ded39c7e81e0e29e396576b59db08844738cd1","last_reissued_at":"2026-05-18T01:28:36.005397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:36.005397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.08418","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-18T01:28:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L7RCyyotkjb0IFnxG3pyw8wIAzku4uh7zBOLrIDXDinlSMRKULIFsvTvXYl2J56BPwW6ikgPSeO4Sw0EIIn2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:48:25.879230Z"},"content_sha256":"53523b1263d02324e56949d43760ec0afda375d4d9e6f48f896e95309ced82c0","schema_version":"1.0","event_id":"sha256:53523b1263d02324e56949d43760ec0afda375d4d9e6f48f896e95309ced82c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SXV5XAMD7HYGZS5PWRX4RXWTTR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast k-best Sentence Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Enrique Alfonseca, Katja Filippova","submitted_at":"2015-10-28T19:04:30Z","abstract_excerpt":"A popular approach to sentence compression is to formulate the task as a constrained optimization problem and solve it with integer linear programming (ILP) tools. Unfortunately, dependence on ILP may make the compressor prohibitively slow, and thus approximation techniques have been proposed which are often complex and offer a moderate gain in speed. As an alternative solution, we introduce a novel compression algorithm which generates k-best compressions relying on local deletion decisions. Our algorithm is two orders of magnitude faster than a recent ILP-based method while producing better "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08418","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-18T01:28:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qj/WxkVnIGM91ChZykGZgjkB/Attvwj8pk2VF25vQKTL4+xd+9zioWLJm99y9k2kLLC0BNfdnuto/lIbeVQ3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:48:25.879925Z"},"content_sha256":"86e8c2475fb62de1c566b46d873fe5005227fdc6480a75224403d448c5deffd6","schema_version":"1.0","event_id":"sha256:86e8c2475fb62de1c566b46d873fe5005227fdc6480a75224403d448c5deffd6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SXV5XAMD7HYGZS5PWRX4RXWTTR/bundle.json","state_url":"https://pith.science/pith/SXV5XAMD7HYGZS5PWRX4RXWTTR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SXV5XAMD7HYGZS5PWRX4RXWTTR/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-26T14:48:25Z","links":{"resolver":"https://pith.science/pith/SXV5XAMD7HYGZS5PWRX4RXWTTR","bundle":"https://pith.science/pith/SXV5XAMD7HYGZS5PWRX4RXWTTR/bundle.json","state":"https://pith.science/pith/SXV5XAMD7HYGZS5PWRX4RXWTTR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SXV5XAMD7HYGZS5PWRX4RXWTTR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SXV5XAMD7HYGZS5PWRX4RXWTTR","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":"33e4eb1ae2b2a5564d83520434fef91ecd9b51abefe535f53959f3449863ef89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-10-28T19:04:30Z","title_canon_sha256":"b3df865237dd902c26ff855127f5f1abcdc0111984a0fc1b2fd454f631d653ec"},"schema_version":"1.0","source":{"id":"1510.08418","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08418","created_at":"2026-05-18T01:28:36Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08418v1","created_at":"2026-05-18T01:28:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08418","created_at":"2026-05-18T01:28:36Z"},{"alias_kind":"pith_short_12","alias_value":"SXV5XAMD7HYG","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SXV5XAMD7HYGZS5P","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SXV5XAMD","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:86e8c2475fb62de1c566b46d873fe5005227fdc6480a75224403d448c5deffd6","target":"graph","created_at":"2026-05-18T01:28:36Z","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":"A popular approach to sentence compression is to formulate the task as a constrained optimization problem and solve it with integer linear programming (ILP) tools. Unfortunately, dependence on ILP may make the compressor prohibitively slow, and thus approximation techniques have been proposed which are often complex and offer a moderate gain in speed. As an alternative solution, we introduce a novel compression algorithm which generates k-best compressions relying on local deletion decisions. Our algorithm is two orders of magnitude faster than a recent ILP-based method while producing better ","authors_text":"Enrique Alfonseca, Katja Filippova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-10-28T19:04:30Z","title":"Fast k-best Sentence Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08418","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:53523b1263d02324e56949d43760ec0afda375d4d9e6f48f896e95309ced82c0","target":"record","created_at":"2026-05-18T01:28:36Z","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":"33e4eb1ae2b2a5564d83520434fef91ecd9b51abefe535f53959f3449863ef89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-10-28T19:04:30Z","title_canon_sha256":"b3df865237dd902c26ff855127f5f1abcdc0111984a0fc1b2fd454f631d653ec"},"schema_version":"1.0","source":{"id":"1510.08418","kind":"arxiv","version":1}},"canonical_sha256":"95ebdb8183f9f06ccbafb46fc8ded39c7e81e0e29e396576b59db08844738cd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95ebdb8183f9f06ccbafb46fc8ded39c7e81e0e29e396576b59db08844738cd1","first_computed_at":"2026-05-18T01:28:36.005397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:36.005397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cai8KGroB9cFpHUl6vGinMo9ecJyFjrPElikONQlLCFimQxfdbId35jEPaVOVFQZuJqxK7nM/VOyKAB1vEg2BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:36.005911Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.08418","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53523b1263d02324e56949d43760ec0afda375d4d9e6f48f896e95309ced82c0","sha256:86e8c2475fb62de1c566b46d873fe5005227fdc6480a75224403d448c5deffd6"],"state_sha256":"23cdb646ab28aa09303d9047eb8f52516a6c5951f93f62edb27cc2fb274c51f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0iB8pKhKuvBe+Zho1N2jUIQvgUJTPTd7XpYGzao9S4UKJTVvbSGu9JX0yoTrztxci+FomiBOp0dzcCMpbS5jBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:48:25.883666Z","bundle_sha256":"0b6293700c1ea3f917832cae853c92cad812cdcb318ada4bddf870d6bf25818d"}}