{"as_of":"2026-08-12T15:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5359a63be543bc40a9ad3d2e51da18ca7c1a5988dd025123dd8abde3358b545b","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-12T06:34:41.77262+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-10T22:11:14.928669Z","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-10T22:11:15.148103Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.03673","last_updated":"2021-11-25T15:30:47Z","snapshot_observed_at":"2026-08-05T11:31:32.118147Z","submitted_at":"2021-10-07T17:57:20Z","title":"Tighter Sparse Approximation Bounds for ReLU Neural Networks","version":2},"cited_work":{"arxiv_id":"2110.03673","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.03673","snapshot_observed_at":"2026-08-10T22:11:15.148103Z","title":"Tighter Sparse Approximation Bounds for ReLU Neural Networks","venue":"stat.ML","work_id":"1ded8c48-0d84-4985-9fd6-b5ca4358ce1f","year":2021},"citing_paper":{"arxiv_id":"2501.02791","last_updated":"2025-01-06T06:18:38Z","snapshot_observed_at":"2026-08-11T16:13:12.765042Z","submitted_at":"2025-01-06T06:18:38Z","title":"Orthogonal greedy algorithm for linear operator learning with shallow neural network","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-10T22:11:14.928669Z"},"links":{"cited_paper":"/paper/2110.03673","citing_paper":"/paper/2501.02791"},"observation_digest":"sha256:f90637ec292b11ad988693db0cafbc723c6d533c1438eae3a152d2ac17da2ba2","observation_id":"e0d43903-a3f7-4406-9945-96ee5451ec27","resolution":{"observed_at":"2026-08-10T22:11:15.154097Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2110.03673/citation-record","integrity":"/paper/2110.03673/integrity","json":"/paper/2110.03673/citation-record.json","paper":"/paper/2110.03673"},"outbound":[],"paper":{"arxiv_id":"2110.03673","last_updated":"2021-11-25T15:30:47Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-05T11:31:32.118147Z","submitted_at":"2021-10-07T17:57:20Z","title":"Tighter Sparse Approximation Bounds for ReLU Neural Networks"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2110.03673."}