{"as_of":"2026-08-11T20:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6e343e1eb77671e465bc7579ae68143fcd490e5aab30a86a842d84d370308bd4","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-11T06:34:44.6726+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-10T22:49:49.776829Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T06:25:59.089248Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2004.00557","last_updated":"2020-05-14T14:32:38Z","snapshot_observed_at":"2026-08-11T04:10:25.389112Z","submitted_at":"2020-04-01T16:37:10Z","title":"Statistical Queries and Statistical Algorithms: Foundations and Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.00557","snapshot_observed_at":"2026-08-10T22:49:49.776829Z","title":"Statistical queries and statistical algorithms: Foundations and applications","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T12:49:09.670529Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.776829Z"},"links":{"cited_paper":"/paper/2004.00557","citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:cc864496050be8410a824a9a0232a4a3eedd60ceeb823abfcff292bbbbc70e87","observation_id":"337b4323-328c-4e7c-8b91-282e4d2fd084","resolution":{"observed_at":"2026-08-10T22:49:49.776829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.00557","last_updated":"2020-05-14T14:32:38Z","snapshot_observed_at":"2026-08-11T04:10:25.389112Z","submitted_at":"2020-04-01T16:37:10Z","title":"Statistical Queries and Statistical Algorithms: Foundations and Applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.00557","snapshot_observed_at":"2026-08-04T09:40:59.791694Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.14331","last_updated":"2026-07-02T12:40:23Z","snapshot_observed_at":"2026-08-09T19:39:54.906021Z","submitted_at":"2025-10-16T06:10:11Z","title":"LLM Priors for ERM over Programs","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T09:40:59.791694Z"},"links":{"cited_paper":"/paper/2004.00557","citing_paper":"/paper/2510.14331"},"observation_digest":"sha256:7f97d470cf750afad0eae0ca30cbbdbd5413104a310ea5967f2775b7d8a42c30","observation_id":"ec1abb5a-2f57-417e-bb53-c7416e8e74b6","resolution":{"observed_at":"2026-08-04T09:40:59.791694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.00557","last_updated":"2020-05-14T14:32:38Z","snapshot_observed_at":"2026-08-11T04:10:25.389112Z","submitted_at":"2020-04-01T16:37:10Z","title":"Statistical Queries and Statistical Algorithms: Foundations and Applications","version":2},"cited_work":{"arxiv_id":"2004.00557","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2004.00557","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Statistical queries and statistical algorithms: Foundations and applications","venue":null,"work_id":"b8ea0e02-f204-4eaf-8f9a-579eac3e0cd6","year":2004},"citing_paper":{"arxiv_id":"2604.07278","last_updated":"2026-04-08T16:40:42Z","snapshot_observed_at":"2026-07-06T22:55:33.502756Z","submitted_at":"2026-04-08T16:40:42Z","title":"Multiple Planted Structures Below $\\sqrt{n}$: An SoS Integrality Gap and an SQ Lower Bound","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T17:38:17.755892Z"},"links":{"cited_paper":"/paper/2004.00557","citing_paper":"/paper/2604.07278"},"observation_digest":"sha256:ccb6a68dba15316a4a63d8be1b172514b49e251ad836666c8ade67b7382453ac","observation_id":"5a23b2a2-df56-4796-909f-a6419e79a023","resolution":{"observed_at":"2026-05-11T06:25:59.101765Z","resolver_source":"arxiv_id","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/2004.00557/citation-record","integrity":"/paper/2004.00557/integrity","json":"/paper/2004.00557/citation-record.json","paper":"/paper/2004.00557"},"outbound":[],"paper":{"arxiv_id":"2004.00557","last_updated":"2020-05-14T14:32:38Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T04:10:25.389112Z","submitted_at":"2020-04-01T16:37:10Z","title":"Statistical Queries and Statistical Algorithms: Foundations and Applications"},"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 3 inbound Pith citation observations for arXiv:2004.00557."}