{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZCZTP3MUYYNSPQYGYHOYLPS6IV","short_pith_number":"pith:ZCZTP3MU","schema_version":"1.0","canonical_sha256":"c8b337ed94c61b27c306c1dd85be5e4562a38a158ac0aee2a9da9c4a5f7465b9","source":{"kind":"arxiv","id":"1906.01749","version":3},"attestation_state":"computed","paper":{"title":"Multi-News: a Large-Scale Multi-Document Summarization Dataset and Abstractive Hierarchical Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alexander R. Fabbri, Dragomir R. Radev, Irene Li, Suyi Li, Tianwei She","submitted_at":"2019-06-04T23:00:43Z","abstract_excerpt":"Automatic generation of summaries from multiple news articles is a valuable tool as the number of online publications grows rapidly. Single document summarization (SDS) systems have benefited from advances in neural encoder-decoder model thanks to the availability of large datasets. However, multi-document summarization (MDS) of news articles has been limited to datasets of a couple of hundred examples. In this paper, we introduce Multi-News, the first large-scale MDS news dataset. Additionally, we propose an end-to-end model which incorporates a traditional extractive summarization model with"},"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":"1906.01749","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-06-04T23:00:43Z","cross_cats_sorted":[],"title_canon_sha256":"882df275c18b833ae26c0668c98f9ca7f23f0ce0dc5199bab4b0e52de6da80c4","abstract_canon_sha256":"9f76c1749bf9ae9ae3fcfc40f745213d867a3bc8008a68486b6b4b19a82cde66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:53.063110Z","signature_b64":"zIlrORgYAr4LSjYDkvnzv6UL0E/K925PdbI1OJa2wDInrAT8kHvkbvP6WOOcSO3XruqDDz+GX7Qfz5CX+S6WAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8b337ed94c61b27c306c1dd85be5e4562a38a158ac0aee2a9da9c4a5f7465b9","last_reissued_at":"2026-05-17T23:42:53.062495Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:53.062495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-News: a Large-Scale Multi-Document Summarization Dataset and Abstractive Hierarchical Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Alexander R. Fabbri, Dragomir R. Radev, Irene Li, Suyi Li, Tianwei She","submitted_at":"2019-06-04T23:00:43Z","abstract_excerpt":"Automatic generation of summaries from multiple news articles is a valuable tool as the number of online publications grows rapidly. Single document summarization (SDS) systems have benefited from advances in neural encoder-decoder model thanks to the availability of large datasets. However, multi-document summarization (MDS) of news articles has been limited to datasets of a couple of hundred examples. In this paper, we introduce Multi-News, the first large-scale MDS news dataset. Additionally, we propose an end-to-end model which incorporates a traditional extractive summarization model with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01749","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.01749","created_at":"2026-05-17T23:42:53.062584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01749v3","created_at":"2026-05-17T23:42:53.062584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01749","created_at":"2026-05-17T23:42:53.062584+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCZTP3MUYYNS","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCZTP3MUYYNSPQYG","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCZTP3MU","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2506.04565","citing_title":"From Standalone LLMs to Integrated Intelligence: A Survey of Compound Al Systems","ref_index":42,"is_internal_anchor":true},{"citing_arxiv_id":"2407.11550","citing_title":"Ada-KV: Optimizing KV Cache Eviction by Adaptive Budget Allocation for Efficient LLM Inference","ref_index":58,"is_internal_anchor":true},{"citing_arxiv_id":"2212.04089","citing_title":"Editing Models with Task Arithmetic","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08964","citing_title":"Trustworthy AI: Ensuring Reliability and Accountability from Models to Agents","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZCZTP3MUYYNSPQYGYHOYLPS6IV","json":"https://pith.science/pith/ZCZTP3MUYYNSPQYGYHOYLPS6IV.json","graph_json":"https://pith.science/api/pith-number/ZCZTP3MUYYNSPQYGYHOYLPS6IV/graph.json","events_json":"https://pith.science/api/pith-number/ZCZTP3MUYYNSPQYGYHOYLPS6IV/events.json","paper":"https://pith.science/paper/ZCZTP3MU"},"agent_actions":{"view_html":"https://pith.science/pith/ZCZTP3MUYYNSPQYGYHOYLPS6IV","download_json":"https://pith.science/pith/ZCZTP3MUYYNSPQYGYHOYLPS6IV.json","view_paper":"https://pith.science/paper/ZCZTP3MU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01749&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCZTP3MUYYNSPQYGYHOYLPS6IV/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCZTP3MUYYNSPQYGYHOYLPS6IV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCZTP3MUYYNSPQYGYHOYLPS6IV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCZTP3MUYYNSPQYGYHOYLPS6IV/action/storage_attestation","attest_author":"https://pith.science/pith/ZCZTP3MUYYNSPQYGYHOYLPS6IV/action/author_attestation","sign_citation":"https://pith.science/pith/ZCZTP3MUYYNSPQYGYHOYLPS6IV/action/citation_signature","submit_replication":"https://pith.science/pith/ZCZTP3MUYYNSPQYGYHOYLPS6IV/action/replication_record"}},"created_at":"2026-05-17T23:42:53.062584+00:00","updated_at":"2026-05-17T23:42:53.062584+00:00"}