{"as_of":"2026-08-11T11:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fc1fc6199b0f0bfb66fd314d2ad03e117e02ad08ff44d7073021a113b5e51af6","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-11T06:34:44.6726+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-10T14:44:29.468909Z","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-08T14:27:38.785582Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2210.12816","last_updated":"2025-03-05T02:01:02Z","snapshot_observed_at":"2026-08-06T06:26:13.971009Z","submitted_at":"2022-10-23T18:30:45Z","title":"Simple Alternating Minimization Provably Solves Complete Dictionary Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.12816","snapshot_observed_at":"2026-08-10T14:44:29.468909Z","title":"Simple alternating minimization provably solves complete dictionary learning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.15094","last_updated":"2025-04-18T07:02:05Z","snapshot_observed_at":"2026-08-10T14:35:38.958497Z","submitted_at":"2025-01-25T06:00:52Z","title":"Exploring the Limitations of Structured Orthogonal Dictionary Learning","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T14:44:29.468909Z"},"links":{"cited_paper":"/paper/2210.12816","citing_paper":"/paper/2501.15094"},"observation_digest":"sha256:31c73c3ce693e03579d40c19316e3e32321c04c6baebdb36c548b6fb766f4ee3","observation_id":"808f99f2-3163-433b-b48f-61c565763d1e","resolution":{"observed_at":"2026-08-10T14:44:29.468909Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.12816","last_updated":"2025-03-05T02:01:02Z","snapshot_observed_at":"2026-08-06T06:26:13.971009Z","submitted_at":"2022-10-23T18:30:45Z","title":"Simple Alternating Minimization Provably Solves Complete Dictionary Learning","version":2},"cited_work":{"arxiv_id":"2210.12816","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.12816","snapshot_observed_at":"2026-08-08T14:27:38.785582Z","title":"Simple Alternating Minimization Provably Solves Complete Dictionary Learning","venue":"cs.LG","work_id":"dd8fbd81-1aba-44ed-8643-08f51d04b45c","year":2022},"citing_paper":{"arxiv_id":"2502.06775","last_updated":"2025-05-27T08:51:06Z","snapshot_observed_at":"2026-08-10T09:53:57.749421Z","submitted_at":"2025-02-10T18:53:15Z","title":"Enhancing Performance of Explainable AI Models with Constrained Concept Refinement","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-08T14:27:38.426452Z"},"links":{"cited_paper":"/paper/2210.12816","citing_paper":"/paper/2502.06775"},"observation_digest":"sha256:6d5cebfd86143d9626451c3848a5052f2d573f2b91dd2a75c6beabdc998ce4f1","observation_id":"2826a69f-48f0-4834-8065-f509a354ae41","resolution":{"observed_at":"2026-08-08T14:27:38.790655Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2210.12816/citation-record","integrity":"/paper/2210.12816/integrity","json":"/paper/2210.12816/citation-record.json","paper":"/paper/2210.12816"},"outbound":[],"paper":{"arxiv_id":"2210.12816","last_updated":"2025-03-05T02:01:02Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T06:26:13.971009Z","submitted_at":"2022-10-23T18:30:45Z","title":"Simple Alternating Minimization Provably Solves Complete Dictionary Learning"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2210.12816."}