{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VYQFPPFOXTSRD2WIIACJCWK5YD","short_pith_number":"pith:VYQFPPFO","schema_version":"1.0","canonical_sha256":"ae2057bcaebce511eac8400491595dc0d941cf29a8e32d0b176b385049e4e2e4","source":{"kind":"arxiv","id":"2406.07948","version":5},"attestation_state":"computed","paper":{"title":"Ents: An Efficient Three-party Training Framework for Decision Trees by Communication Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CR","authors_text":"Bingshuai Li, Guopeng Lin, Lushan Song, Ruisheng Zhou, Weili Han, Wenqiang Ruan, Yunfeng Shao","submitted_at":"2024-06-12T07:13:11Z","abstract_excerpt":"Multi-party training frameworks for decision trees based on secure multi-party computation enable multiple parties to train high-performance models on distributed private data with privacy preservation. The training process essentially involves frequent dataset splitting according to the splitting criterion (e.g. Gini impurity). However, existing multi-party training frameworks for decision trees demonstrate communication inefficiency due to the following issues: (1) They suffer from huge communication overhead in securely splitting a dataset with continuous attributes. (2) They suffer from hu"},"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":"2406.07948","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2024-06-12T07:13:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4939f4f54c9296dfc746ef193957fe016b92dd305426833e6bfb23e8a51d5c08","abstract_canon_sha256":"87ff86f5abf59180dfe7c13e5ac456a2a2e4ba136913dfe4c4ea8c076ad6e30f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:39:34.950893Z","signature_b64":"QTfhNoTpLNq5PFdcIOWCYcIq0tTi/DhXGVwgNCicVYeZnwdMaUXJoXWCTW6kMhgg8wZnSTHXfOgOu4+lndA9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae2057bcaebce511eac8400491595dc0d941cf29a8e32d0b176b385049e4e2e4","last_reissued_at":"2026-07-05T08:39:34.950421Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:39:34.950421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ents: An Efficient Three-party Training Framework for Decision Trees by Communication Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CR","authors_text":"Bingshuai Li, Guopeng Lin, Lushan Song, Ruisheng Zhou, Weili Han, Wenqiang Ruan, Yunfeng Shao","submitted_at":"2024-06-12T07:13:11Z","abstract_excerpt":"Multi-party training frameworks for decision trees based on secure multi-party computation enable multiple parties to train high-performance models on distributed private data with privacy preservation. The training process essentially involves frequent dataset splitting according to the splitting criterion (e.g. Gini impurity). However, existing multi-party training frameworks for decision trees demonstrate communication inefficiency due to the following issues: (1) They suffer from huge communication overhead in securely splitting a dataset with continuous attributes. (2) They suffer from hu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.07948","kind":"arxiv","version":5},"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/2406.07948/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":"2406.07948","created_at":"2026-07-05T08:39:34.950482+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.07948v5","created_at":"2026-07-05T08:39:34.950482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07948","created_at":"2026-07-05T08:39:34.950482+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYQFPPFOXTSR","created_at":"2026-07-05T08:39:34.950482+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYQFPPFOXTSRD2WI","created_at":"2026-07-05T08:39:34.950482+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYQFPPFO","created_at":"2026-07-05T08:39:34.950482+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VYQFPPFOXTSRD2WIIACJCWK5YD","json":"https://pith.science/pith/VYQFPPFOXTSRD2WIIACJCWK5YD.json","graph_json":"https://pith.science/api/pith-number/VYQFPPFOXTSRD2WIIACJCWK5YD/graph.json","events_json":"https://pith.science/api/pith-number/VYQFPPFOXTSRD2WIIACJCWK5YD/events.json","paper":"https://pith.science/paper/VYQFPPFO"},"agent_actions":{"view_html":"https://pith.science/pith/VYQFPPFOXTSRD2WIIACJCWK5YD","download_json":"https://pith.science/pith/VYQFPPFOXTSRD2WIIACJCWK5YD.json","view_paper":"https://pith.science/paper/VYQFPPFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.07948&json=true","fetch_graph":"https://pith.science/api/pith-number/VYQFPPFOXTSRD2WIIACJCWK5YD/graph.json","fetch_events":"https://pith.science/api/pith-number/VYQFPPFOXTSRD2WIIACJCWK5YD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYQFPPFOXTSRD2WIIACJCWK5YD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYQFPPFOXTSRD2WIIACJCWK5YD/action/storage_attestation","attest_author":"https://pith.science/pith/VYQFPPFOXTSRD2WIIACJCWK5YD/action/author_attestation","sign_citation":"https://pith.science/pith/VYQFPPFOXTSRD2WIIACJCWK5YD/action/citation_signature","submit_replication":"https://pith.science/pith/VYQFPPFOXTSRD2WIIACJCWK5YD/action/replication_record"}},"created_at":"2026-07-05T08:39:34.950482+00:00","updated_at":"2026-07-05T08:39:34.950482+00:00"}