{"as_of":"2026-08-21T09:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0cb13dbcea0d53a0672c8caae04a7661a41bc0004d2bf52c9a0e7afc95846379","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-21T06:32:19.484+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-10T19:54:41.725095Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-04T23:06:05.969063Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1911.02675","last_updated":"2021-04-13T20:57:19Z","snapshot_observed_at":"2026-08-13T02:51:39.310444Z","submitted_at":"2019-11-06T23:29:54Z","title":"Faster Least Squares Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.02675","snapshot_observed_at":"2026-08-10T19:54:41.725095Z","title":"Lacotte and M","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2501.09734","last_updated":"2025-01-16T18:37:59Z","snapshot_observed_at":"2026-08-19T16:41:27.122970Z","submitted_at":"2025-01-16T18:37:59Z","title":"Random Subspace Cubic-Regularization Methods, with Applications to Low-Rank Functions","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T19:54:41.725095Z"},"links":{"cited_paper":"/paper/1911.02675","citing_paper":"/paper/2501.09734"},"observation_digest":"sha256:b400d63dab255d8db070b87d4e8b18de972d25f5375cb8e3166988131838eb0b","observation_id":"7f9fcb69-3440-47a6-a46b-f8fd543cd49e","resolution":{"observed_at":"2026-08-10T19:54:41.725095Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.02675","last_updated":"2021-04-13T20:57:19Z","snapshot_observed_at":"2026-08-13T02:51:39.310444Z","submitted_at":"2019-11-06T23:29:54Z","title":"Faster Least Squares Optimization","version":3},"cited_work":{"arxiv_id":"1911.02675","doi":null,"metadata_source":"pith","pith_arxiv_id":"1911.02675","snapshot_observed_at":"2026-08-04T23:06:05.969063Z","title":"Faster Least Squares Optimization","venue":"math.NA","work_id":"660bb8ea-21bc-4dbe-8ea2-93e4d79d0ce4","year":2019},"citing_paper":{"arxiv_id":"2509.06856","last_updated":"2026-05-29T13:16:50Z","snapshot_observed_at":"2026-08-04T23:05:57.028256Z","submitted_at":"2025-09-08T16:23:58Z","title":"Sequential Least-Squares Estimators with Fast Randomized Sketching for Linear Statistical Models","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T23:06:05.787690Z"},"links":{"cited_paper":"/paper/1911.02675","citing_paper":"/paper/2509.06856"},"observation_digest":"sha256:ce445fcfdcb18b2c6cb197e12a44976595f13a48d29a44019e90367e2af79e17","observation_id":"5dd0be6c-cbdf-4319-9e5b-f9ce80feb59a","resolution":{"observed_at":"2026-08-04T23:06:05.978419Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.02675","last_updated":"2021-04-13T20:57:19Z","snapshot_observed_at":"2026-08-13T02:51:39.310444Z","submitted_at":"2019-11-06T23:29:54Z","title":"Faster Least Squares Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.02675","snapshot_observed_at":"2026-08-02T00:50:35.650293Z","title":"arXiv preprint arXiv:1911.02675 , year=","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2607.14894","last_updated":"2026-07-16T12:11:06Z","snapshot_observed_at":"2026-08-18T00:09:26.004912Z","submitted_at":"2026-07-16T12:11:06Z","title":"Domain Adaptation of Mismatched Proximal Denoiser for Plug-and-Play Image Reconstruction","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-02T00:50:35.650293Z"},"links":{"cited_paper":"/paper/1911.02675","citing_paper":"/paper/2607.14894"},"observation_digest":"sha256:3183e2d6e6fd5c7300ed4fefb7cd251908ce57a3a58b9e94b83e985511362b98","observation_id":"c7eeae9a-9b28-4a0f-817d-b32ee7a7da3b","resolution":{"observed_at":"2026-08-02T00:50:35.650293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1911.02675/citation-record","integrity":"/paper/1911.02675/integrity","json":"/paper/1911.02675/citation-record.json","paper":"/paper/1911.02675"},"outbound":[],"paper":{"arxiv_id":"1911.02675","last_updated":"2021-04-13T20:57:19Z","latest_version":3,"primary_category":"math.NA","snapshot_observed_at":"2026-08-13T02:51:39.310444Z","submitted_at":"2019-11-06T23:29:54Z","title":"Faster Least Squares Optimization"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1911.02675."}