Upload folder using huggingface_hub

demo.html

@@ -141,6 +141,15 @@
   .stats { display: flex; gap: 22px; flex-wrap: wrap; font-size: .9rem; margin: 6px 0 2px; }
   .stats .k { color: var(--muted); }
   .stats .v { font-weight: 600; font-variant-numeric: tabular-nums; }
+  figure.treefig {
+    margin: 0 0 16px;
+    background: var(--card);
+    border: 1px solid var(--line);
+    border-radius: 10px;
+    padding: 14px 14px 10px;
+  }
+  figure.treefig img { display: block; width: 100%; height: auto; }
+  figure.treefig figcaption { color: var(--muted); font-size: .8rem; margin-top: 8px; }
   #error {
     display: none;
     background: #f7e8e5;
@@ -187,6 +196,13 @@
 
   <noscript><p style="max-width:720px;margin:24px auto;padding:12px 16px;background:#fef3c7;border:1px solid #d97706;border-radius:8px;font-size:14px">This interactive walkthrough requires JavaScript. The search mechanism it illustrates is documented on the <a href="index.html">project page</a> and in the <a href="https://github.com/SYang2000/ICLR_2026_ToolTree">repository README</a>.</p></noscript>
 
+  <figure class="treefig" id="case3-tree">
+    <img src="static/paper/case3_tree.svg" alt="Full search tree of Case 3: from the user query, ImageDescription, GoogleSearch, and Calculator branches carry pre- and post-evaluation scores; dashed boxes mark pruned candidate drafts, and a bold green path through ImageDescription, GoogleSearch, and Calculator leads to the final answer of 112.5 miles." width="1240" height="1000">
+    <figcaption>Search tree of this case (reconstructed from the logged run): solid boxes are executed tool
+      calls with their pre-/post-evaluation scores, dashed boxes are pruned candidate drafts, and the
+      bold green path is the final highest-reward plan.</figcaption>
+  </figure>
+
   <div id="app" style="display:none">
     <div class="tabs" id="tabs"></div>
 
@@ -396,6 +412,8 @@
     Array.prototype.forEach.call(tabsEl.children, function (b, i) {
       b.className = i === caseIdx ? "active" : "";
     });
+    var treeFig = document.getElementById("case3-tree");
+    if (treeFig) treeFig.style.display = c.id === "case3" ? "" : "none";
     document.getElementById("query").textContent = c.query;
 
     slider.max = steps.length - 1;

index.html

@@ -40,7 +40,6 @@
     <nav class="button-row" aria-label="Paper links">
       <a class="btn" href="https://openreview.net/forum?id=Ef5O9gNNLE" target="_blank" rel="noopener"><svg class="btn-ico" viewBox="0 0 24 24" aria-hidden="true" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><path d="M14 2H6a2 2 0 0 0-2 2v16a2 2 0 0 0 2 2h12a2 2 0 0 0 2-2V8z"/><polyline points="14 2 14 8 20 8"/></svg>Paper</a>
       <a class="btn" href="https://arxiv.org/abs/2603.12740" target="_blank" rel="noopener"><svg class="btn-ico" viewBox="0 0 24 24" aria-hidden="true" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><path d="M14 2H6a2 2 0 0 0-2 2v16a2 2 0 0 0 2 2h12a2 2 0 0 0 2-2V8z"/><polyline points="14 2 14 8 20 8"/></svg>arXiv</a>
-      <a class="btn" href="https://openreview.net/pdf?id=Ef5O9gNNLE" target="_blank" rel="noopener"><svg class="btn-ico" viewBox="0 0 24 24" aria-hidden="true" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><path d="M14 2H6a2 2 0 0 0-2 2v16a2 2 0 0 0 2 2h12a2 2 0 0 0 2-2V8z"/><polyline points="14 2 14 8 20 8"/></svg>PDF</a>
       <a class="btn" href="https://github.com/SYang2000/ICLR_2026_ToolTree" target="_blank" rel="noopener"><svg class="btn-ico" viewBox="0 0 24 24" aria-hidden="true" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><polyline points="16 18 22 12 16 6"/><polyline points="8 6 2 12 8 18"/></svg>Code</a>
       <a class="btn" href="demo.html"><svg class="btn-ico" viewBox="0 0 24 24" aria-hidden="true" fill="currentColor" stroke="none"><polygon points="7 4 20 12 7 20 7 4"/></svg>Demo</a>
       <a class="btn btn-ghost" href="#bibtex"><svg class="btn-ico" viewBox="0 0 24 24" aria-hidden="true" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><path d="M4 19.5A2.5 2.5 0 0 1 6.5 17H20"/><path d="M6.5 2H20v20H6.5A2.5 2.5 0 0 1 4 19.5v-15A2.5 2.5 0 0 1 6.5 2z"/></svg>BibTeX</a>
@@ -112,6 +111,13 @@
         execution, post-evaluation and backward-propagation.</figcaption>
     </figure>
 
+    <figure class="paper-figure reveal">
+      <img src="static/paper/tooltree_search.svg" alt="Schematic tree of tool calls for a flight-search query: from the user query, candidate tool calls branch out with value scores, the low-scoring branches are drawn dashed as pruned, and one bold path leads to a final answer bar.">
+      <figcaption>Illustrative schematic of the search over tool-call trajectories: each node is a candidate
+        tool call scored by the value estimate, low-value branches are pruned, and the highest-reward
+        trajectory is selected as the final plan.</figcaption>
+    </figure>
+
     <div class="mech-grid mech-grid-4 reveal stagger">
       <div class="mech-card">
         <span class="mech-num">1</span>