{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:724CORKDOZMQE7XC6A2LBH6L7B","short_pith_number":"pith:724CORKD","canonical_record":{"source":{"id":"2309.13944","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-25T08:23:53Z","cross_cats_sorted":[],"title_canon_sha256":"1e60deb78ef0a4c5c08fcbe7a78c6c6ca219ae8154943a8a1a9c5a5ff6e716aa","abstract_canon_sha256":"640c9fc794e3c0e176f5d1c165ddbb93854ff4a59dd0d450dc02933af3d6fd94"},"schema_version":"1.0"},"canonical_sha256":"feb82745437659027ee2f034b09fcbf87ff4ffb5f37bba522453d26b5a6ccaad","source":{"kind":"arxiv","id":"2309.13944","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.13944","created_at":"2026-07-05T08:22:33Z"},{"alias_kind":"arxiv_version","alias_value":"2309.13944v4","created_at":"2026-07-05T08:22:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.13944","created_at":"2026-07-05T08:22:33Z"},{"alias_kind":"pith_short_12","alias_value":"724CORKDOZMQ","created_at":"2026-07-05T08:22:33Z"},{"alias_kind":"pith_short_16","alias_value":"724CORKDOZMQE7XC","created_at":"2026-07-05T08:22:33Z"},{"alias_kind":"pith_short_8","alias_value":"724CORKD","created_at":"2026-07-05T08:22:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:724CORKDOZMQE7XC6A2LBH6L7B","target":"record","payload":{"canonical_record":{"source":{"id":"2309.13944","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-25T08:23:53Z","cross_cats_sorted":[],"title_canon_sha256":"1e60deb78ef0a4c5c08fcbe7a78c6c6ca219ae8154943a8a1a9c5a5ff6e716aa","abstract_canon_sha256":"640c9fc794e3c0e176f5d1c165ddbb93854ff4a59dd0d450dc02933af3d6fd94"},"schema_version":"1.0"},"canonical_sha256":"feb82745437659027ee2f034b09fcbf87ff4ffb5f37bba522453d26b5a6ccaad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:33.399143Z","signature_b64":"kpKlGjeA5czWj/bH2W26ZD9n2uxSGt5z25IFIUAlb74G5loKQnfAVCbQ6bBjTF3iaPnf2lKqecuWNDkWriz6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"feb82745437659027ee2f034b09fcbf87ff4ffb5f37bba522453d26b5a6ccaad","last_reissued_at":"2026-07-05T08:22:33.398610Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:33.398610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.13944","source_version":4,"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-05T08:22:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pewVdSpiMwES7hgweKtqyYdtdciQwuJFyh6nlD/Amyl7RCRIQHihQ9j2VU/QMI44wx8q/hOYHzKT1qQ/mOPVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:00:31.830714Z"},"content_sha256":"3da26665ae10da794e3f1debcaaddbf9a083343250813efa6698a6f6d49aeb8f","schema_version":"1.0","event_id":"sha256:3da26665ae10da794e3f1debcaaddbf9a083343250813efa6698a6f6d49aeb8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:724CORKDOZMQE7XC6A2LBH6L7B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provable Training for Graph Contrastive Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chuan Shi, Mengmei Zhang, Nian Liu, Xiao Wang, Yue Yu","submitted_at":"2023-09-25T08:23:53Z","abstract_excerpt":"Graph Contrastive Learning (GCL) has emerged as a popular training approach for learning node embeddings from augmented graphs without labels. Despite the key principle that maximizing the similarity between positive node pairs while minimizing it between negative node pairs is well established, some fundamental problems are still unclear. Considering the complex graph structure, are some nodes consistently well-trained and following this principle even with different graph augmentations? Or are there some nodes more likely to be untrained across graph augmentations and violate the principle? "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.13944","kind":"arxiv","version":4},"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/2309.13944/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-05T08:22:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFaeilXFbfxT8Ts34gGRNrNHCC5fz3ErcnmCBOCNOyfyP0G5slWTQ/4i5PXs5vVF9jJVs2r/VDr+VldizQBaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T07:00:31.831291Z"},"content_sha256":"816de4d21539191dec60393592d5ca501d517699dad8bbe28af0c69c7614503b","schema_version":"1.0","event_id":"sha256:816de4d21539191dec60393592d5ca501d517699dad8bbe28af0c69c7614503b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/724CORKDOZMQE7XC6A2LBH6L7B/bundle.json","state_url":"https://pith.science/pith/724CORKDOZMQE7XC6A2LBH6L7B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/724CORKDOZMQE7XC6A2LBH6L7B/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:31Z","links":{"resolver":"https://pith.science/pith/724CORKDOZMQE7XC6A2LBH6L7B","bundle":"https://pith.science/pith/724CORKDOZMQE7XC6A2LBH6L7B/bundle.json","state":"https://pith.science/pith/724CORKDOZMQE7XC6A2LBH6L7B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/724CORKDOZMQE7XC6A2LBH6L7B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:724CORKDOZMQE7XC6A2LBH6L7B","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":"640c9fc794e3c0e176f5d1c165ddbb93854ff4a59dd0d450dc02933af3d6fd94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-25T08:23:53Z","title_canon_sha256":"1e60deb78ef0a4c5c08fcbe7a78c6c6ca219ae8154943a8a1a9c5a5ff6e716aa"},"schema_version":"1.0","source":{"id":"2309.13944","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.13944","created_at":"2026-07-05T08:22:33Z"},{"alias_kind":"arxiv_version","alias_value":"2309.13944v4","created_at":"2026-07-05T08:22:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.13944","created_at":"2026-07-05T08:22:33Z"},{"alias_kind":"pith_short_12","alias_value":"724CORKDOZMQ","created_at":"2026-07-05T08:22:33Z"},{"alias_kind":"pith_short_16","alias_value":"724CORKDOZMQE7XC","created_at":"2026-07-05T08:22:33Z"},{"alias_kind":"pith_short_8","alias_value":"724CORKD","created_at":"2026-07-05T08:22:33Z"}],"graph_snapshots":[{"event_id":"sha256:816de4d21539191dec60393592d5ca501d517699dad8bbe28af0c69c7614503b","target":"graph","created_at":"2026-07-05T08:22: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.13944/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 training approach for learning node embeddings from augmented graphs without labels. Despite the key principle that maximizing the similarity between positive node pairs while minimizing it between negative node pairs is well established, some fundamental problems are still unclear. Considering the complex graph structure, are some nodes consistently well-trained and following this principle even with different graph augmentations? Or are there some nodes more likely to be untrained across graph augmentations and violate the principle? ","authors_text":"Chuan Shi, Mengmei Zhang, Nian Liu, Xiao Wang, Yue Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-25T08:23:53Z","title":"Provable Training for Graph Contrastive Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.13944","kind":"arxiv","version":4},"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:3da26665ae10da794e3f1debcaaddbf9a083343250813efa6698a6f6d49aeb8f","target":"record","created_at":"2026-07-05T08:22: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":"640c9fc794e3c0e176f5d1c165ddbb93854ff4a59dd0d450dc02933af3d6fd94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-25T08:23:53Z","title_canon_sha256":"1e60deb78ef0a4c5c08fcbe7a78c6c6ca219ae8154943a8a1a9c5a5ff6e716aa"},"schema_version":"1.0","source":{"id":"2309.13944","kind":"arxiv","version":4}},"canonical_sha256":"feb82745437659027ee2f034b09fcbf87ff4ffb5f37bba522453d26b5a6ccaad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"feb82745437659027ee2f034b09fcbf87ff4ffb5f37bba522453d26b5a6ccaad","first_computed_at":"2026-07-05T08:22:33.398610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:22:33.398610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kpKlGjeA5czWj/bH2W26ZD9n2uxSGt5z25IFIUAlb74G5loKQnfAVCbQ6bBjTF3iaPnf2lKqecuWNDkWriz6Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:22:33.399143Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.13944","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3da26665ae10da794e3f1debcaaddbf9a083343250813efa6698a6f6d49aeb8f","sha256:816de4d21539191dec60393592d5ca501d517699dad8bbe28af0c69c7614503b"],"state_sha256":"de164846ba6e8dbb821d42b2767fe0110b3ae7967d0a94962c5a6542176a5c1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0pxyupnKzLywNFOickN2uY1wXXi86g8xZcqUZTBgLYSe4MNaF0ULaYyJVEEwVImY5+ebqiZtXTha+z48M3zODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T07:00:31.835108Z","bundle_sha256":"d7788a8e5f1a9719143837a4c503c536261a1553b2ee27d43cc1d9ecf9ebcd02"}}