{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3IA7WSDXCXYLHIVCQ3WOWRJLLO","short_pith_number":"pith:3IA7WSDX","schema_version":"1.0","canonical_sha256":"da01fb487715f0b3a2a286eceb452b5b8a17205094b2bb7b61ab69f0c1d20818","source":{"kind":"arxiv","id":"2406.02953","version":1},"attestation_state":"computed","paper":{"title":"GraphAlign: Pretraining One Graph Neural Network on Multiple Graphs via Feature Alignment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haozhan Li, Jie Tang, Yukuo Cen, Yuxiao Dong, Zhenyu Hou","submitted_at":"2024-06-05T05:22:32Z","abstract_excerpt":"Graph self-supervised learning (SSL) holds considerable promise for mining and learning with graph-structured data. Yet, a significant challenge in graph SSL lies in the feature discrepancy among graphs across different domains. In this work, we aim to pretrain one graph neural network (GNN) on a varied collection of graphs endowed with rich node features and subsequently apply the pretrained GNN to unseen graphs. We present a general GraphAlign method that can be seamlessly integrated into the existing graph SSL framework. To align feature distributions across disparate graphs, GraphAlign des"},"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":"2406.02953","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-05T05:22:32Z","cross_cats_sorted":[],"title_canon_sha256":"e27f8d0358c1d946d5e75f141b72202b04912db068b7cb8a3af93d6433649ce0","abstract_canon_sha256":"5956a91b858a9bb806b2456683890d41109f3a176fc738f0809ae0c98a582c99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:33.266885Z","signature_b64":"ReIp0Hr7V9xl87zjbcJ0SPMUuxMSRRdgng4MhV1JAoRIdZDexkilMrelBWw/65ruAwQRy3eGLUDGcspwHZ1zBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da01fb487715f0b3a2a286eceb452b5b8a17205094b2bb7b61ab69f0c1d20818","last_reissued_at":"2026-07-05T08:27:33.266327Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:33.266327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraphAlign: Pretraining One Graph Neural Network on Multiple Graphs via Feature Alignment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haozhan Li, Jie Tang, Yukuo Cen, Yuxiao Dong, Zhenyu Hou","submitted_at":"2024-06-05T05:22:32Z","abstract_excerpt":"Graph self-supervised learning (SSL) holds considerable promise for mining and learning with graph-structured data. Yet, a significant challenge in graph SSL lies in the feature discrepancy among graphs across different domains. In this work, we aim to pretrain one graph neural network (GNN) on a varied collection of graphs endowed with rich node features and subsequently apply the pretrained GNN to unseen graphs. We present a general GraphAlign method that can be seamlessly integrated into the existing graph SSL framework. To align feature distributions across disparate graphs, GraphAlign des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02953","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/2406.02953/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":"2406.02953","created_at":"2026-07-05T08:27:33.266385+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.02953v1","created_at":"2026-07-05T08:27:33.266385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02953","created_at":"2026-07-05T08:27:33.266385+00:00"},{"alias_kind":"pith_short_12","alias_value":"3IA7WSDXCXYL","created_at":"2026-07-05T08:27:33.266385+00:00"},{"alias_kind":"pith_short_16","alias_value":"3IA7WSDXCXYLHIVC","created_at":"2026-07-05T08:27:33.266385+00:00"},{"alias_kind":"pith_short_8","alias_value":"3IA7WSDX","created_at":"2026-07-05T08:27:33.266385+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12061","citing_title":"SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11257","citing_title":"Unified Graph Prompt Learning via Low-Rank Graph Message Prompting","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3IA7WSDXCXYLHIVCQ3WOWRJLLO","json":"https://pith.science/pith/3IA7WSDXCXYLHIVCQ3WOWRJLLO.json","graph_json":"https://pith.science/api/pith-number/3IA7WSDXCXYLHIVCQ3WOWRJLLO/graph.json","events_json":"https://pith.science/api/pith-number/3IA7WSDXCXYLHIVCQ3WOWRJLLO/events.json","paper":"https://pith.science/paper/3IA7WSDX"},"agent_actions":{"view_html":"https://pith.science/pith/3IA7WSDXCXYLHIVCQ3WOWRJLLO","download_json":"https://pith.science/pith/3IA7WSDXCXYLHIVCQ3WOWRJLLO.json","view_paper":"https://pith.science/paper/3IA7WSDX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.02953&json=true","fetch_graph":"https://pith.science/api/pith-number/3IA7WSDXCXYLHIVCQ3WOWRJLLO/graph.json","fetch_events":"https://pith.science/api/pith-number/3IA7WSDXCXYLHIVCQ3WOWRJLLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3IA7WSDXCXYLHIVCQ3WOWRJLLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3IA7WSDXCXYLHIVCQ3WOWRJLLO/action/storage_attestation","attest_author":"https://pith.science/pith/3IA7WSDXCXYLHIVCQ3WOWRJLLO/action/author_attestation","sign_citation":"https://pith.science/pith/3IA7WSDXCXYLHIVCQ3WOWRJLLO/action/citation_signature","submit_replication":"https://pith.science/pith/3IA7WSDXCXYLHIVCQ3WOWRJLLO/action/replication_record"}},"created_at":"2026-07-05T08:27:33.266385+00:00","updated_at":"2026-07-05T08:27:33.266385+00:00"}