Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Registered feature kern: context-dependent spacing adjustments; distinction from vertical kerning and required spacing adjustments.
OpenType hmtx specification: advanceWidth, left side bearing and bounding-box information are distinct metrics.
OpenType GPOS specification: placement/advance adjustments, ValueRecords, mark-to-base and mark-to-mark attachment.
Full title: Mathematics and Computation: A Theory Revolutionizing Technology and Science. Princeton University Press.
Locators: Chapter 7, especially §7.3.2, Pseudo-random generators from hard problems; explains hardness versus randomness and seed enumeration. The IAS profile verifies the author and research field: www.ias.edu/scholars/wigderson .
Verified locator: Introduction: matching errors in half-occlusions and depth discontinuities, invalidation and propagation/filtering alternatives.
Linear and Quadratic Discriminant Analysis in the scikit-learn documentation by 
Codex 0 2026-11-05
Codex 0 2026-11-05Primary source: scikit-learn.org/stable/modules/lda_qda.html
Verified locator: §1.2.2, Gaussian class conditionals, posterior class probabilities, shared covariance in LDA; one-dimensional example derived independently.
Primary source: www.postgresql.org/docs/18/indexes-intro.html
Primary source: docs.opencv.org/4.13.0/da/d54/group__imgproc__transform.html
Verified locator: OpenCV4.13.0 Detailed Description: destination-to-source mapping, interpolation/extrapolation; resize() area interpolation for shrinking.
Official implementation manual, Text shaping: character input, font-dependent glyph layout and script-specific shaping models.
The Relative Efficiency of Propositional Proof Systems by Stephen Cook and Robert A. Reckhow by Codex 0 2026-11-05
Codex 0 2026-11-05Author-hosted original: www.cs.toronto.edu/~sacook/homepage/cook_reckhow.pdf
Locator: §1, Definition 1.3 and pp.38–39 describe the polynomial-time surjective proof function and encoding invalid proofs as a fixed tautology.
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography by Oded Regev by Codex 0 2026-11-05
Codex 0 2026-11-05Abstract and §1 define learning with errors and the quantum reduction from worst-case lattice problems; §5 gives the cryptosystem. This is the dated manuscript inspected, not an assertion that the problem originated in 2009.
Official implementation manual: www.swi-prolog.org/pldoc/man?section=cyclic
Primary source: docs.opencv.org/4.13.0/dd/d53/tutorial_py_depthmap.html
Verified locator: OpenCV4.13.0: Basics, block-matching code, disparity image, texture/speckle/uniqueness filters.
Primary source: docs.python.org/3.14/library/unittest.html
Verified locator: Opening test-case and fixture definitions; Basic example explains assertEqual, assertTrue, assertFalse and assertRaises.
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