Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems
As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2011.04253.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-11T04:53:13.323972Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-14T23:33:16.463164Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation 3d2b2af6-05dd-4ff6-8722-7b02e5a94ed3 · inbound
Matrix Chaos Inequalities and Chaos of Combinatorial Type cites this paper.
Matrix Chaos Inequalities and Chaos of Combinatorial Type Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems
Reference 31
- Resolution
- unresolved
- no resolver link, observed 2026-08-11T04:53:13.323972Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 9c4c5a25-2610-4bda-8713-5f773fbe39a3 · inbound
Computational Complexity of Statistics: New Insights from Low-Degree Polynomials cites this paper.
Computational Complexity of Statistics: New Insights from Low-Degree Polynomials Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems
Reference 43
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T04:24:26.847273Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d0328cee-c60c-4d58-bd0f-e14d81317f25 · inbound
Detection Is Harder Than Estimation in Certain Regimes: Inference for Moment and Cumulant Tensors cites this paper.
Detection Is Harder Than Estimation in Certain Regimes: Inference for Moment and Cumulant Tensors Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems
Reference 54
- Resolution
- verified exact
- arxiv_id, observed 2026-05-14T23:33:16.467016Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.
Observation 59268deb-1e16-434f-bf39-8606eccced2e · inbound
Strongly Refuting Random CSP without Literals cites this paper.
Strongly Refuting Random CSP without Literals Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems
Reference 1
- Resolution
- metadata mismatch
- arxiv_id, observed 2026-05-12T09:36:26.339220Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.