{"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/topological-recurrent-neural-network-for","title":"Topological Recurrent Neural Network for Diffusion Prediction","arxiv_id":"1711.10162","date":"2017-11-28","proceeding":null,"authors":["Jia Wang","Vincent W. Zheng","Zemin Liu","Kevin Chen-Chuan Chang"],"abstract":"In this paper, we study the problem of using representation learning to\nassist information diffusion prediction on graphs. In particular, we aim at\nestimating the probability of an inactive node to be activated next in a\ncascade. Despite the success of recent deep learning methods for diffusion, we\nfind that they often underexplore the cascade structure. We consider a cascade\nas not merely a sequence of nodes ordered by their activation time stamps;\ninstead, it has a richer structure indicating the diffusion process over the\ndata graph. As a result, we introduce a new data model, namely diffusion\ntopologies, to fully describe the cascade structure. We find it challenging to\nmodel diffusion topologies, which are dynamic directed acyclic graphs (DAGs),\nwith the existing neural networks. Therefore, we propose a novel topological\nrecurrent neural network, namely Topo-LSTM, for modeling dynamic DAGs. We\ncustomize Topo-LSTM for the diffusion prediction task, and show it improves the\nstate-of-the-art baselines, by 20.1%--56.6% (MAP) relatively, across multiple\nreal-world data sets. Our code and data sets are available online at\nhttps://github.com/vwz/topolstm.","url_abs":"http://arxiv.org/abs/1711.10162v2","url_pdf":"http://arxiv.org/pdf/1711.10162v2.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":"topological-recurrent-neural-network-for","repo_url":"https://github.com/vwz/topolstm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"prediction","task_name":"Prediction"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"vwz/topolstm","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"89a34af168bc499fbca8b33e1a0e347edb125a06765939f2de4e488a8785c9ea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}