{"as_of":"2026-08-14T01:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eec9b9c3c931bd43484c1e944d4cc100d49c30db458e056bd3946f5ebd9b5093","coverage":[{"denominator":67,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":67,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T05:41:54.047434Z","state":"measured"},{"denominator":68,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":68,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T11:34:57.225987Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-22T11:36:29.136555Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"cited_work":{"arxiv_id":"2508.01748","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.01748","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e89a8bad-f084-492e-acbb-6432cfb8b397","year":2025},"citing_paper":{"arxiv_id":"2602.11041","last_updated":"2026-05-21T11:09:00Z","snapshot_observed_at":"2026-07-06T22:45:29.609382Z","submitted_at":"2026-02-11T17:12:34Z","title":"Exploiting the Structure in Tensor Decompositions for Matrix Multiplication","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-22T11:34:57.225987Z"},"links":{"cited_paper":"/paper/2508.01748","citing_paper":"/paper/2602.11041"},"observation_digest":"sha256:087391af6d383a778ad8d06b282e67125df1387e3b605fc0dcbdf74921635f03","observation_id":"cc5134a6-99b6-4c1c-b86f-2d16116844ba","resolution":{"observed_at":"2026-05-22T11:36:29.138578Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.01748/citation-record","integrity":"/paper/2508.01748/integrity","json":"/paper/2508.01748/citation-record.json","paper":"/paper/2508.01748"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:53.803913Z","title":"A Refined Laser Method and Faster Matrix Multiplication","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.803913Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:2f7dd1ad241355daafd7af1829b2da043a5580b9b150c056b13320e4cab2ec19","observation_id":"4386c9df-67d8-4d53-8506-96afaaa67f63","resolution":{"observed_at":"2026-08-06T05:41:53.803913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:53.808106Z","title":"More Asymmetry Yields Faster Matrix Multiplication","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.808106Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:ba57186414c0a3d518bea725419fd30732dd7fef94b9c3d9ffa4e62ef85bcc34","observation_id":"53aaaf58-5d28-401c-8769-930ce0690264","resolution":{"observed_at":"2026-08-06T05:41:53.808106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:55.056578Z","title":"Fast matrix multiplication: limitations of the Coppersmith- Winograd method","venue":null,"work_id":"4ede1b1f-8c35-4053-a25b-9b5dce6629d0","year":2015},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.816014Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:24980b87b315e17536fd546a38c8e64ab31b3f12c0512171bb8c3a82850b59b7","observation_id":"dc66c045-cd7f-495f-baf9-20ad27d07cae","resolution":{"observed_at":"2026-08-06T05:41:55.060074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:55.046545Z","title":"Adaptive flip graph algorithm for matrix multiplication","venue":null,"work_id":"0f480011-3e3f-44ea-8d66-c554db4746ee","year":2024},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.820269Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:867c8af7d8fec0d397c72e24f88268c76a8bc4277f5985856a0c13a84e9ca70b","observation_id":"0d49b797-223c-40a0-bec1-70c3f99e3e2e","resolution":{"observed_at":"2026-08-06T05:41:55.050193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3165.33231","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.524759Z","title":"Faster Matrix Multiplication via Sparse Decomposition","venue":null,"work_id":"09fd1298-cad5-4e15-bf66-f8f28c99f4ea","year":2019},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.823880Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:c9e4f108938f90ec49958205c4eb613d42080e726a9c729f022059bea4cb1019","observation_id":"32f1c741-a98c-4aca-b6a6-a95de735e6f4","resolution":{"observed_at":"2026-08-06T05:41:54.529860Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:55.036161Z","title":"Sparsifying the Operators of Fast Matrix Multiplication Algorithms","venue":null,"work_id":"d1de0190-5a14-4ce8-adda-724c73bd33e9","year":2020},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.827489Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:fbd085af21335dae5664dadcc165657d5b2b286c45508b5f231754e92ec157e5","observation_id":"650c1504-3320-45eb-b90b-b5c8eb7001a8","resolution":{"observed_at":"2026-08-06T05:41:55.039827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:55.026251Z","title":"A framework for practical parallel fast matrix multiplication","venue":null,"work_id":"380ef4e9-8624-4862-af06-02dba1320e1b","year":2015},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.831077Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:c59d68b71aa7dd9a7ae64aa2228a44bf634768b73fa576df1ba0c0cdf5bf45fb","observation_id":"6b0a14c8-0cb6-4bc2-9175-0b098c75d3fb","resolution":{"observed_at":"2026-08-06T05:41:55.029844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:55.016386Z","title":"Relations between exact and approximate bilinear algorithms. Applications","venue":null,"work_id":"a6c6f075-2dc3-4c27-89ef-473a153e3a79","year":1980},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.834375Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:076eb6e41d34e669114d10eb9473f446900bc212e554d9a23792b4cb3a305652","observation_id":"fdec2cdb-8ada-4ef8-9148-8ce17e9ac58c","resolution":{"observed_at":"2026-08-06T05:41:55.019983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:55.005467Z","title":"O(n2.7799) complexity for n × n approximate matrix multiplication","venue":null,"work_id":"b076d73e-6993-474f-bb8d-d75a20fce223","year":1979},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.838219Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:736e211376ad60cfd975f06fca41f42ba855b7f5463771aa1fcbc03c2b6a569d","observation_id":"ac0a94f8-a070-4973-b621-91ec591d73e1","resolution":{"observed_at":"2026-08-06T05:41:55.009222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.995401Z","title":"A 5 2 n2-Lower Bound for the Multiplicative Complexity of n × n-Matrix Multiplication","venue":null,"work_id":"49c0610f-7cbb-4de5-a604-e12930666af0","year":2001},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.842469Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:5e765991e15c773a2939fd3d0bed06b01e983ca76f699941e0b08d7114ee9659","observation_id":"192d6ecf-a173-4e35-a6b6-175ea51b76f9","resolution":{"observed_at":"2026-08-06T05:41:54.998817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.985417Z","title":"A Strassen-like matrix multiplication suited for squaring and higher power computation","venue":null,"work_id":"a5b0eb23-bfd3-45b4-8708-a730b1a9e42c","year":2010},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.846787Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:188c3eb28b5c033579c2fd9d4fecfc889c5d7e0de7df037bb841ffecf78c7cf8","observation_id":"e0583699-8f9c-4d0a-ad31-ac331ef79b95","resolution":{"observed_at":"2026-08-06T05:41:54.989307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.975045Z","title":null,"venue":null,"work_id":"00d82890-ecc1-4c40-a4b4-cc63f3e046f1","year":1970},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.851079Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:a45f5cad388dd99d5053a8156bc79be30d73b5b20b2c623d5bd5cc20007cc63d","observation_id":"1cc37aed-1ff2-4e53-bb1a-4cc4d6e2388d","resolution":{"observed_at":"2026-08-06T05:41:54.978426Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.964493Z","title":"On the additive complexity of 2 × 2 matrix multiplication","venue":null,"work_id":"010c22b2-1ffe-492b-8950-e95b8bfe47c8","year":1995},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.854940Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:bd3bc68a8ebfa0c25aae59e41ae8d5b473f45003cac709f63b64f94c3587533e","observation_id":"5fb4bae6-a988-4365-bcf4-a2207a451574","resolution":{"observed_at":"2026-08-06T05:41:54.967982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.954228Z","title":"On the arithmetic complexity of Strassen-like matrix multiplications","venue":null,"work_id":"a8106e02-65ca-4a96-875e-df512daef447","year":2017},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.858537Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:e74bf83d9737def5e9717824b2b247156ad2d37fce8267134a96973e2de8cc65","observation_id":"22072e9e-a005-4ce9-82ee-df2876b23085","resolution":{"observed_at":"2026-08-06T05:41:54.957591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.944557Z","title":"A group-theoretic approach to fast matrix multiplication","venue":null,"work_id":"a0dbfdaa-b96b-4769-8b54-031c767562a7","year":2003},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.861869Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:2996a4ccb37a6c2ae73d5c549ec44fb66d1085946a565d606027b15db2d155a3","observation_id":"e44113f4-0899-49b7-88dc-5625e9b3bd31","resolution":{"observed_at":"2026-08-06T05:41:54.948196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.934948Z","title":"Matrix multiplication via arithmetic progressions","venue":null,"work_id":"fd3c8b6b-1301-4568-8404-aa529d9e5bc2","year":1987},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.865094Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:8a5f5a7d3bd32dd4d25c16c0584bfe7ec75920a3afcbbcb2f5d2d879b3f2d9a0","observation_id":"20cf6969-51c4-447c-8fac-2a3d959e7a58","resolution":{"observed_at":"2026-08-06T05:41:54.938435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.925212Z","title":"Improved bound for complexity of matrix multiplica- tion","venue":null,"work_id":"27b238b6-378b-4d59-8c60-76060850b371","year":2013},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.868433Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:21d921894b230991a62ba482d40e0c7290ee05275862aebe2e225e276402b377","observation_id":"c664b3ee-53c4-4a13-9d91-18d2aff1520f","resolution":{"observed_at":"2026-08-06T05:41:54.928618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.915396Z","title":"On varieties of optimal algorithms for the computation of bilinear mappings II. optimal algorithms for 2× 2-matrix multiplication","venue":null,"work_id":"90812d40-602a-411b-9f59-6d351ecbc6c5","year":1978},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.875705Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:6970b661344fcff27c35fbdcaa74dea31fb7ebdd05d66c5fe2f38094d1be5268","observation_id":"f97b805b-4337-413b-bde9-3715dd361696","resolution":{"observed_at":"2026-08-06T05:41:54.919047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.905530Z","title":"Optimization techniques for small matrix multi- plication","venue":null,"work_id":"be9afa5b-96f9-45e3-8588-8bcc97eaec2e","year":2011},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.882802Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:0ca5263cdfd486f303fbd73f0388a2f6702a5267aefc38ede9b67aa65ee3223d","observation_id":"80955f17-defc-4e05-9fea-53b425c79107","resolution":{"observed_at":"2026-08-06T05:41:54.909183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.895413Z","title":"Faster matrix multiplication via asymmetric hashing","venue":null,"work_id":"f6e8696e-d5dc-4421-8aa8-e5dcc0bd7dc7","year":2023},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.885993Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:8f7f801e448523450fe13492f3941c0eba9d72aebdfa55e768660995df8f9f78","observation_id":"47467e50-1c17-453f-b3d2-62a417904463","resolution":{"observed_at":"2026-08-06T05:41:54.899385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.13242","last_updated":"2026-07-27T09:06:58Z","snapshot_observed_at":"2026-08-07T00:33:25.159915Z","submitted_at":"2025-06-16T08:42:15Z","title":"A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.13242","snapshot_observed_at":"2026-08-06T05:41:53.889326Z","title":"A non-commutative algorithm for multi- plying 4x4 matrices using 48 non-complex multiplications","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.889326Z"},"links":{"cited_paper":"/paper/2506.13242","citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:63f6bbaaf6aa2011fcbf850d5d50291320f51bb5614ccb64c356fa04c3fd14b4","observation_id":"e84a04ef-0eb1-41b0-a75d-1f4a1c2cd0f2","resolution":{"observed_at":"2026-08-06T05:41:53.889326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.885073Z","title":"Strassen’s algorithm is not optimally accurate","venue":null,"work_id":"b65aa7d9-27cd-4366-94e1-e3136ec5cd88","year":2024},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.893213Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:ef5362c86be37b1c9e4f96d65bc8855ae6a2388416c3f896cba77ef46af96811","observation_id":"991fa744-4fa0-4bed-b089-02e4b443a493","resolution":{"observed_at":"2026-08-06T05:41:54.889188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.874899Z","title":"Discovering faster matrix multiplication algorithms with reinforcement learning","venue":null,"work_id":"9a8a3d06-f55c-4121-acbb-2d4aaa61572d","year":2022},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.897265Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:9684de2083a930679ef6f7034560b5bc7261b1f192d857497fc159a05bcc8e1c","observation_id":"4b8a7596-5c75-4e01-8106-882c3f548e96","resolution":{"observed_at":"2026-08-06T05:41:54.878361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.865327Z","title":"Algebraic Complexity Theory","venue":null,"work_id":"e7b8bb4e-8424-49ee-999a-bc7548e3f0b2","year":1988},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.900628Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:4aa0e66e6f60b16dbc98e69323e0572f6e6d19e36e6257a9e75d06e860f1f9b8","observation_id":"cc8d60b4-e9f7-4b7c-882c-f4750905cc4b","resolution":{"observed_at":"2026-08-06T05:41:54.868381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.855828Z","title":"Towards practical fast matrix multiplication based on trilinear aggregation","venue":null,"work_id":"ebda6a9a-1643-4d05-819c-3423f84a1d40","year":2023},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.904664Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:e533a6b5f7399344466bca0f1fc3b92ffee70903e67036352b507416483e9032","observation_id":"a2ba5ea8-f174-4f3b-8c86-f348f431293c","resolution":{"observed_at":"2026-08-06T05:41:54.859097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.846332Z","title":"Local search for fast matrix multiplication","venue":null,"work_id":"9025a5a2-6884-4645-91c7-320a5ab47bdd","year":2019},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.908538Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:a7311a2591aa3ed1a62df3bf14fa3f88ccd4a956cdf9a1733dd5a7d0c1ada30b","observation_id":"f9ad2a2a-5a06-4f0a-9733-5d65dc8b415e","resolution":{"observed_at":"2026-08-06T05:41:54.849560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:53.912396Z","title":"New ways to multiply 3 × 3-matrices","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.912396Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:52fa26d9c74baedcf4782aa449bc190b80e66a8e10b18e0596be460b0689783e","observation_id":"f882e2fd-7a4e-49b9-aa2b-e56ffb727f7c","resolution":{"observed_at":"2026-08-06T05:41:53.912396Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.835536Z","title":"On minimizing the number of multiplications necessary for matrix multiplication","venue":null,"work_id":"2b44c96f-7b2c-4406-aa12-f4c4e534013d","year":1971},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.916410Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:9cbf6bebd2a4a0b2f046398d6153f1effe947bd9212ac134d7b84b210303e2af","observation_id":"bd695032-8bdd-4041-b35c-99cb02bba00f","resolution":{"observed_at":"2026-08-06T05:41:54.839134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.825072Z","title":"Duality applied to the complexity of matrix multiplications and other bilinear forms","venue":null,"work_id":"e3d23250-b6a5-415d-bc7a-34285fb8baa7","year":1973},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.920614Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:c36e061921819f7910c078b788f916993f24181f29ab39f841de1aaecd9bb5f6","observation_id":"fff1fd44-28ed-493b-8eec-2e6d24aad37a","resolution":{"observed_at":"2026-08-06T05:41:54.829201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.815231Z","title":"Noncommutative Bilinear Algorithms for 3*3 Matrix Multi- plication","venue":null,"work_id":"fc473edc-6d00-4061-aca6-cecfe9132d0c","year":1986},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.924169Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:c2fa08c85b4cfb5ad8e3f2dcbc440d435282735f5cf024dc375fa50281a7b2ab","observation_id":"b01e3bc2-5821-42c7-a55b-eb9b572752dd","resolution":{"observed_at":"2026-08-06T05:41:54.818791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.803967Z","title":"Finding complex-valued solutions of Brent equations using nonlinear least squares","venue":null,"work_id":"c4cc248b-8206-48df-8ceb-26fd19416fc3","year":2024},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.927676Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:60a0c0328bdbd15a2613131a88fc0e729b1efad5f6eb384e1dcdcc0f1a83a715","observation_id":"0f17eb74-d215-4102-8566-f594955997e9","resolution":{"observed_at":"2026-08-06T05:41:54.808031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.793808Z","title":"The aggregation and cancellation techniques as a practical tool for faster matrix multiplica- tion","venue":null,"work_id":"a4a0677c-52ca-4cce-af43-0ce28e0434a5","year":2004},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.931242Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:2fb05b199037a97e49b921f83199b0c4ea877e4c88392a496aab13548be1ab18","observation_id":"780f1f6d-69de-481d-95cb-655f9969307e","resolution":{"observed_at":"2026-08-06T05:41:54.797446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3364504","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Matrix Multiplication, a Little Faster","venue":"Journal of the ACM","work_id":"2179d5ca-8119-42ff-8874-8ea217226f75","year":2020},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.934634Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:7f41b1c5af9ee40b84dbfcc8f3c62b5ac3ee332dec3f580c3fdeda00e4565d4a","observation_id":"3b359c45-ebba-43f2-bf1c-7f38577ca891","resolution":{"observed_at":"2026-08-06T05:41:54.103368Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7066.35971","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.360946Z","title":"Flip Graphs for Matrix Multiplication","venue":null,"work_id":"4fcfdf14-8bf8-448d-8f95-8a07fbdc3c03","year":2023},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.938142Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:9937117b818ee5fa047e26ff2bb553e2c939ba880b3b6a605fd8d37cf3889ab4","observation_id":"2d83fe24-06c9-4732-b918-6f12029846cb","resolution":{"observed_at":"2026-08-06T05:41:54.366693Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2020.37120","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.292359Z","title":"Some New Non-Commutative Matrix Multiplication Algorithms of Size (n, m, 6)","venue":null,"work_id":"9fc7bab6-1197-47b9-9881-9cb61ad62666","year":2025},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.941497Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:0bc8a21f111170abc2e54538e7ab231796fcdcde73b8dee8bbeab91fa4f12521","observation_id":"773e9422-155f-4a6c-8baf-dc775917f3f1","resolution":{"observed_at":"2026-08-06T05:41:54.298075Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.783411Z","title":"A noncommutative algorithm for multiplying 3*3 matrices using 23 multiplications","venue":null,"work_id":"d7835943-c40b-4f76-aa50-90abba132a0a","year":1976},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.944761Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:6c90cb527dc171f47a9e7130813717f885842172f2c5048baa8b330054e17057","observation_id":"953dff60-c125-4347-b90c-0c0b9fb2373a","resolution":{"observed_at":"2026-08-06T05:41:54.787172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.773190Z","title":"On practical algorithms for accelerated matrix multipli- cation","venue":null,"work_id":"902e6ced-e0f1-443d-b011-36fc8001201c","year":1992},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.948518Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:21b809832f89fd366b26c7a022ecdd0fdf8e8455611adbff63c1ec8436eb1c07","observation_id":"9747de0f-5df5-40b7-8d02-ee874bf0f779","resolution":{"observed_at":"2026-08-06T05:41:54.776892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.762145Z","title":"Powers of tensors and fast matrix multiplication","venue":null,"work_id":"0248a348-33f6-493d-b0e5-cbe152c8efc5","year":2014},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.951764Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:ad691f0dc720ce402355740a85c2cdf1a08daaafecc28f86eddf3cdc7abbb301","observation_id":"fbfc99fb-2b89-4c93-a814-27a4eb9ef512","resolution":{"observed_at":"2026-08-06T05:41:54.765998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.751401Z","title":"Communication-avoiding parallel Strassen: Implementation and performance","venue":null,"work_id":"8baf2ba4-4f3d-4466-a115-dd6476fde88b","year":2012},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.955850Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:8df5c20917dda94b5df8f61b1164234694649b0697fa64acc32146ce943c2d00","observation_id":"7e633bba-4aef-4f09-910d-86332ed55a48","resolution":{"observed_at":"2026-08-06T05:41:54.755943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.741333Z","title":"The Number of the Beast: Reducing Additions in Fast Matrix Multiplication Algorithms for Dimensions up to 666","venue":null,"work_id":"8e7f67ac-83fa-4e31-b54a-f2fde3103fe7","year":2024},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.959663Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:312d770c55391a132f9db6bb9103921aa9f09d9020947e0dc9f8ac56678a86f9","observation_id":"c88bd7bf-fcaa-430e-a85a-14478ca1628a","resolution":{"observed_at":"2026-08-06T05:41:54.745095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.04514","last_updated":"2025-02-06T21:33:00Z","snapshot_observed_at":"2026-08-14T00:54:36.318262Z","submitted_at":"2025-02-06T21:33:00Z","title":"Flip Graphs with Symmetry and New Matrix Multiplication Schemes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.04514","snapshot_observed_at":"2026-08-06T05:41:53.963023Z","title":"Flip Graphs with Symmetry and New Matrix Multiplication Schemes","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.963023Z"},"links":{"cited_paper":"/paper/2502.04514","citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:e4888538409d4a796c89958e8581ffd731f4bdc46e543682474b99e9ef250400","observation_id":"6aac84ff-d491-4b6d-89eb-5cd2e68b2d41","resolution":{"observed_at":"2026-08-06T05:41:53.963023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.729433Z","title":"Multiplying 2 × 2 Sub-Blocks Using 4 Multiplications","venue":null,"work_id":"d831973c-51cc-4690-b398-52bd5670a22b","year":2023},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.966529Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:664d0ff12badc60e7131d415c804deb189514b23d27723a285dee7644fbc93eb","observation_id":"9be6dc1b-b346-465d-9690-5e51e40172d1","resolution":{"observed_at":"2026-08-06T05:41:54.733664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.718800Z","title":"AlphaEvolve: A coding agent for scientific and algorithmic discovery","venue":null,"work_id":"28fbcc95-6469-4bd0-930e-2f088aa69825","year":2025},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.969834Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:7f56b8fc4795e565f9159ff53c81cd34b0e74f71abf29450264472edfad3c14a","observation_id":"5127a85f-9565-498d-b4ec-2d1c170d8120","resolution":{"observed_at":"2026-08-06T05:41:54.722476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.708152Z","title":"On schemes for the computation of products and inverses of matrices","venue":null,"work_id":"5fe56355-c707-4eb5-89e4-b7b9afb95312","year":1972},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.974054Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:19b93fa1706e8dcaeb4f6b5931a677af72ec87d87661603420d24111a577a304","observation_id":"d84737ca-3d1f-4e41-a8f7-6e54e6652bc0","resolution":{"observed_at":"2026-08-06T05:41:54.711918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0209027","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"New Fast Algorithms for Matrix Operations","venue":"SIAM Journal on Computing","work_id":"98cc5b80-8c4e-493c-ab8f-4c84ceefd644","year":1980},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.977406Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:4a4b1de3fa649db726cea20ecc81e186ed5c8504061041cb7e492cb4a9bf5d12","observation_id":"1faaaaf1-58cc-495c-87c2-173dd3b5a743","resolution":{"observed_at":"2026-08-06T05:41:54.092333Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:53.980750Z","title":"Strassen’s algorithm is not optimal trilinear technique of aggregating, uniting and cancel- ing for constructing fast algorithms for matrix operations","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.980750Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:866cd1015f38497f73a6f43cac0638f695f7c2005d60e2f2dfa0ab9ea5692952","observation_id":"ba09c863-f3a7-478a-b97d-b87682b07c6f","resolution":{"observed_at":"2026-08-06T05:41:53.980750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:53.984192Z","title":"Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.984192Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:c04f73ea4f59e34c6f10ac9d4b805f02bf9dc2eba7f3f4ef387f2cb8f82904ee","observation_id":"7c06b841-0a8d-490d-8dab-0694c2352f7e","resolution":{"observed_at":"2026-08-06T05:41:53.984192Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.698173Z","title":"On the additive complexity of matrix multiplication","venue":null,"work_id":"93575058-2bde-417c-a31b-014351a49910","year":1976},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.987364Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:dd7b3734c6a5fa2d9096423bf5f699f936f0a576322e8c5d7ffe951c877d91d3","observation_id":"88c68a16-4c2f-4863-a6b2-789fbcb0b0f2","resolution":{"observed_at":"2026-08-06T05:41:54.701686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.688026Z","title":"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’","venue":null,"work_id":"6ccf296e-21bd-45bc-8934-cf8fc03204aa","year":1992},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.990905Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:aecc73ad6f10f006279d9226f8ef1c50355798a92df6c75305775ce68a8c4e10","observation_id":"e3ae0980-5aa7-48c5-bec1-45505d11ba02","resolution":{"observed_at":"2026-08-06T05:41:54.691709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:53.994412Z","title":"Partial and Total Matrix Multiplication","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.994412Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:ef660e1f9ddc2a69b769d95500125c88a1de4cd39942252d500c839af11cfe30","observation_id":"7d6a4303-ed94-4844-97fb-fc834c5c4f9e","resolution":{"observed_at":"2026-08-06T05:41:53.994412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.677561Z","title":"Pebbling game and alternative basis for high performance matrix multipli- cation","venue":null,"work_id":"37d9744d-917f-4314-8089-73a6327d2129","year":2023},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.997641Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:403b7a52bf0d9534a088501c257499fabb601ec42de10fb872fb9dcb4e5986b9","observation_id":"0ca7405e-e211-4509-b744-a8c8386aa5e7","resolution":{"observed_at":"2026-08-06T05:41:54.681303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.667607Z","title":"The bilinear complexity and practical algorithms for matrix multiplication","venue":null,"work_id":"6b045f58-04c3-4bd3-af53-205e6e69e065","year":2013},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:54.000826Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:b2b7db7a8529a9a039a91b49c688d1d0afcc26a7cf1c6c11a12f4447964834b7","observation_id":"ec55100f-03e6-46bb-b7d5-57f3fb556f8f","resolution":{"observed_at":"2026-08-06T05:41:54.671215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.657555Z","title":"Gaussian elimination is not optimal","venue":null,"work_id":"9a8be076-9087-489c-9da0-e996b52c44f7","year":1969},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:54.004285Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:8f5ab56c75f911a13f9aa455e4e8c90a864b6a7d904315a6db05f7b4d416ffd5","observation_id":"c5dbbf49-11ac-4063-b2a9-e6315218177f","resolution":{"observed_at":"2026-08-06T05:41:54.661261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.646167Z","title":"The asymptotic spectrum of tensors and the exponent of matrix multiplication","venue":null,"work_id":"3806042c-60e8-457d-a71a-1be6beadedca","year":1986},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:54.007476Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:2f4ee51b98d73476903bc28bc3a19e14edc3ec6a884bca913c71c9363d9f277f","observation_id":"7007bfbb-86c2-44e6-8c1f-22948c919207","resolution":{"observed_at":"2026-08-06T05:41:54.649818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.636301Z","title":"Vermeidung von Divisionen","venue":null,"work_id":"b93dc341-20fb-4675-9028-0feb40d801b6","year":1973},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:54.011290Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:d07899ce39924ba3ae2380dcbd92c1e27b25dd24cb44da1dc2f550b925ec5963","observation_id":"56d0259e-09dc-4847-ba7a-cba5f7b65b01","resolution":{"observed_at":"2026-08-06T05:41:54.639716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.625601Z","title":"Private communication with Austing R","venue":null,"work_id":"9dbea2c1-3997-4b22-a0f0-7a5a6d914f3d","year":2015},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:54.015193Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:78448096d9fdd2041ed758bba3d0959ae7d7abce94ec71aec3c4dcdd0364d25f","observation_id":"e5b741e3-c472-44a5-8aa7-d9532af137f1","resolution":{"observed_at":"2026-08-06T05:41:54.629476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.614609Z","title":"Multiplying matrices faster than Coppersmith-Winograd","venue":null,"work_id":"79683495-070a-476f-a6f3-f184ff58e5ba","year":2012},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:54.018520Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:10173438d1848b6672b6cf119a597b25afd953bc54e39802db30b49adf8a5fe8","observation_id":"d7e79174-df29-46c9-b23a-6f986bdd9119","resolution":{"observed_at":"2026-08-06T05:41:54.619162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.07970","last_updated":"2023-11-04T04:45:36Z","snapshot_observed_at":"2026-08-13T20:41:50.945277Z","submitted_at":"2023-07-16T07:46:06Z","title":"New Bounds for Matrix Multiplication: from Alpha to Omega","version":2},"cited_work":{"arxiv_id":"2307.07970","doi":null,"metadata_source":"pith","pith_arxiv_id":"2307.07970","snapshot_observed_at":"2026-08-06T05:41:54.137523Z","title":"New Bounds for Matrix Multiplication: from Alpha to Omega","venue":"cs.DS","work_id":"daad6508-cc02-49c0-aa96-3fe7e4c2608d","year":2023},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:54.021727Z"},"links":{"cited_paper":"/paper/2307.07970","citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:50a8799f97390faa00a48bab753dcf685cf81dcdb629bb579a2386031b0acdd6","observation_id":"7029edbe-b4d1-4fb2-8613-3d4ae3d23f2a","resolution":{"observed_at":"2026-08-06T05:41:54.141587Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.604118Z","title":"Private communication with Robert L","venue":null,"work_id":"14816927-f556-44bf-82f7-5935bfd3c29a","year":1976},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:54.025266Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:ee804a14a9262a2ef9a6de6f47faa4f20f62e06ead9fe4287bac80b411efd5a5","observation_id":"4e8fa50d-543a-4a5d-ad8e-1d463b44b3e3","resolution":{"observed_at":"2026-08-06T05:41:54.608089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:53.812039Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.812039Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:c60d4037b964ce85a67a3996e68057b2c6dfa80b9646783d98b680c2c65b4420","observation_id":"ae020597-bdb1-4aaa-95bc-89e10872cb9a","resolution":{"observed_at":"2026-08-06T05:41:53.812039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.592313Z","title":"For ease of notation, we omit the parameters n0, m0 when they are clear from context","venue":null,"work_id":"3ec997e6-2fcf-4ad2-b2e9-86ccb5167150","year":1936},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:54.029298Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:bf71456d667d09d4f941a8dbefd3309ae9b9cfdb061eaa62232be32d80ff262e","observation_id":"37424e27-d49c-4bad-8203-22172f74ebd4","resolution":{"observed_at":"2026-08-06T05:41:54.596948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.582115Z","title":"Denote the transformed inputs as ˜A, ˜B","venue":null,"work_id":"86e8e169-25b9-4d69-90be-08f55938a859","year":null},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:54.033139Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:5b6283ded02cd911949000dc333e0df256d558ae4ef8452b0d7551dc4c9d7967","observation_id":"730823e8-f49b-491c-8b03-9dfbb9e9df41","resolution":{"observed_at":"2026-08-06T05:41:54.585388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.570930Z","title":null,"venue":null,"work_id":"a3be4d2e-554e-41b4-ab0b-c82cc322c5bf","year":null},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:54.036524Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:8b3272e9a66a70f983f771ab7bf2544e2befb2248f0c0a3e3a1ef93e657ea63d","observation_id":"99deb84d-e4e3-469e-9fc1-ed047a67e574","resolution":{"observed_at":"2026-08-06T05:41:54.574658Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.560551Z","title":"For ease of notation, if ϕ = ψ = ν we simply denote ⟨Uϕ, Vϕ, Wϕ⟩ϕ","venue":null,"work_id":"36f0818c-24f8-4c46-910d-4294005bc2eb","year":null},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:54.039846Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:87e078f03384d52a0aa38ee88d5a7df2cd6f9cb54c0b15b01915334200a17083","observation_id":"898f93cc-2494-4a9a-912b-9b1f1854bcbe","resolution":{"observed_at":"2026-08-06T05:41:54.564195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.550031Z","title":"Theorem D.8 ([5])","venue":null,"work_id":"56bc8eee-cf44-4c42-a018-658190e6692b","year":null},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:54.043263Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:a14944b8e40aec798e6fec5dfdbae17f0e40506c5dbaff55ba20de4ea5225817","observation_id":"ecfedcb4-ca6d-404e-a0a8-0e45497c14cf","resolution":{"observed_at":"2026-08-06T05:41:54.553486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:54.536850Z","title":"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])","venue":null,"work_id":"bb42fc25-d0b2-495c-a06b-83461e70d4e7","year":1982},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:54.047434Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:aab2d481c35753a638287744dc64e572f6311d50cef96fb274d8841fdc117e45","observation_id":"3ea9ba00-ee1a-4132-b247-7e35cb47fbba","resolution":{"observed_at":"2026-08-06T05:41:54.540639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:41:53.878939Z","title":"url: https://www.sciencedirect","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation","version":1},"reference_index":3975,"source":"pdf_text","source_observed_at":"2026-08-06T05:41:53.878939Z"},"links":{"citing_paper":"/paper/2508.01748"},"observation_digest":"sha256:79a6b25c7ea2c42d99ae3c09bb98258ca02cdaa167f551267c450b85b01610c3","observation_id":"a0bc9b8f-589e-439b-8358-141dab1e84c8","resolution":{"observed_at":"2026-08-06T05:41:53.878939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.01748","last_updated":"2025-08-03T13:15:24Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T20:57:35.238860Z","submitted_at":"2025-08-03T13:15:24Z","title":"Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation"},"reference_resolution":{"displayed":67,"state_counts":{"malformed_identifier":1,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":11,"verified_exact":3,"verified_fuzzy":49},"total_outbound_references":67},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 67 of 67 outbound references and 1 inbound Pith citation observation for arXiv:2508.01748."}