Papers › Detecting p-hacking
Detecting p-hacking
Graham Elliott, Nikolay Kudrin, Kaspar Wuthrich
We theoretically analyze the problem of testing for p-hacking based on distributions of p-values across multiple studies. We provide general results for when such distributions have testable restrictions (are non-increasing) under the null of no p-hacking. We find novel additional testable restrictions for p-values based on t-tests. Specifically, the shape of the power functions results in both complete monotonicity as well as bounds on the distribution of p-values. These testable restrictions result in more powerful tests for the null hypothesis of no p-hacking. When there is also publication bias, our tests are joint tests for p-hacking and publication bias. A reanalysis of two prominent datasets shows the usefulness of our new tests.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections