{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SLUR3KHMWDZOISPD5G7GD6ZBKL","short_pith_number":"pith:SLUR3KHM","schema_version":"1.0","canonical_sha256":"92e91da8ecb0f2e449e3e9be61fb2152fee01df3142baac9d0c448ecff89a39e","source":{"kind":"arxiv","id":"2303.09531","version":1},"attestation_state":"computed","paper":{"title":"GLASU: A Communication-Efficient Algorithm for Federated Learning with Vertically Distributed Graph Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jie Chen, Mingyi Hong, Xinwei Zhang","submitted_at":"2023-03-16T17:47:55Z","abstract_excerpt":"Vertical federated learning (VFL) is a distributed learning paradigm, where computing clients collectively train a model based on the partial features of the same set of samples they possess. Current research on VFL focuses on the case when samples are independent, but it rarely addresses an emerging scenario when samples are interrelated through a graph. For graph-structured data, graph neural networks (GNNs) are competitive machine learning models, but a naive implementation in the VFL setting causes a significant communication overhead. Moreover, the analysis of the training is faced with a"},"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":"2303.09531","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-16T17:47:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"db18384d695e0479d63b2bf99813d5758a5e16f9240167a2c6ed43a2f6de6919","abstract_canon_sha256":"895eab56a714d070c006e11861e4131b8c00f3eff8e2ec758818df9cc7b86219"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:51:54.567025Z","signature_b64":"6ot3M58fzmoFsBmfEed7bCTtRwD4UQiD3R4zuNsljRxoifsh2QbiR3F1mYQONN9qbENsR6et3E61GYow/Yi5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92e91da8ecb0f2e449e3e9be61fb2152fee01df3142baac9d0c448ecff89a39e","last_reissued_at":"2026-07-05T05:51:54.566600Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:51:54.566600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GLASU: A Communication-Efficient Algorithm for Federated Learning with Vertically Distributed Graph Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jie Chen, Mingyi Hong, Xinwei Zhang","submitted_at":"2023-03-16T17:47:55Z","abstract_excerpt":"Vertical federated learning (VFL) is a distributed learning paradigm, where computing clients collectively train a model based on the partial features of the same set of samples they possess. Current research on VFL focuses on the case when samples are independent, but it rarely addresses an emerging scenario when samples are interrelated through a graph. For graph-structured data, graph neural networks (GNNs) are competitive machine learning models, but a naive implementation in the VFL setting causes a significant communication overhead. Moreover, the analysis of the training is faced with a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.09531","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/2303.09531/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":"2303.09531","created_at":"2026-07-05T05:51:54.566656+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.09531v1","created_at":"2026-07-05T05:51:54.566656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.09531","created_at":"2026-07-05T05:51:54.566656+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLUR3KHMWDZO","created_at":"2026-07-05T05:51:54.566656+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLUR3KHMWDZOISPD","created_at":"2026-07-05T05:51:54.566656+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLUR3KHM","created_at":"2026-07-05T05:51:54.566656+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":69,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SLUR3KHMWDZOISPD5G7GD6ZBKL","json":"https://pith.science/pith/SLUR3KHMWDZOISPD5G7GD6ZBKL.json","graph_json":"https://pith.science/api/pith-number/SLUR3KHMWDZOISPD5G7GD6ZBKL/graph.json","events_json":"https://pith.science/api/pith-number/SLUR3KHMWDZOISPD5G7GD6ZBKL/events.json","paper":"https://pith.science/paper/SLUR3KHM"},"agent_actions":{"view_html":"https://pith.science/pith/SLUR3KHMWDZOISPD5G7GD6ZBKL","download_json":"https://pith.science/pith/SLUR3KHMWDZOISPD5G7GD6ZBKL.json","view_paper":"https://pith.science/paper/SLUR3KHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.09531&json=true","fetch_graph":"https://pith.science/api/pith-number/SLUR3KHMWDZOISPD5G7GD6ZBKL/graph.json","fetch_events":"https://pith.science/api/pith-number/SLUR3KHMWDZOISPD5G7GD6ZBKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLUR3KHMWDZOISPD5G7GD6ZBKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLUR3KHMWDZOISPD5G7GD6ZBKL/action/storage_attestation","attest_author":"https://pith.science/pith/SLUR3KHMWDZOISPD5G7GD6ZBKL/action/author_attestation","sign_citation":"https://pith.science/pith/SLUR3KHMWDZOISPD5G7GD6ZBKL/action/citation_signature","submit_replication":"https://pith.science/pith/SLUR3KHMWDZOISPD5G7GD6ZBKL/action/replication_record"}},"created_at":"2026-07-05T05:51:54.566656+00:00","updated_at":"2026-07-05T05:51:54.566656+00:00"}