{"as_of":"2026-08-18T22:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4162ac8a053b2e46c012714d45eb8a291d74817fea08bd0d85a00927b794d502","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-18T06:34:40.430872+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-06T00:39:44.824870Z","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-06T00:39:54.631555Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.11068","last_updated":"2024-04-01T22:17:22Z","snapshot_observed_at":"2026-08-16T15:53:41.552609Z","submitted_at":"2023-02-21T23:49:36Z","title":"Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time","version":3},"cited_work":{"arxiv_id":"2302.11068","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.11068","snapshot_observed_at":"2026-08-06T00:39:54.631555Z","title":"Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time","venue":"cs.LG","work_id":"a3df5b90-2703-4378-8b46-7cb5a8e15400","year":2023},"citing_paper":{"arxiv_id":"2608.00977","last_updated":"2026-08-02T04:01:41Z","snapshot_observed_at":"2026-08-17T12:17:50.488143Z","submitted_at":"2026-08-02T04:01:41Z","title":"TIDE-MC: Two-Sided Interpolative Decomposition for Billion-Scale GPU Matrix Completion","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T00:39:44.824870Z"},"links":{"cited_paper":"/paper/2302.11068","citing_paper":"/paper/2608.00977"},"observation_digest":"sha256:69ca554174ed0dd3ba02bc1f65e9cbfef6f4ffd19ce720f69ae70c6ac491cacd","observation_id":"b8b52941-5419-4b07-9adf-efc924533c5a","resolution":{"observed_at":"2026-08-06T00:39:54.683793Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2302.11068/citation-record","integrity":"/paper/2302.11068/integrity","json":"/paper/2302.11068/citation-record.json","paper":"/paper/2302.11068"},"outbound":[],"paper":{"arxiv_id":"2302.11068","last_updated":"2024-04-01T22:17:22Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T15:53:41.552609Z","submitted_at":"2023-02-21T23:49:36Z","title":"Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2302.11068."}