{"as_of":"2026-08-08T10:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:03ee202cb8862224a8bd551ca2a8f5661f72cfa54af3d4221fef71c6757c98f9","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:14:28.105509Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T11:46:33.807355Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.03468","last_updated":"2025-08-20T16:25:38Z","snapshot_observed_at":"2026-07-06T18:26:01.717861Z","submitted_at":"2024-06-05T17:21:25Z","title":"Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03468","snapshot_observed_at":"2026-08-07T11:14:28.105509Z","title":"Fast and Forward Stable Randomized Algorithms for Linear Least-Squares Problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03070","last_updated":"2025-06-06T14:27:31Z","snapshot_observed_at":"2026-08-07T11:06:57.087982Z","submitted_at":"2025-06-03T16:48:06Z","title":"GPU-Parallelizable Randomized Sketch-and-Precondition for Linear Regression using Sparse Sign Sketches","version":2},"reference_index":161,"source":"pdf_text","source_observed_at":"2026-08-07T11:14:28.105509Z"},"links":{"cited_paper":"/paper/2406.03468","citing_paper":"/paper/2506.03070"},"observation_digest":"sha256:5632f9039e23178717d6766a6522476330ac0ae6c30ca73a819f57b95bab8102","observation_id":"1724349d-5035-41d2-b3af-83c298416e78","resolution":{"observed_at":"2026-08-07T11:14:28.105509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03468","last_updated":"2025-08-20T16:25:38Z","snapshot_observed_at":"2026-07-06T18:26:01.717861Z","submitted_at":"2024-06-05T17:21:25Z","title":"Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.03468","snapshot_observed_at":"2026-08-05T14:36:51.219594Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21189","last_updated":"2025-08-28T20:02:15Z","snapshot_observed_at":"2026-08-08T05:34:04.476252Z","submitted_at":"2025-08-28T20:02:15Z","title":"Faster Linear Algebra Algorithms with Structured Random Matrices","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T14:36:51.219594Z"},"links":{"cited_paper":"/paper/2406.03468","citing_paper":"/paper/2508.21189"},"observation_digest":"sha256:f1bb45e1ab76d76d77ce66cc4e48213dae10655979cc0fcbe0b6b2bf31046455","observation_id":"fefbc5b8-c255-45bd-b61b-c1b34584f2a9","resolution":{"observed_at":"2026-08-05T14:36:51.219594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03468","last_updated":"2025-08-20T16:25:38Z","snapshot_observed_at":"2026-07-06T18:26:01.717861Z","submitted_at":"2024-06-05T17:21:25Z","title":"Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers","version":3},"cited_work":{"arxiv_id":"2406.03468","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.03468","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b1d6fa41-0c63-45a8-931e-d0ec1c14e9ea","year":null},"citing_paper":{"arxiv_id":"2604.13830","last_updated":"2026-04-15T13:05:28Z","snapshot_observed_at":"2026-07-06T23:01:46.092000Z","submitted_at":"2026-04-15T13:05:28Z","title":"Randomized Neural Networks for Integro-Differential Equations with Application to Neutron Transport","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T12:35:52.104907Z"},"links":{"cited_paper":"/paper/2406.03468","citing_paper":"/paper/2604.13830"},"observation_digest":"sha256:fca080bd01c8e3ac2c2cb0f1fb8b8887ea47674dc86678230db7b6721e967c52","observation_id":"31b6bd74-3450-4889-af16-ddf6cee445c2","resolution":{"observed_at":"2026-05-11T11:46:33.819386Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.03468/citation-record","integrity":"/paper/2406.03468/integrity","json":"/paper/2406.03468/citation-record.json","paper":"/paper/2406.03468"},"outbound":[],"paper":{"arxiv_id":"2406.03468","last_updated":"2025-08-20T16:25:38Z","latest_version":3,"primary_category":"math.NA","snapshot_observed_at":"2026-07-06T18:26:01.717861Z","submitted_at":"2024-06-05T17:21:25Z","title":"Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2406.03468."}