{"as_of":"2026-08-09T08:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ddfc80042def94297309edcbb4dba2075c3a7e8866dff691d872dc5ec4b5269","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-09T06:31:02.800959+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-08T15:34:16.685134Z","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-08T15:34:17.012725Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.05622","last_updated":"2024-07-08T05:30:34Z","snapshot_observed_at":"2026-08-01T15:37:53.369157Z","submitted_at":"2024-07-08T05:30:34Z","title":"On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries","version":1},"cited_work":{"arxiv_id":"2407.05622","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.05622","snapshot_observed_at":"2026-08-08T15:34:17.012725Z","title":"On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries","venue":"cs.LG","work_id":"793bb87e-2b6f-43d5-a6d2-4ee7af04bc59","year":2024},"citing_paper":{"arxiv_id":"2502.06443","last_updated":"2025-07-21T10:48:50Z","snapshot_observed_at":"2026-08-08T15:22:58.731880Z","submitted_at":"2025-02-10T13:19:30Z","title":"Low-dimensional Functions are Efficiently Learnable under Randomly Biased Distributions","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T15:34:16.685134Z"},"links":{"cited_paper":"/paper/2407.05622","citing_paper":"/paper/2502.06443"},"observation_digest":"sha256:f6c5226bcd1129073b7beada7b7f718721399f177608f9cb8e42c580e2554b19","observation_id":"d7219710-d2b4-403d-be77-1e150fc454e7","resolution":{"observed_at":"2026-08-08T15:34:17.020132Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05622","last_updated":"2024-07-08T05:30:34Z","snapshot_observed_at":"2026-08-01T15:37:53.369157Z","submitted_at":"2024-07-08T05:30:34Z","title":"On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.05622","snapshot_observed_at":"2026-07-12T03:07:54.001891Z","title":"On the complexity of learning sparse functions with statistical and gradient queries","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03347","last_updated":"2026-07-03T14:02:42Z","snapshot_observed_at":"2026-08-04T04:21:48.715795Z","submitted_at":"2026-07-03T14:02:42Z","title":"The Multiscale Single-Index Model: A Stylized Model for Hierarchical Feature Learning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-12T03:07:54.001891Z"},"links":{"cited_paper":"/paper/2407.05622","citing_paper":"/paper/2607.03347"},"observation_digest":"sha256:3344f7049f4f3e9945f40d85ed27b6390975af4e84c61ef300c48a28555455f4","observation_id":"085a2522-f415-4d3f-a47d-a0ea9f0e7fa8","resolution":{"observed_at":"2026-07-12T03:07:54.001891Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.05622/citation-record","integrity":"/paper/2407.05622/integrity","json":"/paper/2407.05622/citation-record.json","paper":"/paper/2407.05622"},"outbound":[],"paper":{"arxiv_id":"2407.05622","last_updated":"2024-07-08T05:30:34Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-01T15:37:53.369157Z","submitted_at":"2024-07-08T05:30:34Z","title":"On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2407.05622."}