@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{22306, abstract = {The AP3 complex mediates cargo sorting and carrier assembly for the trafficking of transmembrane proteins from endosomes to lysosomes. AP3 is generally believed to localize to clathrin-free, ARF1-positive, elongated carriers in cells, but the architecture of AP3-based coats was unknown. Using in vitro reconstitution and cryo–electron tomography, we demonstrate that AP3:ARF1 spontaneously remodels membranes containing cargo and the phosphoinositide PI(3,5)P 2 into tubular structures coated in spiraling rows of AP3 arches and ARF1 dimers. Targeted point mutations disrupting critical AP3:ARF1 and AP3:AP3 lattice interfaces disrupt AP3 recruitment, carrier formation, and lysosomal cargo trafficking in cells. We propose that AP3 generates tubular carriers on endosomes by organizing ARF1 dimers into elongated membrane-deforming arrays while simultaneously selecting cargo. By demonstrating that AP3:ARF1 can generate carriers without using a clathrin lattice, we explain the clathrin independence of AP3-mediated trafficking.}, author = {Kaufman, Jonathan G.G. and Tagiltsev, Grigory and Stalder, Danièle S. and Taylor, Rebecca J. and Sava, Ioana and Guo, Hui and Ciazynska, Katarzyna A. and Zaccai, Nathan R. and Gray, Sally R. and Vallis, Yvonne and Höning, Stefan and Kelly, Bernard T. and Gershlick, David C. and Briggs, John A.G. and Owen, David J.}, issn = {2375-2548}, journal = {Science Advances}, number = {20}, publisher = {American Association for the Advancement of Science}, title = {{Architecture of clathrin-independent AP3:ARF1-coated carriers}}, doi = {10.1126/sciadv.aed1529}, volume = {12}, 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}, } @article{22305, abstract = {Active dendrites enrich the repertoire of single-neuron computations. Whereas a lot is known about the function of dendrites in vitro, information about their in vivo properties is limited. A new study1 uses advanced imaging to study hippocampal CA1 pyramidal neuron dendrites in head-fixed, awake animals.}, author = {Bhattacharya, Subhodeep and Jonas, Peter M}, issn = {0896-6273}, journal = {Neuron}, number = {10}, pages = {1706--1708}, publisher = {Elsevier}, title = {{Mission impossible? Quantitative analysis of dendritic computations in vivo}}, doi = {10.1016/j.neuron.2026.04.002}, volume = {114}, 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}, } @article{22333, abstract = {RNA polymerase II (Pol II) must be assembled in the cytoplasm before it enters the nucleus, where it transcribes protein-coding genes. Although transcription by Pol II is intensively studied, how this central multi-subunit enzyme is made and the role of dedicated assembly factors remains unclear. Here, we report the integrative structural analysis of a native human Pol II from the cytoplasm captured near the end of biogenesis. The complex contains Gdown1 and three biogenesis factors – RPAP2 and the critical small GTPases GPN1 and GPN3. Cryo-EM analysis of the complex reveals how Gdown1 and RPAP2 associate with Pol II and prevent the premature association of transcription factors. Further biochemical and cryo-EM analysis reveals how RPAP2 tethers GPN1–GPN3 to the complex and how the assembly of the RPAP2–GPN1–GPN3 complex is controlled by GTP hydrolysis. The combined results uncover a network of interactions that chaperone cytoplasmic Pol II to prevent aberrant interactions, reveal a molecular switch regulating biogenesis factor association, and suggest a general mechanism for the action of GPN-loop GTPase family of enzymes.}, author = {Hlavata, Annamaria and Neuditschko, Benjamin and Schellhaas, Ulla and Plaschka, Clemens and Herzog, Franz and Bernecky, Carrie A}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Structure of cytoplasmic RNA polymerase II}}, doi = {10.1038/s41467-026-75416-8}, year = {2026}, } @article{21777, abstract = {The advantageous characteristics attributed to the 19F nucleus have made it a popular target for nuclear magnetic resonance (NMR) once again in recent years. Aside from solution NMR, an increasing number of studies have been conducted applying solid-state magic-angle spinning (MAS) NMR to fluorine-labelled samples. Here, the high chemical shift anisotropy and strong dipolar couplings can be utilised to get structural insights into proteins and measure long distances. Despite increasing popularity and promising benefits, the sensitivity of biomolecular 19F MAS NMR often suffers from slow longitudinal T1 relaxation and therefore long recycle delays. In this work, we expand paramagnetic doping, an approach commonly used to reduce proton T1 relaxation times, to 19F-labelled biological samples. We study the effect of Gd(DTPA) and Gd(DTPA-BMA) on 19F T1 and T2, and 13C T1 and T2 relaxation in a [5-19F13C]-tryptophan-labelled protein via 19F-detected MAS NMR experiments. The observed paramagnetic relaxation enhancement substantially reduces measurement times of 19F MAS NMR experiments without compromising resolution. Additionally, we report the chemical shift assignments of all four fluorotryptophan signals in the 12×39 kDa-large protein TET2 using a mutagenesis approach.}, author = {Becker, Lea Marie and Toscano, Giorgia and Kapitonova, Anna and Singh, Rajkumar and Guillerm, Undina and Lichtenecker, Roman J. and Schanda, Paul}, issn = {2699-0016}, journal = {Magnetic Resonance}, number = {1}, pages = {29--37}, publisher = {Copernicus Publications}, title = {{Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants}}, doi = {10.5194/mr-7-29-2026}, volume = {7}, year = {2026}, } @unpublished{22359, abstract = {We prove a mesoscopic central limit theorem for linear eigenvalue statistics of correlated Hermitian random matrices. The class considered here includes Wigner and Wigner-type matrices, as well as models whose entry correlations decay polynomially in the distance between index pairs. The proof combines a multivariate cumulant expansion with multi-resolvent local laws and a detailed analysis of the resulting variance kernel on the operator-level.}, author = {Lee, Jaehun and Erdös, László}, keywords = {Central limit theorem, universality, matrix Dyson equation, multi-resolvent local law}, title = {{Mesoscopic eigenvalue statistics for correlated random matrices}}, doi = {10.48550/arXiv.2607.05848}, year = {2026}, } @article{22362, abstract = {We present a systematic study of the environments of 25 luminous quasars at z > 6.5 from the ASPIRE program. Using JWST/NIRCam wide-field slitless spectroscopy data, we identified 487 galaxies at 5.3 ≲ z ≲ 7.0 exhibiting [O III] emission. Among these, 122 [O III] emitters lie within |Δvlos| < 1000 km s −1 of the quasars, corresponding to a ∼9.4-fold enhancement relative to the average galaxy density at other redshifts. Furthermore, we identified 16 [C II]-emitting galaxies at the quasar redshifts from Atacama Large Millimeter/submillimeter Array (ALMA) mosaic observations. A cross-correlation function analysis between quasars and [O III]+[C II] emitters yields a cross-correlation length of r 8.68 h cMpc 0 QG 0.55 = +0.51 1 and an autocorrelation of r 15.76 h cMpc 0 QQ 2.70 = +2.48 1 , indicating that z ∼ 7 quasars reside in dark matter halos with Mhalo 1012.27 0.26 M 0.21 = + and have a quasar lifetime of tQ 10 yr 7.05 1.01 0.95 = + . Notably, the number of [O III]-emitting galaxies at quasar redshifts varies significantly from field to field, ranging from 0 to 20, highlighting a diverse quasar environment. Remarkably, seven quasars trace significant galaxy overdensities (i.e., protoclusters), with δgal > 5 within a volume of V ∼ 500 cMpc3 . We also find that |Δvlos| increases rapidly toward smaller galaxy–quasar separations in protocluster fields, consistent with galaxy kinematics around extremely massive halos in cosmological simulations. By combining JWST and ALMA data, we reveal the complex and diverse environments of these early quasars, providing robust evidence that the earliest luminous quasars are effective tracers of galaxy overdensities, albeit with substantial field-to-field variation.}, author = {Wang, Feige and Champagne, Jaclyn B. and Huang, Jiamu and Yang, Jinyi and Hennawi, Joseph F. and Fan, Xiaohui and Zhang, Haowen and Costa, Tiago and Decarli, Roberto and Habouzit, Melanie and Sun, Fengwu and Bañados, Eduardo and Jin, Xiangyu and Kakiichi, Koki and Meyer, Romain A. and Wu, Yunjing and Belladitta, Silvia and Blecha, Laura and Bosman, Sarah E.I. and Cai, Zheng and Connor, Thomas and Davies, Frederick B. and Eilers, Anna Christina and Haiman, Zoltán and Jun, Hyunsung D. and Li, Mingyu and Li, Zihao and Liu, Weizhe and Lupi, Alessandro and Lyu, Jianwei and Mazzucchelli, Chiara and Onoue, Masafusa and Pizzati, Elia and Pudoka, Maria and Rojas-Ruiz, Sofía and Schindler, Jan Torge and Shen, Yue and Tee, Wei Leong and Trakhtenbrot, Benny and Trebitsch, Maxime and Vestergaard, Marianne and Volonteri, Marta and Walter, Fabian and Zhang, Huanian and Zou, Siwei}, issn = {15384357}, journal = {Astrophysical Journal}, number = {1}, publisher = {IOP Publishing}, title = {{ASPIRE: The environments and dark matter halos of luminous quasars in the epoch of reionization}}, doi = {10.3847/1538-4357/ae7bfa}, volume = {1006}, year = {2026}, }