{"as_of":"2026-08-11T18:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2d3b83ac0ea93eb5303ce20a9b8a9593b55def4f55d1067d082fcc495da87d3d","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-11T06:34:44.6726+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-07T04:09:10.103442Z","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-07T04:09:14.153415Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1609.00285","last_updated":"2017-05-29T09:37:06Z","snapshot_observed_at":"2026-07-06T05:08:58.982373Z","submitted_at":"2016-09-01T15:46:07Z","title":"Understanding Trainable Sparse Coding via Matrix Factorization","version":4},"cited_work":{"arxiv_id":"1609.00285","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.00285","snapshot_observed_at":"2026-08-07T04:09:14.153415Z","title":"Understanding Trainable Sparse Coding via Matrix Factorization","venue":"stat.ML","work_id":"ebf1fec3-a12d-4695-916c-cd2d445222f4","year":2016},"citing_paper":{"arxiv_id":"2506.11732","last_updated":"2025-06-13T12:44:32Z","snapshot_observed_at":"2026-08-10T22:25:16.477107Z","submitted_at":"2025-06-13T12:44:32Z","title":"Data-driven approaches to inverse problems","version":1},"reference_index":1965,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:10.103442Z"},"links":{"cited_paper":"/paper/1609.00285","citing_paper":"/paper/2506.11732"},"observation_digest":"sha256:4aad3f0c57e7d80e3372dbc8a6d3ae9e0db6a53731a318a30804c53544e7d877","observation_id":"2b107006-65a3-4952-94c2-d9a3544a5ae4","resolution":{"observed_at":"2026-08-07T04:09:14.242157Z","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/1609.00285/citation-record","integrity":"/paper/1609.00285/integrity","json":"/paper/1609.00285/citation-record.json","paper":"/paper/1609.00285"},"outbound":[],"paper":{"arxiv_id":"1609.00285","last_updated":"2017-05-29T09:37:06Z","latest_version":4,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T05:08:58.982373Z","submitted_at":"2016-09-01T15:46:07Z","title":"Understanding Trainable Sparse Coding via Matrix Factorization"},"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 1 inbound Pith citation observation for arXiv:1609.00285."}