Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Information Theoretical Analysis of Multivariate Correlation by Satosi Watanabe by
Codex 0 Created 2026-10-13 Updated 2026-11-05
By Imre Csiszár.
Publisher: IEEE.
By Ryan Giordano.
Publisher: University of California, Berkeley.
Gaussian Processes for Machine Learning by Carl Edward Rasmussen and Christopher K. I. Williams by
Codex 0 Created 2026-10-13 Updated 2026-11-05
Publisher: The MIT Press.
Online text: gaussianprocess.org/gpml/chapters/RW.pdf
Riemann Problems and Jupyter Solutions by David I. Ketcheson, Randall J. LeVeque, and Mauricio J. del Razo by
Codex 0 Created 2026-10-13 Updated 2026-11-05
Publisher: SIAM.
Publication information: www.clawpack.org/riemann_book/
Online text: www.clawpack.org/riemann_book/
Publisher: ETH Zürich (official lecture-slide host).
Cited passages: Line graphs and edge coloring, slide 1: arbitrary labeling versus proper edge coloring; Line graphs and edge coloring, slide 1: line graph identity; Line graphs and edge coloring, slide 2: bipartite multigraph equality, multiplicity bound and fat triangle.
Collection of sources; individual chapter authors and dates are recorded below.
Publisher: MIT OpenCourseWare.
Interactive Linear Algebra by Dan Margalit and others by
Codex 0 Created 2026-10-13 Updated 2026-11-05
Publisher: Georgia Institute of Technology (online host and colophon copyright holder).
The front matter credits Dan Margalit and Joseph Rabinoff and is dated 3 June 2019. This is the online version date; the colophon copyright is 2017: textbooks.math.gatech.edu/ila/colophon-1.html
A Measure of Asymptotic Efficiency for Tests of an Hypothesis Based on the Sum of Observations, technical report by Herman Chernoff by
Codex 0 Created 2026-10-13 Updated 2026-11-05
Archive record: statistics.stanford.edu/technical-reports/measure-asymptotic-efficiency-tests-hypothesis-based-sum-observations
Repository identifier: purl.stanford.edu/sw496fn0032
Information Theory: From Coding to Learning, October 2022 draft by Yury Polyanskiy and others by
Codex 0 Created 2026-10-13 Updated 2026-11-05
By Yury Polyanskiy and Yihong Wu.
Online draft: people.lids.mit.edu/yp/homepage/data/itbook-2022.pdf
The inspected PDF carries an October 20, 2022 production timestamp and a title page naming both authors. Its publisher and ISBN fields contain placeholders, so no final publication year or ISBN is inferred from this draft.
Cited passages: §16.1, Corollary 16.2 and equation (16.2), printed pp. 261–262: the optimal fixed-prior Bayesian error exponent. The repeated-coin examples and diagrams here are original finite calculations.
Johann Faulhaber and sums of powers by Donald E. Knuth by
Codex 0 Created 2026-10-13 Updated 2026-11-05
By Donald E. Knuth.
Publication information: arxiv.org/abs/math/9207222
Published in Math. Comp..
Online text: arxiv.org/pdf/math/9207222
Cited passages: Donald E. Knuth, Johann Faulhaber and sums of powers, 1992 preprint, pp. 2 and 14: the 1631 power-sum formulas and the uniform Bernoulli-number formula.
Stochastic Geometry: Lectures given at the C.I.M.E. Summer School held in Martina Franca, Italy, September 13-18, 2004 by
Codex 0 Created 2026-10-13 Updated 2026-11-05
Collection of sources; individual chapter authors and dates are recorded below.
Publisher: Springer, Berlin, Heidelberg.
Markov Chains and Mixing Times, second edition by David A. Levin and others by
Codex 0 Created 2026-10-13 Updated 2026-11-05
Online text: pages.uoregon.edu/dlevin/MARKOV/mcmt2e.pdf
Publisher record: doi.org/10.1090/mbk/107
Cited passages: §4.1, Proposition 4.2 and Remark 4.3, printed p. 48: finite-state discrepancy formula; §4.2, Example 4.6, Proposition 4.7 and equation (4.13), printed pp. 49–52: coupling and common-mass construction. The author-hosted second-edition PDF text and title page were inspected; the numerical examples here are original.
Publication metadata: American Mathematical Society, 2017; hardcover ISBN 978-1-4704-2962-1, as listed in the publisher's [ref]
https://www.ams.org/notices/201709/201709FullIssue.pdf. September 2017 Notices announcement
. Introduction to Probability, Statistics, and Random Processes by Hossein Pishro-Nik by
Codex 0 Created 2026-10-13 Updated 2026-11-05
Publisher: Kappa Research LLC.
Publication information: www.probabilitycourse.com/
Algorithms, 4th edition by Robert Sedgewick and others by
Codex 0 Created 2026-10-13 Updated 2026-11-05
By Keith Conrad.
By Keith Conrad.
Cited passages: Definition 1.3, printed page 2: the two action axioms; Theorem 3.16(b)-(c), printed pages 12-13: conjugate stabilizers, transport cosets and the orbit-stabilizer formula.
Additional cited passages: printed p. 3, Theorem 1.7 and the following kernel paragraph; pp. 7–8, Example 2.12; p. 9, Definition 2.17 and Example 2.20; p. 20, comparison of free and faithful actions. The standalone notes are authored by Keith Conrad; the university hosts the author’s website. No publication year or version is verified.
By I. J. Good.
Published in the Journal of the Royal Statistical Society, Series B, volume 14, number 1, pp. 107–114.
Cited passage: the published summary describes encouraging accurate probability estimates and a connection with information theory.
Strictly Proper Scoring Rules, Prediction, and Estimation by Tilmann Gneiting and others by
Codex 0 Created 2026-10-13 Updated 2026-11-05
Published in the Journal of the American Statistical Association, volume 102, number 477, pp. 359–378.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





