@article{21132,
  abstract     = {We unify the variational hypocoercivity framework established by D. Albritton, S. Armstrong, J.-C. Mourrat, and M. Novack [2], with the notion of second-order lifts of reversible diffusion processes, recently introduced by A. Eberle and the second author [30]. We give an abstract, yet fully constructive, presentation of the theory, so that it can be applied to a large class of linear kinetic equations. As this hypocoercivity technique does not twist the reference norm, we can recover accurate and sharp convergence rates in various models. Among those, adaptive Langevin dynamics (ALD) is discussed in full detail and we show that for near-quadratic potentials, with suitable choices of parameters, it is a near-optimal second-order lift of the overdamped Langevin dynamics. As a further consequence, we observe that the Generalised Langevin Equation (GLE) is also a second-order lift, as the standard (kinetic) Langevin dynamics are, of the overdamped Langevin dynamics. Then, convergence of (GLE) cannot exceed ballistic speed, i.e. the square root of the rate of the overdamped regime. We illustrate this phenomenon with explicit computations in a benchmark Gaussian case.},
  author       = {Brigati, Giovanni and Lörler, Francis and Wang, Lihan},
  issn         = {1937-5077},
  journal      = {Kinetic and Related Models},
  pages        = {34--55},
  publisher    = {American Institute of Mathematical Sciences},
  title        = {{Hypocoercivity meets lifts}},
  doi          = {10.3934/krm.2025020},
  volume       = {20},
  year         = {2026},
}

@inproceedings{21133,
  abstract     = {Data structures based on trees and tree traversals are ubiquitous in computer systems. Many low-level programs, including some implementations of critical systems like page tables and the web browser DOM, rely on generic tree-traversal functions that traverse tree nodes in a pre-determined order, applying a client-provided operation to each visited node. Developing a general approach to specifying and verifying such traversals is tricky since the client-provided per-node operation can be stateful and may potentially depend on or modify the structure of the tree being traversed.
In this paper, we present a recipe for (semi-)automated verification of such generic, stateful tree traversals. Our recipe is (a) general: it applies to a range of tree traversals, in particular, pre-, post- and in-order depth-first traversals; (b) modular: parts of a traversal’s proof can be reused in verifying other similar traversals; (c) expressive: using the specification of a tree traversal, we can verify clients that use the traversal in a variety of different ways; and (d) automatable: many proof obligations can be discharged automatically.
At the heart of our recipe is a novel use of tree zippers to represent a logical abstraction of the tree traversal state, and zipper transitions as an abstraction of traversal steps. We realize our recipe in the RefinedC framework in Rocq, which allows us to verify a number of different tree traversals and their clients written in C.},
  author       = {Elbeheiry, Laila and Sammler, Michael Joachim and Krebbers, Robbert and Dreyer, Derek and Garg, Deepak},
  booktitle    = {Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs},
  isbn         = {9798400723414},
  location     = {Rennes, France},
  pages        = {339--352},
  publisher    = {Association for Computing Machinery},
  title        = {{A recipe for modular verification of generic tree traversals}},
  doi          = {10.1145/3779031.3779110},
  year         = {2026},
}

@inproceedings{21134,
  abstract     = {The Nakamoto consensus protocol underlying the Bitcoin blockchain uses proof of work as a voting mechanism. Honest miners who contribute hashing power towards securing the chain try to extend the longest chain they are aware of. Despite its simplicity, Nakamoto consensus achieves meaningful security guarantees assuming that at any point in time, a majority of the hashing power is controlled by honest parties. This also holds under “resource variability”, i.e., if the total hashing power varies greatly over time.
Proofs of space (PoSpace) have been suggested as a more sustainable replacement for proofs of work. Unfortunately, no construction of a “longest-chain” blockchain based on PoSpace, that is secure under dynamic availability, is known. In this work, we prove that without additional assumptions no such protocol exists. We exactly quantify this impossibility result by proving a bound on the length of the fork required for double spending as a function of the adversarial capabilities. This bound holds for any chain selection rule, and we also show a chain selection rule (albeit a very strange one) that almost matches this bound.
The Nakamoto consensus protocol underlying the Bitcoin blockchain uses proof of work as a voting mechanism. Honest miners who contribute hashing power towards securing the chain try to extend the longest chain they are aware of. Despite its simplicity, Nakamoto consensus achieves meaningful security guarantees assuming that at any point in time, a majority of the hashing power is controlled by honest parties. This also holds under “resource variability”, i.e., if the total hashing power varies greatly over time.

Proofs of space (PoSpace) have been suggested as a more sustainable replacement for proofs of work. Unfortunately, no construction of a “longest-chain” blockchain based on PoSpace, that is secure under dynamic availability, is known. In this work, we prove that without additional assumptions no such protocol exists. We exactly quantify this impossibility result by proving a bound on the length of the fork required for double spending as a function of the adversarial capabilities. This bound holds for any chain selection rule, and we also show a chain selection rule (albeit a very strange one) that almost matches this bound.

Concretely, we consider a security game in which the honest parties at any point control 0 > 1
 times more space than the adversary. The adversary can change the honest space by a factor 1+- E with every block (dynamic availability), and “replotting” the space (which allows answering two challenges using the same space) takes as much time as p blocks.
We prove that no matter what chain selection rule is used, in this game the adversary can create a fork of length o^2 . p/E that will be picked as the winner by the chain selection rule.
We also provide an upper bound that matches the lower bound up to a factor o. There exists a chain selection rule (albeit a very strange one) which in the above game requires forks of length at least o . p/E
Our results show the necessity of additional assumptions to create a secure PoSpace based longest-chain blockchain. The Chia network in addition to PoSpace uses a verifiable delay function. Our bounds show that an additional primitive like that is necessary.},
  author       = {Baig, Mirza Ahad and Pietrzak, Krzysztof Z},
  booktitle    = {29th International Conference on Financial Cryptography and Data Security},
  isbn         = {9783032070340},
  issn         = {1611-3349},
  location     = {Miyakojima, Japan},
  pages        = {127--142},
  publisher    = {Springer Nature},
  title        = {{On the (in)security of Proofs-of-space based longest-chain blockchains}},
  doi          = {10.1007/978-3-032-07035-7_8},
  volume       = {15752},
  year         = {2026},
}

@inproceedings{21135,
  abstract     = {Three-dimensional (3D) microscopy data is often anisotropic with significantly lower resolution (up to 8x) along the z axis than along the xy axes. Computationally generating plausible isotropic resolution from anisotropic imaging data would benefit the visual analysis of large-scale volumes. This paper proposes niiv, a self-supervised method for isotropic reconstruction of 3D microscopy data that can quickly produce images at arbitrary output resolutions. The representation embeds a learned latent code within a neural field that describes the implicit higher-resolution isotropic image region. We use an attention-guided latent interpolation approach, which allows flexible information exchange over a local latent neighborhood. Under isotropic volume assumptions, we self-supervise this representation on low-/high-resolution lateral image pairs to reconstruct an isotropic volume from low-resolution axial images. We evaluate our method on simulated and real anisotropic electron (EM) and light microscopy (LM) data. Compared to diffusion-based baselines, niiv shows improved reconstruction quality (+1 dB PSNR) and is over three orders of magnitude faster (1,000x) to infer. Specifically, niiv reconstructs a 128^3 voxel volume in 2/10th of a second, renderable at varying (continuous) high resolutions for display. Our code is available at https://github.com/jakobtroidl/niiv-miccai.},
  author       = {Troidl, Jakob and Liang, Yiqing and Beyer, Johanna and Tavakoli, Mojtaba and Danzl, Johann G and Hadwiger, Markus and Pfister, Hanspeter and Tompkin, James},
  booktitle    = {1st International Workshop on Efficient Medical Artificial Intelligence},
  isbn         = {9783032139603},
  issn         = {1611-3349},
  location     = {Daejeon, South Korea},
  pages        = {257--267},
  publisher    = {Springer Nature},
  title        = {{niiv: Interactive Self-supervised Neural Implicit Isotropic Volume Reconstruction}},
  doi          = {10.1007/978-3-032-13961-0_26},
  volume       = {16318},
  year         = {2026},
}

@misc{21137,
  author       = {Naik, Suyash},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Data associated with Keratins coordinate tissue spreading }},
  doi          = {10.15479/AT-ISTA-21137},
  year         = {2026},
}

@inproceedings{21140,
  abstract     = {We consider several problems related to packing forests in graphs. The first one is to find k edge-disjoint forests in a directed graph G of maximal size such that the indegree of each vertex in these forests is at most k. We describe a min-max characterization for this problem and show that it can be solved in almost linear time for fixed k, extending the algorithm of [Gabow, 1995]. Specifically, the complexity is O(kδm log n), where n, m are the number of vertices and edges in G respectively, and δ = max{1, k − kG}, where kG is the edge connectivity of the graph. Using our solution to this problem, we improve complexities for two existing applications:(1) k-forest problem: find k forests in an undirected graph G maximizing the number of edges in their union. We show how to solve this problem in O(k3 min{kn, m} log2 n + k · MAXFLOW(m, m) log n) time, breaking the Ok(n3/2) complexity barrier of previously known approaches.(2) Directed edge-connectivity augmentation problem: find a smallest set of directed edges whose addition to the given directed graph makes it strongly k-connected. We improve the deterministic complexity for this problem from O(kδ(m + δn) log n) [Gabow, STOC 1994] to O(kδm log n). A similar approach with the same complexity also works for the undirected version of the problem.},
  author       = {Arkhipov, Pavel and Kolmogorov, Vladimir},
  booktitle    = {Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms},
  location     = {Vancouver, Canada},
  pages        = {4023--4042},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Faster algorithms for packing forests in graphs and related problems}},
  doi          = {10.1137/1.9781611978971.148},
  year         = {2026},
}

@article{21149,
  abstract     = {We present a general theoretical framework for helical dichroism (HD), establishing an explicit link between chiral resolution and orbital angular momentum (OAM) exchange in light–matter interaction. Tracing microscopic mechanisms of the OAM transfer, we derive rotational selection rules, which establish that HD emerges only from the spin–orbit coupling of light, even for beams without the far-field OAM. Our findings refine the conditions for observing HD, provide a tool to re-examine the outcome of prior experiments, and guide future designs for chiral sensing with structured light.},
  author       = {Hrast, Mateja and Koutentakis, Georgios and Maslov, Mikhail and Lemeshko, Mikhail},
  issn         = {1079-7114},
  journal      = {Physical Review Letters},
  number       = {5},
  publisher    = {American Physical Society},
  title        = {{Bottom-up analysis of rovibrational helical dichroism}},
  doi          = {10.1103/fkf1-1jml},
  volume       = {136},
  year         = {2026},
}

@article{21158,
  abstract     = {Vernalization-regulated flowering is vital for wheat yield and geographical distribution, and the diversity of flowering time genes is essential for the breeding of climate-resilient varieties. Sugars have long been recognized in regulating flowering; however, the intrinsic connection between carbohydrate metabolism and vernalization response remains largely unexplored. Here, we identify a fructose 1,6-bisphosphate aldolase (FBA) encoding gene, HtL1/FBA10, as a modulator of heading time variation based on a genome-wide association study utilizing wheat core germplasm collections. Evolutionary analysis shows a decrease in the proportion of haplotype-2 of HtL1, which is linked to delayed flowering, in Chinese and American wheat varieties compared to landraces. Vernalization reduces HtL1/FBA10 phosphorylation levels and  increases  its O-GlcNAcylation, which in turn enhances its enzymatic activity and facilitates VERNALIZATION 1 (VRN1) transcription by regulating histone acetylation at the VRN1 locus. Our findings provide mechanistic insights into the interplay between glucose metabolism and the epigenetic regulation of vernalization in winter wheat.},
  author       = {Yang, Pengfang and Liu, Yangyang and Dong, Qi and Miao, Yuting and Zhang, Jianlong and Xu, Shujuan and Zhao, Hong and Niu, Yuda and Zhang, Xueyong and Xu, Yunyuan and Guo, Zifeng and Xing, Lijing and Chong, Kang},
  issn         = {2041-1723},
  journal      = {Nature Communications},
  publisher    = {Springer Nature},
  title        = {{O-GlcNAc and phosphorylation modifications on HtL1/FBA10 regulate wheat vernalization for flowering}},
  doi          = {10.1038/s41467-025-67734-0},
  volume       = {17},
  year         = {2026},
}

@article{21159,
  abstract     = {One of the foundational theorems of extremal graph theory is Dirac’s theorem, which
says that if an n-vertex graph G has minimum degree at least n/2, then G has a
Hamilton cycle, and therefore a perfect matching (if n is even). Later work by Sárközy,
Selkow and Szemerédi showed that in fact Dirac graphs have many Hamilton cycles
and perfect matchings, culminating in a result of Cuckler and Kahn that gives a precise
description of the numbers of Hamilton cycles and perfect matchings in a Dirac graph
G (in terms of an entropy-like parameter of G). In this paper we extend Cuckler
and Kahn’s result to perfect matchings in hypergraphs. For positive integers d < k,
and for n divisible by k, let md (k, n) be the minimum d-degree that ensures the
existence of a perfect matching in an n-vertex k-uniform hypergraph. In general, it is
an open question to determine (even asymptotically) the values of md (k, n), but we are
nonetheless able to prove an analogue of the Cuckler–Kahn theorem, showing that if
an n-vertex k-uniform hypergraph G has minimum d-degree at least (1+γ )md (k, n)
(for any constantγ > 0), then the number of perfect matchings in G is controlled by
an entropy-like parameter of G. This strengthens cruder estimates arising from work
of Kang–Kelly–Kühn–Osthus–Pfenninger and Pham–Sah–Sawhney–Simkin.},
  author       = {Kwan, Matthew Alan and Safavi Hemami, Roodabeh and Wang, Yiting},
  issn         = {1439-6912},
  journal      = {Combinatorica},
  publisher    = {Springer Nature},
  title        = {{Counting perfect matchings in Dirac hypergraphs}},
  doi          = {10.1007/s00493-025-00194-8},
  volume       = {46},
  year         = {2026},
}

@article{21164,
  abstract     = {Global emission inventories often fail to capture the complexities of vehicular pollution in regions with unique fuel mixes, such as Brazil’s extensive biofuel use, leading to significant uncertainties in atmospheric modeling. This study presents a century-long (1960–2100) bottom-up vehicular emission inventory for Brazil, leveraging locally derived emission factors. Our estimates reveal substantial discrepancies in magnitude, timing, and speciation of non-CO2 pollutants (CO, NMHC, PM2.5) compared to leading global inventories (EDGAR, CEDS, CAMS), highlighting critical inaccuracies in widely used data sets. More critically, future projections under Shared Socioeconomic Pathways (SSPs) uncover a novel positive feedback mechanism: rising temperatures significantly enhance vehicular evaporative nonmethane hydrocarbon (NMHC) emissions. This temperature-dependent increase and subsequent NMHC oxidation to CO2 suggest an overlooked pathway that could amplify climate warming and air pollution globally, particularly after a breakpoint around 2050 (p < 0.05). While historical emissions peaked in the 1990s–2000s, nonexhaust PM becomes increasingly important. Air quality simulations using our inventory in the MUSICA model show good regional PM2.5 agreement but highlight challenges in resolving local primary pollutant peaks. This comprehensive inventory provides crucial data for Brazil and uncovers globally relevant climate–chemistry interactions, urging a re-evaluation of regional specificities in global emission assessments.},
  author       = {Ibarra-Espinosa, Sergio and Dias de Freitas, Edmilson and Gaubert, Benjamin and Lichtig, Pablo and Ropkins, Karl and da Silva, Iara and Martins Pereira, Guilherme and Schuch, Daniel and Nascimento, Janaina and Hoinaski, Leonardo and Martins, Leila Droprinchinski and Gavidia-Calderón, Mario and Vara-Vela, Angel and Toledo de Almeida Albuquerque, Taciana and Ynoue, Rita Yuri and Diez, Sebastian and Mera, Zamir and Casallas Garcia, Alejandro and Vallejo, Fidel and Diaz, Valeria and Pedruzzi, Rizzieri and Abrutzky, Rosana and Franco, Marco A. and Huneeus, Nicolas and Jorquera, Hector and Belalcázar-Cerón, Luis Carlos and Rojas, Néstor Y. and de Fatima Andrade, Maria and Emmons, Louisa and Brasseur, Guy},
  issn         = {1520-5851},
  journal      = {Environmental Science &amp; Technology},
  publisher    = {American Chemical Society},
  title        = {{A century of vehicular emissions in Brazil: Unveiling the impacts of unique fuel mix on air quality}},
  doi          = {10.1021/acs.est.5c08400},
  year         = {2026},
}

@misc{21174,
  abstract     = {UTe2 exhibits the remarkable phenomenon of re-entrant superconductivity, whereby the zero-resistance state reappears above 40 tesla after being suppressed with a field of around 10 tesla. One potential pairing mechanism, invoked in the related re-entrant superconductors UCoGe and URhGe, involves transverse fluctuations of a ferromagnetic order parameter. However, the requisite ferromagnetic order - present in both UCoGe and URhGe - is absent in UTe2, and magnetization measurements show no sign of strong fluctuations. Here, we measure the magnetotropic susceptibility of UTe2 across two field-angle planes. This quantity is sensitive to the magnetic susceptibility in a direction transverse to the applied magnetic field - a quantity that is not accessed in conventional magnetization measurements. We observe a very large decrease in the magnetotropic susceptibility over a broad range of field orientations, indicating a large increase in the transverse magnetic susceptibility. The three superconducting phases of UTe2, including the high-field re-entrant phase, surround this region of enhanced susceptibility in the field-angle phase diagram. The strongest transverse susceptibility is found near the critical end point of the high-field metamagnetic transition, suggesting that quantum critical fluctuations of a field-induced magnetic order parameter may be responsible for the large transverse susceptibility, and may provide a pairing mechanism for field-induced superconductivity in UTe2.},
  author       = {Modic, Kimberly A},
  keywords     = {transverse magnetic susceptibility, magnetotropic, superconductivity, magnetic fluctuations},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Research data for "Giant transverse magnetic fluctuations at the edge of re-entrant superconductivity in UTe2"}},
  doi          = {10.15479/AT-ISTA-21174},
  year         = {2026},
}

@unpublished{21212,
  abstract     = {Malignant glioma is incurable. Using a mouse genetic mosaic system to generate sporadic Trp53,Nf1-null OPCs, we previously identified oligodendrocyte precursor cell (OPC) as a cell-of-origin of glioma. Here, we report that pre-malignant Trp53,Nf1-null OPCs outcompete wildtype counterparts during their expansion. Blocking competition by mutating/strengthening wildtype OPCs impeded both pre-malignant progression and malignant expansion of glioma.

“In-tissue” phosphoproteomic profiling revealed an enrichment of phosphopeptides related to RNA splicing and protein translation at the peak of cell competition, suggesting that competitiveness may stem from unique protein species. Among candidates was mTORC1, whose pharmacological inhibition or genetic disruption resulted in a loss of competitiveness in our mouse model. Finally, analysis of patient biopsies and interrogating the role of individual gliomagenic mutations in OPC competition supported its relevance in human gliomas. Together, these findings identified the driving role of competitive interactions among OPCs in gliomagenesis, and suggest unconventional therapeutic strategies to target this process.},
  author       = {Jiang, Ying and Ahn, Ryuhjin and Huang, Arthur and Gonzalez, Phillippe P. and Kim, Jungeun and Zhang, Guoxin and Liu, Zihao and He, Zhenqiang and Dudley, Lindsey and Patel, Kunal S. and Dzhivhuho, Godfrey A. and Crowl, Sam and Przanowski, Piotr and Camacho, Luisa Quesada and Hao, Sijie and Zeng, Jianhao and Hippenmeyer, Simon and Fallahi-Sichani, Mohammad and Janes, Kevin A. and Naegle, Kristen M. and Hammarskjold, Marie-Louise and Goldman, Steven A. and Kornblum, Harley I. and Yao, Maojin and White, Forest and Zong, Hui},
  booktitle    = {bioRxiv},
  title        = {{Critical role of cell competition in gliomagenesis}},
  doi          = {10.64898/2026.01.15.699808},
  year         = {2026},
}

@article{21217,
  abstract     = {This study investigates the mechanisms driving clustered convection and the breakdown of the Intertropical Convergence Zone (ITCZ) over the Western Pacific Warm Pool using high‐resolution cloud‐resolving simulations and machine‐learning sensitivity experiments. Results show that ITCZ breakdown episodes, marked by spatially homogeneous convection and weakened meridional moisture gradients, are triggered primarily by anomalous moisture advection linked to the equatorial Rossby‐wave activity. While large‐scale moisture advection regulates the background convective state strongly, it is the surface and low‐level meridional winds that dominate transitions between clustered and random convection. Simulations demonstrate that moisture alone can sustain convective clustering, but breakdown episodes are more persistent and widespread when coupled with southerly meridional advection. These findings confirm that wave‐driven advection acts as a regulatory mechanism, periodically disrupting convective clustering and reshaping the meridional moisture gradient. This modulation of organization by wave‐induced breakdown events is critical for understanding tropical convection variability and its implications for the climate system.},
  author       = {Casallas Garcia, Alejandro and Mark Tompkins, Adrian and Muller, Caroline J},
  issn         = {1477-870X},
  journal      = {Quarterly Journal of the Royal Meteorological Society},
  publisher    = {Wiley},
  title        = {{Moisture and wind effects of Rossby waves on Western Pacific Intertropical Convergence Zone breakdown events}},
  doi          = {10.1002/qj.70131},
  year         = {2026},
}

@inbook{21230,
  abstract     = {Asteroseismology is the study of the interior physics and structure of stars using their pulsations. It is applicable to stars across the Hertzsprung–Russell (HR) diagram and a powerful technique not only to measure masses, radii, and ages but also directly constrain interior rotation, chemical mixing, and magnetism. This is because a star's self-excited pulsation modes are sensitive to its structure. Asteroseismology generally requires long-duration and high-precision time-series data. The method of forward asteroseismic modeling, which is the statistical comparison of observed pulsation mode frequencies to theoretically predicted pulsation frequencies calculated from a grid of models, provides precise constraints for calibrating various transport phenomena. In this introduction to asteroseismology, we provide an overview of its principles, and the typical data sets and methodologies used to constrain stellar interiors. Finally, we present key highlights of asteroseismic results from across the HR diagram, and conclude with ongoing challenges and future prospects for this ever-expanding field within stellar astrophysics.},
  author       = {Bowman, Dominic M. and Bugnet, Lisa Annabelle},
  booktitle    = {Encyclopedia of Astrophysics},
  editor       = {Mandel, Ilya},
  isbn         = {9780443214400},
  pages        = {133--153},
  publisher    = {Elsevier},
  title        = {{Asteroseismology}},
  doi          = {10.1016/b978-0-443-21439-4.00036-5},
  volume       = {2},
  year         = {2026},
}

@article{21231,
  abstract     = {To assess cell migration in complex spatial environments, microfabricated chips, such as mazes and pillar forests, are routinely used to impose spatial and mechanical constraints, and cell trajectories are followed within these structures by advanced imaging techniques. In systems mechanobiology, computational models serve as essential tools to uncover how physical geometry influences intracellular dynamics; however, decoding such complex behaviors requires advanced inference techniques. Here, we integrated experimental observations of dendritic cell migration in a geometrically constrained microenvironment into a Cellular Potts model. We demonstrated that these spatial constraints modulate the motility dynamics, including speed and directional changes. We show that classical summary statistics, such as mean squared displacement and turning angle distributions, can resolve key mechanistic features but fail to extract richer spatiotemporal patterns, limiting accurate parameter inference. To solve this, we applied neural posterior estimation with in-the-loop learning of summary features. This learned summary representation of the data enables robust and flexible parameter inference, providing a data-driven framework for model calibration and advancing quantitative analysis of cell migration in structured microenvironments.},
  author       = {Arruda, Jonas and Alamoudi, Emad and Mueller, Robert and Vaisband, Marc and Molkenbur, Ronja and Merrin, Jack and Kiermaier, Eva and Hasenauer, Jan},
  issn         = {2056-7189},
  journal      = {npj Systems Biology and Applications},
  publisher    = {Springer Nature},
  title        = {{Simulation-based inference of cell migration dynamics in complex spatial environments}},
  doi          = {10.1038/s41540-026-00648-9},
  volume       = {12},
  year         = {2026},
}

@article{21232,
  abstract     = {<jats:title>Abstract</jats:title>
                  <jats:p>In this paper, we consider a simple class of stratified spaces – 2-complexes. We present an algorithm that learns the abstract structure of an embedded 2-complex from a point cloud sampled from it. We use tools and inspiration from computational geometry, algebraic topology, and topological data analysis and prove the correctness of the identified abstract structure under assumptions on the embedding.</jats:p>},
  author       = {Bleile, Yossi},
  issn         = {2730-9657},
  journal      = {La Matematica},
  publisher    = {Springer Nature},
  title        = {{Towards stratified space learning: 2-complexes}},
  doi          = {10.1007/s44007-025-00183-9},
  volume       = {5},
  year         = {2026},
}

@article{21234,
  abstract     = {In aged humans and mice, hypobranched glycogen aggregates, known as polyglucosan bodies (PGBs), accumulate in hippocampal astrocytes. While PGBs are linked to cognitive decline in neurological diseases, they remain largely unstudied in the context of typical aging. We show that PGBs arise in autophagy-dysregulated astrocytes in the aged hippocampus, with substantial variation among 32 inbred BXD mouse strains. Genetic mapping through quantitative trait locus analysis identified a major locus (Pgb1) that modulates hippocampal PGB burden. Extensive transcriptomic and proteomic datasets were produced for the aged hippocampus of the BXD family to investigate the mechanism by which the Pgb1 locus modulates PGB burden. We identified that Pgb1 contains allelic Smarcal1 and Usp37 variants and influences PGB burden through trans-regulation of mRNA and protein expression levels, including abundance of glycogen-mobilizing factor PYGB. Furthermore, comprehensive phenome-wide association scans, transcriptomic analyses, and direct behavioral testing demonstrated that cognition remains intact despite age-related PGB burden. A record of this paper’s transparent peer review process is included in the supplemental information.},
  author       = {Gómez-Pascual, Alicia and Glikman, Dow M and Ng, Hui Xin and Tomkins, James E. and Lu, Lu and Xu, Ying and Ashbrook, David G. and Kaczorowski, Catherine and Kempermann, Gerd and Killmar, John and Mozhui, Khyobeni and Ohlenschläger, Oliver and Aebersold, Rudolf and Ingram, Donald K. and Williams, Evan G. and Jucker, Mathias and Overall, Rupert W. and Williams, Robert W. and de Bakker, Dennis E.M.},
  issn         = {2405-4712},
  journal      = {Cell Systems},
  number       = {2},
  publisher    = {Elsevier},
  title        = {{The Smarcal1-Usp37 locus modulates glycogen aggregation in astrocytes of the aged hippocampus}},
  doi          = {10.1016/j.cels.2025.101488},
  volume       = {17},
  year         = {2026},
}

@article{21273,
  abstract     = {In this paper we examine how porosity fluctuations affect the hydrodynamic permeability of a porous matrix or membrane. We introduce a fluctuating Darcy model, which couples the Navier-Stokes equation to the space- and time-dependent porosity fluctuations via a Darcy friction term. Using a perturbative approach, a Dyson equation for hydrodynamic fluctuations is derived and solved to express the permeability in terms of the matrix fluctuation spectrum. Surprisingly, the model reveals strong modifications of the fluid permeability in fluctuating matrices compared to static ones. Applications to various matrix excitation models, the breathing matrix, phonons, and active forcing, highlight the significant influence of matrix fluctuations on fluid transport, offering insights for optimizing membrane design for separation applications.},
  author       = {Dombret, Albert and Sutter, Adrien and Coquinot, Baptiste and Kavokine, Nikita and Coasne, Benoit and Bocquet, Lydéric},
  issn         = {2469-990X},
  journal      = {Physical Review Fluids},
  number       = {1},
  publisher    = {American Physical Society},
  title        = {{Hydrodynamic permeability of fluctuating porous membranes}},
  doi          = {10.1103/m8h6-1wfk},
  volume       = {11},
  year         = {2026},
}

@article{21274,
  abstract     = {Many white dwarfs are observed in compact double white dwarf binaries, and through the emission of gravitational waves, a large fraction are destined to merge. The merger remnants that do not explode in a Type Ia supernova are expected to initially be rapidly rotating and highly magnetized. In this work, we present our discovery of the variable white dwarf ZTF J200832.79+444939.67, hereafter ZTF J2008+4449, as a likely merger remnant showing signs of circumstellar material without a stellar or substellar companion. The nature of ZTF J2008+4449 as a merger remnant is supported by its physical properties: it is hot (35 500 ± 300 K) and massive (1.12 ± 0.03 M
                    <jats:sub>⊙</jats:sub>
                    ), rapidly rotating with a period of ≈6.6 minutes, and likely possesses exceptionally strong magnetic fields (∼400−600 MG) at its surface. Remarkably, we detect a significant period derivative of (1.80 ± 0.09)×10
                    <jats:sup>−12</jats:sup>
                    s/s, indicating that the white dwarf is spinning down, and a soft X-ray emission that is inconsistent with photospheric emission. As the presence of a mass-transferring stellar or brown dwarf companion is excluded by infrared photometry, the detected spin-down and X-ray emission could be tell-tale signs of a magnetically driven wind or of interaction with circumstellar material, possibly originating from the fallback of gravitationally bound merger ejecta or from the tidal disruption of a planetary object. We also detect Balmer emission, which requires the presence of ionized hydrogen in the vicinity of the white dwarf, showing Doppler shifts as high as ≈2000 km s
                    <jats:sup>−1</jats:sup>
                    . The unusual variability of the Balmer emission on the spin period of the white dwarf is consistent with the trapping of a half ring of ionized gas in the magnetosphere of the white dwarf.
                  </jats:p>},
  author       = {Cristea, Andrei-Alexandru and Caiazzo, Ilaria and Cunningham, Tim and Raymond, John C. and Vennes, Stephane and Kawka, Adela and Desai, Aayush A and Miller, David R. and Hermes, J. J. and Fuller, Jim and Heyl, Jeremy and van Roestel, Jan and Burdge, Kevin B. and Rodriguez, Antonio C. and Pelisoli, Ingrid and Gänsicke, Boris T. and Szkody, Paula and Kenyon, Scott J. and Vanderbosch, Zach and Drake, Andrew and Ferrario, Lilia and Wickramasinghe, Dayal and Karambelkar, Viraj R. and Justham, Stephen and Pakmor, Ruediger and El-Badry, Kareem and Prince, Thomas and Kulkarni, S. R. and Graham, Matthew J. and Masci, Frank J. and Groom, Steven L. and Purdum, Josiah and Dekany, Richard and Bellm, Eric C.},
  issn         = {1432-0746},
  journal      = {Astronomy & Astrophysics},
  publisher    = {EDP Sciences},
  title        = {{A half ring of ionized circumstellar material trapped in the magnetosphere of a white dwarf merger remnant}},
  doi          = {10.1051/0004-6361/202556432},
  volume       = {706},
  year         = {2026},
}

@article{21275,
  abstract     = {DNA methylation is a primary layer of epigenetic modification that plays a pivotal role in the regulation of development, aging, and cancer. The concurrent activity of opposing enzymes that mediate DNA methylation and demethylation gives rise to a biochemical cycle and active turnover of DNA methylation. While the ensuing biochemical oscillations have been implicated in the regulation of cell differentiation, their functional role and spatiotemporal dynamics are unknown. In this work, we demonstrate that chromatin-mediated coupling between these local biochemical cycles can lead to the emergence of phase-locked domains, regions of locally synchronized turnover activity, whose coarsening is arrested by genomic heterogeneity. We introduce a minimal model based on stochastic oscillators with constrained long-range and nonreciprocal interactions, shaped by the local chromatin organization. Through a combination of analytical theory and stochastic simulations, we predict both the degree of synchronization and the typical size of emergent phase-locked domains. We qualitatively test these predictions using single-cell sequencing data. Our results show that DNA methylation turnover exhibits surprisingly rich spatiotemporal patterns that may be used by cells to control cell differentiation.},
  author       = {Olmeda, Fabrizio and Gupta, Misha and Bektas, Onurcan and Rulands, Steffen},
  issn         = {2835-8279},
  journal      = {PRX Life},
  publisher    = {American Physical Society},
  title        = {{Spatiotemporal patterns of active epigenetic turnover}},
  doi          = {10.1103/89bj-79g5},
  volume       = {4},
  year         = {2026},
}

