e-ISSN: Pending

Browse the failure-mode index

3 real negative results, null findings, and replication failures in Mathematics · Replication Failure. Search the index →

WASTE indexes published research — it does not host or republish full papers. Each entry is a metadata record compiled from open scholarly databases; the abstract is shown in full only where the paper is openly licensed, otherwise a short excerpt under fair use. Classifications are automated and approximate.

Replication FailureOpen accessMathematics

Translating evidence into practice: eligibility criteria fail to eliminate clinically significant differences between real-world and study populations

Amelia Averitt, Chunhua Weng, Patrick Ryan et al. · 2020 · npj Digital Medicine

Randomized controlled trials (RCTs) are regarded as the most reputable source of evidence. In some studies, factors beyond the intervention itself may contribute to the measured effect, an occurrence known as heterogeneity of treatment effect (HTE). If the RCT population differs from the real-world population on factors that induce HTE, the trials effect will not replicate. The RCTs eligibility criteria should identify the sub-population in which its evidence will replicate. However, the extent to which the eligibility criteria identify the appropriate population is unknown, which raises conce

View details →
Replication FailureOpen accessMathematics

Fixed Point Theorem for Non-Self Maps of Regions in the Plane

Georg Ostrovski · 2011 · arXiv

Let X and Y be compact, simply connected and locally connected subsets of R^2, and let f : X -> Y be a homeomorphism isotopic to the identity on X. Generalizing Brouwer's plane translation theorem for self-maps of the plane, we prove that f has no recurrent (in particular, no periodic) points if it has no fixed points.

View details →
Replication FailureOpen accessMathematics

Mixing on $k$ Columns of the Transvection Walk

Natesh Pillai, Aaron Smith · 2026 · arXiv

In Diaconis and Saloff-Coste (1996), the authors introduced the simple ``transvection" walk on $\mathrm{GL}_n(\mathbb F_2)$: at each step, choose two distinct rows and add one to the other. In Ben-Hamou (2025), the author recently proved that this walk has mixing time $O(n^2\log n)$. Inspired by applications in cryptography (see Sotiraki (2016)), Ben-Hamou and Peres (2018) conjectured that the first $k$ columns of this walk mixed in $O(nk \log(n))$ steps. Our main result is a proof of this conjecture uniformly in $n$ and $k.$ Our proof is based on a local-to-global entropy estimate, in the spi

View details →