{"as_of":"2026-08-10T11:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b477a594836dc1cdd068774d93cbd11e408caf34885819d1d67901d45f6acd43","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-10T06:31:04.303077+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-06T17:14:09.374465Z","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-11T07:35:57.140507Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.11673","last_updated":"2025-07-29T01:40:18Z","snapshot_observed_at":"2026-07-06T20:23:31.551214Z","submitted_at":"2025-01-20T18:55:51Z","title":"Randomized Kaczmarz Methods with Beyond-Krylov Convergence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.11673","snapshot_observed_at":"2026-08-06T17:14:09.374465Z","title":"Randomized kaczmarz methods with beyond-krylov convergence","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.11724","last_updated":"2025-07-15T20:48:30Z","snapshot_observed_at":"2026-08-09T08:05:37.794204Z","submitted_at":"2025-07-15T20:48:30Z","title":"Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T17:14:09.374465Z"},"links":{"cited_paper":"/paper/2501.11673","citing_paper":"/paper/2507.11724"},"observation_digest":"sha256:1f3c3629712947ae1423d0ca83fd708dba6312ea6c4b1c62a915eefd165abcd5","observation_id":"0253e6df-d79a-4172-b0a0-81aea3809f53","resolution":{"observed_at":"2026-08-06T17:14:09.374465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.11673","last_updated":"2025-07-29T01:40:18Z","snapshot_observed_at":"2026-07-06T20:23:31.551214Z","submitted_at":"2025-01-20T18:55:51Z","title":"Randomized Kaczmarz Methods with Beyond-Krylov Convergence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.11673","snapshot_observed_at":"2026-08-05T14:49:00.238671Z","title":"Randomized K aczmarz methods with beyond- K rylov convergence","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21022","last_updated":"2026-06-08T19:22:55Z","snapshot_observed_at":"2026-08-05T14:48:57.900801Z","submitted_at":"2025-08-28T17:24:59Z","title":"A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T14:49:00.238671Z"},"links":{"cited_paper":"/paper/2501.11673","citing_paper":"/paper/2508.21022"},"observation_digest":"sha256:54b10e4bf89877fa398a0f270f8561a9b49b258184f31ba111fbcaefa57f09f8","observation_id":"91546ce5-0fef-46f0-9642-ad475273b6c7","resolution":{"observed_at":"2026-08-05T14:49:00.238671Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.11673","last_updated":"2025-07-29T01:40:18Z","snapshot_observed_at":"2026-07-06T20:23:31.551214Z","submitted_at":"2025-01-20T18:55:51Z","title":"Randomized Kaczmarz Methods with Beyond-Krylov Convergence","version":2},"cited_work":{"arxiv_id":"2501.11673","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.11673","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv:2501.11673 (2025)","venue":null,"work_id":"26c6c328-deff-44ea-81fa-82cbdffa19b2","year":2025},"citing_paper":{"arxiv_id":"2604.09964","last_updated":"2026-04-11T00:18:20Z","snapshot_observed_at":"2026-07-06T22:58:43.155246Z","submitted_at":"2026-04-11T00:18:20Z","title":"From Recency Bias to Stable Convergence Block Kaczmarz Methods for Online Preference Learning in Matchmaking Applications","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T17:07:35.142351Z"},"links":{"cited_paper":"/paper/2501.11673","citing_paper":"/paper/2604.09964"},"observation_digest":"sha256:76e7b5e730db39e7ca3a29921dbca62d4ce5dae8725b0b17e86d75a1440470cb","observation_id":"21efe7cb-f4af-475b-9cac-bc243d457e4f","resolution":{"observed_at":"2026-05-11T07:35:57.145008Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.11673/citation-record","integrity":"/paper/2501.11673/integrity","json":"/paper/2501.11673/citation-record.json","paper":"/paper/2501.11673"},"outbound":[],"paper":{"arxiv_id":"2501.11673","last_updated":"2025-07-29T01:40:18Z","latest_version":2,"primary_category":"math.NA","snapshot_observed_at":"2026-07-06T20:23:31.551214Z","submitted_at":"2025-01-20T18:55:51Z","title":"Randomized Kaczmarz Methods with Beyond-Krylov Convergence"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2501.11673."}