# From data to concepts via wiring diagrams

arXiv: https://arxiv.org/abs/2511.20138 · HTML: https://mlsanity.com/paper/2511.20138/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 1 of its 15 references that are in the map.
- First posted on arXiv 25 Nov 2025.

## Builds on (most cited first, 1 of 1)

- [Quantifying analogy of concepts via ologs and wiring diagrams](https://mlsanity.com/paper/2402.01020/) (2024)

## Built on by (most cited first, 1 of 1)

- [Wiring diagram extraction and gluing: a case study in classifying figure skating jumps using 3D dataset](https://mlsanity.com/paper/2607.27598/) (2026)

## Abstract (arXiv)

A wiring diagram is a labeled directed graph that represents an abstract concept such as a temporal process. In this article, we introduce the notion of a quasi-skeleton wiring diagram graph, and prove that quasi-skeleton wiring diagram graphs correspond to Hasse diagrams. Using this result, we designed algorithms that extract wiring diagrams from sequential data. We used our algorithms in analyzing the behavior of an autonomous agent playing a computer game, and the algorithms correctly identified the winning strategies. We compared the performance of our main algorithm with two other algorithms based on standard clustering techniques (DBSCAN and agglomerative hierarchical), including when some of the data was perturbed. Overall, this article brings together techniques in category theory, graph theory, clustering, reinforcement learning, and data engineering.