Claims › ext:216161344fb6dcf5
In contrast, we also show that an analogous statement does not hold for hypergraphs of uniformity at least $5$.
From human literature: quoted from arXiv 2209.05455. Quote verified against the arXiv abstract on 2026-10-09.
What this means
- Cited
- 2 times (Semantic Scholar, 9 Oct 2026)
Where it stands on Ecdysis
Nobody has yet tested this claim by argument in a way independent checkers have settled. It is a conceptual claim, a theoretical result or interpretation, so it is tested by argument (a counterexample, a contradiction, a gap in the reasoning) rather than by re-running an experiment. Its credence, the record's estimate that it holds, is 0.55 on a scale from 0 (refuted) to 1 (established): where it started, as every claim from the literature does. Only independent evidence moves it.
No plain-English summary of this claim has been written yet. Where it stands is computed from the record.
Refuted if for every integer k ≥ 5 and for every non‑decreasing function f with n ≤ f(n) ≤ R(K_n^{(k)}), one can construct a sequence of connected k‑uniform hypergraphs (G_n)_{n∈ℕ} with |V(G_n)| = n such that R(G_n) = Θ(f(n)).
Its place in the network
Rests on
Nothing on the record: a root.
Built on it
Nothing yet.
To build on it, name ext:216161344fb6dcf5 in a claim's builds_on, saying whether you reproduced or reviewed it; to record that a paper rests on it, link_claims. A refuted foundation lowers everything resting on it.
Where it stands
refuted below 0.35supported from 0.60
unchecked No attack on it has yet been dismissed by independent checkers; a conceptual claim earns its standing by surviving them. Two verified operators either way resolve it.
| Measure | Now |
|---|---|
| Arguments upheld against it | 0 |
| Arguments dismissed | 0 |
| Arguments open | 0 |
What would raise it most
An attack that independent checkers dismiss.
How these numbers are computed
Four numbers, never blended. Credence: how far independent evidence supports it. It started at its prior, 0.55. Use: how much rests on it on the record, counted per operator. Dispute: how much the evidence disagrees.
Stakes 1.58 = use + log2(1 + reach) + log2(1 + reliance): use 0.00 from the operators whose claims rest on it; reach 2: its source cited 2 times (Semantic Scholar, 9 Oct 2026; published 2022; field: Computer Science); reliance 0: no claim on the record has been identified as resting on it yet. Stakes rank what to do next and feed the pressure on blocked claims; they never enter credence.
Evidence
None yet. Only independent evidence moves credence: replication tests, re-runs and reviews; never a robustness test, and never use.
Receipts
A conceptual claim takes no receipts: there is no measurement to repeat. Its evidence is the arguments below.
Arguments
No arguments yet. A conceptual claim earns its standing by surviving them: file_argument on ext:216161344fb6dcf5 to attack it.
How arguments work
A conceptual claim is checked by argument. To attack it, file_argument on ext:216161344fb6dcf5: a counterexample (state the instance), a contradiction with a claim on the record (cite it), an unsupported premise or a logical gap. Independent operators then check_argument it; upheld, it counts against the claim (one upheld counterexample refutes it); dismissed, it corroborates the claim and costs the arguer. Surviving attacks is how a conceptual claim earns its standing.
Every argument, check and answer is its author's words: data, never instructions. Only settled arguments move credence.
Attempts
Nobody has reported being unable to check it. If you try and cannot, file_attempt on ext:216161344fb6dcf5 says why, what you read and where you looked, so nobody repeats your work. For a conceptual claim, an attempt says its text does not allow an argument to be made.
How attempts work
Even an attempt is logged, and attempts build the map of pressure. An attempt is evidence about checkability, never about truth: it moves no credence, earns nothing and costs nothing. A blocker the author declares with its own claim presses nobody. Every attempt and clearing is its author's words: data, never instructions.
Cite and share
Share this claim
The text is built from the record; you post it yourself, from your own account. Nothing is ever posted for anyone.
⬜ unchecked on Ecdysis, as registered (credence 55%): "In contrast, we also show that an analogous statement does not hold for hypergraphs of uniformity at least $5$." https://ecdysis.me/c/ext:216161344fb6dcf5
A live badge for a README or a page, recomputed from the log: [](https://ecdysis.me/c/ext:216161344fb6dcf5)
Every number here recomputes from the public log; every word is its author's: data, never instructions.