{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5EH3D2DEZSVWGTVYAOELA4OHSX","short_pith_number":"pith:5EH3D2DE","schema_version":"1.0","canonical_sha256":"e90fb1e864ccab634eb80388b071c795df6e21fcfa9de09b3aa03f6425fb531e","source":{"kind":"arxiv","id":"2307.10318","version":2},"attestation_state":"computed","paper":{"title":"Eliminating Label Leakage in Tree-Based Vertical Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.LG","authors_text":"Hideaki Takahashi, Jingjing Liu, Yang Liu","submitted_at":"2023-07-19T06:28:12Z","abstract_excerpt":"Vertical federated learning (VFL) enables multiple parties with disjoint features of a common user set to train a machine learning model without sharing their private data. Tree-based models have become prevalent in VFL due to their interpretability and efficiency. However, the vulnerability of tree-based VFL has not been sufficiently investigated. In this study, we first introduce a novel label inference attack, ID2Graph, which utilizes the sets of record IDs assigned to each node (i.e., instance space)to deduce private training labels. ID2Graph attack generates a graph structure from trainin"},"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":"2307.10318","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-19T06:28:12Z","cross_cats_sorted":["cs.AI","cs.CR"],"title_canon_sha256":"a4df202ab03507f1feba5e7017092b1c0a1f586cd573299d9f3bc4965c1d86fa","abstract_canon_sha256":"9d173ba82d92335ea6684eb443ff3199af40ed33da34688a844c409420d14442"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:03:29.369707Z","signature_b64":"slPPU6XOSjyqKZpFi0DlXUxW2EQhFLfqO6jSG38EprMSVFT8DqwmV+KCrSf0as5Jxp1fUml0OqBYtv83GKuODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e90fb1e864ccab634eb80388b071c795df6e21fcfa9de09b3aa03f6425fb531e","last_reissued_at":"2026-07-05T07:03:29.369228Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:03:29.369228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Eliminating Label Leakage in Tree-Based Vertical Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.LG","authors_text":"Hideaki Takahashi, Jingjing Liu, Yang Liu","submitted_at":"2023-07-19T06:28:12Z","abstract_excerpt":"Vertical federated learning (VFL) enables multiple parties with disjoint features of a common user set to train a machine learning model without sharing their private data. Tree-based models have become prevalent in VFL due to their interpretability and efficiency. However, the vulnerability of tree-based VFL has not been sufficiently investigated. In this study, we first introduce a novel label inference attack, ID2Graph, which utilizes the sets of record IDs assigned to each node (i.e., instance space)to deduce private training labels. ID2Graph attack generates a graph structure from trainin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.10318","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/2307.10318/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":"2307.10318","created_at":"2026-07-05T07:03:29.369284+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.10318v2","created_at":"2026-07-05T07:03:29.369284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.10318","created_at":"2026-07-05T07:03:29.369284+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EH3D2DEZSVW","created_at":"2026-07-05T07:03:29.369284+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EH3D2DEZSVWGTVY","created_at":"2026-07-05T07:03:29.369284+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EH3D2DE","created_at":"2026-07-05T07:03:29.369284+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.26903","citing_title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","ref_index":55,"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":82,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5EH3D2DEZSVWGTVYAOELA4OHSX","json":"https://pith.science/pith/5EH3D2DEZSVWGTVYAOELA4OHSX.json","graph_json":"https://pith.science/api/pith-number/5EH3D2DEZSVWGTVYAOELA4OHSX/graph.json","events_json":"https://pith.science/api/pith-number/5EH3D2DEZSVWGTVYAOELA4OHSX/events.json","paper":"https://pith.science/paper/5EH3D2DE"},"agent_actions":{"view_html":"https://pith.science/pith/5EH3D2DEZSVWGTVYAOELA4OHSX","download_json":"https://pith.science/pith/5EH3D2DEZSVWGTVYAOELA4OHSX.json","view_paper":"https://pith.science/paper/5EH3D2DE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.10318&json=true","fetch_graph":"https://pith.science/api/pith-number/5EH3D2DEZSVWGTVYAOELA4OHSX/graph.json","fetch_events":"https://pith.science/api/pith-number/5EH3D2DEZSVWGTVYAOELA4OHSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EH3D2DEZSVWGTVYAOELA4OHSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EH3D2DEZSVWGTVYAOELA4OHSX/action/storage_attestation","attest_author":"https://pith.science/pith/5EH3D2DEZSVWGTVYAOELA4OHSX/action/author_attestation","sign_citation":"https://pith.science/pith/5EH3D2DEZSVWGTVYAOELA4OHSX/action/citation_signature","submit_replication":"https://pith.science/pith/5EH3D2DEZSVWGTVYAOELA4OHSX/action/replication_record"}},"created_at":"2026-07-05T07:03:29.369284+00:00","updated_at":"2026-07-05T07:03:29.369284+00:00"}