Tootfinder

🇺🇦 Auf radioeins läuft...
Junius Meyvant:
🎵 Let It Pass
#NowPlaying #JuniusMeyvant
https://juniusmeyvant.bandcamp.com/track/let-it-pass
https://open.spotify.com/track/5UMa3TVCmqwxCXbaToCZE8

🇺🇦 #NowPlaying on #BBC6Music's #HuwStephens
Courtney Barnett:
🎵 Pedestrian at Best
#CourtneyBarnett
https://moveunderyrownpower.bandcamp.com/track/pedestrian-at-best-courtney-barnett
https://open.spotify.com/track/7w7qzJd1j5FQVexn9TuxJw

We have raspberries growing. When we lived in Seattle we grew kale and picked wild blackberries. All were so much better than anything you get in a grocery store.
I don't eat a lot of fruit these days because its so disappointing to take a bite out of a bland or bitter berry from a plastic carton..
https://m…

Bra av Cantwell. https://www.aftonbladet.se/nyheter/kolumnister/a/bmpew3/oisin-cantwell-viktigt-att-misstankta-krigsbrott-i-gaza-utreds

Viktigt att Sverige utreder misstänkta krigsbrott i Gaza
Att misstänkta krigsbrott i Gaza har börjat utredas i Stockholm är viktigt. De svenska brottsbekämpande myndigheterna visar än en gång att de håller hög intern

Proximity and Radius in Outerplanar Graphs with Bounded Faces
Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu
https://arxiv.org/abs/2508.10077 https://a…

Proximity and Radius in Outerplanar Graphs with Bounded Faces
Let $G$ be a finite, connected graph and $v$ a vertex of $G$. The average distance and the eccentricity of $v$ in $G$ are defined as the arithmetic mean and the maximum, respectively, of the distances from $v$ to all other vertices of $G$. The proximity of $G$ and the radius of $G$ are defined as the minimum of the average distances and the eccentricities over all vertices of $G$. In this paper, we establish an upper bound on the proximity of a $2$-connected outerplanar graphs in terms of ord…

Local Clustering in Hypergraphs through Higher-Order Motifs
Giuseppe F. Italiano, Athanasios L. Konstantinidis, Anna Mpanti, Fariba Ranjbar
https://arxiv.org/abs/2507.10570

Local Clustering in Hypergraphs through Higher-Order Motifs
Hypergraphs provide a powerful framework for modeling complex systems and networks with higher-order interactions beyond simple pairwise relationships. However, graph-based clustering approaches, which focus primarily on pairwise relations, fail to represent higher-order interactions, often resulting in low-quality clustering outcomes. In this work, we introduce a novel approach for local clustering in hypergraphs based on higher-order motifs, small connected subgraphs in which nodes may be lin…

Leveraging Transfer Learning and Mobile-enabled Convolutional Neural Networks for Improved Arabic Handwritten Character Recognition
Mohsine El Khayati, Ayyad Maafiri, Yassine Himeur, Hamzah Ali Alkhazaleh, Shadi Atalla, Wathiq Mansoor
https://arxiv.org/abs/2509.05019

Leveraging Transfer Learning and Mobile-enabled Convolutional Neural Networks for Improved Arabic Handwritten Character Recognition
The study explores the integration of transfer learning (TL) with mobile-enabled convolutional neural networks (MbNets) to enhance Arabic Handwritten Character Recognition (AHCR). Addressing challenges like extensive computational requirements and dataset scarcity, this research evaluates three TL strategies--full fine-tuning, partial fine-tuning, and training from scratch--using four lightweight MbNets: MobileNet, SqueezeNet, MnasNet, and ShuffleNet. Experiments were conducted on three benchma…

Beer Path Problems in Temporal Graphs
Andrea D'Ascenzo, Giuseppe F. Italiano, Sotiris Kanellopoulos, Anna Mpanti, Aris Pagourtzis, Christos Pergaminelis
https://arxiv.org/abs/2507.08685

Beer Path Problems in Temporal Graphs
Computing paths in graph structures is a fundamental operation in a wide range of applications, from transportation networks to data analysis. The beer path problem, which captures the option of visiting points of interest, such as gas stations or convenience stops, prior to reaching the final destination, has been recently introduced and extensively studied in static graphs. However, existing approaches do not account for temporal information, which is often crucial in real-world scenarios. Fo…

Intrinsic disorder in the candidate quantum spin ice Pr$_2$Zr$_2$O$_7$
T. J. Hicken, P. Meadows, D. Prabhakaran, A. Szab\'o, S. E. Dutton, C. Castelnovo, K. Moovendaran, T. S. Northam de la Fuente, L. Mangin-Thro, G. B. G. Stenning, M. J. Gutmann, G. Sala, M. B. Stone, P. F. Henry, D. J. Voneshen, J. P. Goff
https://arxiv.org/abs/2509.…

Intrinsic disorder in the candidate quantum spin ice Pr$_2$Zr$_2$O$_7$
Quantum spin liquids with long-range entanglement are of great interest for applications in quantum technology. The quantum spin ice Pr$_2$Zr$_2$O$_7$ is a promising example, where it is believed that structural disorder plays a key role in enhancing quantum mechanical effects by introducing strains that split the ground state doublet akin to the effect of a local disordered transverse field. However, the precise defect structure responsible for this behaviour is unknown. Here we have determine…

A conceptual framework for understanding longwave cloud effects on climate sensitivity: #climate sensitivity: https://mpimet.mpg.de/en/communication/detail-view-news-homepage/changes-in-cloud-altitude-have-minimal-impact-on-climate-sensitivity