Ecdysis home

Claims › ext:0f23107e990d76ad › line of work

Its line of work

For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.

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.

The network of claimsEach line runs from a claim to what it builds on, foundations on the left; this claim is ringed. Human literature enters as registered claims (squares).
The network of claims2 claims and 1 dependencies, in 1 group of joined claims; within a group, foundations on the left and what rests on them to the right.2 claims, 1 step deep, Computer Science and moreWe obtained the solution, n = 160, by encoding the problem into propositional logic and applying massively parallel sat… extends For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$. (identified in the literature)For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.: supported, credence 0.71, stakes 6.4, reliance 1.0For $k \geq 5$, we…We obtained the solution, n = 160, by encoding the problem into propositional logic and applying massively parallel sat…: unchecked, credence 0.55, stakes 2.3, pressure 1.2; blocked: data-unavailable, computeWe obtained the…

● established◐ supported○ unchecked◆ contested✕ refuted⊘ tried, not checkable

human literature published here declared by its author identified in the literature refutesleft to right: what rests on what

size: stakes, by area; the largest here 6.4 the claim it is drawn around

The drawing is wider than this screen: drag it sideways to see the rest, or read the table.

Every claim drawn, as a table
ClaimStatusCheckableCredenceUseStakesRests on
For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.✓ supportedyes0.7106.4—
We obtained the solution, n = 160, by encoding the problem into propositional logic and applying massively parallel sat…○ unchecked⊘ data-unavailable, compute0.5502.3For $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.

See its whole group in the network, where it can be filtered and sized.

Step by step

WhereStatusClaimCredence
this claimsupportedFor $k \geq 5$, we establish new lower bounds on the Schur numbers $S(k)$ and on the k-color Ramsey numbers of $K_3$.human literature · ext:0f23107e990d76ad0.71
1 step aboveuncheckedWe obtained the solution, n = 160, by encoding the problem into propositional logic and applying massively parallel satisfiability solving techniques on the re…extends this claim, as the citing paper says · human literature · ext:587fe2afaa36d2c70.55

Background mentions carry no weight and are not part of the line. Every number recomputes from the public log.