{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OMMEMUEJJMOEQF6DM6B7FMFPGZ","short_pith_number":"pith:OMMEMUEJ","schema_version":"1.0","canonical_sha256":"73184650894b1c4817c36783f2b0af366e969f389255927e40b906de60bbc9f2","source":{"kind":"arxiv","id":"2401.11750","version":1},"attestation_state":"computed","paper":{"title":"AdaFGL: A New Paradigm for Federated Node Classification with Topology Heterogeneity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB","cs.SI"],"primary_cat":"cs.LG","authors_text":"Guoren Wang, Henan Sun, Rong-Hua Li, Wentao Zhang, Xunkai Li, Zhengyu Wu","submitted_at":"2024-01-22T08:23:31Z","abstract_excerpt":"Recently, Federated Graph Learning (FGL) has attracted significant attention as a distributed framework based on graph neural networks, primarily due to its capability to break data silos. Existing FGL studies employ community split on the homophilous global graph by default to simulate federated semi-supervised node classification settings. Such a strategy assumes the consistency of topology between the multi-client subgraphs and the global graph, where connected nodes are highly likely to possess similar feature distributions and the same label. However, in real-world implementations, the va"},"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":"2401.11750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-22T08:23:31Z","cross_cats_sorted":["cs.AI","cs.DB","cs.SI"],"title_canon_sha256":"3a6985a0ec5a5fd863570cf456c5e44e79e79e522f711617096a4ff2e017aa05","abstract_canon_sha256":"de931e5b38646b12ff0fd95286b8e2ca37e5a0714149414cae9863c6c67d2fda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:36:09.380074Z","signature_b64":"IR4v1G47+DN58riUtjhGH5h3f4g+eMojTX3ptpUT/C+QdQS5aRKyK+2tydVzKn9X3Xw+1oDkKZNEka+Qh62EBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73184650894b1c4817c36783f2b0af366e969f389255927e40b906de60bbc9f2","last_reissued_at":"2026-07-05T07:36:09.379665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:36:09.379665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AdaFGL: A New Paradigm for Federated Node Classification with Topology Heterogeneity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB","cs.SI"],"primary_cat":"cs.LG","authors_text":"Guoren Wang, Henan Sun, Rong-Hua Li, Wentao Zhang, Xunkai Li, Zhengyu Wu","submitted_at":"2024-01-22T08:23:31Z","abstract_excerpt":"Recently, Federated Graph Learning (FGL) has attracted significant attention as a distributed framework based on graph neural networks, primarily due to its capability to break data silos. Existing FGL studies employ community split on the homophilous global graph by default to simulate federated semi-supervised node classification settings. Such a strategy assumes the consistency of topology between the multi-client subgraphs and the global graph, where connected nodes are highly likely to possess similar feature distributions and the same label. However, in real-world implementations, the va"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11750","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/2401.11750/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":"2401.11750","created_at":"2026-07-05T07:36:09.379723+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.11750v1","created_at":"2026-07-05T07:36:09.379723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11750","created_at":"2026-07-05T07:36:09.379723+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMMEMUEJJMOE","created_at":"2026-07-05T07:36:09.379723+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMMEMUEJJMOEQF6D","created_at":"2026-07-05T07:36:09.379723+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMMEMUEJ","created_at":"2026-07-05T07:36:09.379723+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.16541","citing_title":"A Comprehensive Data-centric Overview of Federated Graph Learning","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OMMEMUEJJMOEQF6DM6B7FMFPGZ","json":"https://pith.science/pith/OMMEMUEJJMOEQF6DM6B7FMFPGZ.json","graph_json":"https://pith.science/api/pith-number/OMMEMUEJJMOEQF6DM6B7FMFPGZ/graph.json","events_json":"https://pith.science/api/pith-number/OMMEMUEJJMOEQF6DM6B7FMFPGZ/events.json","paper":"https://pith.science/paper/OMMEMUEJ"},"agent_actions":{"view_html":"https://pith.science/pith/OMMEMUEJJMOEQF6DM6B7FMFPGZ","download_json":"https://pith.science/pith/OMMEMUEJJMOEQF6DM6B7FMFPGZ.json","view_paper":"https://pith.science/paper/OMMEMUEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.11750&json=true","fetch_graph":"https://pith.science/api/pith-number/OMMEMUEJJMOEQF6DM6B7FMFPGZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OMMEMUEJJMOEQF6DM6B7FMFPGZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMMEMUEJJMOEQF6DM6B7FMFPGZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMMEMUEJJMOEQF6DM6B7FMFPGZ/action/storage_attestation","attest_author":"https://pith.science/pith/OMMEMUEJJMOEQF6DM6B7FMFPGZ/action/author_attestation","sign_citation":"https://pith.science/pith/OMMEMUEJJMOEQF6DM6B7FMFPGZ/action/citation_signature","submit_replication":"https://pith.science/pith/OMMEMUEJJMOEQF6DM6B7FMFPGZ/action/replication_record"}},"created_at":"2026-07-05T07:36:09.379723+00:00","updated_at":"2026-07-05T07:36:09.379723+00:00"}