{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:22MK3GZULRXXOZTUIUXYCBQIDI","short_pith_number":"pith:22MK3GZU","schema_version":"1.0","canonical_sha256":"d698ad9b345c6f776674452f8106081a1815d0c4acc538ff25f85d01be3662f9","source":{"kind":"arxiv","id":"2110.13567","version":2},"attestation_state":"computed","paper":{"title":"Pairwise Half-graph Discrimination: A Simple Graph-level Self-supervised Strategy for Pre-training Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Fei Ma, Guotong Xie, Jun Wang, Peng Gao, Pengyong Li, Seng Song, Xianggen Liu, Yixuan Qiao, Ziliang Li","submitted_at":"2021-10-26T10:51:13Z","abstract_excerpt":"Self-supervised learning has gradually emerged as a powerful technique for graph representation learning. However, transferable, generalizable, and robust representation learning on graph data still remains a challenge for pre-training graph neural networks. In this paper, we propose a simple and effective self-supervised pre-training strategy, named Pairwise Half-graph Discrimination (PHD), that explicitly pre-trains a graph neural network at graph-level. PHD is designed as a simple binary classification task to discriminate whether two half-graphs come from the same source. Experiments demon"},"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":"2110.13567","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-26T10:51:13Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7302097ab404b9945a1cb64ba7689b1829f21b1a7c52838568b089fc4801440c","abstract_canon_sha256":"2520946b3eb4991e5ae2d9a76a4d5ddd0afbe7344402c41cbe9b63001fc68fa4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:39:35.766976Z","signature_b64":"ziv+YBzVSFn2tlJXYQ0V4YvJ9JOUmUdQe6+jlHMqsUg/wy1MNmEpik4/J/LpDat/zmXkTnEzdJmgtkCs2hGZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d698ad9b345c6f776674452f8106081a1815d0c4acc538ff25f85d01be3662f9","last_reissued_at":"2026-07-05T03:39:35.766540Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:39:35.766540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pairwise Half-graph Discrimination: A Simple Graph-level Self-supervised Strategy for Pre-training Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Fei Ma, Guotong Xie, Jun Wang, Peng Gao, Pengyong Li, Seng Song, Xianggen Liu, Yixuan Qiao, Ziliang Li","submitted_at":"2021-10-26T10:51:13Z","abstract_excerpt":"Self-supervised learning has gradually emerged as a powerful technique for graph representation learning. However, transferable, generalizable, and robust representation learning on graph data still remains a challenge for pre-training graph neural networks. In this paper, we propose a simple and effective self-supervised pre-training strategy, named Pairwise Half-graph Discrimination (PHD), that explicitly pre-trains a graph neural network at graph-level. PHD is designed as a simple binary classification task to discriminate whether two half-graphs come from the same source. Experiments demon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.13567","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/2110.13567/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":"2110.13567","created_at":"2026-07-05T03:39:35.766606+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.13567v2","created_at":"2026-07-05T03:39:35.766606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.13567","created_at":"2026-07-05T03:39:35.766606+00:00"},{"alias_kind":"pith_short_12","alias_value":"22MK3GZULRXX","created_at":"2026-07-05T03:39:35.766606+00:00"},{"alias_kind":"pith_short_16","alias_value":"22MK3GZULRXXOZTU","created_at":"2026-07-05T03:39:35.766606+00:00"},{"alias_kind":"pith_short_8","alias_value":"22MK3GZU","created_at":"2026-07-05T03:39:35.766606+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/22MK3GZULRXXOZTUIUXYCBQIDI","json":"https://pith.science/pith/22MK3GZULRXXOZTUIUXYCBQIDI.json","graph_json":"https://pith.science/api/pith-number/22MK3GZULRXXOZTUIUXYCBQIDI/graph.json","events_json":"https://pith.science/api/pith-number/22MK3GZULRXXOZTUIUXYCBQIDI/events.json","paper":"https://pith.science/paper/22MK3GZU"},"agent_actions":{"view_html":"https://pith.science/pith/22MK3GZULRXXOZTUIUXYCBQIDI","download_json":"https://pith.science/pith/22MK3GZULRXXOZTUIUXYCBQIDI.json","view_paper":"https://pith.science/paper/22MK3GZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.13567&json=true","fetch_graph":"https://pith.science/api/pith-number/22MK3GZULRXXOZTUIUXYCBQIDI/graph.json","fetch_events":"https://pith.science/api/pith-number/22MK3GZULRXXOZTUIUXYCBQIDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22MK3GZULRXXOZTUIUXYCBQIDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22MK3GZULRXXOZTUIUXYCBQIDI/action/storage_attestation","attest_author":"https://pith.science/pith/22MK3GZULRXXOZTUIUXYCBQIDI/action/author_attestation","sign_citation":"https://pith.science/pith/22MK3GZULRXXOZTUIUXYCBQIDI/action/citation_signature","submit_replication":"https://pith.science/pith/22MK3GZULRXXOZTUIUXYCBQIDI/action/replication_record"}},"created_at":"2026-07-05T03:39:35.766606+00:00","updated_at":"2026-07-05T03:39:35.766606+00:00"}