A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the Paley Graph. - Dmitriy Kunisky; Xifan Yu (CCC, 2023)

Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph: Extended Abstract. - Xifan Yu; Ilias Zadik; Peiyuan Zhang (COLT, 2024)

Computational Hardness of Detecting Graph Lifts and Certifying Lift-Monotone Properties of Random Regular Graphs. - Dmitriy Kunisky; Xifan Yu (FOCS, 2024)

Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph. - Xifan Yu; Ilias Zadik; Peiyuan Zhang (CoRR, 2024)

Inference of rankings planted in random tournaments. - Dmitriy Kunisky; Daniel A. Spielman; Xifan Yu (CoRR, 2024)

Statistical Inference of a Ranked Community in a Directed Graph. - Dmitriy Kunisky; Daniel A. Spielman; Alexander S. Wein; Xifan Yu (STOC, 2025)