{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:I2RWE77ZGBXEUN6CPE2AWN7MNF","short_pith_number":"pith:I2RWE77Z","canonical_record":{"source":{"id":"2403.02723","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-03-05T07:29:12Z","cross_cats_sorted":[],"title_canon_sha256":"72c6210f430dfd66e116a5fe9b1685d6f31be311172005cae6f841a3d77c8a7d","abstract_canon_sha256":"9951aa5ebe0900d1d715c4cfff59556e65c5dc68eac29641c538ff0cd1e2e6fb"},"schema_version":"1.0"},"canonical_sha256":"46a3627ff9306e4a37c279340b37ec6945f41f7fff6b2a9b56a027b1b41ccb14","source":{"kind":"arxiv","id":"2403.02723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.02723","created_at":"2026-07-05T07:52:21Z"},{"alias_kind":"arxiv_version","alias_value":"2403.02723v1","created_at":"2026-07-05T07:52:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02723","created_at":"2026-07-05T07:52:21Z"},{"alias_kind":"pith_short_12","alias_value":"I2RWE77ZGBXE","created_at":"2026-07-05T07:52:21Z"},{"alias_kind":"pith_short_16","alias_value":"I2RWE77ZGBXEUN6C","created_at":"2026-07-05T07:52:21Z"},{"alias_kind":"pith_short_8","alias_value":"I2RWE77Z","created_at":"2026-07-05T07:52:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:I2RWE77ZGBXEUN6CPE2AWN7MNF","target":"record","payload":{"canonical_record":{"source":{"id":"2403.02723","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-03-05T07:29:12Z","cross_cats_sorted":[],"title_canon_sha256":"72c6210f430dfd66e116a5fe9b1685d6f31be311172005cae6f841a3d77c8a7d","abstract_canon_sha256":"9951aa5ebe0900d1d715c4cfff59556e65c5dc68eac29641c538ff0cd1e2e6fb"},"schema_version":"1.0"},"canonical_sha256":"46a3627ff9306e4a37c279340b37ec6945f41f7fff6b2a9b56a027b1b41ccb14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:52:21.559696Z","signature_b64":"XJMBi17St8dEl0qAkzxnXcD6WvWJ75me417ktCSbRI0/eKgFmuUijag5PabEcrCg33ztMgHa6qzQxCb1sGvYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46a3627ff9306e4a37c279340b37ec6945f41f7fff6b2a9b56a027b1b41ccb14","last_reissued_at":"2026-07-05T07:52:21.559291Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:52:21.559291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.02723","source_version":1,"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:52:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KwxCbAYFDi9GbOWq+rtuIWYjlPhxqTfllGoUQupzqLgRRZW3ugIqWHzF+XsbN69HhXruIcI/BaC35AR8zXPoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:00:26.076526Z"},"content_sha256":"0814e2d26e1c28ff546d8ca12ef52f0e1ee338f00f883ae38fddb3ea6cbd4e68","schema_version":"1.0","event_id":"sha256:0814e2d26e1c28ff546d8ca12ef52f0e1ee338f00f883ae38fddb3ea6cbd4e68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:I2RWE77ZGBXEUN6CPE2AWN7MNF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Topology Attacks for Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chuan Shi, Junping Du, Lingjuan Lyu, Mengmei Zhang, Tianchi Yang, Xiao Wang","submitted_at":"2024-03-05T07:29:12Z","abstract_excerpt":"With the great popularity of Graph Neural Networks (GNNs), their robustness to adversarial topology attacks has received significant attention. Although many attack methods have been proposed, they mainly focus on fixed-budget attacks, aiming at finding the most adversarial perturbations within a fixed budget for target node. However, considering the varied robustness of each node, there is an inevitable dilemma caused by the fixed budget, i.e., no successful perturbation is found when the budget is relatively small, while if it is too large, the yielding redundant perturbations will hurt the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02723","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.02723/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:52:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vXvINmVj9sdZb2m5rUpykEZA7RjicWYS4p9/Ov9MZZuBanfXIVd2RcgDEd2VdSJ5gkm46t/7VDb6UYtdSCvvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:00:26.077342Z"},"content_sha256":"2a50fc0cf37a9916bcf3eb25dbba6ee310abd423ac449b85e45d040be362f1b4","schema_version":"1.0","event_id":"sha256:2a50fc0cf37a9916bcf3eb25dbba6ee310abd423ac449b85e45d040be362f1b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I2RWE77ZGBXEUN6CPE2AWN7MNF/bundle.json","state_url":"https://pith.science/pith/I2RWE77ZGBXEUN6CPE2AWN7MNF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I2RWE77ZGBXEUN6CPE2AWN7MNF/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-06T07:00:26Z","links":{"resolver":"https://pith.science/pith/I2RWE77ZGBXEUN6CPE2AWN7MNF","bundle":"https://pith.science/pith/I2RWE77ZGBXEUN6CPE2AWN7MNF/bundle.json","state":"https://pith.science/pith/I2RWE77ZGBXEUN6CPE2AWN7MNF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I2RWE77ZGBXEUN6CPE2AWN7MNF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:I2RWE77ZGBXEUN6CPE2AWN7MNF","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":"9951aa5ebe0900d1d715c4cfff59556e65c5dc68eac29641c538ff0cd1e2e6fb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-03-05T07:29:12Z","title_canon_sha256":"72c6210f430dfd66e116a5fe9b1685d6f31be311172005cae6f841a3d77c8a7d"},"schema_version":"1.0","source":{"id":"2403.02723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.02723","created_at":"2026-07-05T07:52:21Z"},{"alias_kind":"arxiv_version","alias_value":"2403.02723v1","created_at":"2026-07-05T07:52:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02723","created_at":"2026-07-05T07:52:21Z"},{"alias_kind":"pith_short_12","alias_value":"I2RWE77ZGBXE","created_at":"2026-07-05T07:52:21Z"},{"alias_kind":"pith_short_16","alias_value":"I2RWE77ZGBXEUN6C","created_at":"2026-07-05T07:52:21Z"},{"alias_kind":"pith_short_8","alias_value":"I2RWE77Z","created_at":"2026-07-05T07:52:21Z"}],"graph_snapshots":[{"event_id":"sha256:2a50fc0cf37a9916bcf3eb25dbba6ee310abd423ac449b85e45d040be362f1b4","target":"graph","created_at":"2026-07-05T07:52:21Z","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/2403.02723/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"With the great popularity of Graph Neural Networks (GNNs), their robustness to adversarial topology attacks has received significant attention. Although many attack methods have been proposed, they mainly focus on fixed-budget attacks, aiming at finding the most adversarial perturbations within a fixed budget for target node. However, considering the varied robustness of each node, there is an inevitable dilemma caused by the fixed budget, i.e., no successful perturbation is found when the budget is relatively small, while if it is too large, the yielding redundant perturbations will hurt the ","authors_text":"Chuan Shi, Junping Du, Lingjuan Lyu, Mengmei Zhang, Tianchi Yang, Xiao Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-03-05T07:29:12Z","title":"Minimum Topology Attacks for Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02723","kind":"arxiv","version":1},"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:0814e2d26e1c28ff546d8ca12ef52f0e1ee338f00f883ae38fddb3ea6cbd4e68","target":"record","created_at":"2026-07-05T07:52:21Z","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":"9951aa5ebe0900d1d715c4cfff59556e65c5dc68eac29641c538ff0cd1e2e6fb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-03-05T07:29:12Z","title_canon_sha256":"72c6210f430dfd66e116a5fe9b1685d6f31be311172005cae6f841a3d77c8a7d"},"schema_version":"1.0","source":{"id":"2403.02723","kind":"arxiv","version":1}},"canonical_sha256":"46a3627ff9306e4a37c279340b37ec6945f41f7fff6b2a9b56a027b1b41ccb14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46a3627ff9306e4a37c279340b37ec6945f41f7fff6b2a9b56a027b1b41ccb14","first_computed_at":"2026-07-05T07:52:21.559291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:52:21.559291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XJMBi17St8dEl0qAkzxnXcD6WvWJ75me417ktCSbRI0/eKgFmuUijag5PabEcrCg33ztMgHa6qzQxCb1sGvYDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:52:21.559696Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.02723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0814e2d26e1c28ff546d8ca12ef52f0e1ee338f00f883ae38fddb3ea6cbd4e68","sha256:2a50fc0cf37a9916bcf3eb25dbba6ee310abd423ac449b85e45d040be362f1b4"],"state_sha256":"9bec265e90d1c7279dcaf66c5b7014f72103fff853b6f4c158f54533ad024e53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0MJOhzROfDh/a8yJkKf0YPHZZpBuLBPOW/tGR8NUjNz8TZxoDzCaqPbmo4WlajDutRZSYWmJ5yxbKDm21+iDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T07:00:26.085266Z","bundle_sha256":"516fc98294578c7363217ba788b4e12e372b1d5a9e6fcb8dece1f4817b098b68"}}