{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4POXD3NSAUG2XXNFLEYDXZCA3T","short_pith_number":"pith:4POXD3NS","schema_version":"1.0","canonical_sha256":"e3dd71edb2050dabdda559303be440dcfe4c108cb21df4204796504fdd469fca","source":{"kind":"arxiv","id":"2006.04131","version":2},"attestation_state":"computed","paper":{"title":"Deep Graph Contrastive Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Feng Yu, Liang Wang, Qiang Liu, Shu Wu, Yanqiao Zhu, Yichen Xu","submitted_at":"2020-06-07T11:50:45Z","abstract_excerpt":"Graph representation learning nowadays becomes fundamental in analyzing graph-structured data. Inspired by recent success of contrastive methods, in this paper, we propose a novel framework for unsupervised graph representation learning by leveraging a contrastive objective at the node level. Specifically, we generate two graph views by corruption and learn node representations by maximizing the agreement of node representations in these two views. To provide diverse node contexts for the contrastive objective, we propose a hybrid scheme for generating graph views on both structure and attribu"},"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":"2006.04131","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-07T11:50:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6f352318b4fd08e3d5e35c69ae6503de1e1470cbc5f3ebf7178e2b52443fed2f","abstract_canon_sha256":"ff59fb276f474ab0b7284889c0560fdfab9ab1e042fbcbe0a977a8b2b115625e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:18:03.207884Z","signature_b64":"aCkoapmLjZnEyGlb1do+ctBb7IZ9AN4PTQ//HOJVjkjjbMBmbw91U+uyZ3HDL7E1brw2eEJQ1Py8rW2ZHTVbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3dd71edb2050dabdda559303be440dcfe4c108cb21df4204796504fdd469fca","last_reissued_at":"2026-07-05T01:18:03.207411Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:18:03.207411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Graph Contrastive Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Feng Yu, Liang Wang, Qiang Liu, Shu Wu, Yanqiao Zhu, Yichen Xu","submitted_at":"2020-06-07T11:50:45Z","abstract_excerpt":"Graph representation learning nowadays becomes fundamental in analyzing graph-structured data. Inspired by recent success of contrastive methods, in this paper, we propose a novel framework for unsupervised graph representation learning by leveraging a contrastive objective at the node level. Specifically, we generate two graph views by corruption and learn node representations by maximizing the agreement of node representations in these two views. To provide diverse node contexts for the contrastive objective, we propose a hybrid scheme for generating graph views on both structure and attribu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.04131","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/2006.04131/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":"2006.04131","created_at":"2026-07-05T01:18:03.207468+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.04131v2","created_at":"2026-07-05T01:18:03.207468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.04131","created_at":"2026-07-05T01:18:03.207468+00:00"},{"alias_kind":"pith_short_12","alias_value":"4POXD3NSAUG2","created_at":"2026-07-05T01:18:03.207468+00:00"},{"alias_kind":"pith_short_16","alias_value":"4POXD3NSAUG2XXNF","created_at":"2026-07-05T01:18:03.207468+00:00"},{"alias_kind":"pith_short_8","alias_value":"4POXD3NS","created_at":"2026-07-05T01:18:03.207468+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":28,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17667","citing_title":"Handling Feature Heterogeneity with Learnable Graph Patches","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2606.11898","citing_title":"GraspLLM: Towards Zero-Shot Generalization on Text-Attributed Graphs with LLMs","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10284","citing_title":"Revisiting Positive Samples in Graph Contrastive Learning: From the Perspective of Message Passing","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00377","citing_title":"SAOT: Self-Supervised Continual Graph Learning with Structure-Aware Optimal Transport","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2606.03307","citing_title":"Generalizing Graph Foundation Models via Hyperbolic Retrieval-Augmented Generation","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2606.03315","citing_title":"A Graph Foundation Model with Spectral Parsing and Prototype-Guided Spatial Propagation","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2606.03270","citing_title":"Are Common Substructures Transferable? Riemannian Graph Foundation Model with Neural Vector Bundles","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15888","citing_title":"CHoE: Cross-Domain Heterogeneous Graph Prompt Learning via Structure-Conditioned Experts","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.26040","citing_title":"L2IR: Revealing Latent Intent in Graph Fraud Detection","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28990","citing_title":"Learning Robust and Task-Invariant Functional Representation from fMRI through Siamese Self-Supervised Learning","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11629","citing_title":"GP2F: Cross-Domain Graph Prompting with Adaptive Fusion of Pre-trained Graph Neural Networks","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2407.07639","citing_title":"Explaining Graph Neural Networks for Node Similarity on Graphs","ref_index":102,"is_internal_anchor":false},{"citing_arxiv_id":"2408.13471","citing_title":"Disentangled Generative Graph Representation Learning","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2501.00773","citing_title":"OpenGLT: A Comprehensive Benchmark of Graph Neural Networks for Graph-Level Tasks","ref_index":119,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18579","citing_title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15888","citing_title":"CHoE: Cross-Domain Heterogeneous Graph Prompt Learning via Structure-Conditioned Experts","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18579","citing_title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19916","citing_title":"Fast and Featureless Node Representation Learning with Partial Pairwise Supervision","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2510.22555","citing_title":"Cross-Paradigm Graph Backdoor Attacks with Promptable Subgraph Triggers","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2511.07969","citing_title":"Unified Work Embeddings: Contrastive Learning of a Bidirectional Multi-task Ranker","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2511.06216","citing_title":"Adaptive Multi-view Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2512.00716","citing_title":"Graph Data Augmentation with Contrastive Learning on Covariate Distribution Shift","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2512.24062","citing_title":"Energy-Balanced Hyperspherical Graph Representation Learning via Structural Binding and Entropic Dispersion","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2104.13478","citing_title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","ref_index":108,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08178","citing_title":"Generalized Category Discovery in Federated Graph Learning","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4POXD3NSAUG2XXNFLEYDXZCA3T","json":"https://pith.science/pith/4POXD3NSAUG2XXNFLEYDXZCA3T.json","graph_json":"https://pith.science/api/pith-number/4POXD3NSAUG2XXNFLEYDXZCA3T/graph.json","events_json":"https://pith.science/api/pith-number/4POXD3NSAUG2XXNFLEYDXZCA3T/events.json","paper":"https://pith.science/paper/4POXD3NS"},"agent_actions":{"view_html":"https://pith.science/pith/4POXD3NSAUG2XXNFLEYDXZCA3T","download_json":"https://pith.science/pith/4POXD3NSAUG2XXNFLEYDXZCA3T.json","view_paper":"https://pith.science/paper/4POXD3NS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.04131&json=true","fetch_graph":"https://pith.science/api/pith-number/4POXD3NSAUG2XXNFLEYDXZCA3T/graph.json","fetch_events":"https://pith.science/api/pith-number/4POXD3NSAUG2XXNFLEYDXZCA3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4POXD3NSAUG2XXNFLEYDXZCA3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4POXD3NSAUG2XXNFLEYDXZCA3T/action/storage_attestation","attest_author":"https://pith.science/pith/4POXD3NSAUG2XXNFLEYDXZCA3T/action/author_attestation","sign_citation":"https://pith.science/pith/4POXD3NSAUG2XXNFLEYDXZCA3T/action/citation_signature","submit_replication":"https://pith.science/pith/4POXD3NSAUG2XXNFLEYDXZCA3T/action/replication_record"}},"created_at":"2026-07-05T01:18:03.207468+00:00","updated_at":"2026-07-05T01:18:03.207468+00:00"}