{"as_of":"2026-08-09T21:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d6ab272276ab75dd24e5df9e51e50b87cf4ab5d23b7c6f7ec8cd14ce3c61f285","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T11:20:55.784147Z","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-05-21T10:30:58.809818Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1510.08896","last_updated":"2016-05-30T02:40:00Z","snapshot_observed_at":"2026-07-06T04:34:46.092658Z","submitted_at":"2015-10-29T20:47:27Z","title":"Robust Shift-and-Invert Preconditioning: Faster and More Sample Efficient Algorithms for Eigenvector Computation","version":2},"cited_work":{"arxiv_id":"1510.08896","doi":null,"metadata_source":"pith","pith_arxiv_id":"1510.08896","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Robust Shift-and-Invert Preconditioning: Faster and More Sample Efficient Algorithms for Eigenvector Computation","venue":"cs.DS","work_id":"015d28f8-9c5d-4b44-9051-32b0eeb351bc","year":2015},"citing_paper":{"arxiv_id":"2003.00295","last_updated":"2021-09-08T23:37:17Z","snapshot_observed_at":"2026-07-06T09:01:12.515300Z","submitted_at":"2020-02-29T16:37:29Z","title":"Adaptive Federated Optimization","version":5},"reference_index":159,"source":"arxiv_source","source_observed_at":"2026-05-21T10:30:58.601351Z"},"links":{"cited_paper":"/paper/1510.08896","citing_paper":"/paper/2003.00295"},"observation_digest":"sha256:51992a094691aaa7e277c101f5e2e0f098dee4bd6a3406ff2ef5b4e9797558e1","observation_id":"ba4aec3e-5799-4148-8293-ac628a3c174d","resolution":{"observed_at":"2026-05-21T10:30:58.811622Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1510.08896","last_updated":"2016-05-30T02:40:00Z","snapshot_observed_at":"2026-07-06T04:34:46.092658Z","submitted_at":"2015-10-29T20:47:27Z","title":"Robust Shift-and-Invert Preconditioning: Faster and More Sample Efficient Algorithms for Eigenvector Computation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.08896","snapshot_observed_at":"2026-08-08T11:20:55.784147Z","title":"Robust shift-and-invert preconditioning: Faster and more sample efficient algorithms for eigenvector computation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.07993","last_updated":"2025-05-22T14:51:54Z","snapshot_observed_at":"2026-08-08T11:10:25.360168Z","submitted_at":"2025-02-11T22:19:56Z","title":"What is a Sketch-and-Precondition Derivation for Low-Rank Approximation? Inverse Power Error or Inverse Power Estimation?","version":2},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-08T11:20:55.784147Z"},"links":{"cited_paper":"/paper/1510.08896","citing_paper":"/paper/2502.07993"},"observation_digest":"sha256:18071a02df7eadf72a0f0a6d9a3a87ed656bc315d2beb56dac67ae3183370132","observation_id":"a2a6286e-3880-45cb-a2c0-8ebe708981e9","resolution":{"observed_at":"2026-08-08T11:20:55.784147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1510.08896/citation-record","integrity":"/paper/1510.08896/integrity","json":"/paper/1510.08896/citation-record.json","paper":"/paper/1510.08896"},"outbound":[],"paper":{"arxiv_id":"1510.08896","last_updated":"2016-05-30T02:40:00Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T04:34:46.092658Z","submitted_at":"2015-10-29T20:47:27Z","title":"Robust Shift-and-Invert Preconditioning: Faster and More Sample Efficient Algorithms for Eigenvector Computation"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1510.08896."}