{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:6ADZ2FTXFKYZGDU7PBXHABZVJ6","short_pith_number":"pith:6ADZ2FTX","canonical_record":{"source":{"id":"2508.09320","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-12T20:10:31Z","cross_cats_sorted":["cs.AI","cs.CR"],"title_canon_sha256":"cc82b35c0a4e3f0242c6c65866fc3a0566f39d4f60496584330c47615952e465","abstract_canon_sha256":"da0e69328c68a5b85d1a8b0decc4530f85c484e7be52e036ab614cb9831e17b5"},"schema_version":"1.0"},"canonical_sha256":"f0079d16772ab1930e9f786e7007354fbb284f5f0e3313bf71b64e708a4a157f","source":{"kind":"arxiv","id":"2508.09320","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.09320","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"2508.09320v3","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.09320","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"6ADZ2FTXFKYZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"6ADZ2FTXFKYZGDU7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"6ADZ2FTX","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:6ADZ2FTXFKYZGDU7PBXHABZVJ6","target":"record","payload":{"canonical_record":{"source":{"id":"2508.09320","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-12T20:10:31Z","cross_cats_sorted":["cs.AI","cs.CR"],"title_canon_sha256":"cc82b35c0a4e3f0242c6c65866fc3a0566f39d4f60496584330c47615952e465","abstract_canon_sha256":"da0e69328c68a5b85d1a8b0decc4530f85c484e7be52e036ab614cb9831e17b5"},"schema_version":"1.0"},"canonical_sha256":"f0079d16772ab1930e9f786e7007354fbb284f5f0e3313bf71b64e708a4a157f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:33.420131Z","signature_b64":"iKMqfspBGuYAK8nyK6ZJIt1XfsBtl9t3AylcEjQZvV2Xm8QrRuwLZ2x/8Gm/NU7ZcHA5z9iVgKp65rQgfLUFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0079d16772ab1930e9f786e7007354fbb284f5f0e3313bf71b64e708a4a157f","last_reissued_at":"2026-05-18T02:44:33.419672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:33.419672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.09320","source_version":3,"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-05-18T02:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5t8zHBFsLEzMdfWUbUKhf3lxbwys8mF9OjbCIP3NMBHD6/fwiXhD44Ml5cDXE17fx3JZc4YmfcxugVtOfvBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T06:55:00.477977Z"},"content_sha256":"a73c6b7c5f4c73188b6bfb306b99141e8222240cc456a60cd0f965cf88154809","schema_version":"1.0","event_id":"sha256:a73c6b7c5f4c73188b6bfb306b99141e8222240cc456a60cd0f965cf88154809"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:6ADZ2FTXFKYZGDU7PBXHABZVJ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact Verification of Graph Neural Networks with Incremental Constraint Solving","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.LG","authors_text":"Chia-Hsuan Lu, Marta Kwiatkowska, Minghao Liu","submitted_at":"2025-08-12T20:10:31Z","abstract_excerpt":"Graph neural networks (GNNs) are increasingly often employed in high-stakes applications, such as fraud detection or healthcare, but are susceptible to adversarial attacks. A number of techniques have been proposed to provide adversarial robustness guarantees, but support for commonly used aggregation functions in message-passing GNNs is lacking. In this paper, we develop an exact (sound and complete) verification method for GNNs to compute guarantees against attribute and structural perturbations that involve edge addition or deletion, subject to budget constraints. Our method employs constra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.09320","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":""},"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-05-18T02:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tHXtR3XAwaI4WCD1p/7Exq8sjjHP64TVlpgi+rZEmeqMOVuxvuADDq6t760ci8MAahph+r/n8/6L2A3jj1YwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T06:55:00.478640Z"},"content_sha256":"4ade39c2a66486c1d2ffaee70866441acfc7e4fd4f68bc4b83f3d480833e3869","schema_version":"1.0","event_id":"sha256:4ade39c2a66486c1d2ffaee70866441acfc7e4fd4f68bc4b83f3d480833e3869"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ADZ2FTXFKYZGDU7PBXHABZVJ6/bundle.json","state_url":"https://pith.science/pith/6ADZ2FTXFKYZGDU7PBXHABZVJ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ADZ2FTXFKYZGDU7PBXHABZVJ6/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-05-21T06:55:00Z","links":{"resolver":"https://pith.science/pith/6ADZ2FTXFKYZGDU7PBXHABZVJ6","bundle":"https://pith.science/pith/6ADZ2FTXFKYZGDU7PBXHABZVJ6/bundle.json","state":"https://pith.science/pith/6ADZ2FTXFKYZGDU7PBXHABZVJ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ADZ2FTXFKYZGDU7PBXHABZVJ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6ADZ2FTXFKYZGDU7PBXHABZVJ6","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":"da0e69328c68a5b85d1a8b0decc4530f85c484e7be52e036ab614cb9831e17b5","cross_cats_sorted":["cs.AI","cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-12T20:10:31Z","title_canon_sha256":"cc82b35c0a4e3f0242c6c65866fc3a0566f39d4f60496584330c47615952e465"},"schema_version":"1.0","source":{"id":"2508.09320","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.09320","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"2508.09320v3","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.09320","created_at":"2026-05-18T02:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"6ADZ2FTXFKYZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"6ADZ2FTXFKYZGDU7","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"6ADZ2FTX","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:4ade39c2a66486c1d2ffaee70866441acfc7e4fd4f68bc4b83f3d480833e3869","target":"graph","created_at":"2026-05-18T02:44:33Z","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"},"paper":{"abstract_excerpt":"Graph neural networks (GNNs) are increasingly often employed in high-stakes applications, such as fraud detection or healthcare, but are susceptible to adversarial attacks. A number of techniques have been proposed to provide adversarial robustness guarantees, but support for commonly used aggregation functions in message-passing GNNs is lacking. In this paper, we develop an exact (sound and complete) verification method for GNNs to compute guarantees against attribute and structural perturbations that involve edge addition or deletion, subject to budget constraints. Our method employs constra","authors_text":"Chia-Hsuan Lu, Marta Kwiatkowska, Minghao Liu","cross_cats":["cs.AI","cs.CR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-12T20:10:31Z","title":"Exact Verification of Graph Neural Networks with Incremental Constraint Solving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.09320","kind":"arxiv","version":3},"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:a73c6b7c5f4c73188b6bfb306b99141e8222240cc456a60cd0f965cf88154809","target":"record","created_at":"2026-05-18T02:44:33Z","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":"da0e69328c68a5b85d1a8b0decc4530f85c484e7be52e036ab614cb9831e17b5","cross_cats_sorted":["cs.AI","cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-12T20:10:31Z","title_canon_sha256":"cc82b35c0a4e3f0242c6c65866fc3a0566f39d4f60496584330c47615952e465"},"schema_version":"1.0","source":{"id":"2508.09320","kind":"arxiv","version":3}},"canonical_sha256":"f0079d16772ab1930e9f786e7007354fbb284f5f0e3313bf71b64e708a4a157f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0079d16772ab1930e9f786e7007354fbb284f5f0e3313bf71b64e708a4a157f","first_computed_at":"2026-05-18T02:44:33.419672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:33.419672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iKMqfspBGuYAK8nyK6ZJIt1XfsBtl9t3AylcEjQZvV2Xm8QrRuwLZ2x/8Gm/NU7ZcHA5z9iVgKp65rQgfLUFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:33.420131Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.09320","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a73c6b7c5f4c73188b6bfb306b99141e8222240cc456a60cd0f965cf88154809","sha256:4ade39c2a66486c1d2ffaee70866441acfc7e4fd4f68bc4b83f3d480833e3869"],"state_sha256":"2fd5ec36dc7a6e8ebd8dfffb3fcd928777a2717c610e4cf25ce9bb95f92626e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b14tBooEkKafLpemoMTbdoRSSflg/PpaJvHhoNScNaP4KqxI1JVjrALNrE+YarpPqQ37XqQEwotSVdmQ6XpyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T06:55:00.481852Z","bundle_sha256":"d966a363c1b0e7847b4bccc3d3f92053506df9344a74098f16374fa3eb56561e"}}