Skip to main content
Bilateral Antitrust Radar evidence routeTwo canonical nodes connect through separately colored declared relationship edges and common evidence nodes.Profile ADeclared edgeCommon nodeDeclared edgeProfile B

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.

Current declared routeSearch enginesDigital gateways1 shortest paths / 0 common neighbors / 1 supporting edges
Comparable nodes5,478canonical nodes
Declared edges19,193auditable links
Relationship layers4kept separate
Inferred endpoint links0from path proximity
Route contractEvery line is declared. Multi-hop proximity never becomes a direct endpoint claim.Evidence standard

Bilateral query

Build an exact profile-to-profile route

Profile A / MarketsU.S. search engine usageLatest HHI / 7,359
9 profiles directly connected to Digital gateways
Profile B / PublicationsFour digital usage systems traced four different structural paths.Exact signals / 12
5 profiles directly connected to Search engines
Relationship familyResearchTopic, question, and issue scope, publication routes, source custody, and contextual references
Declared route sets

Declared bilateral profile

Search engines Digital gateways

Research / 1 hop
Shortest route
1declared hop
Shortest paths
1deterministic routes
Common neighbors
0exact intersections
Packet edges
10 cited sources
Relationship diagnosisWhat the selected graph can and cannot establish
Connection classDirect declaration1 endpoint edge
Neighborhood overlap0.0%0 shared across 14 unique adjacent profiles
Selected-layer degree6 vs 104 neighbor difference
Supporting evidence0 cited sources1 exact packet edges
high0medium0bounded1low0
Profile A / MarketsU.S. search engine usageUnited States / 2026
Latest HHI
7,359
Selected-layer neighbors
6
Total neighbors
21
Latest year
2026
Connection fingerprint
Measurement12
Organization0
Enforcement3
Research6
Products7Industries1Issues1Indicators3Records3Publications5Sources1
Open canonical profile
Declared routes from U.S. search engine usage to Four digital usage systems traced four different structural paths.The primary shortest path is centered. Additional exact common neighbors appear above or below it. Every line is a declared edge and does not imply a direct endpoint relationship.Search enginesMarketsU.S. search engine usage: Latest HHI 7,359Digital gatewaysPublicationsFour digital usage systems traced four different structural paths.: Exact signals 12
MeasurementOrganizationEnforcementResearch
Profile B / PublicationsFour digital usage systems traced four different structural paths.AR-CI-2026-02 / Focused note
Exact signals
12
Selected-layer neighbors
10
Total neighbors
10
Latest year
2026
Connection fingerprint
Measurement0
Organization0
Enforcement0
Research10
Markets4Topics2Sources4
Open canonical profile

Supporting edge ledger

Every bridge remains an inspectable declaration

1 exact edges support the shortest paths and common-neighbor intersections in this layer.

ResearchCovered market profilereport market

AR-CI-2026-02 contains at least one signal whose canonical entity route resolves exactly to U.S. search engine usage; broader topic similarity is not used.

Competition Insight signal routebounded

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.