Tootfinder

With new Senate legislation, Congress is one step closer to gutting the Inflation Reduction Act
The so-called Big Beautiful Bill targets the tax credits designed to put the U.S. on the path to net-zero carbon emissions
https://grist.org/politics/big-beautif

With new Senate legislation, Congress is one step closer to gutting the Inflation Reduction Act
The so-called Big Beautiful Bill targets the tax credits designed to put the U.S. on the path to net-zero carbon emissions.

I climbed a #Monroe with very nice views next to #LochLomond: Ben Chaluim
#Scotland

Creatively Disrupting Capitalism
Richard Muscat* In the series Prospects for Degrowth I am a degrowth activist. It’s not a career path I ever envisaged for myself. I arrived here after a couple of decades working, for want of better phrasing, on “capitalism’s side”. First for a range of high-growth Silicon Valley software companies and their ilk; latterly directly in venture capital focused on climate change technology startups, aka “Climate Tech” or “Impact Investing.”

Creatively Disrupting Capitalism
Richard Muscat* In the series Prospects for Degrowth I am a degrowth activist. It’s not a career path I ever envisaged for myself. I arrived here after a couple of decades working, for want of bett…

Are you looking to accurately measure your organisation's current progress on the path towards digital transformation?
Take the OAV Maturity Model survey!
Developed by the Network eAcademy team of the GÉANT project, it’s designed to help #NRENs and R&E organisations assess where they are on their Orchestration, Automation, and Virtualisation (OAV) journey, and map out the next st…

Orchestration, Automation and Virtualisation (OAV) Maturity Model: a tool to assess where you are and help you reach the next level | GÉANT CONNECT Online
Words: Maria Isabel Gandia Carriedo (CSUC) and Eldis Mujaric (CARNET) Organisations with advanced capabilities in Orchestration, Automation and Virtualisation (OAV) are more likely to succeed in their path towards digital transformation. But how can the progress in these areas be accurately measured? And how can organisations identify the actions needed to drive further advancement? Maturity Models

Summer solstice 2025
Short (5km), but absolutely stunning hike with my son to make the most of the solstice evening, with some grand views, sunset, radler and an adventurous T3 path along a steep 400m cliff drop-off... Back at the trailhead after 10pm, still not dark. Summer evenings...
#SilentSunday

Medicaid expansion.
'You leave us with only one path': Red states furious at section in Trump's bill - Raw Story
https://www.rawstory.com/trump-budget-bill-2672410512/

CI/CD #Pipeline #Architecture: Complete Guide to Building Robust CI and CD Pipelines
https://

We’re on a terrible path that we aren’t even aware exists: collapsing the marine food chain.
The End Permian event did that. It was ugly. Lots of fungal spores in the fossil record, not a lot of bones. Barely anything survived.
We’re having issues with phytoplankton in the #GreatLakes too. Invasive mussels have done huge damage to how the food chain (Esp. in

Phytoplankton, key to ocean life, falling 2% per year in North Atlantic
Two main types of phytoplankton have been decreasing in biomass in the North Atlantic by two per cent each year for the past 60 years, a new study …

Open-Path Methane Sensing via Backscattered Light in a Nonlinear Interferometer
Jinghan Dong, Weijie Nie, Arthur C. Cardoso, Haichen Zhou, Jingrui Zhang, John G. Rarity, Alex S. Clark
https://arxiv.org/abs/2506.17107

Open-Path Methane Sensing via Backscattered Light in a Nonlinear Interferometer
Nonlinear interferometry has widespread applications in sensing, spectroscopy, and imaging. However, most implementations require highly reflective mirrors and precise optical alignment, drastically reducing their versatility and usability in outdoor applications. This work is based on stimulated parametric down conversion (ST-PDC), demonstrating methane absorption spectroscopy in the mid-infrared (MIR) region by detecting near-infrared (NIR) photons using a silicon-based CMOS camera. The MIR l…

All tools create a path of least resistance. When it comes to AI chatbots, that path is to trust the AI's outputs.
Unfortunately, all LLMs hallucinate. And as users get used to relying on the machine, their ability and willingness to spot these errors deteriorates.
Blaming the user for this is irresponsible. The problem is caused by the way these tools are designed - so it's up to us, as designers, to fix it.

Pretty sure my experience of having spent the better part of 25 years asking technology questions on Freenode and getting a spectrum of answers anywhere from Really-Helpful to “You don’t want to do the thing you asked for” unintentionally prepared me for navigating the minefield of AI chat “answers” which are also a spectrum of outright lies to sometimes-leads-me-down-a-useful-path.

Sure, bombing Iran is the best path to peace :blobfox_w_:

Optimal Navigation in Microfluidics via the Optimization of a Discrete Loss
Petr Karnakov, Lucas Amoudruz, Petros Koumoutsakos
https://arxiv.org/abs/2506.15902

Optimal Navigation in Microfluidics via the Optimization of a Discrete Loss
Optimal path planning and control of microscopic devices navigating in fluid environments is essential for applications ranging from targeted drug delivery to environmental monitoring. These tasks are challenging due to the complexity of microdevice-flow interactions. We introduce a closed-loop control method that optimizes a discrete loss (ODIL) in terms of dynamics and path objectives. In comparison with reinforcement learning, ODIL is more robust, up to three orders faster, and excels in hig…

Trump’s “two weeks” statement was just one aspect of a broader effort at political and military misdirection that took place over eight chaotic days,
from the first Israeli strikes against Iran to the moment when a fleet of B-2 stealth bombers took off
Trump seemed almost gleeful in telling reporters that he could make a decision “one second before it’s due,
because things change, especially with war.”
All the while, Trump was making blustery statements indicating he…

How Trump Decided to Strike Iran
When Israel began its assault on Iran, President Trump kept his distance. But within days he was on a path that led to an extensive bombing mission aided by political and military ruses.

Compressing Suffix Trees by Path Decompositions
Ruben Becker, Davide Cenzato, Travis Gagie, Sung-Hwan Kim, Ragnar Groot Koerkamp, Giovanni Manzini, Nicola Prezza
https://arxiv.org/abs/2506.14734

Compressing Suffix Trees by Path Decompositions
In classic suffix trees, path compression works by replacing unary suffix trie paths with pairs of pointers to $T$, which must be available in the form of some random access oracle at query time. In this paper, we revisit path compression and show that a more careful choice of pointers leads to a new elegant, simple, and remarkably efficient way to compress the suffix tree. We begin by observing that an alternative way to path-compress the suffix trie of $T$ is to decompose it into a set of (di…

The Shortest-Path distance on graphons
C\'edric Simal, Julien Petit, Timoteo Carletti
https://arxiv.org/abs/2506.14353 https://ar…

The Shortest-Path distance on graphons
We define an analogue of the shortest-path distance for graphons. The proposed method is rooted on the extension to graphons of Varadhan's formula, a result that links the solution of the heat equation on a Riemannian manifold to its geodesic distance. The resulting metric is integer-valued, and for step graphons obtained from finite graphs it is essentially equivalent to the usual shortest-path distance. We further draw a link between the Varadhan distance and the communicability distance, tha…

Model Predictive Path-Following Control for a Quadrotor
David Leprich, Mario Rosenfelder, Mario Hermle, Jingshan Chen, Peter Eberhard
https://arxiv.org/abs/2506.15447

Model Predictive Path-Following Control for a Quadrotor
Automating drone-assisted processes is a complex task. Many solutions rely on trajectory generation and tracking, whereas in contrast, path-following control is a particularly promising approach, offering an intuitive and natural approach to automate tasks for drones and other vehicles. While different solutions to the path-following problem have been proposed, most of them lack the capability to explicitly handle state and input constraints, are formulated in a conservative two-stage approach,…

[Intro]
Where are we going from here?
Where do we go?
Are we all blinded by fear?
Where do we go? How do we know?
Need for survival is clear
We persevere without an end
Into forever, we fall
And wander on and on and on
[Verse 1]
Dust of a thousand years thrown on your path
And in the aftermath, you'll stumble forward
Mouth full of air resuscitating life
And you'll ascend and carry on and on

The Path is the Goal: a Study on the Nature and Effects of Shortest-Path Stability Under Perturbation of Destination
Giuliano Cornacchia, Mirco Nanni
https://arxiv.org/abs/2506.09731

The Path is the Goal: a Study on the Nature and Effects of Shortest-Path Stability Under Perturbation of Destination
This work examines the phenomenon of path variability in urban navigation, where small changes in destination might lead to significantly different suggested routes. Starting from an observation of this variability over the city of Barcelona, we explore whether this is a localized or widespread occurrence and identify factors influencing path variability. We introduce the concept of "path stability", a measure of how robust a suggested route is to minor destination adjustments, define a detaile…

A look at the lack of consensus in the tech industry on what AGI is, whether LLMs are the best path to it, and what AGI might look like if or when it arrives (Melissa Heikkilä/Financial Times)

Why Big Tech cannot agree on artificial general intelligence
It has been tipped as the next big breakthrough out of Silicon Valley, but is it a scientific goal — or a marketing buzzword?

A New Path Forward for WordPress, and for the Open Web (JOOST.BLOG, 6 Jun 2025)
#edtech

A new path forward for WordPress, and for the open web
Back in December, I wrote about the state of leadership in the WordPress ecosystem. I shared how too much power rests with one person, and how the lack of clear governance puts contributors and businesses alike in difficult positions. That post ended with a call: we need to lead. That wasn’t rhetorical. It was a ... Read more

The latest in the #WordPress drama...
https://joost.blog/path-forward-for-wordpress/

A new path forward for WordPress, and for the open web
Back in December, I wrote about the state of leadership in the WordPress ecosystem. I shared how too much power rests with one person, and how the lack of clear governance puts contributors and businesses alike in difficult positions. That post ended with a call: we need to lead. That wasn’t rhetorical. It was a ... Read more

Park Discovery 🏞️
公园探险 🏞️
📷 Nikon FE
🎞️Lucky SHD 400
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

Paris s'éveille
Hype, the world’s largest hydrogen taxi operator, is to cease operating its fleet of hydrogen taxis in the Paris area
When the reality of #hydrogen costs hits home (and you still don't want to believe it)

'A form of oligopoly' | World’s largest hydrogen taxi operator hurls accusations at supply giants as it quits H2 in Paris
Hype argues that Air Liquide and TotalEnergies have presided over doubling of H2 prices in four years — which it says is blocking a credible path to green hydrogen use

I've just set up (again, didn't seem to 'take' last time) POSSE (https://indieweb.org/POSSE - Publish (on your) Own Site, Syndicate Elsewhere) for this Mastodon account to my 'stub' account on BlueSky - if I understand it correctly, it should syndicate my posts here (in 'my ow…

Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective
Sergio Mu\~niz Subi\~nas, Jorge Mart\'inez Mart\'in, Alejandro Mata Ali, Javier Sedano, \'Angel Miguel Garc\'ia-Vico
https://arxiv.org/abs/2506.11711

Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective
In this paper, we present two tensor network quantum-inspired algorithms to solve the knapsack and the shortest path problems, and enables to solve some of its variations. These methods provide an exact equation which returns the optimal solution of the problems. As in other tensor network algorithms for combinatorial optimization problems, the method is based on imaginary time evolution and the implementation of restrictions in the tensor network. In addition, we introduce the use of symmetrie…

Path Integral Monte Carlo in the Angular Momentum Basis for a Chain of Planar Rotors
Est\^ev\~ao de Oliveira, Muhammad Shaeer Moeed, Pierre-Nicholas Roy
https://arxiv.org/abs/2506.14977

Path Integral Monte Carlo in the Angular Momentum Basis for a Chain of Planar Rotors
We introduce a Path Integral Monte Carlo (PIMC) approach that uses the angular momentum representation for the description of interacting rotor systems. Such a choice of representation allows the calculation of momentum properties without having to break the paths. The discrete nature of the momentum basis also allows the use of rejection-free Gibbs sampling techniques. To illustrate the method, we study the collective behavior of $N$ confined planar rotors with dipole-dipole interactions, a sy…

LP Relaxations for Routing and Wavelength Assignment with Partial Path Protection: Formulations and Computations
Xianyan Yang, Junyan Liu, Fan Zhang, Fabo Sun, Feng Li, Zhou Xu
https://arxiv.org/abs/2506.12838

LP Relaxations for Routing and Wavelength Assignment with Partial Path Protection: Formulations and Computations
As a variant of the routing and wavelength assignment problem (RWAP), the RWAP with partial path protection (RWAP-PPP) designs a reliable optical-fiber network for telecommunications. It assigns paths and wavelengths to meet communication requests, not only in normal working situations but also in potential failure cases where an optical link fails. The literature lacks efficient relaxations to produce tight lower bounds on the optimal objective value of the RWAP-PPP. Consequently, the solution…

from my link log —
Why does Windows use backslash as its path separator?
https://www.os2museum.com/wp/why-does-windows-really-use-backslash-as-path-separator/
saved 2024-04-25

Ball path curvature and in-game free throw shooting proficiency in the National Basketball Association
Ruoqian Zhu, Dave Love, Scott Powers
https://arxiv.org/abs/2506.13779

Ball path curvature and in-game free throw shooting proficiency in the National Basketball Association
Basketball shooting coaches agree that smoother shooting motions are better, but there is less agreement about what "smooth" means quantitatively or what part of the shooting motion needs to be smooth. Using ball tracking data from the 2023-2024 National Basketball Association regular season, we explore the relationship between ball path curvature and free throw shooting performance. We fit Bézier curves to the ball tracking data in the sagittal plane and test different methods of calculating …

Citizen science illuminates the nature of city lights: #LightPollution

@… アカウントの方のハッシュタグで、その人の投稿だけハッシュタグで絞り込めるんだけど、その時、unlistedもprivateも表示するんすよ。
こういうやつ。

Even more than usual, the path ahead isn’t clear.
Still, there was barely any reaction in market prices. -- Nor has anything else seriously disrupted major markets.
That’s noteworthy, when you consider the crises that are looming:
the highest tariffs in decades;
a contentious crackdown on immigration
and a swelling budget deficit in the United States;
and, in the Middle East, an escalating war between Israel and Iran that could sharply reduce global o…

The Markets Are Balancing on a Knife’s Edge
The world has been anything but peaceful, but you wouldn’t know that from looking at the markets.

Done some more work with the VR animation engine today.
Seems to now be working that I can lay in the path that the character will walk, and then puppet their limbs as they walk it.
Done more work to standardize how all the slapdash episode structure is so now there's also a #wip #starshipsd #gamedev

NEW BOOK> Atiśa's Stages of the Path to Awakening: Together with Commentaries and Ritual Texts by James B. Apple https://networks.h-net.org/group/announcements/20070507/new-book-atisas-stages-path-awakening-toget…

A question I was not expecting to be asked on a Monday morning...
"You’re at the edge of the desert.
🐛 Ride the Sandworm:
...or manual setup — the slow path through the sand."

I just had the horrific thought of AI middle managers and I need to accelerate my path to retirement as soon as possible.

Learning Best Paths in Quantum Networks
Xuchuang Wang, Maoli Liu, Xutong Liu, Zhuohua Li, Mohammad Hajiesmaili, John C. S. Lui, Don Towsley
https://arxiv.org/abs/2506.12462

Learning Best Paths in Quantum Networks
Quantum networks (QNs) transmit delicate quantum information across noisy quantum channels. Crucial applications, like quantum key distribution (QKD) and distributed quantum computation (DQC), rely on efficient quantum information transmission. Learning the best path between a pair of end nodes in a QN is key to enhancing such applications. This paper addresses learning the best path in a QN in the online learning setting. We explore two types of feedback: "link-level" and "path-level". Link-le…

This https://arxiv.org/abs/2503.01798 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

A Generic Quotient of a Leavitt Path Algebra is a Leavitt Path Algebra
We provide a complete answer to the question "When is a quotient of a Leavitt path algebra isomorphic to a Leavitt path algebra?" in terms of the interaction of the kernel of the quotient homomorphism with the cycles of the digraph. A key ingredient is the characterization of finitely generated projective (Leavitt path algebra) modules whose endomorphism algebras are finite dimensional. As a consequence of our characterization we get that any quotient of a Leavitt path algebra divided by its Ja…

Minimizing False Positives in Static Bug Detection via LLM-Enhanced Path Feasibility Analysis
Xueying Du, Kai Yu, Chong Wang, Yi Zou, Wentai Deng, Zuoyu Ou, Xin Peng, Lingming Zhang, Yiling Lou
https://arxiv.org/abs/2506.10322

Minimizing False Positives in Static Bug Detection via LLM-Enhanced Path Feasibility Analysis
Static bug analyzers play a crucial role in ensuring software quality. However, existing analyzers for bug detection in large codebases often suffer from high false positive rates. This is primarily due to the limited capabilities of analyzers in path feasibility validation with multiple conditional branches and complex data dependencies. While current LLM-based approaches attempt to address this issue, their effectiveness remains limited due to insufficient constraint cascade analysis and scal…

End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition
Nikunj Shah, Utsav Dey, Kenji Nishimiya
https://arxiv.org/abs/2506.06028

End-to-End Framework for Robot Lawnmower Coverage Path Planning using Cellular Decomposition
Efficient Coverage Path Planning (CPP) is necessary for autonomous robotic lawnmowers to effectively navigate and maintain lawns with diverse and irregular shapes. This paper introduces a comprehensive end-to-end pipeline for CPP, designed to convert user-defined boundaries on an aerial map into optimized coverage paths seamlessly. The pipeline includes user input extraction, coordinate transformation, area decomposition and path generation using our novel AdaptiveDecompositionCPP algorithm, pr…

I mean, we knew it was coming. I can't understand why an otherwise sane person like Masnick would go to bat for this.
Probably I don't know enough about it. Or maybe I do. https://social.growyourown.services/@FediTips/114709669094147749

A new trail in Shindagin Hollow State Forest near where I live
#photo #photography #caroline #forest

Adaptive Tetrahedral Grids for Volumetric Path-Tracing
Anis Benyoub, Jonathan Dupuy
https://arxiv.org/abs/2506.11510 https://arxiv.or…

Adaptive Tetrahedral Grids for Volumetric Path-Tracing
We advertise the use of tetrahedral grids constructed via the longest edge bisection algorithm for rendering volumetric data with path tracing. The key benefits of such grids is two-fold. First, they provide a highly adaptive space-partitioning representation that limits the memory footprint of volumetric assets. Second, each (tetrahedral) cell has exactly 4 neighbors within the volume (one per face of each tetrahedron) or less at boundaries. We leverage these properties to devise optimized alg…

Life imitating art… or something.
Finishing my rewatch of House of Cards. President Hale has continued down the fascist path of her husband and considers bombing Middle East “terrorists” that may have a bomb in order to distract from election rigging and other scandals at home.
“We don’t want to appear reckless” says her Defense Secretary…
#usa #tv #netflix #israel #iran #houseofcards

"At De Gruyter Brill, we are committed to supporting rigorous academic research that drives meaningful change. As part of this vision and mission, we have launched "Sustainability Matters" - a podcast exploring how #sustainability shapes #research,

Hollow-grams: Generalized Entanglement Wedges from the Gravitational Path Integral
Sami Kaya, Pratik Rath, Kyle Ritchie
https://arxiv.org/abs/2506.10064 ht…

Hollow-grams: Generalized Entanglement Wedges from the Gravitational Path Integral
Recently, Bousso and Penington (BP) made a proposal for the entanglement wedge associated to a gravitating bulk region. In this paper, we derive this proposal in time-reflection symmetric settings using the gravitational path integral. To do this, we exploit the connection between random tensor networks (RTNs) and fixed-geometry states in gravity. We define the entropy of a bulk region in an RTN by removing tensors in that region and computing the entropy of the open legs thus generated in the …

Great Restraining Wall in Multidimentional Collective Variable Space
Zhijun Pan, Maodong Li, Dechin Chen, Yi Isaac Yang
https://arxiv.org/abs/2506.17043 ht…

Great Restraining Wall in Multidimentional Collective Variable Space
Enhanced sampling methods are pivotal for exploring rare events in molecular dynamics (MD), yet face challenges in high-dimensional collective variable (CV) spaces where exhaustive sampling becomes computationally prohibitive. While techniques like metadynamics (MetaD) and path-CV enable targeted free energy surface (FES) reconstruction, they often struggle with confinement stability, hyperparameter sensitivity, and geometric flexibility. This work introduces the Great Restraining Wall (GW) met…

Good morning everyone! We are starting into our second week of vacation. We'll be seeing some friends.
Meanwhile, enjoy this photo from a bike and hike we did last year.
#hiking #wandern #mountains

Transition Path Theory For L\'{e}vy-Type Processes: SDE Representation and Statistics
Yuanfei Huang, Xiang Zhou
https://arxiv.org/abs/2506.09462 https:…

Transition Path Theory For Lévy-Type Processes: SDE Representation and Statistics
This paper establishes a Transition Path Theory (TPT) for Lévy-type processes, addressing a critical gap in the study of the transition mechanism between meta-stabile states in non-Gaussian stochastic systems. A key contribution is the rigorous derivation of the stochastic differential equation (SDE) representation for transition path processes, which share the same distributional properties as transition trajectories, along with a proof of its well-posedness. This result provides a solid theo…

Computing Path Signature Varieties in Macaulay2
Carlos Am\'endola, Angelo El Saliby, Felix Lotter, Oriol Reig Fit\'e
https://arxiv.org/abs/2506.01429

Computing Path Signature Varieties in Macaulay2
The signature of a path is a non-commutative power series whose coefficients are given by certain iterated integrals over the path coordinates. This series almost uniquely characterizes the path up to translation and reparameterization. Taking only fixed degree parts of these series yields signature tensors. We introduce the Macaulay2 package $\texttt{PathSignatures}$ to simplify the study of these interesting objects for piecewise polynomial paths. It allows for the creation and manipulation o…

Parallel Complexity of Depth-First-Search and Maximal path
Archit Chauhan, Samir Datta, M. Praveen
https://arxiv.org/abs/2506.14974 https://

Parallel Complexity of Depth-First-Search and Maximal path
Constructing a Depth First Search (DFS) tree is a fundamental graph problem, whose parallel complexity is still not settled. Reif showed parallel intractability of lex-first DFS. In contrast, randomized parallel algorithms (and more recently, deterministic quasipolynomial parallel algorithms) are known for constructing a DFS tree in general (di)graphs. However a deterministic parallel algorithm for DFS in general graphs remains an elusive goal. Working towards this, a series of works gave deter…

More than any time in history, mankind now faces a crossroads. One path
leads to despair and utter hopelessness, the other to total extinction.
Let us pray that we have the wisdom to choose correctly.
-- Woody Allen, "Side Effects"

B.C. cyclist's clever Strava drawings:
"Perfect intersection' of art, fitness and road rash
When B.C.'s Janine Strong got into road cycling in 2019, she had no idea it would lead her down the path of Strava art: the creation of massive GPS-tracked sketches around the world."
See Ya later Alligator
#stava

Path Signatures for Feature Extraction. An Introduction to the Mathematics Underpinning an Efficient Machine Learning Technique
Stephan Sturm
https://arxiv.org/abs/2506.01815

Path Signatures for Feature Extraction. An Introduction to the Mathematics Underpinning an Efficient Machine Learning Technique
We provide an introduction to the topic of path signatures as means of feature extraction for machine learning from data streams. The article stresses the mathematical theory underlying the signature methodology, highlighting the conceptual character without plunging into the technical details of rigorous proofs. These notes are based on an introductory presentation given to students of the Research Experience for Undergraduates in Industrial Mathematics and Statistics at Worcester Polytechnic …

If Uzbekistan wins or ties today against UAE, they will - for the first time ever - have qualified for the FIFA world cup final tournament!
If not they still have a path to the final tournament, but it gets messy.
#fifa2026 #worldcup #uzb

To be effective a boobytrap needs to be laid in a location frequented by the enemy.
These raccoons are super predictable, you can see a path they've worn into the grass

Antidirected paths in oriented graphs
Andrzej Grzesik, Marek Skrzypczyk
https://arxiv.org/abs/2506.11866 https://arxiv.org/pdf/2506.1…

Antidirected paths in oriented graphs
We show that for any integer $k \ge 4$, every oriented graph with minimum semidegree bigger than $\frac{1}{2}(k-1+\sqrt{k-3})$ contains an antidirected path of length $k$. Consequently, every oriented graph on $n$ vertices with more than $(k-1+\sqrt{k-3})n$ edges contains an antidirected path of length $k$. This asymptotically proves the antidirected path version of a conjecture of Stein and of a conjecture of Addario-Berry, Havet, Linhares Sales, Reed and Thomassé, respectively.

Mostly posting on Bluesky now but thought I'd share some spring colour here.
Dog violets in the local cemetery and the woods awakening (Crab Wood near Winchester)
#Spring #Wildflowers #woodland

The Hashed Fractal Key Recovery (HFKR) Problem: From Symbolic Path Inversion to Post-Quantum Cryptographic Keys
Mohamed Aly Bouke
https://arxiv.org/abs/2506.04383

The Hashed Fractal Key Recovery (HFKR) Problem: From Symbolic Path Inversion to Post-Quantum Cryptographic Keys
Classical cryptographic systems rely heavily on structured algebraic problems, such as factorization, discrete logarithms, or lattice-based assumptions, which are increasingly vulnerable to quantum attacks and structural cryptanalysis. In response, this work introduces the Hashed Fractal Key Recovery (HFKR) problem, a non-algebraic cryptographic construction grounded in symbolic dynamics and chaotic perturbations. HFKR builds on the Symbolic Path Inversion Problem (SPIP), leveraging symbolic tr…

Replaced article(s) found for math.QA. https://arxiv.org/list/math.QA/new
[1/1]:
- A path description for $\varepsilon$-characters of representations of type $A$ restricted quantum...
Xiao-Juan An, Jian-Rong Li, Yan-Feng Luo, Wen-Ting Zhang

Burnout leave, day negative 13:
‣ Half of me wants to rip myself to shreds with self-criticism for things I could have done better
‣ Half of me resents that, through my life so far (independent of recent events), the world hasn't been the best place for me to grow and be the best person I can be
‣ Half of me wants to accept both of the above and find the most realistic (and inevitably imperfect) path forward (ACT therapy style)
‣ Half of me is grumbling that these are…

I had to interact with some Amazon voice systems this morning. Obviously they used some automated translation to German and it failed. The voice recognition itself wasn't that impressive either. There is still a very long way to go if we want to reach the same quality levels with automated systems compared to well trained humans. And I personally am not so sure if this path leads to the mountain top or off a cliff.

Trees whose path ideals have linear quotients
Trung Chau, Kanoy Kumar Das, Animikha Dutta Dhar, Pranath S Karanth, Aniruda Suswaram
https://arxiv.org/abs/2506.06209

Trees whose path ideals have linear quotients
For any integer $n$, we classify all trees whose $n$-path ideals have linear quotients.

Thermodynamic Evolution of Flaring Loops with Non-local Thermal Transport
S. Belov, T. Parmenter, T. Arber, D. Kolotkov, F. Reale, T. Goffrey
https://arxiv.org/abs/2506.14644

Thermodynamic Evolution of Flaring Loops with Non-local Thermal Transport
Hot solar coronal loops, such as flaring loops, reach temperatures where the thermal transport becomes non-local. This occurs when the mean-free-path of electrons can no longer be assumed to be small. Using a modified version of the Lare2d code, we study the evolution of flare-heated coronal loops under three thermal transport models: classical Spitzer-Harm (SH), a flux-limited local model (FL), and the non-local Schurtz-Nicolai-Basquet (SNB) model. The SNB model is used extensively in laser-pl…

On Saturday I met Freddie greyhound, Mandy greyhound's nephew¹. Mandy passed away in 2021.
Coincidentally both homed by WGW and Freddie now lives a few miles from where Mandy lived her pet life. His human knows Mandy's humans well.
Considering the rather small greyhound gene pool this is not unusual. Mandy's sire has had over 5,000 offspring so far.
#Greyhounds

Replaced article(s) found for astro-ph.IM. https://arxiv.org/list/astro-ph.IM/new
[1/1]:
- Regularizing the Pulsar Timing Array likelihood: A path towards Fourier Space
Serena Valtolina, Rutger van Haasteren

Navigating Phase Transitions with Path-Finding Algorithms: A Strategic Approach to Replica Exchange Monte Carlo
Akie Kowaguchi, Katsuhiro Endo, Kentaro Nomura, Shuichi Kurabayashi, Paul E. Brumby, Kenji Yasuoka
https://arxiv.org/abs/2506.02549

Navigating Phase Transitions with Path-Finding Algorithms: A Strategic Approach to Replica Exchange Monte Carlo
The replica exchange method is a powerful tool for overcoming slow relaxation in molecular simulations, but its efficiency depends strongly on the choice of the number and interval of replicas and their exchange probabilities. Here, we propose a new optimization scheme based on the Dijkstra algorithm that constructs an optimal exchange path by representing replicas and their exchange probabilities as a graph. Inspired by path-finding techniques widely used in computer science, including applica…

The shortest path to Sat' @…
First posted in 2013
I'm wondering: How much are the paths different today?

A generalization of Deterministic Finite Automata related to discharging
John M. Campbell
https://arxiv.org/abs/2506.14072 https://ar…

A generalization of Deterministic Finite Automata related to discharging
Deterministic Finite Automata (DFAs) are of central importance in automata theory. In view of how state diagrams for DFAs are defined using directed graphs, this leads us to introduce a generalization of DFAs related to a method widely used in graph theory referred to as the discharging method. Given a DFA $(Q, Σ, δ, q_{0}, F)$, the transition function $δ\colon Q \times Σ\to Q$ determines a directed path in the corresponding state diagram based on an input string $a_{1} a_{2} \cdots a_{n}$ …

From Theory to Practice: Advancing Multi-Robot Path Planning Algorithms and Applications
Teng Guo
https://arxiv.org/abs/2506.09914 https://

From Theory to Practice: Advancing Multi-Robot Path Planning Algorithms and Applications
The labeled MRPP (Multi-Robot Path Planning) problem involves routing robots from start to goal configurations efficiently while avoiding collisions. Despite progress in solution quality and runtime, its complexity and industrial relevance continue to drive research. This dissertation introduces scalable MRPP methods with provable guarantees and practical heuristics. First, we study dense MRPP on 2D grids, relevant to warehouse and parcel systems. We propose the Rubik Table method, achieving …

A whistleblower provides nonpublic data revealing that 1M 2FA SMS messages from June 2023 passed via Fink Telecom, a small Swiss company linked to spy agencies (Bloomberg)

no shade, but if your import path starts with `src.`, you haven’t understood the purpose of an src directory.
The fact that VS Code gets this wrong when fixing imports in tests is concerning.
#Python

A wave of petals
Drifts along as if to pave
The path to Summer.
#dailyhaikuprompt - wave
#haiku
#poem

Did a trip to admire the ”Prague Semmering” https://en.m.wikipedia.org/wiki/Smíchov–Hostivice_railway_line from the ground, a regional railway line with impressive curved viaducts to manage the height difference up to the hills above Smíchov station and the pla…

Smíchov–Hostivice railway line - Wikipedia

Causal Mediation Analysis with Multiple Mediators: A Simulation Approach
Jesse Zhou, Geoffrey T. Wodtke
https://arxiv.org/abs/2506.14019 https://

Causal Mediation Analysis with Multiple Mediators: A Simulation Approach
Analyses of causal mediation often involve exposure-induced confounders or, relatedly, multiple mediators. In such applications, researchers aim to estimate a variety of different quantities, including interventional direct and indirect effects, multivariate natural direct and indirect effects, and/or path-specific effects. This study introduces a general approach to estimating all these quantities by simulating potential outcomes from a series of distribution models for each mediator and the o…

Path Integral Formalism for Quantum Open Systems
Ruofan Chen
https://arxiv.org/abs/2506.08802 https://arxiv.org/pdf/2506.08802…

Path Integral Formalism for Quantum Open Systems
This article provides a detailed derivation of the path integral formalism for both boson and fermion quantum open systems using coherent states. The formalism on the imaginary-time axis, Keldysh contour, and Kadanoff contour are given. The corresponding generating functional technique, which can be used to retrieve the environment information from the system correlation function, is also discussed.

Deceptive Path Planning: A Bayesian Game Approach
Violetta Rostobaya, James Berneburg, Yue Guan, Michael Dorothy, Daigo Shishika
https://arxiv.org/abs/2506.13650

Deceptive Path Planning: A Bayesian Game Approach
This paper investigates how an autonomous agent can transmit information through its motion in an adversarial setting. We consider scenarios where an agent must reach its goal while deceiving an intelligent observer about its destination. We model this interaction as a dynamic Bayesian game between a mobile Attacker with a privately known goal and a Defender who infers the Attacker's intent to allocate defensive resources effectively. We use Perfect Bayesian Nash Equilibrium (PBNE) as our solut…

Graded Naimark's Problem for Leavitt Path Algebras
Kulumani M. Rangaswamy, Ashish K Srivastava
https://arxiv.org/abs/2506.08305 https://

Graded Naimark's Problem for Leavitt Path Algebras
In this paper we study the graded version of Naimark's problem for Leavitt path algebras considering them as $\mathbb{Z}$-graded algebras. Several characterizations are obtained of a Leavitt path algebra $L$ of an arbitrary graph $E$ over a field $\mathbb{K}$ over which any two graded-simple modules are graded isomorphic. Such a Leavitt path algebra $L$ is shown to be graded isomorphic to the algebra of graded infinite matrices having at most finitely many non-zero entries from the ring $R$ whe…

Alley Stories V 🔣
巷弄故事 V 🔣
📷 Nikon FE
🎞️Ilford FP4 Plus, expired 1994
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

from my link log —
Postgres extensions in Rust.
https://depth-first.com/articles/2021/08/25/postgres-extensions-in-rust/
saved 2021-08-29

Postgres Extensions in Rust
Opening a new path to high-performance, domain-specific database applications.

NEW BOOK> Atiśa's Stages of the Path to Awakening: Together with Commentaries and Ritual Texts by James B. Apple
https://ift.tt/czFyoW8
When did aliens become a problem? The Mediterranean Association for Marine Biology and Oceanology in…
via Input 4 RELCFP

Attention-based Learning for 3D Informative Path Planning
Rui Zhao, Xingjian Zhang, Yuhong Cao, Yizhuo Wang, Guillaume Sartoretti
https://arxiv.org/abs/2506.08434

Attention-based Learning for 3D Informative Path Planning
In this work, we propose an attention-based deep reinforcement learning approach to address the adaptive informative path planning (IPP) problem in 3D space, where an aerial robot equipped with a downward-facing sensor must dynamically adjust its 3D position to balance sensing footprint and accuracy, and finally obtain a high-quality belief of an underlying field of interest over a given domain (e.g., presence of specific plants, hazardous gas, geological structures, etc.). In adaptive IPP task…

On Saturday I met Freddie greyhound, Mandy greyhound's nephew¹. Mandy passed away in 2021.
Coincidentally both homed by WGW and Freddie now lives a few miles from where Mandy lived her pet life. His human knows Mandy's humans well.
Considering the rather small greyhound gene pool this is not unusual. Mandy's sire has had over 5,000 offspring so far.
#Greyhounds

Alley Stories V 🔣
巷弄故事 V 🔣
📷 Nikon FE
🎞️Ilford FP4 Plus, expired 1994
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

Hi friends!
I set my alarm to 5am and headed out for a nice walk. It was getting warm, so I started early. - and it was just so good to do so!
A nice 6h walk with lots of views, lots of photos and just enjoying being out. End the #summit just for me 😍
On the way up I noted all places where I could refuel later using my water filter. Seriously: why didn't I buy that waaays ear…

Hamiltonian connectivity of some base-cobase graphs
Leonardo Mart\'inez-Sandoval, Kolja Knauer
https://arxiv.org/abs/2506.15049 https://

Hamiltonian connectivity of some base-cobase graphs
There has been wide interest in understanding which properties of base graphs of matroids extend to base-cobase graphs of matroids. A significant result of Naddef and Pulleyblank (1984) shows that the $1$-skeleton of any $(0,1)$-polytope is either a hypercube, or Hamiltonian-connected, i.e. there is a Hamiltonian path connecting any two vertices. In particular, this is true for base graphs of matroids. A natural question raised by Farber, Richter, and Shank (1985) is whether this extends to bas…

Towards Perception-based Collision Avoidance for UAVs when Guiding the Visually Impaired
Suman Raj, Swapnil Padhi, Ruchi Bhoot, Prince Modi, Yogesh Simmhan
https://arxiv.org/abs/2506.14857

Towards Perception-based Collision Avoidance for UAVs when Guiding the Visually Impaired
Autonomous navigation by drones using onboard sensors combined with machine learning and computer vision algorithms is impacting a number of domains, including agriculture, logistics, and disaster management. In this paper, we examine the use of drones for assisting visually impaired people (VIPs) in navigating through outdoor urban environments. Specifically, we present a perception-based path planning system for local planning around the neighborhood of the VIP, integrated with a global plann…

Path operators and $(q,t)$-tau functions
Houcine Ben Dali, Valentin Bonzom, Maciej Do{\l}\k{e}ga
https://arxiv.org/abs/2506.06036 https://

Path operators and $(q,t)$-tau functions
We construct a new class of operators that act on symmetric functions with two deformation parameters $q$ and $t$. Our combinatorial construction associates each operator with a specific lattice path, whose steps alternate between moving up and down. We demonstrate that positive linear combinations of these operators are the images of Negut elements via a representation of the shuffle algebra acting on the space of symmetric functions. Additionally, we provide a monomial, elementary, and Schur …

Swarm-STL: A Framework for Motion Planning in Large-Scale, Multi-Swarm Systems
Shiyu Cheng, Luyao Niu, Bhaskar Ramasubramanian, Andrew Clark, Radha Poovendran
https://arxiv.org/abs/2506.14749

Swarm-STL: A Framework for Motion Planning in Large-Scale, Multi-Swarm Systems
In multi-agent systems, signal temporal logic (STL) is widely used for path planning to accomplish complex objectives with formal safety guarantees. However, as the number of agents increases, existing approaches encounter significant computational challenges. Recognizing that many complex tasks require cooperation among multiple agents, we propose swarm STL specifications to describe the collective tasks that need to be achieved by a team of agents. Next, we address the motion planning problem…

Hi friends!
I set my alarm to 5am and headed out for a nice walk. It was getting warm, so I started early. - and it was just so good to do so!
A nice 6h walk with lots of views, lots of photos and just enjoying being out. End the #summit just for me 😍
On the way up I noted all places where I could refuel later using my water filter. Seriously: why didn't I buy that waaays ear…

Urban Living II 🌝
都市生活 II 🌝
📷 Nikon FE
🎞️Lucky SHD 400
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

An Improved Grey Wolf Optimizer Inspired by Advanced Cooperative Predation for UAV Shortest Path Planning
Zuhao Teng, Qian Dong, Ze Zhang, Shuangyao Huang, Wenzhang Zhang, Jingchen Wang, Ji Li, Xi Chen
https://arxiv.org/abs/2506.03663

An Improved Grey Wolf Optimizer Inspired by Advanced Cooperative Predation for UAV Shortest Path Planning
With the widespread application of Unmanned Aerial Vehicles (UAVs) in domains like military reconnaissance, emergency rescue, and logistics delivery, efficiently planning the shortest flight path has become a critical challenge. Traditional heuristic-based methods often suffer from the inability to escape from local optima, which limits their effectiveness in finding the shortest path. To address these issues, a novel Improved Grey Wolf Optimizer (IGWO) is presented in this study. The proposed …

On a conjecture of Faudree and Schelp
Jan Goedgebeur, Jorik Jooken, Michiel Provoost, Carol T. Zamfirescu
https://arxiv.org/abs/2506.09667 https://

On a conjecture of Faudree and Schelp
In 1976 Faudree and Schelp conjectured that in a hamiltonian-connected graph on $n$ vertices, any two distinct vertices are connected by a path of length $k$ for every $k \ge n/2$. In 1978 Thomassen constructed a (non-cubic and non-planar) family of counterexamples, showing that there exist hamiltonian-connected $n$-vertex graphs containing two vertices with no path of length $n-2$ between them. We complement this result by describing cubic planar counterexamples on $6p+16$ vertices, each conta…

This https://arxiv.org/abs/2505.09833 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

Learning Rock Pushability on Rough Planetary Terrain
In the context of mobile navigation in unstructured environments, the predominant approach entails the avoidance of obstacles. The prevailing path planning algorithms are contingent upon deviating from the intended path for an indefinite duration and returning to the closest point on the route after the obstacle is left behind spatially. However, avoiding an obstacle on a path that will be used repeatedly by multiple agents can hinder long-term efficiency and lead to a lasting reliance on an ac…

Enumerating several statistics of r-Colored Dyck paths with no dd-steps having the same colors
Yidong Sun, Jinyi Wang, Xinyu Wang
https://arxiv.org/abs/2506.08407

Enumerating several statistics of r-Colored Dyck paths with no dd-steps having the same colors
An $r$-colored Dyck path is a Dyck path with all $\mathbf{d}$-steps having one of $r$ colors in $[r]=\{1, 2, \dots, r\}$. In this paper, we consider several statistics on the set $\mathcal{A}_{n,0}^{(r)}$ of $r$-colored Dyck paths of length $2n$ with no two consecutive $\mathbf{d}$-steps having the same colors. Precisely, the paper studies the statistics ``number of points" at level $\ell$, ``number of $\mathbf{u}$-steps" at level $\ell+1$, ``number of peaks" at level $\ell+1$ and ``number of $…

Urban Living 🌝
都市生活 🌝
📷 Nikon FE
🎞️Lucky SHD 400
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

A Bi-Level Optimization Method for Redundant Dual-Arm Minimum Time Problems
Jonathan Fried, Santiago Paternain
https://arxiv.org/abs/2506.03982 https://

A Bi-Level Optimization Method for Redundant Dual-Arm Minimum Time Problems
In this work, we present a method for minimizing the time required for a redundant dual-arm robot to follow a desired relative Cartesian path at constant path speed by optimizing its joint trajectories, subject to position, velocity, and acceleration limits. The problem is reformulated as a bi-level optimization whose lower level is a convex, closed-form subproblem that maximizes path speed for a fixed trajectory, while the upper level updates the trajectory using a single-chain kinematic formu…

This https://arxiv.org/abs/2411.01707 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

Large-Scale Multi-Robot Coverage Path Planning on Grids with Path Deconfliction
We study Multi-Robot Coverage Path Planning (MCPP) on a 4-neighbor 2D grid G, which aims to compute paths for multiple robots to cover all cells of G. Traditional approaches are limited as they first compute coverage trees on a quadrant coarsened grid H and then employ the Spanning Tree Coverage (STC) paradigm to generate paths on G, making them inapplicable to grids with partially obstructed 2x2 blocks. To address this limitation, we reformulate the problem directly on G, revolutionizing grid-…