Bilateral evidence profiles
Relationship studio
Compare two profiles through their documented relationships and shared records. An indirect connection is not evidence of a direct relationship.
Bilateral query
Build an exact profile-to-profile route
Declared bilateral profile
Digital gateways Google Search
All declared links / 2 hops- Shortest route
- 2declared hops
- Shortest paths
- 1deterministic routes
- Common neighbors
- 1exact intersections
- Packet edges
- 21 cited sources
- Bounded markets
- 5
- Selected-layer neighbors
- 8
- Total neighbors
- 8
- Latest year
- 2026
- Latest sourced share
- 85.2%
- Selected-layer neighbors
- 2
- Total neighbors
- 2
- Latest year
- 2026
Supporting edge ledger
Every bridge remains an inspectable declaration
2 exact edges support the shortest paths and common-neighbor intersections in this layer.
Google Search appears in the Search engines source row for 2026 at 85.16%.
U.S. search engine usage is an explicitly curated member of the Digital platform gateways research program while retaining its own product boundary, geography, denominator, and comparison contract.
Bilateral graph contract
A route is not a finding about its endpoints
Each hop keeps its own evidence label, confidence, source custody, and edge-specific limitation.
A bilateral atlas route preserves a sequence of declared edges for navigation and audit. A direct edge, common neighbor, or multi-hop path does not make the endpoints equivalent, establish ownership or control, assign liability, define an antitrust market, make unlike measures comparable, or show causation.
Reusable bilateral packet
Carry the exact route into analysis
JSON preserves endpoints, shortest paths, common neighbors, nodes, and edge metadata. CSV flattens the complete supporting ledger.