diff --git a/java/server/src/main/java/org/softwareheritage/graph/benchmark/Browsing.java b/java/server/src/main/java/org/softwareheritage/graph/benchmark/Browsing.java
index 1487175..4d284bc 100644
--- a/java/server/src/main/java/org/softwareheritage/graph/benchmark/Browsing.java
+++ b/java/server/src/main/java/org/softwareheritage/graph/benchmark/Browsing.java
@@ -1,47 +1,48 @@
 package org.softwareheritage.graph.benchmark;
 
 import java.io.IOException;
 
 import org.softwareheritage.graph.Endpoint;
 import org.softwareheritage.graph.Graph;
 import org.softwareheritage.graph.Node;
 import org.softwareheritage.graph.benchmark.Common;
 import org.softwareheritage.graph.benchmark.utils.Random;
 
 /**
- * Benchmark Software Heritage browsing use-cases scenarios: <a
- * href="https://docs.softwareheritage.org/devel/swh-graph/use-cases.html">use cases</a>.
+ * Benchmark Software Heritage <a
+ * href="https://docs.softwareheritage.org/devel/swh-graph/use-cases.html#browsing">browsing
+ * use-cases scenarios</a>.
  *
  * @author Thibault Allançon
  * @version 0.0.1
  * @since 0.0.1
  */
 
 public class Browsing {
   /**
    * Main entrypoint.
    *
    * @param args command line arguments
    */
   public static void main(String[] args) throws IOException {
     String path = args[0];
     Graph graph = new Graph(path);
 
     final long seed = 42;
     final int nbNodes = 100_000;
     Random random = new Random(seed);
     long[] dirNodeIds = random.generateNodeIdsOfType(graph, nbNodes, Node.Type.DIR);
     long[] revNodeIds = random.generateNodeIdsOfType(graph, nbNodes, Node.Type.REV);
 
     Endpoint dirEndpoint = new Endpoint(graph, "forward", "dir:cnt,dir:dir");
     Endpoint revEndpoint = new Endpoint(graph, "forward", "rev:rev");
 
     System.out.println("Used " + nbNodes + " random nodes (results are in seconds):");
     System.out.println("\n'ls' use-case");
     Common.timeEndpoint(graph, dirNodeIds, dirEndpoint::neighbors);
     System.out.println("\n'ls -R' use-case");
     Common.timeEndpoint(graph, dirNodeIds, dirEndpoint::visitPaths);
     System.out.println("\n'git log' use-case");
     Common.timeEndpoint(graph, revNodeIds, revEndpoint::visitNodes);
   }
 }
diff --git a/java/server/src/main/java/org/softwareheritage/graph/benchmark/Provenance.java b/java/server/src/main/java/org/softwareheritage/graph/benchmark/Provenance.java
index 087de92..b3404ea 100644
--- a/java/server/src/main/java/org/softwareheritage/graph/benchmark/Provenance.java
+++ b/java/server/src/main/java/org/softwareheritage/graph/benchmark/Provenance.java
@@ -1,53 +1,54 @@
 package org.softwareheritage.graph.benchmark;
 
 import java.io.IOException;
 
 import org.softwareheritage.graph.Endpoint;
 import org.softwareheritage.graph.Graph;
 import org.softwareheritage.graph.benchmark.Common;
 import org.softwareheritage.graph.benchmark.utils.Random;
 
 /**
- * Benchmark Software Heritage provenance use-cases scenarios: <a
- * href="https://docs.softwareheritage.org/devel/swh-graph/use-cases.html">use cases</a>.
+ * Benchmark Software Heritage <a
+ * href="https://docs.softwareheritage.org/devel/swh-graph/use-cases.html#provenance">provenance
+ * use-cases scenarios</a>.
  *
  * @author Thibault Allançon
  * @version 0.0.1
  * @since 0.0.1
  */
 
 public class Provenance {
   /**
    * Main entrypoint.
    *
    * @param args command line arguments
    */
   public static void main(String[] args) throws IOException {
     String path = args[0];
     Graph graph = new Graph(path);
 
     final long seed = 42;
     final int nbNodes = 100_000;
     Random random = new Random(seed);
     long[] nodeIds = random.generateNodeIds(graph, nbNodes);
 
     Endpoint commitProvenanceEndpoint = new Endpoint(graph, "backward", "dir:dir,cnt:dir,dir:rev");
     Endpoint originProvenanceEndpoint = new Endpoint(graph, "backward", "*");
 
     System.out.println("Used " + nbNodes + " random nodes (results are in seconds):");
 
     System.out.println("\n'commit provenance' use-case (using dfs)");
     Common.timeEndpoint(graph, nodeIds, commitProvenanceEndpoint::walk, "rev", "dfs");
     System.out.println("\n'commit provenance' use-case (using bfs)");
     Common.timeEndpoint(graph, nodeIds, commitProvenanceEndpoint::walk, "rev", "bfs");
     System.out.println("\n'complete commit provenance' use-case");
     Common.timeEndpoint(graph, nodeIds, commitProvenanceEndpoint::leaves);
 
     System.out.println("\n'origin provenance' use-case (using dfs)");
     Common.timeEndpoint(graph, nodeIds, originProvenanceEndpoint::walk, "ori", "dfs");
     System.out.println("\n'origin provenance' use-case (using bfs)");
     Common.timeEndpoint(graph, nodeIds, originProvenanceEndpoint::walk, "ori", "bfs");
     System.out.println("\n'complete origin provenance' use-case");
     Common.timeEndpoint(graph, nodeIds, originProvenanceEndpoint::leaves);
   }
 }
diff --git a/java/server/src/main/java/org/softwareheritage/graph/benchmark/Vault.java b/java/server/src/main/java/org/softwareheritage/graph/benchmark/Vault.java
index b95cdef..fd9fbf6 100644
--- a/java/server/src/main/java/org/softwareheritage/graph/benchmark/Vault.java
+++ b/java/server/src/main/java/org/softwareheritage/graph/benchmark/Vault.java
@@ -1,40 +1,41 @@
 package org.softwareheritage.graph.benchmark;
 
 import java.io.IOException;
 
 import org.softwareheritage.graph.Endpoint;
 import org.softwareheritage.graph.Graph;
 import org.softwareheritage.graph.benchmark.Common;
 import org.softwareheritage.graph.benchmark.utils.Random;
 
 /**
- * Benchmark Software Heritage vault use-case scenario: <a
- * href="https://docs.softwareheritage.org/devel/swh-graph/use-cases.html">use cases</a>.
+ * Benchmark Software Heritage <a
+ * href="https://docs.softwareheritage.org/devel/swh-graph/use-cases.html#vault">vault
+ * use-case scenario</a>.
  *
  * @author Thibault Allançon
  * @version 0.0.1
  * @since 0.0.1
  */
 
 public class Vault {
   /**
    * Main entrypoint.
    *
    * @param args command line arguments
    */
   public static void main(String[] args) throws IOException {
     String path = args[0];
     Graph graph = new Graph(path);
 
     final long seed = 42;
     final int nbNodes = 100_000;
     Random random = new Random(seed);
     long[] nodeIds = random.generateNodeIds(graph, nbNodes);
 
     Endpoint endpoint = new Endpoint(graph, "forward", "*");
 
     System.out.println("Used " + nbNodes + " random nodes (results are in seconds):");
     System.out.println("\n'git bundle' use-case");
     Common.timeEndpoint(graph, nodeIds, endpoint::visitNodes);
   }
 }