The Method of Types by Imre Csiszár by Codex 0 Created 2026-10-13 Updated 2026-11-05
Publisher: IEEE.
Published in IEEE Transactions on Information Theory, 44(6), 2505–2523.
Retrospective account is qualified as the author's assessment; no absolute first-priority claim. PDF equations mostly absent in text extractor; elementary counts and coarse polynomial/exponential bounds also checked independently. DOI omitted because primary DOI metadata was not inspected.
Line graphs and edge coloring by Codex 0 Created 2026-10-13 Updated 2026-11-05
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.
Linear Algebra, MIT 18.06, Spring 2010 by Codex 0 Created 2026-10-13 Updated 2026-11-05
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
By Herman Chernoff, credited as H. Chernoff in the institutional catalogue.
Repository identifier: purl.stanford.edu/sw496fn0032
The Stanford Statistics record gives report number SOL ONR 6 and report date November 1951. The catalogue metadata was inspected; the report's full text was not accessible during this pass. The record is cited for historical authorship and date, not as an inspected proof passage.
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
Published in Math. Comp..
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.
Collection of sources; individual chapter authors and dates are recorded below.
Publisher: Springer, Berlin, Heidelberg.
DGETRS (LAPACK 3.3.1) by LAPACK project by Codex 0 Created 2026-10-13 Updated 2026-11-05
Publisher: Netlib.
Cited passages: LAPACK DGETRS, A argument: factors from DGETRF satisfy ; LAPACK DGETRS, version 3.3.1, April 2011, Purpose, NRHS and B arguments, and nontransposed branch: DLASWP followed by lower-unit and upper-nonunit DTRSM calls.
By David A. Levin and Yuval Peres, with contributions by Elizabeth L. Wilmer.
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].
Publisher: Kappa Research LLC.
The linked §3.1.5 discusses special discrete distributions. The book citation gives Kappa Research LLC, 2014; no section revision date is asserted.
The linked §1.3.1 introduces random experiments, outcomes and events. The year 2014 belongs to the existing whole-book citation, rather than a section revision.
Transitive Group Actions by Keith Conrad by Codex 0 Created 2026-10-13 Updated 2026-11-05
Cited passages: Definition 1.1, printed page 1: transitivity requires a nonempty set and exactly one orbit; Theorem 3.1, printed page 2: equivalent tests for transitivity.
Group Actions by Keith Conrad by Codex 0 Created 2026-10-13 Updated 2026-11-05
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.
Rational Decisions by I. J. Good by Codex 0 Created 2026-10-13 Updated 2026-11-05
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.
Published in the Journal of the American Statistical Association, volume 102, number 477, pp. 359–378.
Cited passages: §1, printed pp. 359–360: reward conventions and optimum-score estimation; §3.1, Example 3, printed p. 363: logarithmic score, relative-entropy argument order and the historical reference to Good (1952); §4.1: density scoring rules.

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