{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:4CQJ72UAQOY5B3HEAZK7FVP5BG","short_pith_number":"pith:4CQJ72UA","schema_version":"1.0","canonical_sha256":"e0a09fea8083b1d0ece40655f2d5fd0995cdd83d84f11973003bf72508669844","source":{"kind":"arxiv","id":"2201.10761","version":1},"attestation_state":"computed","paper":{"title":"An Efficient and Robust System for Vertically Federated Random Forest","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.DC"],"primary_cat":"cs.LG","authors_text":"Houpu Yao, Jiazhou Wang, Liefeng Bo, Peng Dai, Yanqing Chen","submitted_at":"2022-01-26T06:05:04Z","abstract_excerpt":"As there is a growing interest in utilizing data across multiple resources to build better machine learning models, many vertically federated learning algorithms have been proposed to preserve the data privacy of the participating organizations. However, the efficiency of existing vertically federated learning algorithms remains to be a big problem, especially when applied to large-scale real-world datasets. In this paper, we present a fast, accurate, scalable and yet robust system for vertically federated random forest. With extensive optimization, we achieved $5\\times$ and $83\\times$ speed u"},"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":"2201.10761","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-01-26T06:05:04Z","cross_cats_sorted":["cs.CR","cs.DC"],"title_canon_sha256":"0761dc240eb18a11ae02023576bbe5307f5cb6955c5d5a5a9b9b4f712a25caf3","abstract_canon_sha256":"f4438dae4fac05b9f6fd3be9b030231316101878f4bcb82c66d251e5db736627"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:51:49.393966Z","signature_b64":"2sWiG6C0nqQPQydc6WhC8zjAVlC/T9uU2zPtaaiI//uxb0cchqxz/FMef+IvluoPbBSkUIw2Fcc+DY/DIJ5vAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0a09fea8083b1d0ece40655f2d5fd0995cdd83d84f11973003bf72508669844","last_reissued_at":"2026-07-05T03:51:49.393567Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:51:49.393567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient and Robust System for Vertically Federated Random Forest","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.DC"],"primary_cat":"cs.LG","authors_text":"Houpu Yao, Jiazhou Wang, Liefeng Bo, Peng Dai, Yanqing Chen","submitted_at":"2022-01-26T06:05:04Z","abstract_excerpt":"As there is a growing interest in utilizing data across multiple resources to build better machine learning models, many vertically federated learning algorithms have been proposed to preserve the data privacy of the participating organizations. However, the efficiency of existing vertically federated learning algorithms remains to be a big problem, especially when applied to large-scale real-world datasets. In this paper, we present a fast, accurate, scalable and yet robust system for vertically federated random forest. With extensive optimization, we achieved $5\\times$ and $83\\times$ speed u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.10761","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/2201.10761/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":"2201.10761","created_at":"2026-07-05T03:51:49.393633+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.10761v1","created_at":"2026-07-05T03:51:49.393633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.10761","created_at":"2026-07-05T03:51:49.393633+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CQJ72UAQOY5","created_at":"2026-07-05T03:51:49.393633+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CQJ72UAQOY5B3HE","created_at":"2026-07-05T03:51:49.393633+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CQJ72UA","created_at":"2026-07-05T03:51:49.393633+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08176","citing_title":"FedGA-Tree: Federated Decision Tree using Genetic Algorithm","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4CQJ72UAQOY5B3HEAZK7FVP5BG","json":"https://pith.science/pith/4CQJ72UAQOY5B3HEAZK7FVP5BG.json","graph_json":"https://pith.science/api/pith-number/4CQJ72UAQOY5B3HEAZK7FVP5BG/graph.json","events_json":"https://pith.science/api/pith-number/4CQJ72UAQOY5B3HEAZK7FVP5BG/events.json","paper":"https://pith.science/paper/4CQJ72UA"},"agent_actions":{"view_html":"https://pith.science/pith/4CQJ72UAQOY5B3HEAZK7FVP5BG","download_json":"https://pith.science/pith/4CQJ72UAQOY5B3HEAZK7FVP5BG.json","view_paper":"https://pith.science/paper/4CQJ72UA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.10761&json=true","fetch_graph":"https://pith.science/api/pith-number/4CQJ72UAQOY5B3HEAZK7FVP5BG/graph.json","fetch_events":"https://pith.science/api/pith-number/4CQJ72UAQOY5B3HEAZK7FVP5BG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CQJ72UAQOY5B3HEAZK7FVP5BG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CQJ72UAQOY5B3HEAZK7FVP5BG/action/storage_attestation","attest_author":"https://pith.science/pith/4CQJ72UAQOY5B3HEAZK7FVP5BG/action/author_attestation","sign_citation":"https://pith.science/pith/4CQJ72UAQOY5B3HEAZK7FVP5BG/action/citation_signature","submit_replication":"https://pith.science/pith/4CQJ72UAQOY5B3HEAZK7FVP5BG/action/replication_record"}},"created_at":"2026-07-05T03:51:49.393633+00:00","updated_at":"2026-07-05T03:51:49.393633+00:00"}