Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1902.07324.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-16T04:19:06.085725Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-05-24T15:09:36.732058Z
0 of 0 outbound references displayed
External citation measurements
No source-named external measurement is stored.
No outbound reference observations are available for this paper version.
Observation 4367c907-ad14-43a7-85e2-e90230e5499e · inbound
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio Computational Hardness of Certifying Bounds on Constrained PCA Problems
Reference 8
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 1b2f9c5c-5f35-44b9-a5ec-179ee60e516e · inbound
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries Computational Hardness of Certifying Bounds on Constrained PCA Problems
Reference 2013
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 9fb2e6eb-8255-4d68-8fb5-58e6cd0c3181 · inbound
On optimal distinguishers for Planted Clique Computational Hardness of Certifying Bounds on Constrained PCA Problems
Reference 2018
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3e3a1c4d-f8ad-409a-860f-754ed419b63b · inbound
Computational lower bounds in latent models: clustering, sparse-clustering, biclustering Computational Hardness of Certifying Bounds on Constrained PCA Problems
Reference 8
Source-reported events for the cited work
Unavailable: canonical work link unavailable.