arxiv.org/abs/2611.23233

A Metric for Semantic Graph Matching of No-Code Workflows

The paper defines a semantic graph-matching distance for comparing no-code and agentic workflows as attributed graphs instead of strings. On 4,705 public n8n exports, evaluations showed near-zero mean distance under surface-preserving changes and higher values under major type or subgraph changes.


No comments yet

Be the first to share your thoughts.