{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XYDQ6PRJ3CT46DQRQPXDFCYI4M","short_pith_number":"pith:XYDQ6PRJ","schema_version":"1.0","canonical_sha256":"be070f3e29d8a7cf0e1183ee328b08e315464e2c1a34b99dd80e20fa551db57b","source":{"kind":"arxiv","id":"2401.11755","version":1},"attestation_state":"computed","paper":{"title":"FedGTA: Topology-aware Averaging for Federated Graph Learning","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, Rong-Hua Li, Wentao Zhang, Xunkai Li, Yinlin Zhu, Zhengyu Wu","submitted_at":"2024-01-22T08:31:53Z","abstract_excerpt":"Federated Graph Learning (FGL) is a distributed machine learning paradigm that enables collaborative training on large-scale subgraphs across multiple local systems. Existing FGL studies fall into two categories: (i) FGL Optimization, which improves multi-client training in existing machine learning models; (ii) FGL Model, which enhances performance with complex local models and multi-client interactions. However, most FGL optimization strategies are designed specifically for the computer vision domain and ignore graph structure, presenting dissatisfied performance and slow convergence. Meanwh"},"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.11755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-01-22T08:31:53Z","cross_cats_sorted":["cs.AI","cs.DB","cs.SI"],"title_canon_sha256":"73f7e08241249401fa0bc71c6a5c2aa991305941456981c3e2e3da4995af807a","abstract_canon_sha256":"d71262f2737a608ecd3aeeecc4407573570153aa004d1cf8d5f490f63f8acf34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:36:09.464126Z","signature_b64":"3CTLtXQqbjdEcyupG/K2+gOkaQQ9kxgYHSWONIhFQ8gfrOItkEJ6xRkMoVr+/q2VodG7tF7Z7FdigciiFDmPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be070f3e29d8a7cf0e1183ee328b08e315464e2c1a34b99dd80e20fa551db57b","last_reissued_at":"2026-07-05T07:36:09.463653Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:36:09.463653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FedGTA: Topology-aware Averaging for Federated Graph Learning","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, Rong-Hua Li, Wentao Zhang, Xunkai Li, Yinlin Zhu, Zhengyu Wu","submitted_at":"2024-01-22T08:31:53Z","abstract_excerpt":"Federated Graph Learning (FGL) is a distributed machine learning paradigm that enables collaborative training on large-scale subgraphs across multiple local systems. Existing FGL studies fall into two categories: (i) FGL Optimization, which improves multi-client training in existing machine learning models; (ii) FGL Model, which enhances performance with complex local models and multi-client interactions. However, most FGL optimization strategies are designed specifically for the computer vision domain and ignore graph structure, presenting dissatisfied performance and slow convergence. Meanwh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11755","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.11755/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.11755","created_at":"2026-07-05T07:36:09.463710+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.11755v1","created_at":"2026-07-05T07:36:09.463710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11755","created_at":"2026-07-05T07:36:09.463710+00:00"},{"alias_kind":"pith_short_12","alias_value":"XYDQ6PRJ3CT4","created_at":"2026-07-05T07:36:09.463710+00:00"},{"alias_kind":"pith_short_16","alias_value":"XYDQ6PRJ3CT46DQR","created_at":"2026-07-05T07:36:09.463710+00:00"},{"alias_kind":"pith_short_8","alias_value":"XYDQ6PRJ","created_at":"2026-07-05T07:36:09.463710+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11919","citing_title":"STAGE: Tackling Semantic Drift in Multimodal Federated Graph Learning","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XYDQ6PRJ3CT46DQRQPXDFCYI4M","json":"https://pith.science/pith/XYDQ6PRJ3CT46DQRQPXDFCYI4M.json","graph_json":"https://pith.science/api/pith-number/XYDQ6PRJ3CT46DQRQPXDFCYI4M/graph.json","events_json":"https://pith.science/api/pith-number/XYDQ6PRJ3CT46DQRQPXDFCYI4M/events.json","paper":"https://pith.science/paper/XYDQ6PRJ"},"agent_actions":{"view_html":"https://pith.science/pith/XYDQ6PRJ3CT46DQRQPXDFCYI4M","download_json":"https://pith.science/pith/XYDQ6PRJ3CT46DQRQPXDFCYI4M.json","view_paper":"https://pith.science/paper/XYDQ6PRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.11755&json=true","fetch_graph":"https://pith.science/api/pith-number/XYDQ6PRJ3CT46DQRQPXDFCYI4M/graph.json","fetch_events":"https://pith.science/api/pith-number/XYDQ6PRJ3CT46DQRQPXDFCYI4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XYDQ6PRJ3CT46DQRQPXDFCYI4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XYDQ6PRJ3CT46DQRQPXDFCYI4M/action/storage_attestation","attest_author":"https://pith.science/pith/XYDQ6PRJ3CT46DQRQPXDFCYI4M/action/author_attestation","sign_citation":"https://pith.science/pith/XYDQ6PRJ3CT46DQRQPXDFCYI4M/action/citation_signature","submit_replication":"https://pith.science/pith/XYDQ6PRJ3CT46DQRQPXDFCYI4M/action/replication_record"}},"created_at":"2026-07-05T07:36:09.463710+00:00","updated_at":"2026-07-05T07:36:09.463710+00:00"}