{"as_of":"2026-08-09T14:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9299b18bf8636d0212492301636058e583fa302e001cfac0b9d7e673fede98e6","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-09T06:31:02.800959+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-07-10T21:57:20.423107Z","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-07-10T21:57:37.113425Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1804.07531","last_updated":"2018-05-24T05:07:35Z","snapshot_observed_at":"2026-08-09T01:44:32.991290Z","submitted_at":"2018-04-20T10:10:10Z","title":"Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views","version":2},"cited_work":{"arxiv_id":"1804.07531","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.07531","snapshot_observed_at":"2026-07-10T21:57:37.113425Z","title":"Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views","venue":"math.NA","work_id":"9fab2a1f-0006-4b72-aa9e-c223faee602f","year":2018},"citing_paper":{"arxiv_id":"2607.06758","last_updated":"2026-07-07T19:41:09Z","snapshot_observed_at":"2026-08-03T19:40:39.543668Z","submitted_at":"2026-07-07T19:41:09Z","title":"Adaptive, Matrix-Free Low-Rank Approximation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T21:57:20.423107Z"},"links":{"cited_paper":"/paper/1804.07531","citing_paper":"/paper/2607.06758"},"observation_digest":"sha256:783b61979ccb906618fc411e38d31ead397f4c346cf55fd47f79b83a58fbc66e","observation_id":"d1482fe2-935f-4356-93cb-c07ab9487fab","resolution":{"observed_at":"2026-07-10T21:57:37.140615Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/1804.07531/citation-record","integrity":"/paper/1804.07531/integrity","json":"/paper/1804.07531/citation-record.json","paper":"/paper/1804.07531"},"outbound":[],"paper":{"arxiv_id":"1804.07531","last_updated":"2018-05-24T05:07:35Z","latest_version":2,"primary_category":"math.NA","snapshot_observed_at":"2026-08-09T01:44:32.991290Z","submitted_at":"2018-04-20T10:10:10Z","title":"Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views"},"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 1 inbound Pith citation observation for arXiv:1804.07531."}