SearcharxivSearch

arXiv subjects

Craig Erickson

Publications and source records attributed to Craig Erickson.

9 recordsLinked to original sources

Human-Anchored Factuality Evaluation with Strategic Annotation

LLM-based factuality judges provide scalable evaluation signals, but their metrics are often systematically biased relative to human judgments. We study human-anchored factuality evaluation under limited annotation budgets, where judge predictions on the full dataset are combined with human labels on a small selectively sampled subset to obtain statistically valid estimates. The efficiency of this approach depends critically on which examples receive human annotation: in factuality evaluation, judge-human misalignment is not driven solely by low confidence, but also by structured failure modes such as incomplete evidence, temporal mismatch, unverifiable claims, and rubric misalignment. To exploit this structure, we introduce a factuality-specific annotation policy design pipeline that uses failure-space analysis (FSA) to derive diverse predictive signals for modeling human-judge misalignment. On an internal reference-based factuality evaluation system (AutoFA) and RAGTruth, where judge-predicted estimates substantially underestimate human-annotated factual accuracy, our FSA-guided policy improves annotation efficiency over uniform sampling and uncertainty-driven baselines, achieving effective-sample-size gains of 40.3% on AutoFA and 27.1% on RAGTruth.

cs.CL

Computer Vision Based Neurology Brain Activity Rejection Architecture and Implementation

The electroencephalogram (EEG) is a valuable and widely applied tool for investigating brain disorders and behavioral changes. It offers a minimally restrictive and non-invasive method. However, challenges in using EEG for cognitive development studies include temporal resolution, signal source localization, and EEG artifacts. Careful consideration of these factors is essential for informed application of EEG technology. Independent component analysis (ICA) effectively isolates source generator processes from signals recorded by multiple, adjacent EEG scalp electrodes. Although ICA decomposition requires manual inspection, selection, and interpretation of independent components (ICs), this process is time consuming and demands expertise. Automated IC classification can achieve sufficient accuracy, expediting large scale EEG research and enabling near real time applications in conjunction with brain activity rejection tasks, which are crucial for medical specialists. This study introduces an automated computer vision based ICA rejection labeling tool compatible with widely used software interfaces like ICLabel and EEGLab. By automating the manual task, the proposed system reduces processing time by 7200 fold and achieves an accuracy of 89.45%.

q-bio.NC

MCP-AI: Protocol-Driven Intelligence Framework for Autonomous Reasoning in Healthcare

Healthcare AI systems have historically faced challenges in merging contextual reasoning, long-term state management, and human-verifiable workflows into a cohesive framework. This paper introduces a completely innovative architecture and concept: combining the Model Context Protocol (MCP) with a specific clinical application, known as MCP-AI. This integration allows intelligent agents to reason over extended periods, collaborate securely, and adhere to authentic clinical logic, representing a significant shift away from traditional Clinical Decision Support Systems (CDSS) and prompt-based Large Language Models (LLMs). As healthcare systems become more complex, the need for autonomous, context-aware clinical reasoning frameworks has become urgent. We present MCP-AI, a novel architecture for explainable medical decision-making built upon the Model Context Protocol (MCP) a modular, executable specification for orchestrating generative and descriptive AI agents in real-time workflows. Each MCP file captures clinical objectives, patient context, reasoning state, and task logic, forming a reusable and auditable memory object. Unlike conventional CDSS or stateless prompt-based AI systems, MCP-AI supports adaptive, longitudinal, and collaborative reasoning across care settings. MCP-AI is validated through two use cases: (1) diagnostic modeling of Fragile X Syndrome with comorbid depression, and (2) remote coordination for Type 2 Diabetes and hypertension. In either scenario, the protocol facilitates physician-in-the-loop validation, streamlines clinical processes, and guarantees secure transitions of AI responsibilities between healthcare providers. The system connects with HL7/FHIR interfaces and adheres to regulatory standards, such as HIPAA and FDA SaMD guidelines. MCP-AI provides a scalable basis for interpretable, composable, and safety-oriented AI within upcoming clinical environments.

cs.AI

AutocleanEEG ICVision: Automated ICA Artifact Classification Using Vision-Language AI

We introduce EEG Autoclean Vision Language AI (ICVision) a first-of-its-kind system that emulates expert-level EEG ICA component classification through AI-agent vision and natural language reasoning. Unlike conventional classifiers such as ICLabel, which rely on handcrafted features, ICVision directly interprets ICA dashboard visualizations topography, time series, power spectra, and ERP plots, using a multimodal large language model (GPT-4 Vision). This allows the AI to see and explain EEG components the way trained neurologists do, making it the first scientific implementation of AI-agent visual cognition in neurophysiology. ICVision classifies each component into one of six canonical categories (brain, eye, heart, muscle, channel noise, and other noise), returning both a confidence score and a human-like explanation. Evaluated on 3,168 ICA components from 124 EEG datasets, ICVision achieved k = 0.677 agreement with expert consensus, surpassing MNE ICLabel, while also preserving clinically relevant brain signals in ambiguous cases. Over 97% of its outputs were rated as interpretable and actionable by expert reviewers. As a core module of the open-source EEG Autoclean platform, ICVision signals a paradigm shift in scientific AI, where models do not just classify, but see, reason, and communicate. It opens the door to globally scalable, explainable, and reproducible EEG workflows, marking the emergence of AI agents capable of expert-level visual decision-making in brain science and beyond.

cs.CV

A combinatorial bound on the number of distinct eigenvalues of a graph

The smallest possible number of distinct eigenvalues of a graph $G$, denoted by $q(G)$, has a combinatorial bound in terms of unique shortest paths in the graph. In particular, $q(G)$ is bounded below by $k$, where $k$ is the number of vertices of a unique shortest path joining any pair of vertices in $G$. Thus, if $n$ is the number of vertices of $G$, then $n-q(G)$ is bounded above by the size of the complement (with respect to the vertex set of $G$) of the vertex set of the longest unique shortest path joining any pair of vertices of $G$. The purpose of this paper is to commence the study of the minor-monotone floor of $n-k$, which is the minimum of $n-k$ among all graphs of which $G$ is a minor. Accordingly, we prove some results about this minor-monotone floor.

math.CO

Complementary Vanishing Graphs

Given a graph $G$ with vertices $\{v_1,\ldots,v_n\}$, we define $\mathcal{S}(G)$ to be the set of symmetric matrices $A=[a_{i,j}]$ such that for $i\ne j$ we have $a_{i,j}\ne 0$ if and only if $v_iv_j\in E(G)$. Motivated by the Graph Complement Conjecture, we say that a graph $G$ is complementary vanishing if there exist matrices $A \in \mathcal{S}(G)$ and $B \in \mathcal{S}(\overline{G})$ such that $AB=O$. We provide combinatorial conditions for when a graph is or is not complementary vanishing, and we characterize which graphs are complementary vanishing in terms of certain minimal complementary vanishing graphs. In addition to this, we determine which graphs on at most $8$ vertices are complementary vanishing.

math.CO

Properties of a $q$-analogue of zero forcing

Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices unfilled and to change them to filled at minimal cost. In the original variation of the game there were two options. Namely, to fill any one single vertex at the cost of a single token; or if any currently filled vertex has a unique non-filled neighbor, then the neighbor is filled for free. This paper investigates a $q$-analogue of zero forcing which introduces a third option involving an oracle. Basic properties of this game are established including determining all graphs which have minimal cost $1$ or $2$ for all possible $q$, and finding the zero forcing number for all trees when $q=1$.

math.CO

Restricted power domination and zero forcing problems

Power domination in graphs arises from the problem of monitoring an electric power system by placing as few measurement devices in the system as possible. A power dominating set of a graph is a set of vertices that observes every vertex in the graph, following a set of rules for power system monitoring. A practical problem of interest is to determine the minimum number of additional measurement devices needed to monitor a power network when the network is expanded and the existing devices remain in place. In this paper, we study the problem of finding the smallest power dominating set that contains a given set of vertices X. We also study the related problem of finding the smallest zero forcing set that contains a given set of vertices X. The sizes of such sets in a graph G are respectively called the restricted power domination number and restricted zero forcing number of G subject to X. We derive several tight bounds on the restricted power domination and zero forcing numbers of graphs, and relate them to other graph parameters. We also present exact and algorithmic results for computing the restricted power domination number, including integer programs for general graphs and a linear time algorithm for graphs with bounded treewidth. We also use restricted power domination to obtain a parallel algorithm for finding minimum power dominating sets in trees.

math.CO

Rainbow arithmetic progressions

In this paper, we investigate the anti-Ramsey (more precisely, anti-van der Waerden) properties of arithmetic progressions. For positive integers $n$ and $k$, the expression $aw([n],k)$ denotes the smallest number of colors with which the integers $\{1,\ldots,n\}$ can be colored and still guarantee there is a rainbow arithmetic progression of length $k$. We establish that $aw([n],3)=\Theta(\log n)$ and $aw([n],k)=n^{1-o(1)}$ for $k\geq 4$. For positive integers $n$ and $k$, the expression $aw(Z_n,k)$ denotes the smallest number of colors with which elements of the cyclic group of order $n$ can be colored and still guarantee there is a rainbow arithmetic progression of length $k$. In this setting, arithmetic progressions can "wrap around," and $aw(Z_n,3)$ behaves quite differently from $aw([n],3)$, depending on the divisibility of $n$. As shown in [Jungi\'c et al., \textit{Combin. Probab. Comput.}, 2003], $aw(Z_{2^m},3) = 3$ for any positive integer $m$. We establish that $aw(Z_n,3)$ can be computed from knowledge of $aw(Z_p,3)$ for all of the prime factors $p$ of $n$. However, for $k\geq 4$, the behavior is similar to the previous case, that is, $aw(Z_n,k)=n^{1-o(1)}$.

math.CO