Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests | Paper Citation Record

Observation e5f3b417-daa4-4257-9615-99b6b071e48b · outbound

This paper cites De-anonymizing social networks,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests De-anonymizing social networks,

Reference 1

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bc37eb1d-f9d9-49d1-9318-cbb23ae5251c · outbound

This paper cites An efficient reconciliation algorithm for social networks,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests An efficient reconciliation algorithm for social networks,

Reference 2

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d801082d-bada-42ee-9e94-1f5566b50069 · outbound

This paper cites Pairwise global alignment of protein interaction networks by matching neighborhood topology,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Pairwise global alignment of protein interaction networks by matching neighborhood topology,

Reference 3

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b8f89b6-1b33-453b-9585-2c3ea917edf9 · outbound

This paper cites Progressive graph matching: Making a move of graphs via probabilistic voting,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Progressive graph matching: Making a move of graphs via probabilistic voting,

Reference 4

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08bb18f6-5802-49c0-aa0c-873663c51563 · outbound

This paper cites Robust textual inference via graph matching,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Robust textual inference via graph matching,

Reference 5

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 03c16b35-7d61-49af-b8a4-119780e4ced3 · outbound

This paper cites The quadratic assignment problem,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests The quadratic assignment problem,

Reference 6

Resolution: verified exact; doi, observed 2026-08-02T07:58:29.262262Z

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 17505f54-222e-480e-aa07-1d812e733860 · outbound

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

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Maximum quadratic assignment problem: Reduction from maximum label cover and lp-based approximation algorithm,

Reference 7

Resolution: verified exact; doi, observed 2026-08-02T07:58:29.113125Z

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 982e3f7c-3113-4703-bbba-7225fd96af5e · outbound

This paper cites On the privacy of anonymized networks,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests On the privacy of anonymized networks,

Reference 8

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8455f296-f770-48e4-aeca-264a8eb47c39 · outbound

This paper cites Random graph matching at otter’s threshold via counting chandeliers,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Random graph matching at otter’s threshold via counting chandeliers,

Reference 9

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c3be59a-1828-48ad-8120-4b16f007d22a · outbound

This paper cites Settling the sharp reconstruction thresholds of random graph matching,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Settling the sharp reconstruction thresholds of random graph matching,

Reference 10

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b111a1a2-a7cb-4cf0-989b-68971644331c · outbound

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

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Correlation detection in trees for planted graph alignment,

Reference 11

Resolution: verified exact; doi, observed 2026-08-02T07:58:28.994099Z

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 10003e26-77a9-4b2e-af5e-7d968cb793ee · outbound

This paper cites The number of trees,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests The number of trees,

Reference 12

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f4ce5f86-61b4-4e53-977a-268b24ba7da0 · outbound

This paper cites Improved achievability and converse bounds for erd ˝os-r´enyi graph matching,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Improved achievability and converse bounds for erd ˝os-r´enyi graph matching,

Reference 13

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e1d8e88e-ddce-448c-8728-00ee11645fe5 · outbound

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

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

Reference 14

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c601ef9a-401d-452b-b44c-97992b12036e · outbound

This paper cites Partial recovery of Erd˝os-R´enyi graph alignment viak-core alignment,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Partial recovery of Erd˝os-R´enyi graph alignment viak-core alignment,

Reference 15

Resolution: verified exact; doi, observed 2026-08-02T07:58:28.889686Z

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 73f0b6f3-9caa-4789-9bce-d59387ed5205 · outbound

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

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Impossibility of partial recovery in the graph alignment problem,

Reference 16

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a60f4bd4-80ef-49de-8d80-50bc531ad85d · outbound

This paper cites Partial recovery in the graph alignment problem,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Partial recovery in the graph alignment problem,

Reference 17

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 76f74ad3-6b45-4999-ba1a-71c4ded8c6fa · outbound

This paper cites Matching recovery threshold for correlated random graphs,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Matching recovery threshold for correlated random graphs,

Reference 18

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

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

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

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 c1f24308-796c-4091-b257-ba19d350e7de · outbound

This paper cites Analysis of a canonical labeling algorithm for the alignment of correlated erdos-r ´enyi graphs,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Analysis of a canonical labeling algorithm for the alignment of correlated erdos-r ´enyi graphs,

Reference 20

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bf68ded1-f7bf-4ec4-afd5-2a22edf16c11 · outbound

This paper cites Efficient random graph matching via degree profiles,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Efficient random graph matching via degree profiles,

Reference 21

Resolution: verified exact; doi, observed 2026-08-02T07:58:28.701100Z

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 69cf79a3-8101-49ec-b102-aebe00c63272 · outbound

This paper cites Spectral graph matching and regularized quadratic relaxations i algorithm and gaussian analysis,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Spectral graph matching and regularized quadratic relaxations i algorithm and gaussian analysis,

Reference 22

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b2f66354-ba3a-4541-98a1-00b171787dbe · outbound

This paper cites Spectral graph matching and regularized quadratic relaxations II: Erd ˝os-R´enyi graphs and universality,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Spectral graph matching and regularized quadratic relaxations II: Erd ˝os-R´enyi graphs and universality,

Reference 23

Resolution: verified exact; doi, observed 2026-08-02T07:58:28.542966Z

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 47cd1b38-f5f8-4003-97aa-401271510ff5 · outbound

This paper cites From tree matching to sparse graph alignment,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests From tree matching to sparse graph alignment,

Reference 24

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 42edbc54-1291-40a2-b98a-86c9c39870a5 · outbound

This paper cites Asymmetric graph alignment and the phase transition for asymmetric tree correlation testing,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Asymmetric graph alignment and the phase transition for asymmetric tree correlation testing,

Reference 25

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 31367a33-fdc9-4750-81d3-dc0a9b7977d5 · outbound

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

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Exact matching of random graphs with constant correlation,

Reference 26

Resolution: verified exact; doi, observed 2026-08-02T07:58:28.413094Z

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 56d17d24-0558-4a78-bc7b-0749737b9205 · outbound

This paper cites Random graph matching with improved noise robustness,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Random graph matching with improved noise robustness,

Reference 27

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56028ec9-8ea7-411f-bebf-69661786fce7 · outbound

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

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests A polynomial-time iterative algorithm for random graph matching with nonvanishing correlation,

Reference 28

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 458d60f3-87be-4ce2-8e1b-a2326c3caac6 · outbound

This paper cites Statistical limits of correlation detection in trees,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Statistical limits of correlation detection in trees,

Reference 29

Resolution: verified exact; doi, observed 2026-08-02T07:58:28.299333Z

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 22c7d827-55ee-4a3d-af5a-44588c9d1fa6 · outbound

This paper cites Algorithmic contiguity from low-degree conjecture and applications in correlated random graphs,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Algorithmic contiguity from low-degree conjecture and applications in correlated random graphs,

Reference 30

Resolution: verified exact; doi, observed 2026-08-02T07:58:28.185219Z

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 13051f0b-3bd3-4e76-a8dc-4e1b63a96dbe · outbound

This paper cites Correlated stochastic block models: Exact graph matching with applications to recovering communities,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Correlated stochastic block models: Exact graph matching with applications to recovering communities,

Reference 31

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1d6c0f50-2bc5-4678-a187-9371c0dd6139 · outbound

This paper cites Efficient graph matching for correlated stochastic block models,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Efficient graph matching for correlated stochastic block models,

Reference 32

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9032bae3-d100-4c15-aa31-dc3e015c746d · outbound

This paper cites Efficient algorithms for exact graph matching on correlated stochastic block models with constant correlation,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Efficient algorithms for exact graph matching on correlated stochastic block models with constant correlation,

Reference 33

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b46fd6fd-9aeb-4308-8d61-f94cab89b11d · outbound

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

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Random graph matching in geometric models: the case of complete graphs,

Reference 34

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e81e48be-0f5f-4c25-97e8-78f6f132a53a · outbound

This paper cites Attributed graph alignment,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Attributed graph alignment,

Reference 35

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b97c776c-d993-47bb-bb78-900c1382db2b · outbound

This paper cites On the feasible region of efficient algorithms for attributed graph alignment,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests On the feasible region of efficient algorithms for attributed graph alignment,

Reference 36

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d0b9dcee-dd8d-4296-8ed4-315013d7b020 · outbound

This paper cites Efficient algorithms for attributed graph alignment with vanishing edge correlation,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Efficient algorithms for attributed graph alignment with vanishing edge correlation,

Reference 37

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ff7ab2f-ce9c-4522-8eef-ad489fbaeac7 · outbound

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

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Attributed Network Alignment: Statistical Limits and Efficient Algorithm

Reference 38

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a78b2bfd-a883-41dd-a7e6-1c6992acd402 · outbound

This paper cites Exact random graph matching with multiple graphs,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Exact random graph matching with multiple graphs,

Reference 39

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dafaa73d-286c-451f-8ece-b901c18d0e2e · outbound

This paper cites Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery

Reference 40

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ceab866f-a0a3-44ef-90ad-e9298d7b157c · outbound

This paper cites Diffusion-network alignment: An efficient algorithm and explicit probability bounds,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Diffusion-network alignment: An efficient algorithm and explicit probability bounds,

Reference 41

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4502d20-f472-4281-a38a-8b1a52e17e9c · outbound

This paper cites On the information-theoretic limit of subgraph alignment,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests On the information-theoretic limit of subgraph alignment,

Reference 42

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8726c941-0b5c-4a15-a37d-4bd23a92ffcb · outbound

This paper cites an unresolved cited work.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Unresolved cited work

Reference 43

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6c3fc493-739b-4653-a4c5-6bc6449c1995 · outbound

This paper cites an unresolved cited work.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Unresolved cited work

Reference 44

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1394cd90-464d-4ff6-8e1e-380bbf679af2 · outbound

This paper cites an unresolved cited work.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Unresolved cited work

Reference 45

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ac99ccf-6109-40ad-a892-40774ba65e3e · outbound

This paper cites The poisson approximation to the poisson binomial distribution,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests The poisson approximation to the poisson binomial distribution,

Reference 46

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e74b6147-a273-4223-ac47-448d5bcd03a5 · outbound

This paper cites Probability inequalities for the sum of independent random variables,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Probability inequalities for the sum of independent random variables,

Reference 47

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1abd0fe7-a4c5-434a-8b5d-590c260c03c2 · outbound

This paper cites Mitzenmacher and E.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Mitzenmacher and E

Reference 48

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 183e62bd-141b-4bcb-930a-7cb391f7c6aa · outbound

This paper cites In particular, ¯dis given by ¯d=   max   k0 −1, 3 log s2 COtter !2 , 2 log s2 COtter 2C6 + log 2s2 C5      , wherek 0 andC 5 are constants indicated by Lemma 6.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests In particular, ¯dis given by ¯d=   max   k0 −1, 3 log s2 COtter !2 , 2 log s2 COtter 2C6 + log 2s2 C5      , wherek 0 andC 5 are constants indicated by Lemma 6

Reference 50

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 36587d5e-7e29-44a7-a299-e5421aed3162 · outbound

This paper cites , y(t) i )inGfromutox i withy (0) i =u,y (1) i =u i,y (t) i =x i, and t≤d+ 1,.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests , y(t) i )inGfromutox i withy (0) i =u,y (1) i =u i,y (t) i =x i, and t≤d+ 1,

Reference 51

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1f440e3f-3fbc-42db-9a7f-b3f942b74a59 · outbound

This paper cites ,˜z(˜t) i )in ˜Gfrom˜vtox i with˜z(0) i = ˜v,˜z(1) i = ˜vi,˜z(˜t) i =x i, and ˜t≤d+ 1.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests ,˜z(˜t) i )in ˜Gfrom˜vtox i with˜z(0) i = ˜v,˜z(1) i = ˜vi,˜z(˜t) i =x i, and ˜t≤d+ 1

Reference 52

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aabfd762-6d96-4de3-91be-014865215be4 · outbound

This paper cites Coupling(T k, ˜Tk)with(H k, ˜Hk)givenℓ(T k−1, ˜Tk−1) = (Hk−1, ˜Hk−1): For each depthk≥ 1, we recursively define three sets of vertices:COM k,EXC k, and gEXCk.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Coupling(T k, ˜Tk)with(H k, ˜Hk)givenℓ(T k−1, ˜Tk−1) = (Hk−1, ˜Hk−1): For each depthk≥ 1, we recursively define three sets of vertices:COM k,EXC k, and gEXCk

Reference 53

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9750d2fd-f50a-4b2b-b050-3768a0bd18d5 · outbound

This paper cites an unresolved cited work.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Unresolved cited work

Reference 54

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0bdec016-5649-41c9-bc89-d0da8da65d8d · outbound

This paper cites an unresolved cited work.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Unresolved cited work

Reference 55

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation de9ba951-2ac8-457a-baed-899806ef35ee · outbound

This paper cites an unresolved cited work.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Unresolved cited work

Reference 56

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d10a48d3-5014-4d05-8a32-a349d52476bc · outbound

This paper cites Available: https://doi.org/10.1007/s10208-022-09570-y.

Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests Available: https://doi.org/10.1007/s10208-022-09570-y

Reference 2023

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers