{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:B3BT7STAWHWMKOGYFGI6WBDAZF","short_pith_number":"pith:B3BT7STA","schema_version":"1.0","canonical_sha256":"0ec33fca60b1ecc538d82991eb0460c941dbb09477e9c79cdf4cbdb5352fadc0","source":{"kind":"arxiv","id":"2303.16270","version":2},"attestation_state":"computed","paper":{"title":"Communication-Efficient Vertical Federated Learning with Limited Overlapping Samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Can Zhao, Daguang Xu, Dong Yang, Holger R. Roth, Jingwei Sun, Vishwesh Nath, Wenqi Li, Yiran Chen, Ziyue Xu","submitted_at":"2023-03-28T19:30:23Z","abstract_excerpt":"Federated learning is a popular collaborative learning approach that enables clients to train a global model without sharing their local data. Vertical federated learning (VFL) deals with scenarios in which the data on clients have different feature spaces but share some overlapping samples. Existing VFL approaches suffer from high communication costs and cannot deal efficiently with limited overlapping samples commonly seen in the real world. We propose a practical vertical federated learning (VFL) framework called \\textbf{one-shot VFL} that can solve the communication bottleneck and the prob"},"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.16270","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-28T19:30:23Z","cross_cats_sorted":[],"title_canon_sha256":"0521192bfacc3d84039b3a74753ee62aef81bc0a66ece9672ffd901161026235","abstract_canon_sha256":"3ff5564525ab1ff737e27979aab630af48ae46f6bda07bcd0d2fa5e5573fd8d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:56:17.073461Z","signature_b64":"HyXSu0ytswfFS9q39OWuMGrn6eygskdaTFhTpNYIT+BNeLesbM0ps9ioVvowyk+uxEJEl+9msV5rUk5Yam9jBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ec33fca60b1ecc538d82991eb0460c941dbb09477e9c79cdf4cbdb5352fadc0","last_reissued_at":"2026-07-05T05:56:17.072980Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:56:17.072980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-Efficient Vertical Federated Learning with Limited Overlapping Samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Can Zhao, Daguang Xu, Dong Yang, Holger R. Roth, Jingwei Sun, Vishwesh Nath, Wenqi Li, Yiran Chen, Ziyue Xu","submitted_at":"2023-03-28T19:30:23Z","abstract_excerpt":"Federated learning is a popular collaborative learning approach that enables clients to train a global model without sharing their local data. Vertical federated learning (VFL) deals with scenarios in which the data on clients have different feature spaces but share some overlapping samples. Existing VFL approaches suffer from high communication costs and cannot deal efficiently with limited overlapping samples commonly seen in the real world. We propose a practical vertical federated learning (VFL) framework called \\textbf{one-shot VFL} that can solve the communication bottleneck and the prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16270","kind":"arxiv","version":2},"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.16270/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.16270","created_at":"2026-07-05T05:56:17.073041+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.16270v2","created_at":"2026-07-05T05:56:17.073041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16270","created_at":"2026-07-05T05:56:17.073041+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3BT7STAWHWM","created_at":"2026-07-05T05:56:17.073041+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3BT7STAWHWMKOGY","created_at":"2026-07-05T05:56:17.073041+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3BT7STA","created_at":"2026-07-05T05:56:17.073041+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.31331","citing_title":"Expected Gain-based Escalation in Vertical Federated Learning","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B3BT7STAWHWMKOGYFGI6WBDAZF","json":"https://pith.science/pith/B3BT7STAWHWMKOGYFGI6WBDAZF.json","graph_json":"https://pith.science/api/pith-number/B3BT7STAWHWMKOGYFGI6WBDAZF/graph.json","events_json":"https://pith.science/api/pith-number/B3BT7STAWHWMKOGYFGI6WBDAZF/events.json","paper":"https://pith.science/paper/B3BT7STA"},"agent_actions":{"view_html":"https://pith.science/pith/B3BT7STAWHWMKOGYFGI6WBDAZF","download_json":"https://pith.science/pith/B3BT7STAWHWMKOGYFGI6WBDAZF.json","view_paper":"https://pith.science/paper/B3BT7STA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.16270&json=true","fetch_graph":"https://pith.science/api/pith-number/B3BT7STAWHWMKOGYFGI6WBDAZF/graph.json","fetch_events":"https://pith.science/api/pith-number/B3BT7STAWHWMKOGYFGI6WBDAZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3BT7STAWHWMKOGYFGI6WBDAZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3BT7STAWHWMKOGYFGI6WBDAZF/action/storage_attestation","attest_author":"https://pith.science/pith/B3BT7STAWHWMKOGYFGI6WBDAZF/action/author_attestation","sign_citation":"https://pith.science/pith/B3BT7STAWHWMKOGYFGI6WBDAZF/action/citation_signature","submit_replication":"https://pith.science/pith/B3BT7STAWHWMKOGYFGI6WBDAZF/action/replication_record"}},"created_at":"2026-07-05T05:56:17.073041+00:00","updated_at":"2026-07-05T05:56:17.073041+00:00"}