{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/news-article-teaser-tweets-and-how-to","title":"News Article Teaser Tweets and How to Generate Them","arxiv_id":"1807.11535","date":"2018-07-30","proceeding":"NAACL 2019 6","authors":["Sanjeev Kumar Karn","Mark Buckley","Ulli Waltinger","Hinrich Schütze"],"abstract":"In this work, we define the task of teaser generation and provide an\nevaluation benchmark and baseline systems for the process of generating\nteasers. A teaser is a short reading suggestion for an article that is\nillustrative and includes curiosity-arousing elements to entice potential\nreaders to read particular news items. Teasers are one of the main vehicles for\ntransmitting news to social media users. We compile a novel dataset of teasers\nby systematically accumulating tweets and selecting those that conform to the\nteaser definition. We have compared a number of neural abstractive\narchitectures on the task of teaser generation and the overall best performing\nsystem is See et al.(2017)'s seq2seq with pointer network.","url_abs":"http://arxiv.org/abs/1807.11535v2","url_pdf":"http://arxiv.org/pdf/1807.11535v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"news-article-teaser-tweets-and-how-to","repo_url":"https://github.com/sanjeevkrn/teaser_collect","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"news-article-teaser-tweets-and-how-to","repo_url":"https://github.com/sanjeevkrn/teaser_generate","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[],"methods":[{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"seq2seq","method_name":"Seq2Seq"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1807.11535","atlas_url":"https://app.syntology.ai/?focus=1807.11535","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1807.11535"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1807.11535\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1807.11535"},"call":"get_concepts_for_paper(arxiv_id=\"1807.11535\")"}],"by_repo":[{"repo":"sanjeevkrn/teaser_collect","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sanjeevkrn/teaser_generate","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1704.04368"],"harvested_for_calls":[{"arxiv_id":"1704.04368","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1704.04368"},"call":"get_harvested_code_for_paper(arxiv_id=\"1704.04368\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"d7cfbb8f50e3bad8b06454ac97ad5c35337f4493dd7d5680941fa6be62fb590d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}