BaryGraph: Relationships as First-Class Vectors for Cross-Domain Retrieval

BaryGraph is a knowledge graph architecture in which every relationship between two entities is promoted to a first-class document — a BaryEdge — with its own 768-dimensional embedding, its own position in a forest hierarchy, and its own behavior in nearest-neighbor search. Above the leaf levels, BaryEdges themselves recurse into higher-order triads (MetaBary), constructed algebraically without further embedding calls.The architecture's primary design goal is cross-domain relational retrieval: surfacing structural bridges between concepts that flat vector search cannot construct, because the connection lives in a relational neighborhood the embedding model never sees.This pilot report describes BaryGraph and demonstrates the cross-domain claim through five independently-suggested concept queries spanning unrelated domains (trust in distributed systems, octopus arms and engineering sensor networks, collagen folding and linguistics, radioactive decay and language attrition, grief versus depression). Four surface productive cross-domain bridges within a handful of tool calls. The fifth demonstrates the complementary correctness property: the architecture refuses to bridge concepts that the corpus encodes as distinct, matching the actual nosological literature on the queried distinction.The proof-of-concept is instantiated on the kaikki.org English Wiktionary corpus, producing a graph of 6.66 million documents (1.74M sense nodes, 1.44M word nodes, 2.50M leaf-level BaryEdges, and ~989k MetaBary triads spanning levels 13 through 10). Standard semantic benchmarks (SimLex-999, WordSim-353) confirm the underlying substrate behaves coherently: structural metrics derived from shared graph neighborhoods correlate substantially with human similarity judgments (Spearman ρ up to +0.53, p < 10⁻¹⁵), while raw vector cosine of retrieval hits does not (ρ ≈ 0).Language is the test application, not the architectural claim. The same primitive applies to any corpus with structured relations between entities. Companion specification (BaryGraph_Kaikki_PoC_v0_6.md), full pipeline source code, and raw benchmark CSVs are available in the repository. Public MCP server for testing available on request.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-05-14
DOI
https://doi.org/10.5281/zenodo.20186499
Primary Topic
Advanced Graph Neural Networks
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

BaryGraph: Relationships as First-Class Vectors for Cross-Domain Retrieval

Oleksiy Perepelytsya
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Neural Networks
preprint

BaryGraph: Relationships as First-Class Vectors for Cross-Domain Retrieval

Oleksiy Perepelytsya
preprint en

Abstract

BaryGraph is a knowledge graph architecture in which every relationship between two entities is promoted to a first-class document — a BaryEdge — with its own 768-dimensional embedding, its own position in a forest hierarchy, and its own behavior in nearest-neighbor search. Above the leaf levels, BaryEdges themselves recurse into higher-order triads (MetaBary), constructed algebraically without further embedding calls.The architecture's primary design goal is cross-domain relational retrieval: surfacing structural bridges between concepts that flat vector search cannot construct, because the connection lives in a relational neighborhood the embedding model never sees.This pilot report describes BaryGraph and demonstrates the cross-domain claim through five independently-suggested concept queries spanning unrelated domains (trust in distributed systems, octopus arms and engineering sensor networks, collagen folding and linguistics, radioactive decay and language attrition, grief versus depression). Four surface productive cross-domain bridges within a handful of tool calls. The fifth demonstrates the complementary correctness property: the architecture refuses to bridge concepts that the corpus encodes as distinct, matching the actual nosological literature on the queried distinction.The proof-of-concept is instantiated on the kaikki.org English Wiktionary corpus, producing a graph of 6.66 million documents (1.74M sense nodes, 1.44M word nodes, 2.50M leaf-level BaryEdges, and ~989k MetaBary triads spanning levels 13 through 10). Standard semantic benchmarks (SimLex-999, WordSim-353) confirm the underlying substrate behaves coherently: structural metrics derived from shared graph neighborhoods correlate substantially with human similarity judgments (Spearman ρ up to +0.53, p < 10⁻¹⁵), while raw vector cosine of retrieval hits does not (ρ ≈ 0).Language is the test application, not the architectural claim. The same primitive applies to any corpus with structured relations between entities. Companion specification (BaryGraph_Kaikki_PoC_v0_6.md), full pipeline source code, and raw benchmark CSVs are available in the repository. Public MCP server for testing available on request.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

BaryGraph: Relationships as First-Class Vectors for Cross-Domain Retrieval — Oleksiy Perepelytsya · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS