@article{15045,
  abstract     = {Coupling of orbital motion to a spin degree of freedom gives rise to various transport phenomena in quantum systems that are beyond the standard paradigms of classical physics. Here, we discuss features of spin-orbit dynamics that can be visualized using a classical model with two coupled angular degrees of freedom. Specifically, we demonstrate classical ‘spin’ filtering through our model and show that the interplay between angular degrees of freedom and dissipation can lead to asymmetric ‘spin’ transport.},
  author       = {Varshney, Atul and Ghazaryan, Areg and Volosniev, Artem},
  issn         = {1432-5411},
  journal      = {Few-Body Systems},
  keywords     = {Atomic and Molecular Physics, and Optics},
  publisher    = {Springer Nature},
  title        = {{Classical ‘spin’ filtering with two degrees of freedom and dissipation}},
  doi          = {10.1007/s00601-024-01880-x},
  volume       = {65},
  year         = {2024},
}

@article{14851,
  abstract     = {Die Quantenrotation ist ein spannendes Phänomen, das in vielen verschiedenen Systemen auftritt, von Molekülen und Atomen bis hin zu subatomaren Teilchen wie Neutronen und Protonen. Durch den Einsatz von starken Laserpulsen ist es möglich, die mathematisch anspruchsvolle Topologie der Rotation von Molekülen aufzudecken und topologisch geschützte Zustände zu erzeugen, die unerwartetes Verhalten zeigen. Diese Entdeckungen könnten Auswirkungen auf die Molekülphysik und physikalische Chemie haben und die Entwicklung neuer Technologien ermöglichen. Die Verbindung von Quantenrotation und Topologie stellt ein aufregendes, interdisziplinäres Forschungsfeld dar und bietet neue Wege zur Kontrolle und Nutzung von quantenmechanischen Phänomenen.},
  author       = {Karle, Volker and Lemeshko, Mikhail},
  issn         = {1521-3943},
  journal      = {Physik in unserer Zeit},
  keywords     = {General Earth and Planetary Sciences, General Environmental Science},
  number       = {1},
  pages        = {28--33},
  publisher    = {Wiley},
  title        = {{Die faszinierende Topologie rotierender Quanten}},
  doi          = {10.1002/piuz.202301690},
  volume       = {55},
  year         = {2024},
}

@article{18629,
  abstract     = {We study a three-dimensional Gross-Pitaevskii equation that describes a static impurity in a dipolar Bose-Einstein condensate. Our focus is on the interplay between the shape of the impurity and the anisotropy of the medium manifested in the energy and the density of the system. Without external confinement, properties of the system are derived with basic analytical approaches. For a system in a harmonic trap, the model is investigated numerically, using the split-step Crank-Nicolson method. Our results demonstrate that the impurity self-energy is minimized when its shape more closely aligns with the anisotropic character of the bath; in particular a prolate deformed impurity aligned with the direction of the dipoles has the smallest self-energy for a repulsive impurity. Our work complements studies of impurities in Bose gases with zero-range interactions and paves the way for studies of dipolar polarons with a Gross-Pitaevskii equation.},
  author       = {Shukla, Neelam and Volosniev, Artem and Armstrong, Jeremy R.},
  issn         = {2469-9934},
  journal      = {Physical Review A},
  number       = {5},
  publisher    = {American Physical Society},
  title        = {{Anisotropic potential immersed in a dipolar Bose-Einstein condensate}},
  doi          = {10.1103/PhysRevA.110.053317},
  volume       = {110},
  year         = {2024},
}

@article{15167,
  abstract     = {We perform a diagrammatic analysis of the energy of a mobile impurity immersed in a strongly interacting two-component Fermi gas to second order in the impurity-bath interaction. These corrections demonstrate divergent behavior in the limit of large impurity momentum. We show the fundamental processes responsible for these logarithmically divergent terms. We study the problem in the general case without any assumptions regarding the fermion-fermion interactions in the bath. We show that the divergent term can be summed up to all orders in the Fermi-Fermi interaction and that the resulting expression is equivalent to the one obtained in the few-body calculation. Finally, we provide a perturbative calculation to the second order in the Fermi-Fermi interaction, and we show the diagrams responsible for these terms.},
  author       = {Al Hyder, Ragheed and Chevy, F. and Leyronas, X.},
  issn         = {2469-9934},
  journal      = {Physical Review A},
  number       = {3},
  publisher    = {American Physical Society},
  title        = {{Exploring beyond-mean-field logarithmic divergences in Fermi-polaron energy}},
  doi          = {10.1103/PhysRevA.109.033315},
  volume       = {109},
  year         = {2024},
}

@unpublished{18688,
  abstract     = {The human brain has remarkable computational power. It generates sophisticated behavioral sequences, stores engrams over an individual’s lifetime, and produces higher cognitive functions up to the level of consciousness. However, so little of our neuroscience knowledge covers the human brain, and it remains unknown whether this organ is truly unique, or is a scaled version of the extensively studied rodent brain. To address this fundamental question, we determined the cellular, synaptic, and connectivity rules of the hippocampal CA3 recurrent circuit using multicellular patch clamp-recording. This circuit is the largest autoassociative network in the brain, and plays a key role in memory and higher-order computations such as pattern separation and pattern completion. We demonstrate that human hippocampal CA3 employs sparse connectivity, in stark contrast to neocortical recurrent networks. Connectivity sparsifies from rodents to humans, providing a circuit architecture that maximizes associational power. Unitary synaptic events at human CA3–CA3 synapses showed both distinct species-specific and circuit-dependent properties, with high reliability, unique amplitude precision, and long integration times. We also identify differential scaling rules between hippocampal pathways from rodents to humans, with a moderate increase in the convergence of CA3 inputs per cell, but a marked increase in human mossy fiber innervation. Anatomically guided full-scale modeling suggests that the human brain’s sparse connectivity, expanded neuronal number, and reliable synaptic signaling combine to enhance the associative memory storage capacity of CA3. Together, our results reveal unique rules of connectivity and synaptic signaling in the human hippocampus, demonstrating the absolute necessity of human brain research and beginning to unravel the remarkable performance of our autoassociative memory circuits.},
  author       = {Watson, Jake F. and Vargas-Barroso, Victor and Morse-Mora, Rebecca J. and Navas-Olive, Andrea and Tavakoli, Mojtaba and Danzl, Johann G and Tomschik, Matthias and Rössler, Karl and Jonas, Peter M},
  booktitle    = {bioRxiv},
  title        = {{Human hippocampal CA3 uses specific functional connectivity rules for efficient associative memory}},
  doi          = {10.1101/2024.05.02.592169},
  year         = {2024},
}

@misc{22803,
  abstract     = {In this study, we analyzed the efficiency of different adeno-associated viral (AAV) injections in transfecting neurons in the salamander Pleurodeles waltl. To query sources of variation in AAV injection outcomes, we analyzed metadata and outcomes for an additional 68 intraparenchymal injections performed 39 in post-metamorphic Pleurodeles salamanders. This dataset included both quantitative variables (age, weight, viral genomes (v.g.) injected, and a cell transduction score ranging from 0 to 4, see STAR Methods) and categorical variables (here referred to as qualitative variables: serotype, promoter, reporter, single vs. dual injection, manufacturer, and injection site). To assess the associations between these variables, we performed a Factor Analysis for Mixed Data (FAMD), a principal component method that is designed to determine significant sources of variability within datasets that contain both quantitative and qualitative data types. This dataset contains the injection outcomes and metadata for AAV injections administered in the salamander Pleurodeles waltl. The RactoMineR package (https://CRAN.R-project.org/package=FactoMineR) was used to determine significant contributions of a number of variables contributing to injection outcomes. Analysis of these data revealed that, among other factors, age co-varies with injection score. Therefore, we conclude that increased animal age decreases the efficacy of this tool.},
  author       = {Jaeger, Eliza},
  publisher    = {Repository},
  title        = {{Multivariate analysis of Pleurodeles waltl injection outcomes using FAMD FactoMineR (RStudio 4.3.2) used to probe sources of variability during an Adeno-associated viral (AAV) screen}},
  doi          = {10.5061/dryad.mpg4f4r89},
  year         = {2024},
}

@article{15374,
  abstract     = {Clathrin-mediated endocytosis (CME) is an essential process of cargo uptake operating in all eukaryotes. In animals and yeast, BAR-SH3 domain proteins, endophilins and amphiphysins, function at the conclusion of CME to recruit factors for vesicle scission and uncoating. Arabidopsis thaliana contains the BAR-SH3 domain proteins SH3P1–SH3P3, but their role is poorly understood. Here, we identify SH3Ps as functional homologs of endophilin/amphiphysin. SH3P1–SH3P3 bind to discrete foci at the plasma membrane (PM), and SH3P2 recruits late to a subset of clathrin-coated pits. The SH3P2 PM recruitment pattern is nearly identical to its interactor, a putative uncoating factor, AUXILIN-LIKE1. Notably, SH3P1–SH3P3 are required for most of AUXILIN-LIKE1 recruitment to the PM. This indicates a plant-specific modification of CME, where BAR-SH3 proteins recruit auxilin-like uncoating factors rather than the uncoating phosphatases, synaptojanins. SH3P1–SH3P3 act redundantly in overall CME with the plant-specific endocytic adaptor TPLATE complex but not due to an SH3 domain in its TASH3 subunit.},
  author       = {Adamowski, Maciek and Randuch, Marek and Matijevic, Ivana and Narasimhan, Madhumitha and Friml, Jiří},
  issn         = {2211-1247},
  journal      = {Cell Reports},
  number       = {5},
  publisher    = {Cell Press},
  title        = {{SH3Ps recruit auxilin-like vesicle uncoating factors for clathrin-mediated endocytosis}},
  doi          = {10.1016/j.celrep.2024.114195},
  volume       = {43},
  year         = {2024},
}

@article{17233,
  abstract     = {CRISPR-Cas9 technology has become an essential tool for plant genome editing. Recent advancements have significantly improved the ability to target multiple genes simultaneously within the same genetic background through various strategies. Additionally, there has been significant progress in developing methods for inducible or tissue-specific editing. These advancements offer numerous possibilities for tailored genome modifications. Building upon existing research, we have developed an optimized and modular strategy allowing the targeting of several genes simultaneously in combination with the synchronized expression of the Cas9 endonuclease in the egg cell. This system allows significant editing efficiency while avoiding mosaicism. In addition, the versatile system we propose allows adaptation to inducible and/or tissue-specific edition according to the promoter chosen to drive the expression of the Cas9 gene. Here, we describe a step-by-step protocol for generating the binary vector necessary for establishing Arabidopsis edited lines using a versatile cloning strategy that combines Gateway® and Golden Gate technologies. We describe a versatile system that allows the cloning of as many guides as needed to target DNA, which can be multiplexed into a polycistronic gene and combined in the same construct with sequences for the expression of the Cas9 endonuclease. The expression of Cas9 is controlled by selecting from among a collection of promoters, including constitutive, inducible, ubiquitous, or tissue-specific promoters. Only one vector containing the polycistronic gene (tRNA-sgRNA) needs to be constructed. For that, sgRNA (composed of protospacers chosen to target the gene of interest and sgRNA scaffold) is cloned in tandem with the pre-tRNA sequence. Then, a single recombination reaction is required to assemble the promoter, the zCas9 coding sequence, and the tRNA-gRNA polycistronic gene. Each element is cloned in an entry vector and finally assembled according to the Multisite Gateway® Technology. Here, we detail the process to express zCas9 under the control of egg cell promoter fused to enhancer sequence (EC1.2en-EC1.1p) and to simultaneously target two multiple C2 domains and transmembrane region protein genes (MCTP3 and MCTP4, respectively at3g57880 and at1g51570), using one or two sgRNA per gene.},
  author       = {Li, Ziqiang and Huard, Jennifer and Bayer, Emmanuelle M. and Wattelet-Boyer, Valérie},
  issn         = {2331-8325},
  journal      = {Bio-protocol},
  number       = {13},
  publisher    = {Bio-Protocol},
  title        = {{Versatile cloning strategy for efficient multigene editing in Arabidopsis}},
  doi          = {10.21769/BioProtoc.5029},
  volume       = {14},
  year         = {2024},
}

@article{17191,
  abstract     = {Dendritic cells migrate to and from lymph nodes in response to chemokine gradients.Data now show that steady-state migration of these cells can be triggered by a mechanosensitive pathway.},
  author       = {Lembo, Sergio and Sixt, Michael K},
  issn         = {1529-2916},
  journal      = {Nature Immunology},
  pages        = {1131–1132 },
  publisher    = {Springer Nature},
  title        = {{Nuclear squeezing wakes up dendritic cells}},
  doi          = {10.1038/s41590-024-01881-2},
  volume       = {25},
  year         = {2024},
}

@misc{18716,
  abstract     = {Data for publication 10.1039/d4cp03727h},
  author       = {Hrast, Mateja},
  publisher    = {Zenodo},
  title        = {{Data for: Ab initio Auger spectrum of the ultrafast dissociating 2p3/2−1σ* resonance in HCl}},
  doi          = {10.5281/ZENODO.13833474},
  year         = {2024},
}

@misc{22866,
  author       = {Hrast, Mateja},
  publisher    = {Repository},
  title        = {{Data for: Ab initio Auger spectrum of the ultrafast dissociating 2p3/2−1σ* resonance in HCl}},
  doi          = {10.5281/zenodo.13833474},
  year         = {2024},
}

@article{18109,
  abstract     = {Venous thromboembolism (VTE) is a common, deadly disease with an increasing incidence despite preventive efforts. Clinical observations have associated elevated antibody concentrations or antibody-based therapies with thrombotic events. However, how antibodies contribute to thrombosis is unknown. Here, we show that reduced blood flow enabled immunoglobulin M (IgM) to bind to FcμR and the polymeric immunoglobulin receptor (pIgR), initiating endothelial activation and platelet recruitment. Subsequently, the procoagulant surface of activated platelets accommodated antigen- and FcγR-independent IgG deposition. This leads to classical complement activation, setting in motion a prothrombotic vicious circle. Key elements of this mechanism were present in humans in the setting of venous stasis as well as in the dysregulated immunothrombosis of COVID-19. This antibody-driven thrombosis can be prevented by pharmacologically targeting complement. Hence, our results uncover antibodies as previously unrecognized central regulators of thrombosis. These findings carry relevance for therapeutic application of antibodies and open innovative avenues to target thrombosis without compromising hemostasis.},
  author       = {Stark, Konstantin and Kilani, Badr and Stockhausen, Sven and Busse, Johanna and Schubert, Irene and Tran, Thuy Duong and Gärtner, Florian R and Leunig, Alexander and Pekayvaz, Kami and Nicolai, Leo and Fumagalli, Valeria and Stermann, Julia and Stephan, Felix and David, Christian and Müller, Martin B. and Heyman, Birgitta and Lux, Anja and Da Palma Guerreiro, Alexandra and Frenzel, Lukas P. and Schmidt, Christoph Q. and Dopler, Arthur and Moser, Markus and Chandraratne, Sue and Von Brühl, Marie Luise and Lorenz, Michael and Korff, Thomas and Rudelius, Martina and Popp, Oliver and Kirchner, Marieluise and Mertins, Philipp and Nimmerjahn, Falk and Iannacone, Matteo and Sperandio, Markus and Engelmann, Bernd and Verschoor, Admar and Massberg, Steffen},
  issn         = {1097-4180},
  journal      = {Immunity},
  number       = {9},
  pages        = {2140--2156},
  publisher    = {Elsevier},
  title        = {{Antibodies and complement are key drivers of thrombosis}},
  doi          = {10.1016/j.immuni.2024.08.007},
  volume       = {57},
  year         = {2024},
}

@inproceedings{15008,
  abstract     = {Oblivious routing is a well-studied paradigm that uses static precomputed routing tables for selecting routing paths within a network. Existing oblivious routing schemes with polylogarithmic competitive ratio for general networks are tree-based, in the sense that routing is performed according to a convex combination of trees. However, this restriction to trees leads to a construction that has time quadratic in the size of the network and does not parallelize well. 
In this paper we study oblivious routing schemes based on electrical routing. In particular, we show that general networks with n vertices and m edges admit a routing scheme that has competitive ratio O(log² n) and consists of a convex combination of only O(√m) electrical routings. This immediately leads to an improved construction algorithm with time Õ(m^{3/2}) that can also be implemented in parallel with Õ(√m) depth.},
  author       = {Goranci, Gramoz and Henzinger, Monika H and Räcke, Harald and Sachdeva, Sushant and Sricharan, A. R.},
  booktitle    = {15th Innovations in Theoretical Computer Science Conference},
  isbn         = {9783959773096},
  issn         = {1868-8969},
  location     = {Berkeley, CA, United States},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Electrical flows for polylogarithmic competitive oblivious routing}},
  doi          = {10.4230/LIPIcs.ITCS.2024.55},
  volume       = {287},
  year         = {2024},
}

@article{15408,
  abstract     = {Background: IgE-mediated degranulation of mast cells (MCs) provides rapid protection against environmental hazards, including animal venoms. A fraction of tissue-resident MCs intimately associates with blood vessels. These perivascular MCs were reported to extend projections into the vessel lumen and to be the first MCs to acquire intravenously injected IgE, suggesting that IgE loading of MCs depends on their vascular association.
Objective: We sought to elucidate the molecular basis of the MC–blood vessel interaction and to determine its relevance for IgE-mediated immune responses.
Methods: We selectively inactivated the Itgb1 gene, encoding the β1 chain of integrin adhesion molecules (ITGB1), in MCs by conditional gene targeting in mice. We analyzed skin MCs for blood vessel association, surface IgE density, and capability to bind circulating antibody specific for MC surface molecules, as well as in vivo responses to antigen administered via different routes.
Results: Lack of ITGB1 expression severely compromised MC–blood vessel association. ITGB1-deficient MCs showed normal densities of surface IgE but reduced binding of intravenously injected antibodies. While their capacity to degranulate in response to IgE ligation in vivo was unimpaired, anaphylactic responses to antigen circulating in the vasculature were largely abolished.
Conclusions: ITGB1-mediated association of MCs with blood vessels is key for MC immune surveillance of blood vessel content, but is dispensable for slow steady-state loading of endogenous IgE onto tissue-resident MCs.},
  author       = {Link, Kristina and Muhandes, Lina and Polikarpova, Anastasia and Lämmermann, Tim and Sixt, Michael K and Fässler, Reinhard and Roers, Axel},
  issn         = {1097-6825},
  journal      = {Journal of Allergy and Clinical Immunology},
  number       = {3},
  pages        = {745--753},
  publisher    = {Elsevier},
  title        = {{Integrin β1–mediated mast cell immune-surveillance of blood vessel content}},
  doi          = {10.1016/j.jaci.2024.03.022},
  volume       = {154},
  year         = {2024},
}

@article{14933,
  abstract     = {Centrioles are part of centrosomes and cilia, which are microtubule organising centres (MTOC) with diverse functions. Despite their stability, centrioles can disappear during differentiation, such as in oocytes, but little is known about the regulation of their structural integrity. Our previous research revealed that the pericentriolar material (PCM) that surrounds centrioles and its recruiter, Polo kinase, are downregulated in oogenesis and sufficient for maintaining both centrosome structural integrity and MTOC activity. We now show that the expression of specific components of the centriole cartwheel and wall, including ANA1/CEP295, is essential for maintaining centrosome integrity. We find that Polo kinase requires ANA1 to promote centriole stability in cultured cells and eggs. In addition, ANA1 expression prevents the loss of centrioles observed upon PCM-downregulation. However, the centrioles maintained by overexpressing and tethering ANA1 are inactive, unlike the MTOCs observed upon tethering Polo kinase. These findings demonstrate that several centriole components are needed to maintain centrosome structure. Our study also highlights that centrioles are more dynamic than previously believed, with their structural stability relying on the continuous expression of multiple components.},
  author       = {Pimenta-Marques, Ana and Perestrelo, Tania and Dos Reis Rodrigues, Patricia and Duarte, Paulo and Ferreira-Silva, Ana and Lince-Faria, Mariana and Bettencourt-Dias, Mónica},
  issn         = {1469-3178},
  journal      = {EMBO Reports},
  number       = {1},
  pages        = {102--127},
  publisher    = {Embo Press},
  title        = {{Ana1/CEP295 is an essential player in the centrosome maintenance program regulated by Polo kinase and the PCM}},
  doi          = {10.1038/s44319-023-00020-6},
  volume       = {25},
  year         = {2024},
}

@inproceedings{14769,
  abstract     = {For a set of points in Rd, the Euclidean k-means problems consists of finding k centers such that the sum of distances squared from each data point to its closest center is minimized. Coresets are one the main tools developed recently to solve this problem in a big data context. They allow to compress the initial dataset while preserving its structure: running any algorithm on the coreset provides a guarantee almost equivalent to running it on the full data. In this work, we study coresets in a fully-dynamic setting: points are added and deleted with the goal to efficiently maintain a coreset with which a k-means solution can be computed. Based on an algorithm from Henzinger and Kale [ESA'20], we present an efficient and practical implementation of a fully dynamic coreset algorithm, that improves the running time by up to a factor of 20 compared to our non-optimized implementation of the algorithm by Henzinger and Kale, without sacrificing more than 7% on the quality of the k-means solution.},
  author       = {Henzinger, Monika H and Saulpic, David and Sidl, Leonhard},
  booktitle    = {2024 Proceedings of the Symposium on Algorithm Engineering and Experiments},
  location     = {Alexandria, VA, United States},
  pages        = {220--233},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Experimental evaluation of fully dynamic k-means via coresets}},
  doi          = {10.1137/1.9781611977929.17},
  year         = {2024},
}

@article{17279,
  abstract     = {In a recent issue of Cell, Zhang et al.1 demonstrate that mechanical features of a solid tumor can drive T cells into dysfunctionality and identify pathways that revert this “exhausted” state.},
  author       = {Avellaneda Sarrió, Mario and Sixt, Michael K},
  issn         = {2451-9448},
  journal      = {Cell Chemical Biology},
  number       = {7},
  pages        = {1242--1243},
  publisher    = {Elsevier},
  title        = {{Rescuing T cells from stiff tumors}},
  doi          = {10.1016/j.chembiol.2024.06.011},
  volume       = {31},
  year         = {2024},
}

@inproceedings{18557,
  abstract     = {Broadcast and Consensus are most fundamental tasks in distributed computing. These tasks are particularly challenging in dynamic networks where communication across the network links may be unreliable, e.g., due to mobility or failures. Over the last years, researchers have derived several impossibility results and high time complexity lower bounds for these tasks. Specifically for the setting where in each round of communication the adversary is allowed to choose one rooted tree along which the information is disseminated, there is a lower as well as an upper bound that is linear in the number n of nodes for Broadcast and for n ≥ 3 the adversary can guarantee that Consensus never happens. This setting is called the oblivious message adversary for rooted trees. Also note that if the adversary is allowed to choose a graph that does not contain a rooted tree, then it can guarantee that Broadcast and Consensus will never happen. However, such deterministic adversarial models may be overly pessimistic, as many processes in real-world settings are stochastic in nature rather than worst-case. This paper studies Broadcast on stochastic dynamic networks and shows that the situation is very different to the deterministic case. In particular, we show that if information dissemination occurs along random rooted trees and directed Erdős–Rényi graphs, Broadcast completes in O(log n) rounds of communication with high probability. The fundamental insight in our analysis is that key variables are mutually independent. We then study two adversarial models, (a) one with Byzantine nodes and (b) one where an adversary controls the edges. (a) Our techniques without Byzantine nodes are general enough so that they can be extended to Byzantine nodes. (b) In the spirit of smoothed analysis, we introduce the notion of randomized oblivious message adversary, where in each round, an adversary picks k ≤ 2n/3 edges to appear in the communication network, and then a graph (e.g. rooted tree or directed Erdős–Rényi graph) is chosen uniformly at random among the set of all such graphs that include these edges. We show that Broadcast completes in a finite number of rounds, which is, e.g., O(k+log n) rounds in rooted trees. We then extend these results to All-to-All Broadcast, and Consensus, and give lower bounds that show that most of our upper bounds are tight.},
  author       = {El-Hayek, Antoine and Henzinger, Monika H and Schmid, Stefan},
  booktitle    = {38th International Symposium on Distributed Computing},
  isbn         = {9783959773522},
  issn         = {1868-8969},
  location     = {Madrid, Spain},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges}},
  doi          = {10.4230/LIPIcs.DISC.2024.21},
  volume       = {319},
  year         = {2024},
}

@inproceedings{18156,
  abstract     = {Privately counting distinct elements in a stream is a fundamental data analysis problem with many applications in machine learning. In the turnstile model, Jain et al. [NeurIPS2023] initiated the study of this problem parameterized by the maximum flippancy of any element, i.e., the number of times that the count of an element changes from 0 to above 0 or vice versa. They give an item-level (ε,δ)-differentially private algorithm whose additive error is tight with respect to that parameterization. In this work, we show that a very simple algorithm based on the sparse vector technique achieves a tight additive error for item-level (ε,δ)-differential privacy and item-level ε-differential privacy with regards to a different parameterization, namely the sum of all flippancies. Our second result is a bound which shows that for a large class of algorithms, including all existing differentially private algorithms for this problem, the lower bound from item-level differential privacy extends to event-level differential privacy. This partially answers an open question by Jain et al. [NeurIPS2023].},
  author       = {Henzinger, Monika H and Sricharan, A. R. and Steiner, Teresa Anna},
  booktitle    = {International Conference on Approximation Algorithms for Combinatorial Optimization Problems },
  isbn         = {9783959773485},
  issn         = {1868-8969},
  location     = {London, United Kingdom},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Private counting of distinct elements in the turnstile model and extensions}},
  doi          = {10.4230/LIPIcs.APPROX/RANDOM.2024.40},
  volume       = {317},
  year         = {2024},
}

@inproceedings{18308,
  abstract     = {We study in this paper the problem of maintaining a solution to k-median and k-means clustering in a fully dynamic setting. To do so, we present an algorithm to efficiently maintain a coreset, a compressed version of the dataset, that allows easy computation of a clustering solution at query time. Our coreset algorithm has near-optimal update time of Õ(k) in general metric spaces, which reduces to Õ(d) in the Euclidean space ℝ^d. The query time is O(k²) in general metrics, and O(kd) in ℝ^d. To maintain a constant-factor approximation for k-median and k-means clustering in Euclidean space, this directly leads to an algorithm with update time Õ(d), and query time Õ(kd + k²). To maintain a O(polylog k)-approximation, the query time is reduced to Õ(kd).},
  author       = {La Tour, Max Dupré and Henzinger, Monika H and Saulpic, David},
  booktitle    = {32nd Annual European Symposium on Algorithms},
  isbn         = {9783959773386},
  issn         = {1868-8969},
  location     = {London, United Kingdom},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Fully dynamic k-means coreset in near-optimal update time}},
  doi          = {10.4230/LIPIcs.ESA.2024.100},
  volume       = {308},
  year         = {2024},
}