{"as_of":"2026-08-09T22:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ad0069922830660aaf4ce7925d723094906a2ed9812983bf1613d48ac36c93e8","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.689515Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.12376","last_updated":"2024-12-06T02:58:51Z","snapshot_observed_at":"2026-08-01T20:56:40.171963Z","submitted_at":"2024-04-18T17:57:53Z","title":"Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.12376","snapshot_observed_at":"2026-08-08T15:34:16.689515Z","title":"Matching the statistical query lower bound for k-sparse parity problems with stochastic gradient descent","venue":null,"work_id":null,"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":32,"source":"arxiv_source","source_observed_at":"2026-08-08T15:34:16.689515Z"},"links":{"cited_paper":"/paper/2404.12376","citing_paper":"/paper/2502.06443"},"observation_digest":"sha256:995ee383e28a1460a009590e3757814cc7cd3eb98ba926245cc6e94471bcdb83","observation_id":"a906c605-35c1-4f03-b88f-f8e075149755","resolution":{"observed_at":"2026-08-08T15:34:16.689515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.12376","last_updated":"2024-12-06T02:58:51Z","snapshot_observed_at":"2026-08-01T20:56:40.171963Z","submitted_at":"2024-04-18T17:57:53Z","title":"Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent","version":2},"cited_work":{"arxiv_id":"2404.12376","doi":"10.48550/arxiv.2404.12376","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.12376","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URL https://doi.org/10","venue":"arXiv (Cornell University)","work_id":"d5b20fb1-41d3-4144-a55f-9baa8dea424f","year":2025},"citing_paper":{"arxiv_id":"2502.07553","last_updated":"2026-05-09T12:05:43Z","snapshot_observed_at":"2026-08-01T19:59:54.808877Z","submitted_at":"2025-02-11T13:41:30Z","title":"Transformers Provably Learn Sparse XOR with Polylogarithmic Parameters","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-23T03:24:16.782391Z"},"links":{"cited_paper":"/paper/2404.12376","citing_paper":"/paper/2502.07553"},"observation_digest":"sha256:c7c9c46427ad677de8643c7c87d0e4e948818c0c4dd27544479060170ebb92e3","observation_id":"4f7ed50d-293e-4833-8ed8-8895f3eb1468","resolution":{"observed_at":"2026-05-23T03:25:20.148362Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2404.12376/citation-record","integrity":"/paper/2404.12376/integrity","json":"/paper/2404.12376/citation-record.json","paper":"/paper/2404.12376"},"outbound":[],"paper":{"arxiv_id":"2404.12376","last_updated":"2024-12-06T02:58:51Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-01T20:56:40.171963Z","submitted_at":"2024-04-18T17:57:53Z","title":"Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent"},"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:2404.12376."}