TELEGENT AI
Knowledge Graph Architecture

The Opportunity Graph™
A Living Map of Every Business Problem, Assumption, Opportunity, and Outcome

Most organizations have their data in silos. The Opportunity Graph™ connects everything — business problems, the assumptions that constrain them, the opportunities that dissolve those constraints, the outcomes achieved, and the verified impacts measured — into a single, traversable, continuously learning knowledge structure.

It is the structural memory of the Opportunity Intelligence™ platform. Every discovery, every validation, every capture, and every outcome makes the graph smarter. The graph is the moat.

Graph Database (Neo4j / Amazon Neptune)
|
7 Node Types • 12 Edge Types
|
Self-Improving Graph
|
Multi-Tenant • Cross-Vertical Learning
Node Types

The Seven Node Types That Structure Organizational Knowledge

Every entity in the Opportunity Graph™ is one of seven node types. Each has a defined schema, a confidence score, and a set of valid inbound and outbound edge types. This schema is the graph's grammar — it ensures every connection is meaningful and queryable.

N1
BusinessProblem
Primary Entity

A specific, named business problem that is costing the organization money, time, or opportunity. Problems are the anchor nodes of the graph — every other node type connects back to a problem.

Schema
problemId: UUIDtitle: Stringdescription: Textdomain: Enum[Revenue|Operations|Customer|Market|Capability|Compliance]severity: 1–10annualCost: DecimaldetectedBy: Enum[Scout|Human|System]detectedAt: Timestampstatus: Enum[Active|Addressed|Deprecated]
Graph Connections

INBOUND: DETECTED_BY (Signal), MANIFESTS_AS (Symptom) | OUTBOUND: CONSTRAINED_BY (Assumption), GENERATES (Opportunity), RESOLVED_BY (Outcome)

N2
Assumption
Primary Entity

A belief the organization holds that constrains decision-making. Assumptions are the most dangerous nodes in the graph — when invalidated, they unlock entire subgraphs of new opportunities.

Schema
assumptionId: UUIDstatement: Stringdomain: Enum[Market|Product|Capability|Competitive|Regulatory]certainty: 0–1 (inverse — 1 = completely untested)impactIfWrong: Decimaltestability: 1–10adsScore: 0–100status: Enum[Untested|Testing|Validated|Invalidated]invalidatedAt: Timestamp?
Graph Connections

INBOUND: CONSTRAINS (BusinessProblem) | OUTBOUND: CREATES (FalseDilemma), LIMITS (Opportunity), SUPPORTED_BY (Evidence)

N3
Opportunity
Primary Entity

A specific, dollar-quantified opportunity to create or recover value. Opportunities are the graph's value-bearing nodes — the entire graph exists to generate, validate, and track them.

Schema
opportunityId: UUIDtitle: Stringtype: Enum[Revenue|Cost|Efficiency|Growth|Retention|Capability]estimatedValue: DecimalodsScore: 0–100biiqScore: 0–100ovsScore: 0–100?status: Enum[Detected|Validated|Prioritized|InCapture|Captured|Missed|Abandoned]capturedValue: Decimal?capturedAt: Timestamp?
Graph Connections

INBOUND: GENERATED_BY (BusinessProblem), UNLOCKED_BY (Assumption invalidation), ENABLED_BY (FalseDilemma resolution) | OUTBOUND: HAS_PATH (CapturePath), PRODUCES (Outcome), VERIFIED_BY (Verification)

N4
CapturePath
Primary Entity

A specific strategy for capturing an opportunity. Each opportunity can have multiple capture paths — the graph models each as a separate node so they can be compared, simulated, and selected independently.

Schema
pathId: UUIDdescription: Stringapproach: Enum[Automated|Manual|Hybrid|Partner]expectedValue: DecimalprobabilityOfSuccess: 0–1timeToCapture: Integer (months)apsScore: DecimalresourceRequirement: JSONriskProfile: JSONstatus: Enum[Proposed|Selected|Active|Completed|Abandoned]
Graph Connections

INBOUND: CAPTURES (Opportunity) | OUTBOUND: REQUIRES (Resource), HAS_MILESTONE (Milestone), PRODUCES (Outcome)

N5
Outcome
Primary Entity

A measured result — the actual value realized (or not realized) from capturing an opportunity. Outcomes close the learning loop: they teach the graph which opportunity types, capture paths, and assumptions produced real value.

Schema
outcomeId: UUIDdescription: Stringtype: Enum[Revenue|Cost|Efficiency|Capability|Market|Customer]predictedValue: DecimalactualValue: Decimal?variance: Decimal? (actual − predicted)realizedAt: Timestamp?measurementMethod: String
Graph Connections

INBOUND: PRODUCED_BY (CapturePath), RESOLVES (BusinessProblem) | OUTBOUND: ATTRIBUTED_TO (Impact), UPDATES (Assumption confidence)

N6
Impact
Primary Entity

A statistically verified impact — the gold-standard node. Verified Impacts are what separate the Opportunity Graph™ from a mere database. They are auditable, statistically rigorous measurements that the graph uses to calibrate future predictions.

Schema
impactId: UUIDdimension: Enum[Revenue|Cost|CLV|MarketShare|Capability|Optionality]predictedMagnitude: DecimalverifiedMagnitude: DecimalconfidenceInterval: JSON {low, high}verificationMethod: Enum[A/B|Causal|Counterfactual|Expert|Market]verifiedAt: TimestampisStatisticallySignificant: BooleanpValue: Decimal?
Graph Connections

INBOUND: DERIVED_FROM (Outcome) | OUTBOUND: CALIBRATES (Opportunity scoring), STRENGTHENS (Confidence), PROVES (Assumption validity)

N7
Signal
Primary Entity

Raw or processed data ingested from the organization's signal environment. Signals are the leaf nodes — they feed the graph with new information. Most signals are transient; only those that trigger opportunity detection persist as connected nodes.

Schema
signalId: UUIDsource: String (CRM|Support|Billing|Market|Social|IoT|...)content: Texttype: Enum[Leading|Lagging|Anomaly|Pattern|Trigger]strength: 0–1ingestedAt: TimestampprocessedBy: Enum[Scout|Trust|Manual]relevanceScore: 0–1
Graph Connections

OUTBOUND: DETECTS (BusinessProblem), INDICATES (Opportunity), CORROBORATES (Assumption), CONTRADICTS (Assumption)

Edge Relationships

The Twelve Edge Types That Define Valid Graph Traversal

Edges are not generic "related to" links — each edge type has a defined semantic meaning, a direction, a confidence weight, and validation rules. This strict edge grammar is what makes the graph queryable with precision and enables automated traversal for opportunity discovery.

CONSTRAINS
Assumption → Problem

The assumption limits how the organization can address the problem. Invalidation of the assumption removes the constraint.

Weight: 0.8–1.0M:N
GENERATES
Problem → Opportunity

The problem creates a specific opportunity to recover or create value — the problem is the 'why' behind the opportunity.

Weight: 0.7–1.01:N
UNLOCKED_BY
Assumption → Opportunity

Invalidating this assumption unlocks an opportunity that was previously hidden by the false constraint.

Weight: 0.5–1.0M:N
CREATES
Assumption → FalseDilemma

The assumption is the root cause of a false dilemma — the dilemma exists because the assumption is treated as fact.

Weight: 0.6–1.0M:N
HAS_PATH
Opportunity → CapturePath

This specific capture strategy is a viable approach to converting the opportunity into value.

Weight: 0.5–1.01:N
PRODUCES
CapturePath → Outcome

Executing this capture path produced (or is expected to produce) this specific outcome.

Weight: 0.3–1.01:N
DERIVED_FROM
Outcome → VerifiedImpact

Statistical analysis of this outcome produced a verified, auditable impact measurement.

Weight: 0.8–1.01:N
RESOLVES
Outcome → Problem

The realized outcome addressed (fully or partially) the original business problem.

Weight: 0.5–1.0M:N
CALIBRATES
VerifiedImpact → Opportunity

Verified impact data recalibrates the scoring models — ODS, BIIQ, OVS — making future predictions more accurate.

Weight: 0.7–1.0M:N
DETECTS
Signal → Problem

Signal analysis (Scout™) detected a previously unknown business problem.

Weight: 0.3–1.0M:N
CORROBORATES
Signal → Assumption

New signal data supports the continued validity of an assumption.

Weight: 0.1–0.9M:N
CONTRADICTS
Signal → Assumption

New signal data challenges an assumption — this is the highest-value edge type. Contradiction triggers re-evaluation of every node downstream.

Weight: 0.5–1.0M:N

Edge Validation Rules

Every edge created in the graph MUST pass validation. These rules prevent the graph from accumulating meaningless or incorrect connections.

Edge weight must be > 0. Only meaningful connections persist.
Source and target node types must match the edge type's allowed schema.
CONTRADICTS edges require ≥ 2 corroborating signals before permanent creation.
DERIVED_FROM edges require statistical significance (p < 0.05) on the Impact node.
Duplicate edges between the same two nodes are merged with updated weight.
Edges with weight < 0.1 after two review cycles are deprecated and archived.
CALIBRATES edges from Impacts in different verticals carry a 0.5× cross-vertical discount.
PRODUCES edges from active (not yet completed) CapturePaths have provisional weight 0.3.
Graph Traversal Logic

How the Graph Discovers What You Don't Know to Look For

The graph's value is not just in storing connections — it's in automated traversal that surfaces insights no human would think to query. The traversal engine walks the graph according to defined patterns, scoring each path for relevance and novelty.

Real-time on CONTRADICTS edge creation

Assumption Cascade Traversal

Trigger

A CONTRADICTS edge appears on an Assumption node

Algorithm

BFS from the contradicted assumption, following: Assumption → CREATES → FalseDilemma, Assumption → LIMITS → Opportunity, Opportunity → HAS_PATH → CapturePath. Score each downstream node by how much its expected value changes when the assumption is invalidated.

Output

Assumption Impact Cascade Report — every downstream opportunity and capture path affected by the new evidence.

On every new opportunity creation

Opportunity Pattern Matching

Trigger

A new Opportunity node is created

Algorithm

Extract the opportunity's feature vector (type, domain, value, problem class). Cosine similarity search across all historical Opportunity nodes. Return top-K historical matches with their outcomes and verified impacts attached.

Output

Pattern Match Report — 'This opportunity looks like 3 others that produced $X in verified impact. Here's what worked.'

Daily batch

Problem Cluster Detection

Trigger

Continuous — runs every 24 hours

Algorithm

Community detection (Louvain algorithm) on the BusinessProblem → Opportunity subgraph. Find clusters of problems that co-occur across organizations, share common assumptions, or produce similar opportunity types. Surface clusters that are growing (new signals arriving) or unresolved (many open opportunities, few outcomes).

Output

Problem Cluster Map — groups of related problems, ranked by aggregate TAI™ and resolution velocity.

Weekly batch + triggered on high-confidence Impact creation

Cross-Vertical Transfer

Trigger

A VerifiedImpact node is created with high confidence

Algorithm

From the VerifiedImpact, traverse: Impact → DERIVED_FROM → Outcome → PRODUCED_BY → CapturePath → HAS_PATH → Opportunity → GENERATED_BY → Problem. Extract the pattern: Problem class + Assumption profile + Capture approach → Verified Impact magnitude. Search for structurally similar problem subgraphs in OTHER verticals. Score each match by structural similarity × cross-vertical applicability discount.

Output

Cross-Vertical Opportunity Transfer Report — 'The capture approach that worked for behavioral health credentialing could apply to legal client intake. Estimated impact: $X.'

On every Scout™ Module 1 execution

Assumption-Constraint Discovery

Trigger

On Scout™ Assumption Detection run (Module 1)

Algorithm

For each newly detected Assumption, traverse: Assumption → CONSTRAINS → Problem → GENERATES → Opportunity. Score by: (Assumption certainty⁻¹ × Assumption impactIfWrong) + (Problem severity × number of constrained opportunities). Rank by compound score.

Output

Highest-Leverage Assumptions Report — 'These 5 assumptions, if invalidated, would unlock $XM in constrained opportunity value.'

Every 6 hours

Impact Decay Monitoring

Trigger

Continuous — runs every 6 hours

Algorithm

Monitor all Outcome nodes where: (now − realizedAt) > 90 days and no new VerifiedImpact has been DERIVED_FROM the Outcome. Also monitor Opportunity nodes in 'Captured' status with no linked Outcome. Flag for review — the graph may be missing measurement data.

Output

Measurement Gap Report — opportunities and outcomes that lack verified impact data. Highlights where the learning loop is broken.

Confidence Scoring

The Confidence System That Separates Signal from Noise

Not every node and edge in the graph is equally trustworthy. The Confidence Scoring System™ assigns a dynamic confidence score to every node and edge, continuously updated as new evidence arrives. This is what prevents the graph from becoming a garbage-in-garbage-out machine.

Node Confidence Score (NCS™)

Node Confidence Formula
NCS = (Evidence Quality × 0.35) + (Edge Support × 0.25) + (Recency × 0.15) + (Cross-Source Corroboration × 0.25)
Evidence Quality (0–100)

Graded by evidence type: Verified Impact (+50), Causal Analysis (+40), A/B Test (+35), Cohort Study (+25), Expert Consensus (+15), Anecdotal (+5). Highest grade wins.

Edge Support (0–100)

Number and weight of inbound edges. A node with 10 CORROBORATES edges from diverse signal sources is more trustworthy than one with 1.

Recency (0–100)

Exponential decay function: 100 at creation, halves every 180 days without new corroborating evidence. Nodes with recent activity maintain high recency.

Cross-Source Corroboration (0–100)

Number of independent signal sources that support this node's existence. Cross-source agreement is the strongest confidence signal.

NCS ≥ 80
High Confidence
Use for automated decision-making. No human review required.
NCS 60–79
Medium Confidence
Use for recommendations. Surface with confidence caveat.
NCS 40–59
Low Confidence
Flag for evidence collection. Do not use for automated decisions.
NCS < 40
Unreliable
Quarantine. Require manual review before any downstream use.

Edge Confidence Score (ECS™)

ECS = (Source Node NCS × 0.30) + (Target Node NCS × 0.30) + (Edge Type Specificity × 0.20) + (Cross-Validation Score × 0.20)
Source Node NCSThe confidence of the node the edge originates from.
Target Node NCSThe confidence of the node the edge points to.
Edge Type SpecificityCONTRADICTS and DERIVED_FROM score high (specific semantics). CORROBORATES scores low (generic).
Cross-ValidationDoes this edge make sense given other edges? Graph consistency check via path analysis.
Edge Decay & Pruning

Edges with ECS below 0.25 after 365 days are automatically pruned. CONTRADICTS edges are exempt — they persist even at low confidence because a single weak contradiction signal can be the seed of a major discovery. The graph grows through connection and stays healthy through selective forgetting.

Graph-Powered Discovery

How the Graph Discovers Opportunities You Never Knew Existed

The graph doesn't just store what you know — it discovers what you don't. These six discovery mechanisms run continuously, surfacing opportunities that no human analyst would find through traditional query-based approaches.

Structural Hole Discovery

Core Concept

In social network theory, structural holes are gaps between clusters. In the Opportunity Graph™, a structural hole is a missing connection where a connection should exist — and that absence IS the opportunity.

Mechanism

Run community detection on the BusinessProblem → Opportunity subgraph. Identify pairs of Problem clusters that share similar Assumption profiles and Opportunity types but have NO cross-cluster edges. The missing PRODUCES edges between one cluster's CapturePaths and the other cluster's Outcomes indicate unapplied solutions.

Example

Cluster A (home healthcare) has CapturePaths that successfully resolved scheduling problems. Cluster B (behavioral health) has structurally similar scheduling problems with NO linked CapturePaths. The graph discovers: apply Cluster A's capture approach to Cluster B's problems.

Assumption Invalidation Cascade

Core Concept

When an Assumption node flips from Validated to Invalidated, it doesn't just affect the problems it directly constrained. The graph traces the full downstream cascade to identify every Opportunity that was previously hidden by that now-invalid assumption.

Mechanism

Dijkstra-style weighted traversal from the invalidated Assumption node. Edge weights are inverted (lower = more affected). Traverse Assumption → CONSTRAINS → Problem → GENERATES → Opportunity. Each hop multiplies the impact factor. Generate new Candidate Opportunity nodes for every downstream node that was status=Hidden or had severely discounted ODS scores.

Example

Assumption 'enterprise customers require on-premise deployment' is invalidated by market data. Cascade reveals: 47 previously hidden opportunities across 12 problem domains, total estimated value $18.3M.

Anomalous Path Detection

Core Concept

Most paths through the graph follow predictable patterns. Anomalous paths — where the sequence of node types or edge types deviates from the norm — often indicate overlooked opportunities or flawed mental models.

Mechanism

Train a graph neural network (GNN) on the normalized path distribution of all successful Opportunity → CapturePath → Outcome → VerifiedImpact paths. Flag paths whose embedding distance from the nearest successful path exceeds 2σ. Anomalous paths are surfaced for expert review — they're either errors (and should be pruned) or genius (and should be pursued).

Example

A path where an Opportunity connects directly to VerifiedImpact (skipping CapturePath and Outcome) is anomalous — it means value was realized but the capture mechanism was undocumented. The graph flags this as both a documentation gap AND a potentially novel capture pattern.

Compound Opportunity Synthesis

Core Concept

Some opportunities only exist when two or more others are captured together. The graph identifies these compound opportunities by detecting sets of Opportunity nodes whose combined capture (via connected CapturePaths) unlocks additional value not accounted for in either individually.

Mechanism

Frequent subgraph mining across the Opportunity → HAS_PATH → CapturePath subgraph. Identify pairs (and triples) of Opportunities whose CapturePaths share ≥ 70% of their resource requirements. Merge their Impact Simulations to model the compound effect. If compound TAI > Σ(individual TAI) by > 15%, surface as a Compound Opportunity.

Example

Opportunity A (automate patient intake) + Opportunity B (integrate scheduling API) have 80% overlapping resource requirements. Captured together, they unlock Opportunity C (real-time capacity optimization) which neither enabled alone. Compound TAI: $4.7M vs. $3.1M individually.

Temporal Pattern Recognition

Core Concept

Opportunities have lifecycles. The graph learns the temporal signatures of different opportunity types — when they emerge, how long they persist, and what signals precede them — and uses those signatures to predict opportunities before they fully materialize.

Mechanism

Time-series analysis on Signal → DETECTS → Problem → GENERATES → Opportunity paths. For each opportunity type, identify the leading indicator signal pattern that preceded detection with highest precision. Deploy pattern watchers that trigger pre-opportunity alerts when the leading indicator pattern appears.

Example

Historical analysis shows that 'underbilling opportunity' is preceded 45–60 days by a pattern of: increasing support ticket volume + declining contract amendment frequency + above-average NPS. Pattern watcher triggers when all 3 signals co-occur.

Counterfactual Opportunity Generation

Core Concept

What would the graph look like if a key assumption were false? What if a competitor captured this opportunity first? Counterfactual reasoning generates hypothetical subgraphs, scores them, and surfaces the most valuable 'what if' scenarios as candidate strategies.

Mechanism

For each high-impact Assumption node (ADS ≥ 70), generate a counterfactual subgraph where the assumption is false. Traverse the counterfactual subgraph to enumerate all newly possible Opportunities. Score with Counterfactual BIIQ™ (cBIIQ): BIIQ × P(Assumption is actually false). Rank and surface top-N.

Example

Counterfactual: 'What if our largest competitor exits market segment X?' Generates 23 new opportunity candidates, top-3 cBIIQ scores: 87, 82, 79. Estimated total counterfactual TAI: $31.2M.

Graph Discovery Performance Metrics

412
Opportunities Discovered via Graph
vs. 89 via traditional querying
37
Cross-Vertical Transfers
Capture approaches applied in new verticals
28
Assumption Invalidations
Unlocked 156 previously hidden opportunities
14
Compound Opportunities
Additional $23.7M TAI beyond individual capture
53
Pre-Opportunity Alerts
Opportunities flagged 45+ days before peak
19
Counterfactual Scenarios
Active monitoring on top-5 assumption flips
61
Anomalous Paths Reviewed
12 confirmed novel patterns, 49 pruned
18,347
Graph Node Count
Growing at ~450 nodes/week

The Opportunity Graph™ Is the Structural Moat of the Platform

Every opportunity discovered by Scout™, every assumption validated by the Trust Engine™, every impact verified by IVS™ — feeds into the graph. The graph is the platform's memory, its learning engine, and its primary defensibility. See how the full platform architecture works together.

TELEGENT AI
Business Consultant
TELEGENT
Welcome. I'm your TELEGENT business consultant — I specialize in helping organizations identify where automation can recover revenue, reduce operational drag, and accelerate growth.

Here's what I can do for you in the next few minutes:

Revenue Recovery Assessment — quantify how much revenue you're losing to missed calls, slow response times, and operational gaps
Automation Readiness Diagnostic — evaluate where intelligent automation would deliver the highest ROI in your organization
Solution Recommendation — based on your size, industry, and goals, I'll recommend the right TELEGENT engagement tier
Industry-Specific Analysis — tailored insights for your vertical (healthcare, real estate, legal, professional services, and more)

All conversations are confidential and diagnostic in nature. Where would you like to start?
Confidential Diagnostic No obligation