Official NIST-hosted Chapter 10 slide deck. Slide 10.18, Curvature Check with Center Points, gives the contrast interval using center standard deviation; assumptions and F-statistic derivation are made explicit in the wiki. No individual author/date established.
Author-hosted preprint dated 13 November 2013, title as on this version. Introduction equations (5)–(6): isotonic LSE risk upper bound and flat-signal behavior; Section 4.1, Theorem 4.3: Gaussian local minimax lower bound around uniformly increasing sequences. Later versions use a different title; keep the cited-version identity.
Author companion site identifies the monograph, its nonparametric likelihood motivation and ISBN 1584880716. The normalization, constraint and two-point numerical calculation in the wiki are independent derivations; no inaccessible page locator is claimed.
Official SciPy reference. Notes: all concentration parameters positive, simplex support and multivariate beta normalization. Coordinate-measure qualification and K=3 numerical example independently derived.
Official SciPy user guide. Standardized density, CDF and quantile; restore the arbitrary positive scale. Tail-moment criterion and numerical example independently derived.
Communications in Mathematical Physics 22, 89–103. DOI: doi.org/10.1007/BF01651330 . Publisher abstract: positive association for increasing functions on finite distributive lattices under the mass convexity condition; applications to Ising and random-cluster models. Full PDF access was unavailable; no unverified theorem numbering is supplied.
Electronic Journal of Probability 14, paper 64, 1884–1899. DOI: doi.org/10.1214/EJP.v14-690 . Definitions 1–3 and Theorem 1, especially the additional increment hypothesis in the third conclusion, printed p. 1887. The primary PDF contains a typographical Pacal in its byline; the established Pascal spelling also appears in its correspondence address and publisher book byline.
Author-hosted lecture notes, version 21 December 2016. Section 3.4: Gaussian entropy and energy conventions; Theorem 4.8: T1 and concentration; Theorem 4.15: tensorization mechanism; Theorem 4.20 and Remark 4.25: global one-sided coordinate comparison and lower-tail variance proxy.
Section 2 defines entrywise objective, max-entry constraint, symmetric selection and column linear programs. Positive definiteness is a theorem under assumptions, not a program constraint.
Preprint arXiv:1009.2048, submitted 10 September 2010, revised 12 August 2011. Section 2, equations 2.1–2.3 and Proposition 2.4. The inspected PDF has a regenerated 26 November 2024 header; this is not its original submission date.
Section6.1, printed pp.13–14 and Figure6.2, constructs the trivial bijection and recovers the original map from the vertex bipartition.
Sections1,1.2 and1.3 state the path criterion, blocking by conditioned noncolliders and activation by conditioning on a collider or its descendant.

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