{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BDRPVP3TWIKWJBERIGB7SJI3KY","short_pith_number":"pith:BDRPVP3T","schema_version":"1.0","canonical_sha256":"08e2fabf73b2156484914183f9251b5609baa3295f4afd422d101d07da3ff377","source":{"kind":"arxiv","id":"2311.13174","version":1},"attestation_state":"computed","paper":{"title":"SecureCut: Federated Gradient Boosting Decision Trees with Efficient Machine Unlearning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Bowen Li Jie Li, Chentao Wu, Jian Zhang","submitted_at":"2023-11-22T05:38:53Z","abstract_excerpt":"In response to legislation mandating companies to honor the \\textit{right to be forgotten} by erasing user data, it has become imperative to enable data removal in Vertical Federated Learning (VFL) where multiple parties provide private features for model training. In VFL, data removal, i.e., \\textit{machine unlearning}, often requires removing specific features across all samples under privacy guarentee in federated learning. To address this challenge, we propose \\methname, a novel Gradient Boosting Decision Tree (GBDT) framework that effectively enables both \\textit{instance unlearning} and "},"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":"2311.13174","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-22T05:38:53Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"21b4fe7f374af573c5f112e632fae4a1cf4e95532f539828bfda9b12400420e7","abstract_canon_sha256":"f2db51c11a2d065907dbf3b024e06499227d26ecc6f63f1b0303c464945c5d53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:25.483000Z","signature_b64":"OdSeEf2tCVQL7he75DAXiMoSpsKcgXc3ZE8QsR+yh1dNczR3QZLg8Q7kdu1OAayk/QH5odf8zDeGnM045nPaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08e2fabf73b2156484914183f9251b5609baa3295f4afd422d101d07da3ff377","last_reissued_at":"2026-07-05T07:15:25.482533Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:25.482533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SecureCut: Federated Gradient Boosting Decision Trees with Efficient Machine Unlearning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LG","authors_text":"Bowen Li Jie Li, Chentao Wu, Jian Zhang","submitted_at":"2023-11-22T05:38:53Z","abstract_excerpt":"In response to legislation mandating companies to honor the \\textit{right to be forgotten} by erasing user data, it has become imperative to enable data removal in Vertical Federated Learning (VFL) where multiple parties provide private features for model training. In VFL, data removal, i.e., \\textit{machine unlearning}, often requires removing specific features across all samples under privacy guarentee in federated learning. To address this challenge, we propose \\methname, a novel Gradient Boosting Decision Tree (GBDT) framework that effectively enables both \\textit{instance unlearning} and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13174","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/2311.13174/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":"2311.13174","created_at":"2026-07-05T07:15:25.482590+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.13174v1","created_at":"2026-07-05T07:15:25.482590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13174","created_at":"2026-07-05T07:15:25.482590+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDRPVP3TWIKW","created_at":"2026-07-05T07:15:25.482590+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDRPVP3TWIKWJBER","created_at":"2026-07-05T07:15:25.482590+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDRPVP3T","created_at":"2026-07-05T07:15:25.482590+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01634","citing_title":"Online Gradient Boosting Decision Tree: In-Place Updates for Efficient Adding/Deleting Data","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BDRPVP3TWIKWJBERIGB7SJI3KY","json":"https://pith.science/pith/BDRPVP3TWIKWJBERIGB7SJI3KY.json","graph_json":"https://pith.science/api/pith-number/BDRPVP3TWIKWJBERIGB7SJI3KY/graph.json","events_json":"https://pith.science/api/pith-number/BDRPVP3TWIKWJBERIGB7SJI3KY/events.json","paper":"https://pith.science/paper/BDRPVP3T"},"agent_actions":{"view_html":"https://pith.science/pith/BDRPVP3TWIKWJBERIGB7SJI3KY","download_json":"https://pith.science/pith/BDRPVP3TWIKWJBERIGB7SJI3KY.json","view_paper":"https://pith.science/paper/BDRPVP3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.13174&json=true","fetch_graph":"https://pith.science/api/pith-number/BDRPVP3TWIKWJBERIGB7SJI3KY/graph.json","fetch_events":"https://pith.science/api/pith-number/BDRPVP3TWIKWJBERIGB7SJI3KY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDRPVP3TWIKWJBERIGB7SJI3KY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDRPVP3TWIKWJBERIGB7SJI3KY/action/storage_attestation","attest_author":"https://pith.science/pith/BDRPVP3TWIKWJBERIGB7SJI3KY/action/author_attestation","sign_citation":"https://pith.science/pith/BDRPVP3TWIKWJBERIGB7SJI3KY/action/citation_signature","submit_replication":"https://pith.science/pith/BDRPVP3TWIKWJBERIGB7SJI3KY/action/replication_record"}},"created_at":"2026-07-05T07:15:25.482590+00:00","updated_at":"2026-07-05T07:15:25.482590+00:00"}