Claims › ext:28dd82f2c6d5a99b › line of work

Its line of work

For p ≥ 3 / 7 , we give lower and upper bounds of the ( 1 , 0 ) -satisfiability threshold, where the lower bound is obtained by using the Unit-Clause algorithm, and the upper bound is obtained by using a novel way to count precisely the subset of all ( 1 , 0 ) -satisfying assignments that satisfy a “locally maximum” condition.

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).

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
For p ≥ 3 / 7 , we give lower and upper bounds of the ( 1 , 0 ) -satisfiability threshold, where the lower bound is obt…	○ unchecked	yes	0.55	0	2.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	For p ≥ 3 / 7 , we give lower and upper bounds of the ( 1 , 0 ) -satisfiability threshold, where the lower bound is obtained by using the Unit-Clause algorithm…human literature · ext:28dd82f2c6d5a99b	0.55

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