{"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/adversarial-attack-on-graph-structured-data","title":"Adversarial Attack on Graph Structured Data","arxiv_id":"1806.02371","date":"2018-06-06","proceeding":"ICML 2018 7","authors":["Hanjun Dai","Hui Li","Tian Tian","Xin Huang","Lin Wang","Jun Zhu","Le Song"],"abstract":"Deep learning on graph structures has shown exciting results in various\napplications. However, few attentions have been paid to the robustness of such\nmodels, in contrast to numerous research work for image or text adversarial\nattack and defense. In this paper, we focus on the adversarial attacks that\nfool the model by modifying the combinatorial structure of data. We first\npropose a reinforcement learning based attack method that learns the\ngeneralizable attack policy, while only requiring prediction labels from the\ntarget classifier. Also, variants of genetic algorithms and gradient methods\nare presented in the scenario where prediction confidence or gradients are\navailable. We use both synthetic and real-world data to show that, a family of\nGraph Neural Network models are vulnerable to these attacks, in both\ngraph-level and node-level classification tasks. We also show such attacks can\nbe used to diagnose the learned classifiers.","url_abs":"http://arxiv.org/abs/1806.02371v1","url_pdf":"http://arxiv.org/pdf/1806.02371v1.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":"adversarial-attack-on-graph-structured-data","repo_url":"https://github.com/Hanjun-Dai/graph_adversarial_attack","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"adversarial-attack","task_name":"Adversarial Attack"},{"task_slug":"graph-neural-network","task_name":"Graph Neural Network"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1806.02371","atlas_url":"https://app.syntology.ai/?focus=1806.02371","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":"1806.02371"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1806.02371\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1806.02371"},"call":"get_concepts_for_paper(arxiv_id=\"1806.02371\")"}],"by_repo":[{"repo":"Hanjun-Dai/graph_adversarial_attack","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2111.02842"],"harvested_for_calls":[{"arxiv_id":"2111.02842","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2111.02842"},"call":"get_harvested_code_for_paper(arxiv_id=\"2111.02842\")"}]}],"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":"4f9125655511d201de51fe460a803ce39fe0df3d8afc9e3cc29eed2994063b69","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}