{"as_of":"2026-08-16T10:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:269629a09e422edeb5f5999e16687e8ba5eb943160cf40f70bf28314f9cca0b6","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-16T06:30:59.297886+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-14T10:45:07.036048Z","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:32:19.515442Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1809.10313","last_updated":"2018-09-27T02:14:40Z","snapshot_observed_at":"2026-08-14T18:22:59.238533Z","submitted_at":"2018-09-27T02:14:40Z","title":"Efficient Dictionary Learning with Gradient Descent","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.10313","snapshot_observed_at":"2026-08-14T10:45:07.036048Z","title":"Efficient dictionary learning with gradient descent","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.10776","last_updated":"2020-03-01T02:57:22Z","snapshot_observed_at":"2026-08-15T20:31:22.977758Z","submitted_at":"2019-08-28T15:25:54Z","title":"A Nonconvex Approach for Exact and Efficient Multichannel Sparse Blind Deconvolution","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-14T10:45:07.036048Z"},"links":{"cited_paper":"/paper/1809.10313","citing_paper":"/paper/1908.10776"},"observation_digest":"sha256:ccce15fe46f9efbcab77a31df38b7a03a36e01958fb2850111c61eb5a5200123","observation_id":"3b9087d6-a16e-4524-be2e-907072bd39aa","resolution":{"observed_at":"2026-08-14T10:45:07.036048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.10313","last_updated":"2018-09-27T02:14:40Z","snapshot_observed_at":"2026-08-14T18:22:59.238533Z","submitted_at":"2018-09-27T02:14:40Z","title":"Efficient Dictionary Learning with Gradient Descent","version":1},"cited_work":{"arxiv_id":"1809.10313","doi":null,"metadata_source":"pith","pith_arxiv_id":"1809.10313","snapshot_observed_at":"2026-08-14T10:32:19.515442Z","title":"Efficient Dictionary Learning with Gradient Descent","venue":"math.OC","work_id":"21ed5d76-3b38-4029-ab7c-75beb2875fea","year":2018},"citing_paper":{"arxiv_id":"1908.10959","last_updated":"2019-10-01T05:25:59Z","snapshot_observed_at":"2026-08-15T06:25:12.979664Z","submitted_at":"2019-08-28T21:52:28Z","title":"Short-and-Sparse Deconvolution -- A Geometric Approach","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-14T10:32:19.165379Z"},"links":{"cited_paper":"/paper/1809.10313","citing_paper":"/paper/1908.10959"},"observation_digest":"sha256:1b80e645613f6396e1caf31f5b5ae459d07fbb2ed2a0806fd276b326e5606bf7","observation_id":"eb29d9ff-21ad-4be5-8f92-639710e04e54","resolution":{"observed_at":"2026-08-14T10:32:19.519331Z","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/1809.10313/citation-record","integrity":"/paper/1809.10313/integrity","json":"/paper/1809.10313/citation-record.json","paper":"/paper/1809.10313"},"outbound":[],"paper":{"arxiv_id":"1809.10313","last_updated":"2018-09-27T02:14:40Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T18:22:59.238533Z","submitted_at":"2018-09-27T02:14:40Z","title":"Efficient Dictionary Learning with Gradient Descent"},"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 2 inbound Pith citation observations for arXiv:1809.10313."}