Tootfinder

Burning games on strong path products
Sally Ambrose, Evan Angelone, Jacob Chen, Daniel Ma, Arturo Ortiz San Miguel, Wraven Watanabe, Stephen Whitcomb, Shanghao Wu
https://arxiv.org/abs/2509.20572

Burning games on strong path products
Burning and cooling are diffusion processes on graphs in which burned (or cooled) vertices spread to their neighbors with a new source picked at discrete time steps. In burning, the one tries to burn the graph as fast as possible, while in cooling one wants to delay cooling as long as possible. We consider $d$-fold strong products of paths, which generalize king graphs. The propagation of these graphs is radial, and models local spread of contagion in an arbitrary number of dimensions. We red…

Here are two of the #photos of last Saturday's hike. We went to the #wallberg above the #tegernsee .
Usually it's a quite crowded way because it's easily reachable and really very sc…

Schwinger-Keldysh effective theory of charge transport: redundancies and systematic $\omega/T$ expansion
Eren Firat, Andrew Gomes, Filippo Nardi, Riccardo Penco, Riccardo Rattazzi
https://arxiv.org/abs/2508.18346

Schwinger-Keldysh effective theory of charge transport: redundancies and systematic $ω/T$ expansion
We study Schwinger-Keldysh effective field theories (EFTs) for systems with non-Abelian internal symmetries near thermal equilibrium. We consider two approaches that were put forward in the literature -- one using a redundant Goldstone parameterization, the other employing an adjoint matter field -- and demonstrate their complete equivalence by providing an explicit dictionary and proving their equivalence at the path integral level. Critically, we extend both formalisms to be compatible with t…

Constructing Long Paths in Graph Streams
Christian Konrad, Chhaya Trehan
https://arxiv.org/abs/2508.16022 https://arxiv.org/pdf/2508.16022

Constructing Long Paths in Graph Streams
In the graph stream model of computation, an algorithm processes the edges of an input graph in one or more sequential passes while using a memory sublinear in the input size. This model poses significant challenges for constructing long paths. Many known algorithms tasked with extending an existing path as a subroutine require an entire pass to add a single additional edge. This raises a fundamental question: Are multiple passes inherently necessary to construct paths of non-trivial lengths, o…

Nooooo :(
Riding through the park along Elliott Bay for the first time in a while and there's lamp posts going up along what used to be an unlit bike path.
This used to be one of my favorite urban night rides: well paved, completely car free, great views of the distant city lights, but no lights in the park itself.
Now it's ruined.

Coxeter-Dynkin algebras of canonical type
Daniel Perniok
https://arxiv.org/abs/2509.17887 https://arxiv.org/pdf/2509.17887…

Coxeter-Dynkin algebras of canonical type
We propose a definition of Coxeter-Dynkin algebras of canonical type generalising the definition as a path algebra of a quiver. Moreover, we construct two tilting objects over the squid algebra - one via generalised APR-tilting and one via one-point-extensions and reflection functors - and identify their endomorphism algebras with the Coxeter-Dynkin algebra. This shows that our definition gives another representative in the derived equivalence class of the squid algebra, and hence of the corres…

In a short blog post for the MacArthur Foundation, my colleague Veronica Thamaini and I discuss the Abstract Wikipedia proposal, one of five finalists for the ongoing 100&Change program.
A Path to a World Where Everyone Can Share in the Sum of All Knowledge
https://www.

A Path to a World Where Everyone Can Share in the Sum of All Knowledge

And here are the last two #photos from my bike&hike recently. the one shows one of the (in my point of view) interesting geological parts of the hike. And in the second I tried to get some more foreground into the photo
I hope you enjoy the view as much as I enjoyed the hike up there 🙂
And I wonder if we could see the home area of @…

@… Bah. Try setting `LD_LIBRARY_PATH` too?
Don’t forget to preserve the existing one. Something like:
export LD_LIBRARY_PATH=“${pkg}:$LD_LIBRARY_PATH”

Planar induced paths via a decomposition into non-crossing ordered graphs
Julien Duron, Hugo Jacob
https://arxiv.org/abs/2509.17835 https://arxiv.org/pdf/2…

Planar induced paths via a decomposition into non-crossing ordered graphs
In any graph, the maximum size of an induced path is bounded by the maximum size of a path. However, in the general case, one cannot find a converse bound, even up to an arbitrary function, as evidenced by the case of cliques. Galvin, Rival and Sands proved in 1982 that, when restricted to weakly sparse graphs, such a converse property actually holds. In this paper, we consider the maximal function $f$ such that any planar graph (and in general, any graph of bounded genus) containing a path o…

Optimized adaptive MPC for lateral control of autonomous vehicles
Yassine Kebbati, Vicen\c{c} Puig, Naima Ait-Oufroukh, Vincent Vigneron, Dalil Ichalal
https://arxiv.org/abs/2509.17215

Optimized adaptive MPC for lateral control of autonomous vehicles
Autonomous vehicles are the upcoming solution to most transportation problems such as safety, comfort and efficiency. The steering control is one of the main important tasks in achieving autonomous driving. Model predictive control (MPC) is among the fittest controllers for this task due to its optimal performance and ability to handle constraints. This paper proposes an adaptive MPC controller (AMPC) for the path tracking task, and an improved PSO algorithm for optimising the AMPC parameters. …

A Practical Guideline and Taxonomy to LLVM's Control Flow Integrity
Sabine Houy, Bruno Kreyssig, Timothee Riom, Alexandre Bartel, Patrick McDaniel
https://arxiv.org/abs/2508.15386

A Practical Guideline and Taxonomy to LLVM's Control Flow Integrity
Memory corruption vulnerabilities remain one of the most severe threats to software security. They often allow attackers to achieve arbitrary code execution by redirecting a vulnerable program's control flow. While Control Flow Integrity (CFI) has gained traction to mitigate this exploitation path, developers are not provided with any direction on how to apply CFI to real-world software. In this work, we establish a taxonomy mapping LLVM's forward-edge CFI variants to memory corruption vulnerab…

Cone structures and path geometries with constant torsion
Wojciech Kry\'nski
https://arxiv.org/abs/2508.10564 https://arxiv.org/pdf/2508.10564

Cone structures and path geometries with constant torsion
We study three-dimensional path geometries with nontrivial torsion of maximal rank. We introduce the notion of constant torsion and show that such path geometries are in one-to-one correspondence with certain cone structures modeled on homogeneous ruled surfaces. We also describe these cone structures in terms of solutions to new integrable systems admitting dispersionless, non-isospectral Lax pairs.

Decision-Making-Based Path Planning for Autonomous UAVs: A Survey
Kelen C. Teixeira Vivaldini, Robert P\v{e}ni\v{c}ka, Martin Saska
https://arxiv.org/abs/2508.09304 https://

Decision-Making-Based Path Planning for Autonomous UAVs: A Survey
One of the most critical features for the successful operation of autonomous UAVs is the ability to make decisions based on the information acquired from their surroundings. Each UAV must be able to make decisions during the flight in order to deal with uncertainties in its system and the environment, and to further act upon the information being received. Such decisions influence the future behavior of the UAV, which is expressed as the path plan. Thus, decision-making in path planning is an e…

Unitary causal decompositions: a combinatorial characterisation via lattice theory
Tein van der Lugt, Robin Lorenz
https://arxiv.org/abs/2508.11762 https://

Unitary causal decompositions: a combinatorial characterisation via lattice theory
If a unitary transformation has a decomposition into a quantum circuit with no directed path from input $a$ to output $b$, then $a$ does not influence $b$ through the overall unitary. Conversely, it is known that if $a$ does not influence $b$, one may always find a circuit decomposition lacking a path between these systems, thus making the no-influence condition directly apparent in the connectivity of the circuit. Causal decompositions are circuit decompositions in which, more generally, multi…

Path-Oblivious Entanglement Swapping for the Quantum Internet
Vincent Mutolo, Rhea Parekh, Dan Rubenstein
https://arxiv.org/abs/2509.13993 https://arxiv.or…

Path-Oblivious Entanglement Swapping for the Quantum Internet
Proposed Bell pair swapping protocols, an essential component of the Quantum Internet, are planned-path: specific, structured, routing paths are reserved prior to the execution of the swapping process. This makes sense when one assumes the state used in the swapping process is expensive, fragile, and unstable. However, lessons from classical networking have shown that while reservations seem promising in concept, flexible, reservation-light or free approaches often outperform their more restric…

$H$-based Quivers with potentials and their representations
Xiaoyue Lin
https://arxiv.org/abs/2509.19782 https://arxiv.org/pdf/2509.19782

$H$-based Quivers with potentials and their representations
We generalize Derksen-Weyman-Zelevinsky's theory of quivers with potentials (QPs) to an $H$-based setting by considering quivers with exactly one loop at each vertex, asking the loops to be nilpotent and so attaching a truncated polynomial ring $H_i$ to each vertex. The algebra is then defined by taking the quotient of the complete path algebra by relations arising from analogs of the Jacobian ideals of a given potential. We develop the mutation theory for such $H$-based QPs and their decorated…

Exhaustive Generation of Pattern-Avoiding s-Words
Samuel Buick, Madeleine Goertz, Amos Lastmann, Kunal Pal, Helen Qian, Sam Tacheny, Aaron Williams, Leah Williams, Yulin Zhai
https://arxiv.org/abs/2508.16039

Exhaustive Generation of Pattern-Avoiding s-Words
The most well-known Gray code of permutations is plain changes. It was discovered in the 1600s by bell-ringers who wished to order the permutations of [n] by swaps (e.g., 123, 132, 312, 321, 231, 213 for n = 3). In other words, plain changes traces a Hamilton path in the permutohedron. In 2013 it was shown that plain changes can be generated by a greedy algorithm: swap the largest value. Algorithm J replaces the swap operation with the jump operation (which moves a larger digit past one or more…

Re-weighting estimator for ab initio path integral Monte Carlo simulations of fictitious identical particles
Tobias Dornheim, Pontus Svensson, Paul Hamann, Sebastian Schwalbe, Zhandos Moldabekov, Panagiotis Tolias, Jan Vorberger
https://arxiv.org/abs/2508.12323

Re-weighting estimator for ab initio path integral Monte Carlo simulations of fictitious identical particles
The fermion sign problem constitutes one of the most fundamental obstacles in quantum many-body theory. Recently, it has been suggested to circumvent the sign problem by carrying out path integral simulations with a fictitious quantum statistics variable $ξ$, which allows for a smooth interpolation between the bosonic and fermionic limits [\textit{J.~Chem.~Phys.}~\textbf{157}, 094112 (2022)]. This $ξ$-extrapolation method has subsequently been applied to a variety of systems and has facilitat…

On The Road - To Xi’An/ Signs 💚
在路上 - 去西安/ 表象 💚
📷 Pentax MX
🎞️Fujifilm Neopan F, expired 1993
#filmphotography #Photography #blackandwhite

“By the time I graduated high school, I had decided to be a minister,” Scott ’62 B.D. says. “At that time, to me, serving God was the number one thing in life.”
https://divinity.yale.edu/news/2025-09-04-a-season-for-eve…

Agent-Based Simulation of a Financial Market with Large Language Models
Ryuji Hashimoto, Takehiro Takayanagi, Masahiro Suzuki, Kiyoshi Izumi
https://arxiv.org/abs/2510.12189 htt…

Agent-Based Simulation of a Financial Market with Large Language Models
In real-world stock markets, certain chart patterns -- such as price declines near historical highs -- cannot be fully explained by fundamentals alone. These phenomena suggest the presence of path dependence in price formation, where investor decisions are influenced not only by current market conditions but also by the trajectory of prices leading up to the present. Path dependence has drawn attention in behavioral finance as a key mechanism behind such anomalies. One plausible driver of path …

That's how our hike at the #mummelsee started ... and how it was when we were up there. - But the walk was quite okay.
We checked the rain radar and decided to go back down rather quickly. We leveraged our rain gear and it did not disappoint us! 🙂
So we didn't see the area atop - the so called

PATH CLOSED
#SilentSunday #CentralPark

SF Supervisor Matt Dorsey was one of 15 BCDC Commissioners who voted to take away weekday access to the Richmond-San Rafael Bridge bike path.
Dorsey said cyclists need to learn to compromise more. So much for his bragging about using bikeshare 🚮
https://richmond…

Richmond bridge bike lane access to be reduced starting this fall
The change to Thursday afternoons through Sundays, starting in October, lets transportation officials test the impact on traffic congestion.

Facing a situation where no guidance exists, it becomes a necessity to step forward, forging your own path and showing others the way. full article @ https://www.brichapman.com/p/you-are-your-best-thing

you are your best thing
On becoming your own guide when no one shows you the way 🤍

Self-attention enabled quantum path analysis of high-harmonic generation in solids
Cong Zhao, Xiaozhou Zou
https://arxiv.org/abs/2510.12443 https://arxiv.o…

Self-attention enabled quantum path analysis of high-harmonic generation in solids
High-harmonic generation (HHG) in solids provides a powerful platform to probe ultrafast electron dynamics and interband--intraband coupling. However, disentangling the complex many-body contributions in the HHG spectrum remains challenging. Here we introduce a machine-learning approach based on a Transformer encoder to analyze and reconstruct HHG signals computed from a one-dimensional Kronig--Penney model. The self-attention mechanism inherently highlights correlations between temporal dipole…

Efficient Environment Design for Multi-Robot Navigation via Continuous Control
Jahid Chowdhury Choton, John Woods, William Hsu
https://arxiv.org/abs/2508.14105 https://

Efficient Environment Design for Multi-Robot Navigation via Continuous Control
Multi-robot navigation and path planning in continuous state and action spaces with uncertain environments remains an open challenge. Deep Reinforcement Learning (RL) is one of the most popular paradigms for solving this task, but its real-world application has been limited due to sample inefficiency and long training periods. Moreover, the existing works using RL for multi-robot navigation lack formal guarantees while designing the environment. In this paper, we introduce an efficient and high…

Covering the Euclidean Plane by a Pair of Trees
Hung Le, Lazar Milenkovi\'c, Shay Solomon, Tianyi Zhang
https://arxiv.org/abs/2508.11507 https://arxiv.…

Covering the Euclidean Plane by a Pair of Trees
A {$t$-stretch tree cover} of a metric space $M = (X,δ)$, for a parameter $t \ge 1$, is a collection of trees such that every pair of points has a $t$-stretch path in one of the trees. Tree covers provide an important sketching tool that has found various applications over the years. The celebrated {Dumbbell Theorem} by Arya et al. [STOC'95] states that any set of points in the Euclidean plane admits a $(1+ε)$-stretch tree cover with $O_ε(1)$ trees. This result extends to any (constant) dime…

Incredible light and detail in this oil painting...
Hans Gude, Fjordlandskap fra Balestrand, 1848
(Norway Nasjonalmuseet)
#Art #Painting #Landscape

I needed to move a bunch of PVs off Longhorn and onto local-path, and I didn't want to mess with backup and restore, so I recuited a coding agent and banged out this little thing. It was good enough for my one-time use case. Use with care! https://github.com/stblassitude/migrate-pv

One-man, first-round PPR fantasy football 2025 mock draft: Who to prioritize? https://www.nytimes.com/athletic/6527551/2025/07/31/fantasy-football-2025-ppr-mock-draft-first-round/

Utility-Scale Quantum State Preparation: Classical Training using Pauli Path Simulation
Cheng-Ju Lin, Hrant Gharibyan, Vincent P. Su
https://arxiv.org/abs/2510.02428 https://

Utility-Scale Quantum State Preparation: Classical Training using Pauli Path Simulation
We use Pauli Path simulation to variationally obtain parametrized circuits for preparing ground states of various quantum many-body Hamiltonians. These include the quantum Ising model in one dimension, in two dimensions on square and heavy-hex lattices, and the Kitaev honeycomb model, all at system sizes of one hundred qubits or more, beyond the reach of exact state-vector simulation, thereby reaching utility scale. We benchmark the Pauli Path simulation results against exact ground-state energ…

Good Morning #Canada
Yesterday, hundreds of women flocked to Washington D.C. to tryout for a few dozen spots in the new Women's Professional Baseball League. It's #Historic because it last happened over 70 years ago. It gives hope to young women who played baseball or softball at a high level in their youth, but there was no career path that involved a sport they loved. Many of those participating in the tryouts are from Canada, and certainly, one of the most interesting is Alli Schroder. At age 16, Schroder pitched the final inning for Canada’s National Team that won Bronze, and more recently, she has been striking out men in a university league in B.C. while her day job is fighting wildfires. Here's a TSN feature on her released a few years ago.
#CanadaIsAwesome #Baseball #Historic
https://youtu.be/_cOhV3giZZc?si=W3mLddxEBHshxktu

Learning Barycenters from Signature Matrices
Carlos Am\'endola, Leonard Schmitz
https://arxiv.org/abs/2509.07815 https://arxiv.org/pdf/2509.07815

Learning Barycenters from Signature Matrices
The expected signature of a family of paths need not be a signature of a path itself. Motivated by this, we consider the notion of a Lie group barycenter introduced by Buser and Karcher to propose a barycenter on path signatures. We show that every element of the free nilpotent Lie group is a barycenter of a group sample, where all but one sample element can be fixed arbitrarily. In the case of piecewise linear paths, we study the problem of recovering an underlying path corresponding to the ba…

The latest casualty of Donald Trump’s efforts to silence media criticism is Eduardo Porter, one of the most thoughtful and intelligent critics of his heinous regime.
On Tuesday, Porter wrote his last column for the Washington Post.
In a widely circulated email, he explained why he was leaving the Post:
"Jeff Bezos and his new head of Opinion are taking the paper down a path I cannot follow, directed toward the relentless promotion of free markets and personal liberties…

Uplink RSMA for Pinching-Antenna Systems
Apostolos A. Tegos, Yue Xiao, Sotiris A. Tegos, George K. Karagiannidis, Panagiotis D. Diamantoulakis
https://arxiv.org/abs/2509.10076 h…

Uplink RSMA for Pinching-Antenna Systems
One of the key goals of next-generation wireless networks is to adapt to changing conditions and meet the growing demand for reliable, high-capacity communications from emerging applications. Overcoming the limitations of conventional technologies, such as fixed antenna positions, is essential to achieving this objective because it mitigates the impact of path loss on the received signal and creates strong line-of-sight links, enhancing system performance. With this in mind, the newly proposed …

Geometry, Energy and Sensitivity in Stochastic Proton Dynamics
Veronika Chronholm, Tristan Pryer
https://arxiv.org/abs/2509.13223 https://arxiv.org/pdf/250…

Geometry, Energy and Sensitivity in Stochastic Proton Dynamics
We develop numerical schemes and sensitivity methods for stochastic models of proton transport that couple energy loss, range straggling and angular diffusion. For the energy equation we introduce a logarithmic Milstein scheme that guarantees positivity and achieves strong order one convergence. For the angular dynamics we construct a Lie-group integrator. The combined method maintains the natural geometric invariants of the system. We formulate dose deposition as a regularised path-dependent…

People often imagine unicycles as quite small but one built for distance is fairly big. 🤷
#Unicycle #UnicycleLife

Word2Spike: Poisson Rate Coding for Associative Memories and Neuromorphic Algorithms
Archit Kalra, Midhun Sadanand
https://arxiv.org/abs/2509.07361 https://

Word2Spike: Poisson Rate Coding for Associative Memories and Neuromorphic Algorithms
Spiking neural networks offer a promising path toward energy-efficient, brain-like associative memory. This paper introduces Word2Spike, a novel rate coding mechanism that combines continuous word embeddings and neuromorphic architectures. We develop a one-to-one mapping that converts multi-dimensional word vectors into spike-based attractor states using Poisson processes. Using BitNet b1.58 quantization, we maintain 97% semantic similarity of continuous embeddings on SimLex-999 while achieving…

Electronic mean free path of the cuprate superconductor Bi$_2$Sr$_2$CaCu$_2$O$_{8 \delta}$ from thermal Hall conductivity
Emma Campillo, Manel Mezidi, Lu Chen, Ashvini Vallipuram, Jordan Baglo, Munkhtuguldur Altangerel, Ga\"el Grissonnanche, Genda Gu, Louis Taillefer
https://arxiv.org/abs/2508.05196

Electronic mean free path of the cuprate superconductor Bi$_2$Sr$_2$CaCu$_2$O$_{8+δ}$ from thermal Hall conductivity
We use thermal transport to access the electronic mean free path of $d$-wave quasiparticles in one of the most widely studied cuprate superconductors, Bi$_2$Sr$_2$CaCu$_2$O$_{8+δ}$ (Bi2212). We have measured the thermal conductivity $κ_{\rm xx}$ and the thermal Hall conductivity $κ_{\rm xy}$ of three single crystals across a range of dopings. In the overdoped and optimally-doped samples, a clear enhancement is observed in both $κ_{\rm xx}$ and $κ_{\rm xy}$ upon cooling below the critical t…

Treatment-Effect Estimation in Complex Designs under a Parallel-trends Assumption
Cl\'ement de Chaisemartin, Xavier D'Haultf{\oe}uille
https://arxiv.org/abs/2508.07808 h…

Treatment-Effect Estimation in Complex Designs under a Parallel-trends Assumption
This paper considers the identification of dynamic treatment effects with panel data, in complex designs where the treatment may not be binary and may not be absorbing. We first show that under no-anticipation and parallel-trends assumptions, we can identify event-study effects comparing outcomes under the actual treatment path and under the status-quo path where all units would have kept their period-one treatment throughout the panel. Those effects can be helpful to evaluate ex-post the polic…

ARMOR: High-Performance Semi-Structured Pruning via Adaptive Matrix Factorization
Lawrence Liu, Alexander Liu, Mengdi Wang, Tuo Zhao, Lin F. Yang
https://arxiv.org/abs/2510.05528

ARMOR: High-Performance Semi-Structured Pruning via Adaptive Matrix Factorization
Large language models (LLMs) present significant deployment challenges due to their immense computational and memory requirements. While semi-structured pruning, particularly 2:4 sparsity, offers a path to practical hardware acceleration, existing methods often incur substantial performance degradation. To bridge this gap, we introduce ARMOR: (Adaptive Representation with Matrix-factORization), a novel one-shot post-training pruning algorithm. Instead of directly pruning weights, ARMOR factoriz…

Not Even Wrong: On the Limits of Prediction as Explanation in Cognitive Science
Mark Orr, Drew Cranford, Ken Ford, Kevin Gluck, Will Hancock, Christian Lebiere, Pete Pirolli, Frank Ritter, Andrea Stocco
https://arxiv.org/abs/2510.03311

Not Even Wrong: On the Limits of Prediction as Explanation in Cognitive Science
We offer a comment on the Centaur (Binz et al., 2025) transformer-based model of human behavior. In particular, Centaur was cast as a path towards unified theories of cognition. We offer a counter claim with supporting argument: Centaur is a path divergent from unified theories of cognition, one that moves towards a unified model of behavior sans cognition.

Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
Morteza Alimi, Niklas Dahlmeier, Tobias M\"omke, Philipp Pabst, Laura Vargas Koch
https://arxiv.org/abs/2509.00448

Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
The path version of the Traveling Salesman Problem is one of the most well-studied variants of the ubiquitous TSP. Its generalization, the Multi-Path TSP, has recently been used in the best known algorithm for path TSP by Traub and Vygen [Cambridge University Press, 2024]. The best known approximation factor for this problem is $2.214$ by Böhm, Friggstad, Mömke and Spoerhase [SODA 2025]. In this paper we show that for the case of graphic metrics, a significantly better approximation guarantee…

Toroidal Cartesian Products Where One Factor is 3-Connected
Elizabeth Badgett, Christian Millichap
https://arxiv.org/abs/2509.12354 https://arxiv.org/pdf/2…

Toroidal Cartesian Products Where One Factor is 3-Connected
In this paper, we provide a partial classification of Cartesian products of graphs that embed on the torus where one factor is $3$-connected. We show that if $G \square H$ embeds on the torus and $G$ is $3$-connected, then $H$ must be a path on two vertices, $P_2$, and we provide significant evidence that $G$ must be outer-cylindrical. At the same time, we show that if $G$ is outer-cylindrical, then $G \square P_2$ embeds on the torus. This all leads us to conjecture that if $G$ is $3$-connecte…

Multi-Agent Path Finding Among Dynamic Uncontrollable Agents with Statistical Safety Guarantees
Kegan J. Strawn, Thomy Phan, Eric Wang, Nora Ayanian, Sven Koenig, Lars Lindemann
https://arxiv.org/abs/2507.22282

Multi-Agent Path Finding Among Dynamic Uncontrollable Agents with Statistical Safety Guarantees
Existing multi-agent path finding (MAPF) solvers do not account for uncertain behavior of uncontrollable agents. We present a novel variant of Enhanced Conflict-Based Search (ECBS), for both one-shot and lifelong MAPF in dynamic environments with uncontrollable agents. Our method consists of (1) training a learned predictor for the movement of uncontrollable agents, (2) quantifying the prediction error using conformal prediction (CP), a tool for statistical uncertainty quantification, and (3) i…

Dinner at last. Cut down two large dead trees today as they were at risk falling uncontrollable. Was a bit of effort to lower a fence and make sure they fall into the intended direction. Lots of ropes, pulleys and chainsaws involved. #Uckermark

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen
https://arxiv.org/abs/2509.00383 http…

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
We study a large family of graph covering problems, whose definitions rely on distances, for graphs of bounded cyclomatic number (that is, the minimum number of edges that need to be removed from the graph to destroy all cycles). These problems include (but are not restricted to) three families of problems: (i) variants of metric dimension, where one wants to choose a small set $S$ of vertices of the graph such that every vertex is uniquely determined by its ordered vector of distances to the v…

GSCache: Real-Time Radiance Caching for Volume Path Tracing using 3D Gaussian Splatting
David Bauer, Qi Wu, Hamid Gadirov, Kwan-Liu Ma
https://arxiv.org/abs/2507.19718 https://

GSCache: Real-Time Radiance Caching for Volume Path Tracing using 3D Gaussian Splatting
Real-time path tracing is rapidly becoming the standard for rendering in entertainment and professional applications. In scientific visualization, volume rendering plays a crucial role in helping researchers analyze and interpret complex 3D data. Recently, photorealistic rendering techniques have gained popularity in scientific visualization, yet they face significant challenges. One of the most prominent issues is slow rendering performance and high pixel variance caused by Monte Carlo integra…

Two Fefferman-type constructions involving almost Grassmann structures and path geometries
Zhangwen Guo
https://arxiv.org/abs/2509.04878 https://arxiv.org/…

Two Fefferman-type constructions involving almost Grassmann structures and path geometries
We introduce a Fefferman-type construction that associates an almost Grassmannian structure of type $(2,n+1)$ to every $(n+1)$-dimensional path geometry. We prove that the construction is normal and provide two equivalent characterizing conditions for all almost Grassmannian structures which locally arise from this construction: one in terms of certain parallel tractors and the other in terms of a Weyl connection of an almost Grassmann structure. We prove that the latter condition is independen…

Ask-to-Clarify: Resolving Instruction Ambiguity through Multi-turn Dialogue
Xingyao Lin, Xinghao Zhu, Tianyi Lu, Sicheng Xie, Hui Zhang, Xipeng Qiu, Zuxuan Wu, Yu-Gang Jiang
https://arxiv.org/abs/2509.15061

Ask-to-Clarify: Resolving Instruction Ambiguity through Multi-turn Dialogue
The ultimate goal of embodied agents is to create collaborators that can interact with humans, not mere executors that passively follow instructions. This requires agents to communicate, coordinate, and adapt their actions based on human feedback. Recently, advances in VLAs have offered a path toward this goal. However, most current VLA-based embodied agents operate in a one-way mode: they receive an instruction and execute it without feedback. This approach fails in real-world scenarios where …

Circuit-based chatacterization of finite-temperature quantum phases and self-correcting quantum memory
Ruochen Ma, Vedika Khemani, Shengqi Sang
https://arxiv.org/abs/2509.15204 …

Circuit-based chatacterization of finite-temperature quantum phases and self-correcting quantum memory
Quantum phases at zero temperature can be characterized as equivalence classes under local unitary transformations: two ground states within a gapped phase can be transformed into each other via a local unitary circuit. We generalize this circuit-based characterization of phases to systems at finite-temperature thermal equilibrium described by Gibbs states. We construct a channel circuit that approximately transforms one Gibbs state into another provided the two are connected by a path in param…

A Phase Synthesizer for Decorrelation to Improve Acoustic Feedback Cancellation
Klaus Linhard, Philipp Bulling
https://arxiv.org/abs/2510.12377 https://arx…

A Phase Synthesizer for Decorrelation to Improve Acoustic Feedback Cancellation
Undesired acoustic feedback is a known issue in communication systems, such as speech in-car communication, public address systems, or hearing aids. Without additional precautions, there is a high risk that the adaptive filter - intended to cancel the feedback path - also suppresses parts of the desired signal. One solution is to decorrelate the loudspeaker and microphone signals. In this work, we combine the two decorrelation approaches frequency shifting and phase modulation in a unified fram…

Airy Resonances in Photonic Crystal Superpotentials
Zeyu Zhang, Brian Gould, Maria Barsukova, Mikael C. Rechtsman
https://arxiv.org/abs/2510.07522 https://…

Airy Resonances in Photonic Crystal Superpotentials
Airy wavefunctions are associated with one of the simplest scenarios in wave mechanics: a quantum bouncing ball. In other words, they are the eigenstates of the time-independent Schrodinger equation with a linear potential. In the domain of optics, laser beams that are spatially shaped as Airy functions (`Airy beams') have been shown to exhibit a prominent lobe that follows a curved path, rather than propagating in a straight line, and which has self-healing properties in the presence of obstac…

Optimizing Paths for Adaptive Fly-Scan Microscopy: An Extended Version
Yu Lu, Thomas F. Lynn, Ming Du, Zichao Di, Sven Leyffer
https://arxiv.org/abs/2509.01869 https://

Optimizing Paths for Adaptive Fly-Scan Microscopy: An Extended Version
In x-ray microscopy, traditional raster-scanning techniques are used to acquire a microscopic image in a series of step-scans. Alternatively, scanning the x-ray probe along a continuous path, called a fly-scan, reduces scan time and increases scan efficiency. However, not all regions of an image are equally important. Currently used fly-scan methods do not adapt to the characteristics of the sample during the scan, often wasting time in uniform, uninteresting regions. One approach to avoid unne…

Somewhere between my original vision for web 1.0 and the rise of social media as part of web 2.0,
we took the wrong path.
We’re now at a new crossroads,
one where we must decide if AI will be used for the betterment or to the detriment of society.
How can we learn from the mistakes of the past?
First of all, we must ensure policymakers do not end up playing the same decade-long game of catchup they have done over social media.
The time to decide the go…

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
Argyrios Deligkas, Michelle D\"oring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit
https://arxiv.org/abs/2510.05806

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
We study the parameterized complexity of maximum temporal connected components (tccs) in temporal graphs, i.e., graphs that deterministically change over time. In a tcc, any pair of vertices must be able to reach each other via a time-respecting path. We consider both problems of maximum open tccs (openTCC), which allow temporal paths through vertices outside the component, and closed tccs (closedTCC) which require at least one temporal path entirely within the component for every pair. We focu…

Symbolic Execution in Practice: A Survey of Applications in Vulnerability, Malware, Firmware, and Protocol Analysis
Joshua Bailey, Charles Nicholas
https://arxiv.org/abs/2508.06643

Symbolic Execution in Practice: A Survey of Applications in Vulnerability, Malware, Firmware, and Protocol Analysis
Symbolic execution is a powerful program analysis technique that allows for the systematic exploration of all program paths. Path explosion, where the number of states to track becomes unwieldy, is one of the biggest challenges hindering symbolic execution's practical application. To combat this, researchers have employed various strategies to enable symbolic execution on complex software systems. This paper introduces a systematic taxonomy of these strategies, categorizing them into two primar…

Notes on the Loop Equation in Loop Space
Yuri Makeenko
https://arxiv.org/abs/2508.09705 https://arxiv.org/pdf/2508.09705

Notes on the Loop Equation in Loop Space
The loop equation satisfied by Wilson's loops in QCD is reformulated as a functional Laplace equation. Discretizing the loop space by polygons, Green's function of the functional Laplacian is represented as a path integral of the Euclidean harmonic oscillator and is applied for an iterative solution of the equation. It is shown how the usual Feynman's diagrams are reproduced through order $(g^2N)^2$ including the one with the three-gluon vertex.

While I'm starting to getting into the photos from our holidays, I just saw that it's #FootpathFriday !
This one is a really nice path to walk - when the weather is a bit more stable than it was during our visit two years ago. But I learned a couple of lessons that day 😄

On the Number of Path Systems
Daniel Cizma, Nati Linial
https://arxiv.org/abs/2508.21379 https://arxiv.org/pdf/2508.21379

On the Number of Path Systems
A path system in a graph $G$ is a collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We show that the number of consistent path systems on $n$ vertices is $n^{\frac{n^2}{2}(1-o(1))}$, whereas the number of consistent path systems which are realizable as the unique geodesics w.r.t. some metric is only $2^{Θ(n^2)}$. In addition, these insights allow us to improve known bounds on the face-count of the …

Concrete Jungle II 🏗️
水泥丛林 II 🏗️
📷 Pentax MX
🎞️ Ilford HP5 Plus, expired 1993
#filmphotography #Photography #blackandwhite

An efficient grey theory-driven path selection for energy efficiency control in the Internet of Things using fog and cloud computing
Mohammad Reza Akbari, Hamid Barati, Ali Barati
https://arxiv.org/abs/2510.03533

An efficient grey theory-driven path selection for energy efficiency control in the Internet of Things using fog and cloud computing
Due to the big data exchange on the Internet of Things, proper routing and selecting the best routes for fast data transmission improve network performance. There are major challenges, like high delay, when cloud computing is used. Therefore, one solution is to use other schemes, such as fog computing. In fog computing, all data is not sent to the cloud and the fog nodes close to objects are used for data processing. This reduces the network delay. In this paper, we propose an overlapping clust…

Network connectivity analysis via shortest paths
Silvia Noschese, Lothar Reichel
https://arxiv.org/abs/2509.03230 https://arxiv.org/pdf/2509.03230

Network connectivity analysis via shortest paths
Complex systems of interacting components often can be modeled by a simple graph $\mathcal{G}$ that consists of a set of $n$ nodes and a set of $m$ edges. Such a graph can be represented by an adjacency matrix $A\in\R^{n\times n}$, whose $(ij)$th entry is one if there is an edge pointing from node $i$ to node $j$, and is zero otherwise. The matrix $A$ and its positive integer powers reveal important properties of the graph and allow the construction of the path length matrix $L$ for the graph. …

Square-Domain Area-Preserving Parameterization for Genus-Zero and Genus-One Closed Surfaces
Shu-Yung Liu, Mei-Heng Yueh
https://arxiv.org/abs/2509.22269 https://

Square-Domain Area-Preserving Parameterization for Genus-Zero and Genus-One Closed Surfaces
The parameterization of closed surfaces typically requires either multiple charts or a non-planar domain to achieve a seamless global mapping. In this paper, we propose a numerical framework for the seamless parameterization of genus-zero and genus-one closed simplicial surfaces onto a unit square domain. The process begins by slicing the surface with either the shortest-path or the Reeb graph method. The sliced surface is then mapped onto the unit square using a globally convergent algorithm t…

QUAV: Quantum-Assisted Path Planning and Optimization for UAV Navigation with Obstacle Avoidance
Nouhaila Innan, Muhammad Kashif, Alberto Marchisio, Yung-Sze Gan, Frederic Barbaresco, Muhammad Shafique
https://arxiv.org/abs/2508.21361

QUAV: Quantum-Assisted Path Planning and Optimization for UAV Navigation with Obstacle Avoidance
The growing demand for drone navigation in urban and restricted airspaces requires real-time path planning that is both safe and scalable. Classical methods often struggle with the computational load of high-dimensional optimization under dynamic constraints like obstacle avoidance and no-fly zones. This work introduces QUAV, a quantum-assisted UAV path planning framework based on the Quantum Approximate Optimization Algorithm (QAOA), to the best of our knowledge, this is one of the first appli…

Indirect method for nuclear reactions and the role of the self energy
Gregory Potel
https://arxiv.org/abs/2510.09140 https://arxiv.org/pdf/2510.09140

Indirect method for nuclear reactions and the role of the self energy
When a nuclear species (e.g., a nucleon or a deuteron nucleus) propagating freely is made to collide with a target nucleus, its trajectory is modified by exchanging variable amounts of energy, mass, linear and angular momentum with the target, according to its interaction with the nuclear medium. By addressing this perturbation away from the free path, one hopes to learn something about the nature of the medium through which our probe propagates. This is the essence of the experimental use of n…

Macroscopic fluctuation theory and the absorption of Brownian particles by partially reactive targets
Paul C Bressloff
https://arxiv.org/abs/2507.19833 https://

Macroscopic fluctuation theory and the absorption of Brownian particles by partially reactive targets
We use macroscopic fluctuation theory (MFT) to analyse current fluctuations in a non-interacting Brownian gas with one or more partially absorbing targets within a bounded domain $Ω\subset \R^d$. We proceed by coarse-graining a generalised Dean-Kawasaki equation with Robin boundary conditions at the target surfaces. The exterior surface $\partial Ω$ is maintained at a constant density $\owp$. We first derive MFT equations for the optimal noise-induced path for a single target under a saddle-p…

One more photo stop that we did after quite a rain pour in the #schwarzwald.
We came up this path when I turned around and saw the sun beams through the canopy. At first I was really stunned to be honest as I hardly *ever* see such scenes!
Strangely I took ways less photos than might have been appropriate, but those two I found worth sharing.
Some more story about them:

Parameterized complexity of isometric path partition: treewidth and diameter
Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud, Mathieu Mari, Prafullkumar Tale
https://arxiv.org/abs/2508.05448

Parameterized complexity of isometric path partition: treewidth and diameter
We investigate the parameterized complexity of the Isometric Path Partition problem when parameterized by the treewidth ($\mathrm{tw}$) of the input graph, arguably one of the most widely studied parameters. Courcelle's theorem shows that graph problems that are expressible as MSO formulas of constant size admit FPT algorithms parameterized by the treewidth of the input graph. This encompasses many natural graph problems. However, many metric-based graph problems, where the solution is defined …

Safe Navigation in the Presence of Range-Limited Pursuers
Thomas Chapman, Alexander Von Moll, Isaac E. Weintraub
https://arxiv.org/abs/2509.04258 https://a…

Safe Navigation in the Presence of Range-Limited Pursuers
This paper examines the degree to which an evader seeking a safe and efficient path to a target location can benefit from increasing levels of knowledge regarding one or more range-limited pursuers seeking to intercept it. Unlike previous work, this research considers the time of flight of the pursuers actively attempting interception. It is shown that additional knowledge allows the evader to safely steer closer to the threats, shortening paths without accepting additional risk of capture. A c…

Disjoint additivity and local quantum physics
Daniel Harlow, Shu-Heng Shao, Jonathan Sorce, Manu Srivastava
https://arxiv.org/abs/2509.03589 https://arxiv.…

Disjoint additivity and local quantum physics
Quantum systems of physical interest are often local, but there are at least three competing perspectives on how "locality" should be formalized: an algebraic framework, a path-integral framework, and a lattice framework. One puzzle in this competition is that systems with higher-form symmetries, which are perfectly local from the path-integral and lattice perspectives, can violate the algebraic principle of "additivity". In this paper, we propose a resolution to this puzzle by introducing a we…

Following the Committor Flow: A Data-Driven Discovery of Transition Pathways
Cheng Giuseppe Chen, Chenyu Tang, Alberto Meg\'ias, Radu A. Talmazan, Sergio Contreras Arredondo, Beno\^it Roux, Christophe Chipot
https://arxiv.org/abs/2507.21961

Following the Committor Flow: A Data-Driven Discovery of Transition Pathways
The discovery of transition pathways to unravel distinct reaction mechanisms and, in general, rare events that occur in molecular systems is still a challenge. Recent advances have focused on analyzing the transition path ensemble using the committor probability, widely regarded as the most informative one-dimensional reaction coordinate. Consistency between transition pathways and the committor function is essential for accurate mechanistic insight. In this work, we propose an iterative framew…

Concrete Jungle III 🏗️
水泥丛林 III 🏗️
📷 Pentax MX
🎞️ Ilford HP5 Plus 400, expired 1993
#filmphotography #Photography #blackandwhite

My son Elliot when we were visiting Gettysburg, PA this spring
#gettysburg #history #photo #photography

ConPoSe: LLM-Guided Contact Point Selection for Scalable Cooperative Object Pushing
Noah Steinkr\"uger, Nisarga Nilavadi, Wolfram Burgard, Tanja Katharina Kaiser
https://arxiv.org/abs/2510.08705

ConPoSe: LLM-Guided Contact Point Selection for Scalable Cooperative Object Pushing
Object transportation in cluttered environments is a fundamental task in various domains, including domestic service and warehouse logistics. In cooperative object transport, multiple robots must coordinate to move objects that are too large for a single robot. One transport strategy is pushing, which only requires simple robots. However, careful selection of robot-object contact points is necessary to push the object along a preplanned path. Although this selection can be solved analytically, …

Is There Only One Vacuum?
Xinmu Zong, Chunyu Huang
https://arxiv.org/abs/2507.22084 https://arxiv.org/pdf/2507.22084

Is There Only One Vacuum?
This work proposes a reconstruction of the quantum field theory (QFT) scattering framework: the path integral governs an interaction kernel region, while the Hilbert space encodes asymptotic free boundary conditions. We critically reexamine foundational assumptions and standard observables of QFT, raising the possibility of a unique vacuum. We also introduce a new thermodynamic perspective on vacuum loop contributions. The motivation behind certain vacuum energy cancellation schemes is reconsid…

Asymptotic structure. V. The coarse Menger conjecture in bounded path-width
Tung Nguyen, Alex Scott, Paul Seymour
https://arxiv.org/abs/2509.08762 https://…

Asymptotic structure. V. The coarse Menger conjecture in bounded path-width
Menger's theorem tells us that if $S,T$ are sets of vertices in a graph $G$, then (for $k\ge0$) either there are $k+1$ vertex-disjoint paths between $S$ and $T$, or there is a set of $k$ vertices separating $S$ and $T$. But what if we want the paths to be far apart, say at distance at least $c$? One might hope that we can find either $k+1$ paths pairwise far apart, or $k$ sets of bounded radius that separate $S$ and $T$, where the bound on the radius is some $\ell$ that depends only on $k,c$ (t…

One reason why we chose #Baiersbronn for our last vacation was the #Landesgartenschau (#Garden show?).
It would have been a gem for flower and garden

Lower Bounds on Tree Covers
Yu Chen, Zihan Tan, Hangyu Xu
https://arxiv.org/abs/2508.10376 https://arxiv.org/pdf/2508.10376

Lower Bounds on Tree Covers
Given an $n$-point metric space $(X,d_X)$, a tree cover $\mathcal{T}$ is a set of $|\mathcal{T}|=k$ trees on $X$ such that every pair of vertices in $X$ has a low-distortion path in one of the trees in $\mathcal{T}$. Tree covers have been playing a crucial role in graph algorithms for decades, and the research focus is the construction of tree covers with small size $k$ and distortion. When $k=1$, the best distortion is known to be $Θ(n)$. For a constant $k\ge 2$, the best distorti…

On The Road - To Xi’An ⛅️
在路上 - 去西安 ⛅️
📷 Minolta Hi-Matic AF
🎞️Kentmere Pan 200
#filmphotography #Photography #blackandwhite

A Proof of the 2004 Albert-Grossman-Nowakowski-Wolfe Conjecture on Alternating Linear Clobber
Xinyue Chen, Taylor Folkersen, Kamillah Hasham, Ryan B. Hayward, David Lee, Owen Randall, Luke Schultz, Emily Vandermeer
https://arxiv.org/abs/2509.08985

A Proof of the 2004 Albert-Grossman-Nowakowski-Wolfe Conjecture on Alternating Linear Clobber
Clobber is an alternate-turn two-player game introduced in 2001 by Albert, Grossman, Nowakowski and Wolfe. The board is a graph with each node colored black (x), white (o), or empty (-). Player Left has black stones, player Right has white stones. On a turn, a player takes one of their stones that is adjacent to an opponent stone and clobbers the opponent's stone (replaces it with theirs). Whoever cannot move loses. Linear clobber is clobber played on a path, for example, one row of a Go board.…

Gravitational Hilbert spaces: invariant and co-invariant states, inner products, gauge-fixing, and BRST
Jesse Held, Henry Maxfield
https://arxiv.org/abs/2509.05412 https://

Gravitational Hilbert spaces: invariant and co-invariant states, inner products, gauge-fixing, and BRST
Hilbert spaces in theories of gravity are notoriously subtle due to the Hamiltonian constraints, particularly regarding the inner product. To demystify this subject, we review and extend a collection of ideas in canonical gravity, and connect to the sum-over-histories approach by clarifying the Hilbert space interpretation of various gravitational path integrals. We use one-dimensional (or mini-superspace) models as the simplest context to exemplify the conceptual ideas. We emphasise that a phy…

Bounds on the equation of state of cold nuclear matter from imaginary chemical potentials
Thomas D. Cohen
https://arxiv.org/abs/2510.07124 https://arxiv.or…

Bounds on the equation of state of cold nuclear matter from imaginary chemical potentials
The sign problem in numerical calculations of the QCD Euclidean space path integral of QCD with a chemical potential vanishes if the chemical potential is imaginary and calculations of the partition function with an imaginary chemical potentials are equivalent to calculations with Lagrange multipliers enforcing the current density. At zero temperature, Lorentz boosts allows one to deduce properties of systems with both number density and and current density from properties of systems with a cur…

Moody Urbanity - Beings 🔶
情绪化城市 - 灵 🔶
📷 Nikon FE
🎞️ Lucky SHD 400
#filmphotography #Photography #blackandwhite

Foremost, Fastest, Shortest: Temporal Graph Realization under Various Path Metrics
Justine Cauvi (ENS de Lyon, ARGO), Nils Morawietz (LaBRI), Laurent Viennot (DI-ENS, ARGO)
https://arxiv.org/abs/2510.01702

Foremost, Fastest, Shortest: Temporal Graph Realization under Various Path Metrics
In this work, we follow the current trend on temporal graph realization, where one is given a property P and the goal is to determine whether there is a temporal graph, that is, a graph where the edge set changes over time, with property P . We consider the problems where as property P , we are given a prescribed matrix for the duration, length, or earliest arrival time of pairwise temporal paths. That is, we are given a matrix D and ask whether there is a temporal graph such that for any order…

QSearchNet: A Quantum Walk Search Framework for Link Prediction
Priyank Dubey
https://arxiv.org/abs/2510.00325 https://arxiv.org/pdf/2510.00325

QSearchNet: A Quantum Walk Search Framework for Link Prediction
Link prediction is one of the fundamental problems in graph theory, critical for understanding and forecasting the evolution of complex systems like social and biological networks. While classical heuristics capture certain aspects of graph topology, they often struggle to optimally integrate local and global structural information or adapt to complex dependencies. Quantum computing offers a powerful alternative by leveraging superposition for simultaneous multi-path exploration and interferenc…

Operator Algebras and Third Quantization
Yidong Chen, Marius Junge, Nima Lashkari
https://arxiv.org/abs/2509.02293 https://arxiv.org/pdf/2509.02293

Operator Algebras and Third Quantization
In quantum gravity, the gravitational path integral involves a sum over topologies, representing the joining and splitting of multiple universes. To account for topology change, one is led to allow the creation and annihilation of closed and open universes in a framework often called third quantization or universe field theory. We argue that since topology change in gravity is a rare event, its contribution to exponentially late-time physics is universally described by a Poisson process. This u…

Planar Tur\'{a}n numbers of three configurations
Xuqing Bai, Zhipeng Gao, Ping Li
https://arxiv.org/abs/2509.06131 https://arxiv.org/pdf/2509.06131

Planar Turán numbers of three configurations
The planar Tuán number of $H$, denoted by $ex_{\mathcal{P}}(n,H)$, is defined as the maximum number of edges in an $n$-vertex $H$-free planar graph. The exact value of $ex_{\mathcal{P}}(n,H)$ remains a mystery when $H$ is large (for example, $H$ is a long path or a long cycle), while tight bounds have been established for many small planar graphs such as cycles, paths, $Θ$-graphs and other small graphs formed by a union of them. One representative graph among such union graphs is $K_1+L$ wh…

Three models for charged hadron nuclear modification from light to heavy ions
Wilke van der Schee, Isobel Kolb\'e, Govert Nijs, Kumail Ruhani, Ishtiaq Ahmed, Shahin Iqbal
https://arxiv.org/abs/2509.04299

Three models for charged hadron nuclear modification from light to heavy ions
In July 2025 the Large Hadron Collider (LHC) collided $^{16}$O$^{16}$O and $^{20}$Ne$^{20}$Ne isotopes in a quest to understand the physics of ultrarelativistic light ion collisions. One of the key motivations for this run is to discover partonic energy loss in systems with a small quark-gluon plasma (QGP). In this letter we combine a BDMPS-Z based model, a path-length based energy loss prescription, and JEWEL together with two realistic geometries of the $^{16}$O and $^{20}$Ne isotopes. The di…

Strong hub cover pebbling number
Runze Wang
https://arxiv.org/abs/2510.05170 https://arxiv.org/pdf/2510.05170

Strong hub cover pebbling number
In a graph $G$, we define a set of vertices to be a \emph{strong hub set} if for any two vertices in $G$, we can find a path between them whose internal vertices are all in this set. We define the \emph{strong hub cover pebbling number} of $G$, denoted by $h_s^*(G)$, to be the smallest $t$ such that for any initial configuration with $t$ pebbles on $G$, we can make some pebbling moves (a pebbling move consists of removing two pebbles from a vertex $v$ and adding one pebble to another vertex adj…

Hitting Geodesic Intervals in Structurally Restricted Graphs
Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada, Yota Otachi, Hayato Takaike
https://arxiv.org/abs/2509.01413 https://…

Hitting Geodesic Intervals in Structurally Restricted Graphs
Given a graph $G = (V,E)$, a set $T$ of vertex pairs, and an integer $k$, Hitting Geodesic Intervals asks whether there is a set $S \subseteq V$ of size at most $k$ such that for each terminal pair $\{u,v\} \in T$, the set $S$ intersects at least one shortest $u$-$v$ path. Aravind and Saxena [WALCOM 2024] introduced this problem and showed several parameterized complexity results. In this paper, we extend the known results in both negative and positive directions and present sharp complexity co…