Knossos and Ariadne: Benchmarking and Learning Complete Diagram Topology Extraction with Vision-Language Models
Organizations: Rutgers University · Meta · NEC Labs America
Abstract
Structural diagrams are widely used to represent complex systems and relational information across scientific, engineering, procedural, and spatial domains. Recent vision-language models (VLMs) have become increasingly capable of recognizing diagram elements and reasoning about their content, while complete diagram topology extraction remains comparatively underexplored. In this paper, we study diagram-to-graph topology extraction: extracting all diagram entities and the complete relations among them. To enable large-scale supervised training and systematic evaluation of this task, we introduce Knossos, a benchmark of 19,200 diagrams across six diverse domains, with 245,179 nodes and 439,740 edges. Its symbolic generation process provides exact alignment between rendered diagrams and annotations of complete topology, relation types, and connector geometry. To address the modeling challenge of complete topology extraction, we also present Ariadne, a structured framework that decomposes the task into node inventory extraction and source-conditioned edge prediction. Extensive experiments show that training on Knossos substantially improves complete topology extraction in smaller open-source VLMs. Ariadne further improves over one-step extraction under matched supervision, demonstrating the additional benefit of structured decomposition. It achieves the highest average Edge F1 among the evaluated methods on Knossos, while both backbone variants also improve over their unadapted counterparts on the real-world external benchmark. Code and benchmark are available at https://github.com/bangwayne/knossos_Ariadne_Public.
Figures & tables
| Knossos | TopoBench-180 | ||||||||
| Method | Food Web | Network | Workflow | Natural Process | Circuit | Map Route | Avg. | Web-style | Network-style |
| Open-source VLMs | |||||||||
| Qwen3-VL-32B | 28.8 | 48.7 | 76.4 | 65.8 | 36.7 | 71.9 | 54.7 | 54.7 | 52.3 |
| Qwen3-VL-8B | 27.5 | 47.0 | 59.9 | 49.5 | 31.6 | 61.1 | 46.1 | 44.1 | 49.8 |
| GLM-4.6V-Flash | 30.0 | 25.0 | 46.3 | 48.4 | 27.3 | 56.3 | 38.9 | 55.2 | 45.1 |
| MiMo-VL-7B-RL | 24.7 | 37.1 | 54.3 | 40.2 | 26.1 | 61.7 | 40.7 | 42.2 | 46.5 |
| Factor | Subset | GPT-5.6 | Ariadne-Qwen | |
|---|---|---|---|---|
| Difficulty | Simple | 164 | 94.4 | 96.5 |
| Medium | 571 | 84.9 | 94.7 | |
| Difficult | 465 | 76.8 | 89.0 | |
| Direction | Directed | 132 | 86.7 | 89.0 |
| Bidirectional | 37 | 86.7 | 88.6 | |
| Mixed | 31 | 86.2 | 91.0 |
Appendix figures & tables11 assets
Supplementary material from the paper’s appendix.
Appendix
| Domain | Canonical labels | Node instances | Avg./image | Min–max |
|---|---|---|---|---|
| Food Web | 31 | 38,585 | 12.06 | 6–17 |
| Network | 40 | 44,315 | 13.85 | 8–17 |
| Workflow | 60 | 47,746 | 14.92 | 8–20 |
| Natural Process | 59 | 40,527 | 12.66 | 7–18 |
| Circuit | 60 | 45,142 | 14.11 | 7–23 |
| Map Route | 60 | 28,864 | 9.02 | 6–15 |
| Method | Natural Process | Circuit | Map Route |
|---|---|---|---|
| Open-source VLMs | |||
| Qwen3-VL-32B | 49.5 | 30.7 | 69.3 |
| Qwen3-VL-8B | 41.8 | 24.0 | 55.8 |
| GLM-4.6V-Flash | 34.9 | 19.8 | 48.3 |
| MiMo-VL-7B-RL | 34.5 | 21.3 | 57.4 |
| Keye-VL-1.5-8B | 31.6 | 11.5 | 28.2 |
| Method | Box mIoU | [email protected] | Connector L2 |
|---|---|---|---|
| GPT-5.6 | 81.81 | 93.73 | 11.34 |
| Ariadne-GLM | 86.42 | 96.96 | 6.14 |
| Ariadne-Qwen3 | 96.59 | 97.55 | 4.13 |
| Box mIoU | Connector L2 | |||||
|---|---|---|---|---|---|---|
| Domain | GPT-5.6 | Ariadne-GLM | Ariadne-Qwen3 | GPT-5.6 | Ariadne-GLM | Ariadne-Qwen3 |
| Food Web | 88.71 | 86.20 | 96.06 | 17.54 | 6.80 | 5.74 |
| Network | 91.78 | 92.91 | 98.55 | 7.51 | 4.07 | 4.14 |
| Workflow | 95.15 | 84.62 | 97.75 | 6.80 | 4.78 | 2.86 |
| Natural Process | 67.74 | 85.78 | 94.94 | 6.68 | 6.09 | 3.37 |
| Circuit | 69.12 | 82.98 | 93.49 | 20.24 | 8.36 | 4.67 |
| Knossos | TopoBench-180 | ||||||||
| Method | Food Web | Network | Workflow | Natural Process | Circuit | Map Route | Avg. | Web-style | Network-style |
| Open-source VLMs | |||||||||
| Qwen3-VL-32B | 99.3 | 99.5 | 99.4 | 97.9 | 87.8 | 93.9 | 96.3 | 96.3 | 87.5 |
| Qwen3-VL-8B | 99.3 | 99.6 | 99.4 | 96.0 | 86.3 | 90.9 | 95.2 | 95.4 | 88.9 |
| GLM-4.6V-Flash | 98.9 | 98.7 | 99.0 | 98.0 | 85.4 | 90.8 | 95.1 | 94.3 | 86.3 |
| MiMo-VL-7B-RL | 87.0 | 98.6 | 92.3 | 88.7 | 83.3 | 90.4 | 90.0 | 73.7 | 81.2 |
| Backbone | Protocol | Calls/img | API calls/img | S | M | D | Overall | Tokens/img | Cost/img ($) |
|---|---|---|---|---|---|---|---|---|---|
| GLM-4.6V-Flash | One-step | 1.00 | 0.00 | 61.81 | 106.00 | 153.92 | 107.24 | – | 0.000 |
| GLM-4.6V-Flash | Staged | 5.23 | 0.00 | 83.39 | 126.86 | 204.33 | 138.19 | – | 0.000 |
| GPT-5.6 | One-step | 1.00 | 1.00 | 13.89 | 26.98 | 28.90 | 23.26 | 3,843 | 0.052 |
| GPT-5.6 | Staged | 5.23 | 5.23 | 21.99 | 34.55 | 54.81 | 37.12 | 10,747 | 0.147 |
| Stage | Epochs | Steps | Learning rate | Initialization |
|---|---|---|---|---|
| NODE | 1 | 1,125 | Pretrained VLM | |
| EDGE | 1 | 5,960 | Node predictor adapter | |
| TRACE | 1 | 5,801 | Node predictor adapter |
Structured Prediction
Structured prediction maps inputs to outputs whose labels, parts, or decisions must fit together as sequences, sets, graphs, or hierarchies.
See all 30 papers