@article{19879,
  abstract     = {We consider the 4-precoloring extension problem in planar near-Eulerian- triangulations, i.e., plane graphs where all faces except possibly for the outer one have length three, all vertices not incident with the outer face have even degree, and exactly the vertices incident with the outer face are precolored. We give a necessary topological condition for the precoloring to extend, and give a complete characterization when the outer face has length at most five and when all vertices of the outer face have odd degree and are colored using only three colors.},
  author       = {Dvořák, Zdeněk and Moore, Benjamin and Seifrtová, Michaela and Šámal, Robert},
  issn         = {0195-6698},
  journal      = {European Journal of Combinatorics},
  publisher    = {Elsevier},
  title        = {{Precoloring extension in planar near-Eulerian-triangulations}},
  doi          = {10.1016/j.ejc.2025.104138},
  volume       = {127},
  year         = {2025},
}

@article{19880,
  abstract     = {We investigate quantum transport in a two-dimensional electron system coupled to a chiral molecular potential, demonstrating how molecular chirality and orientation affect charge and spin transport properties. We propose a minimal model for realizing true chiral symmetry breaking on a magnetized surface, with a crucial role played by the tilt angle of the molecular dipole with respect to the surface. For non-zero tilting, we show that the Hall response exhibits clear signatures of chirality-induced effects, in both charge- and spin-resolved observables. Concerning the former, tilted enantiomers produce asymmetric Hall conductances and, even more remarkably, the persistence of this feature in the absence of spin–orbit coupling (SOC) signals how the enantiospecific charge response results from electron scattering off the molecular potential. Concerning spin-resolved observables where SOC plays a relevant role, we reveal that chiral symmetry breaking is crucial in enabling spin-flipping processes.},
  author       = {Al Hyder, Ragheed and Lemeshko, Mikhail and Cappellaro, Alberto},
  issn         = {1089-7690},
  journal      = {The Journal of Chemical Physics},
  number       = {23},
  publisher    = {AIP Publishing},
  title        = {{Quantum transport in the presence of a chiral molecular potential}},
  doi          = {10.1063/5.0271155},
  volume       = {162},
  year         = {2025},
}

@misc{19885,
  abstract     = {This .zip file contains the data to reproduce the figures and supplementary figures of "Automated All-RF Tuning for Spin Qubit Readout and Control" by Cornelius Carlsson and Jaime Saez-Mollejo et al.},
  author       = {Saez Mollejo, Jaime},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Automated All-RF Tuning for Spin Qubit Readout and Control}},
  doi          = {10.15479/AT:ISTA:19885},
  year         = {2025},
}

@misc{19915,
  author       = {Springstein, Benjamin L},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Files for "Evolutionary repurposing of a DNA segregation machinery into a cytoskeletal system controlling cyanobacterial cell shape"}},
  doi          = {10.15479/AT:ISTA:19915},
  year         = {2025},
}

@article{19928,
  abstract     = {Patho-mechanistic origins of ulcerative colitis are still poorly understood. The actin cross-linker filamin A (FLNA) impacts cellular responses through interaction with cytosolic proteins. Posttranscriptional A-to-I editing generates two forms of FLNA: genome-encoded FLNAQ and FLNAR. FLNA is edited in colon fibroblasts, smooth muscle cells, and endothelial cells. We found that the FLNA editing status determines colitis severity. Editing was highest in healthy colons and reduced during murine and human colitis. Mice that exclusively express FLNAR were highly resistant to DSS-induced colitis, whereas fully FLNAQ animals developed severe inflammation. While the genetic induction of FLNA editing influenced transcriptional states of structural cells and microbiome composition, we found that FLNAR exerts protection specifically via myeloid cells, which are physiologically unedited. Introducing fixed FLNAR did not hamper cell migration but reduced macrophage inflammation and rendered neutrophils less prone to NETosis. Thus, loss of FLNA editing correlates with colitis severity, and targeted editing of myeloid cells serves as a novel therapeutic approach in intestinal inflammation.},
  author       = {Gawish, Riem and Varada, Rajagopal and Deckert, Florian and Hladik, Anastasiya and Steinbichl, Linda and Cimatti, Laura and Milanovic, Katarina and Jain, Mamta and Torgasheva, Natalya and Tanzer, Andrea and De Paepe, Kim and Van De Wiele, Tom and Hausmann, Bela and Lang, Michaela and Pechhacker, Martin and Ibrahim, Nahla and De Vries, Ingrid and Brostjan, Christine and Sixt, Michael K and Gasche, Christoph and Boon, Louis and Berry, David and Jantsch, Michael F. and Pereira, Fatima C. and Vesely, Cornelia},
  issn         = {1540-9538},
  journal      = {Journal of Experimental Medicine},
  number       = {9},
  publisher    = {Rockefeller University Press},
  title        = {{Filamin A editing in myeloid cells reduces intestinal inflammation and protects from colitis}},
  doi          = {10.1084/jem.20240109},
  volume       = {222},
  year         = {2025},
}

@article{19929,
  abstract     = {Context. The observed Lyman-alpha (Lyα) line profile is a convolution of the complex Lyα radiative transfer taking place in the interstellar, circumgalactic, and intergalactic media (ISM, CGM, and IGM, respectively). Discerning the different components of the Lyα line is crucial in order to use it as a probe of galaxy formation or the evolution of the IGM.

Aims. We aim to present the second version of zELDA (redshift Estimator for Line profiles of Distant Lyman-Alpha emitters), an open-source Python module focused on modelling and fitting observed Lyα line profiles. This new version of zELDA focuses on disentangling the galactic from the IGM effects.

Methods. We built realistic Lyα line profiles that include the ISM and IGM contributions by combining the Monte Carlo radiative-transfer simulations for the so-called shell model (ISM) and IGM transmission curves generated from TNG100. We used these mock line profiles to train different artificial neural networks. These use the observed spectrum as input and the outflow parameters of the best fitting ‘shell model’ as output along with the redshift and Lyα emission IGM escape fraction of the source.

Results. We measured the accuracy of zELDA on mock Lyα line profiles. We find that zELDA is capable of reconstructing the ISM emerging Lyα line profile with high levels of accuracy (Kolmogórov-Smirnov<0.1) for 95% of the cases for HST/COS-like observations and 80% for MUSE-WIDE-like observations. zELDA is able to measure the IGM transmission with typical uncertainties below 10% for HST/COS and MUSE-WIDE data.

Conclusions. This work represents a step forward in the high-precision reconstruction of IGM-attenuated Lyα line profiles. zELDA allows the disentanglement of the galactic and IGM contribution shaping the Lyα line shape and thus allows us to use Lyα as a tool to study galaxy and ISM evolution.},
  author       = {Gurung-López, Siddhartha and Byrohl, Chris and Gronke, Max and Spinoso, Daniele and Torralba Torregrosa, Alberto and Fernández-Soto, Alberto and Arnalte-Mur, Pablo and Martínez, Vicent J.},
  issn         = {1432-0746},
  journal      = {Astronomy & Astrophysics},
  publisher    = {EDP Sciences},
  title        = {{zELDA II: Reconstruction of galactic Lyman-alpha spectra attenuated by the intergalactic medium using neural networks}},
  doi          = {10.1051/0004-6361/202453547},
  volume       = {698},
  year         = {2025},
}

@article{19930,
  abstract     = {We present an analysis of the UV continuum slope, β, using a sample of 726 galaxies with z > 4, selected from a mixture of JWST ERS, GTO, and GO observational programs. We considered only spectroscopic data obtained with the low-resolution (R ∼ 30 − 300) PRISM/CLEAR NIRSpec configuration. Studying the correlation between β and MUV, we find an overall decreasing trend, described by β = ( − 0.055 ± 0.017)MUV + ( − 2.98 ± 0.34). This is consistent with previous studies, where brighter galaxies show redder β values. However, when analyzing the trend in separate redshift bins, we find that at high redshift the relation becomes much flatter and is consistent with a flat slope within 1σ. Furthermore, we find that β tends to decrease with redshift, following β = ( − 0.075 ± 0.010)z + ( − 1.496 ± 0.056). This is consistent with most recent results showing a steepening of the spectra at higher z. We selected a sample of galaxies with extremely blue slopes (i.e., β < −2.6). Such slopes are steeper than predicted by stellar evolution models – even for dust-free, young, metal-poor populations – when the contribution of nebular emission is included. We selected 44 extremely blue galaxies (XBGs) and investigated the possible physical origin of their steep slopes by comparing them to a subsample of redder galaxies (matched in Δz = ±0.5 and ΔMUV = ±0.2). We find that XBGs have younger stellar populations, stronger ionization fields, lower dust attenuation, and lower but not pristine metallicity (∼10% Z⊙) compared to red galaxies. However, these properties alone cannot explain the extreme β values. Using indirect inference of Lyman continuum escape with the most recent models, we estimated the escape fraction fesc > 10% in at least 25% of the XBGs, whereas all the red sources exhibit much lower fesc values. A reduced nebular continuum contribution – resulting from either a high escape fraction or a bursty star formation history – is likely the origin of the extremely blue slopes.},
  author       = {Dottorini, D. and Calabrò, A. and Pentericci, L. and Mascia, Sara and Llerena, M. and Napolitano, L. and Santini, P. and Roberts-Borsani, G. and Castellano, M. and Amorin, R. and Dickinson, M. and Fontana, A. and Hathi, N. and Hirschmann, M. and Koekemoer, A. M. and Lucas, R. A. and Merlin, E. and Morales, A. and Pacucci, F. and Wilkins, S. and Arrabal Haro, P. and Bagley, M. and Finkelstein, S. L. and Kartaltepe, J. and Papovich, C. and Pirzkal, N.},
  issn         = {1432-0746},
  journal      = {Astronomy & Astrophysics},
  publisher    = {EDP Sciences},
  title        = {{Evolution of the UV slope of galaxies at cosmic morning (z > 4): The properties of extremely blue galaxies}},
  doi          = {10.1051/0004-6361/202453267},
  volume       = {698},
  year         = {2025},
}

@article{19931,
  abstract     = {JWST observations have uncovered a new population of red, compact objects at high redshifts dubbed “little red dots” (LRDs), which typically show broad emission lines and are thought to be dusty active galactic nuclei (AGNs). Some of their other features, however, challenge the AGN explanation, such as prominent Balmer breaks and extremely faint or even missing metal high-ionization lines, X-ray, or radio emission, including in deep stacks. Time variability is another robust test of AGN activity. Here, we exploit the z = 7.045 multiply imaged LRD A2744-QSO1, which offers a particularly unique test of variability due to lensing-induced time delays between the three images spanning 22 yr (2.7 yr in the rest-frame), to investigate its photometric and spectroscopic variability. We find the equivalent widths (EWs) of the broad Hα and Hβ lines, which are independent of magnification and other systematics, to exhibit significant variations, of up to 18 ± 3% for Hα and up to 22 ± 8% in Hβ, on a timescale of 875 d (2.4 yr) in the rest-frame. This suggests that A2744-QSO1 is indeed an AGN. We find no significant photometric variability beyond the limiting systematic uncertainties, so it currently cannot be determined whether the EW variations are due to line-flux or continuum variability. These results are consistent with a typical damped random walk variability model for an AGN such as A2744-QSO1 (MBH = 4 × 107 M⊙) given the sparse sampling of the light curve with the available data. Our results therefore support the AGN interpretation of this LRD, and highlight the need for further photometric and spectroscopic monitoring in order to build a detailed and reliable light curve.},
  author       = {Furtak, Lukas J. and Secunda, Amy R. and Greene, Jenny E. and Zitrin, Adi and Labbé, Ivo and Golubchik, Miriam and Bezanson, Rachel and Kokorev, Vasily and Atek, Hakim and Brammer, Gabriel B. and Chemerynska, Iryna and Cutler, Sam E. and Dayal, Pratika and Feldmann, Robert and Fujimoto, Seiji and Glazebrook, Karl and Leja, Joel and Ma, Yilun and Matthee, Jorryt J and Naidu, Rohan P. and Nelson, Erica J. and Oesch, Pascal A. and Pan, Richard and Price, Sedona H. and Suess, Katherine A. and Wang, Bingjie and Weaver, John R. and Whitaker, Katherine E.},
  issn         = {1432-0746},
  journal      = {Astronomy & Astrophysics},
  publisher    = {EDP Sciences},
  title        = {{Investigating photometric and spectroscopic variability in the multiply imaged little red dot A2744-QSO1}},
  doi          = {10.1051/0004-6361/202554110},
  volume       = {698},
  year         = {2025},
}

@article{19935,
  abstract     = {The separation logic framework Iris has been built on the premise that all assertions are stable, meaning they unconditionally enjoy the famous frame rule. This gives Iris—and the numerous program logics that build on it—very modular reasoning principles. But stability also comes at a cost. It excludes a core feature of the Viper verifier family, heap-dependent expression assertions, which lift program expressions to the assertion level in order to reduce redundancy between code and specifications and better facilitate SMT-based automation.
In this paper, we bring heap-dependent expression assertions to Iris with Daenerys. To do so, we must first revisit the very core of Iris, extending it with a new form of unstable resources (and adapting the frame rule accordingly). On top, we then build a program logic with heap-dependent expression assertions and lay the foundations for connecting Iris to SMT solvers. We apply Daenerys to several case studies, including some that go beyond what Viper and Iris can do individually and others that benefit from the connection to SMT.},
  author       = {Spies, Simon and Mück, Niklas and Zeng, Haoyi and Sammler, Michael Joachim and Lattuada, Andrea and Müller, Peter and Dreyer, Derek},
  issn         = {2475-1421},
  journal      = {Proceedings of the ACM on Programming Languages},
  number       = {PLDI},
  pages        = {848--873},
  publisher    = {Association for Computing Machinery},
  title        = {{Destabilizing Iris}},
  doi          = {10.1145/3729284},
  volume       = {9},
  year         = {2025},
}

@article{19936,
  abstract     = {There has been a recent upsurge of interest in formal, machine-checked verification of timing guarantees for C implementations of real-time system schedulers. However, prior work has only considered tick-based schedulers, which enjoy a clearly defined notion of time: the time "quantum". In this work, we present a new approach to real-time systems verification for interrupt-free schedulers, which are commonly used in deeply embedded and resource-constrained systems but which do not enjoy a natural notion of periodic time. Our approach builds on and connects two recently developed Rocq-based systems—RefinedC (for foundational C verification) and Prosa (for verified response-time analysis)—adapting the former to reason about timed traces and the latter to reason about overheads. We apply the resulting system, which we call RefinedProsa, to verify Rössl, a simple yet representative, fixed-priority, non-preemptive, interrupt-free scheduler implemented in C.},
  author       = {Bedarkar, Kimaya and Elbeheiry, Laila and Sammler, Michael Joachim and Gäher, Lennard and Brandenburg, Björn and Dreyer, Derek and Garg, Deepak},
  issn         = {2475-1421},
  journal      = {Proceedings of the ACM on Programming Languages},
  number       = {PLDI},
  pages        = {73--97},
  publisher    = {Association for Computing Machinery},
  title        = {{RefinedProsa: Connecting response-time analysis with C verification for interrupt-free schedulers}},
  doi          = {10.1145/3729249},
  volume       = {9},
  year         = {2025},
}

@article{19937,
  abstract     = {Simplets are elementary units within simplicial complexes and are fundamental for analyzing the structure of simplicial complexes. Previous efforts have mainly focused on accurately counting or approximating the number of simplets rather than studying their frequencies. However, analyzing simplet frequencies is more practical for large-scale simplicial complexes. This paper introduces the Simplet Frequency Distribution (SFD) vector, which enables the analysis of simplet frequencies in simplicial complexes. Additionally, we provide a bound on the sample complexity required to approximate the SFD vector using any uniform sampling-based algorithm accurately. We extend the definition of simplet frequency distribution to encompass simplices, allowing for the analysis of simplet frequencies within simplices of simplicial complexes. This paper introduces the Simplet Degree Vector (SDV) and the Simplet Degree Centrality (SDC), facilitating this analysis for each simplex. Furthermore, we present a bound on the sample complexity required for accurately approximating the SDV and SDC for a set of simplices using any uniform sampling-based algorithm. We also introduce algorithms for approximating SFD, geometric SFD, SDV, and SDC. We also validate the theoretical bounds with experiments on random simplicial complexes and demonstrate the practical application through a case study.},
  author       = {Mahini, Mohammad and Beigy, Hamid and Qadami, Salman and Saghafian, Morteza},
  issn         = {0020-0255},
  journal      = {Information Sciences},
  number       = {11},
  publisher    = {Elsevier},
  title        = {{Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality}},
  doi          = {10.1016/j.ins.2025.122425},
  volume       = {719},
  year         = {2025},
}

@misc{19956,
  abstract     = {The specific introduction of 1H-13C or 1H-15N moieties into otherwise deuterated proteins holds great potential for high-resolution solution and magic-angle spinning (MAS) NMR studies of protein structure and dynamics. Arginine residues play key roles for example at active sites of enzymes. Taking advantage of a chemically synthesized Arg with a 13C-1H2 group in an otherwise deuterated backbone, we demonstrate here the usefulness of proton-detected arginine MAS NMR approaches to probe arginine dynamics. In experiments on crystalline ubiquitin and the 134 kDa tetrameric enzyme malate dehydrogenase we detected a wide range of motions, from sites that are rigid on time scales of at least tens of milliseconds to residues undergoing predominantly nanosecond motions. Spin-relaxation and dipolar-coupling measurements enabled quantitative determination of these dynamics. We observed microsecond dynamics of residue Arg54 in crystalline ubiquitin, whose backbone is known to sample different β-turn conformations on this time scale. The labeling scheme and experiments presented here expand the toolkit for high-resolution proton-detected MAS NMR},
  author       = {Schanda, Paul},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Arginine Dynamics Probed by Magic-Angle Spinning NMR with a Specific Isotope-Labeling Scheme}},
  doi          = {10.15479/AT-ISTA-19956},
  year         = {2025},
}

@article{19963,
  abstract     = {The acquisition of cellular identity requires large-scale alterations in cellular state. The noncanonical proteasome activator PSME3 is known to regulate diverse cellular processes, but its importance for differentiation remains unclear. Here, we demonstrate that PSME3 binds dynamically to highly active promoters over the course of differentiation. However, loss of PSME3 does not globally affect mRNA transcription. We find instead that PSME3 influences the levels of several adhesion-related proteins and acts upstream of the HSP90 co-chaperone NUDC to regulate cell motility and myoblast differentiation in a proteasome-independent manner. Our findings reveal several new facets of PSME3 functionality and highlight its importance for the differentiation of myogenic cells.},
  author       = {Kuhn, Kenneth D and Cho, Ukrae H. and Hetzer, Martin W},
  issn         = {2575-1077},
  journal      = {Life Science Alliance},
  number       = {9},
  publisher    = {Embo Press},
  title        = {{PSME3 regulates migration and differentiation of myoblasts}},
  doi          = {10.26508/lsa.202503208},
  volume       = {8},
  year         = {2025},
}

@article{19964,
  abstract     = {It has been suggested that giant planet occurrence peaks for stars with M* ≈ 3 M⊙ at a value a factor of 4 higher than observed for solar-mass stars. This population of giant planets predicted to frequently orbit main-sequence B stars at a ≈ 10 au is difficult to characterize during the few hundred million years while fusion persists in their host stars. By the time those stars become massive, young white dwarfs, any giant planets present would still be luminous as a consequence of their recent formation. From an initial sample of 2195 Gaia-identified massive, young white dwarfs, we use homogeneous Spitzer Infrared Array Camera (IRAC) photometry to search for evidence of unresolved giant planets. For 30 systems, these IRAC data provide sensitivity to objects with M ≲ 10 MJup, and we identify one candidate with M ≈ 4 MJup orbiting the white dwarf GALEX J071816.4+373139. Correcting for the possibility that some of the white dwarfs in our sample result from mergers, we find a giant planet occurrence  n GP = 0.11+0.13-0.07 for stars with initial masses M* ≳ 3 M⊙. Our occurrence inference is consistent with both the Doppler-inferred occurrence of giant planets orbiting M* ≈ 2 M⊙ giant stars and the theoretically predicted factor of 4 enhancement in the occurrence of giant planets orbiting M* ≈ 3 M⊙ stars relative to solar-mass stars. Future James Webb Space Telescope NIRCam observations of our sample would provide sensitivity to Saturn-mass planets and thereby a definitive estimate of the occurrence of giant planets orbiting stars with M* ≳ 3 M⊙.},
  author       = {Cheng, Sihao and Schlaufman, Kevin C. and Caiazzo, Ilaria},
  issn         = {1538-3881},
  journal      = {The Astronomical Journal},
  number       = {1},
  publisher    = {IOP Publishing},
  title        = {{A candidate giant planet companion to the massive, young White Dwarf GALEX J071816.4+373139 informs the occurrence of giant planets orbiting B stars}},
  doi          = {10.3847/1538-3881/addd21},
  volume       = {170},
  year         = {2025},
}

@article{19965,
  abstract     = {Multiagent learning is challenging when agents face mixed-motivation interactions, where conflicts of interest arise as agents independently try to optimize their respective outcomes. Recent advancements in evolutionary game theory have identified a class of “zero-determinant” strategies, which confer an agent with significant unilateral control over outcomes in repeated games. Building on these insights, we present a comprehensive generalization of zero-determinant strategies to stochastic games, encompassing dynamic environments. We propose an algorithm that allows an agent to discover strategies enforcing predetermined linear (or approximately linear) payoff relationships. Of particular interest is the relationship in which both payoffs are equal, which serves as a proxy for fairness in symmetric games. We demonstrate that an agent can discover strategies enforcing such relationships through experience alone, without coordinating with an opponent. In finding and using such a strategy, an agent (“enforcer”) can incentivize optimal and equitable outcomes, circumventing potential exploitation. In particular, from the opponent’s viewpoint, the enforcer transforms a mixed-motivation problem into a cooperative problem, paving the way for more collaboration and fairness in multiagent systems.},
  author       = {Mcavoy, Alex and Sehwag, Udari Madhushani and Hilbe, Christian and Chatterjee, Krishnendu and Barfuss, Wolfram and Su, Qi and Leonard, Naomi Ehrich and Plotkin, Joshua B.},
  issn         = {1091-6490},
  journal      = {Proceedings of the National Academy of Sciences},
  number       = {25},
  publisher    = {National Academy of Sciences},
  title        = {{Unilateral incentive alignment in two-agent stochastic games}},
  doi          = {10.1073/pnas.2319927121},
  volume       = {122},
  year         = {2025},
}

@article{19966,
  abstract     = {Recently discovered nanofluidic memristors, have raised promises for the development of iontronics and neuromorphic computing with ions. Ionic memory effects are related to ion dynamics inside nanochannels, with timescales associated with the manifold physicochemical phenomena occurring at confined interfaces. Here, we explore experimentally the frequency-dependent current–voltage response of model nanochannels—namely glass nanopipettes—to investigate memory effects in ion transport. This characterisation, which we refer to as mem-spectrometry, highlights two characteristic frequencies, associated with short and long timescales of the order of 50 ms and 50 s in the present system. Whereas the former can be associated with ionic diffusion, very long timescales are difficult to explain with conventional transport phenomena. We develop a minimal model accounting for these mem-spectrometry results, pointing to surface charge regulation and ionic adsorption-desorption as possible origins for the long-term memory. Our work demonstrates the relevance of mem-spectrometry to highlight subtle ion transport properties in nanochannels, giving hereby new insights on the mechanisms governing ion transport and current rectification in charged conical nanopores.},
  author       = {Jouveshomme, Simon and Lizée, Mathieu and Robin, Paul and Bocquet, Lydéric},
  issn         = {1367-2630},
  journal      = {New Journal of Physics},
  number       = {6},
  publisher    = {IOP Publishing},
  title        = {{Multiple ionic memories in asymmetric nanochannels revealed by mem-spectrometry}},
  doi          = {10.1088/1367-2630/ade61b},
  volume       = {27},
  year         = {2025},
}

@article{19967,
  abstract     = {Context. Investigating the ionizing emission of star-forming galaxies and the escape fraction of ionizing photons is critical to understanding their contribution to reionization and their impact on the surrounding environment. The number of ionizing photons available to reionize the intergalactic medium (IGM) depends on not only the abundance of galaxies but also their efficiency in producing ionizing photons (ξion). This quantity is thus fundamental to quantify the role of faint versus bright sources in driving this process, as we must assess their relative contribution to the total ionizing emissivity.

Aims. Our goal is to estimate the ξion using Balmer lines (Hα or Hβ) in a sample of 761 galaxies at 4 ≤ z ≤ 10 selected from different JWST spectroscopic surveys. We aim to determine the redshift evolution of ξion and the relation of ξion with the physical properties of the galaxies.

Methods. We used the available HST and JWST photometry to perform a spectral energy distribution (SED) fitting in the sample to determine their physical properties and relate them with ξion. We used the BAGPIPES code for the SED fitting and assumed a delayed exponential model for the star formation history. We used the NIRSpec spectra from prism or grating configurations to estimate Balmer luminosities, and then constrained ξion values after dust correction.

Results. We find a mean value of 1025.22 Hz erg−1 for ξion in the sample with an observed scatter of 0.42 dex. We find an increase in the median values of ξion with redshift from 1025.09 Hz erg−1 at z ∼ 4.18 to 1025.28 Hz erg−1 at z ∼ 7.14, confirming the redshift evolution of ξion found in other studies. Regarding the relation between ξion and physical properties, we find a decrease in ξion with increasing stellar mass, indicating that low-mass galaxies are efficient producers of ionizing photons. We also find an increase in ξion with increasing specific star formation rate (sSFR) and increasing UV absolute magnitude. This indicates that faint galaxies and galaxies with high sSFR are also efficient producers. We also investigated the relation of ξion with the rest-frame equivalent width (EW) of [OIII]λ5007 and find that galaxies with the higher EW([OIII]λ5007) are more efficient producers of ionizing photons, with the best fit leading to the relation log(ξion)  =  0.43 × log(EW[OIII])+23.99. Similarly, we find that galaxies with higher O32 = [OIII]λ5007/[OII]λλ3727,3729 and lower gas-phase metallicities (based on the R23 = ([OIII]λλ4959,5007+[OII]λλ3727,3729)/Hβ calibration) show higher ξion values.},
  author       = {Llerena, M. and Pentericci, L. and Napolitano, L. and Mascia, Sara and Amorín, R. and Calabrò, A. and Castellano, M. and Cleri, N. J. and Giavalisco, M. and Grogin, N. A. and Hathi, N. P. and Hirschmann, M. and Koekemoer, A. M. and Nanayakkara, T. and Pacucci, F. and Shen, L. and Wilkins, S. M. and Yoon, I. and Yung, L. Y.A. and Bhatawdekar, R. and Lucas, R. A. and Wang, X. and Arrabal Haro, P. and Bagley, M. B. and Finkelstein, S. L. and Kartaltepe, J. S. and Merlin, E. and Papovich, C. and Pirzkal, N. and Santini, P.},
  issn         = {1432-0746},
  journal      = {Astronomy & Astrophysics},
  publisher    = {EDP Sciences},
  title        = {{The ionizing photon production efficiency of star-forming galaxies at z ∼ 4–10}},
  doi          = {10.1051/0004-6361/202453251},
  volume       = {698},
  year         = {2025},
}

@inproceedings{19968,
  abstract     = {In the dynamic arena of innovation, the relations between academia and industry are a keystone for breakthroughs and practical applications. Yet, the groundwork of these pivotal University-Industry (U-I) partnerships remains covered in complexity. This paper delves into these intricate relations, unraveling the factors that help successful collaborations. Grounded in the Resource-Based Theory, our study transcends traditional analytical boundaries, leveraging a neural network model to understand a comprehensive dataset from the UK’s Higher Education Statistics Agency, SCIMAGO Rankings, and Clarivate Publications. This novel approach helps to make clear the interplay of academic load, administrative support, scientific output, and university rank in sculpting U-I collaboration dynamics. Our findings suggest that reduced academic load and robust administrative support significantly bolster U-I collaborations. However, the influence of scientific output and university ranking is more nuanced, challenging the common belief. High scientific output, while indicative of expertise, doesn't always align with industry goals. Similarly, while higher-ranked universities could attract more collaborations, the benefits are not universal. This paper not only contributes to a deeper understanding of U-I collaborations, but also provides actionable insights for university administrators, policymakers, and industry leaders. In a world where innovation is key, understanding these collaborative dynamics is crucial for fostering partnerships that push the boundaries of research and practical application.},
  author       = {Plata, Carlos and Casallas Garcia, Alejandro},
  booktitle    = {85th Annual Meeting of the Academy of Management},
  issn         = {2151-6561},
  location     = {Copenhagen, Denmark},
  number       = {1},
  publisher    = {Academy of Management},
  title        = {{Machine learning analysis of the factors influencing university-industry collaborations}},
  doi          = {10.5465/AMPROC.2025.54bp},
  volume       = {2025},
  year         = {2025},
}

@article{19969,
  abstract     = {In the stochastic population protocol model, we are given a connected graph with n nodes, and in every time step, a scheduler samples an edge of the graph uniformly at random and the nodes connected by this edge interact. A fundamental task in this model is stable leader election, in which all nodes start in an identical state and the aim is to reach a configuration in which (1)
exactly one node is elected as leader and (2) this node remains as the unique leader no matter what sequence of interactions follows. On cliques, the complexity of this problem has recently been settled: time-optimal protocols stabilize in (n log n) expected steps using (log log n) states, whereas protocols that use O(1) states require (n2) expected steps. In this work, we investigate the complexity of stable leader election on graphs. We provide the first non-trivial time lower bounds on general graphs, showing that, when moving beyond cliques, the complexity of stable leader election can range from O(1) to (n3) expected steps. We describe a protocol that is time-optimal on many graph families, but uses polynomially-many states. In contrast, we give a near-time-optimal protocol that uses only O(log2 n) states that is at most a factor O(log n) slower. Finally, we observe that for many graphs the constant-state protocol of Beauquier et al. [OPODIS 2013] is at most a factor O(n log n) slower than the fast polynomial-state protocol, and among constant-state protocols, this protocol has near-optimal average case complexity on dense random graphs.},
  author       = {Alistarh, Dan-Adrian and Rybicki, Joel and Voitovych, Sasha},
  issn         = {1432-0452},
  journal      = {Distributed Computing},
  pages        = {207--245},
  publisher    = {Springer Nature},
  title        = {{Near-optimal leader election in population protocols on graphs}},
  doi          = {10.1007/s00446-025-00487-7},
  volume       = {38},
  year         = {2025},
}

@inproceedings{19982,
  abstract     = {Dynamically maintaining the minimum cut in a graph G under edge insertions and deletion is a fundamental problem in dynamic graph algorithms for which no conditional lower bound on the time per operation exists. In an n-node graph the best known (1 + o (1))-approximate algorithm takes  update time [14]. If the minimum cut is guaranteed to be (log n )o (1), a deterministic exact algorithm with n o (1) update time exists [8].
We present the first fully dynamic algorithm for (1 + o (1))-approximate minimum cut with n o(1) update time. Our main technical contribution is to show that it suffices to consider small-volume cuts in suitably contracted graphs.},
  author       = {El-Hayek, Antoine and Henzinger, Monika H and Li, Jason},
  booktitle    = {Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms},
  location     = {New Orleans, LA, United States},
  pages        = {750--784},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Fully dynamic approximate minimum cut in subpolynomial time per operation}},
  doi          = {10.1137/1.9781611978322.22},
  year         = {2025},
}

