Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm | Paper Citation Record

Observation d36d7234-796e-4b49-af4f-fc228928a115 · outbound

This paper cites Robust graph matching when nodes are corrupt.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Robust graph matching when nodes are corrupt

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.394421Z

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 127cf646-44c9-4eb6-8de9-f8ce3cd67910 · outbound

This paper cites Graph isomorphism in quasi-polynomial time.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Graph isomorphism in quasi-polynomial time

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.383269Z

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 b7234544-0990-4851-a693-f3c008a2ae17 · outbound

This paper cites Robust linear regression: optimal rates in polynomial time.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Robust linear regression: optimal rates in polynomial time

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.371984Z

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 367b02cf-733f-4fc8-91e9-7838eec1cdad · outbound

This paper cites ( N early) efficient algorithms for the graph matching problem on correlated random graphs.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm ( N early) efficient algorithms for the graph matching problem on correlated random graphs

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.362032Z

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 8b95880f-d27f-494e-87f1-c0ada5e59927 · outbound

This paper cites The dynamics of message passing on dense graphs, with applications to compressed sensing.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm The dynamics of message passing on dense graphs, with applications to compressed sensing

Reference 5

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation db7cc936-3f10-4448-85de-c1c7a25e17db · outbound

This paper cites Berg, Tamara L.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Berg, Tamara L

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.345582Z

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 5bb4fefb-519c-43a7-9d8c-b8a70ce2cb29 · outbound

This paper cites An iterative construction of solutions of the TAP equations for the S herrington- K irkpatrick model.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm An iterative construction of solutions of the TAP equations for the S herrington- K irkpatrick model

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.336596Z

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 fdf74450-66d6-4321-8ec7-b501d2e32515 · outbound

This paper cites Gardner formula for I sing perceptron models at small densities.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Gardner formula for I sing perceptron models at small densities

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.326624Z

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 8a87ce69-974b-4801-9873-8619b14f17b2 · outbound

This paper cites Seedless Graph Matching via Tail of Degree Distribution for Correlated Erdos-Renyi Graphs.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Seedless Graph Matching via Tail of Degree Distribution for Correlated Erdos-Renyi Graphs

Reference 9

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b988063-603c-4dcc-8370-9dc1f0eb438a · outbound

This paper cites Burkard, Eranda Cela, Panos M.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Burkard, Eranda Cela, Panos M

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.316781Z

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 c03d1753-e657-498c-8011-a5ddba6e072a · outbound

This paper cites an unresolved cited work.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Unresolved cited work

Reference 11

Resolution: unresolved; raw_fallback, observed 2026-08-11T10:42:32.307011Z

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 9aae7823-962e-41b3-83e5-fc351b47726e · outbound

This paper cites A computational transition for detecting correlated stochastic block models by low-degree polynomials.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm A computational transition for detecting correlated stochastic block models by low-degree polynomials

Reference 12

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 73c12efa-40c3-4418-8be3-f3488eb34efa · outbound

This paper cites Balanced graph matching.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Balanced graph matching

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.296822Z

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 41a67090-610d-4bf6-9016-412331ea95f3 · outbound

This paper cites Improved achievability and converse bounds for Erd o s-R\' e nyi graph matching.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Improved achievability and converse bounds for Erd o s-R\' e nyi graph matching

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.286891Z

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 ef47fdca-56e6-48a7-9882-2ee7dd32bd46 · outbound

This paper cites Exact alignment recovery for correlated Erd\H{o}s-R\'enyi graphs.

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

Reference 15

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4365cabd-4629-40e8-b22e-42b350d76529 · outbound

This paper cites Vincent Poor.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Vincent Poor

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.276900Z

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 512d0e79-49aa-4a82-a299-e00d961ff590 · outbound

This paper cites Information-theoretically optimal sparse PCA.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Information-theoretically optimal sparse PCA

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.266727Z

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 bb654ef9-6c96-46aa-aad9-b39d53ba3ebb · outbound

This paper cites Detection threshold for correlated Erd o s-R\' e nyi graphs via densest subgraph.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Detection threshold for correlated Erd o s-R\' e nyi graphs via densest subgraph

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.256121Z

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 2bf2b065-5dc8-4715-a126-342379d7de0b · outbound

This paper cites Matching recovery threshold for correlated random graphs.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Matching recovery threshold for correlated random graphs

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.245737Z

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 bd63f753-2941-4e1a-9ecf-07051004b23e · outbound

This paper cites A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation.

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 f3b26bdc-6c26-475a-ba0f-cc9d4def80cb · outbound

This paper cites A polynomial time iterative algorithm for matching G aussian matrices with non-vanishing correlation.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm A polynomial time iterative algorithm for matching G aussian matrices with non-vanishing correlation

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.235851Z

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 c59bb00b-0455-4f28-9bf6-cd16ed8c16c2 · outbound

This paper cites Capacity lower bound for the I sing perceptron.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Capacity lower bound for the I sing perceptron

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.225793Z

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 7fbe8517-0c25-40af-94c6-6414cdedb473 · outbound

This paper cites Efficient random graph matching via degree profiles.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Efficient random graph matching via degree profiles

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.216002Z

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 23c16cd2-c490-4c63-9bd3-d8433cbd5b2e · outbound

This paper cites Efficiently matching random inhomogeneous graphs via degree profiles.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Efficiently matching random inhomogeneous graphs via degree profiles

Reference 24

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49fe9713-c534-49ac-8167-ffc1beeea2bd · outbound

This paper cites Low-degree hardness of detection for correlated Erd o s-R\' e nyi graphs.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Low-degree hardness of detection for correlated Erd o s-R\' e nyi graphs

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.205298Z

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 f8ea1aa2-210c-4862-8c4a-9edd4b667e98 · outbound

This paper cites Robust recovery for stochastic block models.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Robust recovery for stochastic block models

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.195708Z

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 46d8e65d-cd81-4ef3-83ff-4fc23172c171 · outbound

This paper cites Donoho, Arian Maleki, and Andrea Montanari.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Donoho, Arian Maleki, and Andrea Montanari

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.184504Z

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

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

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 90f76dba-7c22-422a-b51d-373ef96e3e67 · outbound

This paper cites Dubhashi and Alessandro Panconesi.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Dubhashi and Alessandro Panconesi

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.173412Z

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 df560357-d607-4c45-972b-d0c24e208769 · outbound

This paper cites The replica-symmetric free energy for I sing spin glasses with orthogonally invariant couplings.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm The replica-symmetric free energy for I sing spin glasses with orthogonally invariant couplings

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.161139Z

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 8bc77694-c071-4303-93b9-2b825ae35b5c · outbound

This paper cites Spectral graph matching and regularized quadratic relaxations I : The G aussian model.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Spectral graph matching and regularized quadratic relaxations I : The G aussian model

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.147790Z

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 c1423119-3d9f-4746-861b-ab8d3f6e64bc · outbound

This paper cites Spectral graph matching and regularized quadratic relaxations II : Erd o s-R\' e nyi graphs and universality.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Spectral graph matching and regularized quadratic relaxations II : Erd o s-R\' e nyi graphs and universality

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.134961Z

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 0cb3f1e3-1706-4d8e-ae76-a80e1d345398 · outbound

This paper cites TAP equations for orthogonally invariant spin glasses at high temperature.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm TAP equations for orthogonally invariant spin glasses at high temperature

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.119788Z

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 7066fc0a-fff4-4c1d-b2bf-1837709f91f1 · outbound

This paper cites Feng, Ramji Venkataramanan, Cynthia Rush, and Richard J.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Feng, Ramji Venkataramanan, Cynthia Rush, and Richard J

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.104719Z

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 7236b0f6-88a2-469c-be85-a21219e64c14 · outbound

This paper cites From tree matching to sparse graph alignment.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm From tree matching to sparse graph alignment

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.092465Z

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 7398f51c-e431-48b0-90b8-ea95c077d128 · outbound

This paper cites Impossibility of partial recovery in the graph alignment problem.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Impossibility of partial recovery in the graph alignment problem

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.078843Z

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 d8bdf62b-2a5f-4daf-9679-1ca0698ecd41 · outbound

This paper cites Correlation detection in trees for planted graph alignment.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Correlation detection in trees for planted graph alignment

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.066407Z

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 bb4e7b82-04d3-4159-a5b6-b45eadcb22ed · outbound

This paper cites Statistical limits of correlation detection in trees.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Statistical limits of correlation detection in trees

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.053140Z

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 b7c27c37-81b0-4bae-895a-96e9c0f0c86a · outbound

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

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime

Reference 39

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 665ff53d-81a7-46d3-ac85-c14880cdf79a · outbound

This paper cites Robust textual inference via graph matching.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Robust textual inference via graph matching

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.041444Z

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 22ff4534-2db8-4a89-80e7-94bdbc2d51d7 · outbound

This paper cites Partial recovery in the graph alignment problem.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Partial recovery in the graph alignment problem

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.029942Z

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 34792c53-2d03-49ab-b330-5190ad526519 · outbound

This paper cites Semidefinite programs simulate approximate message passing robustly.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Semidefinite programs simulate approximate message passing robustly

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.017947Z

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 0d11561e-d917-4da2-99da-7eb503c7618b · outbound

This paper cites Fast, robust approximate message passing.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Fast, robust approximate message passing

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:32.006244Z

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 d2c374e4-5202-4901-8dc2-5e5243add4f6 · outbound

This paper cites Probabilistic graphical models: principles and techniques.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Probabilistic graphical models: principles and techniques

Reference 44

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b88e5b8-d685-426b-ad49-e841ab399a5c · outbound

This paper cites Kothari, Jacob Steinhardt, and David Steurer.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Kothari, Jacob Steinhardt, and David Steurer

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.987235Z

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 f92213d5-583a-4a2d-bd82-85bcfd248fc2 · outbound

This paper cites Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.975355Z

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 498f9a42-064c-48b1-b2cd-1b6992f24201 · outbound

This paper cites an unresolved cited work.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Unresolved cited work

Reference 47

Resolution: unresolved; raw_fallback, observed 2026-08-11T10:42:31.963214Z

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 4309b53e-4b8d-4066-b77e-47403b6be362 · outbound

This paper cites Maximum quadratic assignment problem: Reduction from maximum label cover and lp-based approximation algorithm.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Maximum quadratic assignment problem: Reduction from maximum label cover and lp-based approximation algorithm

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.952841Z

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 87115437-066f-4ae7-82d2-ff7d88524970 · outbound

This paper cites Random graph matching with improved noise robustness.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Random graph matching with improved noise robustness

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.942400Z

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 3f86f7d1-eed9-43e0-88a8-17609896701e · outbound

This paper cites Exact matching of random graphs with constant correlation.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Exact matching of random graphs with constant correlation

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.931834Z

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 f8243079-f685-4309-8966-0d071634619d · outbound

This paper cites an unresolved cited work.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Unresolved cited work

Reference 51

Resolution: unresolved; raw_fallback, observed 2026-08-11T10:42:31.921133Z

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 8d30a639-9113-4399-979a-46cccd0050ae · outbound

This paper cites an unresolved cited work.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Unresolved cited work

Reference 52

Resolution: unresolved; raw_fallback, observed 2026-08-11T10:42:31.910631Z

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 5b3f1e4f-c0bf-446c-836e-3034460b7c6f · outbound

This paper cites an unresolved cited work.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Unresolved cited work

Reference 53

Resolution: unresolved; raw_fallback, observed 2026-08-11T10:42:31.899357Z

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 c8c2b3f4-a705-441b-ab74-561c5b8d8f2f · outbound

This paper cites Graphical models concepts in compressed sensing.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Graphical models concepts in compressed sensing

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.889328Z

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 57082ac7-94d6-428a-a8de-6aa7afd52c8d · outbound

This paper cites Non-negative principal component analysis: Message passing algorithms and sharp asymptotics.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Non-negative principal component analysis: Message passing algorithms and sharp asymptotics

Reference 55

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.877367Z

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 76477e28-310e-4f60-91cf-85b814a5c360 · outbound

This paper cites Semidefinite programs on sparse random graphs and their application to community detection.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Semidefinite programs on sparse random graphs and their application to community detection

Reference 56

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.866831Z

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 86611652-5441-462c-83ef-ff71f7947090 · outbound

This paper cites Seeded graph matching via large neighborhood statistics.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Seeded graph matching via large neighborhood statistics

Reference 57

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.856080Z

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 f5e9f3f0-a834-454c-9978-df4e6638320d · outbound

This paper cites Robust de-anonymization of large sparse datasets.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Robust de-anonymization of large sparse datasets

Reference 58

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.844626Z

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 8eba13df-6f0e-4473-9afa-34c30ebe9ea9 · outbound

This paper cites De-anonymizing social networks.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm De-anonymizing social networks

Reference 59

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.832595Z

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 0d0a4353-191d-44dd-87d6-0464f091867a · outbound

This paper cites Racz and Anirudh Sridhar.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Racz and Anirudh Sridhar

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.820652Z

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 f2215b22-1804-4075-bb38-ea284edbe8b7 · outbound

This paper cites Global alignment of multiple protein interaction networks with application to functional orthology detection.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Global alignment of multiple protein interaction networks with application to functional orthology detection

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.808985Z

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 6743bcc0-06f4-4fa7-9b2a-8014645196bd · outbound

This paper cites Thouless, Philip W.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Thouless, Philip W

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.797628Z

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 9b16f8f5-ad05-4cfa-aa17-387350aa0f69 · outbound

This paper cites High-dimensional probability: An introduction with applications in data science.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm High-dimensional probability: An introduction with applications in data science

Reference 63

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.785729Z

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 9fcfcada-8b8e-4d80-b521-b25c166b4dba · outbound

This paper cites Random graph matching in geometric models: the case of complete graphs.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Random graph matching in geometric models: the case of complete graphs

Reference 64

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.774602Z

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 46fc7c2a-31f8-461e-9276-0a9cc9e9e178 · outbound

This paper cites an unresolved cited work.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Unresolved cited work

Reference 65

Resolution: unresolved; raw_fallback, observed 2026-08-11T10:42:31.764152Z

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 f8711cd9-a3dc-446f-b1c9-42900c24ca69 · outbound

This paper cites an unresolved cited work.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm Unresolved cited work

Reference 66

Resolution: unresolved; raw_fallback, observed 2026-08-11T10:42:31.752994Z

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 322cc067-88bd-4dde-b6be-92e29e8f46d8 · outbound

This paper cites On the performance of percolation graph matching.

Robust Random Graph Matching in Dense Graphs via an Approximate Message Passing Type Algorithm On the performance of percolation graph matching

Reference 67

Resolution: verified fuzzy; raw_fallback, observed 2026-08-11T10:42:31.742649Z

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.

Coverage vector

Reference resolution

Outbound references

Pith citing papers