{"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/automatic-stance-detection-using-end-to-end","title":"Automatic Stance Detection Using End-to-End Memory Networks","arxiv_id":"1804.07581","date":"2018-04-20","proceeding":"NAACL 2018 6","authors":["Mitra Mohtarami","Ramy Baly","James Glass","Preslav Nakov","Lluis Marquez","Alessandro Moschitti"],"abstract":"We present a novel end-to-end memory network for stance detection, which\njointly (i) predicts whether a document agrees, disagrees, discusses or is\nunrelated with respect to a given target claim, and also (ii) extracts snippets\nof evidence for that prediction. The network operates at the paragraph level\nand integrates convolutional and recurrent neural networks, as well as a\nsimilarity matrix as part of the overall architecture. The experimental\nevaluation on the Fake News Challenge dataset shows state-of-the-art\nperformance.","url_abs":"http://arxiv.org/abs/1804.07581v1","url_pdf":"http://arxiv.org/pdf/1804.07581v1.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":[],"tasks":[{"task_slug":"stance-detection","task_name":"Stance Detection"}],"methods":[{"method_slug":"end-to-end-memory-network","method_name":"End-To-End Memory Network"},{"method_slug":"memory-network","method_name":"Memory Network"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/fake-news-detection-on-fnc-1","task":"Fake News Detection","dataset":"FNC-1","model":"Neural method from Mohtarami et al. + TF-IDF (Mohtarami et al., 2018)","rank_in_archive_order":6,"of":10,"metrics":{"Weighted Accuracy":"81.23"},"uses_additional_data":false},{"leaderboard":"/sota/fake-news-detection-on-fnc-1","task":"Fake News Detection","dataset":"FNC-1","model":"Neural method from Mohtarami et al. (Mohtarami et al., 2018)","rank_in_archive_order":7,"of":10,"metrics":{"Weighted Accuracy":"78.97"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1804.07581","atlas_url":"https://app.syntology.ai/?focus=1804.07581","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":"1804.07581"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1804.07581\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1804.07581"},"call":"get_concepts_for_paper(arxiv_id=\"1804.07581\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a3e55f3f408b804a1187410066de8e5e3a0d80aa9f7c53fc25e60551b6a7095c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}