Antitrust Radar
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 routeMerger ReviewTransportation1 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 / TopicsMerger ReviewPublication memberships / 3
3 profiles directly connected to Transportation
Profile B / IssuesTransportation networksBounded markets / 1
6 profiles directly connected to Merger Review
Relationship familyAll declared linksEvery encoded relationship family
Declared route sets

Declared bilateral profile

Merger Review Transportation

All declared links / 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 9 unique adjacent profiles
Selected-layer degree7 vs 43 neighbor difference
Supporting evidence0 cited sources1 exact packet edges
high0medium0bounded1low0
Profile A / TopicsMerger ReviewAR-T06 / 2 issue programs / 5 evidence lanes
Publication memberships
3
Selected-layer neighbors
7
Total neighbors
7
Latest year
2026
Connection fingerprint
Measurement0
Organization0
Enforcement0
Research7
Issues2Questions2Publications3
Open canonical profile
Declared routes from Merger Review to Transportation networksThe 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.Merger ReviewTopicsMerger Review: Publication memberships 3TransportationIssuesTransportation networks: Bounded markets 1
MeasurementOrganizationEnforcementResearch
Profile B / IssuesTransportation networks1 separately defined market / editorial research program
Bounded markets
1
Selected-layer neighbors
4
Total neighbors
4
Latest year
2026
Connection fingerprint
Measurement0
Organization0
Enforcement0
Research4
Markets1Topics3
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.

ResearchDeclared issue-program membershiptopic issue

Transportation networks is explicitly included in the Merger Review institutional research contract.

Research topic issue contractbounded

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.

JSON comparison/api/public/atlas?left=topic%3Amerger-review&right=issue%3Atransportation-networksCSV edge ledgerExact supporting declarationsSingle-profile atlasReturn to focused neighborhoods
Atlas Relationship Studio | Antitrust Radar