diff --git a/index.html b/index.html
index 3dcc0fb..d5e2d6b 100644
--- a/index.html
+++ b/index.html
@@ -3,12 +3,14 @@
   <meta content="text/html; charset=utf-8" http-equiv="Content-Type">
   <meta content="width=device-width, initial-scale=1, shrink-to-fit=no" name="viewport">
   <title>The TREE hypermedia specification</title>
-  <meta content="w3c/CG-DRAFT" name="w3c-status">
+  <meta content="CG-DRAFT" name="w3c-status">
   <link href="https://www.w3.org/StyleSheets/TR/2021/cg-draft" rel="stylesheet">
-  <meta content="Bikeshed version 82ce88815, updated Thu Sep 7 16:33:55 2023 -0700" name="generator">
+  <meta content="Bikeshed version 742f3d674, updated Mon Nov 4 14:56:54 2024 -0800" name="generator">
   <link href="https://w3id.org/tree/specification" rel="canonical">
   <link href="https://www.w3.org/2008/site/images/favicon.ico" rel="icon">
-  <meta content="d527cf688f3626fb173b87bfc602f7c1500fcfeb" name="document-revision">
+  <meta content="c48a5a8ea77b128047a105e080e1fa5c9f166e45" name="revision">
+  <meta content="dark light" name="color-scheme">
+  <link href="https://www.w3.org/StyleSheets/TR/2021/dark.css" media="(prefers-color-scheme: dark)" rel="stylesheet" type="text/css">
 <style>/* Boilerplate: style-autolinks */
 .css.css, .property.property, .descriptor.descriptor {
     color: var(--a-normal-text);
@@ -80,7 +82,6 @@
 }
 </style>
 <style>/* Boilerplate: style-colors */
-
 /* Any --*-text not paired with a --*-bg is assumed to have a transparent bg */
 :root {
     color-scheme: light dark;
@@ -350,7 +351,6 @@
 }
 </style>
 <style>/* Boilerplate: style-selflinks */
-
 :root {
     --selflink-text: white;
     --selflink-bg: gray;
@@ -410,7 +410,6 @@
 dfn > a.self-link::before      { content: "#"; }
 </style>
 <style>/* Boilerplate: style-syntax-highlighting */
-
 code.highlight { padding: .1em; border-radius: .3em; }
 pre.highlight, pre > code.highlight { display: block; padding: 1em; margin: .5em 0; overflow: auto; border-radius: 0; }
 
@@ -468,7 +467,6 @@
 c-[vi] { color: #0077aa } /* Name.Variable.Instance */
 c-[il] { color: #000000 } /* Literal.Number.Integer.Long */
 
-
 @media (prefers-color-scheme: dark) {
     .highlight:not(.idl) { background: rgba(255, 255, 255, .05); }
 
@@ -536,7 +534,7 @@
   <div class="head">
    <p data-fill-with="logo"><a class="logo" href="https://www.w3.org/"> <img alt="W3C" height="48" src="https://www.w3.org/StyleSheets/TR/2021/logos/W3C" width="72"> </a> </p>
    <h1 class="p-name no-ref" id="title">The TREE hypermedia specification</h1>
-   <p id="w3c-state"><a href="https://www.w3.org/standards/types#CG-DRAFT">Draft Community Group Report</a>, <time class="dt-updated" datetime="2024-10-08">8 October 2024</time></p>
+   <p id="w3c-state"><a href="https://www.w3.org/standards/types/#CG-DRAFT">Draft Community Group Report</a>, <time class="dt-updated" datetime="2024-11-21">21 November 2024</time></p>
    <details open>
     <summary>More details about this document</summary>
     <div data-fill-with="spec-metadata">
@@ -560,10 +558,9 @@ <h1 class="p-name no-ref" id="title">The TREE hypermedia specification</h1>
   <div class="p-summary" data-fill-with="abstract">
    <h2 class="no-num no-toc no-ref heading settled" id="abstract"><span class="content">Abstract</span></h2>
    <p>The TREE specification provides instructions for clients to interpret and navigate Web APIs structured as search trees.
-
-	It defines how members (sets of quads) in a dataset can be distributed across multiple pages interlinked through relationships.
-	The specification introduces key concepts such as <code>tree:Collection</code> (a set of members), <code>tree:Node</code> (the pages in the search tree), and <code>tree:Relation</code> (links between nodes).
-	By interpreting such qualified relations and search forms, TREE enables clients to efficiently retrieve their members of interest.</p>
+It defines how members (sets of quads) in a dataset can be distributed across multiple pages interlinked through relationships.
+The specification introduces key concepts such as <code>tree:Collection</code> (a set of members), <code>tree:Node</code> (the pages in the search tree), and <code>tree:Relation</code> (links between nodes).
+By interpreting such qualified relations and search forms, TREE enables clients to efficiently retrieve their members of interest.</p>
   </div>
   <h2 class="no-num no-toc no-ref heading settled" id="sotd"><span class="content">Status of this document</span></h2>
   <div data-fill-with="status">
@@ -639,7 +636,7 @@ <h2 class="no-num no-toc no-ref" id="contents">Table of Contents</h2>
   </nav>
   <main>
    <h2 class="heading settled" data-level="1" id="overview"><span class="secno">1. </span><span class="content">Overview</span><a class="self-link" href="#overview"></a></h2>
-   <p><img alt="An overview of the TREE specification with the TREE collection, a reference to the first focus node of its members, and the relations to other nodes from the current node." src="TREE-overview.svg"></p>
+   <p><img alt="An overview of the TREE specification with the TREE collection, a reference to the first focus node of its members, and the relations to other nodes from the current node." height="500" src="TREE-overview.svg"></p>
    <div class="informative">
      The TREE specification introduces these core concepts: 
     <ul>
@@ -697,8 +694,8 @@ <h2 class="heading settled" data-level="1" id="overview"><span class="secno">1.
 a pagination needs to be created in which an initial set of members can be found through the first <code>tree:Node</code>, 
 and more members can be found by interpreting the TREE hypermedia controls. 
 This is illustrated in the next example:</p>
-   <div class="example" id="example-55033759">
-    <a class="self-link" href="#example-55033759"></a> 
+   <div class="example" id="example-68c0a5eb">
+    <a class="self-link" href="#example-68c0a5eb"></a> 
 <pre class="language-turtle highlight">> HTTP GET <c- nn>https</c-><c- p>:</c->//example<c- p>.</c->org/Node<c- mi>1</c->
 
 <c- nn>ex</c-><c- p>:</c-><c- f>Collection1</c-> <c- b>a</c-> <c- nn>tree</c-><c- p>:</c-><c- f>Collection</c-><c- p>;</c->
@@ -706,20 +703,20 @@ <h2 class="heading settled" data-level="1" id="overview"><span class="secno">1.
             <c- nn>tree</c-><c- p>:</c-><c- f>member</c-> <c- nn>ex</c-><c- p>:</c-><c- f>Subject1</c-><c- p>,</c-> <c- nn>ex</c-><c- p>:</c-><c- f>Subject2</c-> <c- p>.</c->
 
 <c- nn>ex</c-><c- p>:</c-><c- f>Node1</c-> <c- b>a</c-> <c- nn>tree</c-><c- p>:</c-><c- f>Node</c-> <c- p>;</c->
-        <c- nn>tree</c-><c- p>:</c-><c- f>relation</c-> <c- nn>ex</c-><c- p>:</c-><c- f>R1</c-><c- p>,</c-><c- nn>ex</c-><c- p>:</c-><c- f>R2</c-> <c- p>.</c->
+        <c- nn>tree</c-><c- p>:</c-><c- f>relation</c-> <c- nn>ex</c-><c- p>:</c-><c- f>R1</c-><c- p>,</c-><c- nn>ex</c-><c- p>:</c-><c- f>R2</c-><c- p>,</c-> <c- nn>ex</c-><c- p>:</c-><c- f>R3</c-> <c- p>.</c->
 
 <c- nn>ex</c-><c- p>:</c-><c- f>R1</c-> <c- b>a</c-> <c- nn>tree</c-><c- p>:</c-><c- f>GreaterThanOrEqualToRelation</c-> <c- p>;</c->
     <c- nn>tree</c-><c- p>:</c-><c- f>node</c-> <c- nn>ex</c-><c- p>:</c-><c- f>Node3</c-> <c- p>;</c-> <c- c># This is the URL of another page</c->
     <c- nn>tree</c-><c- p>:</c-><c- f>value</c-> <c- mi>3</c-><c- p>;</c->
     <c- nn>tree</c-><c- p>:</c-><c- f>path</c-> <c- nn>ex</c-><c- p>:</c-><c- f>value</c-> <c- p>.</c->
 
-<c- nn>ex</c-><c- p>:</c-><c- f>R1</c-> <c- b>a</c-> <c- nn>tree</c-><c- p>:</c-><c- f>LessThanRelation</c-> <c- p>;</c-> <c- c># This is useful for a client that is looking for a value 10 or greater</c->
+<c- nn>ex</c-><c- p>:</c-><c- f>R2</c-> <c- b>a</c-> <c- nn>tree</c-><c- p>:</c-><c- f>LessThanRelation</c-> <c- p>;</c-> <c- c># This is useful for a client that is looking for a value 10 or greater</c->
     <c- nn>tree</c-><c- p>:</c-><c- f>node</c-> <c- nn>ex</c-><c- p>:</c-><c- f>Node3</c-> <c- p>;</c->
     <c- nn>tree</c-><c- p>:</c-><c- f>value</c-> <c- mi>10</c-><c- p>;</c->
     <c- nn>tree</c-><c- p>:</c-><c- f>remainingItems</c-> <c- mi>7</c-> <c- p>;</c->
     <c- nn>tree</c-><c- p>:</c-><c- f>path</c-> <c- nn>ex</c-><c- p>:</c-><c- f>value</c-> <c- p>.</c->
 
-<c- nn>ex</c-><c- p>:</c-><c- f>R2</c-> <c- b>a</c-> <c- nn>tree</c-><c- p>:</c-><c- f>GreaterThanOrEqualToRelation</c-> <c- p>;</c->
+<c- nn>ex</c-><c- p>:</c-><c- f>R3</c-> <c- b>a</c-> <c- nn>tree</c-><c- p>:</c-><c- f>GreaterThanOrEqualToRelation</c-> <c- p>;</c->
     <c- nn>tree</c-><c- p>:</c-><c- f>node</c-> <c- nn>ex</c-><c- p>:</c-><c- f>Node4</c-> <c- p>;</c->
     <c- nn>tree</c-><c- p>:</c-><c- f>value</c-> <c- mi>10</c-><c- p>;</c->
     <c- nn>tree</c-><c- p>:</c-><c- f>remainingItems</c-> <c- mi>10</c-> <c- p>;</c->
@@ -813,16 +810,16 @@ <h2 class="heading settled" data-level="6" id="relationsubclasses"><span class="
    <div class="example" id="example-2f0c95e2">
     <a class="self-link" href="#example-2f0c95e2"></a> 
 <pre class="language-turtle highlight"><c- g>&lt;></c-> <c- nn>tree</c-><c- p>:</c-><c- f>relation</c-> <c- p>[</c->
-      <c- b>a</c-> <c- nn>tree</c-><c- p>:</c-><c- f>GreaterThanRelation</c-> <c- p>;</c-> <c- c># the type of the relation deciding the operator</c->
+        <c- b>a</c-> <c- nn>tree</c-><c- p>:</c-><c- f>GreaterThanRelation</c-> <c- p>;</c-> <c- c># the type of the relation deciding the operator</c->
         <c- nn>tree</c-><c- p>:</c-><c- f>node</c-> <c- nn>ex</c-><c- p>:</c-><c- f>Node2</c-> <c- p>;</c-> <c- c># for the left-hand: all members from here</c->
         <c- nn>tree</c-><c- p>:</c-><c- f>path</c-> <c- nn>dct</c-><c- p>:</c-><c- f>created</c-> <c- p>;</c-> <c- c># for the left-hand: the path pointing at the term(s) in the member</c->
         <c- nn>tree</c-><c- p>:</c-><c- f>value</c-> <c- s>"2024-12-16T12:00:00Z"</c-><c- p>^^</c-><c- nn>xsd</c-><c- p>:</c-><c- f>dateTime</c-> <c- c># the right-hand</c->
-  <c- p>],[</c->
-    <c- b>a</c-> <c- nn>tree</c-><c- p>:</c-><c- f>SubstringRelation</c-> <c- p>;</c->
-    <c- nn>tree</c-><c- p>:</c-><c- f>node</c-> <c- nn>ex</c-><c- p>:</c-><c- f>Node2</c-> <c- p>;</c->
-    <c- nn>tree</c-><c- p>:</c-><c- f>path</c-> <c- nn>dct</c-><c- p>:</c-><c- f>title</c-> <c- p>;</c->
-    <c- nn>tree</c-><c- p>:</c-><c- f>value</c-> <c- s>"osa"</c->
-  <c- p>]</c-> <c- p>.</c->
+    <c- p>],[</c->
+        <c- b>a</c-> <c- nn>tree</c-><c- p>:</c-><c- f>SubstringRelation</c-> <c- p>;</c->
+        <c- nn>tree</c-><c- p>:</c-><c- f>node</c-> <c- nn>ex</c-><c- p>:</c-><c- f>Node2</c-> <c- p>;</c->
+        <c- nn>tree</c-><c- p>:</c-><c- f>path</c-> <c- nn>dct</c-><c- p>:</c-><c- f>title</c-> <c- p>;</c->
+        <c- nn>tree</c-><c- p>:</c-><c- f>value</c-> <c- s>"osa"</c->
+    <c- p>]</c-> <c- p>.</c->
 </pre>
    </div>
    <div class="informative"> In the example above the subtree reachable from <code>ex:Node2</code> will contain all remaining members that are both created later in time than the given timestamp <em>and</em> will have the provided substring in the title.
@@ -1059,7 +1056,7 @@ <h3 class="no-ref no-num heading settled" id="w3c-conventions"><span class="cont
     like this: </p>
    <p class="note" role="note">Note, this is an informative note.</p>
   </div>
-<script src="https://www.w3.org/scripts/TR/2021/fixup.js"></script>
+  <script src="https://www.w3.org/scripts/TR/2021/fixup.js"></script>
   <h2 class="no-num no-ref heading settled" id="references"><span class="content">References</span><a class="self-link" href="#references"></a></h2>
   <h3 class="no-num no-ref heading settled" id="normative"><span class="content">Normative References</span><a class="self-link" href="#normative"></a></h3>
   <dl>