{"as_of":"2026-08-08T08:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7c95c5a752275875ed5b53457835d7fefae83cfbf0b0ec05c910c8152a8613ed","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:00:07.524724Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.03859/citation-record","integrity":"/paper/2506.03859/integrity","json":"/paper/2506.03859/citation-record.json","paper":"/paper/2506.03859"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.874902Z","title":null,"venue":null,"work_id":"b44b1f1f-cc86-4a09-aa7e-7af61b46ee81","year":2010},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.415808Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:661600a1314c12a626f8db7f77337ee1c9caddd8864342019aff55d0e598e40a","observation_id":"b9191707-c4d5-41d4-b8d1-890535f2c7c4","resolution":{"observed_at":"2026-08-07T11:00:07.878281Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.864958Z","title":"In: Proc","venue":null,"work_id":"1eee8293-eaf8-41bb-9c58-cd7534a5d0af","year":2017},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.419719Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:72b12e0449b1a96586bd92092398edbddf5888e9a14d36540341d874d6133e8b","observation_id":"ec111468-ee33-4257-8199-e5ecd59c797f","resolution":{"observed_at":"2026-08-07T11:00:07.868807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.854941Z","title":"SIAM (2010)","venue":null,"work_id":"466eeb66-fa72-426e-b3ce-bd98821cae55","year":2010},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.423551Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:3bb9b105df2f23640d630c2e1fa7ddb9f18e9480ab50ffae96b2293c75dbc965","observation_id":"0ec7c458-f925-4a0e-b9b8-b2600a396773","resolution":{"observed_at":"2026-08-07T11:00:07.858185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.844772Z","title":"John Wiley & S ons (2017)","venue":null,"work_id":"f3d34476-57df-426c-b72a-d5c3542fcf4c","year":2017},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.428290Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:d5f640aa0bccd89928f944b7b65b9f7becce9f41c0f2282f0496efa1a4dd1f0c","observation_id":"ffc7e0b9-27bc-458a-9b29-e669b1a54bf2","resolution":{"observed_at":"2026-08-07T11:00:07.848651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.834246Z","title":null,"venue":null,"work_id":"7dde2b52-8ec9-4df0-ae9a-3aab72f53c55","year":2012},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.432194Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:072898c76a00b06f97b5727bfbfd3f6475a58e0add60b927ba1a49c7355296ac","observation_id":"d0c277f8-5361-4970-9e81-c523d2a00243","resolution":{"observed_at":"2026-08-07T11:00:07.838105Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.823781Z","title":"Linear Al gebra Appl","venue":null,"work_id":"2935b953-200b-4863-8959-9ecb622457ea","year":1987},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.435550Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:d9b85a93c75eb2c25b13075bed8a64290d94958804c004555234224fb38a4a01","observation_id":"8e2d7d3e-360e-41a6-b05a-33b24013873c","resolution":{"observed_at":"2026-08-07T11:00:07.827943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.813474Z","title":"In: Proc","venue":null,"work_id":"81caebfb-1264-4698-bff2-ad682ce396b4","year":2009},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.439580Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:8c42f45ac2849a42488aeecfb44f0ce2c24acbce12f3e8be5fb482fbd7426033","observation_id":"b98c210d-5c6e-4cc3-b46d-51e31bf66ae2","resolution":{"observed_at":"2026-08-07T11:00:07.816983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.802779Z","title":null,"venue":null,"work_id":"1e18a5ea-5abd-481b-a1a7-76e41cbf09c3","year":2019},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.443118Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:d1993c0fc94f2494e030849568c088b9097576b7758bd50b6fbdb3f10db9ec29","observation_id":"22e6d4e2-f447-47ca-b168-1e93bd0bc8f7","resolution":{"observed_at":"2026-08-07T11:00:07.806401Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.791230Z","title":"In: Proc","venue":null,"work_id":"7c1e6cee-e157-4c77-8eec-fdeba4a36085","year":2023},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.447875Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:54b730a02203ee3759135a40bce6f4d466a1266a2bc46e37b43347d5ddcdd305","observation_id":"57d72da1-c05e-470a-a8a8-d7f868212aea","resolution":{"observed_at":"2026-08-07T11:00:07.795148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.780811Z","title":"JHU p ress (2013)","venue":null,"work_id":"db2dd8cc-6907-42bf-ae88-c5f5e08eec13","year":2013},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.451476Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:aae58ed092cb9f4ad83ee10046753979d194f6a2cd6e944d01b60f7232199040","observation_id":"efe69079-fd81-4d05-abde-e2dd9316953e","resolution":{"observed_at":"2026-08-07T11:00:07.784263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.770160Z","title":null,"venue":null,"work_id":"113980d8-7341-4b0c-ae3f-7f78d52aadea","year":2015},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.455543Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:be00bafdb1ff72fb92d17a1592a2d670f5d9e4372c5ae90b9b4bfcb1937b3808","observation_id":"06dfaeb1-5aa9-459a-af97-cae44edac95c","resolution":{"observed_at":"2026-08-07T11:00:07.773705Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.759615Z","title":null,"venue":null,"work_id":"94719673-9c13-44c8-aa38-cadfe9ea1bbc","year":1996},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.459036Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:bf6bad1abbaa82e7f25abb1365f240cc57b91f08f7d7a495178c802889631482","observation_id":"9b8e1dbe-e4ff-46b5-b401-cce0815b89b1","resolution":{"observed_at":"2026-08-07T11:00:07.762949Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.748621Z","title":"SIAM Rev","venue":null,"work_id":"9a4257f8-e597-4891-9b45-7c7db0e238b0","year":2011},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.462464Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:468a0c04f818a33e84d8d5ade632e0c0b619a5e274ad7aa44fd48221d3668cf1","observation_id":"b2222b6f-c57a-4704-9338-2149d1ab9812","resolution":{"observed_at":"2026-08-07T11:00:07.752958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.738421Z","title":null,"venue":null,"work_id":"0b7c8749-0105-45a5-a719-9a608b6e9033","year":2022},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.465651Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:136226e2ce86e11df0a289a5828effa763df41c6034c04bc4daec9bcd597d674","observation_id":"56e128fc-5e2c-42d0-be89-97e891d78c18","resolution":{"observed_at":"2026-08-07T11:00:07.741799Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.13726","last_updated":"2025-05-17T13:11:41Z","snapshot_observed_at":"2026-08-05T04:49:00.985346Z","submitted_at":"2020-09-29T02:05:06Z","title":"Rank of Sparse Bernoulli Matrices","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.13726","snapshot_observed_at":"2026-08-07T11:00:07.468857Z","title":"arXiv pre print arXiv:2009.13726 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.468857Z"},"links":{"cited_paper":"/paper/2009.13726","citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:33611bd19f532a11a058f3ff340d5712c02c815df03c6427fee5ceb0a7c91dc6","observation_id":"92db3906-1171-4715-8edb-0381b0c9d4b6","resolution":{"observed_at":"2026-08-07T11:00:07.468857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.727600Z","title":null,"venue":null,"work_id":"9fc13ae8-57d2-4f19-b3cb-7005c4e1ff33","year":2018},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.472531Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:8cf36cfe79956ce43125c76f808ae8e2e1667ee0efc0e962b3a6320b46c50847","observation_id":"81a631b6-cc82-408b-ac86-2f596e7d40fd","resolution":{"observed_at":"2026-08-07T11:00:07.731577Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.716421Z","title":"IEEE Trans","venue":null,"work_id":"4e0633f8-dc17-4da1-8ff5-7e0e3529ad0b","year":2018},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.475759Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:110c0ee5fd849aed049ce7a4ec2ddf52db5a2564db7992728b1400c2f1e8415b","observation_id":"7e0bfd2f-6b09-4e00-a1a5-eb5cac3b3454","resolution":{"observed_at":"2026-08-07T11:00:07.720692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.705480Z","title":"In: Proc","venue":null,"work_id":"d2528a5e-f058-4c64-b5e9-87ef8b39f24d","year":2006},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.478921Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:fb2c0f4277a8ae15d9a14c6cedccc8033528752e38c9289c920a1d60346238dc","observation_id":"176240d4-06a0-46d5-a56b-2c3b4bbf11c6","resolution":{"observed_at":"2026-08-07T11:00:07.709255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.694457Z","title":", Tygert, M.: Randomized algorithms for the low-rank approximation of ma trices","venue":null,"work_id":"c4e83253-acac-4333-8247-1d182b6b55c2","year":2007},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.482253Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:381daddfe1df6d47c50774e3aee4797a0e80c26d3fccad3a2b7795d9b2fcf610","observation_id":"01ef4d9b-7a16-47dc-89ab-b9b1f67e8dd8","resolution":{"observed_at":"2026-08-07T11:00:07.698616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.683511Z","title":null,"venue":null,"work_id":"27525bdc-82ef-4b4f-aa50-c7738d959463","year":2009},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.485340Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:ec44b33331329cc4e719635ced95ab3f2e2f4f6cb11884ca72b21c1e935743ff","observation_id":"891d237a-933a-438e-adec-8477801264ca","resolution":{"observed_at":"2026-08-07T11:00:07.687292Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.672808Z","title":"Acta Numer","venue":null,"work_id":"9f3c2e6f-27a8-4ab8-9ba4-55bb5b501527","year":2020},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.488864Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:4e16b448a884c613af0484fc59da4a6fbd4eb0fa6825a97e1822f464ca35dc95","observation_id":"b50324b3-9a24-4569-a2b7-305884d47c09","resolution":{"observed_at":"2026-08-07T11:00:07.676502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.660639Z","title":null,"venue":null,"work_id":"cb52f71e-8ad4-4901-a8d7-58a9a68d57ab","year":2016},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.492128Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:3cf72ac9ce402c1724f26b5646e549290092bdcf7e1bc8a198c1c322dd4153a8","observation_id":"ad6898f4-5114-47b6-bac1-cbf6b2c39920","resolution":{"observed_at":"2026-08-07T11:00:07.664836Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.650018Z","title":null,"venue":null,"work_id":"20dab6fe-1c44-4ead-90c1-59f3d406c77f","year":2010},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.495489Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:08efb9e21b787c898c3020543debca39845bb274dc6c145d1a8ff8af9f12f963","observation_id":"e8975085-58af-44e9-bd2d-7228a8321243","resolution":{"observed_at":"2026-08-07T11:00:07.653603Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.639401Z","title":null,"venue":null,"work_id":"3017e988-7e0c-468b-a266-830fba9d7130","year":2017},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.499132Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:ce764053d4c70d1e4fd10d6abb20b7ce7754beaba73ed42f3e8473f2f8ce250a","observation_id":"bae1001e-da1f-4c32-ac3a-036c17c96f28","resolution":{"observed_at":"2026-08-07T11:00:07.642988Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.627554Z","title":null,"venue":null,"work_id":"fe619501-90de-4d94-82f6-dae6f002afae","year":2019},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.502592Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:07ec734299ef9fc82204e1c693f0c2d70837d4e3fe70b0ed3f34ac05f1e32ea7","observation_id":"9d667f09-2260-4708-a4ce-2486e84b7990","resolution":{"observed_at":"2026-08-07T11:00:07.631177Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.615957Z","title":null,"venue":null,"work_id":"193f96a1-2913-43d5-bdc0-b54e786c0fff","year":2019},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.505934Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:02180d280abdb16772ef26f94a496a89e425f532421f7d0e22e0067f992a0ecd","observation_id":"84e27514-85ee-4634-912f-7c9a09043185","resolution":{"observed_at":"2026-08-07T11:00:07.619938Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.605296Z","title":null,"venue":null,"work_id":"79429c78-0888-4b4a-83ac-a4660be5947d","year":2008},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.509423Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:dce6b8cb93b70e6e8769df87fc5cec55770a9f5305fb53860b5f8e6a81e55232","observation_id":"a34c0048-0eee-493c-b130-243a5022659a","resolution":{"observed_at":"2026-08-07T11:00:07.608876Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.594150Z","title":"I EEE Trans","venue":null,"work_id":"038ab3b8-0d63-40c3-a9e2-2f7fc0d86364","year":2023},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.512892Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:ce73d9b241d4817969cef9469829fede894fe9ad99848d83982498011eb454bc","observation_id":"031a1a55-1f33-46dc-9798-74d46b99e353","resolution":{"observed_at":"2026-08-07T11:00:07.597988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.582629Z","title":null,"venue":null,"work_id":"1712f9ba-b61d-4cda-81c1-db2effd4dc4f","year":2023},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.516573Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:b11af1c2a7d20977131081ca730b17d86e0c52b9a62784e957e958497c25e3fd","observation_id":"b30a59a6-15c9-43ac-be7d-2a57677497aa","resolution":{"observed_at":"2026-08-07T11:00:07.586724Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:00:07.570740Z","title":null,"venue":null,"work_id":"545736fd-3044-45fd-883c-218b610e40dc","year":2018},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.520347Z"},"links":{"citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:418e2be46a61f1116d6abbb684aaaaf157a3afc400d93eeb5f80db126e42b12a","observation_id":"7acb8d1b-919a-4eef-bffd-7d0c38e343a7","resolution":{"observed_at":"2026-08-07T11:00:07.575238Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.00712","last_updated":"2021-03-10T01:30:22Z","snapshot_observed_at":"2026-07-06T10:00:42.122451Z","submitted_at":"2020-10-01T22:41:41Z","title":"Faster Binary Embeddings for Preserving Euclidean Distances","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.00712","snapshot_observed_at":"2026-08-07T11:00:07.524724Z","title":"arXiv preprint arXiv:2010.00712 (2020) 31","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T11:00:07.524724Z"},"links":{"cited_paper":"/paper/2010.00712","citing_paper":"/paper/2506.03859"},"observation_digest":"sha256:5f85315eaf3a21b852e5fba7f0b52ddc83baf686d1378d2b049c907c659acdc5","observation_id":"2c3433e2-c8a8-43ef-84ff-33782e420412","resolution":{"observed_at":"2026-08-07T11:00:07.524724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.03859","last_updated":"2025-06-04T11:46:45Z","latest_version":1,"primary_category":"stat.CO","snapshot_observed_at":"2026-08-07T10:51:18.419895Z","submitted_at":"2025-06-04T11:46:45Z","title":"Accelerating Randomized Algorithms for Low-Rank Matrix Approximation"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":0,"verified_fuzzy":13},"total_outbound_references":31},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2506.03859."}