{"as_of":"2026-08-12T06:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f9698133378365723e7447cc64f1a81d1042e8b1452190003d347237a822ad00","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-11T06:34:44.6726+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-11T04:53:13.323972Z","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.463164Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.04253","last_updated":"2023-02-09T23:46:24Z","snapshot_observed_at":"2026-08-04T21:02:22.763754Z","submitted_at":"2020-11-09T08:58:38Z","title":"Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.04253","snapshot_observed_at":"2026-08-11T04:53:13.323972Z","title":"Machinery for proving sum-of-squares lower bounds on certification problems","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.18468","last_updated":"2025-03-31T21:46:05Z","snapshot_observed_at":"2026-08-11T08:48:47.264966Z","submitted_at":"2024-12-24T14:54:23Z","title":"Matrix Chaos Inequalities and Chaos of Combinatorial Type","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T04:53:13.323972Z"},"links":{"cited_paper":"/paper/2011.04253","citing_paper":"/paper/2412.18468"},"observation_digest":"sha256:c91ec3837833bd6e7c4dbd131604784e744c247879c42e584ed03dfab9dc31f1","observation_id":"3d2b2af6-05dd-4ff6-8722-7b02e5a94ed3","resolution":{"observed_at":"2026-08-11T04:53:13.323972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.04253","last_updated":"2023-02-09T23:46:24Z","snapshot_observed_at":"2026-08-04T21:02:22.763754Z","submitted_at":"2020-11-09T08:58:38Z","title":"Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.04253","snapshot_observed_at":"2026-08-07T04:24:26.847273Z","title":"Machinery for proving sum-of-squares lower bounds on certification problems","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.10748","last_updated":"2025-06-12T14:35:26Z","snapshot_observed_at":"2026-08-07T21:46:25.184559Z","submitted_at":"2025-06-12T14:35:26Z","title":"Computational Complexity of Statistics: New Insights from Low-Degree Polynomials","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.847273Z"},"links":{"cited_paper":"/paper/2011.04253","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:f362ce8a892170aeea8b8c917bcc15ffc6cc6af271826f74b294875021b5577e","observation_id":"9c4c5a25-2610-4bda-8713-5f773fbe39a3","resolution":{"observed_at":"2026-08-07T04:24:26.847273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.04253","last_updated":"2023-02-09T23:46:24Z","snapshot_observed_at":"2026-08-04T21:02:22.763754Z","submitted_at":"2020-11-09T08:58:38Z","title":"Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems","version":2},"cited_work":{"arxiv_id":"2011.04253","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.04253","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Machinery for proving sum-of-squares lower bounds on certification problems","venue":null,"work_id":"96c08b07-1843-4b64-af5a-340f34f2636f","year":2011},"citing_paper":{"arxiv_id":"2603.26029","last_updated":"2026-04-04T03:25:38Z","snapshot_observed_at":"2026-08-11T16:06:02.783850Z","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":54,"source":"pdf_text","source_observed_at":"2026-05-14T23:30:25.596266Z"},"links":{"cited_paper":"/paper/2011.04253","citing_paper":"/paper/2603.26029"},"observation_digest":"sha256:bc5f40372c025b7e98aefc1834375e52638981b3cb7c60156af3bbf099c05d50","observation_id":"d0328cee-c60c-4d58-bd0f-e14d81317f25","resolution":{"observed_at":"2026-05-14T23:33:16.467016Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2011.04253","last_updated":"2023-02-09T23:46:24Z","snapshot_observed_at":"2026-08-04T21:02:22.763754Z","submitted_at":"2020-11-09T08:58:38Z","title":"Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems","version":2},"cited_work":{"arxiv_id":"2011.04253","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.04253","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Machinery for proving sum-of-squares lower bounds on certification problems","venue":null,"work_id":"96c08b07-1843-4b64-af5a-340f34f2636f","year":2011},"citing_paper":{"arxiv_id":"2604.27336","last_updated":"2026-04-30T02:30:18Z","snapshot_observed_at":"2026-08-03T16:19:17.136394Z","submitted_at":"2026-04-30T02:30:18Z","title":"Strongly Refuting Random CSP without Literals","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-07T10:23:23.586099Z"},"links":{"cited_paper":"/paper/2011.04253","citing_paper":"/paper/2604.27336"},"observation_digest":"sha256:0903d5c37776cbf23741643b96f38828627ac909dbcad6e7fe3ce149a55bf054","observation_id":"59268deb-1e16-434f-bf39-8606eccced2e","resolution":{"observed_at":"2026-05-12T09:36:26.339220Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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/2011.04253/citation-record","integrity":"/paper/2011.04253/integrity","json":"/paper/2011.04253/citation-record.json","paper":"/paper/2011.04253"},"outbound":[],"paper":{"arxiv_id":"2011.04253","last_updated":"2023-02-09T23:46:24Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-04T21:02:22.763754Z","submitted_at":"2020-11-09T08:58:38Z","title":"Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems"},"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 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2011.04253."}