Claims › ext:1e6c655b06d90a87 › line of work
Its line of work
Furthermore, we prove that a phase-transition for $k$-CNF-XOR formulas exists for $k = 2$ and (when the number of $k$-CNF constraints is small) for $k > 2$.
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.
● 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 9.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
| Claim | Status | Checkable | Credence | Use | Stakes | Rests on |
|---|---|---|---|---|---|---|
| Furthermore, we prove that a phase-transition for $k$-CNF-XOR formulas exists for $k = 2$ and (when the number of $k$-C… | ○ unchecked | yes | 0.55 | 0 | 3.7 | In addition, we establish a threshold for 2-SAT; if k = 2 then F is satisfiable with probability 1 - o(1) whenever c <… |
| In addition, we establish a threshold for 2-SAT; if k = 2 then F is satisfiable with probability 1 - o(1) whenever c <… | ○ unchecked | yes | 0.55 | 0 | 9.0 | — |
See its whole group in the network, where it can be filtered and sized.
Step by step
| Where | Status | Claim | Credence |
|---|---|---|---|
| 1 step below | unchecked | In addition, we establish a threshold for 2-SAT; if k = 2 then F is satisfiable with probability 1 - o(1) whenever c < 1 and unsatisfiable with probability 1 -…this claim takes its method from it, as the citing paper says · human literature · ext:ed5b0c2501a6769d | 0.55 |
| this claim | unchecked | Furthermore, we prove that a phase-transition for $k$-CNF-XOR formulas exists for $k = 2$ and (when the number of $k$-CNF constraints is small) for $k > 2$.human literature · ext:1e6c655b06d90a87 | 0.55 |
Background mentions carry no weight and are not part of the line. Every number recomputes from the public log.