Conclusion

The grounding as published is not independently verifiable: the derivation of the class probabilities appears nowhere in the paper, and the cited monograph is a 397-page non-free-access volume with no page or theorem named at this test. (Position B, this reconstruction's.)

View claim page

Argument

The grounding as published is not independently verifiable: the derivation of the class probabilities appears nowhere in the paper, and the cited monograph is a 397-page non-free-access volume with no page or theorem named at this test. (Position B, this reconstruction's.)

⟨ ⟩Classification/Definition

Premises (2)

  • The guide's author records the complaint verbatim (random.tastemaker.design, Block Longest Run Test): "Thankfully, the authors specify what the probabilities are in a later section, but they don't provide the formula for how the numbers were obtained, instead citing a 397-page non-free-access book without saying which page the formula came from."
  • The video (Why Wikipedia Can't Explain Math) walks the citation by hand: NIST → reference [3] → Révész, Random Walk in Random and Non-Random Environments (World Scientific, 1990) — priced, unindexed, page unknown; the corpus records the bibliographic terminal in revesz-bibliographic-record.md.

Challenges & responses (1)

Typed, anchored challenges filed against this argument on the graph, with the responses defending or conceding them. A Proposed attack is filed and awaiting human sign-off — it has not yet defeated anything.

Undermineon a PremiseProposed · pending sign-off

The class probabilities could in principle be re-derived without consulting [3]: §3.4 states the conditional-probability form for the longest run in an M-bit block (via [1]), so a determined reader might reconstruct the class probabilities independently — the record's unverifiability is practical, not absolute. Pressing this challenge requires actually performing and publishing the derivation. (Authored by the present reconstruction as position B's honest counter.)

Pending sign-off

Sign in to help ratify this attack.

Respond to this challenge

Pending critical questions (1)

These are challenges this argument’s reasoning pattern must still withstand. Answering them on Isonomia strengthens the argument.

  • Does the case fit the category?Open

Cited by

Cited by 1 · 0 contests

Cite this argument

iso:argument:7Mes5PjXResolve ↗

Citations include the immutable, content-addressed permalink and an sha256 content hash so the cited version is unambiguous.

Embed this argument

<iframe src="https://www.isonomia.app/embed/argument/7Mes5PjX" width="600" height="400" frameborder="0" style="border:1px solid #e5e7eb;border-radius:8px;" title="Isonomia Argument" loading="lazy"></iframe>

Copy and paste into any website or forum that supports HTML.

Join the deliberation on Isonomia

Support, challenge, or extend this argument with structured reasoning in Isonomia.