{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6O7MU7CBROW6MZAA6SXPSKOVSM","short_pith_number":"pith:6O7MU7CB","schema_version":"1.0","canonical_sha256":"f3beca7c418bade66400f4aef929d59309ff9a6f91fe14e57e0dc86e4a371d38","source":{"kind":"arxiv","id":"2109.01116","version":2},"attestation_state":"computed","paper":{"title":"An Empirical Study of Graph Contrastive Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Qiang Liu, Shu Wu, Yanqiao Zhu, Yichen Xu","submitted_at":"2021-09-02T17:43:45Z","abstract_excerpt":"Graph Contrastive Learning (GCL) establishes a new paradigm for learning graph representations without human annotations. Although remarkable progress has been witnessed recently, the success behind GCL is still left somewhat mysterious. In this work, we first identify several critical design considerations within a general GCL paradigm, including augmentation functions, contrasting modes, contrastive objectives, and negative mining techniques. Then, to understand the interplay of different GCL components, we conduct extensive, controlled experiments over a set of benchmark tasks on datasets a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2109.01116","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-09-02T17:43:45Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"1be050ba8e1acec3ab1c7f97802122d74643561f7349773e2fb43733a01ee401","abstract_canon_sha256":"cdb173d5e871b8a264f97bc51e4345dfeb551885b4c53729d97eedb50cd3e4ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:26:06.608413Z","signature_b64":"sz0M8zGuHCdQ3z/x01kOOS6J91Qy1VfCiZcWGUBYUFBN49orbG+AxoB7rkwRvAT8453w50askbe6zTgQ8fozCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3beca7c418bade66400f4aef929d59309ff9a6f91fe14e57e0dc86e4a371d38","last_reissued_at":"2026-07-05T03:26:06.607908Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:26:06.607908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Empirical Study of Graph Contrastive Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Qiang Liu, Shu Wu, Yanqiao Zhu, Yichen Xu","submitted_at":"2021-09-02T17:43:45Z","abstract_excerpt":"Graph Contrastive Learning (GCL) establishes a new paradigm for learning graph representations without human annotations. Although remarkable progress has been witnessed recently, the success behind GCL is still left somewhat mysterious. In this work, we first identify several critical design considerations within a general GCL paradigm, including augmentation functions, contrasting modes, contrastive objectives, and negative mining techniques. Then, to understand the interplay of different GCL components, we conduct extensive, controlled experiments over a set of benchmark tasks on datasets a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.01116","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/2109.01116/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2109.01116","created_at":"2026-07-05T03:26:06.607973+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.01116v2","created_at":"2026-07-05T03:26:06.607973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.01116","created_at":"2026-07-05T03:26:06.607973+00:00"},{"alias_kind":"pith_short_12","alias_value":"6O7MU7CBROW6","created_at":"2026-07-05T03:26:06.607973+00:00"},{"alias_kind":"pith_short_16","alias_value":"6O7MU7CBROW6MZAA","created_at":"2026-07-05T03:26:06.607973+00:00"},{"alias_kind":"pith_short_8","alias_value":"6O7MU7CB","created_at":"2026-07-05T03:26:06.607973+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.07969","citing_title":"Unified Work Embeddings: Contrastive Learning of a Bidirectional Multi-task Ranker","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12513","citing_title":"SP-GCRL: Influence Maximization on Incomplete Social Graphs","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6O7MU7CBROW6MZAA6SXPSKOVSM","json":"https://pith.science/pith/6O7MU7CBROW6MZAA6SXPSKOVSM.json","graph_json":"https://pith.science/api/pith-number/6O7MU7CBROW6MZAA6SXPSKOVSM/graph.json","events_json":"https://pith.science/api/pith-number/6O7MU7CBROW6MZAA6SXPSKOVSM/events.json","paper":"https://pith.science/paper/6O7MU7CB"},"agent_actions":{"view_html":"https://pith.science/pith/6O7MU7CBROW6MZAA6SXPSKOVSM","download_json":"https://pith.science/pith/6O7MU7CBROW6MZAA6SXPSKOVSM.json","view_paper":"https://pith.science/paper/6O7MU7CB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.01116&json=true","fetch_graph":"https://pith.science/api/pith-number/6O7MU7CBROW6MZAA6SXPSKOVSM/graph.json","fetch_events":"https://pith.science/api/pith-number/6O7MU7CBROW6MZAA6SXPSKOVSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6O7MU7CBROW6MZAA6SXPSKOVSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6O7MU7CBROW6MZAA6SXPSKOVSM/action/storage_attestation","attest_author":"https://pith.science/pith/6O7MU7CBROW6MZAA6SXPSKOVSM/action/author_attestation","sign_citation":"https://pith.science/pith/6O7MU7CBROW6MZAA6SXPSKOVSM/action/citation_signature","submit_replication":"https://pith.science/pith/6O7MU7CBROW6MZAA6SXPSKOVSM/action/replication_record"}},"created_at":"2026-07-05T03:26:06.607973+00:00","updated_at":"2026-07-05T03:26:06.607973+00:00"}