diff --git a/reports/linux_log/LinuxLog.java b/reports/linux_log/LinuxLog.java
new file mode 100644
index 0000000..ab8f0b7
--- /dev/null
+++ b/reports/linux_log/LinuxLog.java
@@ -0,0 +1,62 @@
+package org.softwareheritage.graph;
+
+import java.util.Stack;
+
+import it.unimi.dsi.big.webgraph.LazyLongIterator;
+import it.unimi.dsi.bits.LongArrayBitVector;
+
+import org.softwareheritage.graph.Graph;
+import org.softwareheritage.graph.SwhId;
+import org.softwareheritage.graph.algo.Visit;
+
+public class LinuxLog {
+  private static final String COMMIT_HASH = "f39d7d78b70e0f39facb1e4fab77ad3df5c52a35";
+  private static final long EXPECTED_COUNT = 723640;
+  private static final boolean TRANSPOSED = true;
+
+  public static void main(String[] args) throws Exception {
+    String graphPath = args[0];
+    Graph graph = new Graph(graphPath);
+    SwhId commit = new SwhId(COMMIT_HASH);
+    long startNode = graph.getNode(commit);
+
+    System.out.println("git log " + COMMIT_HASH);
+    System.out.println("Expecting " + EXPECTED_COUNT + " commits");
+
+    long count = countCommits(graph, startNode);
+    if (count != EXPECTED_COUNT) {
+      throw new Exception("Counted " + count + " commits");
+    }
+
+    long startTime = System.nanoTime();
+    Visit visit = new Visit(graph, commit, "rev", "dfs", "backward");
+    long endTime = System.nanoTime();
+    double duration = (double) (endTime - startTime) / 1_000_000_000;
+    System.out.println("Visit done in: " + duration + " seconds");
+  }
+
+  static long countCommits(Graph graph, long startNode) {
+    Stack<Long> stack = new Stack<Long>();
+    LongArrayBitVector visited = LongArrayBitVector.ofLength(graph.getNbNodes());
+    long count = 0;
+
+    stack.push(startNode);
+    visited.set(startNode);
+    while (!stack.empty()) {
+      long currentNode = stack.pop();
+      count++;
+
+      long degree = graph.degree(currentNode, TRANSPOSED);
+      LazyLongIterator revisions = graph.neighbors(currentNode, TRANSPOSED);
+      while (degree-- > 0) {
+        long nextNode = revisions.nextLong();
+        if (!visited.getBoolean(nextNode)) {
+          visited.set(nextNode);
+          stack.push(nextNode);
+        }
+      }
+    }
+
+    return count;
+  }
+}
diff --git a/reports/linux_log/Makefile b/reports/linux_log/Makefile
new file mode 100644
index 0000000..0a484d2
--- /dev/null
+++ b/reports/linux_log/Makefile
@@ -0,0 +1,10 @@
+all: linux_log.pdf
+
+linux_log.pdf: linux_log.tex
+	latexmk -xelatex -shell-escape -pdf $<
+
+.PHONY: clean
+
+clean:
+	rm -rf _minted*
+	latexmk -C
diff --git a/reports/linux_log/linux_log.tex b/reports/linux_log/linux_log.tex
new file mode 100644
index 0000000..0dc950e
--- /dev/null
+++ b/reports/linux_log/linux_log.tex
@@ -0,0 +1,61 @@
+\documentclass[11pt,a4paper]{article}
+
+\usepackage[english]{babel}
+\usepackage[a4paper,left=2cm,right=2cm,top=2.5cm,bottom=2.5cm]{geometry}
+\usepackage{minted}
+
+\title{Google Summer of Code 2019}
+\author{Thibault Allançon}
+
+\begin{document}
+
+\maketitle
+
+Experiment to test edge access time on the compressed graph. The goal was to do
+the equivalent of a \mintinline{text}{git log} operation with a Linux commit on
+the \mintinline{text}{rev_to_rev} compressed dataset.
+
+\section{Environment}
+
+\begin{footnotesize}
+\inputminted{java}{LinuxLog.java}
+\end{footnotesize}
+
+\section{Results}
+
+\begin{small}
+\begin{minted}{text}
+    $ java -cp swh-graph-compression.jar org.softwareheritage.graph.LinuxLog /graph/rev_to_rev
+
+git log f39d7d78b70e0f39facb1e4fab77ad3df5c52a35
+Expecting 723640 commits
+Visit done in: 0.422884286 seconds
+
+    User time (seconds): 123.26
+    System time (seconds): 13.20
+    Percent of CPU this job got: 103%
+    Elapsed (wall clock) time (h:mm:ss or m:ss): 2:11.92
+    Average shared text size (kbytes): 0
+    Average unshared data size (kbytes): 0
+    Average stack size (kbytes): 0
+    Average total size (kbytes): 0
+    Maximum resident set size (kbytes): 15228424
+    Average resident set size (kbytes): 0
+    Major (requiring I/O) page faults: 0
+    Minor (reclaiming a frame) page faults: 46461
+    Voluntary context switches: 13557
+    Involuntary context switches: 574
+    Swaps: 0
+    File system inputs: 0
+    File system outputs: 0
+    Socket messages sent: 0
+    Socket messages received: 0
+    Signals delivered: 0
+    Page size (bytes): 4096
+    Exit status: 0
+\end{minted}
+\end{small}
+
+Edge access time is around 5 $\mu$s.
+
+\end{document}