{"as_of":"2026-08-11T03:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a4f33b94edd36d7491f21eb6b70e8ddf541c993b48808e5a4e003160ebd9a243","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-10T06:31:04.303077+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-08T14:27:38.440000Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T02:59:25.551380Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.06338","last_updated":"2022-02-08T10:39:01Z","snapshot_observed_at":"2026-08-03T01:18:07.219868Z","submitted_at":"2021-06-11T12:21:26Z","title":"Understanding approximate and unrolled dictionary learning for pattern recovery","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.06338","snapshot_observed_at":"2026-08-08T14:27:38.440000Z","title":"Understanding approximate and unrolled dictionary learning for pattern recovery","venue":null,"work_id":null,"year":2021},"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":37,"source":"arxiv_source","source_observed_at":"2026-08-08T14:27:38.440000Z"},"links":{"cited_paper":"/paper/2106.06338","citing_paper":"/paper/2502.06775"},"observation_digest":"sha256:69e059d867348a6a992b53b34cfb6f064c0467a6416c1d67dd9a2d1c797cb020","observation_id":"b6df3c71-5124-4347-9e49-be82d2fb145e","resolution":{"observed_at":"2026-08-08T14:27:38.440000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.06338","last_updated":"2022-02-08T10:39:01Z","snapshot_observed_at":"2026-08-03T01:18:07.219868Z","submitted_at":"2021-06-11T12:21:26Z","title":"Understanding approximate and unrolled dictionary learning for pattern recovery","version":3},"cited_work":{"arxiv_id":"2106.06338","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.06338","snapshot_observed_at":"2026-07-04T02:59:25.551380Z","title":"Mal´ ezieux, T","venue":null,"work_id":"dc5fbf96-dd0a-403f-a349-858225535a06","year":2021},"citing_paper":{"arxiv_id":"2606.19205","last_updated":"2026-06-17T15:43:01Z","snapshot_observed_at":"2026-08-06T16:51:25.209673Z","submitted_at":"2026-06-17T15:43:01Z","title":"Discovering a well-conditioned analytic continuation problem via dictionary learning","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-06-26T18:43:53.045915Z"},"links":{"cited_paper":"/paper/2106.06338","citing_paper":"/paper/2606.19205"},"observation_digest":"sha256:627d05c24a15f0dde4b2dc755cd706f156a883ae7bec605d55a5d8c5bc586ac5","observation_id":"114b5c27-3af0-452a-a638-c212bb28c437","resolution":{"observed_at":"2026-07-04T02:59:25.553989Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.06338/citation-record","integrity":"/paper/2106.06338/integrity","json":"/paper/2106.06338/citation-record.json","paper":"/paper/2106.06338"},"outbound":[],"paper":{"arxiv_id":"2106.06338","last_updated":"2022-02-08T10:39:01Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T01:18:07.219868Z","submitted_at":"2021-06-11T12:21:26Z","title":"Understanding approximate and unrolled dictionary learning for pattern 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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:2106.06338."}