{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6YR3PRSJ4LIZ4AKOY62I4Q2RAJ","short_pith_number":"pith:6YR3PRSJ","schema_version":"1.0","canonical_sha256":"f623b7c649e2d19e014ec7b48e43510272869b1d13df90b160b10406bc27ab8e","source":{"kind":"arxiv","id":"2605.12685","version":1},"attestation_state":"computed","paper":{"title":"A Unified Perspective for Learning Graph Representations Across Multi-Level Abstractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A unified contrastive framework learns graph representations by linearly combining node, proximity, cluster, and graph level signals with a parameter-free self-weighting mechanism.","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Abdoulaye Banir\\'e Diallo, Mohamed Bouguessa, Mohamed Mahmoud Amar, Nairouz Mrabah","submitted_at":"2026-05-12T19:33:39Z","abstract_excerpt":"Graph Self-Supervised Learning (GSSL) has emerged as a powerful paradigm for generating high-quality representations for graph-structured data. While multi-scale graph contrastive learning has received increasing attention, many existing methods still predominantly focus on a single graph abstraction level. To address this limitation, we propose a unified contrastive framework that can target node-level, proximity-level, cluster-level, and graph-level information and integrate them through a linear combination of similarity scores on positive pairs and dissimilarity scores (i.e., similarity sc"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.12685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T19:33:39Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3b4948d69bc0a6ca80d36b9d7e2ff5fd65a92e7c5842153cabc78d44b7040948","abstract_canon_sha256":"5eed13d50b53827798cbd06df4036e31661bd9cbb5fd1143e13313a37e38587e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:49.938075Z","signature_b64":"oex9ynIl1bA5bhgJ9aOWoSE6E0a2UsNlaLwfk1qVnT5cOMfRl4Hfezn3VyKQSPdrMO+WoMJ4CzBxGy3AdcJDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f623b7c649e2d19e014ec7b48e43510272869b1d13df90b160b10406bc27ab8e","last_reissued_at":"2026-05-18T03:09:49.937235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:49.937235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Perspective for Learning Graph Representations Across Multi-Level Abstractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A unified contrastive framework learns graph representations by linearly combining node, proximity, cluster, and graph level signals with a parameter-free self-weighting mechanism.","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Abdoulaye Banir\\'e Diallo, Mohamed Bouguessa, Mohamed Mahmoud Amar, Nairouz Mrabah","submitted_at":"2026-05-12T19:33:39Z","abstract_excerpt":"Graph Self-Supervised Learning (GSSL) has emerged as a powerful paradigm for generating high-quality representations for graph-structured data. While multi-scale graph contrastive learning has received increasing attention, many existing methods still predominantly focus on a single graph abstraction level. To address this limitation, we propose a unified contrastive framework that can target node-level, proximity-level, cluster-level, and graph-level information and integrate them through a linear combination of similarity scores on positive pairs and dissimilarity scores (i.e., similarity sc"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our approach not only enhances optimization flexibility but also eliminates the computational overhead of hyperparameter tuning in conventional multi-task GSSL methods. Comprehensive experiments on real-world datasets show that our methods consistently outperform state-of-the-art approaches across downstream tasks, including classification, clustering, and link prediction, in both single-level and multi-level scenarios.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That a linear combination of per-level similarity and dissimilarity scores, modulated by the proposed self-weighting, captures complementary multi-level information without destructive interference or the need for level-specific tuning.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A multi-level graph contrastive framework with adaptive self-weighting outperforms prior single-level and multi-task GSSL methods on classification, clustering, and link prediction.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A unified contrastive framework learns graph representations by linearly combining node, proximity, cluster, and graph level signals with a parameter-free self-weighting mechanism.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"4165d5c4a16d4ee6835e5764ee633c407ca175c63de606d7d8ef7c38558d9851"},"source":{"id":"2605.12685","kind":"arxiv","version":1},"verdict":{"id":"0607749a-e518-4620-a903-8109b68471b4","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T21:05:19.597474Z","strongest_claim":"Our approach not only enhances optimization flexibility but also eliminates the computational overhead of hyperparameter tuning in conventional multi-task GSSL methods. Comprehensive experiments on real-world datasets show that our methods consistently outperform state-of-the-art approaches across downstream tasks, including classification, clustering, and link prediction, in both single-level and multi-level scenarios.","one_line_summary":"A multi-level graph contrastive framework with adaptive self-weighting outperforms prior single-level and multi-task GSSL methods on classification, clustering, and link prediction.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That a linear combination of per-level similarity and dissimilarity scores, modulated by the proposed self-weighting, captures complementary multi-level information without destructive interference or the need for level-specific tuning.","pith_extraction_headline":"A unified contrastive framework learns graph representations by linearly combining node, proximity, cluster, and graph level signals with a parameter-free self-weighting mechanism."},"references":{"count":63,"sample":[{"doi":"","year":2025,"title":"Re- thinking deep clustering paradigms: Self-supervision is all you need,","work_id":"ccfd593a-e0d1-4ad3-81c2-68eadb62ea0d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Big self-supervised models are strong semi-supervised learners,","work_id":"513d3240-0fb8-405d-8153-170946d79204","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Toward convex manifolds: A geometric perspective for deep graph clus- tering of single-cell rna-seq data","work_id":"1a78b8db-4cf3-49c6-8d71-ba8a43ef62e2","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Exploring the interaction between local and global latent configurations for clustering single-cell rna-seq: a unified per- spective,","work_id":"f7f39add-2782-41a9-b4e6-5575c165a68c","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Graph self-supervised learning: A survey,","work_id":"9ae3777f-5e13-46dd-a82b-33f6487f25c1","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":63,"snapshot_sha256":"9e193197d17575f88b1bd1bfa636ad0653033eb3cbcfb3b4dd028ff3f72a473f","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"62748dd041f8adec6ffbb31f47a6e727c5a0f5c1a86bd5cfeb126bce6da81280"},"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":"2605.12685","created_at":"2026-05-18T03:09:49.937373+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.12685v1","created_at":"2026-05-18T03:09:49.937373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12685","created_at":"2026-05-18T03:09:49.937373+00:00"},{"alias_kind":"pith_short_12","alias_value":"6YR3PRSJ4LIZ","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"6YR3PRSJ4LIZ4AKO","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"6YR3PRSJ","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ","json":"https://pith.science/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ.json","graph_json":"https://pith.science/api/pith-number/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ/graph.json","events_json":"https://pith.science/api/pith-number/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ/events.json","paper":"https://pith.science/paper/6YR3PRSJ"},"agent_actions":{"view_html":"https://pith.science/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ","download_json":"https://pith.science/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ.json","view_paper":"https://pith.science/paper/6YR3PRSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.12685&json=true","fetch_graph":"https://pith.science/api/pith-number/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ/graph.json","fetch_events":"https://pith.science/api/pith-number/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ/action/storage_attestation","attest_author":"https://pith.science/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ/action/author_attestation","sign_citation":"https://pith.science/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ/action/citation_signature","submit_replication":"https://pith.science/pith/6YR3PRSJ4LIZ4AKOY62I4Q2RAJ/action/replication_record"}},"created_at":"2026-05-18T03:09:49.937373+00:00","updated_at":"2026-05-18T03:09:49.937373+00:00"}