anchor.diff:  }
   ----
   
  -In this result set the node field holds the type of log events that occurred within the
  +In this result set the `node` field holds the type of log events that occurred within the
   same ten second windows as the root events. Notice that the event types include:
   query, admin, update and error. The `count(+++*+++)` shows the degree centrality of the different
   log event types.
   
  -Notice that there is one error event within the same ten second windows of the slow query events.
  +Notice that there is only one *error* event within the same ten second windows of the slow query events.
   
   === Window Parameter
   
   For event correlation and root cause analysis it's not enough to find events that occur
  -within the same ten second root event windows. What's needed is to find events that occur
  -within a window of time *prior to each root event window*. The window parameter allows you to
  +within the *same* ten second root event windows. What's needed is to find events that occur
  +within a window of time *prior to each root event*. The `window` parameter allows you to
   specify this prior window of time as part of the query. The window parameter is an integer
   which specifies the number of ten second time windows, prior to each root event window,
   to include in the graph walk.
  
positive.code: ----
  === Temporal Bipartite Subgraphs
  
  Once we've identified a set of root event windows it's easy to perform a graph query that creates a
  bipartite graph of the log events that occurred within the same ten second windows.
  With Solr logs there is a field called `type_s` which is the type of log event.
  
  In order to see what log events happened in the same ten second window of our root events we can "walk" the ten second windows and gather the type_s field.
  
  [source,text]
  ----
  
negative.code: 
  Log records and other data indexed in Solr have connections between them that can be seen as a distributed graph.
  Graph expressions provide a mechanism for identifying root nodes in the graph and walking their connections.
  The general goal of the graph walk is to materialize a specific *subgraph* and perform *link analysis* to understand
  the connections between nodes.
  
  In the next few sections below we'll review the graph theory behind Solr's graph expressions.
  