{"as_of":"2026-08-08T13:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a63af5ea33f6ef65a90d057bbc8b7984ada83989e2cc35e4b693a8e10e91038e","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:09:59.460706Z","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-14T23:33:16.433464Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2009.06107","last_updated":"2021-06-26T17:06:23Z","snapshot_observed_at":"2026-08-07T05:59:38.432033Z","submitted_at":"2020-09-13T22:55:18Z","title":"Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.06107","snapshot_observed_at":"2026-08-07T13:09:59.460706Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.22743","last_updated":"2025-06-17T05:24:14Z","snapshot_observed_at":"2026-08-07T19:41:09.127788Z","submitted_at":"2025-05-28T18:04:10Z","title":"Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:09:59.460706Z"},"links":{"cited_paper":"/paper/2009.06107","citing_paper":"/paper/2505.22743"},"observation_digest":"sha256:d943e31dd33d3ef546d48141da131744af225869bb08356bd392ba71bb0c1e75","observation_id":"f1d97f24-88a4-4850-b448-43b88c7f17b4","resolution":{"observed_at":"2026-08-07T13:09:59.460706Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.06107","last_updated":"2021-06-26T17:06:23Z","snapshot_observed_at":"2026-08-07T05:59:38.432033Z","submitted_at":"2020-09-13T22:55:18Z","title":"Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent","version":3},"cited_work":{"arxiv_id":"2009.06107","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.06107","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sta- tistical query algorithms and low-degree tests are almost equivalent","venue":null,"work_id":"27366c3f-9cea-4a69-a031-152dc51a7655","year":2009},"citing_paper":{"arxiv_id":"2603.26029","last_updated":"2026-04-04T03:25:38Z","snapshot_observed_at":"2026-08-02T19:42:04.113554Z","submitted_at":"2026-03-27T02:59:25Z","title":"Detection Is Harder Than Estimation in Certain Regimes: Inference for Moment and Cumulant Tensors","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-14T23:30:25.596266Z"},"links":{"cited_paper":"/paper/2009.06107","citing_paper":"/paper/2603.26029"},"observation_digest":"sha256:d1092375465357cd37b40c610498fa5a96f76f576c97f2a55c81195d2ca73c6d","observation_id":"63143069-f3c0-4ee6-8570-2e509357ca61","resolution":{"observed_at":"2026-05-14T23:33:16.437975Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.06107","last_updated":"2021-06-26T17:06:23Z","snapshot_observed_at":"2026-08-07T05:59:38.432033Z","submitted_at":"2020-09-13T22:55:18Z","title":"Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent","version":3},"cited_work":{"arxiv_id":"2009.06107","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.06107","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sta- tistical query algorithms and low-degree tests are almost equivalent","venue":null,"work_id":"27366c3f-9cea-4a69-a031-152dc51a7655","year":2009},"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":5,"source":"pdf_text","source_observed_at":"2026-05-10T17:38:17.755892Z"},"links":{"cited_paper":"/paper/2009.06107","citing_paper":"/paper/2604.07278"},"observation_digest":"sha256:9586a3b8c438e6d63e8f8aced53a3f1563782b2d2a3d16723d432603b9692043","observation_id":"bdf42242-38dc-4b73-9932-e4e1f0f272d1","resolution":{"observed_at":"2026-05-11T06:25:59.081631Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.06107","last_updated":"2021-06-26T17:06:23Z","snapshot_observed_at":"2026-08-07T05:59:38.432033Z","submitted_at":"2020-09-13T22:55:18Z","title":"Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.06107","snapshot_observed_at":"2026-08-01T12:53:33.205249Z","title":"arXiv preprint arXiv:2009.06107 , year=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-08T13:09:37.440091Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":138,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:33.205249Z"},"links":{"cited_paper":"/paper/2009.06107","citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:4eaa102414af7cea801360437d5f5a83b09a75dda649ee50ae796646abf77079","observation_id":"05105efa-8151-4b7e-9e6c-3cb66b9c6fd4","resolution":{"observed_at":"2026-08-01T12:53:33.205249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2009.06107/citation-record","integrity":"/paper/2009.06107/integrity","json":"/paper/2009.06107/citation-record.json","paper":"/paper/2009.06107"},"outbound":[],"paper":{"arxiv_id":"2009.06107","last_updated":"2021-06-26T17:06:23Z","latest_version":3,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-07T05:59:38.432033Z","submitted_at":"2020-09-13T22:55:18Z","title":"Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2009.06107."}