{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZUTWOU3CTATCXBXUM5XJB6XPGT","short_pith_number":"pith:ZUTWOU3C","schema_version":"1.0","canonical_sha256":"cd2767536298262b86f4676e90faef34d2cdb3de874bda8c095ef956deb0833f","source":{"kind":"arxiv","id":"2505.02573","version":1},"attestation_state":"computed","paper":{"title":"Rethinking Federated Graph Learning: A Data Condensation Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB","cs.SI"],"primary_cat":"cs.LG","authors_text":"Hao Zhang, Lianglin Hu, Xunkai Li, Yinlin Zhu","submitted_at":"2025-05-05T11:23:29Z","abstract_excerpt":"Federated graph learning is a widely recognized technique that promotes collaborative training of graph neural networks (GNNs) by multi-client graphs.However, existing approaches heavily rely on the communication of model parameters or gradients for federated optimization and fail to adequately address the data heterogeneity introduced by intricate and diverse graph distributions. Although some methods attempt to share additional messages among the server and clients to improve federated convergence during communication, they introduce significant privacy risks and increase communication overh"},"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":"2505.02573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-05T11:23:29Z","cross_cats_sorted":["cs.AI","cs.DB","cs.SI"],"title_canon_sha256":"a477018a249ec7448be83f7692f6b8a276dbcd6e961321b49b89b7a65bfe50ef","abstract_canon_sha256":"fd297239f1236bf5425664a7da35c20ac322af809674cd13a46d0e632e5596de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:39.736081Z","signature_b64":"f3oMGRfB9uxQtve4ibKXy94yhR/QwtXMKW9Qg10nAhfipK5DpakL5ciwMGQUrTKU1Oe2wf+U+jyeLwGjOFamDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd2767536298262b86f4676e90faef34d2cdb3de874bda8c095ef956deb0833f","last_reissued_at":"2026-07-05T10:58:39.735593Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:39.735593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rethinking Federated Graph Learning: A Data Condensation Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB","cs.SI"],"primary_cat":"cs.LG","authors_text":"Hao Zhang, Lianglin Hu, Xunkai Li, Yinlin Zhu","submitted_at":"2025-05-05T11:23:29Z","abstract_excerpt":"Federated graph learning is a widely recognized technique that promotes collaborative training of graph neural networks (GNNs) by multi-client graphs.However, existing approaches heavily rely on the communication of model parameters or gradients for federated optimization and fail to adequately address the data heterogeneity introduced by intricate and diverse graph distributions. Although some methods attempt to share additional messages among the server and clients to improve federated convergence during communication, they introduce significant privacy risks and increase communication overh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.02573","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/2505.02573/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":"2505.02573","created_at":"2026-07-05T10:58:39.735649+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.02573v1","created_at":"2026-07-05T10:58:39.735649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.02573","created_at":"2026-07-05T10:58:39.735649+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZUTWOU3CTATC","created_at":"2026-07-05T10:58:39.735649+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZUTWOU3CTATCXBXU","created_at":"2026-07-05T10:58:39.735649+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZUTWOU3C","created_at":"2026-07-05T10:58:39.735649+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.11304","citing_title":"Personalized One-shot Federated Graph Learning for Heterogeneous Clients","ref_index":66,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZUTWOU3CTATCXBXUM5XJB6XPGT","json":"https://pith.science/pith/ZUTWOU3CTATCXBXUM5XJB6XPGT.json","graph_json":"https://pith.science/api/pith-number/ZUTWOU3CTATCXBXUM5XJB6XPGT/graph.json","events_json":"https://pith.science/api/pith-number/ZUTWOU3CTATCXBXUM5XJB6XPGT/events.json","paper":"https://pith.science/paper/ZUTWOU3C"},"agent_actions":{"view_html":"https://pith.science/pith/ZUTWOU3CTATCXBXUM5XJB6XPGT","download_json":"https://pith.science/pith/ZUTWOU3CTATCXBXUM5XJB6XPGT.json","view_paper":"https://pith.science/paper/ZUTWOU3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.02573&json=true","fetch_graph":"https://pith.science/api/pith-number/ZUTWOU3CTATCXBXUM5XJB6XPGT/graph.json","fetch_events":"https://pith.science/api/pith-number/ZUTWOU3CTATCXBXUM5XJB6XPGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZUTWOU3CTATCXBXUM5XJB6XPGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZUTWOU3CTATCXBXUM5XJB6XPGT/action/storage_attestation","attest_author":"https://pith.science/pith/ZUTWOU3CTATCXBXUM5XJB6XPGT/action/author_attestation","sign_citation":"https://pith.science/pith/ZUTWOU3CTATCXBXUM5XJB6XPGT/action/citation_signature","submit_replication":"https://pith.science/pith/ZUTWOU3CTATCXBXUM5XJB6XPGT/action/replication_record"}},"created_at":"2026-07-05T10:58:39.735649+00:00","updated_at":"2026-07-05T10:58:39.735649+00:00"}