Trace the connection
across domains.
Six-hop graph traversal across all four networks at once. Find how an actor connects to a government through a corporate chain. Trace ownership to its ultimate beneficiary. Most graph databases query one domain — Path Queries spans four, with a manifest on every path.
Preview · switch the query to trace a different cross-domain path, hop by hop.
Questions no single-domain graph can answer.
A graph database queries within one network. The cost of cross-domain questions today is a manual investigation. Path Queries makes them a single call.
Influence → government
Every actor connected within six hops of government:ar-bcra, weighted by influence and filtered to exposure above 0.3.
Board overlap
For twenty portfolio companies, the top board members — and which of them hold positions on related companies.
Ultimate beneficial owner
Trace ownership from one instrument back through every holding company to the people who ultimately control it.
6-hop default depth
Configurable up to 10 hops. Below six, most graphs resolve sub-second.
P95 < 800 ms
Even on six-hop traversal across millions of nodes. Rust plus custom graph indices.
Per-path manifest
Every path returned carries the NodeVersions and edges it used. Auditor-ready by default.
Cross-domain
Traverse actors → companies → governments → instruments in a single query. One graph, four networks.
Weighted & filtered
Weight by influence or exposure; filter by threshold. Paths come back ranked, not raw.
Composable
Feed a Path Query result straight into Drift Alerts or Risk Maps — same ontology, no export.
One call, four networks deep.
The traversal the explorer animates is the traversal this query runs — ranked, filtered, and manifest-signed.
from deino import Client client = Client(api_key="dno_live_...") paths = client.path_queries.trace( source="instrument:arg-2035", target_layer="actor", # ultimate owner max_hops=6, weight_by="influence", filter={"exposure": {"gt": 0.3}}, ) print(paths[0].hops) # [issued by, subsidiary of, controlled by] print(paths[0].manifest) # sig·path·… — every NodeVersion + edge pinned
Every path is a handoff.
A path doesn’t end at a result — it surfaces nodes you then watch, replay, or map, all on the same ontology.
What are Path Queries?
Cross-domain graph traversals across all four ontological networks at once — actors, companies, governments, and instruments. Trace how an actor connects to a government through a corporate chain, or follow ownership to its ultimate beneficiary, with a manifest on every path.
How is it different from a graph database?
A graph database queries within one domain. Path Queries spans four networks in a single call, with paths returned ranked — weighted by influence or exposure and filtered by threshold — instead of raw.
Is Path Queries available now?
It’s a roadmap product planned for the V2 release, with design-partner early access. The V1 products it builds on — Living Map, Drift Alerts, and Backtest Forensics — are live today, and a free tier is active for them.
Path Queries ships in the V2 release. Design partners get early access from Q1 2027 and shape the final traversal API. Join the program →
Shape Path Queries with us.
Founder-led conversations for design partners. A free tier is active today for the V1 products it builds on.