{"as_of":"2026-08-09T09:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eb2c4cd893d48dfaae0f59bda99e2971120d3ef8ce4efc974a05b3fa42e10a7d","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":22,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T11:20:55.809995Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T21:46:15.469688Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":"2306.12418","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-07-01T21:46:15.469688Z","title":"arXiv preprint 2306.12418 (2023)","venue":null,"work_id":"c23c5f98-c518-4821-923f-d50a0f2fa9cc","year":2023},"citing_paper":{"arxiv_id":"2411.01986","last_updated":"2026-04-21T13:54:58Z","snapshot_observed_at":"2026-08-08T13:32:43.399702Z","submitted_at":"2024-11-04T11:18:14Z","title":"Randomized coupled decompositions","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-23T17:50:17.168011Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2411.01986"},"observation_digest":"sha256:a70fe63a0c1d2793810c2d05e58851f47f6f902dfc6f83b27581a65c75135ac7","observation_id":"09d9cad9-1842-485f-846e-a075523d28ab","resolution":{"observed_at":"2026-05-23T17:53:18.637498Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-08-08T11:20:55.809995Z","title":"Randomized algorithms for low-rank matrix ap- proximation: Design, analysis, and applications","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.07993","last_updated":"2025-05-22T14:51:54Z","snapshot_observed_at":"2026-08-08T11:10:25.360168Z","submitted_at":"2025-02-11T22:19:56Z","title":"What is a Sketch-and-Precondition Derivation for Low-Rank Approximation? Inverse Power Error or Inverse Power Estimation?","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-08T11:20:55.809995Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2502.07993"},"observation_digest":"sha256:bf07b49973622ddf34caa6bf0a90d307e7f3facd056ef1a0a3380d124b1607ef","observation_id":"6ed05901-d94c-4631-8f7f-20c0f9f0cc46","resolution":{"observed_at":"2026-08-08T11:20:55.809995Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-08-07T15:03:40.982710Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.16937","last_updated":"2025-09-06T14:27:10Z","snapshot_observed_at":"2026-08-07T14:50:27.040751Z","submitted_at":"2025-05-22T17:27:40Z","title":"Quasi-optimal hierarchically semi-separable matrix approximation","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T15:03:40.982710Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2505.16937"},"observation_digest":"sha256:8402fc7f4125a28f6e53578fee9adeab46568e0df1e6fcf36b5728da0fd897d4","observation_id":"b8ce8ebe-d4e0-4f25-aabd-6246565daec7","resolution":{"observed_at":"2026-08-07T15:03:40.982710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-08-07T04:51:10.176993Z","title":"Randomized algorithms for low- rank matrix approximation: Design, analysis, and applications,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.09594","last_updated":"2025-07-08T09:43:58Z","snapshot_observed_at":"2026-08-07T04:42:13.488017Z","submitted_at":"2025-06-11T10:53:07Z","title":"Accelerating Large-Scale Regularized High-Order Tensor Recovery","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T04:51:10.176993Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2506.09594"},"observation_digest":"sha256:da4e55be616db9d585a4090cbe999b61f5098c1a0516010c42222dcaa18fa9ad","observation_id":"5485c390-40e7-4350-b1a0-df665649b8c4","resolution":{"observed_at":"2026-08-07T04:51:10.176993Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-08-06T23:41:20.731323Z","title":"Randomized Algorithms for Low-Rank Matrix Approxi- mation: Design, Analysis, and Applications,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16663","last_updated":"2025-06-25T18:39:32Z","snapshot_observed_at":"2026-08-06T23:35:52.034722Z","submitted_at":"2025-06-20T00:19:45Z","title":"A Comparative Analysis of Principal Component Analysis (PCA) and Singular Value Decomposition (SVD) as Dimensionality Reduction Techniques","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T23:41:20.731323Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2506.16663"},"observation_digest":"sha256:0537badaeddc304be8b28f29048a536006726b66fc8aeec33cc085dc0948da31","observation_id":"64812ccd-1929-4ced-bd92-1c66bd1ececb","resolution":{"observed_at":"2026-08-06T23:41:20.731323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-08-06T17:50:30.636603Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.10144","last_updated":"2026-05-30T08:24:59Z","snapshot_observed_at":"2026-08-06T17:36:06.952479Z","submitted_at":"2025-07-14T10:43:21Z","title":"A structural bound for cluster robustness of randomized small-block Lanczos","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T17:50:30.636603Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2507.10144"},"observation_digest":"sha256:1dba84244ef7127a76738f5f61d97d51a70964c6fc8b6285a98c1887ef9453cf","observation_id":"83ff9243-182a-4122-9610-19b653e93574","resolution":{"observed_at":"2026-08-06T17:50:30.636603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-08-05T22:05:28.678017Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.07610","last_updated":"2025-08-11T04:29:59Z","snapshot_observed_at":"2026-08-08T07:37:45.502280Z","submitted_at":"2025-08-11T04:29:59Z","title":"Tomography-assisted noisy quantum circuit simulator using matrix product density operators","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T22:05:28.678017Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2508.07610"},"observation_digest":"sha256:1b236b71ff93968b08acd699a55b6036b453624b7c36eba8d384e6173d44004e","observation_id":"4e5eb23d-054b-4207-b01b-fcbdd9843182","resolution":{"observed_at":"2026-08-05T22:05:28.678017Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-08-05T14:36:57.741732Z","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":116,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:57.741732Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:b1af0e0cc10a8f2f850ffa42f4be48904f6e3f64dfccd357dd389692a9cd15a0","observation_id":"6cea9e27-cb33-4145-a652-d32ddbf44bc9","resolution":{"observed_at":"2026-08-05T14:36:57.741732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":"2306.12418","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-07-01T21:46:15.469688Z","title":"arXiv preprint 2306.12418 (2023)","venue":null,"work_id":"c23c5f98-c518-4821-923f-d50a0f2fa9cc","year":2023},"citing_paper":{"arxiv_id":"2509.11932","last_updated":"2026-04-03T06:41:05Z","snapshot_observed_at":"2026-08-09T09:09:14.742794Z","submitted_at":"2025-09-15T13:47:43Z","title":"The Filter Echo: A General Tool for Filter Visualisation","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-18T16:23:29.195686Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2509.11932"},"observation_digest":"sha256:dc62710ac60d513071c1923721cfb7dd7fc1ed1c696a6cd9c047f8c86ec88330","observation_id":"1819cbb4-99d4-44a5-9b3c-785e0d5d20a1","resolution":{"observed_at":"2026-05-18T16:26:36.989809Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-08-04T09:50:55.425680Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.13204","last_updated":"2026-06-10T02:35:09Z","snapshot_observed_at":"2026-08-08T09:39:56.652387Z","submitted_at":"2025-10-15T06:49:00Z","title":"How many integrals should be evaluated at least in two-dimensional hyperinterpolation?","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-04T09:50:55.425680Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2510.13204"},"observation_digest":"sha256:5993966d902d8a5e99d7d0e10e725e95f460a93b5fc0f495974cbfe69753041f","observation_id":"97bf826c-ec0c-4031-8234-8dc6973d2efc","resolution":{"observed_at":"2026-08-04T09:50:55.425680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-08-03T09:48:03.204829Z","title":"Randomized algorithms for low-rank matrix approxi- mation: Design, analysis, and applications","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.13102","last_updated":"2026-07-08T08:19:49Z","snapshot_observed_at":"2026-08-06T21:55:46.817681Z","submitted_at":"2026-01-19T14:40:49Z","title":"Approximate full conformal prediction in an RKHS","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T09:48:03.204829Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2601.13102"},"observation_digest":"sha256:75f9df90d8ce0df645c3e48e0a738616b097881356a1416cce6cf635623a8ce7","observation_id":"3a6f076f-d914-4bae-b0a2-486357892dce","resolution":{"observed_at":"2026-08-03T09:48:03.204829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":"2306.12418","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-07-01T21:46:15.469688Z","title":"arXiv preprint 2306.12418 (2023)","venue":null,"work_id":"c23c5f98-c518-4821-923f-d50a0f2fa9cc","year":2023},"citing_paper":{"arxiv_id":"2604.02659","last_updated":"2026-04-03T02:47:03Z","snapshot_observed_at":"2026-08-03T03:18:51.485113Z","submitted_at":"2026-04-03T02:47:03Z","title":"Low-Rank Compression of Pretrained Models via Randomized Subspace Iteration","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-05-13T20:49:34.668488Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2604.02659"},"observation_digest":"sha256:70706c6e0b2f4ae4ccf5d1449ca34e03ed0d3ddd2d8a4d66a57c40ef116df2f9","observation_id":"9dc01ec1-b9ad-4d68-8f57-e115bcc2960e","resolution":{"observed_at":"2026-05-13T20:53:16.004196Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":"2306.12418","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-07-01T21:46:15.469688Z","title":"arXiv preprint 2306.12418 (2023)","venue":null,"work_id":"c23c5f98-c518-4821-923f-d50a0f2fa9cc","year":2023},"citing_paper":{"arxiv_id":"2605.02574","last_updated":"2026-07-09T22:52:24Z","snapshot_observed_at":"2026-08-04T12:17:38.790675Z","submitted_at":"2026-05-04T13:29:09Z","title":"Fast and accurate conditioning for large-scale Gaussian process prediction problems","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-08T01:49:21.648424Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2605.02574"},"observation_digest":"sha256:2b38a34faf972adad4b9ce99b903a725c5b137f9ab5a805bad0dd61485bb5456","observation_id":"06e63e7d-1da6-4401-8a9b-5d68518ba183","resolution":{"observed_at":"2026-05-11T23:06:17.024635Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":"2306.12418","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-07-01T21:46:15.469688Z","title":"arXiv preprint 2306.12418 (2023)","venue":null,"work_id":"c23c5f98-c518-4821-923f-d50a0f2fa9cc","year":2023},"citing_paper":{"arxiv_id":"2605.02574","last_updated":"2026-07-09T22:52:24Z","snapshot_observed_at":"2026-08-04T12:17:38.790675Z","submitted_at":"2026-05-04T13:29:09Z","title":"Fast and accurate conditioning for large-scale Gaussian process prediction problems","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-01T00:35:57.311207Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2605.02574"},"observation_digest":"sha256:69549892944ac0f16fd376558f08a913747ef0505ab37fcd5851579b234dbf55","observation_id":"0c8fcacb-79b1-44d7-b114-e1bc5c41d1c4","resolution":{"observed_at":"2026-07-01T00:45:12.318376Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":"2306.12418","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-07-01T21:46:15.469688Z","title":"arXiv preprint 2306.12418 (2023)","venue":null,"work_id":"c23c5f98-c518-4821-923f-d50a0f2fa9cc","year":2023},"citing_paper":{"arxiv_id":"2605.05043","last_updated":"2026-05-06T15:34:54Z","snapshot_observed_at":"2026-08-02T23:34:27.509479Z","submitted_at":"2026-05-06T15:34:54Z","title":"Finding accurate eigenvalues and eigenvectors of positive semi-definite matrices given a subspace","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-08T16:24:55.382255Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2605.05043"},"observation_digest":"sha256:f560e66854db6164b40ee4cdaff9a495747f678e6401dda33b84b91353b0534e","observation_id":"e6823186-4519-429b-92a5-f83b5fb4b14e","resolution":{"observed_at":"2026-05-11T18:16:08.739011Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":"2306.12418","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-07-01T21:46:15.469688Z","title":"arXiv preprint 2306.12418 (2023)","venue":null,"work_id":"c23c5f98-c518-4821-923f-d50a0f2fa9cc","year":2023},"citing_paper":{"arxiv_id":"2605.09755","last_updated":"2026-05-10T21:05:03Z","snapshot_observed_at":"2026-08-01T00:27:04.681079Z","submitted_at":"2026-05-10T21:05:03Z","title":"Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-12T03:10:47.684786Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2605.09755"},"observation_digest":"sha256:4b08aaa5e2929dd605dc323e90356e7b555b654e4a8bd7413769b27030a69214","observation_id":"4a3011b8-afd7-4528-8069-2bedc824b3ac","resolution":{"observed_at":"2026-05-12T03:11:18.749039Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":"2306.12418","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-07-01T21:46:15.469688Z","title":"arXiv preprint 2306.12418 (2023)","venue":null,"work_id":"c23c5f98-c518-4821-923f-d50a0f2fa9cc","year":2023},"citing_paper":{"arxiv_id":"2605.21254","last_updated":"2026-05-20T14:42:07Z","snapshot_observed_at":"2026-08-04T22:50:17.644757Z","submitted_at":"2026-05-20T14:42:07Z","title":"Random Matrix Spectra from Boltzmann-Weighted Lattice Ensembles","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-21T03:42:39.920436Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2605.21254"},"observation_digest":"sha256:a579c435fa740d9dc57609173a8f05e54464c1e7ac68a883b6775e2ac70887f3","observation_id":"1683779f-9e34-4b3d-ae7f-c29832612776","resolution":{"observed_at":"2026-05-21T03:43:56.236346Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":"2306.12418","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-07-01T21:46:15.469688Z","title":"arXiv preprint 2306.12418 (2023)","venue":null,"work_id":"c23c5f98-c518-4821-923f-d50a0f2fa9cc","year":2023},"citing_paper":{"arxiv_id":"2605.30640","last_updated":"2026-05-28T22:48:54Z","snapshot_observed_at":"2026-08-07T18:30:05.985217Z","submitted_at":"2026-05-28T22:48:54Z","title":"CSULoRA: Closest Safe Update Low-Rank Adaptation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T08:25:01.052975Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2605.30640"},"observation_digest":"sha256:ed6791b1d0e077e918069998649d5fc9fcb86c0d2ac594166e1666b2e350b9b9","observation_id":"eda58f3f-9c68-4612-81a7-1dfdb077a1da","resolution":{"observed_at":"2026-06-29T08:33:15.752463Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":"2306.12418","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-07-01T21:46:15.469688Z","title":"arXiv preprint 2306.12418 (2023)","venue":null,"work_id":"c23c5f98-c518-4821-923f-d50a0f2fa9cc","year":2023},"citing_paper":{"arxiv_id":"2606.01335","last_updated":"2026-05-31T16:38:43Z","snapshot_observed_at":"2026-08-06T18:04:32.517217Z","submitted_at":"2026-05-31T16:38:43Z","title":"Transpose-free linear algebra","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-06-28T16:22:10.159728Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2606.01335"},"observation_digest":"sha256:1f8f7e3909606b05eeb91e1203655ab872269b4060d03ee4fd462c715fbb4eef","observation_id":"1d7a2d85-c425-4327-b27e-5027d63e1ed8","resolution":{"observed_at":"2026-07-01T21:46:15.471373Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":"2306.12418","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-07-01T21:46:15.469688Z","title":"arXiv preprint 2306.12418 (2023)","venue":null,"work_id":"c23c5f98-c518-4821-923f-d50a0f2fa9cc","year":2023},"citing_paper":{"arxiv_id":"2606.01412","last_updated":"2026-05-31T19:17:39Z","snapshot_observed_at":"2026-08-05T23:04:35.966323Z","submitted_at":"2026-05-31T19:17:39Z","title":"GPTQ-intrinsic LoRA: A Near-optimal Algorithm for Low-precision Quantization with Low-rank Adaptation","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-06-28T17:28:14.160341Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2606.01412"},"observation_digest":"sha256:be25dc6c460426fcd2bd24f5b7ee5a7df9d66358dd3face4a5c3a9d1826580e6","observation_id":"2d9c1b38-1f4f-4252-bb08-e4215beb2027","resolution":{"observed_at":"2026-07-01T21:06:14.408274Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-08-01T11:56:57.823398Z","title":"arXiv preprint arXiv:2306.12418 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19741","last_updated":"2026-07-23T12:54:33Z","snapshot_observed_at":"2026-08-04T13:43:16.896702Z","submitted_at":"2026-07-22T04:12:39Z","title":"Intrinsic Low-Tucker-Rank Theory and Unified Tensor CUR Decomposition for High-Dimensional Hyperinterpolation","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-01T11:56:57.823398Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2607.19741"},"observation_digest":"sha256:9fcdbe3e1c8163689495008106303eb4084c22cf782c70cfd56626f4f0ff5544","observation_id":"777d26ef-0868-4b50-9802-d7463420a809","resolution":{"observed_at":"2026-08-01T11:56:57.823398Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.12418","snapshot_observed_at":"2026-08-07T21:28:56.738119Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.05904","last_updated":"2026-08-06T11:33:07Z","snapshot_observed_at":"2026-08-09T09:11:46.093426Z","submitted_at":"2026-08-06T11:33:07Z","title":"Reduced Basis Method for Simulating Thermal Transients in Electric Machines","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T21:28:56.738119Z"},"links":{"cited_paper":"/paper/2306.12418","citing_paper":"/paper/2608.05904"},"observation_digest":"sha256:6d8da75d477bda4bc3e8c7f29fe7f89d5d6d20e1347708ef7faa120128287e17","observation_id":"2baa3960-36fb-45b3-82cd-324ecf295877","resolution":{"observed_at":"2026-08-07T21:28:56.738119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2306.12418/citation-record","integrity":"/paper/2306.12418/integrity","json":"/paper/2306.12418/citation-record.json","paper":"/paper/2306.12418"},"outbound":[],"paper":{"arxiv_id":"2306.12418","last_updated":"2023-09-22T02:57:04Z","latest_version":3,"primary_category":"math.NA","snapshot_observed_at":"2026-07-06T15:45:13.905037Z","submitted_at":"2023-06-21T17:57:57Z","title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 22 inbound Pith citation observations for arXiv:2306.12418."}