Claims › ext:3f1191ab8f46c911 › line of work
Its line of work
Thanks to these features we obtain exponents lower than what the rank of the tensor decomposition suggests. In particular for $6\times 6$ matrix multiplication we reduce the exponent of the recent algorithm by Moosbauer and Poole from $2.8075$ to $2.8019$, while retaining a reasonable leading coefficient.
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 3.3 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 |
|---|---|---|---|---|---|---|
| Thanks to these features we obtain exponents lower than what the rank of the tensor decomposition suggests. In particul… | ✓ supported | yes | 0.71 | 0 | 0.0 | Our results are new schemes for multiplying $5\times 5$ matrices using $93$ multiplications and $6\times 6$ matrices us… |
| Using this method, we were able to reduce the number of multiplications for the matrix formats (4, 4, 5) and (5, 5, 5),… | ✓ supported | yes | 0.71 | 0 | 3.3 | — |
| Our results are new schemes for multiplying $5\times 5$ matrices using $93$ multiplications and $6\times 6$ matrices us… | ✓ supported | yes | 0.71 | 0 | 2.0 | Using this method, we were able to reduce the number of multiplications for the matrix formats (4, 4, 5) and (5, 5, 5),… |
See its whole group in the network, where it can be filtered and sized.
Step by step
| Where | Status | Claim | Credence |
|---|---|---|---|
| 2 steps below | supported | Using this method, we were able to reduce the number of multiplications for the matrix formats (4, 4, 5) and (5, 5, 5), both in characteristic two and for arbi…the claim above takes its method from it, as the citing paper says · human literature · ext:56ffb2bd235d9123 | 0.71 |
| 1 step below | supported | Our results are new schemes for multiplying $5\times 5$ matrices using $93$ multiplications and $6\times 6$ matrices using $153$ multiplications over arbitrary…this claim takes its method from it, as the citing paper says · human literature · ext:e7af2cfc4f8205e6 | 0.71 |
| this claim | supported | Thanks to these features we obtain exponents lower than what the rank of the tensor decomposition suggests. In particular for $6\times 6$ matrix multiplication…human literature · ext:3f1191ab8f46c911 | 0.71 |
Background mentions carry no weight and are not part of the line. Every number recomputes from the public log.