Pith. sign in

Paper Citation Record · LEDGER

Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation

As of 23 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-23T06:30:58.430688+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:c11f91c8d43c7d6ff73a04272b2ae4dd5271e393f4da35f073ea29d9c4dbed95

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:dff3e32f9616294e13d31b3b50b59acdba43f297944c644d6e4cc5870646b06b

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.816014Z digest=sha256:40bf4e4e3d27205af8c04e3549a6dcb78894a4536b62aa9ee92eb351b4ffdf42

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.820269Z digest=sha256:8bdf35c4d6d17cbd682d028645a5849f5e5dd274145440338bb00f5bca49d0a1

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.834375Z digest=sha256:4fcf8790408334b818f5942f1051a809baa0d88419dcca5e02aa433f3cd6fa33

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.846787Z digest=sha256:7862a55bc66012ef9e6c96ebf828c49d5e396c76a8a23c91ab89d49c888eb29d

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.865094Z digest=sha256:5f955f4e11d9f63a435d5ddd4fe8e0b9bf30abe966b8c33728ac64b974cd8274

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.868433Z digest=sha256:24c1dab0fbd9863ae6a1fc2b5c4e541385e55ec0ae760f6a542c3709f75e448a

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.875705Z digest=sha256:332b04d0b9c39c71e38b556079921d4fce72fb50d18fc3909d2b55451d2c2f72

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.885993Z digest=sha256:183b961c6b6b13ef5b96b8099d185bc9019ae8db888b50bb991490583b4ad2e2

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:979cd6a0fc08e8cb85a6102ae5ad53489956e54f7861727b29620d045dbd2f5b

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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:52413be6186881d292180d5815ff3a1b9557a392848c8fe7e2b5be5aa4a36a11

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.931242Z digest=sha256:7407cf12ed8a9834014c9ee25a5ab9847d3b41072591dddffea53412392dc0c7

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.934634Z digest=sha256:201329cf73a25ddf16d916e617d8800e1a69bdc1923e6480d7a435efde02669e

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.938142Z digest=sha256:1cdccc531dc520a408e3ba2abc2d7831897f2bcc485031d76baf43aedc867b89

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.944761Z digest=sha256:688da7ba15179fdf5d03fec9959dc902a9b2ffa17124dacab78ca4d51df19f54

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.955850Z digest=sha256:1771176d37a867f705f9014ddb427756ea0bc617e7ce9933ce130061e2a0649f

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.959663Z digest=sha256:4e690396b2cc7fc605e7597c8dfcbff303e2294be0491715bfbc8a9a0237a079

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:c6112dff58b5baf7670747a85a84241ebe3a6976bc71605959d2f71bd61636d8

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.966529Z digest=sha256:7c42250550a9468ae4fc635ce9a8c0ab501c4a5c43709a95318fc0e45aa94202

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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:c8c41769436636904967c23f3eb0ff0ba089e3c4458c55ebf0b42350a1b352df

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:677271239c594bb7ffbb43e5ae8c093724e27b1c8ca1a60458c71987ce9937f7

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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:7c189715ef522281b341889821e6848af987780bde959b9e2a0ed72a7907a2aa

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:53.997641Z digest=sha256:2717ae9dabcd4385a8c4eccc8f536d850ad1d94f3297e0dc1fc359fb1d191eb7

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:54.004285Z digest=sha256:350ac9b6a3887be16c71bd83ed48a2e7d6712cf5812a17111d8778420bff8913

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:54.007476Z digest=sha256:3a86c05d491329d850b8a9070bb6bd9f26bbac786d920d99dd8f730fd75a7900

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:54.018520Z digest=sha256:7ef860b1812274cc2776bca223d671915e46e948673ed3451812cc2c583dbb15

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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:9a98dfcc6c58222866dcd2c87bbb189d8e2ebc37339795789d04e6c3f925e634

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:54.033139Z digest=sha256:3af17ff67ad6a3320a1918de53fa5f4a9c8c542f7a4d8c050822a05321213080

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-08-06T05:41:54.039846Z digest=sha256:5bf002383d3543f27e2cd67d40955bdfa486422f59a58ae49dc4f9bc402682da

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-23T06:30:58.430688+00:00.

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

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-23T06:30:58.430688+00:00.

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

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:af2bd4c694b550b87a90ad8598e31c99d2fe98507570c7ae04d50d1dd62c8df6

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-23T06:30:58.430688+00:00.

source=pdf_text observed=2026-05-22T11:34:57.225987Z digest=sha256:53ed0459fce597cda4f90bf95a51f6a591bf0990abf00c992aa698e6662ec80a