{"as_of":"2026-08-20T10:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5105bcf63967aaf4cf7835f3889956a6ce00e03dba09c8c9190dd80cec5ba7b4","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-20T06:33:59.587034+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-14T15:41:41.821409Z","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-14T10:45:07.446249Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1809.09237","last_updated":"2019-07-14T11:28:48Z","snapshot_observed_at":"2026-08-14T18:24:05.811771Z","submitted_at":"2018-09-24T22:07:50Z","title":"Nonconvex Robust Low-rank Matrix Recovery","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.09237","snapshot_observed_at":"2026-08-14T15:41:41.821409Z","title":"Preprint, https://arxiv.org/abs/1809.09237","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.00745","last_updated":"2019-08-02T08:14:58Z","snapshot_observed_at":"2026-08-15T21:57:56.506174Z","submitted_at":"2019-08-02T08:14:58Z","title":"On The Geometric Analysis of A Quartic-quadratic Optimization Problem under A Spherical Constraint","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T15:41:41.821409Z"},"links":{"cited_paper":"/paper/1809.09237","citing_paper":"/paper/1908.00745"},"observation_digest":"sha256:9bfc5b0de5931bd9ea2facff5c4833a184b02aa471fd0f90500df8008daf3c98","observation_id":"47c00fa3-1b58-49e9-8117-0e89a4ff08d2","resolution":{"observed_at":"2026-08-14T15:41:41.821409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.09237","last_updated":"2019-07-14T11:28:48Z","snapshot_observed_at":"2026-08-14T18:24:05.811771Z","submitted_at":"2018-09-24T22:07:50Z","title":"Nonconvex Robust Low-rank Matrix Recovery","version":4},"cited_work":{"arxiv_id":"1809.09237","doi":null,"metadata_source":"pith","pith_arxiv_id":"1809.09237","snapshot_observed_at":"2026-08-14T10:45:07.446249Z","title":"Nonconvex Robust Low-rank Matrix Recovery","venue":"cs.IT","work_id":"34d7d600-2df6-4510-bf67-4ab1e5c90e6e","year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-19T14:20:11.397648Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.180103Z"},"links":{"cited_paper":"/paper/1809.09237","citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:b0e6ea15f76793743f2fb4b229f7bbd241a18d44b17b9750ad577b84803e1e42","observation_id":"73edb1a2-1978-4b6c-af5c-3e963822c0ea","resolution":{"observed_at":"2026-08-14T10:45:07.452058Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1809.09237/citation-record","integrity":"/paper/1809.09237/integrity","json":"/paper/1809.09237/citation-record.json","paper":"/paper/1809.09237"},"outbound":[],"paper":{"arxiv_id":"1809.09237","last_updated":"2019-07-14T11:28:48Z","latest_version":4,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T18:24:05.811771Z","submitted_at":"2018-09-24T22:07:50Z","title":"Nonconvex Robust Low-rank Matrix Recovery"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1809.09237."}