--- a/rdf-mt/index.html	Wed Mar 13 00:52:37 2013 -0500
+++ b/rdf-mt/index.html	Wed Mar 13 10:42:29 2013 -0500
@@ -48,9 +48,7 @@
                 company: "Florida IHMC", companyURL: "http://www.ihmc.us/index.php" },
               { name: "Peter F. Patel-Schneider", 
                 company: "Nuance Communications", companyURL: "http://www.nuance.com/" },
-              { name: "David Wood", 
-                company: "3 Round Stones", companyURL: "http://3roundstones.com/",
-note: "Series Editor",  },
+             
           ],
 
           // authors, add as many as you like. 
@@ -191,6 +189,7 @@
   to be <dfn>equivalent</dfn>.  Equivalent graphs are mutual instances with an invertible instance 
   mapping. As blank nodes have no particular identity beyond their location in a graph, we treat such equivalent graphs as identical.</p>
 
+<p class="issue">The following definitions of blank node scope, scoped graph and complete graph, and the modified definition of merging, are at risk, and at the time of writing (13 march) have not yet been aligned with Concepts. </p>
 <p>Blank nodes may be identified in a surface (document) syntax for RDF using blank node identifiers. Each surface syntax MUST specify an unambiguous notion of the <dfn>scope</dfn> of such identifiers, such that any graph defined by this syntax will be inside a single scope. Two graphs not in the same scope do not share any blank nodes. Each combination of a blank node identifier and a surrounding scope is understood to define a unique blank node, local to the graphs described by the surface syntax. A blank node can occur in only one scope. The same blank node identifier used in different scopes identifies a different blank node in each scope in which it occurs. Scope boundaries are defined by the surface syntax used to encode RDF. For example, in RDF/XML [[!RDF-SYNTAX-GRAMMAR]] and NTriples [[!RDF-TESTCASES]], the scope is defined by the document. In TriG, [[a trig reference]] a syntax for RDF datastores, the scope is the entire datastore. </p>
 
 <p>The set of all triples in a given scope is an RDF graph, called a <dfn>scoped graph</dfn>. (The scoped graph may be an abstraction, e.g. for a dataset it is the set of all triples which occur in any graph in the dataset, which might not be represented explicitly in the dataset itself.) Every RDF graph described by a surface syntax for RDF must be a subgraph of a scoped graph. </p>
@@ -363,6 +362,8 @@
 <p><a name="mergelem" id="mergelem"><strong>Merging lemma.</strong></a> The merge 
   of a set S of complete RDF graphs is entailed by S, and entails every member of S. <a href="#mergelemprf" class="termref">[Proof]</a></p>
 
+<p class="issue">the definition of complete graph, and the status of the following counterexample, are currently (13 March) under discussion.</p>
+
 <p>The merging lemma does not hold for incomplete graphs. For example, consider the graph</p>
 <p>
 <code>:a :p _:x . <br/>