{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:OTH2NJKWTTO6JSBEDRUBO5UC5L","short_pith_number":"pith:OTH2NJKW","schema_version":"1.0","canonical_sha256":"74cfa6a5569cdde4c8241c68177682eae3408915f17108c1095e202d85f066f6","source":{"kind":"arxiv","id":"2003.00653","version":3},"attestation_state":"computed","paper":{"title":"Adversarial Attacks and Defenses on Graphs: A Review, A Tool and Empirical Studies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Charu Aggarwal, Han Xu, Jiliang Tang, Shuiwang Ji, Wei Jin, Yaxin Li, Yiqi Wang","submitted_at":"2020-03-02T04:32:38Z","abstract_excerpt":"Deep neural networks (DNNs) have achieved significant performance in various tasks. However, recent studies have shown that DNNs can be easily fooled by small perturbation on the input, called adversarial attacks. As the extensions of DNNs to graphs, Graph Neural Networks (GNNs) have been demonstrated to inherit this vulnerability. Adversary can mislead GNNs to give wrong predictions by modifying the graph structure such as manipulating a few edges. This vulnerability has arisen tremendous concerns for adapting GNNs in safety-critical applications and has attracted increasing research attentio"},"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":"2003.00653","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-03-02T04:32:38Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"fefd111f9ab3e385fab0f3df48915fed2184ea34ac2d99f1a5b36b77835f6932","abstract_canon_sha256":"f742a52e09d166aa5de8cb6f72fe890569b6917c766dc0952c1ed61a5bc625d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:54.759714Z","signature_b64":"jzIRySkLgZ7BY8YX7PTGxLsqi6SaSbWo7Up94PF+QCVcfHhKKuYa734mViksNXvudQAvYV/iuH0CPiwxV7QkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74cfa6a5569cdde4c8241c68177682eae3408915f17108c1095e202d85f066f6","last_reissued_at":"2026-07-05T01:58:54.759225Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:54.759225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarial Attacks and Defenses on Graphs: A Review, A Tool and Empirical Studies","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Charu Aggarwal, Han Xu, Jiliang Tang, Shuiwang Ji, Wei Jin, Yaxin Li, Yiqi Wang","submitted_at":"2020-03-02T04:32:38Z","abstract_excerpt":"Deep neural networks (DNNs) have achieved significant performance in various tasks. However, recent studies have shown that DNNs can be easily fooled by small perturbation on the input, called adversarial attacks. As the extensions of DNNs to graphs, Graph Neural Networks (GNNs) have been demonstrated to inherit this vulnerability. Adversary can mislead GNNs to give wrong predictions by modifying the graph structure such as manipulating a few edges. This vulnerability has arisen tremendous concerns for adapting GNNs in safety-critical applications and has attracted increasing research attentio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.00653","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.00653/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2003.00653","created_at":"2026-07-05T01:58:54.759291+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.00653v3","created_at":"2026-07-05T01:58:54.759291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.00653","created_at":"2026-07-05T01:58:54.759291+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTH2NJKWTTO6","created_at":"2026-07-05T01:58:54.759291+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTH2NJKWTTO6JSBE","created_at":"2026-07-05T01:58:54.759291+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTH2NJKW","created_at":"2026-07-05T01:58:54.759291+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.20848","citing_title":"Mitigating the Structural Bias in Graph Adversarial Defenses","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OTH2NJKWTTO6JSBEDRUBO5UC5L","json":"https://pith.science/pith/OTH2NJKWTTO6JSBEDRUBO5UC5L.json","graph_json":"https://pith.science/api/pith-number/OTH2NJKWTTO6JSBEDRUBO5UC5L/graph.json","events_json":"https://pith.science/api/pith-number/OTH2NJKWTTO6JSBEDRUBO5UC5L/events.json","paper":"https://pith.science/paper/OTH2NJKW"},"agent_actions":{"view_html":"https://pith.science/pith/OTH2NJKWTTO6JSBEDRUBO5UC5L","download_json":"https://pith.science/pith/OTH2NJKWTTO6JSBEDRUBO5UC5L.json","view_paper":"https://pith.science/paper/OTH2NJKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.00653&json=true","fetch_graph":"https://pith.science/api/pith-number/OTH2NJKWTTO6JSBEDRUBO5UC5L/graph.json","fetch_events":"https://pith.science/api/pith-number/OTH2NJKWTTO6JSBEDRUBO5UC5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTH2NJKWTTO6JSBEDRUBO5UC5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTH2NJKWTTO6JSBEDRUBO5UC5L/action/storage_attestation","attest_author":"https://pith.science/pith/OTH2NJKWTTO6JSBEDRUBO5UC5L/action/author_attestation","sign_citation":"https://pith.science/pith/OTH2NJKWTTO6JSBEDRUBO5UC5L/action/citation_signature","submit_replication":"https://pith.science/pith/OTH2NJKWTTO6JSBEDRUBO5UC5L/action/replication_record"}},"created_at":"2026-07-05T01:58:54.759291+00:00","updated_at":"2026-07-05T01:58:54.759291+00:00"}