SearcharxivSearch

arXiv subjects

Steve Wilson

Publications and source records attributed to Steve Wilson.

6 recordsLinked to original sources

Incident-Data Robustness Analysis of the OWASP Top 10 for LLM Applications (2026): How a Community-Expert Ranking Holds Up Against a Large-Scale LLM Incident Corpus

The OWASP Top 10 for LLM Applications ranks the risks that a community of security practitioners judges most important. We ask a narrower question: checked against the record of real incidents, does that expert ranking agree with the data? We assembled a large-scale corpus of LLM-security incidents (7,714 snapshotted and 6,639 labeled against the 20-entry taxonomy) drawn from CVE, GHSA, OSV, and AIAAIC, and derived an incident-based ranking with a Bayesian measurement-error model that corrects each category's count for classifier precision and recall. The 2026 candidate list blends the two signals at fixed weights, 0.75 on the expert vote and 0.25 on the data, so the corpus corrects the consensus without overturning it. The agreement between the two rankings is weak: Cohen's $\kappa \approx 0.20$, with a 90% interval that crosses zero. The expert ranking is nonetheless robust. A pre-registered bake-off of four frontier classifiers returns no winner. None beats the incidence floor's balanced accuracy of 0.863. A ground-truth check leaves the floor's ordering (Spearman $\rho = 0.918$ against held-out truth) in place. This is an exploratory analysis by two working-group members, not the official OWASP release, and it does not supersede the official list or process.

cs.CR

Base Graph -- Connection Graph: Dissection and Construction

This paper presents a phenomenon which sometimes occurs in tetravalent bipartite locally dart-transitive graphs, called a Base Graph -- Connection Graph dissection. In this dissection, each white vertex is split into two vertices of valence 2 so that the connected components of the result are isomorphic. Given the Base Graph whose subdivision is isomorphic to each component, and the Connection Graph, which describes how the components overlap, we can, in some cases, provide a construction which can make a graph having such a decomposition. This paper investigates the general phenomenon as well as the special cases in which the connection graph has no more than one edge.

math.CO

Cruciform: Solving Crosswords with Natural Language Processing

Crossword puzzles are popular word games that require not only a large vocabulary, but also a broad knowledge of topics. Answering each clue is a natural language task on its own as many clues contain nuances, puns, or counter-intuitive word definitions. Additionally, it can be extremely difficult to ascertain definitive answers without the constraints of the crossword grid itself. This task is challenging for both humans and computers. We describe here a new crossword solving system, Cruciform. We employ a group of natural language components, each of which returns a list of candidate words with scores when given a clue. These lists are used in conjunction with the fill intersections in the puzzle grid to formulate a constraint satisfaction problem, in a manner similar to the one used in the Dr. Fill system. We describe the results of several of our experiments with the system.

cs.CL

Recipes for Edge-Transitive Tetravalent Graphs

This paper is to accompany the Census of Edge-Transitive Tetravalent Graphs, available at jan.ucc.nau.edu/~swilson/C4FullSite/index.html, which is a collection of all known edge-transitive graphs of valence 4 up to 512 vertices. The Census contains information for each graph. This information includes parameters such as group order, diameter, girth etc., all known constructions, relations to other graphs in the Census and intersting substructures such as colorings, cycle structures, and dissections. We try to present most graphs as members of one or more parameterized families, and one purpose of this paper is to gather together, here in one place, descriptions of each of these families, to show how each is constructed, what the history of each is and how one family is related to another. We also discuss in this paper the theory and techniques behind computer searches leading to many entries in the Census.

math.CO

Flag Bicolorings, Pseudo-Orientations, and Double Covers of Maps

This paper discusses consistent flag bicolorings of maps and maniplexes, in their own right and as generalizations of orientations and pseudo-orientations. Furthermore, a related doubling concept is introduced, and relationships between these ideas are explored.

math.CO