{"as_of":"2026-08-08T12:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:67fe69213df952c60b4f39b3511c954894ba0ae5f3d9ba36b4282ab132e206ed","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T08:09:16.681208Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T08:39:56.280803Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.12179","snapshot_observed_at":"2026-08-03T08:39:56.280803Z","title":"arXiv preprint arXiv:2606.12179 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29361","last_updated":"2026-07-31T12:49:16Z","snapshot_observed_at":"2026-08-08T05:40:38.059703Z","submitted_at":"2026-07-31T12:49:16Z","title":"A recursive butterfly factorization with optimality guarantees","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-03T08:39:56.280803Z"},"links":{"cited_paper":"/paper/2606.12179","citing_paper":"/paper/2607.29361"},"observation_digest":"sha256:f9dfb145a64cd3514bd7476cf338c6811090d04a43790136a1a729c9aefc5714","observation_id":"99570f57-ccfb-430b-9289-594ce0087fc7","resolution":{"observed_at":"2026-08-03T08:39:56.280803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2606.12179/citation-record","integrity":"/paper/2606.12179/integrity","json":"/paper/2606.12179/citation-record.json","paper":"/paper/2606.12179"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T08:09:16.681208Z","title":"and Beck, Leland L","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:4d75c64f1800a23599be5dc744c680ee250774d4ffa792b79a53b5718463b3b8","observation_id":"a92af522-3108-47f9-9fa4-e824470d0403","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Eigenvalues and Condition Numbers of Random Matrices , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:c3f377707ef0f4694c756f2f2be45cd82b748daabfd48907b97fc0a12b3efff8","observation_id":"4e799413-ced7-4939-8cbd-cb99b7f4f7f2","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"The matrix-vector complexity of","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:152f04acfc2db8c92608b1054e8b2117566351258365762bc178fb383eb12f76","observation_id":"3cb08a4d-6e56-401a-b093-018d706fc117","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Sharper Bounds for Chebyshev Moment Matching, with Applications , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:4196337e800da8c3a1225056aadaa295675770c6e14227c5e9b911b61535e0a5","observation_id":"a613a48d-8656-4fa9-8b84-1077389aed36","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Woodruff and Guang Yang and Jialin Zhang , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:6c4817ac683398ca91d091463c667f1b83c70d59d2a6e092ac448f2c95ac32f2","observation_id":"985dea21-2721-4137-99fc-e3b8cbfb144c","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Query lower bounds for log-concave sampling , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:ddaa0d50279af44cb8b155fdcfdf09fb29f1d3199da3cbb6c6be31b6d5580be2","observation_id":"89bce488-4edd-4f3c-9d3f-0c96648c16eb","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Analysis of stochastic","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:e0f71411931b42d3f26037bf0b46671d5cc08c3ae9400e2862ac23ef4cca881c","observation_id":"32d56f0d-f70b-4a89-8001-57c5af5302f9","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Meyer and Cameron Musco and Christopher Musco and David Woodruff , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:cfca378bc4c002216a28e9f81123d60b81eb02ba621313cedd67b9e2b188914e","observation_id":"0b16de36-ba83-403d-9f4f-c0de39309ebb","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Meyer and William Swartworth and David Woodruff , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:d46ec74ae936aaf1456f8604d63c8de0955830ab1015fc356b2cc4002602e1f2","observation_id":"dcb8b1aa-e3f3-4755-acbd-ad6fe405f794","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Optimal Query Complexities for Dynamic Trace Estimation , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:dac69f48fae5b133f7370fcc2b2be0c81ff71a1175a5c2400165b733e07a6b6a","observation_id":"a8a26b09-e751-49b2-a278-bab0e05a35b7","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Tight query complexity lower bounds for","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:7859f4cf30f2858dbc0d2edaca5a6a246f20ad5b34ffb97690b7c1fb68a29d02","observation_id":"1de6a6bd-52a5-47cf-9aa5-b2c0b2d21cb1","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"The Gradient Complexity of Linear Regression , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:6e79d6f3fddbef8a5cb9ddf65eb9907526a86a4793b1cc740d1760ea926fb2ef","observation_id":"527610f1-3919-4ed9-8163-72e931e0b20b","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Sublinear Time Spectral Density Estimation , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:59d50d23af426da2d48df697841c599247c461f168c41fdd5ac2b9b4d125e575","observation_id":"efc64f4b-3367-4a58-8be3-d6cf6df66782","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"and Thilikos, Dimitris M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:ae471f4351815e9e93da454d29ff72178a92cd8314def39e106cca11ee45f82d","observation_id":"054e593c-4bdf-4d84-8e2c-ae173d8e94a0","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"On chromatic number of graphs and set-systems , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:5b5c79f9cdcc690d7af9fff62e20b0db4866281e1156fe520c074e061566edd0","observation_id":"1c7667ca-1628-4d5d-a68b-ad1b8943e75d","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:093f0d55d37381c189e067da8ce185312037a5b3eac3d0832665dc1f3d908e1a","observation_id":"f74c4102-35b0-450e-898b-8a9c7560a4a3","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Goldfarb and Ph","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:c2f5cc16ce69c12266c3605f963a153041c581e9731fc2021aa1520e430f8551","observation_id":"43a98b29-0a82-4f6b-984a-af751c9568cd","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Thomas , date-added =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:37ca58639920056b93c95335c70414aa3b1908ae7dd788b3edd13497627630be","observation_id":"50d1367d-9615-4e01-ba45-c9ce0af8c63a","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"ACM Trans","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:c6222ac20cd92553881217811de6e842e8679347ec9eebe25f0953b902217816","observation_id":"855a8693-5c21-41e4-86af-06f8ed29724c","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"The Elements of Differentiable Programming , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:b781a3063cb3f60114ab57a22ef9bb8a48d6ece2114a11c01d8053c8cc0b419c","observation_id":"9f8d08ae-1a5c-4cca-b207-9dfff6fb8be1","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:c9f5db64081a2c09c87c8359aa297774e44054e5ace4410e92bba88faa97fcb6","observation_id":"14088795-b68a-4d15-b025-66ea45271ec5","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"and Saad, Yousef , date-added =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:25b15165ee6a9d6a19f6cf1a8ca13bbf66231d6d4365109b1cbfc67d49226178","observation_id":"d4ac843e-a0dc-4264-a58f-2989cfe422f9","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:e0934b1f357bd686ba29c9eb8db1bd8ca216496eefbc6563e459c5104f3cb190","observation_id":"8a7802d8-bf8f-491d-a89c-3786f85240ad","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Aster and Brian Borchers and Clifford H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:d4e3c7df27eff0b0253307151fda4a0f8cc6b21697a5322755b01cecdd9b59ca","observation_id":"2578b106-9c29-4c41-8225-9346ab9cf36d","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Full waveform inversion and the truncated Newton method: quantitative imaging of complex subsurface structures , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:da724639fc40837b1edb43c0b33f0103a5f857b68e6aaae5f42e626ef7d8ec34","observation_id":"1a839eba-2775-451c-b0ad-68a27cc764c8","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":", date-added =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:abb7c376aa6892204e5fe2296286db53ca06717db6e308b298a5ef1bf71d3b39","observation_id":"87ba572f-088e-4d48-ad1b-26c2e85dc467","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":", date-added =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:84dba216103dc19301066862b38a1e8d0ace5e9908fd9bd0bcc2e568546410c3","observation_id":"7593e98f-c0ed-4ff0-8749-87f69669add7","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"and Vries, Harm de and Bengio, Yoshua , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:b399e4c055d0d3de9f20f80a31d9fb86214fae34003183da43bc899c023a5f03","observation_id":"d61ad18e-452b-4548-95cc-ed2c3428d348","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:2d7fab66a57b574d15a0c456a72dfe788f039a93b3a5a490f4e3531da2732368","observation_id":"53bef18c-c7c8-447e-8112-cc85ffecf2b2","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Randomized Block","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:7c8976e0fc1745bce91fbf727f23bb7e2d93abb650fa0ed145143ccee7c3aeb4","observation_id":"33d4d63c-8a6c-4471-a429-fe32b101c1be","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Communications in Mathematical Sciences , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:48234101042e2c1a831e4b2a6e15d5aaf5ef691c98527d81a112e087fe184a23","observation_id":"3fca6f13-3ee2-460b-904c-c2fc2b503bc7","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Fast construction of hierarchical matrix representation from matrix--vector multiplication , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:0f7ce456add9b17e6af254765bbfee2c2603207ebf4310405555cff4d303824e","observation_id":"929fc774-ed48-4cb6-a96f-ce97f8cc809a","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Butterfly Factorization Via Randomized Matrix-Vector Multiplications , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:bc986b8a51ec509cf7455d8c8acfd0be0675d25a58794ee4ce785108dbf50690","observation_id":"cb48dec1-84c2-48eb-9107-a1ae4f74bd80","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Pearce and Anna Yesypenko and James Levitt and Per-Gunnar Martinsson , date-added =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:7da8fbbe08670e5d51970eaccd5e7a1925345c4b81151af4693005d44b34bcea","observation_id":"0cb7c7b2-a3c3-448d-9c61-1317b2a5802c","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Linear-Complexity Black-Box Randomized Compression of Rank-Structured Matrices , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:fbf7917bbbf0a9c68310ec1edee8bb406f27f94ae2f414f69907ca6263271442","observation_id":"92a0f28f-b786-4eed-8ff1-392dd590a28c","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Journal of Computational and Applied Mathematics , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:9a3d8ffaf9cdff6ff747606f11a4eea97d215f8e3cfae997619138df050a3626","observation_id":"e03f19db-a5a7-462f-bccc-092e91e8101c","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"and Woodruff, David P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:9fb9785dcaceb28730cbbbae75029ae4e902a115991e31a03969732c0deb1c01","observation_id":"6d14956e-375f-42ab-939f-4adbac0fc2eb","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"and Woodruff, David P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:644d55c7805bcc4f6298c99d9372fcd6499e258adaa7233dd470ddf294225a59","observation_id":"94a09460-7e06-4f52-902f-357d339323f7","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Krylov Methods are (nearly) Optimal for Low-Rank Approximation , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:5bf2fab54111817f9427b615b21d318301d9d6b58f4f2c8f2464b57959b64c3a","observation_id":"faac729c-f0c7-49a2-b428-84b7322cb2eb","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"A Tight Analysis of Hutchinson's Diagonal Estimator , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:39e4d8d14d5c35ef8c0299088eeaee627247a9825ee8b1b4b9e660bd893d399e","observation_id":"69fa8d44-ce5a-4235-8d89-23993c738ab3","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Query Efficient Structured Matrix Learning , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:7b4b4ded2bab2eca8715662b5c7d734677e95300911db01591101d2401e2aa1a","observation_id":"ceed7e84-b7c1-454a-8644-82b0d133e7e5","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":null,"venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:253a104698951798cbd995dce8ff95098a9639579127e08791f3a3e762d37780","observation_id":"e393e8a8-4006-4a77-bf46-8306205daa2a","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"and Cai, Jin-Yi , date-added =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:f9643817ab37f849f93cf75093a4d5e43134e3ca8250510d17abc878b599b927","observation_id":"92de922b-8f77-45c4-aa5a-2649614ee576","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:f3ba9af8d978117dcdd346dadeb541f2f17282ee3d0152ce2eca3f7db3f9a08e","observation_id":"8147ca15-9c87-4594-b687-e76b331c4540","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Baston and Yuji Nakatsukasa , date-added =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:47875dd9c1d7ffb6cb85bb887516b760bdbc0f7cb6ca85489d191f5980e03464","observation_id":"3b4997fa-5815-4654-b529-613dadfcb4ea","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"and Kokiopoulou, E","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:d81f45eb3ded14342270de3a5a9207ff50702d5920b7a3a115bebb00737eda59","observation_id":"7f8168b1-7a86-4d26-b469-efb9d253c3d3","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Structured Semidefinite Programming for Recovering Structured Preconditioners , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:a69cf4bc4ef36d422d4ab525a9d311d3361054d0b97f381a83f6b05818724955","observation_id":"b4aee3dc-4e3a-456c-9064-1c1ac96aca8b","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Sparse Cholesky Factorization by Kullback--Leibler Minimization , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:66adbf237195f55638577dab38fdc43cbfdcb5f2feb8b5b8af8d3db253b9ddbe","observation_id":"d970bb29-f99a-4cdc-8df2-3104b0805d69","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Sparse Recovery of Elliptic Solvers from Matrix-Vector Products , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:8aa2b9acf77b80241346f3e6ec157f8180ea6e99bf8d61a8fcd6cc75c6121364","observation_id":"39627478-7c10-4c62-8641-68dc7baf8be9","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"and Kovachki, Nikola B","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:a03c0f8b351ca1ccc8ac811154ea21d104263a373af2d208f768cdd074082d48","observation_id":"2c5c368d-99e1-4582-b6f3-602985e47efb","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Learning Elliptic Partial Differential Equations with Randomized Linear Algebra , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:bd97a430161d031280b242b72280a712c7c84365417d98b19839f8d3a32f41eb","observation_id":"c0b68d8d-43e9-41ff-b445-6bca677fb57d","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"SIAM Journal on Matrix Analysis and Applications , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:3f1f5d5780b8891ae79c81718b27532476510e0c45806759994ed30233d29fc5","observation_id":"c4c66dad-ab32-4bbd-b07b-8716816ccc32","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Operator learning without the adjoint , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:555894479fb358c40f96f6c135f820310fe24071da7111f6db47ffe5f98d8521","observation_id":"5bdf8992-7fa5-402b-9bc5-53128f99e89f","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Elliptic","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:c8f6433bf5dfff785734ecf0135840f14fc3f1c019d8e08f951356c4a6d98d1f","observation_id":"107ef049-f294-4491-acdf-6260426e57c0","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Near-optimal hierarchical matrix approximation from matrix-vector products , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:2c5530fbfa4f3033fd3db8b36a06036a84cd011793a7353d26ccda1de7e34721","observation_id":"3786742b-50b8-46d3-bf44-937f6242181b","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Structured matrix recovery from matrix‐vector products , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:4d2bbf49ef21dc5491ec9a032ffa240b472e307bc17b3927a6d351870f71aa9e","observation_id":"a83b3779-a791-4e84-8a31-384e227e4801","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:8e143ef9ca7fa20caabf8f0cea849cd9512e2d295e7fb9495d59c5a1e7959b4d","observation_id":"242307ed-85eb-4f5c-a1d5-7c789bff1dc5","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"Coloring, register allocation,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:5d83071895ec82bd41c82b4491e03c2c0e8c0ae3bf35c46672dfedceef869695","observation_id":"d6682ed8-f957-429c-9662-d5c03aae8514","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"and Martinsson, P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:1d1fdfec347083a781728fb62e679aa84390c55e31a3d4ef8c1cc57fe28260f3","observation_id":"6470ddfa-83b2-4115-b6a7-2747c0f18845","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","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-06-27T08:09:16.681208Z","title":"SIAM Journal on Matrix Analysis and Applications , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-06-27T08:09:16.681208Z"},"links":{"citing_paper":"/paper/2606.12179"},"observation_digest":"sha256:9aed30600e8b8ca9c8de58b866a981708350d4252b14b148100a5e1cfeeea90b","observation_id":"2beb88ba-58fc-431e-abd4-3cbb39ce29f5","resolution":{"observed_at":"2026-06-27T08:09:16.681208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.12179","last_updated":"2026-06-10T15:04:46Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T23:51:07.629939Z","submitted_at":"2026-06-10T15:04:46Z","title":"Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":60,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":60},"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 60 of 60 outbound references and 1 inbound Pith citation observation for arXiv:2606.12179."}