Pith. sign in

Paper Citation Record · LEDGER

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation

As of 13 August 2026, this Paper Citation Record lists 67 of 67 outbound references and 1 inbound Pith citation observation for arXiv:2508.01748.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2508.01748 v1

Coverage vector

measured 67 of 67 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-06T05:41:54.047434Z

measured 68 of 68 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-05-22T11:34:57.225987Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-22T11:36:29.136555Z

Reference resolution

67 of 67 outbound references displayed

  • verified exact3
  • verified fuzzy49
  • unresolved11
  • parse uncertain0
  • malformed identifier1
  • metadata mismatch3

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 4386c9df-67d8-4d53-8506-96afaaa67f63 · outbound

This paper cites A Refined Laser Method and Faster Matrix Multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation A Refined Laser Method and Faster Matrix Multiplication

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-06T05:41:53.803913Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T05:41:53.803913Z digest=sha256:2f7dd1ad241355daafd7af1829b2da043a5580b9b150c056b13320e4cab2ec19

Observation 53aaaf58-5d28-401c-8769-930ce0690264 · outbound

This paper cites More Asymmetry Yields Faster Matrix Multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation More Asymmetry Yields Faster Matrix Multiplication

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-06T05:41:53.808106Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T05:41:53.808106Z digest=sha256:ba57186414c0a3d518bea725419fd30732dd7fef94b9c3d9ffa4e62ef85bcc34

Observation dc66c045-cd7f-495f-baf9-20ad27d07cae · outbound

This paper cites Fast matrix multiplication: limitations of the Coppersmith- Winograd method.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Fast matrix multiplication: limitations of the Coppersmith- Winograd method

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:55.060074Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.816014Z digest=sha256:24980b87b315e17536fd546a38c8e64ab31b3f12c0512171bb8c3a82850b59b7

Observation 0d49b797-223c-40a0-bec1-70c3f99e3e2e · outbound

This paper cites Adaptive flip graph algorithm for matrix multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Adaptive flip graph algorithm for matrix multiplication

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:55.050193Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.820269Z digest=sha256:867c8af7d8fec0d397c72e24f88268c76a8bc4277f5985856a0c13a84e9ca70b

Observation 32f1c741-a98c-4aca-b6a6-a95de735e6f4 · outbound

This paper cites Faster Matrix Multiplication via Sparse Decomposition.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Faster Matrix Multiplication via Sparse Decomposition

Reference 5

Resolution
metadata mismatch
raw_fallback, observed 2026-08-06T05:41:54.529860Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.823880Z digest=sha256:c9e4f108938f90ec49958205c4eb613d42080e726a9c729f022059bea4cb1019

Observation 650c1504-3320-45eb-b90b-b5c8eb7001a8 · outbound

This paper cites Sparsifying the Operators of Fast Matrix Multiplication Algorithms.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Sparsifying the Operators of Fast Matrix Multiplication Algorithms

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:55.039827Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.827489Z digest=sha256:fbd085af21335dae5664dadcc165657d5b2b286c45508b5f231754e92ec157e5

Observation 6b0a14c8-0cb6-4bc2-9175-0b098c75d3fb · outbound

This paper cites A framework for practical parallel fast matrix multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation A framework for practical parallel fast matrix multiplication

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:55.029844Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.831077Z digest=sha256:c59d68b71aa7dd9a7ae64aa2228a44bf634768b73fa576df1ba0c0cdf5bf45fb

Observation fdec2cdb-8ada-4ef8-9148-8ce17e9ac58c · outbound

This paper cites Relations between exact and approximate bilinear algorithms. Applications.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Relations between exact and approximate bilinear algorithms. Applications

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:55.019983Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.834375Z digest=sha256:076eb6e41d34e669114d10eb9473f446900bc212e554d9a23792b4cb3a305652

Observation ac0a94f8-a070-4973-b621-91ec591d73e1 · outbound

This paper cites O(n2.7799) complexity for n × n approximate matrix multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation O(n2.7799) complexity for n × n approximate matrix multiplication

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:55.009222Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.838219Z digest=sha256:736e211376ad60cfd975f06fca41f42ba855b7f5463771aa1fcbc03c2b6a569d

Observation 192d6ecf-a173-4e35-a6b6-175ea51b76f9 · outbound

This paper cites A 5 2 n2-Lower Bound for the Multiplicative Complexity of n × n-Matrix Multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation A 5 2 n2-Lower Bound for the Multiplicative Complexity of n × n-Matrix Multiplication

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.998817Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.842469Z digest=sha256:5e765991e15c773a2939fd3d0bed06b01e983ca76f699941e0b08d7114ee9659

Observation e0583699-8f9c-4d0a-ad31-ac331ef79b95 · outbound

This paper cites A Strassen-like matrix multiplication suited for squaring and higher power computation.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation A Strassen-like matrix multiplication suited for squaring and higher power computation

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.989307Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.846787Z digest=sha256:188c3eb28b5c033579c2fd9d4fecfc889c5d7e0de7df037bb841ffecf78c7cf8

Observation 1cc37aed-1ff2-4e53-bb1a-4cc4d6e2388d · outbound

This paper cites an unresolved cited work.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Unresolved cited work

Reference 12

Resolution
unresolved
raw_fallback, observed 2026-08-06T05:41:54.978426Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.851079Z digest=sha256:a45f5cad388dd99d5053a8156bc79be30d73b5b20b2c623d5bd5cc20007cc63d

Observation 5fb4bae6-a988-4365-bcf4-a2207a451574 · outbound

This paper cites On the additive complexity of 2 × 2 matrix multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation On the additive complexity of 2 × 2 matrix multiplication

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.967982Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.854940Z digest=sha256:bd3bc68a8ebfa0c25aae59e41ae8d5b473f45003cac709f63b64f94c3587533e

Observation 22072e9e-a005-4ce9-82ee-df2876b23085 · outbound

This paper cites On the arithmetic complexity of Strassen-like matrix multiplications.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation On the arithmetic complexity of Strassen-like matrix multiplications

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.957591Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.858537Z digest=sha256:e74bf83d9737def5e9717824b2b247156ad2d37fce8267134a96973e2de8cc65

Observation e44113f4-0899-49b7-88dc-5625e9b3bd31 · outbound

This paper cites A group-theoretic approach to fast matrix multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation A group-theoretic approach to fast matrix multiplication

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.948196Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.861869Z digest=sha256:2996a4ccb37a6c2ae73d5c549ec44fb66d1085946a565d606027b15db2d155a3

Observation 20cf6969-51c4-447c-8fac-2a3d959e7a58 · outbound

This paper cites Matrix multiplication via arithmetic progressions.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Matrix multiplication via arithmetic progressions

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.938435Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.865094Z digest=sha256:8a5f5a7d3bd32dd4d25c16c0584bfe7ec75920a3afcbbcb2f5d2d879b3f2d9a0

Observation c664b3ee-53c4-4a13-9d91-18d2aff1520f · outbound

This paper cites Improved bound for complexity of matrix multiplica- tion.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Improved bound for complexity of matrix multiplica- tion

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.928618Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.868433Z digest=sha256:21d921894b230991a62ba482d40e0c7290ee05275862aebe2e225e276402b377

Observation f97b805b-4337-413b-bde9-3715dd361696 · outbound

This paper cites On varieties of optimal algorithms for the computation of bilinear mappings II. optimal algorithms for 2× 2-matrix multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation On varieties of optimal algorithms for the computation of bilinear mappings II. optimal algorithms for 2× 2-matrix multiplication

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.919047Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.875705Z digest=sha256:6970b661344fcff27c35fbdcaa74dea31fb7ebdd05d66c5fe2f38094d1be5268

Observation 80955f17-defc-4e05-9fea-53b425c79107 · outbound

This paper cites Optimization techniques for small matrix multi- plication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Optimization techniques for small matrix multi- plication

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.909183Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.882802Z digest=sha256:0ca5263cdfd486f303fbd73f0388a2f6702a5267aefc38ede9b67aa65ee3223d

Observation 47467e50-1c17-453f-b3d2-62a417904463 · outbound

This paper cites Faster matrix multiplication via asymmetric hashing.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Faster matrix multiplication via asymmetric hashing

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.899385Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.885993Z digest=sha256:8f7f801e448523450fe13492f3941c0eba9d72aebdfa55e768660995df8f9f78

Observation e84a04ef-0eb1-41b0-a75d-1f4a1c2cd0f2 · outbound

This paper cites A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-06T05:41:53.889326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T05:41:53.889326Z digest=sha256:63f6bbaaf6aa2011fcbf850d5d50291320f51bb5614ccb64c356fa04c3fd14b4

Observation 991fa744-4fa0-4bed-b089-02e4b443a493 · outbound

This paper cites Strassen’s algorithm is not optimally accurate.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Strassen’s algorithm is not optimally accurate

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.889188Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.893213Z digest=sha256:ef5362c86be37b1c9e4f96d65bc8855ae6a2388416c3f896cba77ef46af96811

Observation 4b8a7596-5c75-4e01-8106-882c3f548e96 · outbound

This paper cites Discovering faster matrix multiplication algorithms with reinforcement learning.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Discovering faster matrix multiplication algorithms with reinforcement learning

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.878361Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.897265Z digest=sha256:9684de2083a930679ef6f7034560b5bc7261b1f192d857497fc159a05bcc8e1c

Observation cc8d60b4-e9f7-4b7c-882c-f4750905cc4b · outbound

This paper cites Algebraic Complexity Theory.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Algebraic Complexity Theory

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.868381Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.900628Z digest=sha256:4aa0e66e6f60b16dbc98e69323e0572f6e6d19e36e6257a9e75d06e860f1f9b8

Observation a2ba5ea8-f174-4f3b-8c86-f348f431293c · outbound

This paper cites Towards practical fast matrix multiplication based on trilinear aggregation.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Towards practical fast matrix multiplication based on trilinear aggregation

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.859097Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.904664Z digest=sha256:e533a6b5f7399344466bca0f1fc3b92ffee70903e67036352b507416483e9032

Observation f9ad2a2a-5a06-4f0a-9733-5d65dc8b415e · outbound

This paper cites Local search for fast matrix multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Local search for fast matrix multiplication

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.849560Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.908538Z digest=sha256:a7311a2591aa3ed1a62df3bf14fa3f88ccd4a956cdf9a1733dd5a7d0c1ada30b

Observation f882e2fd-7a4e-49b9-aa2b-e56ffb727f7c · outbound

This paper cites New ways to multiply 3 × 3-matrices.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation New ways to multiply 3 × 3-matrices

Reference 28

Resolution
malformed identifier
no resolver link, observed 2026-08-06T05:41:53.912396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T05:41:53.912396Z digest=sha256:52fa26d9c74baedcf4782aa449bc190b80e66a8e10b18e0596be460b0689783e

Observation bd695032-8bdd-4041-b35c-99cb02bba00f · outbound

This paper cites On minimizing the number of multiplications necessary for matrix multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation On minimizing the number of multiplications necessary for matrix multiplication

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.839134Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.916410Z digest=sha256:9cbf6bebd2a4a0b2f046398d6153f1effe947bd9212ac134d7b84b210303e2af

Observation fff1fd44-28ed-493b-8eec-2e6d24aad37a · outbound

This paper cites Duality applied to the complexity of matrix multiplications and other bilinear forms.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Duality applied to the complexity of matrix multiplications and other bilinear forms

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.829201Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.920614Z digest=sha256:c36e061921819f7910c078b788f916993f24181f29ab39f841de1aaecd9bb5f6

Observation b01e3bc2-5821-42c7-a55b-eb9b572752dd · outbound

This paper cites Noncommutative Bilinear Algorithms for 3*3 Matrix Multi- plication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Noncommutative Bilinear Algorithms for 3*3 Matrix Multi- plication

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.818791Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.924169Z digest=sha256:c2fa08c85b4cfb5ad8e3f2dcbc440d435282735f5cf024dc375fa50281a7b2ab

Observation 0f17eb74-d215-4102-8566-f594955997e9 · outbound

This paper cites Finding complex-valued solutions of Brent equations using nonlinear least squares.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Finding complex-valued solutions of Brent equations using nonlinear least squares

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.808031Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.927676Z digest=sha256:60a0c0328bdbd15a2613131a88fc0e729b1efad5f6eb384e1dcdcc0f1a83a715

Observation 780f1f6d-69de-481d-95cb-655f9969307e · outbound

This paper cites The aggregation and cancellation techniques as a practical tool for faster matrix multiplica- tion.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation The aggregation and cancellation techniques as a practical tool for faster matrix multiplica- tion

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.797446Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.931242Z digest=sha256:2fb05b199037a97e49b921f83199b0c4ea877e4c88392a496aab13548be1ab18

Observation 3b359c45-ebba-43f2-bf1c-7f38577ca891 · outbound

This paper cites Matrix Multiplication, a Little Faster.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Matrix Multiplication, a Little Faster

Reference 34

Resolution
verified exact
doi, observed 2026-08-06T05:41:54.103368Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.934634Z digest=sha256:7f41b1c5af9ee40b84dbfcc8f3c62b5ac3ee332dec3f580c3fdeda00e4565d4a

Observation 2d83fe24-06c9-4732-b918-6f12029846cb · outbound

This paper cites Flip Graphs for Matrix Multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Flip Graphs for Matrix Multiplication

Reference 35

Resolution
metadata mismatch
raw_fallback, observed 2026-08-06T05:41:54.366693Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.938142Z digest=sha256:9937117b818ee5fa047e26ff2bb553e2c939ba880b3b6a605fd8d37cf3889ab4

Observation 773e9422-155f-4a6c-8baf-dc775917f3f1 · outbound

This paper cites Some New Non-Commutative Matrix Multiplication Algorithms of Size (n, m, 6).

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Some New Non-Commutative Matrix Multiplication Algorithms of Size (n, m, 6)

Reference 36

Resolution
metadata mismatch
raw_fallback, observed 2026-08-06T05:41:54.298075Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.941497Z digest=sha256:0bc8a21f111170abc2e54538e7ab231796fcdcde73b8dee8bbeab91fa4f12521

Observation 953dff60-c125-4347-b90c-0c0b9fb2373a · outbound

This paper cites A noncommutative algorithm for multiplying 3*3 matrices using 23 multiplications.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation A noncommutative algorithm for multiplying 3*3 matrices using 23 multiplications

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.787172Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.944761Z digest=sha256:6c90cb527dc171f47a9e7130813717f885842172f2c5048baa8b330054e17057

Observation 9747de0f-5df5-40b7-8d02-ee874bf0f779 · outbound

This paper cites On practical algorithms for accelerated matrix multipli- cation.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation On practical algorithms for accelerated matrix multipli- cation

Reference 38

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.776892Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.948518Z digest=sha256:21b809832f89fd366b26c7a022ecdd0fdf8e8455611adbff63c1ec8436eb1c07

Observation fbfc99fb-2b89-4c93-a814-27a4eb9ef512 · outbound

This paper cites Powers of tensors and fast matrix multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Powers of tensors and fast matrix multiplication

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.765998Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.951764Z digest=sha256:ad691f0dc720ce402355740a85c2cdf1a08daaafecc28f86eddf3cdc7abbb301

Observation 7e633bba-4aef-4f09-910d-86332ed55a48 · outbound

This paper cites Communication-avoiding parallel Strassen: Implementation and performance.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Communication-avoiding parallel Strassen: Implementation and performance

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.755943Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.955850Z digest=sha256:8df5c20917dda94b5df8f61b1164234694649b0697fa64acc32146ce943c2d00

Observation c88bd7bf-fcaa-430e-a85a-14478ca1628a · outbound

This paper cites The Number of the Beast: Reducing Additions in Fast Matrix Multiplication Algorithms for Dimensions up to 666.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation The Number of the Beast: Reducing Additions in Fast Matrix Multiplication Algorithms for Dimensions up to 666

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.745095Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.959663Z digest=sha256:312d770c55391a132f9db6bb9103921aa9f09d9020947e0dc9f8ac56678a86f9

Observation 6aac84ff-d491-4b6d-89eb-5cd2e68b2d41 · outbound

This paper cites Flip Graphs with Symmetry and New Matrix Multiplication Schemes.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Flip Graphs with Symmetry and New Matrix Multiplication Schemes

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-06T05:41:53.963023Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T05:41:53.963023Z digest=sha256:7f0074c07e17486857161035d76cce609fbfb56994b9b48e464ff25ddcac7af1

Observation 9be6dc1b-b346-465d-9690-5e51e40172d1 · outbound

This paper cites Multiplying 2 × 2 Sub-Blocks Using 4 Multiplications.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Multiplying 2 × 2 Sub-Blocks Using 4 Multiplications

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.733664Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.966529Z digest=sha256:664d0ff12badc60e7131d415c804deb189514b23d27723a285dee7644fbc93eb

Observation 5127a85f-9565-498d-b4ec-2d1c170d8120 · outbound

This paper cites AlphaEvolve: A coding agent for scientific and algorithmic discovery.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation AlphaEvolve: A coding agent for scientific and algorithmic discovery

Reference 44

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.722476Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.969834Z digest=sha256:7f56b8fc4795e565f9159ff53c81cd34b0e74f71abf29450264472edfad3c14a

Observation d84737ca-3d1f-4e41-a8f7-6e54e6652bc0 · outbound

This paper cites On schemes for the computation of products and inverses of matrices.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation On schemes for the computation of products and inverses of matrices

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.711918Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.974054Z digest=sha256:19b93fa1706e8dcaeb4f6b5931a677af72ec87d87661603420d24111a577a304

Observation 1faaaaf1-58cc-495c-87c2-173dd3b5a743 · outbound

This paper cites New Fast Algorithms for Matrix Operations.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation New Fast Algorithms for Matrix Operations

Reference 46

Resolution
verified exact
doi, observed 2026-08-06T05:41:54.092333Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.977406Z digest=sha256:4a4b1de3fa649db726cea20ecc81e186ed5c8504061041cb7e492cb4a9bf5d12

Observation ba09c863-f3a7-478a-b97d-b87682b07c6f · outbound

This paper cites Strassen’s algorithm is not optimal trilinear technique of aggregating, uniting and cancel- ing for constructing fast algorithms for matrix operations.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Strassen’s algorithm is not optimal trilinear technique of aggregating, uniting and cancel- ing for constructing fast algorithms for matrix operations

Reference 47

Resolution
unresolved
no resolver link, observed 2026-08-06T05:41:53.980750Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T05:41:53.980750Z digest=sha256:866cd1015f38497f73a6f43cac0638f695f7c2005d60e2f2dfa0ab9ea5692952

Observation 7c06b841-0a8d-490d-8dab-0694c2352f7e · outbound

This paper cites Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication

Reference 48

Resolution
unresolved
no resolver link, observed 2026-08-06T05:41:53.984192Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T05:41:53.984192Z digest=sha256:c04f73ea4f59e34c6f10ac9d4b805f02bf9dc2eba7f3f4ef387f2cb8f82904ee

Observation 88c68a16-4c2f-4863-a6b2-789fbcb0b0f2 · outbound

This paper cites On the additive complexity of matrix multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation On the additive complexity of matrix multiplication

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.701686Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.987364Z digest=sha256:dd7b3734c6a5fa2d9096423bf5f699f936f0a576322e8c5d7ffe951c877d91d3

Observation e3ae0980-5aa7-48c5-bec1-45505d11ba02 · outbound

This paper cites Correction of ‘J. Laderman, V. Pan, X.–H. Sha, On practical Algorithms for Accelerated Matrix Multiplication, Linear Algebra and its Applications. Vol. 162-164 (1992) pp. 557-588’.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Correction of ‘J. Laderman, V. Pan, X.–H. Sha, On practical Algorithms for Accelerated Matrix Multiplication, Linear Algebra and its Applications. Vol. 162-164 (1992) pp. 557-588’

Reference 50

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.691709Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.990905Z digest=sha256:aecc73ad6f10f006279d9226f8ef1c50355798a92df6c75305775ce68a8c4e10

Observation 7d6a4303-ed94-4844-97fb-fc834c5c4f9e · outbound

This paper cites Partial and Total Matrix Multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Partial and Total Matrix Multiplication

Reference 51

Resolution
unresolved
no resolver link, observed 2026-08-06T05:41:53.994412Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T05:41:53.994412Z digest=sha256:ef660e1f9ddc2a69b769d95500125c88a1de4cd39942252d500c839af11cfe30

Observation 0ca7405e-e211-4509-b744-a8c8386aa5e7 · outbound

This paper cites Pebbling game and alternative basis for high performance matrix multipli- cation.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Pebbling game and alternative basis for high performance matrix multipli- cation

Reference 52

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.681303Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:53.997641Z digest=sha256:403b7a52bf0d9534a088501c257499fabb601ec42de10fb872fb9dcb4e5986b9

Observation ec55100f-03e6-46bb-b7d5-57f3fb556f8f · outbound

This paper cites The bilinear complexity and practical algorithms for matrix multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation The bilinear complexity and practical algorithms for matrix multiplication

Reference 53

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.671215Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:54.000826Z digest=sha256:b2b7db7a8529a9a039a91b49c688d1d0afcc26a7cf1c6c11a12f4447964834b7

Observation c5dbbf49-11ac-4063-b2a9-e6315218177f · outbound

This paper cites Gaussian elimination is not optimal.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Gaussian elimination is not optimal

Reference 54

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.661261Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:54.004285Z digest=sha256:8f5ab56c75f911a13f9aa455e4e8c90a864b6a7d904315a6db05f7b4d416ffd5

Observation 7007bfbb-86c2-44e6-8c1f-22948c919207 · outbound

This paper cites The asymptotic spectrum of tensors and the exponent of matrix multiplication.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation The asymptotic spectrum of tensors and the exponent of matrix multiplication

Reference 55

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.649818Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:54.007476Z digest=sha256:2f4ee51b98d73476903bc28bc3a19e14edc3ec6a884bca913c71c9363d9f277f

Observation 56d0259e-09dc-4847-ba7a-cba5f7b65b01 · outbound

This paper cites Vermeidung von Divisionen.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Vermeidung von Divisionen

Reference 56

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.639716Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:54.011290Z digest=sha256:d07899ce39924ba3ae2380dcbd92c1e27b25dd24cb44da1dc2f550b925ec5963

Observation e5b741e3-c472-44a5-8aa7-d9532af137f1 · outbound

This paper cites Private communication with Austing R.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Private communication with Austing R

Reference 57

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.629476Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:54.015193Z digest=sha256:78448096d9fdd2041ed758bba3d0959ae7d7abce94ec71aec3c4dcdd0364d25f

Observation d7e79174-df29-46c9-b23a-6f986bdd9119 · outbound

This paper cites Multiplying matrices faster than Coppersmith-Winograd.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Multiplying matrices faster than Coppersmith-Winograd

Reference 58

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.619162Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:54.018520Z digest=sha256:10173438d1848b6672b6cf119a597b25afd953bc54e39802db30b49adf8a5fe8

Observation 7029edbe-b4d1-4fb2-8613-3d4ae3d23f2a · outbound

This paper cites New Bounds for Matrix Multiplication: from Alpha to Omega.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation New Bounds for Matrix Multiplication: from Alpha to Omega

Reference 59

Resolution
verified exact
local_arxiv, observed 2026-08-06T05:41:54.141587Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:54.021727Z digest=sha256:50a8799f97390faa00a48bab753dcf685cf81dcdb629bb579a2386031b0acdd6

Observation 4e8fa50d-543a-4a5d-ad8e-1d463b44b3e3 · outbound

This paper cites Private communication with Robert L.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Private communication with Robert L

Reference 60

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.608089Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:54.025266Z digest=sha256:ee804a14a9262a2ef9a6de6f47faa4f20f62e06ead9fe4287bac80b411efd5a5

Observation ae020597-bdb1-4aaa-95bc-89e10872cb9a · outbound

This paper cites an unresolved cited work.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Unresolved cited work

Reference 63

Resolution
unresolved
no resolver link, observed 2026-08-06T05:41:53.812039Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T05:41:53.812039Z digest=sha256:c60d4037b964ce85a67a3996e68057b2c6dfa80b9646783d98b680c2c65b4420

Observation 37424e27-d49c-4bad-8203-22172f74ebd4 · outbound

This paper cites For ease of notation, we omit the parameters n0, m0 when they are clear from context.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation For ease of notation, we omit the parameters n0, m0 when they are clear from context

Reference 64

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.596948Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:54.029298Z digest=sha256:bf71456d667d09d4f941a8dbefd3309ae9b9cfdb061eaa62232be32d80ff262e

Observation 730823e8-f49b-491c-8b03-9dfbb9e9df41 · outbound

This paper cites Denote the transformed inputs as ˜A, ˜B.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Denote the transformed inputs as ˜A, ˜B

Reference 65

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.585388Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:54.033139Z digest=sha256:5b6283ded02cd911949000dc333e0df256d558ae4ef8452b0d7551dc4c9d7967

Observation 99deb84d-e4e3-469e-9fc1-ed047a67e574 · outbound

This paper cites an unresolved cited work.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Unresolved cited work

Reference 66

Resolution
unresolved
raw_fallback, observed 2026-08-06T05:41:54.574658Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:54.036524Z digest=sha256:8b3272e9a66a70f983f771ab7bf2544e2befb2248f0c0a3e3a1ef93e657ea63d

Observation 898f93cc-2494-4a9a-912b-9b1f1854bcbe · outbound

This paper cites For ease of notation, if ϕ = ψ = ν we simply denote ⟨Uϕ, Vϕ, Wϕ⟩ϕ.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation For ease of notation, if ϕ = ψ = ν we simply denote ⟨Uϕ, Vϕ, Wϕ⟩ϕ

Reference 67

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.564195Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:54.039846Z digest=sha256:87e078f03384d52a0aa38ee88d5a7df2cd6f9cb54c0b15b01915334200a17083

Observation ecfedcb4-ca6d-404e-a0a8-0e45497c14cf · outbound

This paper cites Theorem D.8 ([5]).

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Theorem D.8 ([5])

Reference 68

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.553486Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:54.043263Z digest=sha256:a14944b8e40aec798e6fec5dfdbae17f0e40506c5dbaff55ba20de4ea5225817

Observation 3ea9ba00-ee1a-4132-b247-7e35cb47fbba · outbound

This paper cites Then FALG(n) = qUϕ + qVϕ + qWϕ t0 − s0 + 1 nω0 + 2qϕ + qϕT s0 − n2 0 − qUϕ + qVϕ + qWϕ t0 − s0 nlogn0 s0 − 2qϕ + qϕT s0 − n2 0 n2 Corollary D.9 ([5]).

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation Then FALG(n) = qUϕ + qVϕ + qWϕ t0 − s0 + 1 nω0 + 2qϕ + qϕT s0 − n2 0 − qUϕ + qVϕ + qWϕ t0 − s0 nlogn0 s0 − 2qϕ + qϕT s0 − n2 0 n2 Corollary D.9 ([5])

Reference 69

Resolution
verified fuzzy
raw_fallback, observed 2026-08-06T05:41:54.540639Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-06T05:41:54.047434Z digest=sha256:aab2d481c35753a638287744dc64e572f6311d50cef96fb274d8841fdc117e45

Observation a0bc9b8f-589e-439b-8358-141dab1e84c8 · outbound

This paper cites url: https://www.sciencedirect.

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation url: https://www.sciencedirect

Reference 3975

Resolution
unresolved
no resolver link, observed 2026-08-06T05:41:53.878939Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-06T05:41:53.878939Z digest=sha256:79a6b25c7ea2c42d99ae3c09bb98258ca02cdaa167f551267c450b85b01610c3

Pith citing papers

Observation cc5134a6-99b6-4c1c-b86f-2d16116844ba · inbound

Exploiting the Structure in Tensor Decompositions for Matrix Multiplication cites this paper.

Exploiting the Structure in Tensor Decompositions for Matrix Multiplication Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation

Reference 32

Resolution
verified exact
arxiv_id, observed 2026-05-22T11:36:29.138578Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-05-22T11:34:57.225987Z digest=sha256:087391af6d383a778ad8d06b282e67125df1387e3b605fc0dcbdf74921635f03