Paper Citation Record · LEDGER

On optimal distinguishers for Planted Clique

As of 16 August 2026, this Paper Citation Record lists 8 of 8 outbound references and 1 inbound Pith citation observation for arXiv:2505.01990.

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

pith.paper-citation-record.v1
2505.01990 v2

Coverage vector

measured 8 of 8 reference resolution

Typed states for the displayed outbound observations.

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

measured 9 of 9 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+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-07T04:24:26.769422Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-07T04:24:27.370984Z

Reference resolution

8 of 8 outbound references displayed

verified exact0
verified fuzzy1
unresolved5
parse uncertain0
malformed identifier0
metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

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

This paper cites Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries.

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-16T06:30:59.297886+00:00.

Observation dd8b7f49-7561-4e9a-9050-aa17fe9c8364 · outbound

This paper cites Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent.

On optimal distinguishers for Planted Clique Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-16T04:19:06.092175Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d57676fa-7e69-4cb6-bda0-54e633fc7407 · outbound

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

On optimal distinguishers for Planted Clique Statistical and Computational Limits for Sparse Matrix Detection

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-16T04:19:06.098527Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d91a7084-099d-467c-818c-62a6590f0e47 · outbound

This paper cites Large cliques elude the Metropolis process.

On optimal distinguishers for Planted Clique Large cliques elude the Metropolis process

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-16T04:19:06.104147Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a1ea5637-edcc-4612-a478-b901a31302d4 · outbound

This paper cites Tensor SVD: Statistical and computational limits.

On optimal distinguishers for Planted Clique Tensor SVD: Statistical and computational limits

Reference 1982

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T04:19:06.413019Z

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 9fb2e6eb-8255-4d68-8fb5-58e6cd0c3181 · outbound

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

On optimal distinguishers for Planted Clique Computational Hardness of Certifying Bounds on Constrained PCA Problems

Reference 2018

Resolution: unresolved; no resolver link, observed 2026-08-16T04:19:06.085725Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a96ce5d7-0760-4183-aab3-dc75293c1bb6 · outbound

This paper cites Lifting Sum-of-Squares Lower Bounds: Degree-$2$ to Degree-$4$.

On optimal distinguishers for Planted Clique Lifting Sum-of-Squares Lower Bounds: Degree-$2$ to Degree-$4$

Reference 2019

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

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 3a65c40f-2ac0-49a3-8d9d-1963c36c8b00 · outbound

This paper cites Precise Error Rates for Computationally Efficient Testing.

On optimal distinguishers for Planted Clique Precise Error Rates for Computationally Efficient Testing

Reference 2023

Resolution: unresolved; no resolver link, observed 2026-08-16T04:19:06.115920Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation 0bc14466-8979-4a90-95c0-71bd3008e608 · inbound

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials cites this paper.

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials On optimal distinguishers for Planted Clique

Reference 42

Resolution: verified exact; local_arxiv, observed 2026-08-07T04:24:27.443334Z

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.