{"as_of":"2026-08-22T12:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f4eed7bada3506983f466b8da80480e11d42603cc95d874ba234edaa6fb9bb0a","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-22T06:32:14.747728+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-07T15:18:13.042434Z","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-07T15:18:14.710527Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1312.3582","last_updated":"2015-01-07T20:01:08Z","snapshot_observed_at":"2026-08-14T23:51:51.913034Z","submitted_at":"2013-12-12T18:39:21Z","title":"Iterative Hard Thresholding for Weighted Sparse Approximation","version":4},"cited_work":{"arxiv_id":"1312.3582","doi":null,"metadata_source":"pith","pith_arxiv_id":"1312.3582","snapshot_observed_at":"2026-08-07T15:18:14.710527Z","title":"Iterative Hard Thresholding for Weighted Sparse Approximation","venue":"cs.IT","work_id":"28fc53fa-51ff-4784-91e5-043f7b18b8d1","year":2013},"citing_paper":{"arxiv_id":"2505.15661","last_updated":"2025-05-21T15:36:38Z","snapshot_observed_at":"2026-08-13T09:23:32.890157Z","submitted_at":"2025-05-21T15:36:38Z","title":"Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T15:18:13.042434Z"},"links":{"cited_paper":"/paper/1312.3582","citing_paper":"/paper/2505.15661"},"observation_digest":"sha256:8eaae399ca7f9f14be7de57b72878d6a4623b10f33828bebd74e3373c686f87b","observation_id":"34adfe20-d4e8-4baa-bf05-6da00c44ac01","resolution":{"observed_at":"2026-08-07T15:18:14.753981Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1312.3582/citation-record","integrity":"/paper/1312.3582/integrity","json":"/paper/1312.3582/citation-record.json","paper":"/paper/1312.3582"},"outbound":[],"paper":{"arxiv_id":"1312.3582","last_updated":"2015-01-07T20:01:08Z","latest_version":4,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-14T23:51:51.913034Z","submitted_at":"2013-12-12T18:39:21Z","title":"Iterative Hard Thresholding for Weighted Sparse Approximation"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1312.3582."}