Every Edge But One at Eleven
Artificial Wasteland, 8 October 2026

The graph list, exact embedding certificates, run extracts and independent-check
records are the Artificial Wasteland project's GP-11 computation. A finite
extract is distributed here; the full enumeration and long refutations are not.
No external graph generator or certificate checker is loaded at runtime.

Aidan Globus and Hans Parshall, Small unit-distance graphs in the plane (2019),
arXiv:1905.07829, https://arxiv.org/abs/1905.07829.
The through-nine classification is a mathematical premise. The 74 earlier
graphs are carried by the project's lower-order catalogue. No paper text,
figures or code are reproduced. The arXiv record uses arXiv's non-exclusive
distribution licence, which is not a general reuse licence:
https://arxiv.org/licenses/nonexclusive-distrib/1.0/license.html.

Boris Alexeev, Dustin G. Mixon and Hans Parshall, The Erdos unit distance problem
for small point sets, arXiv:2412.11914v2 (2025),
https://arxiv.org/abs/2412.11914.
The paper is offered under Creative Commons Attribution 4.0 International:
https://creativecommons.org/licenses/by/4.0/.
Its rhombus, triangle and algebraic certificate methods are described in our
own words. No original paper figure is reproduced. The short proof and drawing
modules adapt the project's Every Edge But One modules into this directory.

Peter Engel, Owen Hammond-Lee, Yiheng Su, Daniel Varga and Pal Zsamboki,
Diverse beam search to find densest-known planar unit distance graphs,
arXiv:2406.15317v3 (2025), https://arxiv.org/abs/2406.15317,
https://doi.org/10.1080/10586458.2025.2507956.
Code and dataset reference: https://codeberg.org/zsamboki/dbs-udg.
The source repository's LICENSE is Creative Commons Attribution 4.0
International; its README links the data at
https://figshare.com/s/a7e6426c318e1d550366.
The terms were checked from the retained source repository's LICENSE, whose
desktop path and SHA-256 are in data/provenance.json. The paper's arXiv record
also specifies CC BY 4.0. This page names that dataset as context for the wave;
it redistributes no dataset coordinates, dataset graphs, paper text or code.

OEIS A002218, https://oeis.org/A002218: the count of biconnected graphs.
OEIS A308349, https://oeis.org/A308349: the earlier forbidden-graph sequence.
OEIS content terms: https://oeis.org/wiki/The_OEIS_End-User_License_Agreement.
Only factual counts and links are used here; no OEIS prose is reproduced.

The shared /fonts/fonts.css serves Fraunces (Phaedra Charles and Flavia
Zimbardi, Undercase Type) and Martian Mono (Roman Shamin, Evil Martians).
Both are supplied by the site under the SIL Open Font License 1.1:
https://openfontlicense.org/open-font-license-official-text/.

Extraction uses existing installations of Python, mpmath and NetworkX.
The independent finite-extract verifier uses existing python-flint rational
polynomials and NetworkX. These dependencies are tools, not browser assets.
Their installed distribution notices remain in those environments.