Tootfinder

MindGuard: Tracking, Detecting, and Attributing MCP Tool Poisoning Attack via Decision Dependence Graph
Zhiqiang Wang, Junyang Zhang, Guanquan Shi, HaoRan Cheng, Yunhao Yao, Kaiwen Guo, Haohua Du, Xiang-Yang Li
https://arxiv.org/abs/2508.20412

MindGuard: Tracking, Detecting, and Attributing MCP Tool Poisoning Attack via Decision Dependence Graph
The Model Context Protocol (MCP) is increasingly adopted to standardize the interaction between LLM agents and external tools. However, this trend introduces a new threat: Tool Poisoning Attacks (TPA), where tool metadata is poisoned to induce the agent to perform unauthorized operations. Existing defenses that primarily focus on behavior-level analysis are fundamentally ineffective against TPA, as poisoned tools need not be executed, leaving no behavioral trace to monitor. Thus, we propose M…

Graph Fractional Hilbert Transform: Theory and Application
Daxiang Li, Zhichao Zhang
https://arxiv.org/abs/2509.16910 https://arxiv.org/pdf/2509.16910

Graph Fractional Hilbert Transform: Theory and Application
The graph Hilbert transform (GHT) is a key tool in constructing analytic signals and extracting envelope and phase information in graph signal processing. However, its utility is limited by confinement to the graph Fourier domain, a fixed phase shift, information loss for real-valued spectral components, and the absence of tunable parameters. The graph fractional Fourier transform introduces domain flexibility through a fractional order parameter $α$ but does not resolve the issues of phase ri…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

DualResearch: Entropy-Gated Dual-Graph Retrieval for Answer Reconstruction
Jinxin Shi, Zongsheng Cao, Runmin Ma, Yusong Hu, Jie Zhou, Xin Li, Lei Bai, Liang He, Bo Zhang
https://arxiv.org/abs/2510.08959

DualResearch: Entropy-Gated Dual-Graph Retrieval for Answer Reconstruction
The deep-research framework orchestrates external tools to perform complex, multi-step scientific reasoning that exceeds the native limits of a single large language model. However, it still suffers from context pollution, weak evidentiary support, and brittle execution paths. To address these issues, we propose DualResearch, a retrieval and fusion framework that matches the epistemic structure of tool-intensive reasoning by jointly modeling two complementary graphs: a breadth semantic graph th…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

Proof of a conjecture of Voss on bridges of longest cycles
Jie Ma, Rongxing Xu
https://arxiv.org/abs/2509.06345 https://arxiv.org/pdf/2509.06345

Proof of a conjecture of Voss on bridges of longest cycles
Bridges are a classical concept in structural graph theory and play a fundamental role in the study of cycles. A conjecture of Voss from 1991 asserts that if disjoint bridges $B_1, B_2, \ldots, B_k$ of a longest cycle $L$ in a $2$-connected graph overlap in a tree-like manner (i.e., induce a tree in the {\it overlap graph} of $L$), then the total {\it length} of these bridges is at most half the length of $L$. Voss established this for $k \leq 3$ and used it as a key tool in his 1991 monograph …

Hypothesis testing for the dimension of random geometric graph
Mingao Yuan, Feng Yu
https://arxiv.org/abs/2510.11844 https://arxiv.org/pdf/2510.11844

Hypothesis testing for the dimension of random geometric graph
Random geometric graphs (RGGs) offer a powerful tool for analyzing the geometric and dependence structures in real-world networks. For example, it has been observed that RGGs are a good model for protein-protein interaction networks. In RGGs, nodes are randomly distributed over an $m$-dimensional metric space, and edges connect the nodes if and only if their distance is less than some threshold. When fitting RGGs to real-world networks, the first step is probably to input or estimate the dimens…

Stream RAG: Instant and Accurate Spoken Dialogue Systems with Streaming Tool Usage
Siddhant Arora, Haidar Khan, Kai Sun, Xin Luna Dong, Sajal Choudhary, Seungwhan Moon, Xinyuan Zhang, Adithya Sagar, Surya Teja Appini, Kaushik Patnaik, Sanat Sharma, Shinji Watanabe, Anuj Kumar, Ahmed Aly, Yue Liu, Florian Metze, Zhaojiang Lin
https://arxiv.…

Stream RAG: Instant and Accurate Spoken Dialogue Systems with Streaming Tool Usage
End-to-end speech-in speech-out dialogue systems are emerging as a powerful alternative to traditional ASR-LLM-TTS pipelines, generating more natural, expressive responses with significantly lower latency. However, these systems remain prone to hallucinations due to limited factual grounding. While text-based dialogue systems address this challenge by integrating tools such as web search and knowledge graph APIs, we introduce the first approach to extend tool use directly into speech-in speech-…

A thread dumping some (non-obvious?) notes about #firewalld - I think I've got it doing what I want, but it's been a bit of a fight, and I made a bunch of wrong turns.
It's a layer on top of nftables or iptables; is XML based but you can just drive it from a command line tool firewall-cmd and avoid the XML.
It's main idea is a graph of 'zones' where a 'zo…

Temporal social network modeling of mobile connectivity data with graph neural networks
Joel Jaskari, Chandreyee Roy, Fumiko Ogushi, Mikko Saukkoriipi, Jaakko Sahlsten, Kimmo Kaski
https://arxiv.org/abs/2509.03319

Temporal social network modeling of mobile connectivity data with graph neural networks
Graph neural networks (GNNs) have emerged as a state-of-the-art data-driven tool for modeling connectivity data of graph-structured complex networks and integrating information of their nodes and edges in space and time. However, as of yet, the analysis of social networks using the time series of people's mobile connectivity data has not been extensively investigated. In the present study, we investigate four snapshot - based temporal GNNs in predicting the phone call and SMS activity between u…

Fusing Knowledge and Language: A Comparative Study of Knowledge Graph-Based Question Answering with LLMs
Vaibhav Chaudhary, Neha Soni, Narotam Singh, Amita Kapoor
https://arxiv.org/abs/2509.09272

Fusing Knowledge and Language: A Comparative Study of Knowledge Graph-Based Question Answering with LLMs
Knowledge graphs, a powerful tool for structuring information through relational triplets, have recently become the new front-runner in enhancing question-answering systems. While traditional Retrieval Augmented Generation (RAG) approaches are proficient in fact-based and local context-based extraction from concise texts, they encounter limitations when addressing the thematic and holistic understanding of complex, extensive texts, requiring a deeper analysis of both text and context. This pape…

AI4DiTraRe: Building the BFO-Compliant Chemotion Knowledge Graph
Ebrahim Norouzi, Nicole Jung, Anna M. Jacyszyn, J\"org Waitelonis, Harald Sack
https://arxiv.org/abs/2509.01536

AI4DiTraRe: Building the BFO-Compliant Chemotion Knowledge Graph
Chemistry is an example of a discipline where the advancements of technology have led to multi-level and often tangled and tricky processes ongoing in the lab. The repeatedly complex workflows are combined with information from chemical structures, which are essential to understand the scientific process. An important tool for many chemists is Chemotion, which consists of an electronic lab notebook and a repository. This paper introduces a semantic pipeline for constructing the BFO-compliant Ch…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

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…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

Improving atomic force microscopy structure discovery via style-translation
Jie Huang, Niko Oinonen, Fabio Priante, Filippo Federici Canova, Lauri Kurki, Chen Xu, Adam S. Foster
https://arxiv.org/abs/2509.02240

Improving atomic force microscopy structure discovery via style-translation
Atomic force microscopy (AFM) is a key tool for characterising nanoscale structures, with functionalised tips now offering detailed images of the atomic structure. In parallel, AFM simulations using the particle probe model provide a cost-effective approach for rapid AFM image generation. Using state-of-the-art machine learning models and substantial simulated datasets, properties such as molecular structure, electrostatic potential, and molecular graph can be predicted from AFM images. However…

Optimizing Geometry Problem Sets for Skill Development
Michael Bouzinier, Sergey Trifonov
https://arxiv.org/abs/2509.02758 https://arxiv.org/pdf/2509.02758…

Optimizing Geometry Problem Sets for Skill Development
This article describes an ontology and methodology for annotating and organizing Euclidean Geometry problems, developed in the early 1990s and implemented as a software tool. While the majority of this work -- including the ontology and solution graph paradigm -- was completed over thirty years ago, we argue that it has renewed relevance in the context of modern artificial intelligence. In particular, we explore the hypothesis that this established framework can facilitate automated solution va…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

Forecasting West Nile virus with deep graph encoders
Ethan Greiffenstein, Trevor Harris, Rebecca Smith
https://arxiv.org/abs/2509.22657 https://arxiv.org/p…

Forecasting West Nile virus with deep graph encoders
West Nile virus is a significant, and growing, public health issue in the United States. With no human vaccine, mosquito control programs rely on accurate forecasting to determine when and where WNV will emerge. Recently, spatial Graph neural networks (GNNs) were shown to be a powerful tool for WNV forecasting, significantly improving over traditional methods. Building on this work, we introduce a new GNN variant that linearly connects graph attention layers, allowing us to train much larger mo…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

MC-GNNAS-Dock: Multi-criteria GNN-based Algorithm Selection for Molecular Docking
Siyuan Cao, Hongxuan Wu, Jiabao Brad Wang, Yiliang Yuan, Mustafa Misir
https://arxiv.org/abs/2509.26377

MC-GNNAS-Dock: Multi-criteria GNN-based Algorithm Selection for Molecular Docking
Molecular docking is a core tool in drug discovery for predicting ligand-target interactions. Despite the availability of diverse search-based and machine learning approaches, no single docking algorithm consistently dominates, as performance varies by context. To overcome this challenge, algorithm selection frameworks such as GNNAS-Dock, built on graph neural networks, have been proposed. This study introduces an enhanced system, MC-GNNAS-Dock, with three key advances. First, a multi-criteria …