{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:K3B4FYQT347EZMJQCBVIWEDXH3","short_pith_number":"pith:K3B4FYQT","schema_version":"1.0","canonical_sha256":"56c3c2e213df3e4cb130106a8b10773efcf6ba9ef5690baef07b8c12f9af7ab9","source":{"kind":"arxiv","id":"2410.06340","version":4},"attestation_state":"computed","paper":{"title":"FedGraph: A Research Library and Benchmark for Federated Graph Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Carlee Joe-Wong, Junhao Li, Kay Liu, Philip S. Yu, Srivatsan Ravi, Weizhao Jin, Xinyi Fan, Yuan Li, Yuhang Yao, Yu Yang","submitted_at":"2024-10-08T20:18:18Z","abstract_excerpt":"Federated graph learning is an emerging field with significant practical challenges. While algorithms have been proposed to improve the accuracy of training graph neural networks, such as node classification on federated graphs, the system performance is often overlooked, despite it is crucial for real-world deployment. To bridge this gap, we introduce FedGraph, a research library designed for practical distributed training and comprehensive benchmarking of FGL algorithms. FedGraph supports a range of state-of-the-art graph learning methods and includes a monitoring class that evaluates system"},"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":"2410.06340","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-08T20:18:18Z","cross_cats_sorted":[],"title_canon_sha256":"73dfaccaa272e1b57602041f4cff4577c0a1a7297ba2be9607520a8785d5e279","abstract_canon_sha256":"0f70e61388df8691cd80a944fdc7d4fc24113f397cb07915e85a2cbb9c8b2438"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:03:43.585647Z","signature_b64":"aJiF3CH6/3SpJJcZL76/UOQ+GlQyWe7Tk1dh1BbdOdhE2qZi4Tyg4RkFYD3nmozT9gMp9kr3xkSo/ADHam2oDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56c3c2e213df3e4cb130106a8b10773efcf6ba9ef5690baef07b8c12f9af7ab9","last_reissued_at":"2026-07-05T12:03:43.585146Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:03:43.585146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FedGraph: A Research Library and Benchmark for Federated Graph Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Carlee Joe-Wong, Junhao Li, Kay Liu, Philip S. Yu, Srivatsan Ravi, Weizhao Jin, Xinyi Fan, Yuan Li, Yuhang Yao, Yu Yang","submitted_at":"2024-10-08T20:18:18Z","abstract_excerpt":"Federated graph learning is an emerging field with significant practical challenges. While algorithms have been proposed to improve the accuracy of training graph neural networks, such as node classification on federated graphs, the system performance is often overlooked, despite it is crucial for real-world deployment. To bridge this gap, we introduce FedGraph, a research library designed for practical distributed training and comprehensive benchmarking of FGL algorithms. FedGraph supports a range of state-of-the-art graph learning methods and includes a monitoring class that evaluates system"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06340","kind":"arxiv","version":4},"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/2410.06340/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":"2410.06340","created_at":"2026-07-05T12:03:43.585201+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.06340v4","created_at":"2026-07-05T12:03:43.585201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06340","created_at":"2026-07-05T12:03:43.585201+00:00"},{"alias_kind":"pith_short_12","alias_value":"K3B4FYQT347E","created_at":"2026-07-05T12:03:43.585201+00:00"},{"alias_kind":"pith_short_16","alias_value":"K3B4FYQT347EZMJQ","created_at":"2026-07-05T12:03:43.585201+00:00"},{"alias_kind":"pith_short_8","alias_value":"K3B4FYQT","created_at":"2026-07-05T12:03:43.585201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.18219","citing_title":"FedSA-GCL: A Semi-Asynchronous Federated Graph Learning Framework with Personalized Aggregation and Cluster-Aware Broadcasting","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K3B4FYQT347EZMJQCBVIWEDXH3","json":"https://pith.science/pith/K3B4FYQT347EZMJQCBVIWEDXH3.json","graph_json":"https://pith.science/api/pith-number/K3B4FYQT347EZMJQCBVIWEDXH3/graph.json","events_json":"https://pith.science/api/pith-number/K3B4FYQT347EZMJQCBVIWEDXH3/events.json","paper":"https://pith.science/paper/K3B4FYQT"},"agent_actions":{"view_html":"https://pith.science/pith/K3B4FYQT347EZMJQCBVIWEDXH3","download_json":"https://pith.science/pith/K3B4FYQT347EZMJQCBVIWEDXH3.json","view_paper":"https://pith.science/paper/K3B4FYQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.06340&json=true","fetch_graph":"https://pith.science/api/pith-number/K3B4FYQT347EZMJQCBVIWEDXH3/graph.json","fetch_events":"https://pith.science/api/pith-number/K3B4FYQT347EZMJQCBVIWEDXH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K3B4FYQT347EZMJQCBVIWEDXH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K3B4FYQT347EZMJQCBVIWEDXH3/action/storage_attestation","attest_author":"https://pith.science/pith/K3B4FYQT347EZMJQCBVIWEDXH3/action/author_attestation","sign_citation":"https://pith.science/pith/K3B4FYQT347EZMJQCBVIWEDXH3/action/citation_signature","submit_replication":"https://pith.science/pith/K3B4FYQT347EZMJQCBVIWEDXH3/action/replication_record"}},"created_at":"2026-07-05T12:03:43.585201+00:00","updated_at":"2026-07-05T12:03:43.585201+00:00"}