{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YQEUGNX3OZPY5OC6UGIBKYIL6S","short_pith_number":"pith:YQEUGNX3","schema_version":"1.0","canonical_sha256":"c4094336fb765f8eb85ea19015610bf4896cb52c88b29cd858ee35e094445bb2","source":{"kind":"arxiv","id":"2411.07150","version":1},"attestation_state":"computed","paper":{"title":"Variational Graph Contrastive Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jhony H. Giraldo, Shifeng Xie","submitted_at":"2024-11-11T17:23:07Z","abstract_excerpt":"Graph representation learning (GRL) is a fundamental task in machine learning, aiming to encode high-dimensional graph-structured data into low-dimensional vectors. Self-supervised learning (SSL) methods are widely used in GRL because they can avoid expensive human annotation. In this work, we propose a novel Subgraph Gaussian Embedding Contrast (SGEC) method. Our approach introduces a subgraph Gaussian embedding module, which adaptively maps subgraphs to a structured Gaussian space, ensuring the preservation of graph characteristics while controlling the distribution of generated subgraphs. W"},"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":"2411.07150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-11T17:23:07Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3a2f241f6a1920b7510d95670b13d23518fc34e158ffc5b0ed49870a854a1430","abstract_canon_sha256":"5156c84f478270423f26017d2a35b8a19259717ca5365a98d0d05e6e482e1fb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:57.588270Z","signature_b64":"NxnzeIIdRyA73Xm1QeapKLLRKan+3ayKJ4Sa+7gvVHJv2QwPuF6MWbe4Sa+0EOYO2X+PUJYXEfLun/dn8pIDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4094336fb765f8eb85ea19015610bf4896cb52c88b29cd858ee35e094445bb2","last_reissued_at":"2026-07-05T09:33:57.587791Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:57.587791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variational Graph Contrastive Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jhony H. Giraldo, Shifeng Xie","submitted_at":"2024-11-11T17:23:07Z","abstract_excerpt":"Graph representation learning (GRL) is a fundamental task in machine learning, aiming to encode high-dimensional graph-structured data into low-dimensional vectors. Self-supervised learning (SSL) methods are widely used in GRL because they can avoid expensive human annotation. In this work, we propose a novel Subgraph Gaussian Embedding Contrast (SGEC) method. Our approach introduces a subgraph Gaussian embedding module, which adaptively maps subgraphs to a structured Gaussian space, ensuring the preservation of graph characteristics while controlling the distribution of generated subgraphs. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.07150","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/2411.07150/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":"2411.07150","created_at":"2026-07-05T09:33:57.587851+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.07150v1","created_at":"2026-07-05T09:33:57.587851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.07150","created_at":"2026-07-05T09:33:57.587851+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQEUGNX3OZPY","created_at":"2026-07-05T09:33:57.587851+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQEUGNX3OZPY5OC6","created_at":"2026-07-05T09:33:57.587851+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQEUGNX3","created_at":"2026-07-05T09:33:57.587851+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.14114","citing_title":"Evaluating Loss Functions for Graph Neural Networks: Towards Pretraining and Generalization","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YQEUGNX3OZPY5OC6UGIBKYIL6S","json":"https://pith.science/pith/YQEUGNX3OZPY5OC6UGIBKYIL6S.json","graph_json":"https://pith.science/api/pith-number/YQEUGNX3OZPY5OC6UGIBKYIL6S/graph.json","events_json":"https://pith.science/api/pith-number/YQEUGNX3OZPY5OC6UGIBKYIL6S/events.json","paper":"https://pith.science/paper/YQEUGNX3"},"agent_actions":{"view_html":"https://pith.science/pith/YQEUGNX3OZPY5OC6UGIBKYIL6S","download_json":"https://pith.science/pith/YQEUGNX3OZPY5OC6UGIBKYIL6S.json","view_paper":"https://pith.science/paper/YQEUGNX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.07150&json=true","fetch_graph":"https://pith.science/api/pith-number/YQEUGNX3OZPY5OC6UGIBKYIL6S/graph.json","fetch_events":"https://pith.science/api/pith-number/YQEUGNX3OZPY5OC6UGIBKYIL6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQEUGNX3OZPY5OC6UGIBKYIL6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQEUGNX3OZPY5OC6UGIBKYIL6S/action/storage_attestation","attest_author":"https://pith.science/pith/YQEUGNX3OZPY5OC6UGIBKYIL6S/action/author_attestation","sign_citation":"https://pith.science/pith/YQEUGNX3OZPY5OC6UGIBKYIL6S/action/citation_signature","submit_replication":"https://pith.science/pith/YQEUGNX3OZPY5OC6UGIBKYIL6S/action/replication_record"}},"created_at":"2026-07-05T09:33:57.587851+00:00","updated_at":"2026-07-05T09:33:57.587851+00:00"}