{"as_of":"2026-08-19T14:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8d1c4bdade8bb977687f94375d70469805482fbfe4315bbc47462481f8243d82","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T23:57:05.160361Z","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-05T16:34:30.463703Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.03761","last_updated":"2024-04-04T19:07:21Z","snapshot_observed_at":"2026-08-19T07:14:18.027888Z","submitted_at":"2024-04-04T19:07:21Z","title":"Learning smooth functions in high dimensions: from sparse polynomials to deep neural networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03761","snapshot_observed_at":"2026-08-09T23:57:05.160361Z","title":"Learning smooth functions in high dimensions: from sparse polynomials to deep neural networks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.18359","last_updated":"2025-01-30T14:05:20Z","snapshot_observed_at":"2026-08-13T08:04:49.405919Z","submitted_at":"2025-01-30T14:05:20Z","title":"Contextual Online Decision Making with Infinite-Dimensional Functional Regression","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T23:57:05.160361Z"},"links":{"cited_paper":"/paper/2404.03761","citing_paper":"/paper/2501.18359"},"observation_digest":"sha256:a1042be1468e49f8224e9ff65226067d1a0d1f0ff9ae543dac8e6c35e236761e","observation_id":"1e67101f-f5b0-411e-a378-84758173d7bf","resolution":{"observed_at":"2026-08-09T23:57:05.160361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03761","last_updated":"2024-04-04T19:07:21Z","snapshot_observed_at":"2026-08-19T07:14:18.027888Z","submitted_at":"2024-04-04T19:07:21Z","title":"Learning smooth functions in high dimensions: from sparse polynomials to deep neural networks","version":1},"cited_work":{"arxiv_id":"2404.03761","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.03761","snapshot_observed_at":"2026-08-05T16:34:30.463703Z","title":"Learning smooth functions in high dimensions: from sparse polynomials to deep neural networks","venue":"math.NA","work_id":"336eced0-3310-4d57-8a64-74b20c6c52f6","year":2024},"citing_paper":{"arxiv_id":"2508.18199","last_updated":"2025-08-25T17:00:56Z","snapshot_observed_at":"2026-08-11T00:37:16.382456Z","submitted_at":"2025-08-25T17:00:56Z","title":"Sparse Polynomial Regression under Anomalous Data","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T16:34:30.228966Z"},"links":{"cited_paper":"/paper/2404.03761","citing_paper":"/paper/2508.18199"},"observation_digest":"sha256:359b91fde311af3c87f6a08f35fd417b1d5a358a48e0e282bbfaacc6bc720b33","observation_id":"36159730-f331-473c-aabc-c5acf8012b5b","resolution":{"observed_at":"2026-08-05T16:34:30.469019Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03761","last_updated":"2024-04-04T19:07:21Z","snapshot_observed_at":"2026-08-19T07:14:18.027888Z","submitted_at":"2024-04-04T19:07:21Z","title":"Learning smooth functions in high dimensions: from sparse polynomials to deep neural networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03761","snapshot_observed_at":"2026-08-01T17:37:51.036523Z","title":"arXiv preprint arXiv:2404.03761 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17607","last_updated":"2026-08-05T04:57:10Z","snapshot_observed_at":"2026-08-15T08:40:47.941191Z","submitted_at":"2026-07-20T06:53:59Z","title":"Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T17:37:51.036523Z"},"links":{"cited_paper":"/paper/2404.03761","citing_paper":"/paper/2607.17607"},"observation_digest":"sha256:4ed6cf9bc8ca47915d7392cd3744d1cc412bc940fd034dd27b653b99c9c74227","observation_id":"057bdd75-9aa2-453e-b06d-ab131604ddec","resolution":{"observed_at":"2026-08-01T17:37:51.036523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2404.03761/citation-record","integrity":"/paper/2404.03761/integrity","json":"/paper/2404.03761/citation-record.json","paper":"/paper/2404.03761"},"outbound":[],"paper":{"arxiv_id":"2404.03761","last_updated":"2024-04-04T19:07:21Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-08-19T07:14:18.027888Z","submitted_at":"2024-04-04T19:07:21Z","title":"Learning smooth functions in high dimensions: from sparse polynomials to deep 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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2404.03761."}