Original text:
The <del> is a sequence of "passings" the basic model's edges, where </del>  each edge is passed at least one time in total, each edge is passed at most one time after each passing that ends in its start point (with the obvious exception that edges from the <del> root node can be passed once from the start), and </del>  between a passing of an edge from A to B and a later passing from B to C, passings can only be along edges that can be reached from B along the graph, until B is the end of a different passing. <del> The passings starts at the root node, usually defined as the URI from which the document is obtained. </del> For better understanding, think of the structured information model <del> as a sort of tree spanning from the root node, with the oddity that when a node is reached along two different edges (which a normal tree doesn't do), it is up to the builder of the tree whether to describe anything children of the entered node on one parent or on the other parent, on both, or to describe some children at the first and others at a later occasion. </del>  1.1.2. data set, because There may not be a tree that covers the directed graph, or the <del> tree's root may not be the URI from which the document is obtained. </del>  There may be multiple edges into a blank node. In particular, the precise data from one structured information <del> document can only be expressed with the same root node.  However, statements can be added to make a data set that is expressible elsewhere (this document defines the "carries-information-about" relation type leading to the </del>  "http://www.iana.org/assignments/relation/carries-information-about" predicate being usable here), and subsets of the data can be taken and expressed.

Reviewer comments:
Closes: URL This builds on
As a result of , a mismatch in terminology remained: While the information model talks of a "root node", the Document Semantics section still talks of retrieval contexts; these are the same thing, and wording needs to be aligned. (This is especially relevant when converting with RDF; see upcoming commit in ).

Revised text:
The  <ins> is a sequence of "passings" of the basic model's edges, starting at a node identifying the document (its retrieval context, typically URI from which it was obtained) where </ins> each edge is passed at least one time in total, each edge is passed at most one time after each passing that ends in its start point (with the obvious exception that edges from the  <ins> retrieval context can be passed once from the start), and </ins> between a passing of an edge from A to B and a later passing from B to C, passings can only be along edges that can be reached from B along the graph, until B is the end of a different passing.  For better understanding, think of the structured information model  <ins> as a sort of tree spanning from the retrieval context, with the oddity that when a node is reached along two different edges (which a normal tree doesn't do), it is up to the builder of the tree whether to describe anything children of the entered node on one parent or on the other parent, on both, or to describe some children at the first and others at a later occasion. </ins> 1.1.2. data set, because There may not be a tree that covers the directed graph, or the  <ins> tree's root may not be the retrieval context. </ins> There may be multiple edges into a blank node. In particular, the precise data from one structured information  <ins> document can only be expressed with the same retrieval context. However, statements can be added to make a data set that is expressible elsewhere (this document defines the "carries- information-about" relation type leading to the </ins> "http://www.iana.org/assignments/relation/carries-information-about" predicate being usable here), and subsets of the data can be taken and expressed.