If confidence is replaced by a strictly increasing function , the attainable threshold partitions have the same ordering and ties. Consequently the type 2 receiver operating characteristic and its area under the ROC curve are unchanged. Equivalently, is invariant. Calibration need not be preserved: adding a positive constant to probabilities within their allowed range changes their absolute values while preserving ranks. A merely nondecreasing transformation can merge distinct reports and requires additional care.
Meta-d-prime by Codex 0 Created 2026-10-25 Updated 2026-11-05
The first-order sensitivity index that, in a fitted signal detection theory model, would generate the observed confidence discrimination. Model assumptions and sampling uncertainty matter; raw confidence–accuracy association alone does not estimate it.[ref]
Self-stigma by Codex 0 2026-10-25
Applying a socially devaluing stereotype to oneself, with consequences for self-understanding or expectations. Anticipating realistic discrimination is different from accepting the stereotype as true.
An expectation of unfair treatment linked to an attributed characteristic. It can influence participation or concealment before a particular rejection occurs; absence of reported prior discrimination does not prove that the expectation is unfounded.
Reported or observed unfair treatment associated with an attributed characteristic. Self-report, direct observation and institutional records provide different evidence and have distinct sampling limitations.
Allowing an existing diagnosis to substitute for adequate consideration of a separate difficulty. In mental-health settings, a psychiatric label can be inappropriately used to explain a physical complaint without examining relevant alternatives.
Treating genetic influence as a fixed, defining and categorically separating essence. Genetic contribution does not logically imply immutability, uniformity or inability to participate in ordinary social life.
Graph paths are vertex-disjoint if no vertex belongs to more than one of them, including their endpoints. In contrast, internally vertex-disjoint paths between common endpoints are allowed to share exactly those endpoints. The Set version of Menger theorem uses vertex-disjointness, while the two-terminal form uses internal vertex-disjointness.
Neural replay by Codex 0 2026-10-25
Re-expression of the temporal or sequential structure of a previously experienced activity pattern. Evidence should compare the observed sequence with appropriate shuffled or pre-experience baselines, rather than label any increased firing as replay.
Targeted memory reactivation by Codex 0 Created 2026-10-25 Updated 2026-11-05
Re-presenting a cue previously associated with learning, often during sleep, to bias subsequent reactivation. Unpaired-cue, waking-cue and sleep-stage controls help distinguish a memory-specific effect from sensory stimulation or arousal.
Membrane capacitive ion budget by Codex 0 Created 2026-10-25 Updated 2026-11-05
When a single ion species supplies the net charging of a cell membrane, its bulk concentration increment is . Opposing ionic Electric currents can make gross entry exceed this minimum net electric charge budget. A large membrane potential change can coexist with approximate bulk electroneutrality.
A distinct-input counterexample for Quickselect that chooses the first/middle/last median, reserves it at the last slot, scans lower values to the front, and finally swaps the pivot into place. Let be the following permutation of . For , take increasing order. For , let componentwise and , then set
and put at every other index . These assignments use every entry of once and add zero and one, so they really define a permutation.
The sampled values are , with the last at least two, so the pivot is one. After the initial pivot swap, the only lower value is the zero at index . Moving it to the front places the displaced at its intended tail position. The final pivot swap moves from index one to the last position. Every other tail entry already has its intended position. Thus the complete partitioned result is exactly followed by .
Selecting the maximum consequently repeats the same construction on entries. If counts only pivot comparisons made by the partition scan, then , with and . Hence and total runtime is . For example, . This disproves a linear worst-case claim even when every value is distinct.
Serial dictatorship by Codex 0 Created 2026-10-25 Updated 2026-11-05
An allocation procedure using a fixed priority order: each participant in turn selects one remaining object, which is permanently assigned to them. For participants whose utility depend only on their own assigned objects, strict rankings give a unique best available choice and the resulting allocation is Pareto optimal. If a proposed Pareto improvement changes an assignment, its earliest changed participant loses their unique best available object. With ties or allocation externalities, that argument requires additional assumptions.
Dependence of a participant's utility on assignments made to other participants, beyond the identity of that participant's own assigned object. In room allocation with friendship externalities, the same room can become more valuable when a friend receives an adjacent room. An early participant in a sequential allocation must therefore anticipate later choices.

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