{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:DZME7DOQQNTS2KZI6NUHRSFOJS","short_pith_number":"pith:DZME7DOQ","canonical_record":{"source":{"id":"2310.03312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2023-10-05T05:00:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"56ce54ced802e96543f95be31cfac0c69ce8c296850db0c2fcd158c7c0118087","abstract_canon_sha256":"8238d673fd0c60879e75df6a2ebbf8dc682f8a4cec773f62f83b0473cc5b35d6"},"schema_version":"1.0"},"canonical_sha256":"1e584f8dd083672d2b28f36878c8ae4cbdf3e03eb0ed9e99f4d83a3c76245cbd","source":{"kind":"arxiv","id":"2310.03312","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.03312","created_at":"2026-07-05T06:57:31Z"},{"alias_kind":"arxiv_version","alias_value":"2310.03312v1","created_at":"2026-07-05T06:57:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.03312","created_at":"2026-07-05T06:57:31Z"},{"alias_kind":"pith_short_12","alias_value":"DZME7DOQQNTS","created_at":"2026-07-05T06:57:31Z"},{"alias_kind":"pith_short_16","alias_value":"DZME7DOQQNTS2KZI","created_at":"2026-07-05T06:57:31Z"},{"alias_kind":"pith_short_8","alias_value":"DZME7DOQ","created_at":"2026-07-05T06:57:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:DZME7DOQQNTS2KZI6NUHRSFOJS","target":"record","payload":{"canonical_record":{"source":{"id":"2310.03312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2023-10-05T05:00:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"56ce54ced802e96543f95be31cfac0c69ce8c296850db0c2fcd158c7c0118087","abstract_canon_sha256":"8238d673fd0c60879e75df6a2ebbf8dc682f8a4cec773f62f83b0473cc5b35d6"},"schema_version":"1.0"},"canonical_sha256":"1e584f8dd083672d2b28f36878c8ae4cbdf3e03eb0ed9e99f4d83a3c76245cbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:57:31.465715Z","signature_b64":"dYlpiU33wSDGnEZ5vgt386I7q4PXQADqpQV0jm1eFRKp0xkCdvAs4rZe5LjPQVI6kmr34St712sD2TajiHsJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e584f8dd083672d2b28f36878c8ae4cbdf3e03eb0ed9e99f4d83a3c76245cbd","last_reissued_at":"2026-07-05T06:57:31.465214Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:57:31.465214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.03312","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-05T06:57:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qdf8QGc0ZfPVaYSYqDFe3kfnrhfFYLAzCU5YbZoqf0HqcPRxIYJWi+Z7x101dGCOWyTXgj8lXoRXsQooXlzDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T19:46:27.906565Z"},"content_sha256":"12d24e1dd83d9ade9c1ee1ba20d02826670dd385bd09c0733aae3937fb0033c6","schema_version":"1.0","event_id":"sha256:12d24e1dd83d9ade9c1ee1ba20d02826670dd385bd09c0733aae3937fb0033c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:DZME7DOQQNTS2KZI6NUHRSFOJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Certifiably Robust Graph Contrastive Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Enyan Dai, Minhua Lin, Suhang Wang, Teng Xiao, Xiang Zhang","submitted_at":"2023-10-05T05:00:11Z","abstract_excerpt":"Graph Contrastive Learning (GCL) has emerged as a popular unsupervised graph representation learning method. However, it has been shown that GCL is vulnerable to adversarial attacks on both the graph structure and node attributes. Although empirical approaches have been proposed to enhance the robustness of GCL, the certifiable robustness of GCL is still remain unexplored. In this paper, we develop the first certifiably robust framework in GCL. Specifically, we first propose a unified criteria to evaluate and certify the robustness of GCL. We then introduce a novel technique, RES (Randomized E"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.03312","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/2310.03312/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-05T06:57:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DqCgHYl7/S6WiXK471dPzF/c6Db6d3RFWAqyZdWMzqpzCp6HWZesTeq10gj1eQTVankHiXUhPbMdLsTPgY9hAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T19:46:27.906933Z"},"content_sha256":"06ec4a2cda1395bde2a48f47a848f57b468ba7d0bea67c6c30ea7a22e25f0ec6","schema_version":"1.0","event_id":"sha256:06ec4a2cda1395bde2a48f47a848f57b468ba7d0bea67c6c30ea7a22e25f0ec6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DZME7DOQQNTS2KZI6NUHRSFOJS/bundle.json","state_url":"https://pith.science/pith/DZME7DOQQNTS2KZI6NUHRSFOJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DZME7DOQQNTS2KZI6NUHRSFOJS/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-07-17T19:46:27Z","links":{"resolver":"https://pith.science/pith/DZME7DOQQNTS2KZI6NUHRSFOJS","bundle":"https://pith.science/pith/DZME7DOQQNTS2KZI6NUHRSFOJS/bundle.json","state":"https://pith.science/pith/DZME7DOQQNTS2KZI6NUHRSFOJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DZME7DOQQNTS2KZI6NUHRSFOJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:DZME7DOQQNTS2KZI6NUHRSFOJS","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":"8238d673fd0c60879e75df6a2ebbf8dc682f8a4cec773f62f83b0473cc5b35d6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2023-10-05T05:00:11Z","title_canon_sha256":"56ce54ced802e96543f95be31cfac0c69ce8c296850db0c2fcd158c7c0118087"},"schema_version":"1.0","source":{"id":"2310.03312","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.03312","created_at":"2026-07-05T06:57:31Z"},{"alias_kind":"arxiv_version","alias_value":"2310.03312v1","created_at":"2026-07-05T06:57:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.03312","created_at":"2026-07-05T06:57:31Z"},{"alias_kind":"pith_short_12","alias_value":"DZME7DOQQNTS","created_at":"2026-07-05T06:57:31Z"},{"alias_kind":"pith_short_16","alias_value":"DZME7DOQQNTS2KZI","created_at":"2026-07-05T06:57:31Z"},{"alias_kind":"pith_short_8","alias_value":"DZME7DOQ","created_at":"2026-07-05T06:57:31Z"}],"graph_snapshots":[{"event_id":"sha256:06ec4a2cda1395bde2a48f47a848f57b468ba7d0bea67c6c30ea7a22e25f0ec6","target":"graph","created_at":"2026-07-05T06:57:31Z","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/2310.03312/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Contrastive Learning (GCL) has emerged as a popular unsupervised graph representation learning method. However, it has been shown that GCL is vulnerable to adversarial attacks on both the graph structure and node attributes. Although empirical approaches have been proposed to enhance the robustness of GCL, the certifiable robustness of GCL is still remain unexplored. In this paper, we develop the first certifiably robust framework in GCL. Specifically, we first propose a unified criteria to evaluate and certify the robustness of GCL. We then introduce a novel technique, RES (Randomized E","authors_text":"Enyan Dai, Minhua Lin, Suhang Wang, Teng Xiao, Xiang Zhang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2023-10-05T05:00:11Z","title":"Certifiably Robust Graph Contrastive Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.03312","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:12d24e1dd83d9ade9c1ee1ba20d02826670dd385bd09c0733aae3937fb0033c6","target":"record","created_at":"2026-07-05T06:57:31Z","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":"8238d673fd0c60879e75df6a2ebbf8dc682f8a4cec773f62f83b0473cc5b35d6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2023-10-05T05:00:11Z","title_canon_sha256":"56ce54ced802e96543f95be31cfac0c69ce8c296850db0c2fcd158c7c0118087"},"schema_version":"1.0","source":{"id":"2310.03312","kind":"arxiv","version":1}},"canonical_sha256":"1e584f8dd083672d2b28f36878c8ae4cbdf3e03eb0ed9e99f4d83a3c76245cbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e584f8dd083672d2b28f36878c8ae4cbdf3e03eb0ed9e99f4d83a3c76245cbd","first_computed_at":"2026-07-05T06:57:31.465214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:57:31.465214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dYlpiU33wSDGnEZ5vgt386I7q4PXQADqpQV0jm1eFRKp0xkCdvAs4rZe5LjPQVI6kmr34St712sD2TajiHsJDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:57:31.465715Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.03312","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12d24e1dd83d9ade9c1ee1ba20d02826670dd385bd09c0733aae3937fb0033c6","sha256:06ec4a2cda1395bde2a48f47a848f57b468ba7d0bea67c6c30ea7a22e25f0ec6"],"state_sha256":"f2688c191f1c005c218565918bc69d2356049e99e80a79f9395660bfb6720f80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TBK6eMWCpW0tfhiBVFxHQla1LwhgtrMltg0V027eE3/ak4LwDtyDI7oWocrIuR7mm4163hOV0h51lBPKU/1NBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T19:46:27.908845Z","bundle_sha256":"3eab302e48d606a8912a08825c14db84c099ab5245c97ebfe2c50087558412d3"}}