{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:HIP66NP6WXFXBUXVHFDYW4C7BI","short_pith_number":"pith:HIP66NP6","schema_version":"1.0","canonical_sha256":"3a1fef35feb5cb70d2f539478b705f0a2035d1d1d119958e6e89f10610c4604e","source":{"kind":"arxiv","id":"2004.07427","version":3},"attestation_state":"computed","paper":{"title":"Asymmetrical Vertical Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Libin Wang, Xiong Zhang, Yang Liu","submitted_at":"2020-04-16T02:53:48Z","abstract_excerpt":"Federated learning is a distributed machine learning method that aims to preserve the privacy of sample features and labels. In a federated learning system, ID-based sample alignment approaches are usually applied with few efforts made on the protection of ID privacy. In real-life applications, however, the confidentiality of sample IDs, which are the strongest row identifiers, is also drawing much attention from many participants. To relax their privacy concerns about ID privacy, this paper formally proposes the notion of asymmetrical vertical federated learning and illustrates the way to pro"},"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":"2004.07427","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2020-04-16T02:53:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b9663755c2de9274c19301243264283642371f46a062329f6259830d4e052320","abstract_canon_sha256":"7cc4c4f8415c6b7116e8f9bbb75c4244e72ad1aa6e794aaff94b4fa0e27b222b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:09:29.960387Z","signature_b64":"JHAdvsLu+uPN7oAigrnAfZ2GeNL20f+yQxmHx76eKdars9SZKgiM82YI4/auKSDjdwcPKi/sBmwZbexn1q6RCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a1fef35feb5cb70d2f539478b705f0a2035d1d1d119958e6e89f10610c4604e","last_reissued_at":"2026-07-05T01:09:29.959893Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:09:29.959893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymmetrical Vertical Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Libin Wang, Xiong Zhang, Yang Liu","submitted_at":"2020-04-16T02:53:48Z","abstract_excerpt":"Federated learning is a distributed machine learning method that aims to preserve the privacy of sample features and labels. In a federated learning system, ID-based sample alignment approaches are usually applied with few efforts made on the protection of ID privacy. In real-life applications, however, the confidentiality of sample IDs, which are the strongest row identifiers, is also drawing much attention from many participants. To relax their privacy concerns about ID privacy, this paper formally proposes the notion of asymmetrical vertical federated learning and illustrates the way to pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.07427","kind":"arxiv","version":3},"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/2004.07427/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":"2004.07427","created_at":"2026-07-05T01:09:29.959951+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.07427v3","created_at":"2026-07-05T01:09:29.959951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.07427","created_at":"2026-07-05T01:09:29.959951+00:00"},{"alias_kind":"pith_short_12","alias_value":"HIP66NP6WXFX","created_at":"2026-07-05T01:09:29.959951+00:00"},{"alias_kind":"pith_short_16","alias_value":"HIP66NP6WXFXBUXV","created_at":"2026-07-05T01:09:29.959951+00:00"},{"alias_kind":"pith_short_8","alias_value":"HIP66NP6","created_at":"2026-07-05T01:09:29.959951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08027","citing_title":"CausShield: Sample Reconstruction-Resilient Vertical FL via Causal Representation Learning","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HIP66NP6WXFXBUXVHFDYW4C7BI","json":"https://pith.science/pith/HIP66NP6WXFXBUXVHFDYW4C7BI.json","graph_json":"https://pith.science/api/pith-number/HIP66NP6WXFXBUXVHFDYW4C7BI/graph.json","events_json":"https://pith.science/api/pith-number/HIP66NP6WXFXBUXVHFDYW4C7BI/events.json","paper":"https://pith.science/paper/HIP66NP6"},"agent_actions":{"view_html":"https://pith.science/pith/HIP66NP6WXFXBUXVHFDYW4C7BI","download_json":"https://pith.science/pith/HIP66NP6WXFXBUXVHFDYW4C7BI.json","view_paper":"https://pith.science/paper/HIP66NP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.07427&json=true","fetch_graph":"https://pith.science/api/pith-number/HIP66NP6WXFXBUXVHFDYW4C7BI/graph.json","fetch_events":"https://pith.science/api/pith-number/HIP66NP6WXFXBUXVHFDYW4C7BI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HIP66NP6WXFXBUXVHFDYW4C7BI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HIP66NP6WXFXBUXVHFDYW4C7BI/action/storage_attestation","attest_author":"https://pith.science/pith/HIP66NP6WXFXBUXVHFDYW4C7BI/action/author_attestation","sign_citation":"https://pith.science/pith/HIP66NP6WXFXBUXVHFDYW4C7BI/action/citation_signature","submit_replication":"https://pith.science/pith/HIP66NP6WXFXBUXVHFDYW4C7BI/action/replication_record"}},"created_at":"2026-07-05T01:09:29.959951+00:00","updated_at":"2026-07-05T01:09:29.959951+00:00"}