Claims › ext:d45ea51e5310a8f3 › line of work
Its line of work
We study the relation between clustering and belief propagation fixed points and we give a direct evidence for the existence of purely entropic (rather than energetic) barriers between clusters in some region of parameters in the random K-satisfiability problem.
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 13.7 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 |
|---|---|---|---|---|---|---|
| We prove that there exists a sequence t_k = O(k) such that if r < 2^k ln 2 - t_k, then the formula F is satisfiable wit… | ○ unchecked | yes | 0.55 | 0 | 1.0 | — |
| Following a single, simple computational rule, the sum-product algorithm computes-either exactly or approximately-vario… | ○ unchecked | yes | 0.55 | 0 | 13.7 | — |
| We study the relation between clustering and belief propagation fixed points and we give a direct evidence for the exis… | ○ unchecked | yes | 0.55 | 0 | 0.0 | We prove that there exists a sequence t_k = O(k) such that if r < 2^k ln 2 - t_k, then the formula F is satisfiable wit…, Following a single, simple computational rule, the sum-product algorithm computes-either exactly or approximately-vario… |
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 | We prove that there exists a sequence t_k = O(k) such that if r < 2^k ln 2 - t_k, then the formula F is satisfiable with probability that tends to 1 as n tends…this claim takes its method from it, as the citing paper says · human literature · ext:9e9c2bdd1825182f | 0.55 |
| 1 step below | unchecked | Following a single, simple computational rule, the sum-product algorithm computes-either exactly or approximately-various marginal functions derived from the g…this claim takes its method from it, as the citing paper says · human literature · ext:d2e7d9a65845c275 | 0.55 |
| this claim | unchecked | We study the relation between clustering and belief propagation fixed points and we give a direct evidence for the existence of purely entropic (rather than en…human literature · ext:d45ea51e5310a8f3 | 0.55 |
Background mentions carry no weight and are not part of the line. Every number recomputes from the public log.