{"as_of":"2026-08-09T11:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3e3b2b35c412a737cd8a51cc0d49ccad980c9217c0d9dfac60e3ae434a813fdc","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T21:57:20.423107Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.06758/citation-record","integrity":"/paper/2607.06758/integrity","json":"/paper/2607.06758/citation-record.json","paper":"/paper/2607.06758"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.696013Z","title":"Bebendorf , Approximation of boundary element matrices , Numerische Mathematik, 86 (2000), pp","venue":null,"work_id":"ac65810e-4916-449d-8400-396a27270eaf","year":2000},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:1e407b71b48519aa2db1e57ac0ef69a0d468e079699ac24b0eafc362f3c94c70","observation_id":"b3408794-710a-4d7b-8431-16ae0456df9d","resolution":{"observed_at":"2026-07-10T21:57:39.724415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.805039Z","title":"Bebendorf, Hierarchical Matrices: A Means to Efficiently Solve Elliptic Boundary Value Problems, Springer","venue":null,"work_id":"e813bed8-09cf-4abb-9c6b-767673fbf902","year":2008},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:e1eed0bc22509e4e5b2e3db1452a5be417a9f28c6187ea82ea46a0cff0553c4f","observation_id":"63031e0a-7aae-4560-addd-fb7134d3732c","resolution":{"observed_at":"2026-07-10T21:57:39.823878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1804.07531","last_updated":"2018-05-24T05:07:35Z","snapshot_observed_at":"2026-08-09T01:44:32.991290Z","submitted_at":"2018-04-20T10:10:10Z","title":"Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views","version":2},"cited_work":{"arxiv_id":"1804.07531","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.07531","snapshot_observed_at":"2026-07-10T21:57:37.113425Z","title":"Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views","venue":"math.NA","work_id":"9fab2a1f-0006-4b72-aa9e-c223faee602f","year":2018},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"cited_paper":"/paper/1804.07531","citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:783b61979ccb906618fc411e38d31ead397f4c346cf55fd47f79b83a58fbc66e","observation_id":"d1482fe2-935f-4356-93cb-c07ab9487fab","resolution":{"observed_at":"2026-07-10T21:57:37.140615Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.592945Z","title":"Bui-Thanh, O","venue":null,"work_id":"ccad5810-396c-4e5d-a5c7-bdc455624103","year":2013},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:ab853c0c49b5f8000fa37b3e7a78cd4f0df0af4163a605a62fe99893f7c36ae9","observation_id":"b6a6522d-1041-41b8-8ed1-f20571bf877f","resolution":{"observed_at":"2026-07-10T21:57:39.623049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":"2410.17091","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:37.146163Z","title":"Carrel, Randomized methods for dynamical low-rank approximation , 2024, https://arxiv","venue":null,"work_id":"4d0b7a95-f17f-4a2d-a8ff-a7ceafb73535","year":2024},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:867525a189d9128ac0bded9209fcf1b3653448debddb4df8b2b1507699912642","observation_id":"db764e3c-59f9-4975-97e4-078c0b63feb2","resolution":{"observed_at":"2026-07-10T21:57:37.171921Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.827278Z","title":"Chandrasekaran, P","venue":null,"work_id":"2d200384-658d-4ea1-8cd6-4c873be88018","year":2010},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:c20490a33bf26443ad409552356d6af13cf743e750e365fd124ea744b92c048d","observation_id":"f6c279c8-daa5-450b-9869-095f76a4c243","resolution":{"observed_at":"2026-07-10T21:57:39.844636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.661898Z","title":null,"venue":null,"work_id":"1d64303c-f5cf-4b0e-9d73-15e4db5e922a","year":2025},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:d547425bd7a03afb74a21546a20e1a620f7d59927b696e5af8f915061a34d7aa","observation_id":"9895dcce-82b1-4a78-b543-abe80cad4aee","resolution":{"observed_at":"2026-07-10T21:57:39.692524Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.779594Z","title":"Cheng, Z","venue":null,"work_id":"7a296ace-8f8b-425a-a25c-55afa8c4ac9e","year":2005},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:352e049953cddd63524d26f10d94b78431ceadf8535ce84fba6259892ddcb7ed","observation_id":"74b6b0a8-3638-4abe-a5c7-7d9d89ec53b7","resolution":{"observed_at":"2026-07-10T21:57:39.800447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.847552Z","title":"De Lathauwer, B","venue":null,"work_id":"01ace665-f44d-411a-8230-d9b6da02d608","year":2000},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:41c3fa7ebe10777bcdf8eed0ee2d122bb6003f9ed8fa1eaaf17d41533e183c40","observation_id":"39730e40-034b-40d1-b4f7-ee4c0547b282","resolution":{"observed_at":"2026-07-10T21:57:39.862889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.627262Z","title":null,"venue":null,"work_id":"9cbe9888-cabe-4998-a490-35101267a5f7","year":2025},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:adde83962494fdbef2e412857b8aa37da81e64d3927e5ae40f72c0c9d5546b6c","observation_id":"7b4ccb09-8760-4107-97bb-c7eb6fc5057d","resolution":{"observed_at":"2026-07-10T21:57:39.655759Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.727609Z","title":null,"venue":null,"work_id":"9befd0c4-6e62-47b0-b2e6-9066dba9d393","year":2017},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:beed45706152ef653452d0cfaaeb4ade6600f2a92108a9525fd74b6dd1f587b2","observation_id":"b85764f0-4b2d-4e12-b38b-57e5bd06038f","resolution":{"observed_at":"2026-07-10T21:57:39.753007Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:40.123945Z","title":null,"venue":null,"work_id":"0d56d8fd-1096-48b1-a983-00fa0939f310","year":2011},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:4d6585ab87bf24a90c90fb730e7f35b7115c64ea5fc21b93c9ae00d22c1b734e","observation_id":"c9b4bab4-32b9-43f4-9ba8-861c42ba8ae0","resolution":{"observed_at":"2026-07-10T21:57:40.138644Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.884632Z","title":"Ghysels, T","venue":null,"work_id":"c7d93eda-6f25-4180-9ef5-bf41ca8831e6","year":2016},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:2380262c4a9c63388cd4b1e3b866157e9484862d938a928bf9446e3e77112c61","observation_id":"69f319d9-c832-48f1-931d-75107af2409b","resolution":{"observed_at":"2026-07-10T21:57:39.909801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:40.279019Z","title":"Gittens and M","venue":null,"work_id":"4733f92c-7568-41a2-bcfd-5b69de72ce49","year":2013},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:95362fbca3f4528abfd725550053d381b04ac494094d77a9dc4545be019c4ccc","observation_id":"482c3fbe-a81a-4026-9d3e-f8646cc3d4b8","resolution":{"observed_at":"2026-07-10T21:57:40.305552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:40.011395Z","title":null,"venue":null,"work_id":"497f3d19-3d65-4b60-9b6e-d919306c6ddc","year":2013},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:9be95ca71d1388fa50ea5e7fe5aa8d532b799eb3c59522d66af8536909baccc3","observation_id":"27c49937-e2aa-4146-a854-92a0aa60c063","resolution":{"observed_at":"2026-07-10T21:57:40.032450Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.482209Z","title":null,"venue":null,"work_id":"7c55947d-ed3f-4a81-ab51-226a33771bd5","year":2013},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:26c38a3598da321ec5a92fd2ed091fe14b56d9af80ce2435db8aac52d2a87ec1","observation_id":"25a48ee6-c239-49e3-9d00-6cfcd3d2006d","resolution":{"observed_at":"2026-07-10T21:57:39.497691Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.947163Z","title":"Gorman, G","venue":null,"work_id":"8f4babe8-662a-479c-bfd6-2c1d3f98c5b9","year":2019},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:4072ef6e15ee7665eda5abaa55080c735c8782d488aa79f850134aa4b482b22f","observation_id":"679192b5-0e41-453d-afd9-f0a960ccd2d3","resolution":{"observed_at":"2026-07-10T21:57:39.978695Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.985293Z","title":"Gratton and D","venue":null,"work_id":"55a0caf2-eb7b-4366-a46c-a0c0493a7f2f","year":2018},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:a9d97d7480691a7e92dc6ed6e27c6941ee7700db101b8b0fefbbf0f5a6f8fa05","observation_id":"c9e644c9-670b-49d1-b8f6-cd3d2ac914af","resolution":{"observed_at":"2026-07-10T21:57:40.007855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:40.036140Z","title":"Gu, Subspace iteration randomization and singular value problems , SIAM Journal on Sci- entific Computing, 37 (2015), pp","venue":null,"work_id":"b0d6f245-fd88-48fd-8ab7-71bd248b2eeb","year":2015},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:e6c0af0490e385687b0773094db91404f1e3d9c3f71b6fa76376ee7943784183","observation_id":"6247b167-6c58-404e-a19b-1ac8a0a902a6","resolution":{"observed_at":"2026-07-10T21:57:40.059957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.500059Z","title":"Gu and S","venue":null,"work_id":"33f3e3df-bbb7-4c30-ae43-8f478730909d","year":1996},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:25c9116a1cb73a7ae7ef9ba2633e14410f9fe5f8e03afd63cdb25830155c99f7","observation_id":"183a481b-fa7c-415f-be43-4c1e1465f826","resolution":{"observed_at":"2026-07-10T21:57:39.515801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.518450Z","title":"Hackbusch, Hierarchical Matrices: Algorithms and Analysis , Springer, 2015","venue":null,"work_id":"a869d085-8ff0-43ad-b1a2-a53faa527e36","year":2015},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:5c5539659131a7ab30aa51140a62b6a9a459a6f0c2c066b2a1e018aa954a511f","observation_id":"3c075bd9-a8cb-43aa-a7b1-c40412ebc206","resolution":{"observed_at":"2026-07-10T21:57:39.540955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:40.160209Z","title":"Halko, P.-G","venue":null,"work_id":"1231acbc-aeb5-4c41-a7de-307ee28ba1e9","year":2011},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:4159d84483c6d04de43d6f7c525cf6edb80b4f40253a665278df22f99c589bf3","observation_id":"366c1d93-4a9b-4bc9-b9f2-f567215704a6","resolution":{"observed_at":"2026-07-10T21:57:40.181841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:40.209689Z","title":"Heavner, C","venue":null,"work_id":"c1acc2c4-e398-44f6-aa37-d7f514268126","year":2023},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:ea3160be7f86de9c1ea9085692dde6b9151126f453ade6011e8db565515271ed","observation_id":"7e442b8a-4243-423d-b980-959a2e9f3ec5","resolution":{"observed_at":"2026-07-10T21:57:40.236862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:40.140805Z","title":"Heldring, E","venue":null,"work_id":"56caee1c-62a6-4882-8f97-a1616ca97eaf","year":2016},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:243b6c9fe9e3e6cd70d9938dd75e18b5f112f5f151466fdddb1d40c31db30dfe","observation_id":"f5de470d-d652-40d7-8411-03ef1ca604bd","resolution":{"observed_at":"2026-07-10T21:57:40.157898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":"10.1080/03610919008812866","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hutchinson","venue":"Communications in Statistics - Simulation and Computation","work_id":"eb2c02b3-49ce-4c35-8ce3-91babd7be55f","year":1989},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:80d572738cb8e6d854b9b131e71ed00a188226b06e48a4f0717429fb1734a409","observation_id":"9880a7e3-7b6b-4eaa-aa79-66996b69056f","resolution":{"observed_at":"2026-07-10T21:57:36.468208Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/22m1528574","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Levitt and P.-G","venue":"SIAM Journal on Scientific Computing","work_id":"96636993-a6f3-4553-8378-2902d09e9dbb","year":2024},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:afd86369e84cb5d46fcf9c7cf0674874b01584b4ae6cea9336fc4ac18d6cdea4","observation_id":"294220bd-eeec-4020-97db-8db914d57acd","resolution":{"observed_at":"2026-07-10T21:57:36.492488Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.564550Z","title":null,"venue":null,"work_id":"8a4d1698-1448-4ad6-95f2-916468ac0c58","year":2011},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:3785a7204a99dce9453fde9c03f2f8e44b66765a0218739fc62ddfea84ee4d15","observation_id":"b3242d2a-429f-44e8-a7df-782d9a5e415c","resolution":{"observed_at":"2026-07-10T21:57:39.588066Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2508.07553","last_updated":"2025-08-11T02:26:29Z","snapshot_observed_at":"2026-08-07T00:02:35.053135Z","submitted_at":"2025-08-11T02:26:29Z","title":"Efficient adaptive randomized algorithms for fixed-threshold low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":"2508.07553","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.07553","snapshot_observed_at":"2026-07-10T21:57:37.084588Z","title":"Efficient adaptive randomized algorithms for fixed-threshold low-rank matrix approximation","venue":"math.NA","work_id":"e5b7b63c-5886-426f-888b-61dcb1aecc7c","year":2025},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"cited_paper":"/paper/2508.07553","citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:d545fd2b8479e19f531deedb1b7cb41fd522f42a5f67a72e04d997ddfedfffbd","observation_id":"bf2d620b-b6ee-4728-90cc-313db442793a","resolution":{"observed_at":"2026-07-10T21:57:37.107549Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.865182Z","title":"Martinsson , Compressing rank-structured matrices via randomized sampling , SIAM Journal on Scientific Computing, 38 (2016), pp","venue":null,"work_id":"ff762795-ccff-4ae8-b9b3-7e5ac0d64462","year":2016},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:c98fd2bac46f9d2eda5ec7e402ba06eceb9efa4197c809d932d24c1fedf1aad9","observation_id":"13c9786b-63ed-4a39-91ae-7d36d3108f70","resolution":{"observed_at":"2026-07-10T21:57:39.882272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.755754Z","title":"Martinsson, G","venue":null,"work_id":"b4f0f7f6-eedf-4c8e-b723-57009fa6fbd9","year":2019},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:4f5ad90a640ac30848a7aded2e51554d5d34ac5b4e3c2a3dcef35248416d1ea7","observation_id":"91ab4439-6dc1-4007-9319-724788a10c4e","resolution":{"observed_at":"2026-07-10T21:57:39.777181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.544156Z","title":"Martinsson, G","venue":null,"work_id":"df638552-87a9-49c4-a352-251988ca2555","year":2017},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:9d972694e38e310ad728d299b8a4b725886f14dc8afdad3adaa3b900eaa64083","observation_id":"388b04ea-1844-4ff9-a6a0-6781609e35a5","resolution":{"observed_at":"2026-07-10T21:57:39.562164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:40.184531Z","title":null,"venue":null,"work_id":"b2c288d5-59b4-4c85-87b2-8b399efad44d","year":2020},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:cc15442eb4d3974f7e1bd43cdfe1c05faba867f17197b8604471005296cb6581","observation_id":"4241bc28-ca8d-4e2e-a382-d7aa6c28c51f","resolution":{"observed_at":"2026-07-10T21:57:40.204837Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/15m1026080","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Martinsson and S","venue":"SIAM Journal on Scientific Computing","work_id":"102ee7eb-c72a-4934-9aa3-aae81be24294","year":2016},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:c4f18bae68f2b6be8f63e2e6dedfcd5c0158721c9be126d52885c26831418fab","observation_id":"7c6877f4-eb81-49fb-9d62-27e748b03d47","resolution":{"observed_at":"2026-07-10T21:57:36.402606Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.435788Z","title":"Meier and Y","venue":null,"work_id":"aa6fa3f3-8265-4500-8936-97599b43aec5","year":2024},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:cf78781eb41b17f83740d8cf57cbdbc313de7ae278161848d6e5e8f64d1b936b","observation_id":"741a8175-abdd-47d6-863c-1905b86ba976","resolution":{"observed_at":"2026-07-10T21:57:39.453368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2009.11392","last_updated":"2020-09-23T21:40:36Z","snapshot_observed_at":"2026-08-02T17:18:52.409029Z","submitted_at":"2020-09-23T21:40:36Z","title":"Fast and stable randomized low-rank matrix approximation","version":1},"cited_work":{"arxiv_id":"2009.11392","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.11392","snapshot_observed_at":"2026-07-10T21:57:37.053200Z","title":"Nakatsukasa , Fast and stable randomized low-rank matrix approximation , arXiv:2009.11392 [math.NA], (2020)","venue":"math.NA","work_id":"235783de-829b-4d0e-b18d-5a0048c07467","year":2020},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"cited_paper":"/paper/2009.11392","citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:c815a2933b821a17f650e256e427a8398ee9e3e2242f25eed00029d6c478a8f0","observation_id":"8de78da6-13d4-474e-ae7c-4ed4b32c29f0","resolution":{"observed_at":"2026-07-10T21:57:37.079677Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.914246Z","title":null,"venue":null,"work_id":"c139feb2-3418-4246-9f6e-5171da12c5ef","year":1971},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:a6aabc0f739d87c42b95e9a879901e01d69180c22a452e7fad4597ea531f9928","observation_id":"2ae2076f-a8f8-49f5-b6c7-cd6574a64d5e","resolution":{"observed_at":"2026-07-10T21:57:39.942857Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:40.240972Z","title":"Pearce, C","venue":null,"work_id":"04557ba5-42eb-4a61-a1b2-b493ca13b348","year":2025},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:fb6449076186ae9166bc53f4805a31b2ef70bad3749cf96febde7f71bf07944a","observation_id":"8147bc6f-d6da-4e88-a802-00336bc89199","resolution":{"observed_at":"2026-07-10T21:57:40.275166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":"2512.05286","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:37.014163Z","title":null,"venue":null,"work_id":"11dbbaae-ea44-4d1e-99c0-31cbbed0b2d5","year":2025},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:339fc997451287c17a231c16a00943092104adeb99cbff59e9937fe7103168b2","observation_id":"4d4451b1-fe79-4474-a34e-ee35dec0c60f","resolution":{"observed_at":"2026-07-10T21:57:37.044095Z","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":null,"cited_work":{"arxiv_id":"2405.04811","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:36.976327Z","title":"arXiv preprint arXiv:2405.04811 , year=","venue":null,"work_id":"7316d561-eed9-4dec-b760-e479ea37e88a","year":2024},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:a54eb82f8b1e8da9f6918b70165e3e4110a3c5210fb22800c2b3b090f85dcaa1","observation_id":"042651c2-73ce-4f4a-b037-f5ba30aff294","resolution":{"observed_at":"2026-07-10T21:57:37.006629Z","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":null,"cited_work":{"arxiv_id":"2509.21963","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:36.924594Z","title":"Pritchard, T","venue":null,"work_id":"09b37341-1d9b-4f31-ac57-52768cefd5c8","year":2025},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:a1aa8f7646940d8a1e0a3d1b3491f78b73be5fee69493e33b90611f68ca8e674","observation_id":"53258d0e-a3be-4cbf-b0d7-6236f670e503","resolution":{"observed_at":"2026-07-10T21:57:36.940989Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:40.103637Z","title":"Saad, Numerical Methods for Large Eigenvalue Problems , SIAM, 2011","venue":null,"work_id":"3f5dfb70-037b-40a3-a654-fb57aaad4043","year":2011},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:0e92483e3eef0d73d4238275dc18918e83f10ba4205df2527ee77ca423700232","observation_id":"1155e7d6-8d58-49d4-a453-4c530e534bae","resolution":{"observed_at":"2026-07-10T21:57:40.121618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.499763Z","title":null,"venue":null,"work_id":"71ade3e1-2cb6-4f0f-ad2f-e88e7e2f1dec","year":2019},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:1bff0370f2002144c405d4eaeebf0f234e3153258930e563d51f04f24c9d1d69","observation_id":"acc4270c-5e54-4c1b-9d73-39fec2947a73","resolution":{"observed_at":"2026-07-10T21:57:39.515613Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:40.084996Z","title":"Vannieuwenhoven, R","venue":null,"work_id":"7888ecd9-306b-4ff2-9c72-321b55e186f5","year":2012},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:7b6c63cc01b5dc97cac5eb6a5e8113d90e44c51b83e2452c368faba6cf08a0cc","observation_id":"ca436e11-b33f-42f2-8b98-9a7ff0d12ea6","resolution":{"observed_at":"2026-07-10T21:57:40.101170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:39.451831Z","title":"Xia, Randomized sparse direct solvers, SIAM Journal on Matrix Analysis and Applications, 34 (2013), pp","venue":null,"work_id":"77da8021-d1ed-40ae-b88a-cd99889f1420","year":2013},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:342333e53fa54d4558bdfa3376120815d20873638e969e1d3c851739ab939c7e","observation_id":"875a93d4-9a5f-4a9b-9e10-6a2ba193fce4","resolution":{"observed_at":"2026-07-10T21:57:39.477686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2506.22713","last_updated":"2025-06-28T01:48:42Z","snapshot_observed_at":"2026-08-07T09:40:32.721282Z","submitted_at":"2025-06-28T01:48:42Z","title":"A Novel Adaptive Low-Rank Matrix Approximation Method for Image Compression and Reconstruction","version":1},"cited_work":{"arxiv_id":"2506.22713","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.22713","snapshot_observed_at":"2026-07-10T21:57:36.945091Z","title":"A Novel Adaptive Low-Rank Matrix Approximation Method for Image Compression and Reconstruction","venue":"math.NA","work_id":"522ea629-dba6-4dec-beae-0cf52cdd4a94","year":2025},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"cited_paper":"/paper/2506.22713","citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:aef356e62029c36e46c4636084b235f6be28b5929b7fae1f3a8c04990e4e80a7","observation_id":"24539009-96bc-4479-b01f-6f1286ee3543","resolution":{"observed_at":"2026-07-10T21:57:36.968039Z","resolver_source":"local_arxiv","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T21:57:40.062729Z","title":"Yesypenko and P.-G","venue":null,"work_id":"1b0f09ca-3480-4b01-b549-92b3541a6f8e","year":2026},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:c9e3080142844798f9fb219544e585e45927903db41bdb3238bb4d780f8b2f65","observation_id":"bd5550a0-82d9-4a9a-9890-693ac4fde002","resolution":{"observed_at":"2026-07-10T21:57:40.082399Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/17m1141977","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"SIAM Journal on Matrix Analysis and Applications","work_id":"680e7c9a-bb9b-49d0-8c1c-bf92e71baee1","year":2018},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:98dc9c1180f1775390510d893f20754991ee395610e6b7522716e095355962c5","observation_id":"cdde334c-02fa-4e2c-9396-69fbcc55d3a4","resolution":{"observed_at":"2026-07-10T21:57:36.429283Z","resolver_source":"doi","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"}}],"paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":1,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":10,"verified_exact":11,"verified_fuzzy":24},"total_outbound_references":47},"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 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2607.06758."}