Paper Citation Record · LEDGER

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries

As of 17 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 1 inbound Pith citation observation for arXiv:1908.06130.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1908.06130 v2

Coverage vector

measured 27 of 27 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T14:28:57.021958Z

measured 28 of 28 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T04:19:06.079763Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-16T04:19:06.390370Z

Reference resolution

27 of 27 outbound references displayed

verified exact3
verified fuzzy11
unresolved13
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 5c171f14-3e69-4a75-a8ff-df8ead50a2dd · outbound

This paper cites A nearly tight sum-of-squares lower bound for the planted clique problem.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries A nearly tight sum-of-squares lower bound for the planted clique problem

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:28:57.509081Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 938d010d-2033-4a50-8713-d9ebefbb3c6b · outbound

This paper cites Statistical and Computational Limits for Sparse Matrix Detection.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Statistical and Computational Limits for Sparse Matrix Detection

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-14T14:28:56.919264Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dbf8514b-7418-4717-99da-74d484a7109b · outbound

This paper cites Robust estimators in high dimensions wit hout the computational intractability.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Robust estimators in high dimensions wit hout the computational intractability

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:28:57.489920Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 2934223e-0124-41de-894c-adf03fb89a56 · outbound

This paper cites Statistical query lower bounds for robust estimation of high-dimensional gaussians and gaussian mixtures.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Statistical query lower bounds for robust estimation of high-dimensional gaussians and gaussian mixtures

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:28:57.469138Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 32bcf4e4-4d0c-4b3f-a7bc-e49c479a66cc · outbound

This paper cites The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-14T14:28:56.944993Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 16c37653-332d-4d75-bd5c-493fa7afe735 · outbound

This paper cites How Hard Is Robust Mean Estimation?.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries How Hard Is Robust Mean Estimation?

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-14T14:28:56.950246Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af2c235a-4aaa-4fd2-963d-5855296c155e · outbound

This paper cites Eﬃcient bayesian estimation from few samples: community detection and related problems.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Eﬃcient bayesian estimation from few samples: community detection and related problems

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:28:57.431878Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation e154c9ff-c0c2-469e-aa2e-4755b5a08c6a · outbound

This paper cites How to play unique games against a semi-random adversary: Study of semi-rando m models of unique games.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries How to play unique games against a semi-random adversary: Study of semi-rando m models of unique games

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:28:57.405382Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 3c60013e-eb8e-4d15-bd24-6bcba2d9e495 · outbound

This paper cites Sum of squares lower bounds for refuting any CSP.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Sum of squares lower bounds for refuting any CSP

Reference 19

Resolution: verified exact; local_arxiv, observed 2026-08-14T14:28:57.107811Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 891fe294-27c4-41e8-8af7-e7e29c46ae65 · outbound

This paper cites Phase transitions and optimal algorithms in high-dimensional Gaussian mixture clustering.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Phase transitions and optimal algorithms in high-dimensional Gaussian mixture clustering

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:28:57.387726Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation cc9ed51f-67c1-4ab2-b615-95b60ddec415 · outbound

This paper cites Agnosti c estimation of mean and covariance.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Agnosti c estimation of mean and covariance

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:28:57.351347Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 2143e6d5-db29-4e1d-be0d-8979b62a5746 · outbound

This paper cites Mathematics and the picturing of data.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Mathematics and the picturing of data

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:28:57.333083Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 7836d4f8-a673-4243-8820-95ad1ca817cb · outbound

This paper cites Detection a nd feature selection in sparse mixture models.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Detection a nd feature selection in sparse mixture models

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:28:57.316270Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 7f8c407f-d7bd-4c1d-87a7-1a295f233ebe · outbound

This paper cites Efficient Algorithms for Outlier-Robust Regression.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Efficient Algorithms for Outlier-Robust Regression

Reference 1977

Resolution: unresolved; no resolver link, observed 2026-08-14T14:28:56.963628Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3bcc0aec-943a-4798-8154-69ea792b0573 · outbound

This paper cites Robust Sparse Estimation Tasks in High Dimensions.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Robust Sparse Estimation Tasks in High Dimensions

Reference 1986

Resolution: unresolved; no resolver link, observed 2026-08-14T14:28:56.987677Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 018456fe-a567-4664-acc3-57f82a830fb9 · outbound

This paper cites Mmse of probabilistic low- rank matrix estimation: Universality with respect to the ou tput channel.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Mmse of probabilistic low- rank matrix estimation: Universality with respect to the ou tput channel

Reference 1992

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:28:57.368135Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 48ddfe19-7e62-44d0-af97-5cbceb3e737a · outbound

This paper cites Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program

Reference 1997

Resolution: unresolved; no resolver link, observed 2026-08-14T14:28:57.004447Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ca5a461-20f0-4706-beeb-543ab3c69d80 · outbound

This paper cites Curse of Heterogeneity: Computational Barriers in Sparse Mixture Models and Phase Retrieval.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Curse of Heterogeneity: Computational Barriers in Sparse Mixture Models and Phase Retrieval

Reference 2001

Resolution: unresolved; no resolver link, observed 2026-08-14T14:28:56.934443Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8dc20147-d715-40bd-b6f4-39f52dacc2ee · outbound

This paper cites Sparse cc a: Adaptive estimation and computational barriers.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Sparse cc a: Adaptive estimation and computational barriers

Reference 2010

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T14:28:57.451965Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation 3f273233-c5a7-4dce-b657-13b242af0e3e · outbound

This paper cites Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness

Reference 2011

Resolution: unresolved; no resolver link, observed 2026-08-14T14:28:56.879955Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1b2f9c5c-5f35-44b9-a5ec-179ee60e516e · outbound

This paper cites Computational Hardness of Certifying Bounds on Constrained PCA Problems.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Computational Hardness of Certifying Bounds on Constrained PCA Problems

Reference 2013

Resolution: unresolved; no resolver link, observed 2026-08-14T14:28:56.903219Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9a3c46b2-507c-4136-85dd-369b27cf26a6 · outbound

This paper cites Algorit hmic barriers from phase transi- tions.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Algorit hmic barriers from phase transi- tions

Reference 2014

Resolution: unresolved; no resolver link, observed 2026-08-14T14:28:56.874288Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4b3bd3e1-858a-430d-8983-7724fc1ad705 · outbound

This paper cites Computational and Statistical Boundaries for Submatrix Localization in a Large Noisy Matrix.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Computational and Statistical Boundaries for Submatrix Localization in a Large Noisy Matrix

Reference 2015

Resolution: verified exact; local_arxiv, observed 2026-08-14T14:28:57.214203Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Observation e8856904-c242-48a4-bc00-06fc7874ac7b · outbound

This paper cites Statistical and com- putational trade-oﬀs in estimation of sparse principal comp onents.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Statistical and com- putational trade-oﬀs in estimation of sparse principal comp onents

Reference 2016

Resolution: unresolved; no resolver link, observed 2026-08-14T14:28:57.021958Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 314bf52f-a548-4181-8765-e547005a49ea · outbound

This paper cites Algorithmic thresholds for tensor PCA.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Algorithmic thresholds for tensor PCA

Reference 2017

Resolution: unresolved; no resolver link, observed 2026-08-14T14:28:56.892130Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7d6b4a0b-8380-451a-bb8a-0d7b6a3e624a · outbound

This paper cites Universality of Computational Lower Bounds for Submatrix Detection.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Universality of Computational Lower Bounds for Submatrix Detection

Reference 2018

Resolution: unresolved; no resolver link, observed 2026-08-14T14:28:56.886555Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ea6833bc-e83e-435b-86a6-22bf5eb2874d · outbound

This paper cites The landscape of the spiked tensor model.

Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries The landscape of the spiked tensor model

Reference 2019

Resolution: verified exact; local_arxiv, observed 2026-08-14T14:28:57.237078Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

Pith citing papers

Observation ba456929-224c-425b-ba5e-ea3aae6d2e8d · inbound

On optimal distinguishers for Planted Clique cites this paper.

On optimal distinguishers for Planted Clique Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries

Reference 1

Resolution: metadata mismatch; local_arxiv, observed 2026-08-16T04:19:06.395889Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.