{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZPDTBANJ6HU7MGOLSAL5C7R4TM","short_pith_number":"pith:ZPDTBANJ","schema_version":"1.0","canonical_sha256":"cbc73081a9f1e9f619cb9017d17e3c9b317f7f0d679e09758119fd9a9e99fe6d","source":{"kind":"arxiv","id":"1509.00685","version":2},"attestation_state":"computed","paper":{"title":"A Neural Attention Model for Abstractive Sentence Summarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Alexander M. Rush, Jason Weston, Sumit Chopra","submitted_at":"2015-09-02T13:20:40Z","abstract_excerpt":"Summarization based on text extraction is inherently limited, but generation-style abstractive methods have proven challenging to build. In this work, we propose a fully data-driven approach to abstractive sentence summarization. Our method utilizes a local attention-based model that generates each word of the summary conditioned on the input sentence. While the model is structurally simple, it can easily be trained end-to-end and scales to a large amount of training data. The model shows significant performance gains on the DUC-2004 shared task compared with several strong baselines."},"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":"1509.00685","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-09-02T13:20:40Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"773c2f1a4a932aa0acc3cf007a19fd24f4a68af8d7a533df460e8feed52c0d86","abstract_canon_sha256":"862ec96a8114a0b217c6afe5a7502b24829d8ef3f46eed857d86ec458761bc76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:04.983698Z","signature_b64":"gIUDpChUcPMy+q0lTnsOl9+4U1TJqjmKWSbutpIqqZXqc4JB3JQOQssIqU0659qqkxEsgS7pZaUz/q1RH9WiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbc73081a9f1e9f619cb9017d17e3c9b317f7f0d679e09758119fd9a9e99fe6d","last_reissued_at":"2026-05-18T01:34:04.983188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:04.983188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Neural Attention Model for Abstractive Sentence Summarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Alexander M. Rush, Jason Weston, Sumit Chopra","submitted_at":"2015-09-02T13:20:40Z","abstract_excerpt":"Summarization based on text extraction is inherently limited, but generation-style abstractive methods have proven challenging to build. In this work, we propose a fully data-driven approach to abstractive sentence summarization. Our method utilizes a local attention-based model that generates each word of the summary conditioned on the input sentence. While the model is structurally simple, it can easily be trained end-to-end and scales to a large amount of training data. The model shows significant performance gains on the DUC-2004 shared task compared with several strong baselines."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00685","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.00685","created_at":"2026-05-18T01:34:04.983259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00685v2","created_at":"2026-05-18T01:34:04.983259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00685","created_at":"2026-05-18T01:34:04.983259+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPDTBANJ6HU7","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPDTBANJ6HU7MGOL","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPDTBANJ","created_at":"2026-05-18T12:29:52.810259+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"1907.05664","citing_title":"Saliency Maps Generation for Automatic Text Summarization","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"1907.06330","citing_title":"Ranking sentences from product description & bullets for better search","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2009.01325","citing_title":"Learning to summarize from human feedback","ref_index":54,"is_internal_anchor":true},{"citing_arxiv_id":"1909.05858","citing_title":"CTRL: A Conditional Transformer Language Model for Controllable Generation","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2002.08155","citing_title":"CodeBERT: A Pre-Trained Model for Programming and Natural Languages","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZPDTBANJ6HU7MGOLSAL5C7R4TM","json":"https://pith.science/pith/ZPDTBANJ6HU7MGOLSAL5C7R4TM.json","graph_json":"https://pith.science/api/pith-number/ZPDTBANJ6HU7MGOLSAL5C7R4TM/graph.json","events_json":"https://pith.science/api/pith-number/ZPDTBANJ6HU7MGOLSAL5C7R4TM/events.json","paper":"https://pith.science/paper/ZPDTBANJ"},"agent_actions":{"view_html":"https://pith.science/pith/ZPDTBANJ6HU7MGOLSAL5C7R4TM","download_json":"https://pith.science/pith/ZPDTBANJ6HU7MGOLSAL5C7R4TM.json","view_paper":"https://pith.science/paper/ZPDTBANJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00685&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPDTBANJ6HU7MGOLSAL5C7R4TM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPDTBANJ6HU7MGOLSAL5C7R4TM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPDTBANJ6HU7MGOLSAL5C7R4TM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPDTBANJ6HU7MGOLSAL5C7R4TM/action/storage_attestation","attest_author":"https://pith.science/pith/ZPDTBANJ6HU7MGOLSAL5C7R4TM/action/author_attestation","sign_citation":"https://pith.science/pith/ZPDTBANJ6HU7MGOLSAL5C7R4TM/action/citation_signature","submit_replication":"https://pith.science/pith/ZPDTBANJ6HU7MGOLSAL5C7R4TM/action/replication_record"}},"created_at":"2026-05-18T01:34:04.983259+00:00","updated_at":"2026-05-18T01:34:04.983259+00:00"}