papilot 0.0.0-stage → 0.1.1

package/dist/index.html

@@ -0,0 +1,4 @@
+<!doctype html>
+<html lang="en"><head><meta charset="UTF-8"/><meta name="viewport" content="width=device-width, initial-scale=1.0, viewport-fit=cover, interactive-widget=resizes-content"/><meta name="theme-color" content="#ffffff"/><meta name="description" content="Revise LaTeX papers with an agent and review the PDF changes."/><link rel="icon" type="image/png" href="/favicon.png"/><link rel="apple-touch-icon" href="/apple-touch-icon.png"/><title>Papilot</title>  <script type="module" crossorigin src="/assets/index-BhQFCMTx.js"></script>
+  <link rel="stylesheet" crossorigin href="/assets/index-CAV3-87U.css">
+</head><body><div id="root"></div></body></html>

package/examples/papilot-paper/.latex-review.json

@@ -0,0 +1,4 @@
+{
+  "main": "main.tex",
+  "engine": "pdflatex"
+}

package/examples/papilot-paper/appendix/proofs.tex

@@ -0,0 +1,60 @@
+\section{Proofs}
+\label{app:proofs}
+
+\subsection{Expected rounds}
+
+We prove \cref{prop:rounds}. Write $q = 1 - p$. The rounds of different changes are independent, so
+$\Prob(R_{\max} \le r) = \Prob(R \le r)^{m} = (1 - q^{r})^{m}$, and since
+$R_{\max}$ takes values in $\N$,
+\begin{equation}
+  \E[R_{\max}] = \sum_{r \ge 0} \Prob(R_{\max} > r)
+  = \sum_{r \ge 0} \Bigl( 1 - \bigl(1 - q^{r}\bigr)^{m} \Bigr).
+\end{equation}
+By the binomial theorem,
+$1 - (1 - q^{r})^{m} = \sum_{k=1}^{m} (-1)^{k+1} \binom{m}{k} q^{rk}$. The inner
+sum is finite, so the two sums may be exchanged, and
+$\sum_{r \ge 0} q^{rk} = 1 / (1 - q^{k})$ gives \cref{eq:rounds}.
+
+For the asymptotics, $1 - q^{k} = 1 - (1-p)^{k} = kp + O(p^2)$ as $p \to 0$, so
+\begin{equation}
+  \E[R_{\max}] = \frac{1}{p} \sum_{k=1}^{m} \frac{(-1)^{k+1}}{k} \binom{m}{k}
+  + O(1)
+  = \frac{H_m}{p} + O(1),
+\end{equation}
+using the identity $\sum_{k=1}^{m} \frac{(-1)^{k+1}}{k}\binom{m}{k} = H_m$,
+which follows by integrating $\bigl(1 - (1-x)^{m}\bigr)/x
+= \sum_{j=0}^{m-1} (1-x)^{j}$ from $0$ to $1$. \qed
+
+\subsection{Mid-line drift}
+
+We prove \cref{thm:drift}. Let $\gamma = \Cov(\delta_i, \delta_j)$ for $i \ne j$, which does not depend on the
+pair by exchangeability. Since $\sum_{i=1}^{N} \delta_i = 0$,
+\begin{equation}
+  0 = \Var\Bigl(\sum_{i=1}^{N} \delta_i\Bigr) = N v + N(N-1)\, \gamma,
+  \qquad\text{so}\qquad \gamma = -\frac{v}{N-1} .
+\end{equation}
+With $j = k - 1$ terms in $\varepsilon_k$,
+\begin{equation}
+  \Var(\varepsilon_k) = j v + j(j-1)\, \gamma
+  = j v \Bigl(1 - \frac{j - 1}{N - 1}\Bigr)
+  = v\, \frac{j\,(N - j)}{N - 1}
+  = v\, \frac{(k-1)(N-k+1)}{N-1} .
+\end{equation}
+The product $j(N-j)$ is largest at $j = N/2$, where it equals $N^2/4$, and
+$N^2/(4(N-1)) \approx N/4$ for large $N$. \qed
+
+\subsection{Partial commits}
+
+We prove \cref{prop:partial}. Papilot commits $P$ in two steps. First, adding $P$ to the index sets
+$I(\pi) = W(\pi)$ for every $\pi \in P$ that exists on disk and removes from the
+index every $\pi \in P$ that does not, leaving the entries for $\overline{P}$
+unchanged:
+\begin{equation}
+  I_1 = I|_{\overline{P}} \cup W|_{P} .
+\end{equation}
+Second, a commit restricted to $P$ builds its tree from $H$ with the entries
+for $P$ taken from the working tree and ignores the entries of the index for
+$\overline{P}$, which gives $T_c = H|_{\overline{P}} \cup W|_{P}$. It then
+updates the index entries for $P$ and keeps the others, so $I' = I_1$. For a
+rename from $\pi$ to $\pi'$, the entry for $\pi$ is absent from $W$; including
+$\pi$ in $P$ removes it from $T_c$, and including $\pi'$ adds the new path. \qed

package/examples/papilot-paper/appendix/reference.tex

@@ -0,0 +1,54 @@
+\section{Notation and keyboard}
+\label{app:reference}
+
+\subsection{Notation}
+
+\begin{center}
+\small
+\begin{tabular}{@{}lll@{}}
+\toprule
+Symbol & Meaning & Where \\
+\midrule
+$x_k$, $F$ & auxiliary state of the build, one run & \cref{eq:fixed-point} \\
+$T_{rm}$, $T_m$ & text rendering and text matrices & \cref{eq:trm} \\
+$\doc$, $n$ & manuscript source and its length & \cref{sec:model} \\
+$e = (a, b, w)$, $\delta(e)$ & edit replacing $[a, b)$ by $w$, its shift & \cref{eq:apply} \\
+$e \perp e'$ & compatible edits & \cref{eq:compatible} \\
+$\tau(e', e)$ & $e'$ rebased past $e$ & \cref{eq:transform} \\
+$\theta$, $\alpha$ & decision state, action & \cref{eq:round,eq:idempotent} \\
+$p$, $R_{\max}$, $r_{\eta}$ & acceptance probability, rounds, rounds with confidence & \cref{eq:rounds,eq:rounds-confidence} \\
+$\ell$, $k_i$, $\nu$ & edit length, edits per task, clustered fraction & \cref{eq:conflict,eq:clustered} \\
+$T$, $\key(W)$ & snapshot tree, build key & \cref{eq:snapshot,eq:key} \\
+$s$, $V_s$, $R_{\phi}$ & viewer scale, viewport, rotation & \cref{eq:viewport} \\
+$r$, $b(r)$, $d$ & adjustment ratio, badness, demerits & \cref{eq:ratio,eq:badness,eq:demerits} \\
+$\varepsilon_k$, $\sigma$, $\beta_k$ & text layer drift, stretch factor, bias & \cref{eq:drift,eq:bias} \\
+$\mathcal{S}$, $\letters$, $\dist$ & SyncTeX query, letter normalisation, line distance & \cref{sec:notes} \\
+$\epsilon$, $\kappa$, $q$ & effort, tokens per turn, acceptance per turn & \cref{eq:effort-cost} \\
+$c$, $A$, $C(c, A)$ & slots, offered load, waiting probability & \cref{eq:erlang} \\
+$u_w$, $B_w$, $S(t)$ & window utilisation, budget, usage process & \cref{eq:utilisation,eq:compound} \\
+$H$, $I$, $W$, $P$ & Git trees, index, working tree, chosen paths & \cref{eq:partial} \\
+$\anc(X)$ & commits reachable from $X$ & \cref{eq:ahead-behind} \\
+$\chi$, $\mathcal{O}$, $o$ & request token, allowed origins, owner & \cref{eq:allow} \\
+\bottomrule
+\end{tabular}
+\end{center}
+
+\subsection{Keyboard}
+
+\begin{center}
+\small
+\begin{tabular}{@{}ll@{}}
+\toprule
+Key & Action \\
+\midrule
+\texttt{A}, \texttt{R}, \texttt{C} & accept, reject or comment on the current change \\
+\texttt{J}, \texttt{K} & next and previous change \\
+\texttt{N} & next undecided change \\
+\texttt{S} & show the \LaTeX{} source of the current change \\
+$\text{\texttt{Cmd}} + \text{\texttt{F}}$ & find in the PDF \\
+$\text{\texttt{Cmd}} + \text{\texttt{+}}$, $\text{\texttt{Cmd}} + \text{\texttt{-}}$, $\text{\texttt{Cmd}} + \text{\texttt{0}}$ & zoom in, zoom out, fit width \\
+\texttt{Enter}, \texttt{Shift+Enter} & send, new line \\
+\texttt{Esc} & close a menu, cancel a note, stop marking a region \\
+\bottomrule
+\end{tabular}
+\end{center}

package/examples/papilot-paper/main.tex

@@ -0,0 +1,57 @@
+\documentclass[11pt]{article}
+\input{preamble}
+
+\title{Papilot: Reviewable Agent Edits for \LaTeX{} Manuscripts}
+\author{The Papilot Authors}
+\date{}
+
+\begin{document}
+\maketitle
+
+\begin{abstract}
+Papilot is a personal workspace for revising \LaTeX{} papers with an AI agent
+and reviewing every resulting change as a PDF difference before it reaches the
+manuscript. Each editing task runs in an isolated Git worktree, may be driven
+by Codex, Claude or Antigravity, and proceeds in review rounds in which the
+author accepts, rejects or comments on individual changes. This paper describes
+the system through a sequence of small formal models. We define edits and
+review rounds as operators on a document, prove that compatible edits commute
+and can be rebased, and bound the number of rounds a task needs. We estimate
+how often concurrent tasks conflict, both for uniformly placed and for
+clustered edits. We then treat the geometry of the PDF view: the chain of
+matrices from a glyph to a pixel, why a line-wide text layer drifts from the
+printed words, and how per-word runs bound that drift. We show how a mark on
+the page becomes a source location, model agent scheduling as a queue and
+usage limits as a compound Poisson process, and give the index algebra behind
+partial commits. A model-based evaluation tabulates the resulting quantities.
+The paper doubles as Papilot's example manuscript: every equation in it is a
+place to try a review.
+\end{abstract}
+
+\tableofcontents
+\clearpage
+
+\input{sections/01-introduction}
+\input{sections/02-using}
+\input{sections/03-background}
+\input{sections/04-model}
+\input{sections/05-conflicts}
+\input{sections/06-building}
+\input{sections/07-geometry}
+\input{sections/08-notes}
+\input{sections/09-agents}
+\input{sections/10-usage}
+\input{sections/11-git}
+\input{sections/12-security}
+\input{sections/13-evaluation}
+\input{sections/14-related}
+\input{sections/15-conclusion}
+
+\appendix
+\input{appendix/proofs}
+\input{appendix/reference}
+
+\bibliographystyle{plainnat}
+\bibliography{references}
+
+\end{document}

package/examples/papilot-paper/preamble.tex

@@ -0,0 +1,53 @@
+% Packages and notation shared by every chapter.
+\usepackage[margin=1in]{geometry}
+\usepackage[T1]{fontenc}
+\usepackage{lmodern}
+\usepackage{microtype}
+\usepackage{amsmath,amssymb,amsthm,mathtools}
+\usepackage{bm}
+\usepackage{booktabs}
+\usepackage{enumitem}
+\usepackage{caption}
+\usepackage{algorithm}
+\usepackage[noend]{algpseudocode}
+\usepackage{tikz}
+\usetikzlibrary{automata,positioning,arrows.meta,calc,decorations.pathreplacing}
+\usepackage{pgfplots}
+\pgfplotsset{compat=1.18}
+\usepackage[numbers,sort&compress]{natbib}
+\usepackage[colorlinks=true,linkcolor=blue!50!black,citecolor=blue!50!black,urlcolor=blue!50!black]{hyperref}
+\usepackage[nameinlink]{cleveref}
+
+% thmtools lets cleveref name each kind of statement correctly although they
+% share one counter.
+\usepackage{thmtools}
+\declaretheorem[style=plain, numberwithin=section]{theorem}
+\declaretheorem[style=plain, sibling=theorem]{proposition}
+\declaretheorem[style=plain, sibling=theorem]{lemma}
+\declaretheorem[style=plain, sibling=theorem]{corollary}
+\declaretheorem[style=definition, sibling=theorem]{definition}
+\declaretheorem[style=definition, sibling=theorem]{example}
+\declaretheorem[style=definition, sibling=theorem]{assumption}
+\declaretheorem[style=remark, sibling=theorem]{remark}
+\numberwithin{equation}{section}
+
+\newcommand{\R}{\mathbb{R}}
+\newcommand{\N}{\mathbb{N}}
+\newcommand{\Z}{\mathbb{Z}}
+\newcommand{\E}{\mathbb{E}}
+\newcommand{\Prob}{\mathbb{P}}
+\newcommand{\Var}{\operatorname{Var}}
+\newcommand{\Cov}{\operatorname{Cov}}
+\newcommand{\doc}{D}
+\newcommand{\edit}{\Delta}
+\newcommand{\apply}{\oplus}
+\newcommand{\letters}{\lambda}
+\newcommand{\anc}{\operatorname{anc}}
+\newcommand{\ind}{\mathbf{1}}
+\DeclareMathOperator{\key}{key}
+\DeclareMathOperator{\dist}{dist}
+\DeclareMathOperator*{\argmin}{arg\,min}
+\DeclarePairedDelimiter{\abs}{\lvert}{\rvert}
+\DeclarePairedDelimiter{\norm}{\lVert}{\rVert}
+\DeclarePairedDelimiter{\floor}{\lfloor}{\rfloor}
+\DeclarePairedDelimiter{\ceil}{\lceil}{\rceil}

package/examples/papilot-paper/references.bib

@@ -0,0 +1,158 @@
+@article{laurens2008,
+  author  = {J{\'e}r{\^o}me Laurens},
+  title   = {Direct and reverse synchronization with {SyncTeX}},
+  journal = {TUGboat},
+  volume  = {29},
+  number  = {3},
+  pages   = {365--371},
+  year    = {2008}
+}
+
+@article{erlang1917,
+  author  = {A. K. Erlang},
+  title   = {Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges},
+  journal = {Elektroteknikeren},
+  volume  = {13},
+  pages   = {5--13},
+  year    = {1917}
+}
+
+@book{chacon2014,
+  author    = {Scott Chacon and Ben Straub},
+  title     = {Pro Git},
+  edition   = {Second},
+  publisher = {Apress},
+  year      = {2014}
+}
+
+@book{knuth1984,
+  author    = {Donald E. Knuth},
+  title     = {The {\TeX}book},
+  publisher = {Addison-Wesley},
+  year      = {1984}
+}
+
+@article{knuth1981,
+  author  = {Donald E. Knuth and Michael F. Plass},
+  title   = {Breaking paragraphs into lines},
+  journal = {Software: Practice and Experience},
+  volume  = {11},
+  number  = {11},
+  pages   = {1119--1184},
+  year    = {1981}
+}
+
+@book{lamport1994,
+  author    = {Leslie Lamport},
+  title     = {{\LaTeX}: A Document Preparation System},
+  edition   = {Second},
+  publisher = {Addison-Wesley},
+  year      = {1994}
+}
+
+@inproceedings{ellis1989,
+  author    = {C. A. Ellis and S. J. Gibbs},
+  title     = {Concurrency control in groupware systems},
+  booktitle = {Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data},
+  pages     = {399--407},
+  year      = {1989}
+}
+
+@inproceedings{shapiro2011,
+  author    = {Marc Shapiro and Nuno Pregui{\c{c}}a and Carlos Baquero and Marek Zawirski},
+  title     = {Conflict-free replicated data types},
+  booktitle = {Stabilization, Safety, and Security of Distributed Systems (SSS 2011)},
+  series    = {Lecture Notes in Computer Science},
+  volume    = {6976},
+  pages     = {386--400},
+  publisher = {Springer},
+  year      = {2011}
+}
+
+@article{myers1986,
+  author  = {Eugene W. Myers},
+  title   = {An {$O(ND)$} difference algorithm and its variations},
+  journal = {Algorithmica},
+  volume  = {1},
+  number  = {1--4},
+  pages   = {251--266},
+  year    = {1986}
+}
+
+@techreport{hunt1976,
+  author      = {James W. Hunt and M. Douglas McIlroy},
+  title       = {An algorithm for differential file comparison},
+  institution = {Bell Laboratories},
+  type        = {Computing Science Technical Report},
+  number      = {41},
+  year        = {1976}
+}
+
+@article{little1961,
+  author  = {John D. C. Little},
+  title   = {A proof for the queuing formula: {$L = \lambda W$}},
+  journal = {Operations Research},
+  volume  = {9},
+  number  = {3},
+  pages   = {383--387},
+  year    = {1961}
+}
+
+@book{kleinrock1975,
+  author    = {Leonard Kleinrock},
+  title     = {Queueing Systems, Volume 1: Theory},
+  publisher = {Wiley},
+  year      = {1975}
+}
+
+@book{feller1968,
+  author    = {William Feller},
+  title     = {An Introduction to Probability Theory and Its Applications, Volume 1},
+  edition   = {Third},
+  publisher = {Wiley},
+  year      = {1968}
+}
+
+@book{billingsley1999,
+  author    = {Patrick Billingsley},
+  title     = {Convergence of Probability Measures},
+  edition   = {Second},
+  publisher = {Wiley},
+  year      = {1999}
+}
+
+@manual{iso32000,
+  organization = {International Organization for Standardization},
+  title        = {{ISO} 32000-1:2008, Document management --- Portable document format --- Part 1: {PDF} 1.7},
+  year         = {2008}
+}
+
+@inproceedings{barth2008,
+  author    = {Adam Barth and Collin Jackson and John C. Mitchell},
+  title     = {Robust defenses for cross-site request forgery},
+  booktitle = {Proceedings of the 15th ACM Conference on Computer and Communications Security (CCS '08)},
+  pages     = {75--88},
+  year      = {2008}
+}
+
+@misc{latexdiff,
+  author       = {Frederik Tilmann},
+  title        = {latexdiff: Determine and mark up significant differences between {\LaTeX} files},
+  howpublished = {\url{https://ctan.org/pkg/latexdiff}}
+}
+
+@misc{pdfjs,
+  author       = {{Mozilla}},
+  title        = {{PDF.js}: A general-purpose, web standards-based platform for parsing and rendering {PDFs}},
+  howpublished = {\url{https://mozilla.github.io/pdf.js/}}
+}
+
+@article{shannon1951,
+  author  = {Claude E. Shannon},
+  title   = {Prediction and entropy of printed {English}},
+  journal = {Bell System Technical Journal},
+  volume  = {30},
+  number  = {1},
+  pages   = {50--64},
+  year    = {1951}
+}

package/examples/papilot-paper/sections/01-introduction.tex

@@ -0,0 +1,66 @@
+\section{Introduction}
+\label{sec:introduction}
+
+Writing a research paper is a long sequence of small decisions. A sentence is
+shortened, a definition is moved before its first use, a symbol is renamed so
+that it no longer collides with another, a proof gains the step a referee
+asked for. An agent that edits \LaTeX{} can propose many of these decisions
+quickly, but a proposal is only useful when the author can see what it changes
+in the typeset paper, decide, and say why. Papilot is built around that loop.
+
+\subsection{Three commitments}
+
+Papilot organises the loop around three commitments.
+
+\begin{enumerate}[label=(C\arabic*)]
+  \item \emph{Isolation.} Every task edits its own Git worktree, never the
+    manuscript checkout, so that unreviewed text cannot leak into the paper.
+  \item \emph{Typeset review.} Changes are reviewed as differences between two
+    compiled PDFs, with the \LaTeX{} source one click away.
+  \item \emph{Explicit acceptance.} Only accepted changes are merged into the
+    working tree, and every decision can be undone.
+\end{enumerate}
+
+The first commitment is about safety, the second about legibility and the
+third about authority. Together they turn an agent from a co-author that writes
+into the manuscript into an assistant that proposes to it.
+
+\subsection{What this paper does}
+
+The rest of this paper makes the commitments precise and studies their
+consequences with small, explicit models. Our contributions are:
+
+\begin{itemize}
+  \item an algebra of edits and review rounds, with a proof that compatible
+    edits commute and can be rebased onto each other (\cref{sec:model}), and
+    tight bounds on the number of rounds a task needs;
+  \item an estimate of the conflict rate between concurrent tasks under uniform
+    and clustered edits (\cref{sec:conflicts});
+  \item a content-addressed build scheme in which undoing a decision never
+    recompiles (\cref{sec:build});
+  \item a geometric account of the PDF view, explaining why a line-wide text
+    layer drifts from the printed words and proving that per-word runs bound
+    the drift (\cref{sec:geometry});
+  \item an algorithm that turns a mark on the page into source lines, and an
+    analysis of when its matches are unique (\cref{sec:notes});
+  \item queueing and usage models for agents (\cref{sec:agents,sec:usage}),
+    the index algebra behind partial commits (\cref{sec:git}) and a security
+    model (\cref{sec:security});
+  \item a model-based evaluation that tabulates the quantities above
+    (\cref{sec:evaluation}).
+\end{itemize}
+
+\Cref{sec:using} describes Papilot as an author uses it, \cref{sec:background}
+collects the background on \TeX{}, PDF, Git and SyncTeX that the later sections
+rely on, \cref{sec:related} discusses related
+work, and \cref{sec:conclusion} concludes. Longer proofs are in
+\cref{app:proofs}; \cref{app:reference} lists the notation and the keyboard
+shortcuts.
+
+\subsection{A note on this document}
+
+This paper is also Papilot's example manuscript. It is deliberately dense with
+displayed mathematics, theorems and cross-references, because those are the
+places where an agent's edit is easiest to get subtly wrong and a typeset
+review most useful. The reader is invited to start a task against any equation
+and to review the result.

package/examples/papilot-paper/sections/02-using.tex

@@ -0,0 +1,134 @@
+\section{Using Papilot}
+\label{sec:using}
+
+This section describes Papilot as an author meets it. The later sections
+explain why it behaves as it does.
+
+\subsection{Running it}
+
+Papilot needs Node.js~22.22 or later, Git, a \TeX{} installation with
+\texttt{latexmk} and \texttt{synctex}, and a signed-in agent on the host. It is
+installed and started with
+\begin{verbatim}
+npm install -g papilot
+papilot
+\end{verbatim}
+and then opened at \texttt{http://127.0.0.1:7274}. \emph{Add paper} registers a
+\LaTeX{} Git repository on the host; later papers are added and switched from
+the paper menu at the top of the sidebar. A repository must have at least one
+commit and compile with \texttt{latexmk}; a custom root document is named in a
+\texttt{.latex-review.json} file. To try a sample first, \texttt{papilot demo}
+copies this paper into a separate repository and registers it as
+\emph{Papilot paper}, without touching any existing manuscript.
+
+\subsection{A task from start to finish}
+
+\begin{enumerate}
+  \item Select \emph{New task}, describe the revision and press Enter. The first
+    line of the prompt becomes the task's title, and the task runs on the paper
+    selected in the sidebar. Below the prompt, choose the agent, its model and
+    its reasoning effort; Papilot remembers all three for the next task.
+  \item Follow the conversation and answer the agent's questions or permission
+    requests. When both execution slots are busy, further tasks queue
+    (\cref{sec:agents}).
+  \item When the agent finishes, Papilot builds the PDF review automatically.
+    Accept, reject or comment on each change in the typeset review.
+  \item Send the saved comments, or write further instructions in the
+    conversation. Either starts the next round, which carries the review
+    feedback with it (\cref{sec:model}).
+\end{enumerate}
+
+While the agent works, the composer shows a stop button that pauses the task.
+The desktop workspace offers three views, \emph{Review}, \emph{Split} and
+\emph{Chat}, and remembers the choice; on a phone the header switches between
+the review and the chat. The review toolbar shows the round's progress, accepts
+or rejects every undecided change at once, opens the full PDF of the round,
+builds the review again, and opens it in a separate tab. \emph{Accept all} and
+\emph{Reject all} act only on changes not yet decided, and one undo reverses the
+whole batch.
+
+Conversation drafts are saved per task in the browser; Enter sends, Shift+Enter
+adds a line, and an input method's composition is never sent by Enter. Closing
+the browser does not stop a run. After a restart of the host process, turns that
+were in flight are marked interrupted and can be continued, and queued messages
+are kept. If the outcome of a request is uncertain, the task offers
+\emph{Check status}, and further decisions wait until it is resolved.
+
+\subsection{Reading the paper}
+
+\emph{PDF}, under the paper in the sidebar, shows the manuscript as it is on
+disk, including accepted but uncommitted changes (\cref{sec:build}). It behaves
+like a local PDF reader: continuous pages with crisp text at any zoom,
+selectable text, working links and cross-references, and search across the
+whole document.
+\begin{itemize}
+  \item \emph{Contents} lists the PDF's bookmarks, which \texttt{hyperref}
+    writes for every section, highlights the section being read, and jumps to
+    any entry. The same list opens from the toolbar.
+  \item A page number or the arrows change page; the zoom buttons, the zoom
+    menu, the keyboard and a pinch change the zoom, which is remembered.
+  \item Find (Cmd+F) searches every page, with Enter and Shift+Enter stepping
+    through the matches.
+\end{itemize}
+
+\subsection{Notes on the PDF}
+
+To ask for a change directly on the PDF, select text and choose \emph{Add note},
+or mark a region around a figure or an equation, then describe the change. The
+selection follows the printed words exactly (\cref{sec:geometry}), each note is
+settled on the source lines that produced it (\cref{sec:notes}), and every
+pending note is sent to the agent as one task.
+
+\subsection{The Git panel}
+
+Beside the PDF, a small source-control panel shows the branch and how it
+compares with its upstream, the last commit, and the uncommitted changes with
+their line counts. Selecting a file shows its difference. Ticking files,
+writing a message and pressing Enter commits exactly those files as they are on
+disk; fetch, a fast-forward pull and push keep the branch in step with its
+remote (\cref{sec:git}).
+
+\subsection{Agents}
+
+Each task runs on one agent: Codex through its app server, Claude through the
+Claude Agent SDK, or Antigravity through its command line. Every agent uses its
+own login on the host, and an agent that is not installed or signed in is listed
+as unavailable. When an agent reports usage, the new-task page shows each usage
+window with how much is used and when it resets (\cref{sec:usage}).
+
+\subsection{Working from another device}
+
+Papilot binds only to \texttt{127.0.0.1}. To reach it from a phone or another
+computer, it is published on a private Tailscale network, and the server checks
+the host, the browser's origin and the Tailscale identity of every remote
+request (\cref{sec:security}):
+\begin{verbatim}
+export PAPILOT_PUBLIC_ORIGIN=https://your-mac.your-tailnet.ts.net:8443
+export PAPILOT_TAILSCALE_LOGIN=your-tailscale-login
+papilot service install
+tailscale serve --bg --https=8443 http://127.0.0.1:7274
+\end{verbatim}
+A background service starts Papilot after login, restarts it if it exits and
+keeps the computer from sleeping while it runs. Without Tailscale, an SSH
+tunnel serves the same purpose.
+
+\subsection{Configuration}
+
+\begin{center}
+\small
+\begin{tabular}{@{}lp{0.62\linewidth}@{}}
+\toprule
+Variable & Purpose \\
+\midrule
+\texttt{PAPILOT\_PORT} & local HTTP port, $7274$ by default \\
+\texttt{PAPILOT\_DATA} & state and generated example, \texttt{\textasciitilde/.papilot} by default \\
+\texttt{PAPILOT\_CODEX\_BIN} & Codex executable \\
+\texttt{ANTHROPIC\_API\_KEY} & API key for Claude tasks \\
+\texttt{PAPILOT\_AGY\_BIN} & Antigravity command line \\
+\texttt{PAPILOT\_AGY\_PROXY} & HTTP proxy used only for Antigravity \\
+\texttt{PAPILOT\_REVIEW\_ENGINE} & review engine directory \\
+\texttt{PAPILOT\_PUBLIC\_ORIGIN} & exact browser origin for remote access \\
+\texttt{PAPILOT\_TAILSCALE\_LOGIN} & Tailscale login allowed to connect \\
+\bottomrule
+\end{tabular}
+\end{center}