{"as_of":"2026-08-14T13:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cc90de7c124650c4850e4072fc682b0c4467fca585e01fafd410e607195d6221","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T00:42:52.421809Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:23:31.332270Z","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-07-03T16:38:39.962227Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-06T22:23:31.332270Z","title":"A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.22113","last_updated":"2025-06-27T10:47:04Z","snapshot_observed_at":"2026-08-13T03:03:21.633642Z","submitted_at":"2025-06-27T10:47:04Z","title":"Exploring Commutative Matrix Multiplication Schemes via Flip Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:23:31.332270Z"},"links":{"cited_paper":"/paper/2506.13242","citing_paper":"/paper/2506.22113"},"observation_digest":"sha256:970ad1b10cdb26d75b8fa25573c4d122523c11bb3cc659c8559071bf1a3dc5c0","observation_id":"a51cb1e6-4996-4494-af38-1de95f14b08c","resolution":{"observed_at":"2026-08-06T22:23:31.332270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":{"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":"2506.13242","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.13242","snapshot_observed_at":"2026-07-28T03:23:17.841006Z","title":"A non-commutative algorithm for multiplying4 × 4matrices using 48 non-complex multiplications, 2025","venue":null,"work_id":"db0f67da-5cb4-4151-9aef-adc46bebaae0","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":10,"source":"pdf_text","source_observed_at":"2026-05-22T11:34:57.225987Z"},"links":{"cited_paper":"/paper/2506.13242","citing_paper":"/paper/2602.11041"},"observation_digest":"sha256:53a204fcdf4212f3be9097b51bec8f5b3a03663c54ecb6a08d27002faf3240b9","observation_id":"16ec32be-fc9c-4098-acaa-38dff32598c8","resolution":{"observed_at":"2026-07-28T03:23:17.841006Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-02T17:55:39.483002Z","title":"A non-commutative algorithm for multiplying 4 × 4 matrices using 48 non-complex multiplications","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T12:43:05.161451Z","submitted_at":"2026-03-19T09:58:19Z","title":"A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:39.483002Z"},"links":{"cited_paper":"/paper/2506.13242","citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:82de44cbfcbb73484687f8e60e7e2c4ceab101a00286a37e1e48715f985bc693","observation_id":"455063b8-b725-44e4-b286-15cebf86f8fd","resolution":{"observed_at":"2026-08-02T17:55:39.483002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":"2506.13242","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.13242","snapshot_observed_at":"2026-07-28T03:23:17.841006Z","title":"A non-commutative algorithm for multiplying4 × 4matrices using 48 non-complex multiplications, 2025","venue":null,"work_id":"db0f67da-5cb4-4151-9aef-adc46bebaae0","year":2025},"citing_paper":{"arxiv_id":"2606.13408","last_updated":"2026-06-11T14:38:02Z","snapshot_observed_at":"2026-08-13T06:53:47.362848Z","submitted_at":"2026-06-11T14:38:02Z","title":"A catalog of fast matrix multiplication algorithms with frontier-closure search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T05:13:01.363692Z"},"links":{"cited_paper":"/paper/2506.13242","citing_paper":"/paper/2606.13408"},"observation_digest":"sha256:5389b270c270037263087b7395378361d3d11a86935191bf80f4f9bd14373933","observation_id":"a4c89084-13f7-4361-be47-16d0c2bd88b0","resolution":{"observed_at":"2026-07-28T03:23:17.841006Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-02T00:18:33.365532Z","title":"Dumas, C","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.15069","last_updated":"2026-07-16T14:43:28Z","snapshot_observed_at":"2026-08-14T10:40:41.008822Z","submitted_at":"2026-07-16T14:43:28Z","title":"Substitution and quotient of the isotropy group action","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T00:18:33.365532Z"},"links":{"cited_paper":"/paper/2506.13242","citing_paper":"/paper/2607.15069"},"observation_digest":"sha256:c0f9271db4e35943df6dd70a0430f96fa52ff05f4c2fe675dff5587d2d9d5113","observation_id":"a469b146-4cfb-44d9-be71-f7cffd686ffe","resolution":{"observed_at":"2026-08-02T00:18:33.365532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.13242/citation-record","integrity":"/paper/2506.13242/integrity","json":"/paper/2506.13242/citation-record.json","paper":"/paper/2506.13242"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:42:52.849227Z","title":"PLinOpt, a collection of C++ routines handling linear & bilinear programs, January 2024","venue":null,"work_id":"138f9fe4-09c4-426e-b3a7-068e6c7b26cf","year":2024},"citing_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},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:52.352569Z"},"links":{"citing_paper":"/paper/2506.13242"},"observation_digest":"sha256:077934b9669aefbece0909f7b4e38bb2c521b1f1d57513dcdcd90ef7022a39a5","observation_id":"95b12c03-a137-4507-adc2-ce00d353fc2b","resolution":{"observed_at":"2026-08-07T00:42:52.854821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:42:52.831739Z","title":"Strassen’s algorithm is not op- timally accurate","venue":null,"work_id":"af76bb4c-11a1-45c5-a887-73ab31e9a91d","year":2024},"citing_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},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:52.357890Z"},"links":{"citing_paper":"/paper/2506.13242"},"observation_digest":"sha256:7344f5d21c31134775ae8485b7360e048e89cf2d59c87592e679ded2538501d7","observation_id":"f5e9928d-ee5a-4bcc-8f02-3847717e3940","resolution":{"observed_at":"2026-08-07T00:42:52.836808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:42:52.815621Z","title":"A non-commutative algorithm for multiplying a 3 × 4 matrix by a 4 × 7 matrix using 63 non-complex multiplications","venue":null,"work_id":"a4af384d-ef50-427b-aa0a-5fd6f09f1788","year":2025},"citing_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},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:52.367338Z"},"links":{"citing_paper":"/paper/2506.13242"},"observation_digest":"sha256:1a334d3f3623faf0061347d1f8ce19cf5eaeb60abd26f40731115cc3685c8914","observation_id":"9cbeac1b-3fb5-4964-a7ca-472a5205647d","resolution":{"observed_at":"2026-08-07T00:42:52.820694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:42:52.799417Z","title":"Towards automated generation of fast and accurate algorithms for recursive matrix multiplication","venue":null,"work_id":"751e64ab-af39-4e68-9ef0-c42ba816e8b7","year":2025},"citing_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},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:52.372230Z"},"links":{"citing_paper":"/paper/2506.13242"},"observation_digest":"sha256:8e80f8d8eb7bd5653f062f27d964d4666127f25e13d5aa4b95c9fef2b10b7e2f","observation_id":"b1f19e76-2c44-41b4-ac6f-45e25fe8de0f","resolution":{"observed_at":"2026-08-07T00:42:52.804433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:42:52.377566Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:52.377566Z"},"links":{"citing_paper":"/paper/2506.13242"},"observation_digest":"sha256:533064d742fd32b7dcd869072b6f444244c684da91de80970403207030515f24","observation_id":"ea8c4a05-3d82-441c-846d-ab0afebbae67","resolution":{"observed_at":"2026-08-07T00:42:52.377566Z","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-07T00:42:52.783046Z","title":"On varieties of optimal algorithms for the computation of bilinear mappings I","venue":null,"work_id":"0be9659c-36eb-47c4-a329-a6ee360dbce3","year":null},"citing_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},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:52.382395Z"},"links":{"citing_paper":"/paper/2506.13242"},"observation_digest":"sha256:4bc7a7738ae67e9e3eb8083da2c28daa1054caa18b9521a18f66fbabf4925e1d","observation_id":"81d63498-295f-4460-95dd-b327bfa82a82","resolution":{"observed_at":"2026-08-07T00:42:52.788403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0304-3975(78)90045-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"On varieties of optimal algorithms for the computation of bilinear mappings II","venue":"Theoretical Computer Science","work_id":"270b41cb-963c-432c-bdb8-7b70202a9c82","year":1978},"citing_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},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:52.392040Z"},"links":{"citing_paper":"/paper/2506.13242"},"observation_digest":"sha256:4110f5790aeaca849d3689d5807ba7d769fcf64fb1e061a54b9828278821c693","observation_id":"3d022f82-07c8-45b3-8bbd-3c4080361caf","resolution":{"observed_at":"2026-08-07T00:42:52.496245Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:42:52.397587Z","title":"Finding complex-valued solutions of Brent equations using nonlinear least squares","venue":null,"work_id":null,"year":2024},"citing_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},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:52.397587Z"},"links":{"citing_paper":"/paper/2506.13242"},"observation_digest":"sha256:9db31750ea46ddcd53a3d29ebb801b37b7f6e64945a28bbd4cf41357ef3abea0","observation_id":"83f9d5f1-4ff7-4d09-8053-fe15b611072d","resolution":{"observed_at":"2026-08-07T00:42:52.397587Z","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":"7556.30875","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T00:42:52.669762Z","title":"Matrix multiplication, a little faster","venue":null,"work_id":"81a36766-4bb4-49fd-95bf-3b958f7958cb","year":2017},"citing_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},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:52.402317Z"},"links":{"citing_paper":"/paper/2506.13242"},"observation_digest":"sha256:4059d7201ddeb06ae603c7974ce13213429582ecab008ce2efd05e42906f3b40","observation_id":"cb511e1e-05a4-4a5a-a407-d868656ee7f2","resolution":{"observed_at":"2026-08-07T00:42:52.679006Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:42:52.407062Z","title":"Landsberg","venue":null,"work_id":null,"year":2016},"citing_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},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:52.407062Z"},"links":{"citing_paper":"/paper/2506.13242"},"observation_digest":"sha256:17b164b6d36879b0ba1aa990c7d9cf54db4f26a2b8dea3f1c27dcbcb484a2451","observation_id":"fce3b96f-d7c8-4d60-8691-ed0ba08c0d12","resolution":{"observed_at":"2026-08-07T00:42:52.407062Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.13131","last_updated":"2025-06-16T06:37:18Z","snapshot_observed_at":"2026-08-11T23:48:15.512738Z","submitted_at":"2025-06-16T06:37:18Z","title":"AlphaEvolve: A coding agent for scientific and algorithmic discovery","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.13131","snapshot_observed_at":"2026-08-07T00:42:52.411937Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:52.411937Z"},"links":{"cited_paper":"/paper/2506.13131","citing_paper":"/paper/2506.13242"},"observation_digest":"sha256:faa4f738bd80ca7fea9bf464373d88b13597564b8453abe6f90fcdcd0272bc0c","observation_id":"53ac997a-3a7d-4293-94e0-57cf49bcb070","resolution":{"observed_at":"2026-08-07T00:42:52.411937Z","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-07T00:42:52.764083Z","title":"Fast matrix multiplication database [online]","venue":null,"work_id":"5b22527c-e9ad-472a-8c9f-c17d4b9ed464","year":2017},"citing_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},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:52.417112Z"},"links":{"citing_paper":"/paper/2506.13242"},"observation_digest":"sha256:e74106d97f0ac21c9b0942e9c0c7d5e08f4de1e61492731e90b01b02cca49c78","observation_id":"59993721-9b44-401a-838f-8338eb7f8084","resolution":{"observed_at":"2026-08-07T00:42:52.771617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-07T00:42:52.421809Z","title":"Gaussian elimination is not optimal","venue":null,"work_id":null,"year":1969},"citing_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},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:52.421809Z"},"links":{"citing_paper":"/paper/2506.13242"},"observation_digest":"sha256:b65eb913b470edfc388ac9e22a13b8f081175e5f3867c3a6cc33cb544abdef65","observation_id":"9a10d3f6-f113-4126-90bf-19585442cf16","resolution":{"observed_at":"2026-08-07T00:42:52.421809Z","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-07T00:42:52.387234Z","title":"(cited in sec","venue":null,"work_id":null,"year":null},"citing_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},"reference_index":1978,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:52.387234Z"},"links":{"citing_paper":"/paper/2506.13242"},"observation_digest":"sha256:f2cc916089b8a0eb80497a374c6e3242f9216a5659869954ed407de242aae12b","observation_id":"5ea34c45-96fa-44ed-bec8-60d8c8718a54","resolution":{"observed_at":"2026-08-07T00:42:52.387234Z","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-07T00:42:52.362973Z","title":"URL: https://hal.science/hal-04441653, doi:10.1145/3666000.3669697","venue":null,"work_id":null,"year":null},"citing_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},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T00:42:52.362973Z"},"links":{"citing_paper":"/paper/2506.13242"},"observation_digest":"sha256:ea871e5c8a14be4f819c5afd3a27387a03bef95f19678328fbc691e0b241c344","observation_id":"5ef9ad16-c1d0-41c6-8edc-2204ab2344f1","resolution":{"observed_at":"2026-08-07T00:42:52.362973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.13242","last_updated":"2026-07-27T09:06:58Z","latest_version":7,"primary_category":"cs.SC","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"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":6},"total_outbound_references":15},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 6 inbound Pith citation observations for arXiv:2506.13242."}