@article{21378, abstract = {From insects to mammals, essential brain functions, such as forming long-term memories (LTMs), increase metabolic activity in stimulated neurons to meet the energetic demand associated with brain activation. However, while impairing neuronal metabolism limits brain performance, whether expanding the metabolic capacity of neurons boosts brain function remains poorly understood. Here, we show that LTM formation of flies and mice can be enhanced by increasing mitochondrial metabolism in central memory circuits. By knocking down the mitochondrial Ca2+ exporter Letm1, we favour Ca2+ retention in the mitochondrial matrix of neurons due to reduction of mitochondrial H+/Ca2+ exchange. The resulting increase in mitochondrial Ca2+ over-activates mitochondrial metabolism in neurons of central memory circuits, leading to improved LTM storage in training paradigms in which wild-type counterparts of both species fail to remember. Our findings unveil an evolutionarily conserved mechanism that controls mitochondrial metabolism in neurons and indicate its involvement in shaping higher brain functions, such as LTM.}, author = {Amrapali Vishwanath, Anjali and Comyn, Typhaine and Mira, Rodrigo G. and Brossier, Claire and Pascual-Caro, Carlos and Faour, Maya and Boumendil, Kahina and Chintaluri, Chaitanya and Ramon-Duaso, Carla and Fan, Ruolin and Ghosh, Kishalay and Farrants, Helen and Berwick, Jean-Paul and Sivakumar, Riya and Lopez-Manzaneda, Mario and Schreiter, Eric R. and Preat, Thomas and Vogels, Tim P and Rangaraju, Vidhya and Busquets-Garcia, Arnau and Plaçais, Pierre-Yves and Pavlowsky, Alice and de Juan-Sanz, Jaime}, issn = {2522-5812}, journal = {Nature Metabolism}, number = {2}, pages = {467--488}, publisher = {Springer Nature}, title = {{Mitochondrial Ca2+ efflux controls neuronal metabolism and long-term memory across species}}, doi = {10.1038/s42255-026-01451-w}, volume = {8}, year = {2026}, } @article{22296, abstract = {The detection of strong Balmer breaks and absorption features in Little Red Dots (LRDs) suggests they host active galactic nuclei embedded within dense gas envelopes, potentially powered by super-Eddington accretion. We present GLIMPSE-17775, a luminous (Lbol ∼ 1045 erg s−1) LRD at z = 3.501 behind Abell S1063 (μ ∼ 2), observed with deep JWST/NIRCam and a ∼20 hr (80 hr delensed) NIRSpec G395M spectrum. The data reveal over 40 emission and absorption features, including a rich forest of low-ionization Fe ii lines and numerous broad hydrogen recombination transitions. We use this depth to test the dense-gas interpretation through five independent diagnostics. Nearly all permitted lines show exponential wings with consistent FWHM, a signature of Thomson scattering requiring ne ≳ 108 cm−3. Adopting this width yields MBH ∼ 106.7M⊙, a factor of 10 lower than Gaussian fits, and λEdd ∼ 1.8. Additional diagnostics support the same picture: a pronounced Balmer break (fν,4050/fν,3670 = 2.0 ± 0.1), enhanced He i λ7065 and λ10830 with P-Cygni absorption, Bowen-fluorescent O i λ8446–λ11290 emission requiring Lyβ pumping, and 16 Fe ii lines matching fluorescence models. These features indicate a dense (n ∼ 108 cm−3), partially ionized cocoon where scattering and fluorescence dominate line formation, providing strong evidence that at least some LRDs are powered by super-Eddington black hole growth in the early Universe.}, author = {Kokorev, Vasily and Chisholm, John and Naidu, Rohan P. and Fujimoto, Seiji and Atek, Hakim and Brammer, Gabriel and Finkelstein, Steven L. and Akins, Hollis B. and Berg, Danielle A. and Furtak, Lukas J. and Fei, Qinyue and Hsiao, Tiger Yu-Yang and Labbé, Ivo and Matthee, Jorryt J and Muñoz, Julian B. and Oesch, Pascal A. and Pan, Richard and Rinaldi, Pierluigi and Saldana-Lopez, Alberto and Schaerer, Daniel and Volonteri, Marta and Zitrin, Adi}, issn = {1538-4357}, journal = {The Astrophysical Journal}, number = {2}, publisher = {IOP Publishing}, title = {{The Deepest GLIMPSE of a dense gas cocoon enshrouding a Little Red Dot}}, doi = {10.3847/1538-4357/ae4ed7}, volume = {1004}, year = {2026}, } @article{22297, abstract = {Determination of the rheological properties of cells is known to require active measurements, which largely depend on the internalization of mechanical probes. Here, we circumvent this problem via the introduction of Rheological focused light-induced cytoplasmic streaming (Rheo-FLUCS): an active, yet probe-free approach that leverages light-induced flows to access mechanical changes in complex systems. While Rheo-FLUCS is facilitated by thermoviscous expansion phenomena rather than external forces, here we show equivalence in its ability to measure relative viscoelastic properties. Specifically, we demonstrate a phase-lag equivalence with probe-dependent active microrheology in a wide range of physically different, yet chemically identical materials. We exemplify the utility of Rheo-FLUCS in three distinctly different biological systems: compound-treated mouse fibroblasts (NIH-3T3), genetically modified human osteoblasts (U2OS) to elucidate the role of myosins in cytoplasmic mechanics, and early ascidian oocytes of Phallusia mammillata at fertilization stage. Our biological use-cases exemplify the application versatility of Rheo-FLUCS, which in the future may use phase information as a marker for developmental success.}, author = {Stoev, Iliya D and Bolger-Munro, Madison and Minopoli, Antonio and Wagner, Susan and Krishnaswamy, Venkat Raghavan and Erben, Elena and Weißenbruch, Kai and Maghelli, Nicola and Bastmeyer, Martin and Heisenberg, Carl-Philipp J and Kreysing, Moritz}, issn = {2752-6542}, journal = {PNAS Nexus}, keywords = {cell mechanics, active microrheology, noninvasiveness, thermoviscous flows, FLUCS}, number = {6}, publisher = {Oxford University Press}, title = {{Active and probe-free intracellular rheology via phase-sensitive thermoviscous flows}}, doi = {10.1093/pnasnexus/pgag190}, volume = {5}, year = {2026}, } @inbook{22300, abstract = {As seen in previous chapters, a graph game proceeds by placing a token on one of the vertices and allowing the players to move it throughout the graph to produce an infinite trace, which determines the winner or payoff of the game.}, author = {Avni, Guy and Henzinger, Thomas A}, booktitle = {Games on Graphs. From Logic and Automata to Algorithms}, editor = {Fijalkow, ‪Nathanaël}, isbn = {9781009500685}, pages = {529--569}, publisher = {Cambridge University Press}, title = {{Bidding Games}}, doi = {10.1017/9781009500678.022}, year = {2026}, } @article{22303, abstract = {We present the discovery of AT 2024wpp (‘Whippet’), a fast and luminous 18cow-like transient. At a redshift of z = 0 . 0868 , revealed by Keck Cosmic Web Imager spectroscopy of its faint star-forming host, it is the fourth-nearest example of its class to date. Rapid identification of the source in the Zwicky Transient Facility data stream permitted ultraviolet-through- optical observations to be obtained prior to peak, allowing the first determination of the peak bolometric luminosity ( 2 ×1045 erg s−1 ), maximum photospheric radius ( 1015 cm), and total radiated energy ( 1051 erg) of an 18cow-like object. We present results from a comprehensive multiwavelength observing campaign, including a far-ultraviolet spectrum from the Cosmic Origins Spectrograph on the Hubble Space Telescope and deep imaging extending > 100 d post-explosion from the Very Large Telescope, Hubble Space Telescope , Very Large Array, and Atacama Large Millimetre Array. We interpret the observations under a model in which a rapidly accreting central engine blows a fast ( ∼0.2 c ) wind into the surrounding medium and irradiates it with X-rays. The high Doppler velocities and intense ionization within this wind prevent identifiable spectroscopic features from appearing in the ejecta or in the surrounding circumstellar material. Weak H and He signatures do emerge in the spectra after 35 d in the form of double-peaked narrow lines. Each peak is individually narrow (full width δv ∼3000 km s−1 ) but the two components are separated by v ∼6600 km s−1 , indicating stable structures of denser material, possibly representing streams of tidal ejecta or an ablated companion star.}, author = {Perley, Daniel A and Ho, Anna Y Q and McGrath, Zoë and Camilo, Michael and Sevilla, Cassie and Chen, Ping and Schroeder, Genevieve and Govreen-Segal, Taya and Bochenek, Aleksandra and Qin, Yu-Jing and Gillanders, James H and Amend, Benjamin and Anderson, Joseph P and Andreoni, Igor and Aryan, Amar and Bellm, Eric C and Bloom, Joshua S and de Boer, Thomas and Carney, Jonathan and Caiazzo, Ilaria and Chambers, Ken C and Charalampopoulos, Panos and Chen, Ting-Wan and Chen, Tracy X and Coughlin, Eric R and Coughlin, Michael and Dennefeld, Michel and Dimitriadis, Georgios and Fremling, Christoffer and Frostig, Danielle and Gal-Yam, Avishay and Galbany, Lluís and Gangopadhyay, Anjashay and Ghendrih, Melzie and Graham, Matthew J and Gromadzki, Mariusz and Groom, Steven L and Gutiérrez, Claudia P and Hinds, K -Ryan and Huber, Mark E and Inserra, Cosimo and Kaiser, Benjamin C and Kasliwal, Mansi M and Koivisto, Niilo E and Lin, Chien-Cheng and Liu, Chang and Lowe, Thomas B and Magnier, Eugene and Mahabal, Ashish A and Milligan, Andrew and Minguez, Paloma and Mo, Geoffrey and Müller-Bravo, Tomás E and Nicholl, Matt and Pessi, Priscila J and Pignata, Giuliano and Purdum, Josiah and Rehemtulla, Nabeel and Rich, R Michael and Sahu, Anwesha and Singh, Avinash and Smartt, Stephen J and Smith, Ian A and Sollerman, Jesper and Srinivasaragavan, Gokul and Srivastav, Shubham and Stein, Robert D and Schulze, Steve and Tweddle, Jack W and Wainscoat, Richard and Wise, Jacob L and Yan, Lin and Young, David R}, issn = {1365-2966}, journal = {Monthly Notices of the Royal Astronomical Society}, keywords = {stars: black holes, supernovae: individual: AT2024wpp, radio continuum: transients}, number = {1}, publisher = {Oxford University Press}, title = {{AT 2024wpp: An extremely luminous fast ultraviolet transient powered by accretion onto a black hole}}, doi = {10.1093/mnras/stag678}, volume = {549}, year = {2026}, } @article{22301, abstract = {Auxin, primarily indole-3-acetic acid (IAA), is a central regulator of growth and development in land plants, but its physiological role in chlorophyte algae remains unclear. Here, we show that exogenous IAA modulates growth in Chlorella sorokiniana, Chlorella variabilis, and Chlamydomonas reinhardtii in a concentration-dependent manner. Low IAA concentrations promoted growth by accelerating the onset of cell division without affecting cell size, whereas higher concentrations inhibited proliferation. Radiotracer assays showed that all three species take up and release IAA across the plasma membrane through a combination of passive diffusion and energy-dependent, saturable processes. Competition by excess unlabeled natural and synthetic auxins further supported the presence of carrier-mediated transport with broad substrate recognition. Phylogenetic analyses identified potential PIN-like auxin exporters in chlorophytes and other non-plant eukaryotes, and structural modeling supported conservation of the overall PIN fold and predicted auxin-binding residues. However, functional assays in Xenopus laevis oocytes, tobacco BY-2 cultured cells, and Arabidopsis thaliana did not support a role for these proteins in directional auxin export. Instead, non-plant PIN homologs localized predominantly to the endoplasmic reticulum and showed limited or no transport activity in heterologous systems. Together, these findings indicate that auxin responsiveness and basic cellular auxin transport predate canonical PIN-mediated directional auxin export, which appears to be a later innovation of the streptophyte lineage.}, author = {Smoljan, Adrijana and Koutnik‐Abele, Sarah and Vladimirtsev, Dmitrii and Klíma, Petr and Bírošíková, Anita and Zhang, Yuzhou and Merrin, Jack and Schuster, Maximilian and Kurtović, Katarina and Hammes, Ulrich Z. and Petrášek, Jan and Friml, Jiří}, issn = {1744-7909}, journal = {Journal of Integrative Plant Biology}, publisher = {Wiley}, title = {{Auxin response and PIN‐mediated transport in chlorophyte algae}}, doi = {10.1111/jipb.70309}, year = {2026}, } @inproceedings{22129, abstract = {Inside–outside classification is widely used for geometry processing tasks such as surface reconstruction, geometry completion, and calculating signed distance fields. We introduce a new integral formulation of this problem, which assigns confidence scores that points are inside or outside, given incomplete boundary geometry. Even though our geometric construction does not appear in previous work, we show that it is unexpectedly linked to both the well-established generalized winding number (GWN) and pseudonormal methods for geometry completion, and it provably reduces to either one of them for specific values of a control parameter. The results obtained with our method frequently outperform screened Poisson surface reconstruction (PSR), GWN, and the pseudonormal method in terms of quality, and are at least on par with them on all of our examples. Unlike these methods, our algorithm naturally extends to the multi-label setting, in which regions with an arbitrary number of colors or physical materials can be reconstructed, and non-manifold features such as T-junctions may appear in the interface and boundary geometry}, author = {Wei, Ziyu and Hafner, Christian and Kalinov, Aleksei and Synak, Peter and Wojtan, Christopher J}, booktitle = {Computer Graphics Forum}, location = {Bern, Switzerland}, number = {5}, publisher = {Wiley}, title = {{Circles of confidence for multi-label geometry completion}}, doi = {10.1111/cgf.70516}, volume = {45}, year = {2026}, } @inproceedings{22298, abstract = {Air traffic management is a critical component of aviation, aiming to balance safety, capacity and demand within controlled airspace. This research analyses Iran's domestic air transport network (2018-2021) by developing annual Origin-Destination (OD) impedance matrices based on flight frequency. The methodology quantifies network connectivity, revealing a highly centralized structure dominated by core corridors like Tehran-Mashhad, which carried over 10,500 flights in 2019. The COVID-19 pandemic caused a severe disruption in 2020, with traffic on major routes falling by nearly half, followed by a partial recovery in 2021. Analysis shows core hubs rebounded faster than peripheral airports, widening accessibility gaps. Through origin-destination matrix processing, the system identifies high density air routes and analyses historical trends in airspace utilization. The impedance matrix, validated against data (R²=0.87), successfully maps the intense service on hub links and the high impedance of sparse peripheral routes. Then an interactive Web GIS platform was implemented for spatiotemporal analysis of air traffic density.}, author = {Eghbali Mardekheh, Masoumeh and Argany, Meysam and Karimipour, Farid and Sedghitabar, Seyed Mohammad}, booktitle = {8th ISPRS Geospatial Conference}, issn = {2194-9050}, keywords = {Air Traffic simulation, Dynamic Air Traffic Corridors, Origin Destination matrix, Interactive Web GIS, Iran Aviation Network, Spatiotemporal Modelling}, location = {Tehran, Iran}, number = {-4/W8-2025}, pages = {493--500}, publisher = {Copernicus Publications}, title = {{Real time interactive web GIS based modelling of high traffic air corridors in Iran using origin destination matrix analysis}}, doi = {10.5194/isprs-annals-x-4-w8-2025-493-2026}, volume = {X}, year = {2026}, } @article{22304, abstract = {We derive an analog of the Lellouch-Lüscher (LL) relation for few-body bosonic systems, linking few-body scattering loss rates to the energies and widths of the corresponding harmonically trapped few-body states. Three-body numerical simulations show that the LL relation applies across a broad range of interaction strengths and energies and allows the determination of scattering rates within a single partial wave. Our Letter establishes a robust theoretical framework for understanding the role of the finite-volume effect in few-body observables in optical lattice and tweezer experiments, enabling precise determination of multibody scattering rates.}, author = {Li, Jinglun and Julienne, Paul S. and Denschlag, Johannes Hecker and D’Incao, José P.}, issn = {1079-7114}, journal = {Physical Review Letters}, number = {20}, publisher = {American Physical Society}, title = {{Lellouch-Lüscher relation for ultracold few-atom systems under confinement}}, doi = {10.1103/pzlp-7k8d}, volume = {136}, year = {2026}, } @article{22307, abstract = {We investigate magnetic active matter in confined geometries using both experiments with magnetic toy robots, Hexbugs, and simulations of elongated magnetic active Brownian particles in circular domains. Standard active particles tend to accumulate at boundaries, forming clusters even at relatively low densities. In the presence of magnetic interactions, we provide evidence for a effect that inhibits clustering and shifts its onset to higher packing fractions. Moreover, magnetic dipolar interactions give rise to collective behaviors such as train-like formations, rotating pairs, and rotating clusters.}, author = {Musacchio, Marco and Felber, Markus and Paoluzzi, Matteo and Gnoli, Andrea and Puglisi, Andrea and Angelani, Luca}, issn = {2470-0053}, journal = {Physical Review E}, number = {5}, publisher = {American Physical Society}, title = {{Fluidization induced by magnetic interactions in confined active matter}}, doi = {10.1103/hylm-ljlf}, volume = {113}, year = {2026}, } @inproceedings{22302, abstract = {Speculative generation has emerged as a promising technique to accelerate inference in large language models (LLMs) by leveraging parallelism to verify multiple draft tokens simultaneously. However, the fundamental limits on the achievable speedup remain poorly understood. In this work, we establish the first “tight” lower bounds on the runtime of any deterministic speculative generation algorithm. This is achieved by drawing a parallel between the token generation process and branching random walks, which allows us to analyze the optimal draft tree selection problem. We prove, under basic assumptions, that the expected number of tokens successfully predicted per speculative iteration is bounded as \mathbb{E}[X] ≤ (𝜇 + 𝜇(2))log(B )/𝜇2 + O(1), where B is the verifier’s batch size, 𝜇 is the expected entropy of the verifier’s output distribution, and 𝜇(2) is this entropy’s second moment. This result provides new insights into the limits of parallel token generation, and could guide the design of future speculative decoding systems. Empirical evaluations on Llama models validate our theoretical predictions, confirming the tightness of our bounds in practical settings.}, author = {Pankratov, Sergei and Alistarh, Dan-Adrian}, booktitle = {Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics}, location = {Rabat, Morocco}, pages = {6404–6418}, publisher = {Association for Computational Linguistics}, title = {{Speculative decoding speed-of-light: Optimal lower bounds via branching random walks}}, doi = {10.18653/v1/2026.eacl-long.301}, year = {2026}, } @unpublished{22276, abstract = {Tissue tension is a key determinant of tissue shape, and its regulation is essential for both morphogenesis and the maintenance of tissue integrity. During zebrafish embryogenesis, the enveloping layer (EVL) – an epithelial monolayer covering the blastoderm – undergoes extensive spreading that is driven by pulling forces exerted at its margin and more than doubles its surface area. Yet whether and how the EVL actively regulates its tissue tension during this process remains unclear. Here, we show that the EVL maintains constant tissue tension while spreading, and that it achieves this by reducing apical cell contractility in response to the same pulling forces that drive its spreading. We identify a mechanosensitive pathway underlying this response, mediated by the scaffold/adaptor protein Kibra regulating the activity of atypical protein kinase C (aPKC) at the apical domain of EVL cells. Under low mechanical stretch, Kibra forms condensates at the base of actin-based apical projections, where it activates Myosin II to increase apical contractility through aPKC downregulation. As mechanical stretch increases, apical projections disassemble, Kibra condensates dissolve, and aPKC activity rises. Elevated aPKC activity in turn reduces apical contractility by reducing Myosin II activity, thereby maintaining constant tissue tension despite increased mechanical stretch. Together, these findings reveal a mechanosensitive mechanism that enables robust adaptation of tissue tension to changing mechanical stretch, ensuring efficient tissue spreading and morphogenesis.}, author = {Hino, Naoya and Kapoor, Tushna and Gubbala, Uday R and Hannezo, Edouard B and Heisenberg, Carl-Philipp J}, keywords = {Epithelial spreading, tissue tension, mechanosensation, aPKC, Kibra, zebrafish}, publisher = {Institute of Science and Technology Austria}, title = {{Apical domain mechanosensation regulates tissue tension homeostasis}}, year = {2026}, } @article{22308, abstract = {This article is a collection of contributions from speakers at the 2025 DEAMN workshop at the Majorana Centre in Erice. Not ordinary contributions to a conference proceeding, this gives a new and different perspective on the work done by the workshop participants.}, author = {Hansen, Klavs and Kresin, Vitaly and Al Hyder, Ragheed and Lemeshko, Mikhail and Fárník, Michal and Fedor, Juraj and Ferrari, Piero and Worutowicz, Laura X. and Louwerse, Rick J. and Kiawi, Denis and Waters, Laurens B. F. M. and Lang, Sandra M. and Bakker, Joost M. and von Issendorff, Bernd and Kong, Wei and Mehmel, Jannik and Schäfer, Rolf and Pedalino, Sebastian and Ramírez-Galindo, Bruno E. and Ferstl, Richard and Sindelar, Severin and Gerlich, Stefan and Arndt, Markus and Sayres, Scott G. and Wang, Lai-Sheng}, issn = {1434-6079}, journal = {The European Physical Journal D}, number = {5}, publisher = {Springer Nature}, title = {{Reflections on future problems in cluster science}}, doi = {10.1140/epjd/s10053-026-01126-x}, volume = {80}, year = {2026}, } @article{21002, abstract = {The Davenport–Heilbronn method is a version of the circle method that was developed for studying Diophantine inequalities in the paper (Davenport and Heilbronn, J. Lond. Math. Soc. (1) 21 (1946), 185–193). We discuss the main ideas in the paper, together with an account of the development of the subject in the intervening 80 years.}, author = {Browning, Timothy D}, issn = {1469-7750}, journal = {Journal of the London Mathematical Society}, number = {1}, publisher = {Wiley}, title = {{The Davenport–Heilbronn method: 80 years on}}, doi = {10.1112/jlms.70371}, volume = {113}, year = {2026}, } @article{21385, abstract = {We prove that the average size of a mixed character sum (math. formular) (for a suitable smooth function w) is on the order of √x for all irrational real θ satisfying a weak Diophantine condition, where χ is drawn from the family of Dirichlet characters modulo a large prime r and where x 6 r. In contrast, it was proved by Harper that the average size is o(√x) for rational θ. Certain quadratic Diophantine equations play a key role in the present paper. }, author = {Wang, Victor and Xu, Max}, issn = {1473-7124}, journal = {Proceedings of the Royal Society of Edinburgh: Section A Mathematics}, pages = {1--15}, publisher = {Cambridge University Press}, title = {{Average sizes of mixed character sums}}, doi = {10.1017/prm.2026.10123}, year = {2026}, } @article{21242, abstract = {We obtain an asymptotic formula for the number of integral solutions to a system of diagonal equations. We obtain an asymptotic formula for the number of solutions with variables restricted to smooth numbers as well. We improve the required number of variables compared to previous results by incorporating recent progress on Waring’s problem and the resolution of the main conjecture in Vinogradov’s mean value theorem.}, author = {Rome, Nick and Yamagishi, Shuntaro}, issn = {1945-5844}, journal = {Pacific Journal of Mathematics}, number = {1}, pages = {179--198}, publisher = {Mathematical Sciences Publishers}, title = {{Integral solutions to systems of diagonal equations}}, doi = {10.2140/pjm.2026.340.179}, volume = {340}, year = {2026}, } @article{22318, abstract = {Many intended uses of differential privacy involve a continual mechanism that is set up to run continuously over a long period of time, making more statistical releases as either queries come in or the dataset is updated. In this paper, we give the first general treatment of privacy against adaptive adversaries for mechanisms that support dataset updates and a variety of queries, all arbitrarily interleaved. It also models a very general notion of neighboring, that includes both event-level and user-level privacy. We prove several concurrent composition theorems for continual mechanisms, which ensure privacy even when an adversary can interleave its queries and dataset updates to the different composed mechanisms. Previous concurrent composition theorems for differential privacy were only for the case when the dataset is static, with no adaptive updates. We also give the first interactive and continual generalizations of the “parallel composition theorem” for noninteractive differential privacy. Specifically, we show that the analogue of the noninteractive parallel composition theorem holds if either there are no adaptive dataset updates or each of the composed mechanisms satisfies pure differential privacy, but it fails to hold for composing approximately differentially private mechanisms with dataset updates. Thus, we prove a tight new composition theorem for this case. In addition, we prove concurrent filter compositions theorems for the scenarios in which the privacy parameters are adaptively chosen. We extend these results to other measures of differential privacy, including Rényi DP and 𝑓 -DP. We then formalize a set of general conditions on a continual mechanism M that runs multiple continual submechanisms such that the privacy guarantees of M follow directly using the above concurrent composition theorems on the sub-mechanisms, without further privacy loss. This enables us to give a simpler and modular privacy analysis of a recent continual histogram mechanism of Henzinger, Sricharan, and Steiner. In the case of approximate DP, ours is the first proof that shows that its privacy holds against adaptive adversaries. We also provide a framework that simplifies the analysis of local differential privacy when the protocol includes multi-round server-user interactions. Using this result, we simplify the privacy analysis of the core decomposition protocol of Dhulipala, Henzinger, Li, Liu, Sricharan, and Zhu [5].}, author = {Henzinger, Monika H and Safavi Hemami, Roodabeh and Vadhan, Salil}, issn = {2836-6573}, journal = {Proceedings of the ACM on Management of Data}, keywords = {differential privacy, concurrent composition, continual release, continual observation, data streaming, continual mechanisms, concurrent parallel composition, concurrent filter composition}, number = {2}, pages = {1--26}, publisher = {Association for Computing Machinery}, title = {{Concurrent composition for differentially private continual mechanisms}}, doi = {10.1145/3801895}, volume = {4}, year = {2026}, } @inproceedings{22294, abstract = {Modern computer systems store vast amounts of personal data, enabling advances in AI and ML but risking user privacy and trust. For privacy reasons, it is sometimes desired for an ML model to forget part of the data it was trained on. In this paper, we introduce a novel unlearning approach based on Forgetting Neural Networks (FNNs), a neuroscience-inspired architecture that explicitly encodes forgetting through multiplicative decay factors. While FNNs had previously been studied as a theoretical construct, we provide the first concrete implementation and demonstrate their effectiveness for targeted unlearning. We propose several variants with per-neuron forgetting factors, including rank-based assignments guided by activation levels, and evaluate them on MNIST and Fashion-MNIST benchmarks. Our method systematically removes information associated with forget sets while preserving performance on retained data. Membership inference attacks confirm the effectiveness of FNN-based unlearning in erasing information about the training data from the neural network. These results establish FNNs as a promising foundation for efficient and interpretable unlearning. }, author = {Hatua, Amartya and Nguyen, Trung and Cano Cordoba, Filip and Sung, Andrew}, booktitle = {Proceedings of the 18th International Conference on Agents and Artificial Intelligence}, isbn = {9789897587962}, issn = {2184-433X}, keywords = {Machine Unlearning, Neuroscience-Inspired Machine Learning, Membership Inference Attacks}, location = {Marbella, Spain}, pages = {1536--1546}, publisher = {SciTePress}, title = {{Machine unlearning using forgetting neural networks}}, doi = {10.5220/0014326500004052}, volume = {2}, year = {2026}, } @article{22322, abstract = {We study the problem of continually releasing statistics of an evolving dataset under differential privacy. In the event-level setting, we show the first polynomial lower bounds on the additive error for insertions-only graph problems such as maximum matching, degree histogram and k-core number computation. These results represent an exponential improvement on the polylogarithmic lower bounds of Fichtenberger, Henzinger and Ost [ESA 2021] for the former two problems, and are the first lower bounds in the continual release setting for the latter problem. Our results run counter to the intuition that the difference between insertions-only vs fully dynamic updates causes the gap between polylogarithmic and polynomial additive error. Indeed, we show that for estimating the size of the maximum matching or k-core number of a vertex, allowing small multiplicative approximations is what brings the additive error down to polylogarithmic. We complement these results with improved upper bounds on the additive error when no multiplicative approximation is allowed. Beyond graphs, our techniques also show that polynomial additive error is unavoidable for the Simultaneous Norm Estimation problem in the insertions-only setting. When multiplicative approximations are allowed, we circumvent this lower bound by giving the first continual mechanism with polylogarithmic additive error under (1 + ζ) multiplicative approximations, for any ζ > 0, for estimating all monotone symmetric norms simultaneously. In the item-level setting, we show polynomial lower bounds on the product of the multiplicative and the additive error of continual mechanisms for a large range of graph problems. To the best of our knowledge, these are the first lower bounds shown for any differentially private mechanism under continual release with multiplicative error. To obtain these results, we prove a new lower bound on the product of multiplicative and additive error for the 1-Way-Marginals problem, and give reductions from 1-Way-Marginals to our desired graph problems. This generalizes the prior results of Hardt and Talwar [STOC 2010] and Bun, Ullman and Vadhan [STOC 2014, SIAM J. Comput. 2018], who gave lower bounds on the additive error for the special case of mechanisms with no multiplicative error.}, author = {Aryanfard, Bardiya and Henzinger, Monika H and Saulpic, David and Sricharan, A. R.}, issn = {2836-6573}, journal = {Proceedings of the ACM on Management of Data}, number = {2}, pages = {1--27}, publisher = {Association for Computing Machinery}, title = {{Improved lower bounds for privacy under continual release}}, doi = {10.1145/3801903}, volume = {4}, year = {2026}, } @article{22326, abstract = {In many developmental systems, cells differentiate into a tissue by reading out morphogen concentration fields, a process fundamentally limited by noise. How much can the precision of this process be improved by nonlocal information, e.g., via cell-cell communication? Using a Bayes-optimal framework, we show that positional inference depends crucially on morphogen spatial correlations and on the "structural prior" that encodes the geometry of the cellular lattice performing the readout, thereby determining what a cell can reliably assume about the position of its neighbors when interpreting nonlocal morphogen signals. We derive upper bounds on positional information gain due to nonlocal readout and identify signal processing algorithms that approximate optimal positional inference, as well as simple chemical reaction schemes which implement such algorithms. Our theory suggests that correlational information can be exploited to significantly enhance developmental precision.}, author = {Zhang, Chen Y and Mateu Hoyos, Pablo and Brückner, David and Tkačik, Gašper}, issn = { 1079-7114}, journal = {Physical Review Letters}, publisher = {American Physical Society}, title = {{Nonlocal decoding of positional and correlational information during development}}, doi = {10.1103/mbjk-v4ym}, volume = {137}, year = {2026}, }