By Victor Chernozhukov and others.
Version-specific title and byline verified on PDF page 1; arXiv:1608.00060v6 dated 12 December 2017. Cited passages: Section 2.1, Neyman orthogonality; Section 3, Definitions 3.1–3.2, cross-fitting/DML constructions and nuisance-rate conditions; Section 5.1, equation (5.3) and Theorem 5.1, orthogonal average-treatment-effect score and asymptotic inference. The later arXiv v7 changes Structural to Causal in the title; this card refers specifically to v6.
Cited passages: Section 1, Deviance and Estimating phi: unscaled deviance, dispersion normalization and residual-degree moment estimates. Instructor-authored University of Minnesota notes; their opening attribution identifies the summarized portions of Simon N. Wood, Generalized Additive Models, second edition, chapter 3.
Cited passages: Chapter 21, section 21.3, printed pp. 363–365: Gauss–Markov optimality among response-linear unbiased estimators under stated covariance assumptions. The manuscript distinguishes optimal linear prediction from additional Gaussian sampling assumptions.
Cited passages: Section 1, equations (8)–(11), printed pp. 2–4: square-root loss and pivotal score. The inspected version is arXiv:1009.5689v5 (18 December 2011), accompanying the Biometrika paper, DOI 10.1093/biomet/asr043.
Cited passages: Sections 1.3–1.4, printed pp. 6–12: normalized Lasso and square-root Lasso objectives and prediction inequalities. Section 2.4, Theorems 2.4.1–2.4.2, printed pp. 18–19: linear-noise expansion, coefficient-error remainder and Gaussian normalization of de-sparsified Lasso.
Cited passages: Section 6, Theorem 6.1, Lemma 6.6 and Theorem 6.4, printed pp. 23 and 29–31: boundary avoidance below parameter eight versus visiting swallowed points at and above eight. Section 3 gives the reverse-flow derivative method. The inspected version is arXiv:math/0106036v4 (20 January 2004); section 9 records the later proof of trace existence at parameter eight.
Cited passages: Slides 2–9: periodogram definition, interior-frequency Gaussian Fourier coefficients and nonvanishing exponential-limit variance. The course homepage identifies Peter Bartlett as instructor. These slides use cycles-per-observation normalization; the wiki explicitly converts to angular frequency.
Cited passages: Sections 2–3, Theorems 1, 3 and 5 and equations (3.6), (3.13)–(3.15), printed pp. 105–110: Hilbert-space Gaussian mean limits, pooled two-sample covariance and weighted chi-squared norm laws. Independent curves are the special case with no serial covariance. Journal of the Royal Statistical Society Series B 75(1), pp. 103–122, DOI 10.1111/j.1467-9868.2012.01032.x.
Theorems 1–2 construct the maximal stationary law and state contact-process self-duality; the following single-site identity equates equilibrium occupation with finite-seed survival. The page uses the square lattice, a death-rate parameter and birth rates normalized by neighbour count.
The title page gives both authors and 11 March2012. Consulted passage: section6.2, Theorem48, printed p21: continuous kernel on a compact metric space, finite Borel measure of full support, positive-eigenvalue expansion, uniform convergence and pointwise absolute convergence. The surrounding text fixes a positive-definite kernel and chooses continuous representatives of eigenfunctions.
Chapter 2, Principles of Edgeworth Expansion, pages 39–81: cumulant/characteristic-function expansions, smoothness conditions and lattice corrections. The publisher identifies the original 1992 copyright; its 2013 electronic publication is not a new edition. The wiki states a stronger smooth-density sufficient setting and derives its first correction explicitly.
arXiv:2112.01478v2, 1 October 2024. Sections 1.1–1.2 define uniform single-vertex updates, fair rerandomization and the copying kernel. The weighted-Hamming contraction calculation in the wiki is derived explicitly for a finite undirected graph; its time unit is one vertex update, rather than one update per vertex.
Author-hosted primary paper; arXiv:math/0505690 (2005). Section 1.2, Definitions 1.4–1.5 define the variance-normalized spectral profile. Section 2.2, Definition 2.2 and Lemma 2.4 compare it with the conductance profile. Section 1.1 defines stationary reversibility.
Consulted passages: Definition 3.1, Remark 3.2 and Claim 3.2, printed p.28 (measurable-fibre Steiner symmetrization and volume preservation).
The official course page credits the notes to students with editing by Galyna Livshyts.
Consulted passages: slides165–170, finite-discrete-time martingale-measure theorem and one-period convex-hull argument; slides198–200, replication and uniqueness. Title page specifies Autumn term2020. The source treats broader models; the elementary wiki example restricts to a finite state space.
arXiv math/0312099v3, 23 November 2006. Section 2: Hilbert/Dirichlet-space and basis constructions; Section 2.8: circle averages. The wiki explicitly chooses its own 1/(2pi) energy normalization and associated logarithmic Green kernel.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact