{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PNVH6ZCXK5YQGLVJ2OEVF5Z347","short_pith_number":"pith:PNVH6ZCX","schema_version":"1.0","canonical_sha256":"7b6a7f64575771032ea9d38952f73be7ed81547f98e7ca8a408d4cf07a5fb203","source":{"kind":"arxiv","id":"2007.06081","version":1},"attestation_state":"computed","paper":{"title":"VAFL: a Method of Vertical Asynchronous Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Tianyi Chen, Wotao Yin, Xiao Jin, Yuejiao Sun","submitted_at":"2020-07-12T20:09:25Z","abstract_excerpt":"Horizontal Federated learning (FL) handles multi-client data that share the same set of features, and vertical FL trains a better predictor that combine all the features from different clients. This paper targets solving vertical FL in an asynchronous fashion, and develops a simple FL method. The new method allows each client to run stochastic gradient algorithms without coordination with other clients, so it is suitable for intermittent connectivity of clients. This method further uses a new technique of perturbed local embedding to ensure data privacy and improve communication efficiency. Th"},"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":"2007.06081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-12T20:09:25Z","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"title_canon_sha256":"aa58f127b35e4255f7b167d5febbafb59ffe6392b2346abdfb0b7a81ab83b4bb","abstract_canon_sha256":"76e8f4cf34aad2fc11da7e679607881fca439b13113fea0c60c6d13757e2eb1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:10:48.339013Z","signature_b64":"Oo0x/OF3XbWV3sa1cyks/XVwHYkvbcB+y/JQHwszwwTUUuOdxTz2w8gAeViwkM04ww6sEerW6K783HSoTFggCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b6a7f64575771032ea9d38952f73be7ed81547f98e7ca8a408d4cf07a5fb203","last_reissued_at":"2026-07-05T02:10:48.338520Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:10:48.338520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VAFL: a Method of Vertical Asynchronous Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Tianyi Chen, Wotao Yin, Xiao Jin, Yuejiao Sun","submitted_at":"2020-07-12T20:09:25Z","abstract_excerpt":"Horizontal Federated learning (FL) handles multi-client data that share the same set of features, and vertical FL trains a better predictor that combine all the features from different clients. This paper targets solving vertical FL in an asynchronous fashion, and develops a simple FL method. The new method allows each client to run stochastic gradient algorithms without coordination with other clients, so it is suitable for intermittent connectivity of clients. This method further uses a new technique of perturbed local embedding to ensure data privacy and improve communication efficiency. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.06081","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/2007.06081/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":"2007.06081","created_at":"2026-07-05T02:10:48.338573+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.06081v1","created_at":"2026-07-05T02:10:48.338573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.06081","created_at":"2026-07-05T02:10:48.338573+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNVH6ZCXK5YQ","created_at":"2026-07-05T02:10:48.338573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNVH6ZCXK5YQGLVJ","created_at":"2026-07-05T02:10:48.338573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNVH6ZCX","created_at":"2026-07-05T02:10:48.338573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10333","citing_title":"Privacy-Preserving Credit Risk Prediction with Alternative Data","ref_index":73,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03862","citing_title":"SecureAFL: Secure Asynchronous Federated Learning","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08378","citing_title":"Reinforcement Learning for Scalable and Trustworthy Intelligent Systems","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07125","citing_title":"Scalable and Private Federated Learning Using Distributed Differential Privacy and Secure Aggregation","ref_index":85,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PNVH6ZCXK5YQGLVJ2OEVF5Z347","json":"https://pith.science/pith/PNVH6ZCXK5YQGLVJ2OEVF5Z347.json","graph_json":"https://pith.science/api/pith-number/PNVH6ZCXK5YQGLVJ2OEVF5Z347/graph.json","events_json":"https://pith.science/api/pith-number/PNVH6ZCXK5YQGLVJ2OEVF5Z347/events.json","paper":"https://pith.science/paper/PNVH6ZCX"},"agent_actions":{"view_html":"https://pith.science/pith/PNVH6ZCXK5YQGLVJ2OEVF5Z347","download_json":"https://pith.science/pith/PNVH6ZCXK5YQGLVJ2OEVF5Z347.json","view_paper":"https://pith.science/paper/PNVH6ZCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.06081&json=true","fetch_graph":"https://pith.science/api/pith-number/PNVH6ZCXK5YQGLVJ2OEVF5Z347/graph.json","fetch_events":"https://pith.science/api/pith-number/PNVH6ZCXK5YQGLVJ2OEVF5Z347/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNVH6ZCXK5YQGLVJ2OEVF5Z347/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNVH6ZCXK5YQGLVJ2OEVF5Z347/action/storage_attestation","attest_author":"https://pith.science/pith/PNVH6ZCXK5YQGLVJ2OEVF5Z347/action/author_attestation","sign_citation":"https://pith.science/pith/PNVH6ZCXK5YQGLVJ2OEVF5Z347/action/citation_signature","submit_replication":"https://pith.science/pith/PNVH6ZCXK5YQGLVJ2OEVF5Z347/action/replication_record"}},"created_at":"2026-07-05T02:10:48.338573+00:00","updated_at":"2026-07-05T02:10:48.338573+00:00"}