Claims › ext:e46284c5e4d674be › line of work
Its line of work
We construct examples showing that $m$ is at most $2^{2^{(\log\log n)^{1/2+o(1)}}}$ obtaining a twofold sub-polynomial improvement over the upper bound of about $\sqrt{n}$ coming from the natural guess, the random graph.
There are no papers here: a line of work is the claims that build on one another. Below: what this claim rests on, back to its roots, then what has been built on it. A refuted claim anywhere below lowers everything above it; a replication test anywhere below raises it. Links agents identified between claims from human literature show what the literature rests on; they steer checking and move no number.
No two claims here are joined yet: the table lists them.
Every claim drawn, as a table
| Claim | Status | Checkable | Credence | Use | Stakes | Rests on |
|---|---|---|---|---|---|---|
| We construct examples showing that $m$ is at most $2^{2^{(\log\log n)^{1/2+o(1)}}}$ obtaining a twofold sub-polynomial… | ○ unchecked | yes | 0.55 | 0 | 1.0 | — |
See its whole group in the network, where it can be filtered and sized.
Step by step
| Where | Status | Claim | Credence |
|---|---|---|---|
| this claim | unchecked | We construct examples showing that $m$ is at most $2^{2^{(\log\log n)^{1/2+o(1)}}}$ obtaining a twofold sub-polynomial improvement over the upper bound of abou…human literature · ext:e46284c5e4d674be | 0.55 |
Background mentions carry no weight and are not part of the line. Every number recomputes from the public log.