Tootfinder

New scientific analysis determines there are four distinct species of giraffe #science

There are actually four giraffe species in Africa, scientists say
Giraffes are now classified into four distinct species in Africa. Researchers previously thought all giraffes belonged to a single species. On Thursday, a task force of the International Union for Conservation of Nature identified Northern, reticulated, Masai, and Southern giraffes as separate species. This change is based on genetic studies and anatomical differences. Each species faces unique threats and conservation needs. Northern giraffes are the most endangered, with only about 7,000 left…

Symplectic Eichler criterion
Shouhei Ma
https://arxiv.org/abs/2508.12624 https://arxiv.org/pdf/2508.12624

Symplectic Eichler criterion
We prove an Eichler-type criterion for symplectic lattices which determines in a simple way when two primitive vectors are equivalent under a canonical congruence subgroup of the symplectic group. This is supplemented by another, related criterion which determines when a given primitive vector is splitting. Both criteria use the discriminant groups.

The Chapman-Enskog approximation for a relativistic charged gas in the trace-fixed particle frame
Carlos Gabarrete, Ana Laura Garc\'ia-Perciante, Olivier Sarbach
https://arxiv.org/abs/2508.14251

The Chapman-Enskog approximation for a relativistic charged gas in the trace-fixed particle frame
In this article we provide a thorough discussion of the first-order Chapman-Enskog approximation for a relativistic simple charged gas propagating in an arbitrary fixed background spacetime and electromagnetic field. Motivated by a rigorous study of the linearized collision operator, we argue that the most natural thermodynamic frame to describe dissipative relativistic fluids is the trace-fixed particle frame. This frame determines the state variables by requiring compatibility of the first fe…

Bayesian Optimization-based Search for Agent Control in Automated Game Testing
Carlos Celemin
https://arxiv.org/abs/2508.13121 https://arxiv.org/pdf/2508.1…

Bayesian Optimization-based Search for Agent Control in Automated Game Testing
This work introduces an automated testing approach that employs agents controlling game characters to detect potential bugs within a game level. Harnessing the power of Bayesian Optimization (BO) to execute sample-efficient search, the method determines the next sampling point by analyzing the data collected so far and calculates the data point that will maximize information acquisition. To support the BO process, we introduce a game testing-specific model built on top of a grid map, that featu…

Maize Seedling Detection Dataset (MSDD): A Curated High-Resolution RGB Dataset for Seedling Maize Detection and Benchmarking with YOLOv9, YOLO11, YOLOv12 and Faster-RCNN
Dewi Endah Kharismawati, Toni Kazic
https://arxiv.org/abs/2509.15181

Maize Seedling Detection Dataset (MSDD): A Curated High-Resolution RGB Dataset for Seedling Maize Detection and Benchmarking with YOLOv9, YOLO11, YOLOv12 and Faster-RCNN
Accurate maize seedling detection is crucial for precision agriculture, yet curated datasets remain scarce. We introduce MSDD, a high-quality aerial image dataset for maize seedling stand counting, with applications in early-season crop monitoring, yield prediction, and in-field management. Stand counting determines how many plants germinated, guiding timely decisions such as replanting or adjusting inputs. Traditional methods are labor-intensive and error-prone, while computer vision enables e…

On branching points in the Gilbert-Steiner problem
Danila Cherkashin
https://arxiv.org/abs/2507.13532 https://arxiv.org/pdf/2507.1353…

On branching points in the Gilbert-Steiner problem
The Gilbert--Steiner problem is a generalization of the Steiner tree problem and specific optimal mass transportation, which allows the use additional (branching) point in a transport plan. A specific feature of the problem is that the cost of transporting a mass $m$ along a segment of length $l$ is equal to $l \times m^p$ for a fixed $0 < p < 1$ and segments may end at points not belonging to the supports of given measures (branching points). Main result of this paper determines all pairs of…

Reconstructing Finite Ordered Sets from Higher Exponentials
George Gr\"atzer
https://arxiv.org/abs/2509.12659 https://arxiv.org/pdf/2509.12659

Reconstructing Finite Ordered Sets from Higher Exponentials
For the finite ordered sets $A, D$, write $A^D$ for the ordered set of isotone maps $D \to A$ with the pointwise order. It was proved in earlier work that the order structure of $A^A$ determines~$A$ up to isomorphism. In this note we extend the result to higher function ordered sets such as $A^{(A^A)}$ and $(A^A)^A$. Our main theorem shows that the structure of $A^D$ determines~$A$.

Simple linesearch-free first-order methods for nonconvex optimization
Shotaro Yagishita, Masaru Ito
https://arxiv.org/abs/2509.14670 https://arxiv.org/pdf/…

Simple linesearch-free first-order methods for nonconvex optimization
This paper presents an auto-conditioned proximal gradient method for nonconvex optimization. The method determines the stepsize using an estimation of local curvature and does not require any prior knowledge of problem parameters and any linesearch procedures. Its convergence analysis is carried out in a simple manner without assuming the convexity, unlike previous studies. We also provide convergence analysis in the presence of the Kurdyka--Łojasiewicz property, adaptivity to the weak smoothn…

On the construction of Hadamard states from Feynman propagators
Christopher J. Fewster, Alexander Strohmaier
https://arxiv.org/abs/2510.11492 https://arxiv…

On the construction of Hadamard states from Feynman propagators
The Wightman two-point function of any Hadamard state of a linear quantum field theory determines a corresponding Feynman propagator. Conversely, however, a Feynman propagator determines a state only if certain positivity conditions are fulfilled. We point out that the construction of a state from a Feynman propagator involves a slightly subtle point that we address and resolve. Starting from a recent generalisation of the Duistermaat-Hörmander theory of distinguished parametrices to normally …

The energy dependence of exclusive heavy vector meson photoproduction cross-sections and NLO BFKL evolution
Martin Hentschinski, Ricardo Rangel Ram\'irez
https://arxiv.org/abs/2508.11545

The energy dependence of exclusive heavy vector meson photoproduction cross-sections and NLO BFKL evolution
We study the energy dependence of the cross-section for exclusive photoproduction of vector mesons $J/ψ$ and $Υ$, using a solution to the next-to-leading order (NLO) Balitsky-Fadin-Kuraev-Lipatov (BFKL) equation. Our goal is to use BFKL evolution as a benchmark to provide evidence for the presence of non-linear QCD dynamics and signs for the onset of gluon saturation at highest center of mass energies. Our approach determines initial conditions for the proton from the Bartels-Golec Biernat-Ko…

The contribution of electron and hole conductivity to the transport loss in organic solar cells
Chen Wang, Toni Seiler, Doyoung Sun, Safa Shoaee, Maria Saladina, Carsten Deibel
https://arxiv.org/abs/2508.11399

The contribution of electron and hole conductivity to the transport loss in organic solar cells
The effective conductivity determines the reciprocal of the transport resistance, the dominant loss of fill factor in organic solar cells. We experimentally determine the dependence of effective conductivity on its electron and hole contributions. Using PM6:Y12 blends with tunable morphological and energetic disorder, we show that the effective conductivity follows a harmonic mean of electron and hole conductivities even across nearly three orders of magnitude in conductivity imbalance. We also…

Conditioning halos on the tidal environment for fast and accurate HI power spectra during reionization
Gaurav Pundir, Aseem Paranjape, Tirthankar Roy Choudhury
https://arxiv.org/abs/2509.13690

Conditioning halos on the tidal environment for fast and accurate HI power spectra during reionization
Predicting the statistical properties of the neutral hydrogen (HI) density field during reionization is an important step in using upcoming 21 cm observations to constrain models of reionization. Semi-numerical models of reionization are often coupled with the collapse fraction field $f_{\text{coll}}(\mathbf{x})$, which determines the fraction of dark matter within halos. In this work, we improve upon earlier prescriptions that compute $f_{\text{coll}}$ based on the dark matter overdensity $δ(…

Spectral Deformation Flow and Global Classification of Simply-Connected Closed Manifolds
Anton Alexa
https://arxiv.org/abs/2508.11652 https://arxiv.org/pdf…

Spectral Deformation Flow and Global Classification of Simply-Connected Closed Manifolds
We study the evolution of a spectral deformation flow for amplitudes $C_n(τ)$, governed by a second-order self-adjoint operator $\hat{C}$ on a compact domain. This flow leads to exponential stabilization $C_n(τ) \to π$, encoded in the spectral multi-function $C(v,τ,n)$, which describes the geometric deformation across scales. Building on prior results on spectral rigidity, completeness, and asymptotics of $\hat{C}$, we analyze conditions under which this convergence determines the full topo…

The ROI of #UX is the value of your entire company, because user research is the work that determines what problem is most valuable to solve in the first place.
Trouble is, people won't believe you if you tell them this.
So the second job on top of that job is to convince people to trust us.

The ROI of UX is so massive that no one will believe you
User research makes the most difference when findings challenge closely-held assumptions. But the truth is often unpopular.

Low-dimensional Heisenberg magnets: Riemann zeta function regularization
V. Yu. Irkhin
https://arxiv.org/abs/2509.13977 https://arxiv.org/pdf/2509.13977

Low-dimensional Heisenberg magnets: Riemann zeta function regularization
The Riemann zeta function regularization is employed to extract finite temperature corrections to effective magnetic moment $S^*$ of one- and two-dimensional Heisenberg ferro- and antiferromagnets. Whereas for the one-dimensional ferromagnet we obtain the usual $T^{1/2}$ spin-wave dependence, for the antiferromagnetic chain the dependence is described by a generalized incomplete Riemann function. The quantity $S^*$ determines strong short-range magnetic order in the absence of long-range order,…

Realistic modelling of transport properties at finite tempeature in magnetic materials by local quantization of a Heisenberg model
Fabian Engelke, Christian Heiliger
https://arxiv.org/abs/2508.11405

Realistic modelling of transport properties at finite tempeature in magnetic materials by local quantization of a Heisenberg model
The quantitative description of the electrical resistivity of a magnetic material remains challenging to this day. Qualitatively, it is well understood that the temperature-induced lattice and spin disorder determines the temperature dependence of the resistivity. While prior publications reached good agreement with experiment in the so-called supercell or direct approach for non-magnetic materials where the spin-disorder contribution to the resistivity is negligible, an accurate, purely theore…

No oscillating subradiant correlations in a strongly driven quantum emitter array
Jiaming Shi, Nikita Leppenen, Ran Tessler, Alexander N. Poddubny
https://arxiv.org/abs/2509.09993

No oscillating subradiant correlations in a strongly driven quantum emitter array
We theoretically study time-dependent correlations in a strongly driven array of $N$ two-level atoms, coupled to photons in a waveguide. We focus on the spectrum $\{λ\}$ of the Liouvillian superoperator, which determines the correlation decay rates $-\Re λ$ and the frequencies $\Imλ$. Our main finding is the suppression of subradiant oscillating correlations between atomic states by a strong coherent of amplitude $Ω$: $|\Re λ|\ge mγ/2$, where $γ$ is the single-atom spontaneous …

Homelessness is not a moral failure or an accident of fate, it is the direct result of capitalist property relations. Under a system where land, housing, and production are privately owned, the working class is alienated from its means of existence. People are cast into the streets not because scarcity is real, but because profit determines who deserves shelter.
The solution is not charity or state bureaucracy but the abolition of private property in housing and the collective organiza…

Long post, game design
Crungle is a game designed to be a simple test of general reasoning skills that's difficult to play by rote memory, since there are many possible rule sets, but it should be easy to play if one can understand and extrapolate from rules. The game is not necessarily fair, with the first player often having an advantage or a forced win. The game is entirely deterministic, although a variant determines the rule set randomly.
This is version 0.1, and has not yet been tested at all.
Crungle is a competitive game for two players, each of whom controls a single piece on a 3x3 grid. The cells of the grid are numbered from 1 to 9, starting at the top left and proceeding across each row and then down to the next row, so the top three cells are 1, 2, and 3 from left to right, then the next three are 4, 5, and 6 and the final row is cells 7, 8, and 9.
The two players decide who shall play as purple and who shall play as orange. Purple goes first, starting the rules phase by picking one goal rule from the table of goal rules. Next, orange picks a goal rule. These two goal rules determine the two winning conditions. Then each player, starting with orange, alternate picking a movement rule until four movement rules have been selected. During this process, at most one indirect movement rule may be selected. Finally, purple picks a starting location for orange (1-9), with 5 (the center) not allowed. Then orange picks the starting location for purple, which may not be adjacent to orange's starting position.
Alternatively, the goal rules, movement rules, and starting positions may be determined randomly, or a pre-determined ruleset may be selected.
If the ruleset makes it impossible to win, the players should agree to a draw. Either player could instead "bet" their opponent. If the opponent agrees to the bet, the opponent must demonstrate a series of moves by both players that would result in a win for either player. If they can do this, they win, but if they submit an invalid demonstration or cannot submit a demonstration, the player who "bet" wins.
Now that starting positions, movement rules, and goals have been decided, the play phase proceeds with each player taking a turn, starting with purple, until one player wins by satisfying one of the two goals, or until the players agree to a draw. Note that it's possible for both players to occupy the same space.
During each player's turn, that player identifies one of the four movement rules to use and names the square they move to using that rule, then they move their piece into that square and their turn ends. Neither player may use the same movement rule twice in a row (but it's okay to use the same rule your opponent just did unless another rule disallows that). If the movement rule a player picks moves their opponent's piece, they need to state where their opponent's piece ends up. Pieces that would move off the board instead stay in place; it's okay to select a rule that causes your piece to stay in place because of this rule. However, if a rule says "pick a square" or "move to a square" with some additional criteria, but there are no squares that meet those criteria, then that rule may not be used, and a player who picks that rule must pick a different one instead.
Any player who incorrectly states a destination for either their piece or their opponent's piece, picks an invalid square, or chooses an invalid rule has made a violation, as long as their opponent objects before selecting their next move. A player who makes at least three violations immediately forfeits and their opponent wins by default. However, if a player violates a rule but their opponent does not object before picking their next move, the stated destination(s) of the invalid move still stand, and the violation does not count. If a player objects to a valid move, their objection is ignored, and if they do this at least three times, they forfeit and their opponent wins by default.
Goal rules (each player picks one; either player can win using either chosen rule):
End your turn in the same space as your opponent three turns in a row.
End at least one turn in each of the 9 cells.
End five consecutive turns in the three cells in any single row, ending at least one turn on each of the three.
End five consecutive turns in the three cells in any single column, ending at least one turn on each of the three.
Within the span of 8 consecutive turns, end at least one turn in each of cells 1, 3, 7, and 9 (the four corners of the grid).
Within the span of 8 consecutive turns at least one turn in each of cells 2, 4, 6, and 8 (the central cells on each side).
Within the span of 8 consecutive turns, end at least one turn in the cell directly above your opponent, and end at least one turn in the cell directly below your opponent (in either order).
Within the span of 8 consecutive turns at least one turn in the cell directly to the left of your opponent, and end at least one turn in the cell directly to the right of your opponent (in either order).
End 12 turns in a row without ending any of them in cell 5.
End 8 turns in a row in 8 different cells.
Movement rules (each player picks two; either player may move using any of the four):
Move to any cell on the board that's diagonally adjacent to your current position.
Move to any cell on the board that's orthogonally adjacent to your current position.
Move up one cell. Also move your opponent up one cell.
Move down one cell. Also move your opponent down one cell.
Move left one cell. Also move your opponent left one cell.
Move right one cell. Also move your opponent right one cell.
Move up one cell. Move your opponent down one cell.
Move down one cell. Move your opponent up one cell.
Move left one cell. Move your opponent right one cell.
Move right one cell. Move your opponent left one cell.
Move any pieces that aren't in square 5 clockwise around the edge of the board 1 step (for example, from 1 to 2 or 3 to 6 or 9 to 8).
Move any pieces that aren't in square 5 counter-clockwise around the edge of the board 1 step (for example, from 1 to 4 or 6 to 3 or 7 to 8).
Move to any square reachable from your current position by a knight's move in chess (in other words, a square that's in an adjacent column and two rows up or down, or that's in an adjacent row and two columns left or right).
Stay in the same place.
Swap places with your opponent's piece.
Move back to the position that you started at on your previous turn.
If you are on an odd-numbered square, move to any other odd-numbered square. Otherwise, move to any even-numbered square.
Move to any square in the same column as your current position.
Move to any square in the same row as your current position.
Move to any square in the same column as your opponent's position.
Move to any square in the same row as your opponent's position.
Pick a square that's neither in the same row as your piece nor in the same row as your opponent's piece. Move to that square.
Pick a square that's neither in the same column as your piece nor in the same column as your opponent's piece. Move to that square.
Move to one of the squares orthogonally adjacent to your opponent's piece.
Move to one of the squares diagonally adjacent to your opponent's piece.
Move to the square opposite your current position across the middle square, or stay in place if you're in the middle square.
Pick any square that's closer to your opponent's piece than the square you're in now, measured using straight-line distance between square centers (this includes the square your opponent is in). Move to that square.
Pick any square that's further from your opponent's piece than the square you're in now, measured using straight-line distance between square centers. Move to that square.
If you are on a corner square (1, 3, 7, or 9) move to any other corner square. Otherwise, move to square 5.
If you are on an edge square (2, 4, 6, or 8) move to any other edge square. Otherwise, move to square 5.
Indirect movement rules (may be chosen instead of a direct movement rule; at most one per game):
Move using one of the other three movement rules selected in your game, and in addition, your opponent may not use that rule on their next turn (nor may they select it via an indirect rule like this one).
Select two of the other three movement rules, declare them, and then move as if you had used one and then the other, applying any additional effects of both rules in order.
Move using one of the other three movement rules selected in your game, but if the move would cause your piece to move off the board, instead of staying in place move to square 5 (in the middle).
Pick one of the other three movement rules selected in your game and apply it, but move your opponent's piece instead of your own piece. If that movement rule says to move "your opponent's piece," instead apply that movement to your own piece. References to "your position" and "your opponent's position" are swapped when applying the chosen rule, as are references to "your turn" and "your opponent's turn" and do on.
#Game #GameDesign

The Freed--Quinn line bundle from higher geometry
Daniel Berwick-Evans, Emily Cliff, Laura Murray
https://arxiv.org/abs/2510.10773 https://arxiv.org/pdf/25…

The Freed--Quinn line bundle from higher geometry
For a finite group $G$, and level $α\in Z^3(BG;{\rm U}(1))$, Freed and Quinn construct a line bundle over the moduli space of $G$-bundles on surfaces. Global sections determine the values of Chern--Simons theory at level $α$ on surfaces. In this paper, we provide an alternate construction using tools from higher geometry: the pair $(G,α)$ determines a 2-group group, and the Freed--Quinn line arises as a categorical truncation of the bicategory of 2-group bundles.

Runtime Verification for LTL in Stochastic Systems
Javier Esparza, Vincent Fischer
https://arxiv.org/abs/2508.07963 https://arxiv.org/pdf/2508.07963…

Runtime Verification for LTL in Stochastic Systems
Runtime verification encompasses several lightweight techniques for checking whether a system's current execution satisfies a given specification. We focus on runtime verification for Linear Temporal Logic (LTL). Previous work describes monitors which produce, at every time step one of three outputs - true, false, or inconclusive - depending on whether the observed execution prefix definitively determines satisfaction of the formula. However, for many LTL formulas, such as liveness properties, …

Bulk viscous cosmological models with cosmological constant: Observational constraints
R. Noem\'i Villalobos, Yerko V\'asquez, Norman Cruz, Carlos H. L\'opez-Caraballo
https://arxiv.org/abs/2508.11614

Bulk viscous cosmological models with cosmological constant: Observational constraints
We investigate whether viscous cold dark matter (vCDM) in a $Λ$-dominated FLRW universe can alleviate the Hubble tension while satisfying thermodynamic constraints, examining both flat and curved geometries. We model vCDM with bulk viscosity $ζ= ζ_0\,(Ω_{vc}/Ω_{vc0})^m$, where $m$ determines the viscosity evolution and $Ω_{vc}$ is the density parameter of vCDM. We explore two particular scenarios: constant viscosity ($m=0$), and variable viscosity ($m$ free). Using Bayesian inference, we …

Distinct Directions and Distinct Distances in $\mathbb{R}^d$
Noga Alon, Rom Pinchasi
https://arxiv.org/abs/2508.08870 https://arxiv.org/pdf/2508.08870

Distinct Directions and Distinct Distances in $\mathbb{R}^d$
We show that there exists an absolute positive constant $b (\geq \frac{1}{48})$ so that any set of $n$ points in $\mathbb{R}^d$ that is $d$-dimensional determines at least $bdn$ lines with pairwise distinct directions. As a consequence we prove that there are $d$-dimensional real norms $\|\cdot\|$ so that every set of $n>n_0(d)$ points that is $d$-dimensional determines at least $(bd-o(1))n$ distinct distances with respect to $\|\cdot \|$.

Uncovering the Fourier Structure of Wavefunctions in Semiconductors
Yunfan Liang, Damien West, Shengbai Zhang
https://arxiv.org/abs/2508.11225 https://arxi…

Uncovering the Fourier Structure of Wavefunctions in Semiconductors
Symmetry dictates the physical properties of materials. The symmetry of the Bravais lattice defines the set of points, lines, and planes over which sets of planewaves are degenerate, upon which atomic symmetry determines the interaction potentials which may lift such degeneracies. This results in wavefunctions which are single planewaves throughout the BZ, except in the vicinity of the removed degeneracies. As optical transitions between any two planewaves are forbidden, only regions of the Bri…

Performance Index Shaping for Closed-loop Optimal Control
Ayush Rai, Shaoshuai Mou, Brian D. O. Anderson
https://arxiv.org/abs/2510.10202 https://arxiv.org…

Performance Index Shaping for Closed-loop Optimal Control
The design of the performance index, also referred to as cost or reward shaping, is central to both optimal control and reinforcement learning, as it directly determines the behaviors, trade-offs, and objectives that the resulting control laws seek to achieve. A commonly used approach for this inference task in recent years is differentiable trajectory optimization, which allows gradients to be computed with respect to cost parameters by differentiating through an optimal control solver. Howeve…

Efficient and Accurate Downfacing Visual Inertial Odometry
Jonas K\"uhne, Christian Vogt, Michele Magno, Luca Benini
https://arxiv.org/abs/2509.10021 https://

Efficient and Accurate Downfacing Visual Inertial Odometry
Visual Inertial Odometry (VIO) is a widely used computer vision method that determines an agent's movement through a camera and an IMU sensor. This paper presents an efficient and accurate VIO pipeline optimized for applications on micro- and nano-UAVs. The proposed design incorporates state-of-the-art feature detection and tracking methods (SuperPoint, PX4FLOW, ORB), all optimized and quantized for emerging RISC-V-based ultra-low-power parallel systems on chips (SoCs). Furthermore, by employin…

Persistence probabilities for fractionally integrated fractional Brownian noise
G. Molchan
https://arxiv.org/abs/2509.10265 https://arxiv.org/pdf/2509.1026…

Persistence probabilities for fractionally integrated fractional Brownian noise
The main object the study is fractionally integrated fractional Brownian noise, I(t/a,H) where a>0 is the multiplicity(not necessarily an integer) of integration, and H is the Hurst parameter . The subject of the analysis is the persistence exponent e(a,H) that determines the power-law asymptotic of probability that the process will not exceed a fixit positive level in a growing time interval (0,T). In the important cases (a=1,H) and (a=2,H=1/2) these exponents are well known. To understand the…

Incremental Summarization for Customer Support via Progressive Note-Taking and Agent Feedback
Yisha Wu (Mia), Cen (Mia), Zhao, Yuanpei Cao, Xiaoqing Su, Yashar Mehdad, Mindy Ji, Claire Na Cheng
https://arxiv.org/abs/2510.06677

Incremental Summarization for Customer Support via Progressive Note-Taking and Agent Feedback
We introduce an incremental summarization system for customer support agents that intelligently determines when to generate concise bullet notes during conversations, reducing agents' context-switching effort and redundant review. Our approach combines a fine-tuned Mixtral-8x7B model for continuous note generation with a DeBERTa-based classifier to filter trivial content. Agent edits refine the online notes generation and regularly inform offline model retraining, closing the agent edits feedba…

An inverse problem for the Monge-Amp\`ere equation
Tony Liimatainen, Yi-Hsuan Lin
https://arxiv.org/abs/2510.11572 https://arxiv.org/pdf/2510.11572

An inverse problem for the Monge-Ampère equation
We extend the study of inverse boundary value problems to the setting of fully nonlinear PDEs by considering an inverse source problem for the Monge-Ampère equation \[ \det D^2 u = F. \] We prove that, on a convex Euclidean domain in the plane, the associated Dirichlet-to-Neumann (DN) map uniquely determines a positive source function $F$. The proof relies on recovering the Hessian of a solution to the equation, which is interpreted as a Riemannian metric $g$. Interestingly, although t…

Im using case_when() quite a lot, case_match() is new to me: #rstats

A general vectorised switch() — case_match
This function allows you to vectorise multiple switch() statements. Each case is evaluated sequentially and the first match for each element determines the corresponding value in the output vector. If no cases match, the .default is used. case_match() is an R equivalent of the SQL "simple" CASE WHEN statement. Connection to case_when() While case_when() uses logical expressions on the left-hand side of the formula, case_match() uses values to match against .x with. The following two statement…

Which Rope Breaks? A Study of Tension Distribution in Multi-Rope Systems
Amir Eskandari-asl, Roberto De Luca
https://arxiv.org/abs/2509.09973 https://arxiv…

Which Rope Breaks? A Study of Tension Distribution in Multi-Rope Systems
We investigate the tension distribution in systems of mass-less ropes under different loading conditions. For a two-rope system, we demonstrate how the breaking scenario depends on the applied force dynamics: rapid pulling causes the lower rope to break, while gradual pulling leads to upper rope failure. Extending to a three-rope Y-shaped configuration, we identify a critical angle theta_C=60° that determines which rope breaks first. When the angle between the upper ropes exceeds this critical…

Bidifferentials, Lagrangian projections and the Virasoro extension
Eduard Looijenga
https://arxiv.org/abs/2510.08208 https://arxiv.org/pdf/2510.08208

Bidifferentials, Lagrangian projections and the Virasoro extension
Let $C$ be a smooth projective curve over an algebraically closed field $k$ of characteristic zero. We prove that a Lagrangian supplement of $H^0(C, Ω_C)$ in the de Rham cohomology group $H^1_{dR}(C)$ determines and is determined by a particular type of symmetric bidifferential on $C^2$ (its polar divisor must be twice the diagonal and have biresidue one along it). When $k$ is the complex field, a natural choice of such supplement is $H^{0,1}(C)$ and we show that this corresponds with the bidi…

Mangrove: Fast and Parallelizable State Replication for Blockchains
Anton Paramonov, Yann Vonlanthen, Quentin Kniep, Jakub Sliwinski, Roger Wattenhofer
https://arxiv.org/abs/2509.06616

Mangrove: Fast and Parallelizable State Replication for Blockchains
Mangrove is a novel scaling approach to building blockchains with parallel smart contract support. Unlike in monolithic blockchains, where a single consensus mechanism determines a strict total order over all transactions, Mangrove uses separate consensus instances per smart contract, without a global order. To allow multiple instances to run in parallel while ensuring that no conflicting transactions are committed, we propose a mechanism called Parallel Optimistic Agreement. Additionally, for …

An Attack on the Medical Establishment Buried in an 1,800-Page Regulation
If approved, a new rule could end the entrenched pay advantages for specialists like surgeons over other doctors.
An A.M.A. committee determines the difficulty and time demands of each type of medical visit, test and procedure -- and then recommends to Medicare how much doctors should be paid for performing them.
For decades, critics have complained that this process unfairly rewards surgeons and othe…

An Attack on the Medical Establishment Buried in an 1,800-Page Regulation
If approved, a new rule could end the entrenched pay advantages for specialists like surgeons over other doctors.

Grouped k-threshold random grid-based visual cryptography scheme
Xiaoli Zhuo, Xuehu Yan, Wei Yan
https://arxiv.org/abs/2508.05394 https://arxiv.org/pdf/250…

Grouped k-threshold random grid-based visual cryptography scheme
Visual cryptography schemes (VCSs) belong to a category of secret image sharing schemes that do not require cryptographic knowledge for decryption, instead relying directly on the human visual system. Among VCSs, random grid-based VCS (RGVCS) has garnered widespread attention as it avoids pixel expansion while requiring no basic matrices design. Contrast, a core metric for RGVCS, directly determines the visual quality of recovered images, rendering its optimization a critical research objective…

Tesla meets Helstrom: a Wireless-Powered Quantum Optical System
Ioannis Krikidis
https://arxiv.org/abs/2509.07421 https://arxiv.org/pdf/2509.07421

Tesla meets Helstrom: a Wireless-Powered Quantum Optical System
This letter investigates a novel wireless-powered quantum optical communication system, in which a batteryless quantum transmitter harvests energy from a classical radio-frequency source to transmit quantum coherent states. The transmission employs M-ary phase shift keying (M-PSK) modulation over an optical channel impaired by thermal noise, and the fundamental detection performance is evaluated using the Helstrom bound. An optimization framework is proposed that jointly determines the optimal …

Bridging Farm Economics and Landscape Ecology for Global Sustainability through Hierarchical and Bayesian Optimization
Kevin Bradley Dsouza, Graham Alexander Watt, Yuri Leonenko, Juan Moreno-Cruz
https://arxiv.org/abs/2508.06386

Bridging Farm Economics and Landscape Ecology for Global Sustainability through Hierarchical and Bayesian Optimization
Agricultural landscapes face the dual challenge of sustaining food production while reversing biodiversity loss. Agri-environmental policies often fall short of delivering ecological functions such as landscape connectivity, in part due to a persistent disconnect between farm-level economic decisions and landscape-scale spatial planning. We introduce a novel hierarchical optimization framework that bridges this gap. First, an Ecological Intensification (EI) model determines the economically opt…

Four trials is not enough: The amount of prior audio–visual exposure determines the strength of audio–tactile crossmodal correspondence early in development https://www.mdpi.com/2076-328X/15/9/1184

Global warming is altering storms lightning, impacting tropical forests https://news.mongabay.com/2025/07/global-warming-is-altering-storms-lightning-impacting-tropical-forests/

Global warming is altering storms lightning, impacting tropical forests
A climate change-induced surge in brief but intense thunderstorms poses a growing but underrecognized threat to trees in tropical forests, a finding that could have major implications for carbon storage and tropical biodiversity under future global warming scenarios. That’s according to a recently published paper, which determines that short-lived but powerful convective storms — combining […]

Maximizing GPU Efficiency via Optimal Adapter Caching: An Analytical Approach for Multi-Tenant LLM Serving
Ferran Agullo, Joan Oliveras, Chen Wang, Alberto Gutierrez-Torre, Olivier Tardieu, Alaa Youssef, Jordi Torres, Josep Ll. Berral
https://arxiv.org/abs/2508.08343

Maximizing GPU Efficiency via Optimal Adapter Caching: An Analytical Approach for Multi-Tenant LLM Serving
Serving LLM adapters has gained significant attention as an effective approach to adapt general-purpose language models to diverse, task-specific use cases. However, serving a wide range of adapters introduces several and substantial overheads, leading to performance degradation and challenges in optimal placement. To address these challenges, we present an analytical, AI-driven pipeline that accurately determines the optimal allocation of adapters in single-node setups. This allocation maximiz…

What determines the $\gamma$-ray luminosities of classical novae?
Peter Craig, Elias Aydi, Laura Chomiuk, Ashley Stone, Jay Strader, Atticus Chong, Kwan-Lok Li, Jhih-Ling Fan, Arash Bahramian, David A. H. Buckley, Luca Izzo, Adam Kawash, Brian D. Metzger, Koji Mukai, Justin D. Linford, Marina Orio, J. L. Sokoloski, Kirill V. Sokolovsky, Evangelia Tremou, Frederick M. Walter, Joan Guarro Fl\'o, Christophe Boussin, St\'ephane Charbonne, Olivier Garde, Konstantin Belyakov, Libert …

What determines the $γ$-ray luminosities of classical novae?
Classical novae in the Milky Way have now been well-established as high-energy GeV $γ$-ray sources. In novae with main-sequence companions, this emission is believed to result from shocks internal to the nova ejecta, as a later fast wind collides with an earlier slow outflow. To test this model and constrain the $γ$-ray production mechanism, we present a systematic study of a sample of recent Galactic novae, comparing their $γ$-ray properties ($γ$-ray luminosity and duration) with their out…

g-Factor Enhanced Upper Critical Field in Superconducting PdTe2 due to Quantum Confinement
Kota Yoshimura, Tzu-Chi Hsieh, Huiyang Ma, Dmitry V. Chichinadze, Shan Zou, Michael Stuckert, David Graf, Robert Nowell, Muhsin Abdul Karim, Daichi Kozawa, Ryo Kitaura, Xiaolong Liu, Xinyu Liu, Dafei Jin, Cyprian Lewandowski, Yi-Ting Hsu, Badih A. Assaf
https://

g-Factor Enhanced Upper Critical Field in Superconducting PdTe2 due to Quantum Confinement
The Pauli limiting field of superconductors determines the maximal possible value of magnetic field at which superconductivity remains possible. For weak-coupling superconductors, it is determined by an established relation that can be found by setting the condensation energy equal to the magnetization free energy. The latter is a function of the carrier g-factor. Here, we demonstrate in a van der Waals superconductor PdTe2, that quantum confinement can tune the effective g-factor causing the P…

Computational Concept of the Psyche
Anton Kolonin, Vladimir Kryukov
https://arxiv.org/abs/2509.07009 https://arxiv.org/pdf/2509.07009

Computational Concept of the Psyche
The article provides an overview of approaches to modeling the human psyche in the perspective of building an artificial one. Based on the review, a concept of cognitive architecture is proposed, where the psyche is considered as an operating system of a living or artificial subject, including a space of needs that determines its life meanings in connection with stimuli from the external world, and intelligence as a decision-making system for actions in relation to this world in order to satisf…

Spectra of random graphs with discrete scale invariance
Alessio Catanzaro, Rajat Subhra Hazra, Diego Garlaschelli
https://arxiv.org/abs/2509.12407 https://…

Spectra of random graphs with discrete scale invariance
Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific probability that, in the annealed case, depends on a necessarily infinite-mean node fitness. The diverging mean determines many properties that are uncommon in models with independent edges, but at the same time widespread in real-world networks. Here we focus on …

Largevars: An R Package for Testing Large VARs for the Presence of Cointegration
Anna Bykhovskaya, Vadim Gorin, Eszter Kiss
https://arxiv.org/abs/2509.06295 https://

Largevars: An R Package for Testing Large VARs for the Presence of Cointegration
Cointegration is a property of multivariate time series that determines whether its non-stationary, growing components have a stationary linear combination. Largevars R package conducts a cointegration test for high-dimensional vector autoregressions of order k based on the large N, T asymptotics of Bykhovskaya and Gorin (2022, 2025). The implemented test is a modification of the Johansen likelihood ratio test. In the absence of cointegration the test converges to the partial sum of the Airy_1 …

Waiting for Trade in Markets with Aggregate Uncertainty
Justus Preusser
https://arxiv.org/abs/2508.06132 https://arxiv.org/pdf/2508.06132

Waiting for Trade in Markets with Aggregate Uncertainty
This paper studies a market in which a patient long-lived seller offers prices to short-lived buyers. A hidden state determines whether the buyer's common value exceeds the seller's reservation value, and all players only have noisy signals. If the seller has commitment power, the seller waits for a buyer with the most favorable signal to arrive, and else exits the market. Using techniques for monotone decision problems, this waiting strategy is shown to be optimal for learning whether trade is…

Euler characteristic of a mixed Koszul complex and the index of vector fields
Achim Hennings
https://arxiv.org/abs/2509.04681 https://arxiv.org/pdf/2509.04…

Euler characteristic of a mixed Koszul complex and the index of vector fields
A three-term complex of free modules over a local ring determines a mixed Koszul complex, whose Euler characteristic can be expressed by mixed multiplicities. As an application, we offer a simple formula for the index of a holomorphic vector field at an isolated complete intersection singularity.

Forensic Similarity for Speech Deepfakes
Viola Negroni, Davide Salvi, Daniele Ugo Leonzio, Paolo Bestagini, Stefano Tubaro
https://arxiv.org/abs/2510.02864 https://

Forensic Similarity for Speech Deepfakes
In this paper, we introduce a digital audio forensics approach called Forensic Similarity for Speech Deepfakes, which determines whether two audio segments contain the same forensic traces or not. Our work is inspired by prior work in the image domain on forensic similarity, which proved strong generalization capabilities against unknown forensic traces, without requiring prior knowledge of them at training time. To achieve this in the audio setting, we propose a two-part deep-learning system c…

Computability of dimension groups
Maria Sabitova
https://arxiv.org/abs/2509.04350 https://arxiv.org/pdf/2509.04350

Computability of dimension groups
We investigate the computability of the isomorphism set $\operatorname{Iso}(G_A,G_B)$ between $G_A$ and $G_B$, where $G_A$ is a subgroup of $\mathbb{Q}^n$ generated by columns of integer powers of a non-singular $n \times n$-matrix $A$ with integer entries. Assuming that the characteristic polynomial of $A$ is irreducible -- and under an additional condition when $n$ is not prime -- we prove that $\operatorname{Iso}(G_A,G_B)$ is computable; that is, there exists an algorithm that determines the…

Cosmic structure formation in massive conformal gravity
F. F. Faria, G. S. Silva
https://arxiv.org/abs/2508.09244 https://arxiv.org/pdf/2508.09244

Cosmic structure formation in massive conformal gravity
We study the evolution of matter density perturbations in the framework of massive conformal gravity (MCG). Starting from the conservation of the energy-momentum tensor, we find the continuity and Euler equations for the conformal perfect fluid that fills the MCG universe. We then obtain the perturbed MCG cosmological equations, from which we derive the equation that determines the growth of matter fluctuations in the MCG universe. The resulting growth equation shows that MCG enhances cosmic st…

Weak-Coppel problem for a class of Riccati differential equations
Armengol Gasull, Douglas D. Novaes, Joan Torregrosa
https://arxiv.org/abs/2509.04612 https://

Weak-Coppel problem for a class of Riccati differential equations
We study the $T$-periodic solutions of the real Riccati differential equation $x' = x^2 + γ(t),$ where $x=x(t)$ and $γ$ is a $T$-periodic function. Our goal is to define a real-valued discriminant $Δ_γ$ that determines whether the equation admits two, one, or no $T$-periodic solutions, in analogy with the classical discriminant of the quadratic algebraic equations. This problem is closely related to a question posed by Coppel concerning the characterization of bifurcation curves for planar …

Conservative Decisions with Risk Scores
Yishu Wei, Wen-Yee Lee, George Ekow Quaye, Xiaogang Su
https://arxiv.org/abs/2509.25588 https://arxiv.org/pdf/2509.…

Conservative Decisions with Risk Scores
In binary classification applications, conservative decision-making that allows for abstention can be advantageous. To this end, we introduce a novel approach that determines the optimal cutoff interval for risk scores, which can be directly available or derived from fitted models. Within this interval, the algorithm refrains from making decisions, while outside the interval, classification accuracy is maximized. Our approach is inspired by support vector machines (SVM), but differs in that it …

Pointed Racks and Their Applications to Braid Theory
Angel Apollos, Jose Ceniceros
https://arxiv.org/abs/2508.03013 https://arxiv.org/pdf/2508.03013…

Pointed Racks and Their Applications to Braid Theory
We define a new algebraic structure called a \emph{pointed rack} and use it to construct ambient isotopy invariants of $ n $-braids. We first introduce an integer-valued invariant of braids using pointed racks. This is then strengthened by defining a matrix-valued invariant using racks. Moreover, our invariant determines the rack coloring invariant previously defined for the closure of the braid. Finally, we include examples of braids that are distinguished by these new invariants.

Replaced article(s) found for astro-ph.SR. https://arxiv.org/list/astro-ph.SR/new
[1/1]:
- What determines the brightness of magnetically open solar corona?: Insights from three-dimensiona...
Haruhisa Iijima

Origin of Enhanced Thermal Resistance Near Nanoscale Hotspots: Insights from Full-Dispersion-Resolved Phonon Transport in Silicon
Jae Sik Jin
https://arxiv.org/abs/2510.12530 ht…

Origin of Enhanced Thermal Resistance Near Nanoscale Hotspots: Insights from Full-Dispersion-Resolved Phonon Transport in Silicon
Phonon transport near nanoscale hotspots (NHs) critically determines heat dissipation in advanced electronic devices. The prevailing understanding is that the enhanced thermal resistance (TR) observed in NHs originates from long mean free path (MFP) phonons, whose MFPs are much larger than the hotspot size, thereby limiting their ability to recognize hotspots and transport heat effectively. In this study, we revisit this problem by employing the Boltzmann transport equation (BTE) with a full ph…

Control Systems Analysis of a 3-Axis Photovoltatic Solar Tracker for Water Pumping
Justin London
https://arxiv.org/abs/2508.09420 https://arxiv.org/pdf/250…

Control Systems Analysis of a 3-Axis Photovoltatic Solar Tracker for Water Pumping
We propose 3-axis solar tracker water pumping system. The solar tracker can rotate and tilt using stepper/DC motors and can rise and lower on a tripod using a linear actuator. The charge generated from solar energy absorbed by photovoltaic (PV) cells in the solar panel is stored in a 12V battery that in turn powers two water diaphragm pumps using a solar charge controller. The PV uses four light photocell resistors/sensors to measure light intensity. A solar tracking algorithm determines the op…

A hybrid active galactic nucleus feedback model with spinning black holes, winds and jets
Filip Hu\v{s}ko, Cedric G. Lacey, Joop Schaye, Matthieu Schaller, Evgenii Chaikin, Sylvia Ploeckinger, Alejandro Ben\'itez Llambay, Alexander J. Richings, James W. Trayford
https://arxiv.org/abs/2509.05179…

A hybrid active galactic nucleus feedback model with spinning black holes, winds and jets
We present a hybrid active galactic nucleus (AGN) feedback model that features three accretion disc states (the thick, thin, and slim discs at low, moderate, and super-Eddington accretion rates, respectively), and two feedback modes: thermal isotropic and kinetic jets. The model includes black hole (BH) spin evolution due to gas accretion, BH mergers, jet spindown, and Lense-Thirring torques. The BH spin determines the jet directions and affects the feedback efficiencies. The model is implement…

Characters and the Generation of Sylow 3-Subgroups For Almost Simple Groups
Eden Ketchum
https://arxiv.org/abs/2509.02854 https://arxiv.org/pdf/2509.02854

Characters and the Generation of Sylow 3-Subgroups For Almost Simple Groups
Given an almost simple group $A$, we algorithmically show that the character table of $A$ determines whether or not the Sylow 3-subgroups of $A$ are 2-generated. We show this property is equivalent to a condition on involving Galois action on characters in the principal block. This would be a consequence of the Alperin-McKay-Navarro conjecture.

On Few-Distance Sets in the Plane
Lucas Wang
https://arxiv.org/abs/2510.09800 https://arxiv.org/pdf/2510.09800

On Few-Distance Sets in the Plane
Let $g(k)$ be the maximum size of a planar set that determines at most $k$ distances. We prove $$\fracπ{3\,C(Λ_{hex})}\ k\sqrt{\log k} (1+o(1)) \le g(k) \le C k\log k,$$ so $g(k) \asymp k\sqrt{\log k}$ with an explicit constant from the hexagonal lattice. For any arithmetic lattice $Λ$ we show $$g_Λ(k)\ge (π/4) S^*(Λ) k\sqrt{\log k} (1+o(1)).$$ We also give quantitative stability: unless $X$ is line-heavy or has two popular nonparallel shifts, either almost all ordered pairs lie below a h…

Performance enhancement in Josephson traveling wave parametric amplifiers by tailoring the relative distance between junctions
M. A. Gali Labarias, T. Yamada, Y. Nakashima, Y. Urade, J. Claramunt, K. Inomata
https://arxiv.org/abs/2509.07292

Performance enhancement in Josephson traveling wave parametric amplifiers by tailoring the relative distance between junctions
Josephson traveling wave parametric amplifiers with heterogeneously spaced junctions are theoretically investigated. We consider unit cells with three junctions and characterize their interaction by spatially displaced fields defined by node fluxes. To solve this problem we define the system action and apply the variational principle to obtain the static action, which determines the equations of motion. This work shows that gain and bandwidth can be increased by modifying the relative distance …

Optimisation of the vertex detector and measurement of Higgs decays to second-generation quarks at the CEPC
Jialin Li, Liang Hao, Kaili Zhang, Yifan Zhu, Jun Guo, Haijun Yang, Manqi Ruan
https://arxiv.org/abs/2508.04191

Optimisation of the vertex detector and measurement of Higgs decays to second-generation quarks at the CEPC
The vertex detector is crucial for precision measurements of the Higgs boson at the electron-positron Higgs factory. Benchmarked with $H \to c\bar{c}$ and $H \to s\bar{s}$ measurements in the $ν\barνH$ channel, we perform an optimisation study on the inner radius and spatial resolution of the vertex detector using the Jet Origin Identification (JOI) framework, which determines the parton flavor of jets using advanced Artificial Intelligence (AI) algorithm. We observe that, compared to the r…

Smart Contract-Enabled Procurement under Bounded Demand Variability: A Truncated Normal Approach
Jinho Cha, Youngchul Kim, Junyeol Ryu, Sangjun Park, Jeongho Kang, Hyeyoung Hwang
https://arxiv.org/abs/2510.07801

Smart Contract-Enabled Procurement under Bounded Demand Variability: A Truncated Normal Approach
This study develops a strategic procurement framework integrating blockchain-based smart contracts with bounded demand variability modeled through a truncated normal distribution. While existing research emphasizes the technical feasibility of smart contracts, the operational and economic implications of adoption under moderate uncertainty remain underexplored. We propose a multi-supplier model in which a centralized retailer jointly determines the optimal smart contract adoption intensity and …

LLM Serving Optimization with Variable Prefill and Decode Lengths
Meixuan Wang, Yinyu Ye, Zijie Zhou
https://arxiv.org/abs/2508.06133 https://arxiv.org/pdf…

LLM Serving Optimization with Variable Prefill and Decode Lengths
We study the problem of serving LLM (Large Language Model) requests where each request has heterogeneous prefill and decode lengths. In LLM serving, the prefill length corresponds to the input prompt length, which determines the initial memory usage in the KV cache. The decode length refers to the number of output tokens generated sequentially, with each additional token increasing the KV cache memory usage by one unit. Given a set of n requests, our goal is to schedule and process them to mini…

Cascade Crack in Chain of Beads
Meysam Bagheri, Thorsten P\"oschel
https://arxiv.org/abs/2508.01288 https://arxiv.org/pdf/2508.01288

Cascade Crack in Chain of Beads
We consider a homogeneous chain of spheres linked by liquid bridges under tension. The rupture of a single liquid bridge leads to a fragmentation cascade driven by the inverse relation between the capillary force and the sphere distances. The initial length of the liquid bridges determines the number and size of the fragments and the velocity of the fragmentation front.

Domain size asymptotics for Markov logic networks
Vera Koponen
https://arxiv.org/abs/2509.04192 https://arxiv.org/pdf/2509.04192

Domain size asymptotics for Markov logic networks
A Markov logic network (MLN) determines a probability distribution on the set of structures, or ``possible worlds'', with an arbitrary finite domain. We study the properties of such distributions as the domain size tends to infinity. Three types of concrete examples of MLNs will be considered, and the properties of random structures with domain sizes tending to infinity will be studied: (1) Arbitrary quantifier-free MLNs over a language with only one relation symbol which has arity 1. In this c…

Schema-Guided Response Generation using Multi-Frame Dialogue State for Motivational Interviewing Systems
Jie Zeng, Yukiko I. Nakano
https://arxiv.org/abs/2508.20635 https://

Schema-Guided Response Generation using Multi-Frame Dialogue State for Motivational Interviewing Systems
The primary goal of Motivational Interviewing (MI) is to help clients build their own motivation for behavioral change. To support this in dialogue systems, it is essential to guide large language models (LLMs) to generate counselor responses aligned with MI principles. By employing a schema-guided approach, this study proposes a method for updating multi-frame dialogue states and a strategy decision mechanism that dynamically determines the response focus in a manner grounded in MI principles.…

The Realization of 3D Topological Spaces Branched Over Graphs
Christopher L Duston
https://arxiv.org/abs/2508.09026 https://arxiv.org/pdf/2508.09026…

The Realization of 3D Topological Spaces Branched Over Graphs
In this paper we present an implementation of a computer algorithm that automatically determines the topological structure of spacetime, using a branched covering space representation. This algorithm is applied to a few simple examples in dimension 3, and a complete set of the topological spaces branched over several graphs are found. We also include some new visualizations of the branched covering construction, in order to aid and clarify the understanding of how these structures can be used i…

TREBL -- A Relative Complete Temporal Event-B Logic. Part I: Theory
Klaus-Dieter Schewe, Flavio Ferrarotti, Peter Rivi\`ere, Neeraj Kumar Singh, Guillaume Dupont, Yamine A\"it Ameur
https://arxiv.org/abs/2509.01462

TREBL -- A Relative Complete Temporal Event-B Logic. Part I: Theory
The verification of liveness conditions is an important aspect of state-based rigorous methods. This article addresses the extension of the logic of Event-B to a powerful logic, in which properties of traces of an Event-B machine can be expressed. However, all formulae of this logic are still interpreted over states of an Event-B machine rather than traces. The logic exploits that for an Event-B machine $M$ a state $S$ determines all traces of $M$ starting in $S$. We identify a fragment called …

Determining a magnetic Schr\"odinger equation by a single far-field measurement
Chaohua Duan, Zhen Xue
https://arxiv.org/abs/2510.08198 https://arxiv.…

Determining a magnetic Schrödinger equation by a single far-field measurement
This paper investigates the inverse scattering problem for the magnetic Schrödinger equation. We first establish the well-posedness of the direct problem through a variational approach under physically meaningful assumptions on the magnetic and electric potentials. Our main results demonstrate that a single far-field measurement uniquely determines the support of the potential functions when the scatterer has polyhedral structures. A significant theoretical byproduct of our analysis reveals …

An Annotation Scheme for Factuality and its Application to Parliamentary Proceedings
Gili Goldin, Shira Wigderson, Ella Rabinovich, Shuly Wintner
https://arxiv.org/abs/2509.26406

An Annotation Scheme for Factuality and its Application to Parliamentary Proceedings
Factuality assesses the extent to which a language utterance relates to real-world information; it determines whether utterances correspond to facts, possibilities, or imaginary situations, and as such, it is instrumental for fact checking. Factuality is a complex notion that relies on multiple linguistic signals, and has been studied in various disciplines. We present a complex, multi-faceted annotation scheme of factuality that combines concepts from a variety of previous works. We develope…

In any case, day 2: Ursula K Le Guin.
As I've said elsewhere, part of her science fiction thesis is that "human" can encompass much more than what we mere Terrans think of it as, and that moral standing extends broadly throughout the universe. This is the antithesis of Tokens fantasy, wherein "race" is real and determines moral standing. For Le Guin, it's barely okay to intervene in complex alien politics unless you carefully ensure you're not causing systemic harms; for Tolkien, it's okay to ambush and murder orc children, because they are by nature evil.
Add to her excellent politics Le Guin's masterful worldbuilding and unparalleled range of plots, and you have the one author I loved as a decidedly liberal and naïve teen and love even more now that I'm an adult. She's an absolute legend and deserves a very high place on any list of women authors (or list of authors, period.).
For a short story, try "The Ones Who Walk Away From Omelas" which you can read here: https://www.utilitarianism.com/nu/omelas.pdf
For fantasy "A Wizard of Earthsea" (also has a nice graphic novel adaptation), or for science fiction, "The Left Hand of Darkness" or if you want a more anarchist flavor, "The Dispossessed."
I'll close this with an amazing quote from her:
"""
We live in capitalism. Its power seems inescapable. So did the divine right of kings. Any human power can be resisted and changed by human beings. Resistance and change often begin in art, and very often in our art, the art of words.
"""

Classifying KE-closed subcategories over a commutative noetherian ring
Toshinori Kobayashi, Shunya Saito
https://arxiv.org/abs/2509.05767 https://arxiv.org…

Classifying KE-closed subcategories over a commutative noetherian ring
Let $\mathsf{mod} R$ denote the category of finitely generated $R$-modules for a commutative noetherian ring $R$. In this paper, we investigate KE-closed subcategories of $\mathsf{mod} R$ as a continuation of our previous work. We associate a function on $\mathrm{Spec} R$ with each KE-closed subcategory of $\mathsf{mod} R$, and show that this function completely determines the original subcategory. To classify the functions obtained from KE-closed subcategories, we introduce the notion of an $n…

How two elephants can learn from each other
Rafik Aguech, Shuo Qin
https://arxiv.org/abs/2509.04862 https://arxiv.org/pdf/2509.04862

How two elephants can learn from each other
We consider a two-elephant walking model in which the elephants interact dynamically. At each time step, each elephant determines its next move randomly based on its partner's past movements. We show that the asymptotic behavior of the elephants mainly depends on the sign and the absolute value of the product of their reinforcement parameters. In various regimes, we establish the law of large numbers and the central limit theorem. Our proofs are based on a connection to the random recursive tre…

Entanglement in Quantum Systems Based on Directed Graphs
Lucio De Simone, Roberto Franzosi
https://arxiv.org/abs/2509.05214 https://arxiv.org/pdf/2509.0521…

Entanglement in Quantum Systems Based on Directed Graphs
We investigate the entanglement properties of quantum states associated with directed graphs. Using a measure derived from the Fubini-Study metric, we quantitatively relate multipartite entanglement to the local connectivity of the graph. In \emph{Entanglement in Directed Graph States}, (2025), arXiv:2505.10716, it is demonstrated that the vertex degree distribution fully determines this entanglement measure and remains invariant under vertex relabeling, highlighting its topological character. …

Leveraging transfer learning for accurate estimation of ionic migration barriers in solids
Reshma Devi, Keith T. Butler, Gopalakrishnan Sai Gautam
https://arxiv.org/abs/2508.06436

Leveraging transfer learning for accurate estimation of ionic migration barriers in solids
Ionic mobility determines the rate performance of several applications, such as batteries, fuel cells, and electrochemical sensors and is exponentially dependent on the migration barrier ($E_m$), a difficult to measure/calculate quantity. Previous approaches to identify materials with high ionic mobility have relied on imprecise descriptors given the lack of generalizable models to predict $E_m$. Here, we present a graph neural network based architecture that leverages principles of transfer le…

Decidability of polynomial equations over function fields in positive characteristic
Nicolas Daans
https://arxiv.org/abs/2509.02290 https://arxiv.org/pdf/2…

Decidability of polynomial equations over function fields in positive characteristic
Let $K$ be a field of positive characteristic with no algebraically closed subfield. Let $F$ be a function field over $K$ and $t \in F$ transcendental over $K$. Refining a result of Eisentr{ä}ger and Shlapentokh, we show that there is no algorithm which, on input a polynomial $f \in \mathbb{Z}[t][X_1, \ldots, X_n]$, determines whether $f$ has a zero in $F^n$. To this end, we revisit and partially extend several recent results from the literature on existential definability in function fields.

New nonabelian Hodge graphs from twisted irregular connections
Jean Dou\c{c}ot
https://arxiv.org/abs/2509.24861 https://arxiv.org/pdf/2509.24861

New nonabelian Hodge graphs from twisted irregular connections
It is known that any meromorphic connection on the Riemann sphere determines a finite diagram encoding its global Cartan matrix, and that it is invariant under the Fourier-Laplace transform. If the connection is tame at finite distance and untwisted at infinity, the diagram is actually a graph, corresponding to a symmetric generalised Cartan matrix, and it was proved by Boalch/Hiroe-Yamakawa that the corresponding nonabelian Hodge moduli space contains the Nakajima quiver variety of the graph a…

Characterizing Optimality in Dynamic Settings: A Monotonicity-based Approach
Zhuokai Huang, Demian Pouzo, Andr\'es Rodr\'iguez-Clare
https://arxiv.org/abs/2509.05354 htt…

Characterizing Optimality in Dynamic Settings: A Monotonicity-based Approach
We develop a novel analytical method for studying optimal paths in dynamic optimization problems under general monotonicity conditions. The method centers on a locator function -- a simple object constructed directly from the model's primitives -- whose roots identify interior steady states and whose slope determines their local stability. Under strict concavity of the payoff function, the locator function also characterizes basins of attraction, yielding a complete description of qualitative d…

Analysis of quantities determining the critical inverse temperature in the annealed Potts model with Pareto vertex weights
A. J. E. M. Janssen
https://arxiv.org/abs/2508.21409 h…

Analysis of quantities determining the critical inverse temperature in the annealed Potts model with Pareto vertex weights
We consider in this work the crucial quantity $t_c$ that determines the critical inverse temperature $β_c$ in the $q$-state Potts model on sparse rank-1 random graphs where the vertices are equipped with a Pareto weight density $(τ-1)\,w^{-τ}\,{\cal X}_{[1,\infty)}(w)$. It is shown in \cite{ref1} that this $t_c$ is the unique positive zero of a function ${\cal K}$ that is obtained by an appropriate combination of the stationarity condition and the criticality condition for the case the exter…

Dirac states from the 't Hooft model
Paul Hoyer
https://arxiv.org/abs/2509.01510 https://arxiv.org/pdf/2509.01510…

Dirac states from the 't Hooft model
The dynamics of a light fermion bound to a heavy one is expected to be described by the Dirac equation with an external potential. The potential breaks translation invariance, whereas the bound state momentum is well defined. Boosting the bound state determines the frame dependence of the light fermion dynamics. I study the Dirac limit of the exactly solvable 't Hooft model. The light quark wave function turns out to be independent of the frame of the bound state, up to an irrelevant Lorentz co…

Dominant vertices and attractors' landscape for Boolean networks
Andrea Espa\~na, William Funez, Edgardo Ugalde
https://arxiv.org/abs/2509.03654 https://

Dominant vertices and attractors' landscape for Boolean networks
In previous works, we introduced the notion of dominant vertices. This is a set of nodes in the underlying network whose evolution determines the whole network's dynamics after a transient time. In this paper, we focus on the case of Boolean networks. We define a reduced graph on the dominant vertices and an induced dynamics on this graph, which we prove is asymptotically equivalent to the original Boolean dynamics. Asymptotic conjugacy ensures that the systems, restricted to their respective a…

Generalized Turan number with given size
Yan Wang, Yue Xu, Jiasheng Zeng, Xiao-Dong Zhang
https://arxiv.org/abs/2508.00483 https://arxiv.org/pdf/2508.00483…

Generalized Turan number with given size
Generalized Turán problem with given size, denoted as $\mathrm{mex}(m,K_r,F)$, determines the maximum number of $K_r$-copies in an $F$-free graph with $m$ edges. We prove that for $r\ge 3$ and $α\in(\frac 2 r,1]$, any graph $G$ with $m$ edges and $Ω(m^{\frac{αr}{2}})$ $K_r$-copies has a subgraph of order $n_0=Ω(m^\fracα{2})$, which contains $Ω(n_0^{\frac{i(r-2)α}{(2-α)r-2}})$ $K_i$-copies for each $i = 2, \ldots, r$. This implies an upper bound of $\mathrm{mex}(m, K_r, F)$ when an uppe…

Phi-Ground Tech Report: Advancing Perception in GUI Grounding
Miaosen Zhang, Ziqiang Xu, Jialiang Zhu, Qi Dai, Kai Qiu, Yifan Yang, Chong Luo, Tianyi Chen, Justin Wagle, Tim Franklin, Baining Guo
https://arxiv.org/abs/2507.23779

Phi-Ground Tech Report: Advancing Perception in GUI Grounding
With the development of multimodal reasoning models, Computer Use Agents (CUAs), akin to Jarvis from \textit{"Iron Man"}, are becoming a reality. GUI grounding is a core component for CUAs to execute actual actions, similar to mechanical control in robotics, and it directly leads to the success or failure of the system. It determines actions such as clicking and typing, as well as related parameters like the coordinates for clicks. Current end-to-end grounding models still achieve less than 65\…

Persistent spin texture preserved by local symmetry in graphene/WTe$_2$ heterostructure
Przemyslaw Przybysz, Karma Tenzin, Berkay Kilic, Witold Kozlowski, Pawel J. Kowalczyk, Pawel Dabrowski, Jagoda Slawinska
https://arxiv.org/abs/2509.08668

Persistent spin texture preserved by local symmetry in graphene/WTe$_2$ heterostructure
Crystal symmetries in solids give rise to spin-momentum locking, which determines how an electron's spin orientation depends on its momentum. This relationship, often referred to as spin texture, influences both charge-to-spin conversion and spin relaxation, making it one of the essential characteristics for spin-orbit-driven phenomena. Materials with strong spin-orbit coupling and broken inversion symmetry can host persistent spin textures (PSTs) - unidirectional spin configurations in momentu…

The High Energy Distribution of Scattering Phase Shifts of Schr\"odinger operators in Hyperbolic Space
Ant\^onio S\'a Barreto
https://arxiv.org/abs/2509.06821 https://

The High Energy Distribution of Scattering Phase Shifts of Schrödinger operators in Hyperbolic Space
We prove a trace formula for the high energy limit of the scattering phase shifts of Schrödinger operators with short range real valued potentials in hyperbolic space; it relates the scattering shifts and the geodesic X-ray transform of the potential. This extends a result of Bulger and Pushnitski for Schrödinger operators in Euclidean space. As an application, we prove that the high energy limit of the phase shifts uniquely determines radial potentials which are monotone and decay super-expo…

On the dimension of the strongly robust complex for configurations in general position
Dimitra Kosta, Apostolos Thoma, Marius Vladoiu
https://arxiv.org/abs/2510.04730 https://…

On the dimension of the strongly robust complex for configurations in general position
Strongly robust toric ideals are the toric ideals for which the set of indispensable binomials is the Graver basis. The strongly robust simplicial complex $Δ_T$ of a simple toric ideal $I_T$ determines the strongly robust property for all toric ideals that have $I_T$ as their bouquet ideal. We prove that $\text{dim} Δ_T<\text{rank}(T)$ for configurations in general position, partially answering a question posed by Sullivant.

Physics-Informed Detection of Friction Anomalies in Satellite Reaction Wheels
Alejandro Penacho Riveiros, Nicola Bastianello, Karl H. Johansson, Matthieu Barreau
https://arxiv.org/abs/2509.04060

Physics-Informed Detection of Friction Anomalies in Satellite Reaction Wheels
As the number of satellites in orbit has increased exponentially in recent years, ensuring their correct functionality has started to require automated methods to decrease human workload. In this work, we present an algorithm that analyzes the on-board data related to friction from the Reaction Wheel Assemblies (RWA) of a satellite and determines their operating status, distinguishing between nominal status and several possible anomalies that require preventive measures to be taken. The algorit…

Weil representations associated to isocrystals over function fields
Maxim Mornev, Richard Pink
https://arxiv.org/abs/2507.20807 https://arxiv.org/pdf/2507.…

Weil representations associated to isocrystals over function fields
Every Anderson $A$-motive $M$ over a field determines a compatible system of Galois representations on its Tate modules at almost all primes of $A$. This adapts easily to $F$-isocrystals, which are rational analogues of $A$-motives for the global function field $F:=\operatorname{Quot}(A)$. We extend this compatible system by constructing a Weil group representation associated to $M$ for every place of $F$. To this end we generalize the Tate module construction to a tensor functor on $F_{\mathfr…

Is the EPR paradox really a paradox?
Natalia Gorobey, Alexander Lukyanenko
https://arxiv.org/abs/2509.02085 https://arxiv.org/pdf/2509.02085

Is the EPR paradox really a paradox?
If the excitation of a system of quantized fields with a given set of quantum numbers does not exist, the amplitude of the triggering of the source is zero. A system with a source of two photons in a singlet state and two photon detectors is considered in detail. It is shown that the condition of operation of one detector with a given direction of photon polarization uniquely determines the adequate choice of direction and polarization for the second detector. This conclusion is in accordance w…

Row Impartial Terminus
Eric Gottlieb, Dawood Khatana, Matja\v{z} Krnc, Peter Mur\v{s}i\v{c}, Ismael Qureshi
https://arxiv.org/abs/2509.03390 https://arxiv.…

Row Impartial Terminus
We introduce Row Impartial Terminus (RIT), an impartial combinatorial game played on integer partitions. We show that any position in RIT can be uniquely decomposed into a core and a remnant. Our central result is that the Conway pair of any RIT position-which determines the outcome under both normal and misère play-is identical to the Conway pair of a corresponding position in the game of Nim defined by the remnant. This finding provides a complete winning strategy for both variants of RIT, r…

ILRe: Intermediate Layer Retrieval for Context Compression in Causal Language Models
Manlai Liang, Mandi Liu, Jiangzhou Ji, Huaijun Li, Haobo Yang, Yaohan He, Jinlong Li
https://arxiv.org/abs/2508.17892

ILRe: Intermediate Layer Retrieval for Context Compression in Causal Language Models
Large Language Models (LLMs) have demonstrated success across many benchmarks. However, they still exhibit limitations in long-context scenarios, primarily due to their short effective context length, quadratic computational complexity, and high memory overhead when processing lengthy inputs. To mitigate these issues, we introduce a novel context compression pipeline, called Intermediate Layer Retrieval (ILRe), which determines one intermediate decoder layer offline, encodes context by streamin…

Highly tunable Gilbert damping in two-dimensional van der Waals ferromagnet Fe3GaTe2: From bilayer to the twisted bilayer
Jie Wang, Shi-Bo Zhao, Jia-wan Li, Lin Zhuang, Yusheng Hou
https://arxiv.org/abs/2509.08206

Highly tunable Gilbert damping in two-dimensional van der Waals ferromagnet Fe3GaTe2: From bilayer to the twisted bilayer
Van der Waals ferromagnet Fe3GaTe2 possesses both a high Curie temperature and robust perpendicular magnetic anisotropy, holding promise for practical spintronic applications. In particular, understanding and engineering its Gilbert damping which determines magnetization dynamics are crucial for its applications. Here, we investigate the Gilbert damping of bilayer and the twisted bilayer Fe3GaTe2 through first-principles calculations. For the bilayer Fe3GaTe2, we obtain a quite low Gilbert damp…

Low-Rank Multi-Objective Linear Programming
Andreas L\"ohne, Pascal Zillmann
https://arxiv.org/abs/2508.20880 https://arxiv.org/pdf/2508.20880

Low-Rank Multi-Objective Linear Programming
When solving multi-objective programs, the number of objectives essentially determines the computing time. This can even lead to practically unsolvable problems. Consequently, it is worthwhile to reduce the number of objectives without losing information. In this article, we discuss multi-objective linear programs (MOLP) with objective matrices that do not have a full row rank. We introduce a method to transform an MOLP into an equivalent vector linear program (VLP) with merely as many objectiv…

Using Gauge Covariant Lie Derivatives in Einstein-Cartan and Metric Teleparallel Theories of Gravity
R. J. van den Hoogen, H. Forance, L. Taylor, M. Lawton
https://arxiv.org/abs/2510.03082

Using Gauge Covariant Lie Derivatives in Einstein-Cartan and Metric Teleparallel Theories of Gravity
A procedure to determine the initial ansatz for the co-frame and spin connection characterizing a Riemann-Cartan geometry respecting a given group of continuous symmetries is illustrated. Given a particular group of symmetries and assuming an orthonormal gauge we can determine the co-frame and corresponding spin connection having this symmetry group by employing an gauge covariant Lie derivative. This gauge covariant Lie derivative when applied to the metric and co-frame determines the values o…

Chromatic MacMahon symmetric functions of graphs
Jeremy L. Martin, May B. Trist
https://arxiv.org/abs/2508.00157 https://arxiv.org/pdf/2508.00157

Chromatic MacMahon symmetric functions of graphs
A MacMahon symmetric function is an invariant of the diagonal action of the symmetric group on power series in multiple alphabets of variables. We introduce an analogue of the chromatic symmetric function for vertex-weighted graphs, taking values in the MacMahon symmetric functions on two sets of variables, recording information about both cardinalities and weights of vertex sets. We prove that the chromatic symmetric MacMahon function of a tree determines the generating function for its vertex…

Ultrafast Single-Qubit Gates in the Diabatic Regime
Deniz T\"urkpen\c{c}e, Sel\c{c}uk \c{C}akmak
https://arxiv.org/abs/2509.23467 https://arxiv.org/pd…

Ultrafast Single-Qubit Gates in the Diabatic Regime
Logic gates in superconducting quantum processors are implemented through precise quantum control techniques in the microwave regime. The choice of drive frequency and other control parameters directly determines the duration of quantum gate operations. Because current devices remain too noisy to reach fault tolerance, reducing gate durations, and thereby the overall circuit depth, is of critical importance. In this work, we present a model of single qubit gate execution in both the adiabatic r…

Edge inducibility via local directed graphs
Ting-Wei Chao, Asaf Cohen Antonir, Anqi Li, Hung-Hsun Hans Yu
https://arxiv.org/abs/2509.24064 https://arxiv.or…

Edge inducibility via local directed graphs
In this paper we introduce the edge inducibility problem. This is a common refinement of both the well known Kruskal--Katona theorem and the inducibility question introduced by Pippenger and Golumbic. Our first result is a hardness result. It shows that for any graph $G$, there is a related graph $G'$ whose edge inducibility determines the vertex inducibility of $G$. Moreover, we determine the edge inducibility of every $G$ with at most $4$ vertices, and make some progress on the cases $G=C_5…

A Clockwork Quantum: Symmetry, Noise, and the Emergence of Quantum Order
Eric R. Bittner, Bhavay Tyagi
https://arxiv.org/abs/2507.19348 https://arxiv.org/p…

A Clockwork Quantum: Symmetry, Noise, and the Emergence of Quantum Order
We present a concise review and perspective on noise-induced synchronization and coherence protection in open quantum systems, with emphasis on recent work involving coupled spins, oscillators, and anyons. When local environments exhibit internal correlations, the structure of the noise determines which collective modes become decoherence-protected. This leads to steady-state entanglement, phase locking, and exceptional points (EPs) in the Liouvillian spectrum, signaling a collapse of the mode …

Polynomial-time Extraction of Entanglement Resources
Si-Yi Chen, Angela Sara Cacciapuoti, Marcello Caleffi
https://arxiv.org/abs/2508.18024 https://arxiv.o…

Polynomial-time Extraction of Entanglement Resources
The extraction of EPR pairs and n-qubits GHZ states among remote nodes in quantum networks constitutes the resource primitives for end-to-end and on-demand communications. However, the Bell-VM problem, which determines whether a given graph state can be transformed into a set of Bell pairs on specific vertices (not necessarily remote), is known to be NP-complete. In this paper, we extend this problem, not only by focusing on nodes remote within generic graph states, but also by determining the …

On the chromatic numbers of Johnson type graphs
Danila Cherkashin
https://arxiv.org/abs/2508.19775 https://arxiv.org/pdf/2508.19775

On the chromatic numbers of Johnson type graphs
A Johnson type graph $J_{\pm}(n,k,t)$ is a graph whose vertex set consists of vectors from $\{-1,0,1\}^n$ of the length $\sqrt{k}$ and edges connect vertices with scalar product $t$. The paper determines the order of growth of the chromatic numbers of graphs $J_\pm(n,2,-1)$ and $J_\pm(n,3,-1)$ (logarithmic on $n$), and also $J_\pm(n,3,-2)$ (double logarithmic on $n$).