Pith. sign in

Paper Citation Record · LEDGER

Statistical and Computational Limits for Sparse Matrix Detection

As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:1801.00518.

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

pith.paper-citation-record.v1
1801.00518 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 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 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

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

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-02T05:56:40.067406Z

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 938d010d-2033-4a50-8713-d9ebefbb3c6b · inbound

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

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.

source=pdf_text observed=2026-08-14T14:28:56.919264Z digest=sha256:2d88aacb6b320dc730a9e1f87529eb67125e9bffff059d7b997799b126fdac31

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

On optimal distinguishers for Planted Clique cites this paper.

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.

source=pdf_text observed=2026-08-16T04:19:06.098527Z digest=sha256:023c72db6f08003e93442ade77f29c6173f497ea2c031d09c4ca1ed3c598ccb3

Observation c4cf03c4-0969-42a9-a74b-ce2bfbf1e951 · inbound

Recovery of Planted Subgraphs cites this paper.

Recovery of Planted Subgraphs Statistical and Computational Limits for Sparse Matrix Detection

Reference 223

Resolution
metadata mismatch
local_arxiv, observed 2026-07-02T05:56:40.068941Z

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.

source=arxiv_source observed=2026-07-02T05:49:41.894386Z digest=sha256:e8726a7799d21846858531b1795cb6bfeb93314898cb631d1958ad52ca9a302f

Observation 14fed112-db0c-41bc-b3d5-e032eaeb6bcd · inbound

Fundamental Limits of Query-Based Subgraph Detection cites this paper.

Fundamental Limits of Query-Based Subgraph Detection Statistical and Computational Limits for Sparse Matrix Detection

Reference 225

Resolution
unresolved
no resolver link, observed 2026-08-01T19:10:36.525901Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T19:10:36.525901Z digest=sha256:88decd48cf52f91b1743744b359e58b5329972d805532d711d96ca655c0ee1a1