An open library for your next question. Public pilot
Executable Science
Log inCreate account
FROM A QUESTION TO A PLAN

Something worth investigating.

Choose a research brief, inspect its sources, and adapt the plan for your own work. Read, edit and export without an account.

RESEARCH BRIEF · 5 SOURCES

Put uncertainty around a small agent-success benchmark

How misleading can a nominal 95% success-rate interval be when only twenty independent tasks are observed?

Open the brief
RESEARCH BRIEF · 6 SOURCES

Find a numerical failure before trusting an experiment

Does an apparently sensible floating-point answer survive a separately formulated reference calculation?

Open the brief
RESEARCH BRIEF · 4 SOURCES

Check the false-positive cost of trying many variants

How does testing twenty null variants change the chance of declaring at least one apparent improvement?

Open the brief
RESEARCH BRIEF · 5 SOURCES

Test an analysis against data with known generating truth

Can the analysis distinguish finite-sample variation from leakage, missingness bias, or a covariance bug?

Open the brief
RESEARCH BRIEF · 3 SOURCES

Audit benchmark labels with explicit rules

Do compact balance-scale and tic-tac-toe labels agree with their declared arithmetic and board rules?

Open the brief
RESEARCH BRIEF · 6 SOURCES

Build a baseline whose preprocessing can be audited

Does a more complicated classifier improve on a simple baseline under the same frozen split and training-only normalization?

Open the brief
RESEARCH BRIEF · 7 SOURCES

Design a generative-model calibration check

Can inference recover declared generating quantities without conflating posterior predictive fit and parameter calibration?

Open the brief
RESEARCH BRIEF · 5 SOURCES

Make an algorithm check include its invalid inputs

Does a shortest-path implementation return known distances and reject inputs outside its assumptions?

Open the brief
RESEARCH BRIEF · 7 SOURCES

Separate a solver's stopping signal from solution accuracy

When does a tiny residual or smaller step fail to imply a more accurate scientific result?

Open the brief
RESEARCH BRIEF · 5 SOURCES

Turn a published ML replication into a bounded next check

Which specific claim in an existing label-smoothing or noisy-label replication can be mapped to accessible code, data and an affordable evaluation?

Open the brief
RESEARCH BRIEF · 6 SOURCES

Explain a score difference before blaming the model

Do evaluation harnesses agree on the same frozen predictions once normalization, aggregation and failure handling are made explicit?

Open the brief
RESEARCH BRIEF · 6 SOURCES

Make an agent benchmark attempt auditable

Can another operator reconstruct one bounded agent-evaluation attempt from its task, environment, actions, failures and scoring rule?

Open the brief
RESEARCH BRIEF · 7 SOURCES

Prepare controls for an interpretability claim

Does a proposed attribution or activation-based conclusion survive its stated baseline, precision and intervention controls?

Open the brief
BOUNDED RESEARCH QUESTIONS

Find a useful starting point.

Explore work across journals

Platform-authored guidance for your own work. Each task states a comparison to investigate and the limits of what its results could establish.

TASK 01Platform guidance · Results not established

How much coverage does a small benchmark have?

For 20 independent trials with success probability 0.05, how often do nominal 95% Wald and Wilson intervals contain the true probability?

DEFINED INPUTSBinomial model: n = 20, p = 0.05, nominal coverage 0.95.

COMPARISON TO INSPECTSum binomial probability over each of the 21 counts whose interval contains p. Full enumeration does not imply exact floating-point arithmetic.

TASK 02Platform guidance · Results not established

Can a variance calculation preserve a small spread?

For five values near one billion, how do floating-point variance formulas compare with the exact population variance?

DEFINED INPUTSThe five integers are 999999998, 999999999, 1000000000, 1000000001 and 1000000002.

COMPARISON TO INSPECTThe exact mean is 1000000000 and centered squared offsets sum to 10, giving population variance 2.

TASK 03Platform guidance · Results not established

What happens when a shortest-path assumption fails?

Do two graph algorithms produce the specified reference distances and distinguish a negative edge from a reachable negative cycle?

DEFINED INPUTSPositive graph: A→B:2, A→C:5, B→C:1, B→D:4, C→D:1; source A.

COMPARISON TO INSPECTHand-derived positive distances are A:0, B:2, C:3, D:4. Both methods should be compared with this map.