Tootfinder

'graphviz' is a suite of programs for drawing graphs (In the nodes/edges senses, rather than upwards and to the right sense) - and it uses a file format called 'dot'. Lots of things generate dot output (such as systemd-analyze I mentioned) and it's really easy to generate from scripts and things. 'dotty' is probably the most common program in the suite.
There are some newer formats and programs - but this one is probably the most universal.

MedKGEval: A Knowledge Graph-Based Multi-Turn Evaluation Framework for Open-Ended Patient Interactions with Clinical LLMs
Yuechun Yu, Han Ying, Haoan Jin, Wenjian Jiang, Dong Xian, Binghao Wang, Zhou Yang, Mengyue Wu
https://arxiv.org/abs/2510.12224

MedKGEval: A Knowledge Graph-Based Multi-Turn Evaluation Framework for Open-Ended Patient Interactions with Clinical LLMs
The reliable evaluation of large language models (LLMs) in medical applications remains an open challenge, particularly in capturing the complexity of multi-turn doctor-patient interactions that unfold in real clinical environments. Existing evaluation methods typically rely on post hoc review of full conversation transcripts, thereby neglecting the dynamic, context-sensitive nature of medical dialogues and the evolving informational needs of patients. In this work, we present MedKGEval, a nove…

The poset of maximal tubings of the cycle graph is a lattice
Ben Adenbaum, Emily Barnard, Max Hlavacek, Bryson Kagy, Nathan R. T. Lesnevich, George D. Nasr, Katie Waddle
https://arxiv.org/abs/2510.09429

The poset of maximal tubings of the cycle graph is a lattice
The poset of maximal tubings of a graph generalizes several well-known and remarkable partial orders. Notable examples include the weak Bruhat order and the Tamari lattice, posets of maximal tubings for the complete graph and the path graph, respectively. It is an open problem to characterize graphs for which the poset of maximal tubings is a lattice. In this paper, we prove that the poset of maximal tubings for the cycle graph is a lattice, and moreover that it is semidistributive and congruen…

from my link log —
Mapping a universe of open source software: the Nixpkgs dependency graph.
https://www.tweag.io/blog/2019-02-06-mapping-open-source/
saved 2020-07-28

Mapping a Universe of Open Source Software
The repositories of distributions such as Debian and Nixpkgs are among the largest collections of open source (and some unfree) software. They are complex systems that connect and organize many interdependent packages. In this blog post I'll try to shed some light on them from the perspective of Nixpkgs, mostly with visualizations of its complete dependency graph.

NatGVD: Natural Adversarial Example Attack towards Graph-based Vulnerability Detection
Avilash Rath, Weiliang Qi, Youpeng Li, Xinda Wang
https://arxiv.org/abs/2510.04987 https:/…

NatGVD: Natural Adversarial Example Attack towards Graph-based Vulnerability Detection
Graph-based models learn rich code graph structural information and present superior performance on various code analysis tasks. However, the robustness of these models against adversarial example attacks in the context of vulnerability detection remains an open question. This paper proposes NatGVD, a novel attack methodology that generates natural adversarial vulnerable code to circumvent GNN-based and graph-aware transformer-based vulnerability detectors. NatGVD employs a set of code transfor…

GTCN-G: A Residual Graph-Temporal Fusion Network for Imbalanced Intrusion Detection (Preprint)
Tianxiang Xu, Zhichao Wen, Xinyu Zhao, Qi Hu, Yan Li, Chang Liu
https://arxiv.org/abs/2510.07285

GTCN-G: A Residual Graph-Temporal Fusion Network for Imbalanced Intrusion Detection (Preprint)
The escalating complexity of network threats and the inherent class imbalance in traffic data present formidable challenges for modern Intrusion Detection Systems (IDS). While Graph Neural Networks (GNNs) excel in modeling topological structures and Temporal Convolutional Networks (TCNs) are proficient in capturing time-series dependencies, a framework that synergistically integrates both while explicitly addressing data imbalance remains an open challenge. This paper introduces a novel deep le…

PowerPlots: An Open Source Power Grid Visualization and Data Analysis Framework for Academic Research
Noah Rhodes
https://arxiv.org/abs/2510.05063 https://…

PowerPlots: An Open Source Power Grid Visualization and Data Analysis Framework for Academic Research
Data visualization is important for developing an understanding of a complex system. PowerPlots.jl is a data visualization tool for power grids, one of the most complex systems in the world. The design of PowerPlots.jl is intended to facilitate exploration of power grid data while performing research and to facilitate communication of research findings to an audience. Several tools created to support this software also facilitate analysis of power grid data by transforming the data into graph t…

On the non-existence of certain real algebraic surfaces
Miguel Angel Guadarrama-Garc\'ia
https://arxiv.org/abs/2510.04025 https://arxiv.org/pdf/2510.04…

On the non-existence of certain real algebraic surfaces
In this note is given an algebraic solution to the problem 1997-6 proposed by D. A. Panov in the list of Arnold's problems \cite{Arnld2b}. In particular, it is shown that there does not exist a real polynomial function $f$ on the real euclidean plane, whose Hessian is positive in an open set bordered by smooth connected curve, and the parabolic curve of the graph of $f$ has only one special parabolic point with index $+1$. Besides, we find conditions on $f$ so that its graph has more special pa…

Does FOMC Tone Really Matter? Statistical Evidence from Spectral Graph Network Analysis
Jaeho Choi, Jaewon Kim, Seyoung Chung, Chae-shick Chung, Yoonsoo Lee
https://arxiv.org/abs/2510.02705

Does FOMC Tone Really Matter? Statistical Evidence from Spectral Graph Network Analysis
This study examines the relationship between Federal Open Market Committee (FOMC) announcements and financial market network structure through spectral graph theory. Using hypergraph networks constructed from S\&P 100 stocks around FOMC announcement dates (2011--2024), we employ the Fiedler value -- the second eigenvalue of the hypergraph Laplacian -- to measure changes in market connectivity and systemic stability. Our event study methodology reveals that FOMC announcements significantly alter…

Zero-free regions for the independence polynomial on restricted graph classes
Mark Jerrum, Viresh Patel
https://arxiv.org/abs/2510.01466 https://arxiv.org/…

Zero-free regions for the independence polynomial on restricted graph classes
Generalising the Heilman-Lieb Theorem from statistical physics, Chudnovsky and Seymour [J. Combin. Theory Ser. B, 97(3):350--357] showed that the univariate independence polynomial of any claw-free graph has all of its zeros on the negative real line. In this paper, we show that for any fixed subdivded claw $H$ and any $Δ$, there is an open set $F \subseteq \mathbb{C}$ containing $[0, \infty)$ such that the independence polynomial of any $H$-free graph of maximum degree $Δ$ has all of its zer…

Deep chemical tagging - Identifying open clusters and moving groups in chemical space with graph attention networks
Lorenzo Spina, Milan Quandt Rodriguez, Laura Magrini, Leda Berni, Sara Lucatello, Marco Canducci
https://arxiv.org/abs/2509.18268

Progress in the study of the (non)existence of genuinely unextendible product bases
Maciej Demianowicz
https://arxiv.org/abs/2509.26135 https://arxiv.org/p…

Progress in the study of the (non)existence of genuinely unextendible product bases
We investigate the open problem of the existence of genuinely unextendible product bases (GUPBs), that is, multipartite unextendible product bases (UPBs) which remain unextendible even with respect to biproduct vectors across all bipartitions of the parties. To this end, we exploit the well-known connection between UPBs and graph theory through orthogonality graphs and orthogonal representations, together with recent progress in this framework, and employ forbidden induced subgraph characteriza…

Explaining Fine Tuned LLMs via Counterfactuals A Knowledge Graph Driven Framework
Yucheng Wang, Ziyang Chen, Md Faisal Kabir
https://arxiv.org/abs/2509.21241 https://

Explaining Fine Tuned LLMs via Counterfactuals A Knowledge Graph Driven Framework
The widespread adoption of Low-Rank Adaptation (LoRA) has enabled large language models (LLMs) to acquire domain-specific knowledge with remarkable efficiency. However, understanding how such a fine-tuning mechanism alters a model's structural reasoning and semantic behavior remains an open challenge. This work introduces a novel framework that explains fine-tuned LLMs via counterfactuals grounded in knowledge graphs. Specifically, we construct BioToolKG, a domain-specific heterogeneous knowled…

Crosslisted article(s) found for astro-ph.SR. https://arxiv.org/list/astro-ph.SR/new
[1/1]:
- Deep chemical tagging - Identifying open clusters and moving groups in chemical space with graph ...
Lorenzo Spina, Milan Quandt Rodriguez, Laura Magrini, Leda Berni, Sara Lucatello, Marco Ca…

On Kotzig's conjecture in random graphs
Stefan Glock, Amedeo Sgueglia
https://arxiv.org/abs/2510.01949 https://arxiv.org/pdf/2510.01949

On Kotzig's conjecture in random graphs
In 1963, Anton Kotzig famously conjectured that $K_{n}$, the complete graph of order $n$, where $n$ is even, can be decomposed into $n-1$ perfect matchings such that every pair of these matchings forms a Hamilton cycle. The problem is still wide open and here we consider a variant of it for the binomial random graph $G(n,p)$. We prove that, for every fixed $k$, there exists a constant $C=C(k)$ such that, when $p\ge \frac{C \log n}{n}$, with high probability, $G(n,p)$ contains $k$ edge-disjoint …

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
Yair Caro, Mirko Petru\v{s}evski, Riste \v{S}krekovski, Zsolt Tuza
https://arxiv.org/abs/2510.01897

The odd independence number of graphs, II: Finite and infinite grids and chessboard graphs
An odd independent set $S$ in a graph $G=(V,E)$ is an independent set of vertices such that, for every vertex $v \in V \setminus S$, either $N(v) \cap S = \emptyset$ or $|N(v) \cap S| \equiv 1$ (mod 2), where $N(v)$ stands for the open neighborhood of $v$. The largest cardinality of odd independent sets of a graph $G$, denoted $α_{od}(G)$, is called the odd independence number of $G$. This new parameter is a natural companion to the recently introduced strong odd chromatic number. …

Neural Atlas Graphs for Dynamic Scene Decomposition and Editing
Jan Philipp Schneider, Pratik Singh Bisht, Ilya Chugunov, Andreas Kolb, Michael Moeller, Felix Heide
https://arxiv.org/abs/2509.16336

Neural Atlas Graphs for Dynamic Scene Decomposition and Editing
Learning editable high-resolution scene representations for dynamic scenes is an open problem with applications across the domains from autonomous driving to creative editing - the most successful approaches today make a trade-off between editability and supporting scene complexity: neural atlases represent dynamic scenes as two deforming image layers, foreground and background, which are editable in 2D, but break down when multiple objects occlude and interact. In contrast, scene graph models …

Ramsey sequences with bounded clique size
Abhishek Girish Aher, Aparna Lakshmanan S
https://arxiv.org/abs/2509.23929 https://arxiv.org/pdf/2509.23929

Ramsey sequences with bounded clique size
A sequence of graphs $ \{G_k\} $ is a Ramsey sequence if for every positive integer $ k $, the graph $ G_k $ is a proper subgraph of $ G_{k+1} $, and there exists an integer $n > k$ such that every red-blue coloring of $ G_n $ contains a monochromatic copy of $ G_k $. Among the wide range of open problems in Ramsey theory, an interesting open question is ``Does there exist an ascending sequence $\{G_k\}$ with $\lim_{k \to \infty} χ(G_k) = \infty$ and $\lim_{k \to \infty} ω(G_k) \neq \infty$ t…

The odd independence number of graphs, I: Foundations and classical classes
Yair Caro, Mirko Petru\v{s}evski, Riste \v{S}krekovski, Zsolt Tuza
https://arxiv.org/abs/2509.20763 h…

The odd independence number of graphs, I: Foundations and classical classes
An odd independent set $S$ in a graph $G=(V,E)$ is an independent set of vertices such that, for every vertex $v \in V \setminus S$, either $N(v) \cap S = \emptyset$ or $|N(v) \cap S| \equiv 1$ (mod 2), where $N(v)$ stands for the open neighborhood of $v$. The largest cardinality of odd independent sets of a graph $G$, denoted $α_{od}(G)$, is called the odd independence number of $G$. This new parameter is a natural companion to the recently introduced strong odd chromatic number. …

Clique-factors in graphs with low $K_{\ell}$-independence number
Ming Chen, Jie Han, Donglei Yang
https://arxiv.org/abs/2509.16851 https://arxiv.org/pdf/25…

Clique-factors in graphs with low $K_{\ell}$-independence number
Given $r\in \mathbb{N}$ with $r\geq 4$, we show that there exists $n_0\in \mathbb{N}$ such that for every $n\geq n_0$, every $n$-vertex graph $G$ with $δ(G)\geq (\frac{1}{2}+o(1))n$ and $α_{r-2}(G)=o(n)$ contains a $K_{r}$-factor. This resolves the first open case of a question proposed by Nenadov and Pehova, and reiterated by Knierm and Su. We further introduce two lower bound constructions that, along with some known results, fully resolve a question presented by Balogh, Molla, and Sharifza…