Notice: The reproducibility variables underlying each score are classified using an automated LLM-based pipeline, validated against a manually labeled dataset. LLM-based classification introduces uncertainty and potential bias; scores should be interpreted as estimates. Full accuracy metrics and methodology are described in Coakley et alK. L. Coakley, T. Snelleman, H. Hoos, and O. E. Gundersen, "The embrace of open science: An analysis of a decade of AI research and 56 800 conference papers," Under Review, 2026..

Private Set Union with Multiple Contributions

Authors: Travis Dick, Haim Kaplan, Alex Kulesza, Uri Stemmer, Ziteng Sun, Ananda Theertha Suresh

NeurIPS 2025 | Venue PDF | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical Justification: The paper does not include experiments.
Researcher Affiliation Collaboration Travis Dick Google Research Haim Kaplan Tel Aviv University and Google Research Alex Kulesza Google Research Uri Stemmer Tel Aviv University and Google Research Ziteng Sun Google Research Ananda Theertha Suresh Google Research
Pseudocode Yes Algorithm 1 Bicrit Notation: Let k denote the contribution bound, let X be a domain of items, and let X,k = {B X : |B| k} denote the set of all possible bags of size at most k from X. Input: Dataset D ( X,k)n containing n bags, privacy parameters ε, δ > 0.
Open Source Code No Justification: The paper does not include experiments requiring code.
Open Datasets No Justification: The paper does not include experiments.
Dataset Splits No Justification: The paper does not include experiments.
Hardware Specification No Justification: The paper does not include experiments.
Software Dependencies No Justification: The paper does not include experiments.
Experiment Setup No Justification: The paper does not include experiments.