{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4P5KAX43YB62DDN75ALN5LLOTW","short_pith_number":"pith:4P5KAX43","canonical_record":{"source":{"id":"1902.08412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-22T09:20:05Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"4516657da7999b623a48093a11f8b915ca115dff5c0a9cd6fb09b662a142ed3e","abstract_canon_sha256":"ced2ad1ba3f1e6f55668c1ab24e913aad0e69991fdba550da9b14210b079b760"},"schema_version":"1.0"},"canonical_sha256":"e3faa05f9bc07da18dbfe816dead6e9dbf19c288f2f40d91033ae252e0201e7e","source":{"kind":"arxiv","id":"1902.08412","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08412","created_at":"2026-07-05T07:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08412v2","created_at":"2026-07-05T07:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08412","created_at":"2026-07-05T07:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"4P5KAX43YB62","created_at":"2026-07-05T07:38:22Z"},{"alias_kind":"pith_short_16","alias_value":"4P5KAX43YB62DDN7","created_at":"2026-07-05T07:38:22Z"},{"alias_kind":"pith_short_8","alias_value":"4P5KAX43","created_at":"2026-07-05T07:38:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4P5KAX43YB62DDN75ALN5LLOTW","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-22T09:20:05Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"4516657da7999b623a48093a11f8b915ca115dff5c0a9cd6fb09b662a142ed3e","abstract_canon_sha256":"ced2ad1ba3f1e6f55668c1ab24e913aad0e69991fdba550da9b14210b079b760"},"schema_version":"1.0"},"canonical_sha256":"e3faa05f9bc07da18dbfe816dead6e9dbf19c288f2f40d91033ae252e0201e7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:22.346991Z","signature_b64":"MS0cMh8MIJdmBJQR1H7xkwfYh7PjwphkOzQs06TE4fOQLxBlTAcaf3xRZptq5L9dGY6apJElO9E/yW7aibUPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3faa05f9bc07da18dbfe816dead6e9dbf19c288f2f40d91033ae252e0201e7e","last_reissued_at":"2026-07-05T07:38:22.346530Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:22.346530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08412","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4UHQAJfGbYpi8ljEvFgXKiEUh+N4O9XovFsl4fv3qWhzu9AR7kwYxX025xhDKvso9KCk0aOY571kS2F1bc6PBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:53:42.705056Z"},"content_sha256":"0c416b464d7a54d4de2f98287db2726276fb0d2373af4cb5097416aeba09bf64","schema_version":"1.0","event_id":"sha256:0c416b464d7a54d4de2f98287db2726276fb0d2373af4cb5097416aeba09bf64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4P5KAX43YB62DDN75ALN5LLOTW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversarial Attacks on Graph Neural Networks via Meta Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Z\\\"ugner, Stephan G\\\"unnemann","submitted_at":"2019-02-22T09:20:05Z","abstract_excerpt":"Deep learning models for graphs have advanced the state of the art on many tasks. Despite their recent success, little is known about their robustness. We investigate training time attacks on graph neural networks for node classification that perturb the discrete graph structure. Our core principle is to use meta-gradients to solve the bilevel problem underlying training-time attacks, essentially treating the graph as a hyperparameter to optimize. Our experiments show that small graph perturbations consistently lead to a strong decrease in performance for graph convolutional networks, and even"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08412","kind":"arxiv","version":2},"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/1902.08412/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:38:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Za03kQvUiDjZeo8kXD92MrlbjkbpA0C6ZWu4HwyvkUQPjFbIKdzbuBOmvz98qgMSD+ZxuMS4liA2tZr5cxXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:53:42.705540Z"},"content_sha256":"b9008dd9cdc58073e973587db4e923530bf35a467ba791aa733be21f9b899e90","schema_version":"1.0","event_id":"sha256:b9008dd9cdc58073e973587db4e923530bf35a467ba791aa733be21f9b899e90"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4P5KAX43YB62DDN75ALN5LLOTW/bundle.json","state_url":"https://pith.science/pith/4P5KAX43YB62DDN75ALN5LLOTW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4P5KAX43YB62DDN75ALN5LLOTW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T21:53:42Z","links":{"resolver":"https://pith.science/pith/4P5KAX43YB62DDN75ALN5LLOTW","bundle":"https://pith.science/pith/4P5KAX43YB62DDN75ALN5LLOTW/bundle.json","state":"https://pith.science/pith/4P5KAX43YB62DDN75ALN5LLOTW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4P5KAX43YB62DDN75ALN5LLOTW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4P5KAX43YB62DDN75ALN5LLOTW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ced2ad1ba3f1e6f55668c1ab24e913aad0e69991fdba550da9b14210b079b760","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-22T09:20:05Z","title_canon_sha256":"4516657da7999b623a48093a11f8b915ca115dff5c0a9cd6fb09b662a142ed3e"},"schema_version":"1.0","source":{"id":"1902.08412","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08412","created_at":"2026-07-05T07:38:22Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08412v2","created_at":"2026-07-05T07:38:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08412","created_at":"2026-07-05T07:38:22Z"},{"alias_kind":"pith_short_12","alias_value":"4P5KAX43YB62","created_at":"2026-07-05T07:38:22Z"},{"alias_kind":"pith_short_16","alias_value":"4P5KAX43YB62DDN7","created_at":"2026-07-05T07:38:22Z"},{"alias_kind":"pith_short_8","alias_value":"4P5KAX43","created_at":"2026-07-05T07:38:22Z"}],"graph_snapshots":[{"event_id":"sha256:b9008dd9cdc58073e973587db4e923530bf35a467ba791aa733be21f9b899e90","target":"graph","created_at":"2026-07-05T07:38:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1902.08412/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deep learning models for graphs have advanced the state of the art on many tasks. Despite their recent success, little is known about their robustness. We investigate training time attacks on graph neural networks for node classification that perturb the discrete graph structure. Our core principle is to use meta-gradients to solve the bilevel problem underlying training-time attacks, essentially treating the graph as a hyperparameter to optimize. Our experiments show that small graph perturbations consistently lead to a strong decrease in performance for graph convolutional networks, and even","authors_text":"Daniel Z\\\"ugner, Stephan G\\\"unnemann","cross_cats":["cs.CR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-22T09:20:05Z","title":"Adversarial Attacks on Graph Neural Networks via Meta Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08412","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0c416b464d7a54d4de2f98287db2726276fb0d2373af4cb5097416aeba09bf64","target":"record","created_at":"2026-07-05T07:38:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ced2ad1ba3f1e6f55668c1ab24e913aad0e69991fdba550da9b14210b079b760","cross_cats_sorted":["cs.CR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-22T09:20:05Z","title_canon_sha256":"4516657da7999b623a48093a11f8b915ca115dff5c0a9cd6fb09b662a142ed3e"},"schema_version":"1.0","source":{"id":"1902.08412","kind":"arxiv","version":2}},"canonical_sha256":"e3faa05f9bc07da18dbfe816dead6e9dbf19c288f2f40d91033ae252e0201e7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3faa05f9bc07da18dbfe816dead6e9dbf19c288f2f40d91033ae252e0201e7e","first_computed_at":"2026-07-05T07:38:22.346530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:38:22.346530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MS0cMh8MIJdmBJQR1H7xkwfYh7PjwphkOzQs06TE4fOQLxBlTAcaf3xRZptq5L9dGY6apJElO9E/yW7aibUPAg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:38:22.346991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08412","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c416b464d7a54d4de2f98287db2726276fb0d2373af4cb5097416aeba09bf64","sha256:b9008dd9cdc58073e973587db4e923530bf35a467ba791aa733be21f9b899e90"],"state_sha256":"242e395c24fb03a806c39e6a0feaa54a03565f033d628123cf8a135b0be1c492"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l8o9NT8WMyd/Wq/wSk2hHrR7pg4bJ7zZC6xO2nhr0ZOk+5CMSwDRKrnVd3PN/+kexjrmcZsneHP/J6GweAmdCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T21:53:42.709855Z","bundle_sha256":"48c62abe05802aebb48649dd7380473ee5516c677c2c9837d4716b77a8f79976"}}