Yan Zhong

Research Intern @AIatMeta | CS theory PhD student @JohnsHopkins | Previously undergrad @HKUniversity

[Binghui Peng @binghuip]

[1/n] Recent OpenAI research has demonstrated the ability of LLMs to solve frontier problems in mathematics. We design a simple pipeline (using GPT 5.5 Pro and Claude Opus 4.8) that resolves 9 challenging open problems, including open problems from prominent theoretical computer science venues—4 from COLT open problem list and 1 from FOCS —as well as 4 problems from the commutative algebra.

Project link: https://t.co/YCBzYjfz3N, joint work with @runzhou_tao, Steven Wang & @HantaoYu_Theory

[Paul Graham @paulg]

You are far more dangerous to your startup than competitors are. A hundred times more startups die from poor execution by their founders than are killed by competitors.

[Hongxun Wu @HongxunWu]

🧵(1/8) An @OpenAI internal reasoning LLM achieved an AI Math milestone: solving an open problem central to its mathematical subfield— in this case, the unit distance problem of discrete geometry.

We came across it in a side quest to truly push our model on the hardest problems.

[Lijie Chen @wjmzbmr1]

1/ Today, an internal @OpenAI model has refuted Erdős’s unit distance conjecture — a research result that one could recommend “acceptance without any hesitation” to the Annals of Mathematics, one of the most prestigious journals in mathematics.

We came across it in a side quest to push our model on the hardest problems.

[Association for Computing Machinery @TheOfficialACM]

Congratulations to Charles H. Bennett (@IBMResearch) and Gilles Brassard ( @UMontreal) on receiving the 2025 ACM A.M. Turing Award!

🔗: https://t.co/UQ5C1K1kVT

[Yang Liu @yangpliu]

My thoughts on #1stProof Problem 6 (closely related to areas I've worked in): OpenAI’s solution is essentially correct, and the difficulty feels consistent with AI capabilities over the past several months. More detail in the thread.

[Hanlin Ren @dfc7027894e168c]

Ads: I'll talk about my new work on 𝐩𝐫𝐨𝐨𝐟 𝐜𝐨𝐦𝐩𝐥𝐞𝐱𝐢𝐭𝐲 𝐠𝐞𝐧𝐞𝐫𝐚𝐭𝐨𝐫𝐬 and hardness of 𝐫𝐚𝐧𝐠𝐞 𝐚𝐯𝐨𝐢𝐝𝐚𝐧𝐜𝐞 in Prague logic seminar on Jan 5, 2026! Everyone is welcome. 🤩
ECCC: https://t.co/LnW5CWYcq2
Joint work w/ Yichuan Wang and @daisy34036669

[fly51fly @fly51fly]

[LG] Reinforced Generation of Combinatorial Structures: Applications to Complexity Theory
A Nagda, P Raghavan, A Thakurta [UC Berkeley & Google & Google DeepMind] (2025)
https://t.co/mKOEcGPccS

[ACM SIGACT @sigact]

Congratulations to Eshan Chattopadhyay and David Zuckerman, winners of the 2025 Gödel Prize for “Explicit two-source extractors and resilient functions”, STOC 2016 and Annals of Mathematics 2019
https://t.co/o1XjP8c6Ou

[Simons Institute for the Theory of Computing @SimonsInstitute]

In our February newsletter, Senior Scientist Nikhil Srivastava explored two recent results that have revolutionized our understanding of the sparse yet highly connected graphs known as expanders.

https://t.co/YEJmsbFaQx

[Online Parallels (@onlineparallels.bsky.social) @onlineparallels]

Are you interested in learning about an #ITCS25 paper online? Are you interested in presenting a paper online so that other people could learn it? Please consider registering at: https://t.co/DZVLfdgrIw
#OnlineParallels

[TCS+ @TCS_plus]

📢 Next week (Wed 05/29) at 10am PT/1pm ET, Jyun-Jie Liao, from @Cornell will give us a survey on the Polynomial Freiman-Ruzsa (PFR) conjecture! This is the last talk of the TCS+ season... hoping to see many of you online!

Register: https://t.co/Ij25oPCdIL

[TCS blog aggregator @cstheory]

TR23-058 | Explicit Directional Affine Extractors and Improved Hardness for Linear Branching Programs |

Xin Li,

Yan Zhong https://t.co/t5d8yfpfzd