Pith. sign in

Paper Citation Record · LEDGER

Optimal recovery of correlated Erd\H{o}s-R\'enyi graphs

As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2502.12077.

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

pith.paper-citation-record.v1
2502.12077 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 6 of 6 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00

measured 6 of 6 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-11T10:42:31.381606Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-07-03T16:28:38.795130Z

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 eee1b8ca-32c7-49fb-8982-3b9f9b91bd76 · inbound

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm cites this paper.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Optimal recovery of correlated Erd\H{o}s-R\'enyi graphs

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-11T10:42:31.381606Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-11T10:42:31.381606Z digest=sha256:a54160834566da5f3237ace3d14b82f7ea6a0386f1033b7c1728a2acc8d69458

Observation 440461ef-8e8a-4eac-8ff0-c26411fcaf7a · inbound

Strong Detection Threshold for Correlated Erd\H{o}s-R\'enyi Graphs with Constant Average Degree cites this paper.

Strong Detection Threshold for Correlated Erd\H{o}s-R\'enyi Graphs with Constant Average Degree Optimal recovery of correlated Erd\H{o}s-R\'enyi graphs

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-07T00:59:21.722567Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T00:59:21.722567Z digest=sha256:cafb418807fe562cd6a2e6f137b1a13dd0f8ac150388c1a0bec375ea88e516ef

Observation a8df0591-de15-4741-8783-9d3c0d32b84c · inbound

Attributed Network Alignment: Statistical Limits and Efficient Algorithm cites this paper.

Attributed Network Alignment: Statistical Limits and Efficient Algorithm Optimal recovery of correlated Erd\H{o}s-R\'enyi graphs

Reference 6

Resolution
verified exact
arxiv_id, observed 2026-05-10T22:05:48.284468Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-05-10T20:16:27.446354Z digest=sha256:a490c89cc419da71e25c6c4426d695914baba85a9ec5cea800a8c47530a01acd

Observation 9be7fbd5-1b1c-474d-aae7-0285a5d7d31f · inbound

Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds cites this paper.

Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds Optimal recovery of correlated Erd\H{o}s-R\'enyi graphs

Reference 20

Resolution
verified exact
arxiv_id, observed 2026-07-03T16:28:38.796540Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-06-27T05:46:05.715937Z digest=sha256:335acb44192871ef36e75929dbfba1bed90f1ea2e8ab2ee019e9de6a5a9e25c5

Observation 84ce12f2-562d-45fd-a734-bfd3e599937e · inbound

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests cites this paper.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Optimal recovery of correlated Erd\H{o}s-R\'enyi graphs

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-02T07:56:18.462670Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T07:56:18.462670Z digest=sha256:89f4952cb4fe4ddb600fc0cb9fa6876094504ba98800bedd1cb9797a1197bf76

Observation 1c002b15-579b-4e0f-b441-7203fbb315ab · inbound

Graph alignment in sparse inhomogeneous models via self-overlap cites this paper.

Graph alignment in sparse inhomogeneous models via self-overlap Optimal recovery of correlated Erd\H{o}s-R\'enyi graphs

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-02T00:46:31.455693Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T00:46:31.455693Z digest=sha256:d1876365caee8ff9d9dd6fcae503e9e04f3f5bf3e254ed38c61177f3cbed8d55