{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DBGXLMHLSBKK6FTYAH76YZHNSS","short_pith_number":"pith:DBGXLMHL","schema_version":"1.0","canonical_sha256":"184d75b0eb9054af167801ffec64ed94806a0b7898e9dd1d1b9b921368f60ce3","source":{"kind":"arxiv","id":"1806.02371","version":1},"attestation_state":"computed","paper":{"title":"Adversarial Attack on Graph Structured Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hanjun Dai, Hui Li, Jun Zhu, Le Song, Lin Wang, Tian Tian, Xin Huang","submitted_at":"2018-06-06T18:23:33Z","abstract_excerpt":"Deep learning on graph structures has shown exciting results in various applications. However, few attentions have been paid to the robustness of such models, in contrast to numerous research work for image or text adversarial attack and defense. In this paper, we focus on the adversarial attacks that fool the model by modifying the combinatorial structure of data. We first propose a reinforcement learning based attack method that learns the generalizable attack policy, while only requiring prediction labels from the target classifier. Also, variants of genetic algorithms and gradient methods "},"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":"1806.02371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-06T18:23:33Z","cross_cats_sorted":["cs.CR","cs.SI","stat.ML"],"title_canon_sha256":"2695aa87ef2f4cbd6fb98312bc69784c643eb014fabdfbd498b911469f1b9535","abstract_canon_sha256":"8aedf6b1d36054b8484cbc6c717cc0aa9bae0bf620a26882bcc3ac6a0411f1c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:57.108605Z","signature_b64":"8ECGfQ4X5Xf4A8k38T0kcjbQuW1tRFl8I7+sbafR7aajwrXJ2llMPlz8k8Hk2I3AvKknX2SDuEJQi1/PUorBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"184d75b0eb9054af167801ffec64ed94806a0b7898e9dd1d1b9b921368f60ce3","last_reissued_at":"2026-05-18T00:13:57.107799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:57.107799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarial Attack on Graph Structured Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hanjun Dai, Hui Li, Jun Zhu, Le Song, Lin Wang, Tian Tian, Xin Huang","submitted_at":"2018-06-06T18:23:33Z","abstract_excerpt":"Deep learning on graph structures has shown exciting results in various applications. However, few attentions have been paid to the robustness of such models, in contrast to numerous research work for image or text adversarial attack and defense. In this paper, we focus on the adversarial attacks that fool the model by modifying the combinatorial structure of data. We first propose a reinforcement learning based attack method that learns the generalizable attack policy, while only requiring prediction labels from the target classifier. Also, variants of genetic algorithms and gradient methods "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02371","kind":"arxiv","version":1},"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":"1806.02371","created_at":"2026-05-18T00:13:57.107913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02371v1","created_at":"2026-05-18T00:13:57.107913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02371","created_at":"2026-05-18T00:13:57.107913+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBGXLMHLSBKK","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBGXLMHLSBKK6FTY","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBGXLMHL","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DBGXLMHLSBKK6FTYAH76YZHNSS","json":"https://pith.science/pith/DBGXLMHLSBKK6FTYAH76YZHNSS.json","graph_json":"https://pith.science/api/pith-number/DBGXLMHLSBKK6FTYAH76YZHNSS/graph.json","events_json":"https://pith.science/api/pith-number/DBGXLMHLSBKK6FTYAH76YZHNSS/events.json","paper":"https://pith.science/paper/DBGXLMHL"},"agent_actions":{"view_html":"https://pith.science/pith/DBGXLMHLSBKK6FTYAH76YZHNSS","download_json":"https://pith.science/pith/DBGXLMHLSBKK6FTYAH76YZHNSS.json","view_paper":"https://pith.science/paper/DBGXLMHL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02371&json=true","fetch_graph":"https://pith.science/api/pith-number/DBGXLMHLSBKK6FTYAH76YZHNSS/graph.json","fetch_events":"https://pith.science/api/pith-number/DBGXLMHLSBKK6FTYAH76YZHNSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBGXLMHLSBKK6FTYAH76YZHNSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBGXLMHLSBKK6FTYAH76YZHNSS/action/storage_attestation","attest_author":"https://pith.science/pith/DBGXLMHLSBKK6FTYAH76YZHNSS/action/author_attestation","sign_citation":"https://pith.science/pith/DBGXLMHLSBKK6FTYAH76YZHNSS/action/citation_signature","submit_replication":"https://pith.science/pith/DBGXLMHLSBKK6FTYAH76YZHNSS/action/replication_record"}},"created_at":"2026-05-18T00:13:57.107913+00:00","updated_at":"2026-05-18T00:13:57.107913+00:00"}