{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MSWZUE5RJUP4YUJIP6K4CB3DV3","short_pith_number":"pith:MSWZUE5R","schema_version":"1.0","canonical_sha256":"64ad9a13b14d1fcc51287f95c10763aec3b3b9c77e1708e974b0600285828ef4","source":{"kind":"arxiv","id":"2210.03011","version":1},"attestation_state":"computed","paper":{"title":"Uncovering the Structural Fairness in Graph Contrastive Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Chuan Shi, Le Song, Ruijia Wang, Xiao Wang","submitted_at":"2022-10-06T15:58:25Z","abstract_excerpt":"Recent studies show that graph convolutional network (GCN) often performs worse for low-degree nodes, exhibiting the so-called structural unfairness for graphs with long-tailed degree distributions prevalent in the real world. Graph contrastive learning (GCL), which marries the power of GCN and contrastive learning, has emerged as a promising self-supervised approach for learning node representations. How does GCL behave in terms of structural fairness? Surprisingly, we find that representations obtained by GCL methods are already fairer to degree bias than those learned by GCN. We theoretical"},"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":"2210.03011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-06T15:58:25Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"fb043c497bea181808984a163d49d7bde6e36de461205a12dfc8b4c94d23b338","abstract_canon_sha256":"fc380ee86a0ac1df7ed8891b7ac5f731d29896c86898380737f4353896ae5227"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:04:06.250493Z","signature_b64":"ndhsyvM32q0nFRjd1YpKzGFzTc53pDUnmvb+9txpaQClyqBj5tMVn+wqapH1uQcigsYIXZf8W7eKjxzoq+NkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64ad9a13b14d1fcc51287f95c10763aec3b3b9c77e1708e974b0600285828ef4","last_reissued_at":"2026-07-05T05:04:06.250093Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:04:06.250093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncovering the Structural Fairness in Graph Contrastive Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Chuan Shi, Le Song, Ruijia Wang, Xiao Wang","submitted_at":"2022-10-06T15:58:25Z","abstract_excerpt":"Recent studies show that graph convolutional network (GCN) often performs worse for low-degree nodes, exhibiting the so-called structural unfairness for graphs with long-tailed degree distributions prevalent in the real world. Graph contrastive learning (GCL), which marries the power of GCN and contrastive learning, has emerged as a promising self-supervised approach for learning node representations. How does GCL behave in terms of structural fairness? Surprisingly, we find that representations obtained by GCL methods are already fairer to degree bias than those learned by GCN. We theoretical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.03011","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/2210.03011/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":"2210.03011","created_at":"2026-07-05T05:04:06.250150+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.03011v1","created_at":"2026-07-05T05:04:06.250150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.03011","created_at":"2026-07-05T05:04:06.250150+00:00"},{"alias_kind":"pith_short_12","alias_value":"MSWZUE5RJUP4","created_at":"2026-07-05T05:04:06.250150+00:00"},{"alias_kind":"pith_short_16","alias_value":"MSWZUE5RJUP4YUJI","created_at":"2026-07-05T05:04:06.250150+00:00"},{"alias_kind":"pith_short_8","alias_value":"MSWZUE5R","created_at":"2026-07-05T05:04:06.250150+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MSWZUE5RJUP4YUJIP6K4CB3DV3","json":"https://pith.science/pith/MSWZUE5RJUP4YUJIP6K4CB3DV3.json","graph_json":"https://pith.science/api/pith-number/MSWZUE5RJUP4YUJIP6K4CB3DV3/graph.json","events_json":"https://pith.science/api/pith-number/MSWZUE5RJUP4YUJIP6K4CB3DV3/events.json","paper":"https://pith.science/paper/MSWZUE5R"},"agent_actions":{"view_html":"https://pith.science/pith/MSWZUE5RJUP4YUJIP6K4CB3DV3","download_json":"https://pith.science/pith/MSWZUE5RJUP4YUJIP6K4CB3DV3.json","view_paper":"https://pith.science/paper/MSWZUE5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.03011&json=true","fetch_graph":"https://pith.science/api/pith-number/MSWZUE5RJUP4YUJIP6K4CB3DV3/graph.json","fetch_events":"https://pith.science/api/pith-number/MSWZUE5RJUP4YUJIP6K4CB3DV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MSWZUE5RJUP4YUJIP6K4CB3DV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MSWZUE5RJUP4YUJIP6K4CB3DV3/action/storage_attestation","attest_author":"https://pith.science/pith/MSWZUE5RJUP4YUJIP6K4CB3DV3/action/author_attestation","sign_citation":"https://pith.science/pith/MSWZUE5RJUP4YUJIP6K4CB3DV3/action/citation_signature","submit_replication":"https://pith.science/pith/MSWZUE5RJUP4YUJIP6K4CB3DV3/action/replication_record"}},"created_at":"2026-07-05T05:04:06.250150+00:00","updated_at":"2026-07-05T05:04:06.250150+00:00"}