Paper Citation Record · LEDGER

A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation

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

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

pith.paper-citation-record.v1
2306.00266 v2

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-21T06:32:19.484+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.352343Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-24T03:48:53.115328Z

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 e2188e29-b7dd-4afd-a27c-316dc27ff8ae · inbound

The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime cites this paper.

The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation

Reference 20

Resolution: verified exact; arxiv_id, observed 2026-05-24T03:48:53.118649Z

Source-reported events for the cited work

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

Observation bd63f753-2941-4e1a-9ecf-07051004b23e · 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 A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation

Reference 20

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1a971f1-dba6-49be-b07a-a32219d2bfd7 · inbound

Sample Complexity of Correlation Detection in the Gaussian Wigner Model cites this paper.

Sample Complexity of Correlation Detection in the Gaussian Wigner Model A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-07T15:45:24.722553Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5cfa173f-d1df-4bec-8eca-f32fcdbcadc6 · 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 A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation

Reference 15

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 769b6a9d-3f63-415a-805a-8466c4ee97a6 · inbound

Chaining 2-FWL GNNs for Combinatorial Graph Alignment cites this paper.

Chaining 2-FWL GNNs for Combinatorial Graph Alignment A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation

Reference 2023

Resolution: unresolved; no resolver link, observed 2026-08-04T12:38:58.891476Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 83ca232b-0700-46fa-9971-b037d68489fd · inbound

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

Attributed Network Alignment: Statistical Limits and Efficient Algorithm A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation

Reference 5

Resolution: metadata mismatch; arxiv_id, observed 2026-05-10T22:05:48.261038Z

Source-reported events for the cited work

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