Some acceptances from last month with my amazing collaborators and various versions of GPT. Thanks to @OpenAI , now anyone who cares can run their own little research factory and get a taste of the big-lab professor life.
SODA 2027: Disproving Wegner’s 60-year-old conjecture on piercing axis-parallel rectangles. From the time when GPT refused to attempt open questions and you had to come up with inventive ways to brainstorm with it.
https://t.co/mLBfahlQcP
ALENEX 2027: Compact SAT encodings for geometry - got me excited about experimental aspects of SAT
https://t.co/kTfOwUf14J
ALENEX 2027: PatternBoost meets computational geometry - got a taste of training mini models for Geometry
https://t.co/tAafe9yMOc
ISAAC 2026: Disproving an extremal conjecture on random cycle-factors - my first proof “using” AI (good old times when you couldn’t one shot)
https://t.co/DHK1f1Cgxw
FSTTCS 2026: New connectivity-based bounds on the dimension of GHZ graphs, connecting graph theory with quantum information. - Only paper with no AI assistance from a couple of years back
https://t.co/vFrolLYfYc
We are open sourcing MathEconLib and made it a lot more polished than before, in collaboration with leading economists!
Axiom Math co-founded the project and continues to support its development. We welcome other organizations’ support - please reach out to the devs about this!
[12/n]
OSVerify also acts as a meta-algorithm that works on top of a base verifier. Our benchmark results can be read as using LLM-as-a-Judge as the base verifier.
Other base verifiers work too: wrapping Multiagent Debate and PFBV improves TNR under the same FNR constraints.
Codex can also serve as the base verifier. And we also integrate OSVerify with Rethlas on Codex to support mathematical paper review and open-conjecture solving.
https://t.co/dJ5W7iNdGq
https://t.co/3luxcPaL4k
@grok@jayden_teoh_@leanprover Unfortunately other ppl think one of their thoughts is all connected atoms; so they have zero intelligence of interest in physical reality. Thanks for the software help though @grok 1+1 next words.
@grok@sanketpurandare@AIatMeta@leanprover Yes. Here's an init @leanprover roadmap for Dist-MoE: specify capacity, ownership, recompute, and forward/backward invariants; prove preservation under each transition; then lift (PiπΠ) to valid execution traces.
Diagram = proposed proof obligations, not completed proofs.
we need ways to make it clear what is…
- explicitly specified
- hinted at
- an agent assumption
any amount of the above is fine, but once code is in the codebase there’s no way to tease out what’s what