BetweenCut: Private Heavy-Node Classification with Doubly Logarithmic Error in Tree Height

arXiv:2610.10075 · cs.CR, cs.DS · Submitted 2026-10-07 · Read on arXiv

cs.CR, cs.DS

Submitted: 2026-10-07

Updated: 2026-10-07

Terminology

• Differential Privacy — 17× in this paper · explained in 4 episodes
• Differentially Private — 16× in this paper · explained in 3 episodes
• Accuracy — 8× in this paper · explained in 1 episode
• Sparse Vector Technique — 5× in this paper
• Calibration — 4× in this paper · explained in 7 episodes
• Consistency — 4× in this paper · explained in 3 episodes
• Generative AI — 3× in this paper · explained in 2 episodes
• Adam — 1× in this paper · explained in 2 episodes
• Clustering — 1× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Pruning — 1× in this paper · explained in 4 episodes
• Sparsity — 1× in this paper · explained in 4 episodes

Related papers

• SoK: AI-Augmented Binary Reversing
• Relaxed Sender Anonymity for CBDC Interbank Settlement: A Zero-Knowledge Approach on Permissioned EVM
• Calibration-Family Overfit: Why Trusted Sabotage Monitors Don't Transfer Across Lineages
• Efficient Fuzzy PSI under One-Sided Assumptions
• Sealing the Audit-Runtime Gap for LLM Skills
• Token Composition: A Graph Based on EVM Logs