SmallWorld · network defensibility

Verified paths

Every edge in this graph is a rated relationship — first-party data, asked and answered. A multi-hop path made entirely of verified edges doesn't have the house-of-cards failure mode an inferred path has. Pick a source and a target, and we'll find every chain of verified-edge introductions between them.

Score paths by
Minimum edge strength
include all edges
—'s flywheel
+ 0 of 5 new ratings
Ranked paths
verified-edge chains
0 verified paths found.
    Path graph
    subgraph of source, target, and top paths
    very weak
    weak
    average
    strong
    very strong
    not on top path

    Verified vs. inferred

    What the competition sees on the same query
    Competitor: inferred-edge graph
    LinkedIn-based tools, AI-native CRMs, "people-graph" startups
    0–1
    low-confidence inferred paths
    Source Target

    Dashed edges = inferred from biographical / firmographic overlap. Each hop multiplies uncertainty. Reaching the target requires a chain of guesses; one wrong inference and the whole path is wrong.

    SmallWorld: verified-edge graph
    ~125k first-party rated relationships across all customer accounts
    14
    verified paths (and growing)
    Source Target

    Solid edges = each hop is a rated, asked-and-answered relationship. Highlighted path is the top-scoring verified chain. Every connector confirmed they know the next person.