Ask Concord
Answers from our documentation
Ask anything about Concord. Every answer comes from our actual documentation.
Technical concepts
A graph traversal algorithm that ranks nodes by their importance relative to a chosen seed set. The retrieval primitive in the knowledge graph.
Definition
Personalized PageRank is a variant of the original PageRank algorithm where the random-walk teleport vector concentrates probability on a chosen seed set instead of distributing it uniformly across the graph. The result is a ranking of every node by its importance relative to those seeds. Nodes connected through many high-weight paths from the seeds rank high, distant or weakly-connected nodes rank low. PPR is the retrieval primitive inside Concord by IaxaI's knowledge graph. A user query embeds, dual-path vector search picks candidate phrase and passage nodes above similarity thresholds, those nodes seed a PPR run, and the resulting node weights blend with vector similarity and recency to produce the final retrieval. PPR captures multi-hop reasoning that pure embedding similarity misses. An alert connects to a prior incident through a shared host, which connects to a regulatory control through an evidence chain. The walk finds the path. The score quantifies it.
See also
Knowledge Graph (retrieval)
A dense-sparse graph of entities, events, and triples queried through tiered retrieval with embedding similarity and Personalized PageRank.
Sentence Transformer Embeddings
Dense vectors that turn text into geometry, used for translation alignment, entity resolution, and knowledge-graph retrieval.
Semantic Alert Dedup
Collapses alerts that describe the same incident across different tools into one narrative, using calibrated identity, not string matching.
Calibrated Identity
Entity resolution with a coverage-guaranteed prediction set. Concord tells you when it doesn't know, instead of guessing.
30-minute walkthrough. Your tools. Your tenants. Your audit cycle. We will show you exactly where Concord earns its keep.