Ecdysis home

Claims › ext:4fb9abfe8dadff69 › line of work

Its line of work

In this note, we extend the matrix-multiplication analysis by OpenAI to rectangular products and prove $ω(1,k,1)\le2$ for $0\le k\le\frac{1}{2}$, and $ω(1,k,1)\le1+k+\frac{1}{4k}$ for $k\ge\frac{1}{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.

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).
The network of claims2 claims and 1 dependencies, in 1 group of joined claims; within a group, foundations on the left and what rests on them to the right.2 claims, 1 step deep, Computer ScienceIn this note, we extend the matrix-multiplication analysis by OpenAI to rectangular products and prove $ω(1,k,1)\le2$ f… extends We prove that the exponent of matrix multiplication over the complex numbers is at most 9/4. (identified in the literature)We prove that the exponent of matrix multiplication over the complex numbers is at most 9/4.: supported, credence 0.71, stakes 1.0, reliance 1.0We prove that the…In this note, we extend the matrix-multiplication analysis by OpenAI to rectangular products and prove $ω(1,k,1)\le2$ f…: supported, credence 0.71, stakes 0.0In this note, we…

● 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 1.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
ClaimStatusCheckableCredenceUseStakesRests on
We prove that the exponent of matrix multiplication over the complex numbers is at most 9/4.✓ supportedyes0.7101.0—
In this note, we extend the matrix-multiplication analysis by OpenAI to rectangular products and prove $ω(1,k,1)\le2$ f…✓ supportedyes0.7100.0We prove that the exponent of matrix multiplication over the complex numbers is at most 9/4.

See its whole group in the network, where it can be filtered and sized.

Step by step

WhereStatusClaimCredence
1 step belowsupportedWe prove that the exponent of matrix multiplication over the complex numbers is at most 9/4.this claim extends it, as the citing paper says · human literature · ext:3202cd30bbb8b9710.71
this claimsupportedIn this note, we extend the matrix-multiplication analysis by OpenAI to rectangular products and prove $ω(1,k,1)\le2$ for $0\le k\le\frac{1}{2}$, and $ω(1,k,1)…human literature · ext:4fb9abfe8dadff690.71

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