{"as_of":"2026-08-14T11:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ec84f96fcf6afb8badc8a09b2239c695844b9fc8666f25f81bff5dd144b928c","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T17:55:40.395000Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2603.18699/citation-record","integrity":"/paper/2603.18699/integrity","json":"/paper/2603.18699/citation-record.json","paper":"/paper/2603.18699"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/15m1032168","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Im- proving the numerical stability of fast matrix multiplication","venue":"SIAM Journal on Matrix Analysis and Applications","work_id":"81ded799-30e4-43aa-850e-b83bb23ac1b2","year":2016},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":1,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:38.588458Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:34db9d7384363ec39859f8ee3ea93f061b82214c94731dba5290a002ae2e1964","observation_id":"af3bf1e9-f6bb-4e71-a7db-1c0fa0ba48fa","resolution":{"observed_at":"2026-08-02T17:58:29.011596Z","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":"10.1007/bf01395989","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Stability of fast algorithms for matrix multiplication","venue":"Numerische Mathematik","work_id":"e1a2d5df-2cb3-4bb1-bcc5-a2ab45e773c8","year":1980},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":2,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:38.723929Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:43786f31fb244d30bfe286709172bbbee4680d9fb60dd22de9c37d3d6b94622b","observation_id":"30943d1b-559d-44c4-911c-61a6f382522e","resolution":{"observed_at":"2026-08-02T17:58:28.785416Z","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-02T17:55:38.854595Z","title":"Algorithms for matrix multiplication","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":3,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:38.854595Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:bae4877ba5bac8b20af8b85463dbc776a17ce1f78ae782db156b614cc64a00ba","observation_id":"f1e4ec48-b05a-461c-be9f-5f907fc1ad31","resolution":{"observed_at":"2026-08-02T17:55:38.854595Z","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-02T17:55:38.959539Z","title":"Fast matrix multipli- cation is stable","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":4,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:38.959539Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:9527da6a971ebf39cbcf6e2feb45608dbf5135ac8029a61a31b069c78e3fedac","observation_id":"b51c524b-3220-4006-b9ed-4c03ebe9587c","resolution":{"observed_at":"2026-08-02T17:55:38.959539Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:55:39.066499Z","title":"PLinOpt, a collection of C++ routines handling linear & bilinear programs, January 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":5,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:39.066499Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:827ae1243126543ac062857286087a0bd03b5af69a9d9ebb1ab84a42a1d72b04","observation_id":"d68b0b6a-d66d-4799-a4d1-a89418b8b2fa","resolution":{"observed_at":"2026-08-02T17:55:39.066499Z","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-02T17:55:39.239520Z","title":"Strassen’s algorithm is not opti- mally accurate","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":6,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:39.239520Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:6e13c0d0c04612e3b94269b791f8e1207d91d9da22175b9889a98cae14fc272f","observation_id":"27cff689-4c03-4955-b689-352196cea09d","resolution":{"observed_at":"2026-08-02T17:55:39.239520Z","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-02T17:55:39.407493Z","title":"FMM, accuracy of fast-matrix- multiplication algorithms, September 2025","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-14T06:59:32.829048Z","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":7,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:39.407493Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:9c0d1b0553410eef570e562496e609dbe0f75d2ed174f4f16bf209795448055a","observation_id":"9629a21d-91c4-452a-bafa-f4a9fc45d242","resolution":{"observed_at":"2026-08-02T17:55:39.407493Z","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-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-14T06:59:32.829048Z","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:f783eeedc543d19aa834b6b4dbaf7ea8444c047df64820879d8f7ab1ce04bbdb","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:55:39.575435Z","title":"Towards automated generation of fast and accurate algorithms for recursive matrix multiplication","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":9,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:39.575435Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:cac0636fa5042a80c8ba5637644475241f5124d6e9e11285ac9063dd7b81fab5","observation_id":"d0db0d97-e810-4aab-996a-8589c8f5902d","resolution":{"observed_at":"2026-08-02T17:55:39.575435Z","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-02T17:55:39.641743Z","title":"On varieties of optimal algorithms for the computation of bilinear mappings I","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":10,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:39.641743Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:6121d48c1a5b1194cd0a7e05eec1a4aaca06f29af5d9b52111f28b98efaf7bcc","observation_id":"63d0678b-7f71-4045-9b77-c772d3757522","resolution":{"observed_at":"2026-08-02T17:55:39.641743Z","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-02T17:55:39.809160Z","title":"Accuracy and Stability of Numerical Algorithms","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":11,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:39.809160Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:a471854132fba840cdae03f6bd65aea4f78cba54fb644734f12332f0161ee531","observation_id":"cf5ab34f-6d59-40b5-a0b5-269bc35d0f03","resolution":{"observed_at":"2026-08-02T17:55:39.809160Z","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":"10.1134/s0965542524701021","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Finding complex-valued solutions of Brent equations using nonlinear least squares","venue":"Computational Mathematics and Mathematical Physics","work_id":"136e6a3b-b0d0-449f-80d7-1bce89f6cede","year":2024},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":12,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:39.861837Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:4a8572c1bc6b71e664b86eed5e02ac79dcb4aa19ab38f3c5d13a79de089483ab","observation_id":"63dbfbc8-e21e-4f37-a17c-19046ca07fb0","resolution":{"observed_at":"2026-08-02T17:58:28.011103Z","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-02T17:55:39.935096Z","title":"Matrix multiplication, a little faster","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":13,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:39.935096Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:831216c76dbcf60a3678d29af538b99420b43db3a898b131133e3cfa808860a5","observation_id":"9a43a368-4ce3-4fed-92d3-543e7f4b66e1","resolution":{"observed_at":"2026-08-02T17:55:39.935096Z","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-02T17:55:40.020274Z","title":"Geometry and complexity theory , volume 169 of Cambridge Stud- ies in Advanced Mathematics","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":14,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:40.020274Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:dafcfad956d2196f70c6f32b4a166ccd44a721b4bad7de4667551163c1780b45","observation_id":"9060fcbc-a269-4aac-a1ca-7efa6d220a33","resolution":{"observed_at":"2026-08-02T17:55:40.020274Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T17:55:40.098159Z","title":"Complex to rational fast matrix multiplication","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":15,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:40.098159Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:a277109fe05be3378d558a572816e2c2763431e8a9ad00e22396a3491248a5d2","observation_id":"8f3feef6-736e-41fb-9a2f-50533be9ab7a","resolution":{"observed_at":"2026-08-02T17:55:40.098159Z","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-02T17:55:40.184295Z","title":null,"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-14T06:59:32.829048Z","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":16,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:40.184295Z"},"links":{"cited_paper":"/paper/2506.13131","citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:fe3403b2df8314479ffb06641dc5f731defeda8307ee8f2f60db978aad152c1a","observation_id":"8725cc6e-d4a8-430b-b48a-7312dfbb4edd","resolution":{"observed_at":"2026-08-02T17:55:40.184295Z","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":"10.1007/s00211-026-01531-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Alternative basis matrix multiplication is fast and stable","venue":"Numerische Mathematik","work_id":"81bf4208-3f4b-4c70-bf2e-30f5bc074db6","year":2026},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":17,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:40.220266Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:3a0ebd159cc56a3190d44e25bdf3bf6604663b2d2cff92909b1ba4fbaf23eb76","observation_id":"6ced2173-c277-41a1-848e-b59109a6cfe4","resolution":{"observed_at":"2026-08-02T17:58:27.520572Z","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-02T17:55:40.294019Z","title":"Gaussian elimination is not optimal","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":18,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:40.294019Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:519cefd9c03cad7d3989bdf68d33c059c1ad78347b730bd6c6c948b6c5c7b8dc","observation_id":"e00d7bac-7a46-4afd-8cce-4de86160e1cf","resolution":{"observed_at":"2026-08-02T17:55:40.294019Z","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-02T17:55:40.349439Z","title":"La complexit´ e des calculs num´ eriques","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":19,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:40.349439Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:75010183e81d889386de387a52f2871d81d0104982c0a78285baa4d8c245164a","observation_id":"8ccbf73e-b310-4527-b60e-b0de36fa9c32","resolution":{"observed_at":"2026-08-02T17:55:40.349439Z","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-02T17:55:40.395000Z","title":"They satisfy that L = Lalt · Lcob, R= Ralt · Rcob and P = Pcob · Palt, with a common inner dimension of 47","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":1977,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:40.395000Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:a093dabbb1115861540e3a3bfa688bbf5089f9272622207e803beef8dc580f66","observation_id":"7ab8217c-3a67-4862-9eb0-9f2b548cdd14","resolution":{"observed_at":"2026-08-02T17:55:40.395000Z","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-02T17:55:39.723034Z","title":"[Cited § 1.]","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":1978,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:39.723034Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:1ee4f60bcb603a73f38cb00ce47f22fed4ab349793deca37f1dc19cd58af2dd7","observation_id":"febda7a6-8910-42b6-adea-21585fc91dfc","resolution":{"observed_at":"2026-08-02T17:55:39.723034Z","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-02T17:55:39.336545Z","title":"doi:10.1145/3666000.3669697","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","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":2024,"source":"pdf_text","source_observed_at":"2026-08-02T17:55:39.336545Z"},"links":{"citing_paper":"/paper/2603.18699"},"observation_digest":"sha256:7c98fb65e11ce9da127c2f5773628e932e84f82343f9161f4203c07887cd5496","observation_id":"21e64b8e-7b54-47ad-9ca8-760a3d71f161","resolution":{"observed_at":"2026-08-02T17:55:39.336545Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2603.18699","last_updated":"2026-07-27T09:13:07Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T06:59:32.829048Z","submitted_at":"2026-03-19T09:58:19Z","title":"A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":22},"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 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2603.18699."}