{"as_of":"2026-08-08T20:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:930b879210fd6fb41342ea393758710b1f28476f90c1f337f60c2d9efdc2e8a5","coverage":[{"denominator":126,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T14:36:56.530939Z","state":"measured"},{"denominator":108,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":108,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T19:01:21.440079Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-07T13:23:47.456514Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.21189","snapshot_observed_at":"2026-08-02T19:01:21.440079Z","title":"Finding frequent items in data streams","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.04365","last_updated":"2026-07-05T00:09:16Z","snapshot_observed_at":"2026-08-08T12:13:32.819135Z","submitted_at":"2026-03-04T18:30:04Z","title":"Comparison theorems for the extreme eigenvalues of a random symmetric matrix","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T19:01:21.440079Z"},"links":{"cited_paper":"/paper/2508.21189","citing_paper":"/paper/2603.04365"},"observation_digest":"sha256:00956989a523d30eb953fb9b81c0e3c2892591e9b7291d449be53482a8de7164","observation_id":"cbb24352-798e-43a5-ad00-b92be11947cf","resolution":{"observed_at":"2026-08-02T19:01:21.440079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.21189","snapshot_observed_at":"2026-07-14T23:11:18.736508Z","title":"Epperly, Raphael A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.11009","last_updated":"2026-06-29T15:06:58Z","snapshot_observed_at":"2026-08-07T05:31:01.294083Z","submitted_at":"2026-03-11T17:31:52Z","title":"Linear-Scaling Tensor Train Sketching","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T23:11:18.736508Z"},"links":{"cited_paper":"/paper/2508.21189","citing_paper":"/paper/2603.11009"},"observation_digest":"sha256:3571d49f6b6797af988f3288518945855230534d5b9a04c49f5b1cfa26408e92","observation_id":"8749efc8-987d-450f-ad43-9ec8e75b07be","resolution":{"observed_at":"2026-07-14T23:11:18.736508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"cited_work":{"arxiv_id":"2508.21189","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.21189","snapshot_observed_at":"2026-07-07T13:23:47.456514Z","title":"Cama ˜no, E","venue":"cs.DS","work_id":"4a182a7e-6e8f-40e9-b67a-128bf383636f","year":2025},"citing_paper":{"arxiv_id":"2604.10215","last_updated":"2026-08-04T16:52:01Z","snapshot_observed_at":"2026-08-07T23:11:33.132619Z","submitted_at":"2026-04-11T13:50:11Z","title":"Oblivious Subspace Injection Is Not Enough for Relative Error","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T15:32:14.060358Z"},"links":{"cited_paper":"/paper/2508.21189","citing_paper":"/paper/2604.10215"},"observation_digest":"sha256:4db524da72e3257d3c64d3a50fece89faed1e43111daf1b79475e8acebc592d7","observation_id":"93a210cd-ebae-4787-a840-a26a7440b5e2","resolution":{"observed_at":"2026-05-11T10:21:02.429432Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"cited_work":{"arxiv_id":"2508.21189","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.21189","snapshot_observed_at":"2026-07-07T13:23:47.456514Z","title":"Cama ˜no, E","venue":"cs.DS","work_id":"4a182a7e-6e8f-40e9-b67a-128bf383636f","year":2025},"citing_paper":{"arxiv_id":"2605.19096","last_updated":"2026-07-31T18:49:53Z","snapshot_observed_at":"2026-08-06T23:11:18.178147Z","submitted_at":"2026-05-18T20:32:28Z","title":"Sharp analysis of sketched least squares and randomized low-rank approximation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-20T07:25:22.937413Z"},"links":{"cited_paper":"/paper/2508.21189","citing_paper":"/paper/2605.19096"},"observation_digest":"sha256:75e20f5014aec2bde957a6c64ce4bbf5e98504e604b949d55f6ce2ef5cd3e5e2","observation_id":"0fe2427b-e6cf-4d31-a1a7-d312782e5d77","resolution":{"observed_at":"2026-05-20T07:28:06.753216Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"cited_work":{"arxiv_id":"2508.21189","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.21189","snapshot_observed_at":"2026-07-07T13:23:47.456514Z","title":"Cama ˜no, E","venue":"cs.DS","work_id":"4a182a7e-6e8f-40e9-b67a-128bf383636f","year":2025},"citing_paper":{"arxiv_id":"2606.20195","last_updated":"2026-06-18T13:10:15Z","snapshot_observed_at":"2026-07-06T23:55:25.144457Z","submitted_at":"2026-06-18T13:10:15Z","title":"Randomized Sketching is Robust to Low-Precision Rounding on GPUs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T14:55:11.331759Z"},"links":{"cited_paper":"/paper/2508.21189","citing_paper":"/paper/2606.20195"},"observation_digest":"sha256:bc3893d70f7e0eb0afae52464d4b4ae722f692e13a1c540b4cb8e02f13f94b5c","observation_id":"8c145a60-4716-41fd-b497-38f610ea738c","resolution":{"observed_at":"2026-07-04T06:09:36.349525Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"cited_work":{"arxiv_id":"2508.21189","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.21189","snapshot_observed_at":"2026-07-07T13:23:47.456514Z","title":"Cama ˜no, E","venue":"cs.DS","work_id":"4a182a7e-6e8f-40e9-b67a-128bf383636f","year":2025},"citing_paper":{"arxiv_id":"2607.05384","last_updated":"2026-07-08T16:03:41Z","snapshot_observed_at":"2026-08-08T17:30:02.979918Z","submitted_at":"2026-07-06T17:56:16Z","title":"Well-invertible column subsets of sparse matrices are rare","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-07T13:18:26.809614Z"},"links":{"cited_paper":"/paper/2508.21189","citing_paper":"/paper/2607.05384"},"observation_digest":"sha256:29d7920510174788a0a2b74c9de243bc9caae196bbba629abc6ecab0c9c87519","observation_id":"4a62de65-8955-408f-aa79-fad4f3e07e41","resolution":{"observed_at":"2026-07-07T13:23:47.457780Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.21189","snapshot_observed_at":"2026-07-11T07:08:16.892784Z","title":"Epperly, Raphael A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05384","last_updated":"2026-07-08T16:03:41Z","snapshot_observed_at":"2026-08-08T17:30:02.979918Z","submitted_at":"2026-07-06T17:56:16Z","title":"Well-invertible column subsets of sparse matrices are rare","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T07:08:16.892784Z"},"links":{"cited_paper":"/paper/2508.21189","citing_paper":"/paper/2607.05384"},"observation_digest":"sha256:af01dbd8c736d17d4f59d780c2239828500cf4a323c23104b2b080ec30010a9c","observation_id":"35239739-2269-42f6-86ec-dca3010e7da7","resolution":{"observed_at":"2026-07-11T07:08:16.892784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.21189","snapshot_observed_at":"2026-08-01T04:00:42.025694Z","title":"Cama˜ no, E","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23017","last_updated":"2026-07-25T03:18:37Z","snapshot_observed_at":"2026-08-06T07:11:22.755335Z","submitted_at":"2026-07-25T03:18:37Z","title":"Level-set entropy and sparse randomized embeddings","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T04:00:42.025694Z"},"links":{"cited_paper":"/paper/2508.21189","citing_paper":"/paper/2607.23017"},"observation_digest":"sha256:b41b533254ed6267e12e413f55ecd6b5c60835099f736659c31364bf14bd64a9","observation_id":"0391fec8-c71d-4dbc-98de-10b443b11705","resolution":{"observed_at":"2026-08-01T04:00:42.025694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2508.21189/citation-record","integrity":"/paper/2508.21189/integrity","json":"/paper/2508.21189/citation-record.json","paper":"/paper/2508.21189"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.13259","last_updated":"2024-11-20T12:20:45Z","snapshot_observed_at":"2026-07-06T19:53:08.203405Z","submitted_at":"2024-11-20T12:20:45Z","title":"Interface for Sparse Linear Algebra Operations","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.13259","snapshot_observed_at":"2026-08-05T14:36:48.477096Z","title":"A BDELFATTAH , W","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:48.477096Z"},"links":{"cited_paper":"/paper/2411.13259","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:5137e747f89abd60e664886c7df9c313bd077b94a1af1bee4f592d5a345fca9a","observation_id":"83a90375-6940-49d0-b0d2-a52271bec6a8","resolution":{"observed_at":"2026-08-05T14:36:48.477096Z","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-05T14:36:48.524887Z","title":"A CHLIOPTAS , Database-friendly random projections , in ACM Symposium on Principles of Database Systems, 2001, pp","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:48.524887Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:82e279d3739095a7c0142d82ee5f2cd43edeacea3b62d4962223395fd6b1aaa2","observation_id":"db7f4f43-64a3-4ddb-8a6c-4e7ffcbbc8ee","resolution":{"observed_at":"2026-08-05T14:36:48.524887Z","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.1137/1.9781611975994.9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.360820Z","title":null,"venue":null,"work_id":"cb4b42b0-0958-4344-8fe0-6e8b6ba604ee","year":2020},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:48.559968Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:147499226758516a324abe65b2e2037ab52fbcd162a697b3dd06540de34b0c75","observation_id":"815f6251-be5f-4079-8c8b-85b51ae2f3f4","resolution":{"observed_at":"2026-08-05T14:36:58.363834Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:48.619010Z","title":"A ILON AND B","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:48.619010Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:dd9bfde4221f1593f3ab6fb88b3c44384605c168f369b26f362545ef327c3194","observation_id":"9458a894-2b7a-4028-adf0-86bfe303a604","resolution":{"observed_at":"2026-08-05T14:36:48.619010Z","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.1137/21m1451191","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.346804Z","title":"A L DAAS , G","venue":null,"work_id":"b75c94e7-7431-401a-9cd6-f90493b09588","year":2023},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:48.686980Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:3c85a903438032724744347e4d8de2ba2864647003bbe4842a1677c7abd063a7","observation_id":"b7c3b2f9-5cb3-4455-953e-cc808e037f42","resolution":{"observed_at":"2026-08-05T14:36:58.349445Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:48.736410Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:48.736410Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:18bc6d7a0f469921f457ff446a92e0a9183b588e7255eb5ec3cf64cb23c8d20a","observation_id":"146c4bf8-c55e-4a82-a083-9a75a7562f38","resolution":{"observed_at":"2026-08-05T14:36:48.736410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.19290","last_updated":"2025-07-25T14:04:20Z","snapshot_observed_at":"2026-08-06T21:45:12.587447Z","submitted_at":"2025-07-25T14:04:20Z","title":"Query Efficient Structured Matrix Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.19290","snapshot_observed_at":"2026-08-05T14:36:48.793330Z","title":"A MSEL , P","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:48.793330Z"},"links":{"cited_paper":"/paper/2507.19290","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:f2d4b813204cb492355aa3eba7d13a4eb67100293822da93cea3752d574328a5","observation_id":"c21c007a-deb1-4aa5-a1b7-5e55108a147a","resolution":{"observed_at":"2026-08-05T14:36:48.793330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09379","last_updated":"2024-03-26T15:14:22Z","snapshot_observed_at":"2026-08-06T22:04:23.387908Z","submitted_at":"2024-02-14T18:25:13Z","title":"Fixed-sparsity matrix approximation from matrix-vector products","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09379","snapshot_observed_at":"2026-08-05T14:36:48.817200Z","title":"A MSEL , T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:48.817200Z"},"links":{"cited_paper":"/paper/2402.09379","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:eabf3b944a6ec4ab1b688918918f3b940a0781c9a0d4d110d6323a690b095009","observation_id":"6bd73165-4569-4b2c-9e6b-c1d1e37d1e1a","resolution":{"observed_at":"2026-08-05T14:36:48.817200Z","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-05T14:36:48.906953Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:48.906953Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:3f5ab3d07d65d7f0537e49819319e6e44de24bb18b4d6445ec8773369e866813","observation_id":"69befa55-feb0-48da-a63a-e735474666b1","resolution":{"observed_at":"2026-08-05T14:36:48.906953Z","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.1137/1.9781611973105.124","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.323427Z","title":"A NDONI AND H","venue":null,"work_id":"f43cf522-dd31-41fb-bae2-2df738d9cab9","year":2013},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.000619Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:fa21303545ff7a1393fd7b24106c1bc9ea4a8aa0f744fc33c6c66c491f7c2703","observation_id":"6e60c41d-3755-4c8a-9879-16b60658d98e","resolution":{"observed_at":"2026-08-05T14:36:58.326159Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:49.059248Z","title":"A VRON , P","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.059248Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:2c409cd7d3088995475a283855b1115e950bf570aecfbc4d2e5f24c72a96a9a0","observation_id":"133ac680-f96a-4292-bb90-12d57a699cf2","resolution":{"observed_at":"2026-08-05T14:36:49.059248Z","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-05T14:36:49.089811Z","title":"A VRON , H","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.089811Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:9cf189ddedcdeaa9640bd570d6453881908facb949acaea40e540e133c227150","observation_id":"febfeb0e-5aae-4957-a07f-2677460368ca","resolution":{"observed_at":"2026-08-05T14:36:49.089811Z","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.1137/21m1432491","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.308125Z","title":"B AMBERGER , F","venue":null,"work_id":"d156e5f6-a1da-4234-9b70-8405ba001846","year":2022},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.147849Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:55755c739d2a533a6a809aa509dd8e2b31f11104993445636ca00668ff74460b","observation_id":"74cd7a5f-f678-41b2-ac30-18c15cd5df7a","resolution":{"observed_at":"2026-08-05T14:36:58.311184Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:49.227222Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.227222Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:191633a901ec10887ef0a98884d5fe2685c0315ad6e8dcd0c97217590a050b81","observation_id":"01a818de-e413-499a-9560-334301daa285","resolution":{"observed_at":"2026-08-05T14:36:49.227222Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.06538","last_updated":"2020-06-20T00:36:01Z","snapshot_observed_at":"2026-07-31T06:14:12.085494Z","submitted_at":"2020-02-16T08:35:48Z","title":"Distributed Sketching Methods for Privacy Preserving Regression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.06538","snapshot_observed_at":"2026-08-05T14:36:49.288155Z","title":"B ARTAN AND M","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.288155Z"},"links":{"cited_paper":"/paper/2002.06538","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:7ce3a60193b46fbca537b3f76d72e485d93baf58c6007145cf06704af346d274","observation_id":"3dbc696d-11b4-4538-a57a-2cf88dbb0e40","resolution":{"observed_at":"2026-08-05T14:36:49.288155Z","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.1137/17m1112303","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.292640Z","title":"B ATTAGLINO , G","venue":null,"work_id":"6130898f-934f-4425-84d8-40beae80d38f","year":2018},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.344533Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:921b6c421f5f8e0405b2a518b55930082f2e716549f0fb6791843c518e3315d1","observation_id":"7b087033-cb50-4d77-a8b0-15998a9c5b8f","resolution":{"observed_at":"2026-08-05T14:36:58.295456Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.cam.2009.08.108","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.283444Z","title":"B ENNER , R.-C","venue":null,"work_id":"ed5c1b8d-aff7-47bf-b721-4877ed77f19e","year":2009},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.381536Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:af705b8b713ac8ee95d5b10368d0d0a1e8a0f764bc3e644d55129e42cf3b8567","observation_id":"6681bf4c-7206-4dca-832e-d767301b3c3e","resolution":{"observed_at":"2026-08-05T14:36:58.286985Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:49.475004Z","title":"B HARADWAJ , O","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.475004Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:854daa2fd38565495a17680c69b84ebf21bf64fc0b0634eff1e30569bd31d84c","observation_id":"1dd5afba-588c-454e-a0fd-98fddc0a31bc","resolution":{"observed_at":"2026-08-05T14:36:49.475004Z","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.1016/j.jcp.2014.10.009","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.274716Z","title":null,"venue":null,"work_id":"1f059d4a-49db-4ce4-9bcb-9d5b4ed88b56","year":2015},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.521604Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:92e652b17989c6cd50290c85bac46700428f26ed54a5390627d21647c754d011","observation_id":"8d2843d3-1cf7-4044-b2a1-b54422347824","resolution":{"observed_at":"2026-08-05T14:36:58.277701Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.5555/3722577","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.266141Z","title":"B OULLÉ , D","venue":null,"work_id":"3048a40c-5e06-44a5-9f9b-5d03d2c162ff","year":2024},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.573160Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:f8c864f532c52b3e253043f2ca4310f0e9ca6b83ee592a00da53236fcc21fb44","observation_id":"36b6e2f1-2461-40f3-b736-74e7c02724de","resolution":{"observed_at":"2026-08-05T14:36:58.268907Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1073/pnas.2303904120","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.256959Z","title":"B OULLÉ , D","venue":null,"work_id":"5036994e-5ae4-46d9-be5b-e97a7fd1ee8f","year":2023},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.617804Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:ab06a8f5f81dec961425227c3afa9a4d9304370ed0ea228bc255840e06bda3a9","observation_id":"f1c6140d-182f-45a3-94e7-1a350fe1c797","resolution":{"observed_at":"2026-08-05T14:36:58.259894Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[{"edge_observation":{"observed_at":"2026-08-05T18:20:25.801983+00:00","source":"paper_reference_links","state":"open"},"event_date":"2023-11-20","event_type":"correction","notice_doi":"10.1073/pnas.2319078120","provenance":{"observed_at":"2026-07-11T03:00:27.599203+00:00","source":"crossref","source_record_id":"10.1073/pnas.2319078120->10.1073/pnas.2303904120:correction"}}],"reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:49.645587Z","title":"B RAILOVSKAYA AND R","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.645587Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:25b9838d2ccebf3e94f5c0c15203c1f12d4c7a43c3f2923a247bba0acc25c794","observation_id":"14cad8ca-81c6-4066-8f06-6613a6ddaa54","resolution":{"observed_at":"2026-08-05T14:36:49.645587Z","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.1038/s41567-022-01742-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.242670Z","title":"B RAVYI , A","venue":null,"work_id":"2c71d2bd-9e39-496f-883c-53cb8dcf3ed0","year":2022},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.686272Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:48063d7c9069c143ab384e66f8fca6dfd7347044bed368e022b3e505968e831d","observation_id":"d70df23f-43cc-446a-9807-443e47082510","resolution":{"observed_at":"2026-08-05T14:36:58.245375Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:49.740232Z","title":"B UJANOVI ´C, L","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.740232Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:46b551624dadea3ac4e199e0d0dc1895fa41215a310b89be7ab52bce71ec4ea5","observation_id":"09d96415-f7b2-4871-940f-97bba58167a9","resolution":{"observed_at":"2026-08-05T14:36:49.740232Z","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-05T14:36:49.800370Z","title":"C AMAÑO , E","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.800370Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:1c2f467fc45e2bc2f3311b5d7ef27c32e683ee18e1557b6a9e905b59b6ae5273","observation_id":"d8f9798d-c938-435b-a7c5-c8192ea71325","resolution":{"observed_at":"2026-08-05T14:36:49.800370Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.11815","last_updated":"2021-05-25T10:35:13Z","snapshot_observed_at":"2026-07-06T11:12:31.688359Z","submitted_at":"2021-05-25T10:35:13Z","title":"Hashing embeddings of optimal dimension, with applications to linear least squares","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.11815","snapshot_observed_at":"2026-08-05T14:36:49.880373Z","title":"C ARTIS , J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.880373Z"},"links":{"cited_paper":"/paper/2105.11815","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:546b466eb00038c6572fc8841b4ea4cec33cc325efd1a9af4dbf187437f2cbdf","observation_id":"224bc79d-fe55-47a4-8ed0-79b088a50693","resolution":{"observed_at":"2026-08-05T14:36:49.880373Z","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-05T14:36:49.914221Z","title":"C HARIKAR , K","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:49.914221Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:c16d295d967b3e494cf8a70c0eba545589e22c0404d7e088b18d4d7e28ee4968","observation_id":"19609142-1d29-49b3-8f05-bff5bb4dfcf5","resolution":{"observed_at":"2026-08-05T14:36:49.914221Z","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.1137/20m1374596","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.222769Z","title":"C HEN AND R","venue":null,"work_id":"51385c62-73bc-47b6-87ee-2ce0c967e4f3","year":2021},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.001615Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:082541769706fe7fbb6dae3b17054b8529dcd2b3b6ee3b9bb8bce56e9e7fb1a1","observation_id":"04394ee0-0e63-4d00-a942-091ff7b18384","resolution":{"observed_at":"2026-08-05T14:36:58.225592Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11090","last_updated":"2024-10-14T21:08:30Z","snapshot_observed_at":"2026-08-05T11:27:21.463593Z","submitted_at":"2024-10-14T21:08:30Z","title":"The Lanczos algorithm for matrix functions: a handbook for scientists","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11090","snapshot_observed_at":"2026-08-05T14:36:50.064243Z","title":"C HEN , The Lanczos algorithm for matrix functions: A handbook for scientists , Oct","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.064243Z"},"links":{"cited_paper":"/paper/2410.11090","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:bd0a72830d80f6d8432fbda56ec72f33f8fd8f45cea620720e2a659dd3867672","observation_id":"93f97c94-7947-42b5-83dd-b25f53e3e13b","resolution":{"observed_at":"2026-08-05T14:36:50.064243Z","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-05T14:36:50.142329Z","title":"C HEN , F","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.142329Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:7d4f455871080f97b6937aa16afeac574233c303a602fb400158c2a60d6ee895","observation_id":"f6b3112f-4515-4d3e-bdad-2c30d7bd1d2e","resolution":{"observed_at":"2026-08-05T14:36:50.142329Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.03070","last_updated":"2025-06-06T14:27:31Z","snapshot_observed_at":"2026-08-07T11:06:57.087982Z","submitted_at":"2025-06-03T16:48:06Z","title":"GPU-Parallelizable Randomized Sketch-and-Precondition for Linear Regression using Sparse Sign Sketches","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03070","snapshot_observed_at":"2026-08-05T14:36:50.177912Z","title":"C HEN , P","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.177912Z"},"links":{"cited_paper":"/paper/2506.03070","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:cf4a155289afe2f4bd8a2929aa1d79e290d331f51bd84f930c9316489cc7e90b","observation_id":"387ab3f3-76a6-4920-8a6a-0c60b0455e4e","resolution":{"observed_at":"2026-08-05T14:36:50.177912Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08773","last_updated":"2025-04-28T20:23:39Z","snapshot_observed_at":"2026-07-06T19:49:52.926290Z","submitted_at":"2024-11-13T16:58:51Z","title":"Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.08773","snapshot_observed_at":"2026-08-05T14:36:50.224357Z","title":"C HENAKKOD , M","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.224357Z"},"links":{"cited_paper":"/paper/2411.08773","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:dadb1cb9fbd0252385c8fa0e29d06afdaed1c2723b475b634256bccdf90ef16f","observation_id":"00c0ce53-d1d8-4979-a92f-d3288132c8a0","resolution":{"observed_at":"2026-08-05T14:36:50.224357Z","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-05T14:36:50.288123Z","title":"C HENAKKOD , M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.288123Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:0525c212e8c1c3d408ee30ee5abef0538ccf44f43678b3cbb7a410294e746b99","observation_id":"df803b4a-379f-4c05-ba9d-1d4724a7903e","resolution":{"observed_at":"2026-08-05T14:36:50.288123Z","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-05T14:36:50.374017Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.374017Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:ae5ecd9031fd2235fcd84e62b50802c65df54fe0fdebc0fe54e0f971c3a94477","observation_id":"1569a3e5-fd12-4924-bcdb-5edfd2fe5b03","resolution":{"observed_at":"2026-08-05T14:36:50.374017Z","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-05T14:36:50.439558Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.439558Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:5459c341c10cd670a3b3065e44fb2b4323729a24d4e8d6c8bf26ec3cd16b35d7","observation_id":"78f6af8f-eb68-47c7-ab91-158bd60afe84","resolution":{"observed_at":"2026-08-05T14:36:50.439558Z","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-05T14:36:50.476583Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.476583Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:d7c5c530a885229cd24e4c06f2ddb74d60af5fd9c9ca89ff34ba0a2deaedb917","observation_id":"04961753-2c7d-4869-8627-74317dfa995b","resolution":{"observed_at":"2026-08-05T14:36:50.476583Z","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-05T14:36:50.532436Z","title":"D ASGUPTA , R","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.532436Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:9af7b28daed6590ae9198da8954febc28ae5d0b1953bcbc893533a3302940aa1","observation_id":"39d06598-8410-48ac-9d85-0027fb5463d7","resolution":{"observed_at":"2026-08-05T14:36:50.532436Z","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-05T14:36:50.617575Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.617575Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:4ed5c66b95042d2884527c80c99c7c163a30befadc0f07faba7e9712a79609e1","observation_id":"7c4c280e-3006-4312-aff6-b2f7f3c3b50e","resolution":{"observed_at":"2026-08-05T14:36:50.617575Z","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.1017/9781108896214.011","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.196531Z","title":"D AWSON , The proper orthogonal decomposition , Cambridge University Press, Jan","venue":null,"work_id":"748e99fa-c429-4cd7-a6af-66964ea6c1f1","year":2023},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.678892Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:30c79e88eba5c5f9155f97748a403fef1f913682a3f421366d727eb58e1692d2","observation_id":"f693bf55-390f-4749-850f-fff48fd216ab","resolution":{"observed_at":"2026-08-05T14:36:58.199463Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:50.718661Z","title":"D EREZI ´NSKI , Algorithmic gaussianization through sketching: Converting data into sub-gaussian random designs , in The 36th Annual Conference on Learning Theory, 2023, pp","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.718661Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:d2bc0eeaa8adfd9cd292f30f1774093aed14ca8971d5a924cfbe387671611d6f","observation_id":"16a4ccea-5df4-4092-9aa8-5604e2168177","resolution":{"observed_at":"2026-08-05T14:36:50.718661Z","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-05T14:36:50.750083Z","title":"D ONG AND P .-G","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.750083Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:63dfd9ef2e574ae5b0f957b07dd63b5bcd5692f9a288b9f7645edfe586e91e7a","observation_id":"7ae4b564-b3e4-4e52-b89f-0ec32ebc7b09","resolution":{"observed_at":"2026-08-05T14:36:50.750083Z","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-05T14:36:50.818111Z","title":"D RINEAS , R","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.818111Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:ced1ebfef87a005a967a54388d133063d6bd4489f45f3023a1ec1387f97df4f7","observation_id":"613efbdd-c9cb-45a6-944d-53ad333101b0","resolution":{"observed_at":"2026-08-05T14:36:50.818111Z","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-05T14:36:50.905838Z","title":"D RINEAS AND M","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.905838Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:a74bd819184256e23e3c77151158db30a33d81725bba1ea57115682bf2faea89","observation_id":"5da9b950-7e8c-4ec9-a39a-9cda323f56a9","resolution":{"observed_at":"2026-08-05T14:36:50.905838Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1712.08880","last_updated":"2017-12-24T06:05:57Z","snapshot_observed_at":"2026-07-06T06:15:57.446545Z","submitted_at":"2017-12-24T06:05:57Z","title":"Lectures on Randomized Numerical Linear Algebra","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.08880","snapshot_observed_at":"2026-08-05T14:36:50.978014Z","title":"D RINEAS AND M","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:50.978014Z"},"links":{"cited_paper":"/paper/1712.08880","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:54dbca43e925bcff654e5c32f9b4f703a3b0da3ef3668038bb1bc8b2e9213a8f","observation_id":"d796079b-a183-4a1d-a8d3-b2f907ef860e","resolution":{"observed_at":"2026-08-05T14:36:50.978014Z","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-010-0331-6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.182577Z","title":"D RINEAS , M","venue":null,"work_id":"1318169d-6940-4779-bc4d-23d7199bd9f2","year":2011},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.010134Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:48c206daed211a010f27213facfdf53c4a088dcd155ab36b94f9b2456c9aa93e","observation_id":"9b571cb3-449d-4955-aad7-e4a935b82614","resolution":{"observed_at":"2026-08-05T14:36:58.185377Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:51.039650Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.039650Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:616d61c579eda02b89e57b90c1089426c40f1eeeb477d72988f1072405836cf1","observation_id":"f65d121d-a7ef-4f81-b0b2-7231549dc38a","resolution":{"observed_at":"2026-08-05T14:36:51.039650Z","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-05T14:36:51.131105Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.131105Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:c133786f09c12ecf43e46f3ba0a10ec6771df61331aa77666d0dd2ca07bf0a87","observation_id":"a87e0fd8-bd9e-4544-85b2-a3b0dc93acf8","resolution":{"observed_at":"2026-08-05T14:36:51.131105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03468","last_updated":"2025-08-20T16:25:38Z","snapshot_observed_at":"2026-07-06T18:26:01.717861Z","submitted_at":"2024-06-05T17:21:25Z","title":"Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03468","snapshot_observed_at":"2026-08-05T14:36:51.219594Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.219594Z"},"links":{"cited_paper":"/paper/2406.03468","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:f1bb45e1ab76d76d77ce66cc4e48213dae10655979cc0fcbe0b6b2bf31046455","observation_id":"fefbc5b8-c255-45bd-b61b-c1b34584f2a9","resolution":{"observed_at":"2026-08-05T14:36:51.219594Z","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-05T14:36:51.278850Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.278850Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:2b555b0322ee1d439ac14fa3ed8e4b82b933749e8a3dba15598e17514b764b46","observation_id":"a78f1f6c-b4e1-4408-aa86-33bd9dee4356","resolution":{"observed_at":"2026-08-05T14:36:51.278850Z","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.1103/prxquantum.3.030312","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.168582Z","title":"F ELDMAN , A","venue":null,"work_id":"53c0edad-23a2-45a9-9eac-63f1aaf14562","year":2022},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.333218Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:f93db253e9ff6fc1bd611e17ad5f05be12b6929700bc6d96bb30121e93b3c007","observation_id":"2873eefe-c67b-4228-8aa6-1af8ca5e5a5d","resolution":{"observed_at":"2026-08-05T14:36:58.171353Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:51.423081Z","title":"F RIEZE , R","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.423081Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:c508c7be24109619e13bca7e851e1432544335683be61793fd065226f603bd90","observation_id":"03c041f5-2e06-4d0a-b42d-a7c4e73d4549","resolution":{"observed_at":"2026-08-05T14:36:51.423081Z","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-05T14:36:51.484256Z","title":"Program Generation, Optimization, and Platform Adaptation","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.484256Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:59474d2b5fe00b5835156404993835e1d6845927782d0f0ffe04a965f4ff058f","observation_id":"60504ef7-8b0d-463e-a0bf-728ebece0bb2","resolution":{"observed_at":"2026-08-05T14:36:51.484256Z","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-05T14:36:51.554903Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.554903Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:a6f04fc2c843ad1d877bffeb205bf78dcb797b88729d6f63e835f45152aa01a7","observation_id":"e4012590-9d0f-4bf0-9f99-44fe39fc82d8","resolution":{"observed_at":"2026-08-05T14:36:51.554903Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1110.5305","last_updated":"2011-10-24T18:57:57Z","snapshot_observed_at":"2026-07-06T02:36:19.935685Z","submitted_at":"2011-10-24T18:57:57Z","title":"The spectral norm error of the naive Nystrom extension","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1110.5305","snapshot_observed_at":"2026-08-05T14:36:51.591577Z","title":"G ITTENS , The spectral norm error of the naïve Nyström extension , arXiv preprint arXiv:1110.5305v1, (2011), https: //arxiv.org/abs/1110.5305v1","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.591577Z"},"links":{"cited_paper":"/paper/1110.5305","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:5054f486f5ddab0184f5bcc1ff52d5ce7ebb350cca229dfe7b6c3911257d6026","observation_id":"8f1b1b41-81c7-4617-9619-2180153b846c","resolution":{"observed_at":"2026-08-05T14:36:51.591577Z","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-05T14:36:51.631150Z","title":"G ITTENS AND M","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.631150Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:2455160a5a9068b913c935e41bab11f87bb89f601469bebcc59022fe546a53dd","observation_id":"264aa4c1-6b9b-49b5-b389-8c4380d872cf","resolution":{"observed_at":"2026-08-05T14:36:51.631150Z","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-05T14:36:51.710392Z","title":"G UÉDON , F","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.710392Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:5bd3cb962266a975a1b9d2ac6ac6d1e2e23a3e1b46527ebed0cc3ec55f005b7a","observation_id":"9306c757-479a-4c1d-9bbf-d6a67b64f8e5","resolution":{"observed_at":"2026-08-05T14:36:51.710392Z","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.1002/nla.2531","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.153740Z","title":"H ALIKIAS AND A","venue":null,"work_id":"f0108b14-b9bc-4d0f-94e0-c56747fe2fa2","year":2024},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.759645Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:9c407bc53d988cb5f6a60c59c5c8d4f9ffd2f8cf66687df0de9b38e0a1a57efc","observation_id":"8e06647c-c02b-43e7-acc7-6cac1bf2f9ef","resolution":{"observed_at":"2026-08-05T14:36:58.156663Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:51.844338Z","title":"H ALKO , P .-G","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.844338Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:e22c84b4c37858750b3609acc1b99cf78d2326f3ed2e55ec3196c34770d7b28b","observation_id":"bb6f9b62-157e-4002-8c34-7e4abc475c05","resolution":{"observed_at":"2026-08-05T14:36:51.844338Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.20192","last_updated":"2024-03-29T14:13:54Z","snapshot_observed_at":"2026-08-06T11:50:31.787625Z","submitted_at":"2024-03-29T14:13:54Z","title":"Small Ball Probabilities for Simple Random Tensors","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.20192","snapshot_observed_at":"2026-08-05T14:36:51.904319Z","title":"H U AND G","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.904319Z"},"links":{"cited_paper":"/paper/2403.20192","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:f76ab9196a797879b12ca2ac5bd49e88d268baee1a8e2a14d96600121116d4e9","observation_id":"cbe101ff-6779-4c32-8193-8874c45509a2","resolution":{"observed_at":"2026-08-05T14:36:51.904319Z","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-05T14:36:51.960682Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.960682Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:e5537e639ae6ed17198b30dad508a5341036e08fec6135ebf2c47286642d02f1","observation_id":"17e52e1a-89d9-44c1-a2dd-c32dd7a59b0d","resolution":{"observed_at":"2026-08-05T14:36:51.960682Z","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":"10.1137/23m1582928","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.145043Z","title":null,"venue":null,"work_id":"8ee69ccc-43f3-4624-aae8-54d7fc75f24a","year":2024},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:52.055632Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:42c9677fd65961c9125b0caa47d93a4a92eb89cdaa6805559abc7d4dace38ae2","observation_id":"146b7315-afe8-4a65-a774-42803218d610","resolution":{"observed_at":"2026-08-05T14:36:58.147847Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:52.140429Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:52.140429Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:7fe433e5117cfa82001791b8037643586df8b22cabede1b194f86c3f2d50616f","observation_id":"c2bf5050-cc1a-4248-b288-0fdf629aeda3","resolution":{"observed_at":"2026-08-05T14:36:52.140429Z","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-05T14:36:52.213593Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:52.213593Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:c52765bb618e9ff3683aebf5964bedf274d95b90b379cd176b8414ab9acd8dc4","observation_id":"eaf04193-78e9-4dcb-b03a-36ad7604cff7","resolution":{"observed_at":"2026-08-05T14:36:52.213593Z","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-05T14:36:52.269077Z","title":"K APRALOV , V","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:52.269077Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:a01c426ddd217d0c179282d2f5cb31b2e74537e15fd4036bc65b95996df6f438","observation_id":"01871545-790c-40fa-9d03-c41affd9e047","resolution":{"observed_at":"2026-08-05T14:36:52.269077Z","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.7907/7yade-5k351","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.124215Z","title":"K IREEVA AND J","venue":null,"work_id":"cdb7e957-f954-4029-aa64-c730b95ded41","year":2023},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:52.369192Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:1fa5442d28b9e531979a7cdd2951c888545e27926e2250e501cbe06a8fc51932","observation_id":"4f12bc76-5787-4a33-8311-c1c418941328","resolution":{"observed_at":"2026-08-05T14:36:58.127011Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:52.438968Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:52.438968Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:18e7f49b9f66181b0c5b5f8b803c048587f35d83fdfa04b6c8bd6f33c1b091bf","observation_id":"0bb1c0b1-5591-4d8b-8756-3be2be13c827","resolution":{"observed_at":"2026-08-05T14:36:52.438968Z","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-05T14:36:52.516729Z","title":"K OLTCHINSKII AND S","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:52.516729Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:de8392328c80692993235ae8819726e71f2a10c0ecd06aa54827d4460cd63ebb","observation_id":"516b99ab-2005-4ea0-8c51-dd667e64ba73","resolution":{"observed_at":"2026-08-05T14:36:52.516729Z","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-05T14:36:52.587688Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:52.587688Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:6e89bdf1115392eadd2c958d33941318f12807922930737f53ecec369eab0556","observation_id":"04cbc729-0af4-41af-9b00-4d34015a4991","resolution":{"observed_at":"2026-08-05T14:36:52.587688Z","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.1145/3004053","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.103122Z","title":null,"venue":null,"work_id":"cbcb89bf-8668-4e46-a918-e324ed6d7edc","year":2017},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:52.647537Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:b67a8a12ea915c71da6a9cef4ef31abfbd1c60e07791c189b2c27b54875a3659","observation_id":"df86a8c6-09ef-4581-b62b-e94d7d4495ee","resolution":{"observed_at":"2026-08-05T14:36:58.106122Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:52.708973Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:52.708973Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:23d07d661065b0e8b2ae0718bfb3107965080745bb12f1aa27e339b72afbc927","observation_id":"29bf3d2b-1dc4-4ab4-95cd-ac6b76d4d179","resolution":{"observed_at":"2026-08-05T14:36:52.708973Z","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-05T14:36:52.818873Z","title":"M A AND E","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:52.818873Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:29a7e023eeb72a0d26bbf0cdf8868eed6953ee98b029b1084e48c2ef521c311b","observation_id":"a39cb0e7-4f68-447d-a895-5f5895aa984e","resolution":{"observed_at":"2026-08-05T14:36:52.818873Z","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":"10.1201/b19567-13","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.087124Z","title":null,"venue":null,"work_id":"c068345c-e25f-44c4-819e-10c2d50eb494","year":2016},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:52.930101Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:a0b33842b3d04bd849476f93cecc6458ef9faa09c8cf29c8f18e4e1aca3cff16","observation_id":"bb6752e7-fd0f-4e07-9ac1-7a6f06f59f3e","resolution":{"observed_at":"2026-08-05T14:36:58.089974Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:52.995122Z","title":"M ARTINSSON AND J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:52.995122Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:1e83bae74c8b340f900fd9b88ade76635d9be04d68e0add3509703521ef1cb00","observation_id":"d5105dc2-f282-4ef4-86e2-741bba92c23a","resolution":{"observed_at":"2026-08-05T14:36:52.995122Z","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.1137/24m163712x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.072615Z","title":"M ELNICHENKO , O","venue":null,"work_id":"88a55f77-ec11-4f8d-b0c0-43859778ac77","year":2025},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:53.086411Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:af8c3531152bdbdabc7d6c0f777bfb0e178a55cdaf794977b77727441cd11414","observation_id":"0a34d924-5678-4e41-a8ac-f4b5160965b6","resolution":{"observed_at":"2026-08-05T14:36:58.075490Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:53.254367Z","title":"M ENDELSON , A remark on the diameter of random sections of convex bodies , in Geometric aspects of functional anal- ysis, vol","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:53.254367Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:35c8924db71e8181c2e10c5d14a405eac4ce1aed420d923ab9a6d4ad54b9eec5","observation_id":"4c314d6d-92ee-42e3-90d2-4a16f6d04b38","resolution":{"observed_at":"2026-08-05T14:36:53.254367Z","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-05T14:36:53.393435Z","title":"M ENDELSON , Learning without concentration, Journal of the ACM, 62 (2015), pp","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:53.393435Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:cb1315781bd03fc9231828d84dd2a1f4cbebd760709d246feb94ac23bbe881cb","observation_id":"f72bb587-1d8f-46e6-b125-ae959b034fa2","resolution":{"observed_at":"2026-08-05T14:36:53.393435Z","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":"10.1007/s00440-017-0784-y","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.063421Z","title":"M ENDELSON , Learning without concentration for general loss functions , Probability Theory and Related Fields, 171 (2018), pp","venue":null,"work_id":"d3921078-8ae8-4a90-8484-c9bc4eb76fcf","year":2018},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:53.494851Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:56cac3f7ad149c3c6612fa8f76e959be2eaa0d71ce2961d34082a9e4241bcc60","observation_id":"3eda13ce-a3b5-46aa-8907-a65978e63a21","resolution":{"observed_at":"2026-08-05T14:36:58.066862Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:53.644425Z","title":"M ENG AND M","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:53.644425Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:5e236707ed967b82e3fc51885964567a7fa43df82f2924f51d98cebd0ab20f2e","observation_id":"e9e0d53a-583d-484f-8045-3d062534d309","resolution":{"observed_at":"2026-08-05T14:36:53.644425Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.04952","last_updated":"2025-01-31T09:26:54Z","snapshot_observed_at":"2026-07-06T16:16:33.763988Z","submitted_at":"2023-09-10T07:48:03Z","title":"Hutchinson's Estimator is Bad at Kronecker-Trace-Estimation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.04952","snapshot_observed_at":"2026-08-05T14:36:53.798831Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:53.798831Z"},"links":{"cited_paper":"/paper/2309.04952","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:890b331777991175aa8929e855d42346e5f4fe4dea2d272fb31844096ca22721","observation_id":"3f60061b-c07b-4537-94cf-f44b8d0b888c","resolution":{"observed_at":"2026-08-05T14:36:53.798831Z","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-05T14:36:53.926537Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:53.926537Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:27a67231358711daf97a9981231df5c476ac57a075002e19f532a563261db7ba","observation_id":"cfc51c17-2db0-4715-95a1-2f32a259e0cb","resolution":{"observed_at":"2026-08-05T14:36:53.926537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.08029","last_updated":"2025-02-13T18:51:33Z","snapshot_observed_at":"2026-08-08T11:03:54.369859Z","submitted_at":"2025-02-12T00:09:18Z","title":"Understanding the Kronecker Matrix-Vector Complexity of Linear Algebra","version":2},"cited_work":{"arxiv_id":"2502.08029","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.08029","snapshot_observed_at":"2026-08-05T14:36:58.843744Z","title":"Understanding the Kronecker Matrix-Vector Complexity of Linear Algebra","venue":"cs.DS","work_id":"4f1b6c32-c9aa-4b6b-9908-70f824196c59","year":2025},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:54.031062Z"},"links":{"cited_paper":"/paper/2502.08029","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:46d19e60bdebe5a7f2fa6fe7a7411065e655469809e9e7acd0c324763b08aba6","observation_id":"d4e9b703-103f-4e68-8498-b57ff2de6ec7","resolution":{"observed_at":"2026-08-05T14:36:58.847239Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:54.171580Z","title":"M OHRI , A","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:54.171580Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:08369a3977d71b1c06dc9a24c4a7bab67624ea74189bac9fd713822e554dc4c1","observation_id":"6b6425d6-2982-4f78-bad6-42d9f5e136ca","resolution":{"observed_at":"2026-08-05T14:36:54.171580Z","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-05T14:36:54.266688Z","title":"M OTTA , C","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:54.266688Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:0f180170c01b1de2a1d17ca06b8a7a79f789fe94be82a81eaca02958ae112c0e","observation_id":"159621d7-d548-4b42-83e7-1ffcd78069c7","resolution":{"observed_at":"2026-08-05T14:36:54.266688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.11474","last_updated":"2023-04-12T20:56:40Z","snapshot_observed_at":"2026-07-06T14:54:41.337108Z","submitted_at":"2023-02-22T16:21:37Z","title":"Randomized Numerical Linear Algebra : A Perspective on the Field With an Eye to Software","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.11474","snapshot_observed_at":"2026-08-05T14:36:54.400432Z","title":"M URRAY , J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:54.400432Z"},"links":{"cited_paper":"/paper/2302.11474","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:941dbac10c29c788c14c1286f6e5f857d7b3144efe4bdb87595dfa3708291494","observation_id":"cfd2aae0-6426-4eb7-8e87-7188ded37472","resolution":{"observed_at":"2026-08-05T14:36:54.400432Z","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.2172/2462906","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.042615Z","title":null,"venue":null,"work_id":"00ea3f63-d8b8-4eb0-910c-c4494ed9f9a9","year":2024},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:54.479659Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:5cb83b6c7ffc60a438dcd4d11cf7cf7f591792ee496f544c1bda4410443c093a","observation_id":"0bdf7ed3-1138-4565-aed3-37c4fe44ffb2","resolution":{"observed_at":"2026-08-05T14:36:58.045365Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:54.560226Z","title":"M USCO AND C","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:54.560226Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:4d330c8a13e600e7f91f29122e3b6308a4d0662f56b07d7c09da811436afb472","observation_id":"00b13c3c-ea6c-4849-b687-9da789a46ec1","resolution":{"observed_at":"2026-08-05T14:36:54.560226Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-08-05T14:36:54.670579Z","title":"N AKATSUKASA , Fast and stable randomized low-rank matrix approximation, arXiv preprint arXiv:2009.11392v1, (2020), https://arxiv.org/abs/2009.11392v1","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:54.670579Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:f30b2856ab428cfd081d2408156f1bdcb2fc53e62ad47d8496c3c01773802b96","observation_id":"351eb127-3b72-4fde-9ef4-f3dba8dfa730","resolution":{"observed_at":"2026-08-05T14:36:54.670579Z","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-05T14:36:54.907889Z","title":"N AKATSUKASA AND J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:54.907889Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:babd4bf7dc19650c4bf1d5c52849981e35d59c8dee6fccae3ea068407ad98ed7","observation_id":"07ee3f15-9582-455a-931a-a67476ac447a","resolution":{"observed_at":"2026-08-05T14:36:54.907889Z","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-05T14:36:55.014694Z","title":"N EEDELL , W","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:55.014694Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:71642793255d7643de023715a8e6f1026c6c187244947dfecf6e2b1e687cfb94","observation_id":"4a2ba7f5-b932-499f-b109-24311c77414d","resolution":{"observed_at":"2026-08-05T14:36:55.014694Z","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-05T14:36:55.111216Z","title":"N ELSON AND H","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:55.111216Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:7a0a53bb084d77b0c9a794e8f78b6efad45c4b321ac2693d466e0a75f95970bd","observation_id":"f213bfc1-c39f-401a-8a30-7362584d0ee8","resolution":{"observed_at":"2026-08-05T14:36:55.111216Z","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-05T14:36:55.208134Z","title":"N ELSON AND H","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:55.208134Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:f90875eab44d0474caa75774f27cc68c997f3e72d8693c8e8da3fee58c45da9e","observation_id":"792f96c3-53d3-40f0-99b8-c42d12f47cf9","resolution":{"observed_at":"2026-08-05T14:36:55.208134Z","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":"10.1007/s00440-016-0738-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.021975Z","title":null,"venue":null,"work_id":"4ad15e8c-bf5b-422b-9e29-f5c2e938409d","year":2016},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:55.334070Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:d7a2c9f369ba2eb9f7f63fba6de285e4310018ade2540cff52ca4d3a19b94142","observation_id":"54879c81-0ef5-436a-a709-144833e12aa8","resolution":{"observed_at":"2026-08-05T14:36:58.024940Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:55.523324Z","title":"O RÚS , Tensor networks for complex quantum systems, Nature Reviews Physics, 1 (2019), pp","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:55.523324Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:57867f3047d2ab67f2fbb671077ad7884e88f4dbb93a4f339f75fe17e02a5833","observation_id":"71550832-adac-4dd9-a827-64b1d1a1479b","resolution":{"observed_at":"2026-08-05T14:36:55.523324Z","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-05T14:36:55.617055Z","title":"P ARULEKAR , A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:55.617055Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:c4b433b7c7f3d74442f85af07abeb4afd787e8531480b276547ce4c412598bf7","observation_id":"c43c2c2b-63b9-4c39-99a0-3bb45aa71474","resolution":{"observed_at":"2026-08-05T14:36:55.617055Z","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.1137/21m1447623","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.007268Z","title":"P ERSSON , A","venue":null,"work_id":"fe3a340f-4aeb-47b9-94d3-adeed6d7fcf8","year":2022},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:55.763045Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:28e54ffb0a7f74d1eb9b7e5cba6cbc261cc5fdb765ae1a450579ae3dcae595fb","observation_id":"b1f5731d-f1eb-4122-bdfd-32922763e7a3","resolution":{"observed_at":"2026-08-05T14:36:58.010128Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/23m1619435","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:57.998183Z","title":"P ERSSON , R","venue":null,"work_id":"42ce6d32-e457-4376-8443-334132037cad","year":2025},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:55.953469Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:afbac2a432aa3309b8f7b3b026b5d79dea3794e82dbb7849014f2c5a5d0f1c15","observation_id":"1efacfb5-c425-4326-a490-d3f6f040895f","resolution":{"observed_at":"2026-08-05T14:36:58.001326Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:56.125345Z","title":"P FEUTY , The one-dimensional Ising model with a transverse field , Annals of Physics, 57 (1970), pp","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:56.125345Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:e9a871234962ba8e301b97db22d46aa5c591f4912da37c540af386c746c6e77d","observation_id":"86f47615-8fa8-4a76-a470-dad03dff18eb","resolution":{"observed_at":"2026-08-05T14:36:56.125345Z","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":"7575.24875","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:36:58.745818Z","title":"P HAM AND R","venue":null,"work_id":"8f40edfa-a73d-4ce2-96a9-cb2ba8a6a21c","year":2013},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:56.241833Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:452a4502b332620a02cfe514e7ab2e8542434a363327a6d040d8f81f0985e649","observation_id":"84a64279-71f4-4f7e-8cc2-535561795825","resolution":{"observed_at":"2026-08-05T14:36:58.750086Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-05T14:36:56.361275Z","title":"R AKHSHAN AND G","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:56.361275Z"},"links":{"citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:5c54420a6d611a408b4a816438ed7f8cec04bd12f04a69453b95cff87fd84894","observation_id":"0d817b16-f9d0-41d3-979a-5f4712a76fc5","resolution":{"observed_at":"2026-08-05T14:36:56.361275Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.13970","last_updated":"2022-02-03T02:06:37Z","snapshot_observed_at":"2026-08-02T18:58:04.365231Z","submitted_at":"2021-10-26T19:18:20Z","title":"Rademacher Random Projections with Tensor Networks","version":3},"cited_work":{"arxiv_id":"2110.13970","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.13970","snapshot_observed_at":"2026-08-05T14:36:58.653252Z","title":"Rademacher Random Projections with Tensor Networks","venue":"cs.LG","work_id":"07ed241f-45bf-4be4-98c2-d21733f857d7","year":2021},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:56.530939Z"},"links":{"cited_paper":"/paper/2110.13970","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:93a07bf2ce2c815a31710fa6349d3cb2e8176618c1368d2d01a850589ac25be6","observation_id":"84d270ff-d7f7-4ca0-82fe-b2fda0279331","resolution":{"observed_at":"2026-08-05T14:36:58.656997Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":11,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":61,"verified_exact":27,"verified_fuzzy":0},"total_outbound_references":126},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 100 of 126 outbound references and 8 inbound Pith citation observations for arXiv:2508.21189."}