Paper Citation Record · LEDGER

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

As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 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 7 of 7 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00

measured 7 of 7 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T11:17:19.631111Z

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.

Observation ecb5ddb6-87b0-455b-a01d-2318c70c94d9 · inbound

Sharp Detection Threshold for Correlation among Multiple Unlabeled Gaussian Networks cites this paper.

Sharp Detection Threshold for Correlation among Multiple Unlabeled Gaussian Networks Optimal recovery of correlated Erd\H{o}s-R\'enyi graphs

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-16T11:17:19.631111Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

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.

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-20T06:33:59.587034+00:00.

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-20T06:33:59.587034+00:00.

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.

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.