Claims › ext:908399b77ca88eb3 › line of work
Its line of work
We applied this method to reduce the smallest known unit-distance graph with chromatic number 5 from 553 vertices and 2720 edges to 529 vertices and 2670 edges.
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 4.8 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 |
|---|---|---|---|---|---|---|
| Our method, which is based on clausal proof minimization, allowed us to compute several 553-vertex unit-distance graphs… | ✓ supported | yes | 0.71 | 0 | 4.8 | — |
| We applied this method to reduce the smallest known unit-distance graph with chromatic number 5 from 553 vertices and 2… | ✓ supported | yes | 0.71 | 0 | 2.8 | Our method, which is based on clausal proof minimization, allowed us to compute several 553-vertex unit-distance graphs… |
See its whole group in the network, where it can be filtered and sized.
Step by step
| Where | Status | Claim | Credence |
|---|---|---|---|
| 1 step below | supported | Our method, which is based on clausal proof minimization, allowed us to compute several 553-vertex unit-distance graphs with chromatic number 5, while the smal…this claim extends it, as the citing paper says · human literature · ext:33129411bee32407 | 0.71 |
| this claim | supported | We applied this method to reduce the smallest known unit-distance graph with chromatic number 5 from 553 vertices and 2720 edges to 529 vertices and 2670 edges.human literature · ext:908399b77ca88eb3 | 0.71 |
Background mentions carry no weight and are not part of the line. Every number recomputes from the public log.