--- a/spec/latest/json-ld-api/index.html	Mon Dec 17 14:43:04 2012 +0100
+++ b/spec/latest/json-ld-api/index.html	Mon Dec 17 14:50:48 2012 +0100
@@ -757,6 +757,9 @@
   <p>A <tref>local context</tref> is identified within a <tref>JSON object</tref> having a <code>@context</code>
     property with a <tref>string</tref>, <tref>array</tref> or a <tref>JSON object</tref> value.
     When processing a <tref>local context</tref>, special processing rules apply:</p>
+
+  <p class="issue">This algorithm needs to be reviewed and updated.</p>
+
   <ol class="algorithm">
     <li>Create a new, empty <tref>local context</tref>.</li>
     <li>Let <em>context</em> be the value of <code>@context</code>
@@ -852,6 +855,8 @@
     algorithm are said to be in <tdef>expanded IRI form</tdef>, although this may also include
     named <tref title="blank node">blank nodes</tref>.</p>
 
+  <p class="issue">This algorithm hasn't been updated yet.</p>
+
   <p>The algorithm for generating an IRI is:
     <ol class="algorithm">
       <li>If a <tref>local context</tref> is being processed and the value is in the
@@ -895,6 +900,9 @@
 
 <section>
   <h3>IRI Compaction Algorithm</h3>
+
+  <p class="issue">This algorithm hasn't been updated yet.</p>
+
   <p>The algorithm for generating a <tref>compact IRI</tref> is:
     <ol class="algorithm">
       <li>Create an empty list of terms <em>terms</em> that will be populated with
@@ -969,6 +977,9 @@
   the term having the highest <tref>term rank</tref>.</p>
 <p>Given a <tref>term</tref> <em>term</em>, <em>value</em>, and <tref>active context</tref>
   determine the <tref>term rank</tref> using the following steps:</p>
+
+<p class="issue">This algorithm hasn't been updated yet.</p>
+
 <ol class="algorithm">
   <li>If <em>value</em> is <tref>null</tref>, <tref>term rank</tref> is <code>3</code>.</li>
   <li>Otherwise, if <em>value</em> is a <tref>JSON object</tref> containing only the property <code>@list</code>:
@@ -1028,6 +1039,8 @@
     A value is said to be in <tdef>expanded form</tdef> after
     the application of this algorithm.</p>
 
+  <p class="issue">This algorithm hasn't been updated yet.</p>
+
   <p>The algorithm for expanding a <em>value</em> takes an <tref>active property</tref>
     and <tref>active context</tref>. It is implemented as follows:</p>
   <ol class="algorithm">
@@ -1058,6 +1071,8 @@
     the application of this algorithm on an <tref>expanded value</tref>.
   </p>
 
+  <p class="issue">This algorithm hasn't been updated yet.</p>
+
   <p>The algorithm for compacting an <tref>expanded value</tref> <em>value</em> takes an <tref>active property</tref>
     and <tref>active context</tref>. It is implemented as follows:</p>
   <ol class="algorithm">
@@ -1316,6 +1331,8 @@
     a well-formed JSON-LD document as defined in [[!JSON-LD]]. This removes any existing
     context to allow the given <tref>active context</tref> to be cleanly applied.</p>
 
+  <p class="issue">This algorithm hasn't been updated yet.</p>
+
   <ol class="algorithm">
     <li>If <em>element</em> is an <tref>array</tref>, process each entry in <em>element</em> recursively
       using this algorithm, passing a copy of the <tref>active context</tref> and the <tref>active property</tref>.
@@ -1426,6 +1443,8 @@
       merging all graphs including the default graph (<code>@default</code>). This algorithm expects
       <em>element</em> to be a well-formed JSON-LD document as defined in [[!JSON-LD]].</p>
 
+    <p class="issue">This algorithm hasn't been updated yet.</p>
+
     <ol class="algorithm">
       <li>Expand <em>element</em> according the <a href="#expansion-algorithm">Expansion Algorithm</a>.</li>
       <li>Generate a <em>nodeMap</em> according the <a href="#node-map-generation">Node Map Generation Algorithm</a>.</li>
@@ -1452,6 +1471,8 @@
     <p>The algorithm takes as input the expanded JSON-LD document as <em>element</em>, the initially empty <em>nodeMap</em>,
       <code>@default</code> as <em>graph</em>, <tref>null</tref> as <em>list</em>, and <tref>null</tref> as <em>id</em>.</p>
 
+    <p class="issue">This algorithm hasn't been updated yet.</p>
+
     <ol class="algorithm">
       <li>If <em>element</em> is an array, process each entry in <em>element</em> recursively, using this algorithm
         and return.</li>
@@ -1519,6 +1540,8 @@
     <p>The variable <em>next identifier</em> is initialized to <em>prefix</em> appended with <code>0</code>. The
       default value of <em>prefix</em> is <code>_:t</code>.</p>
 
+    <p class="issue">This algorithm hasn't been updated yet.</p>
+
     <ol class="algorithm">
       <li>If the old identifier is not <tref>null</tref> and is in the <em>identifier map</em>,
         return the mapped identifier.</li>
@@ -1542,6 +1565,8 @@
       required to produce the same type and number of <tref title="quad">quads</tref> but are
       not required to implement the algorithm exactly as described.</p>
 
+    <p class="issue">This algorithm hasn't been updated yet.</p>
+
     <section>
       <h3>Convert to RDF Algorithm</h3>
       <p>
@@ -1664,6 +1689,9 @@
       <p>The algorithm is invoked with an <tref>array</tref> <em>array</em>, the <tref>active property</tref>
         and returns a value to be used as an <tref>active object</tref> in the calling location.</p>
       <div class="note">This algorithm does not support lists containing lists.</div>
+
+      <p class="issue">This algorithm hasn't been updated yet.</p>
+
       <ol class="algorithm">
         <li>
           If <em>array</em> is empty return <code>rdf:nil</code>.
@@ -1708,6 +1736,8 @@
       <p>The conversion algorithm takes a single parameter <em>input</em> in the form of an
         array of <tref>Quad</tref> representations.</p>
 
+      <p class="issue">This algorithm hasn't been updated yet.</p>
+
       <ol class="algorithm">
         <li id="new_graph">Construct <em>defaultGraph</em> as a <tref>JSON object</tref>
           containing <em>nodes</em> and <em>listMap</em>, each an empty <tref>JSON object</tref>.</li>