{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RXOTUKDR5UEXEN2GBYZJXKZZXZ","short_pith_number":"pith:RXOTUKDR","canonical_record":{"source":{"id":"1801.07704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-01-23T18:47:03Z","cross_cats_sorted":[],"title_canon_sha256":"05ab67402e25a050a8f172c32e3c547e9011e8ad939fbd1b1ebc927aec6b74cd","abstract_canon_sha256":"5bec72f35315fab1fc19ce702d2e94d19c7460facc9d4a25d25c11240ce85e40"},"schema_version":"1.0"},"canonical_sha256":"8ddd3a2871ed097237460e329bab39be6954188e4b31ac901f42428718859f22","source":{"kind":"arxiv","id":"1801.07704","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07704","created_at":"2026-05-18T00:25:07Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07704v2","created_at":"2026-05-18T00:25:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07704","created_at":"2026-05-18T00:25:07Z"},{"alias_kind":"pith_short_12","alias_value":"RXOTUKDR5UEX","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RXOTUKDR5UEXEN2G","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RXOTUKDR","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RXOTUKDR5UEXEN2GBYZJXKZZXZ","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-01-23T18:47:03Z","cross_cats_sorted":[],"title_canon_sha256":"05ab67402e25a050a8f172c32e3c547e9011e8ad939fbd1b1ebc927aec6b74cd","abstract_canon_sha256":"5bec72f35315fab1fc19ce702d2e94d19c7460facc9d4a25d25c11240ce85e40"},"schema_version":"1.0"},"canonical_sha256":"8ddd3a2871ed097237460e329bab39be6954188e4b31ac901f42428718859f22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:07.071605Z","signature_b64":"zT3T9945ew4J+UStAYUVBBonXW6DwQaTkamfBW/PLnBaUoj8BWtrmKMB486uCTlgZjAxGhKa11Q2uq/XMj7TAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ddd3a2871ed097237460e329bab39be6954188e4b31ac901f42428718859f22","last_reissued_at":"2026-05-18T00:25:07.071090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:07.071090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07704","source_version":2,"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:25:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FzvN0Qvkhf3e2+BrAvsJNKUNKZ4yQKSUVW0y9UnwxPYgegtGYN7yeEOpvywhrvuCRap56Q6GleT6dHBvouInCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:38:23.503619Z"},"content_sha256":"2491ffab58b32d8746f22d6300b802230f2ce7a4ac9ce7b5148e3de67128282c","schema_version":"1.0","event_id":"sha256:2491ffab58b32d8746f22d6300b802230f2ce7a4ac9ce7b5148e3de67128282c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RXOTUKDR5UEXEN2GBYZJXKZZXZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Query Focused Abstractive Summarization: Incorporating Query Relevance, Multi-Document Coverage, and Summary Length Constraints into seq2seq Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Matan Eyal, Michael Elhadad, Tal Baumel","submitted_at":"2018-01-23T18:47:03Z","abstract_excerpt":"Query Focused Summarization (QFS) has been addressed mostly using extractive methods. Such methods, however, produce text which suffers from low coherence. We investigate how abstractive methods can be applied to QFS, to overcome such limitations. Recent developments in neural-attention based sequence-to-sequence models have led to state-of-the-art results on the task of abstractive generic single document summarization. Such models are trained in an end to end method on large amounts of training data. We address three aspects to make abstractive summarization applicable to QFS: (a)since there"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07704","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":""},"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:25:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GWbUZJfk7WmOX/8go25nPc61q8eoByUWpS4i9k5WKQscG+dh7oSs57BtCXUn47wSREyq7XK3AdrtrUb52sDKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:38:23.504274Z"},"content_sha256":"371b8660e3d382bf43bfa73f69b84acefdfb3990c38ad0a7f3dac2a274b0ccb5","schema_version":"1.0","event_id":"sha256:371b8660e3d382bf43bfa73f69b84acefdfb3990c38ad0a7f3dac2a274b0ccb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXOTUKDR5UEXEN2GBYZJXKZZXZ/bundle.json","state_url":"https://pith.science/pith/RXOTUKDR5UEXEN2GBYZJXKZZXZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXOTUKDR5UEXEN2GBYZJXKZZXZ/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-06-05T23:38:23Z","links":{"resolver":"https://pith.science/pith/RXOTUKDR5UEXEN2GBYZJXKZZXZ","bundle":"https://pith.science/pith/RXOTUKDR5UEXEN2GBYZJXKZZXZ/bundle.json","state":"https://pith.science/pith/RXOTUKDR5UEXEN2GBYZJXKZZXZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXOTUKDR5UEXEN2GBYZJXKZZXZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RXOTUKDR5UEXEN2GBYZJXKZZXZ","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":"5bec72f35315fab1fc19ce702d2e94d19c7460facc9d4a25d25c11240ce85e40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-01-23T18:47:03Z","title_canon_sha256":"05ab67402e25a050a8f172c32e3c547e9011e8ad939fbd1b1ebc927aec6b74cd"},"schema_version":"1.0","source":{"id":"1801.07704","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07704","created_at":"2026-05-18T00:25:07Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07704v2","created_at":"2026-05-18T00:25:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07704","created_at":"2026-05-18T00:25:07Z"},{"alias_kind":"pith_short_12","alias_value":"RXOTUKDR5UEX","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RXOTUKDR5UEXEN2G","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RXOTUKDR","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:371b8660e3d382bf43bfa73f69b84acefdfb3990c38ad0a7f3dac2a274b0ccb5","target":"graph","created_at":"2026-05-18T00:25:07Z","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":"Query Focused Summarization (QFS) has been addressed mostly using extractive methods. Such methods, however, produce text which suffers from low coherence. We investigate how abstractive methods can be applied to QFS, to overcome such limitations. Recent developments in neural-attention based sequence-to-sequence models have led to state-of-the-art results on the task of abstractive generic single document summarization. Such models are trained in an end to end method on large amounts of training data. We address three aspects to make abstractive summarization applicable to QFS: (a)since there","authors_text":"Matan Eyal, Michael Elhadad, Tal Baumel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-01-23T18:47:03Z","title":"Query Focused Abstractive Summarization: Incorporating Query Relevance, Multi-Document Coverage, and Summary Length Constraints into seq2seq Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07704","kind":"arxiv","version":2},"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:2491ffab58b32d8746f22d6300b802230f2ce7a4ac9ce7b5148e3de67128282c","target":"record","created_at":"2026-05-18T00:25:07Z","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":"5bec72f35315fab1fc19ce702d2e94d19c7460facc9d4a25d25c11240ce85e40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-01-23T18:47:03Z","title_canon_sha256":"05ab67402e25a050a8f172c32e3c547e9011e8ad939fbd1b1ebc927aec6b74cd"},"schema_version":"1.0","source":{"id":"1801.07704","kind":"arxiv","version":2}},"canonical_sha256":"8ddd3a2871ed097237460e329bab39be6954188e4b31ac901f42428718859f22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ddd3a2871ed097237460e329bab39be6954188e4b31ac901f42428718859f22","first_computed_at":"2026-05-18T00:25:07.071090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:07.071090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zT3T9945ew4J+UStAYUVBBonXW6DwQaTkamfBW/PLnBaUoj8BWtrmKMB486uCTlgZjAxGhKa11Q2uq/XMj7TAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:07.071605Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07704","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2491ffab58b32d8746f22d6300b802230f2ce7a4ac9ce7b5148e3de67128282c","sha256:371b8660e3d382bf43bfa73f69b84acefdfb3990c38ad0a7f3dac2a274b0ccb5"],"state_sha256":"eb110ae7dd6f2ccd9fb43df1e330059a2cbf468acb827538ae0bea5283a3ad5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ef1U2BHaZePAvCd4AyzjfJWhxMWjSAeFgXuq0lGcSLtSsAwYxhPPKrPqR2Gmp6/D6fBFHs/mEocHuQr6Pao3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T23:38:23.507946Z","bundle_sha256":"d13a76aea805eefbb7d52ab37635a2fb82f00bfece9f3453c3a66c0823dcdc09"}}