Tootfinder

Fermi-GBM Observations of GRB 230307A: An Exceptionally Bright Long-Duration Gamma-ray Burst with an Associated Kilonova
S. Dalessi, P. Veres, C. M. Hui, S. Bala, S. Lesage, M. S. Briggs, A. Goldstein, E. Burns, C. A. Wilson-Hodge, C. Fletcher, O. J. Roberts, P. N. Bhat, E. Bissaldi, W. H. Cleveland, M. M. Giles, M. Godwin, R. Hamburg, B. A. Hristov, D. Kocevski, B. Mailyan, C. Malacaria, O. Mukherjee, L. Scotton, A. von Kienlin, J. Wood

Fermi-GBM Observations of GRB 230307A: An Exceptionally Bright Long-Duration Gamma-ray Burst with an Associated Kilonova
On March 7th, 2023 the \textit{Fermi} Gamma-ray Burst Monitor observed the second highest fluence gamma-ray burst (GRB) ever, GRB~230307A. With a duration beyond 100~s, GRB~230307A contains a multitude of rapidly-varying peaks, and was so bright it caused instrumental effects in the GBM detectors. The high fluence of this burst, (6.02 $\pm$ 0.02)$\times$10$^{-3}$ erg cm$^{-2}$, prompted rapid follow-up across the electro magnetic spectrum including the discovery of an associated kilonova. GRB~2…

Generalize across Homophily and Heterophily: Hybrid Spectral Graph Pre-Training and Prompt Tuning
Haitong Luo, Suhang Wang, Weiyao Zhang, Ruiqi Meng, Xuying Meng, Yujun Zhang
https://arxiv.org/abs/2508.11328

Generalize across Homophily and Heterophily: Hybrid Spectral Graph Pre-Training and Prompt Tuning
Graph ``pre-training and prompt-tuning'' aligns downstream tasks with pre-trained objectives to enable efficient knowledge transfer under limited supervision. However, existing methods rely on homophily-based low-frequency knowledge, failing to handle diverse spectral distributions in real-world graphs with varying homophily. Our theoretical analysis reveals a spectral specificity principle: optimal knowledge transfer requires alignment between pre-trained spectral filters and the intrinsic spe…

The Grorthendieck group of an extriangulated category
Li Wang
https://arxiv.org/abs/2508.12545 https://arxiv.org/pdf/2508.12545

The Grorthendieck group of an extriangulated category
In this paper, we investigate the split Grothendieck group $K^{\rm sp}_{0}(\mathcal{M})$ of a $d$-rigid subcategory $\mathcal{M}$ in an extriangulated category $\mathscr{C}$. As applications, we prove the following results: (1) If $\mathcal{M}$ is a silting subcategory, then the Grothendieck group $K_{0}(\mathscr{C})$ is isomorphic to $K_{0}^{\rm sp}(\mathcal{M})$; (2) If $\mathcal{M}$ is a $d$-cluster tilting subcategory, then $K_{0}(\mathscr{C})$ is isomorphic to the index Grothendieck group …

GALA: Can Graph-Augmented Large Language Model Agentic Workflows Elevate Root Cause Analysis?
Yifang Tian, Yaming Liu, Zichun Chong, Zihang Huang, Hans-Arno Jacobsen
https://arxiv.org/abs/2508.12472

GALA: Can Graph-Augmented Large Language Model Agentic Workflows Elevate Root Cause Analysis?
Root cause analysis (RCA) in microservice systems is challenging, requiring on-call engineers to rapidly diagnose failures across heterogeneous telemetry such as metrics, logs, and traces. Traditional RCA methods often focus on single modalities or merely rank suspect services, falling short of providing actionable diagnostic insights with remediation guidance. This paper introduces GALA, a novel multi-modal framework that combines statistical causal inference with LLM-driven iterative reasonin…

Lecture: Yen-yi Chan, “Presence and Performance: Devotional Images of Shaka and His Sacred Body in Medieval Nara” (Kanagawa U., Wed., 24 Sept, 3:30–5pm; in-person only) https://networks.h-net.org/group/announcements/20125…

The spectral Tur\'{a}n problem: Characterizing spectral-consistent graphs
Longfei Fang, Huiqiu Lin, Mingqing Zhai
https://arxiv.org/abs/2508.12070 https://

The spectral Turán problem: Characterizing spectral-consistent graphs
Let ${\rm EX}(n,H)$ and ${\rm SPEX}(n,H)$ denote the families of $n$-vertex $H$-free graphs with the maximum size and the maximum spectral radius, respectively. A graph $H$ is said to be spectral-consistent if ${\rm SPEX}(n,H)\subseteq {\rm EX}(n,H)$ for sufficiently large $n$. A fundamental problem in spectral extremal graph theory is to determine which graphs are spectral-consistent. Cioabă, Desai and Tait [European J. Combin. 99 (2022) 103420] proposed the following conjecture: Let $H$ be…

Draw a Portrait of Your Graph Data: An Instance-Level Profiling Framework for Graph-Structured Data
Tianqi Zhao, Russa Biswas, Megha Khosla
https://arxiv.org/abs/2509.12094 http…

Draw a Portrait of Your Graph Data: An Instance-Level Profiling Framework for Graph-Structured Data
Graph machine learning models often achieve similar overall performance yet behave differently at the node level, failing on different subsets of nodes with varying reliability. Standard evaluation metrics such as accuracy obscure these fine grained differences, making it difficult to diagnose when and where models fail. We introduce NodePro, a node profiling framework that enables fine-grained diagnosis of model behavior by assigning interpretable profile scores to individual nodes. These scor…

Lecture: Yen-yi Chan, “Presence and Performance: Devotional Images of Shaka and His Sacred Body in Medieval Nara” (Kanagawa U., Wed., 24 Sept, 3:30–5pm; in-person only) https://networks.h-net.org/group/announcements/20125…

Beyond the MaxCut problem in $H$-free graphs
Zhihan Jin, Aleksa Milojevi\'c, Istv\'an Tomon
https://arxiv.org/abs/2507.13298 https://

Beyond the MaxCut problem in $H$-free graphs
In a recent breakthrough, Zhang proves that if $G$ is an $H$-free graph with $m$ edges, then $G$ has a cut of size at least $m/2+c_Hm^{0.5001}$, making a significant step towards a well known conjecture of Alon, Bollobás, Krivelevich and Sudakov. We show that the methods of Zhang can be further boosted, and prove the following strengthening. If $G$ is a graph with $m$ edges and no clique of size $m^{1/2-δ}$, then $G$ has a cut of size at least $m/2+m^{1/2+\varepsilon}$ for some $\varepsilon=\…

Transversal packings in families of percolated hypergraphs
Jie Han, Jie Hu, Shunan Wei, Donglei Yang
https://arxiv.org/abs/2507.12740 https://

Transversal packings in families of percolated hypergraphs
Let $F$ be a strictly $1$-balanced $k$-graph on $s$ vertices with $t$ edges and $δ_{F,d}^T$ be the infimum of $δ>0$ such that for every $α>0$ and sufficiently large $n\in \mathbb{N}$, every $k$-graph system $\mathbf H=\{H_{1}, H_{2}, \dots ,H_{tn}\}$ on the same $sn$ vertices with $δ_d(H_i)\ge (δ+α)\binom{sn-d}{k-d}$, $i\in [tn]$ contains a transversal $F$-factor, that is, an $F$-factor consisting of exactly one edge from each $H_i$. In this paper we prove the following result. Let $\math…