{"as_of":"2026-08-16T13:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b7d922f42ae2b18db469b7e228d04de5f04addc53c0aad380f1221d5716b50a5","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:38:11.306750Z","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-14T14:38:11.342841Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1706.00241","last_updated":"2017-06-01T10:17:12Z","snapshot_observed_at":"2026-08-16T07:14:23.015244Z","submitted_at":"2017-06-01T10:17:12Z","title":"Krylov Subspace Recycling for Fast Iterative Least-Squares in Machine Learning","version":1},"cited_work":{"arxiv_id":"1706.00241","doi":null,"metadata_source":"pith","pith_arxiv_id":"1706.00241","snapshot_observed_at":"2026-08-14T14:38:11.342841Z","title":"Krylov Subspace Recycling for Fast Iterative Least-Squares in Machine Learning","venue":"cs.LG","work_id":"51abe098-a428-4555-a467-a82c84592277","year":2017},"citing_paper":{"arxiv_id":"1908.02964","last_updated":"2019-08-08T08:13:13Z","snapshot_observed_at":"2026-08-16T04:45:39.238884Z","submitted_at":"2019-08-08T08:13:13Z","title":"Contributed Discussion of \"A Bayesian Conjugate Gradient Method\"","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:38:11.306750Z"},"links":{"cited_paper":"/paper/1706.00241","citing_paper":"/paper/1908.02964"},"observation_digest":"sha256:6f2bf103d78d73fc936f7e0af1a64cccc34a76e4780537efa9cb5fdca36d662c","observation_id":"9d7f54c5-f978-4c29-8f07-92c9833a3de1","resolution":{"observed_at":"2026-08-14T14:38:11.348239Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1706.00241/citation-record","integrity":"/paper/1706.00241/integrity","json":"/paper/1706.00241/citation-record.json","paper":"/paper/1706.00241"},"outbound":[],"paper":{"arxiv_id":"1706.00241","last_updated":"2017-06-01T10:17:12Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T07:14:23.015244Z","submitted_at":"2017-06-01T10:17:12Z","title":"Krylov Subspace Recycling for Fast Iterative Least-Squares in Machine Learning"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1706.00241."}