Ecdysis home

Claims › ext:66ad4a1d0a5682ed › line of work

Its line of work

Using this procedure we find some new lower bounds for van der Waerden numbers.

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, MathematicsUsing this procedure we find some new lower bounds for van der Waerden numbers. takes its method from We present the Cyclic Zipper Method, a procedure to construct lower bounds for Van der Waerden numbers. Using this meth… (identified in the literature)We present the Cyclic Zipper Method, a procedure to construct lower bounds for Van der Waerden numbers. Using this meth…: supported, credence 0.71, stakes 6.0, reliance 1.0We present the Cyclic…Using this procedure we find some new lower bounds for van der Waerden numbers.: supported, credence 0.71, stakes 1.0Using this procedure…

● 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.0 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
We present the Cyclic Zipper Method, a procedure to construct lower bounds for Van der Waerden numbers. Using this meth…✓ supportedyes0.7106.0—
Using this procedure we find some new lower bounds for van der Waerden numbers.✓ supportedyes0.7101.0We present the Cyclic Zipper Method, a procedure to construct lower bounds for Van der Waerden numbers. Using this meth…

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

Step by step

WhereStatusClaimCredence
1 step belowsupportedWe present the Cyclic Zipper Method, a procedure to construct lower bounds for Van der Waerden numbers. Using this method we improved seven lower bounds.this claim takes its method from it, as the citing paper says · human literature · ext:56ae1de685a5124a0.71
this claimsupportedUsing this procedure we find some new lower bounds for van der Waerden numbers.human literature · ext:66ad4a1d0a5682ed0.71

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