ZeroHour

Search: “schools”

6 stories in the last 30d

Unsolved Problem by Fields Medalist Breached by Two High School Students

Two high school students used Claude Opus 5 and GPT-5.6 Sol to help solve an open Lorentzian polynomials problem, posting a 75-page arXiv proof.

Aayush Bathija and Prince Rohatgi of Oak Park High School, mentored by UCLA postdoc Daniel Soskin, published the 75-page paper 'Bounded Ratios for Lorentzian Polynomials' (arXiv 2609.05341), solving an open problem in Fields Medalist June Huh's Lorentzian polynomial theory. The main structural theorem extends bounded coefficient-ratio characterization from quadratic to arbitrary-degree polynomials via discrete convexity conditions. The students used Claude Opus 5 and GPT-5.6 Sol for exploration and proof ideas but independently verified all arguments; the result follows an open letter from 25 Fields Medalists voicing concerns about AI's impact on mathematical rigor.

Students who use AI generally score worse at school

OECD PISA data from 91 countries shows AI-using students generally score lower, though moderate intentional use plus critical evaluation training can improve outcomes.

PISA 2025 data covering over 760,000 students in 91 countries found that, after adjusting for socioeconomic status, students who never use AI generally outperformed users in science. Effects varied by use type and frequency: task-specific uses like summarizing showed the largest drops, while weekly users of AI for general learning slightly outperformed non-users, especially when trained to critically assess AI output. AI use was higher among advantaged students and varied widely by country, from over 95% in Vietnam to 60% in Japan.

The Verge · AI · 8d agoAI research

Another Blueprint In The Wall: How to Ask Frontier AI Like a Kid?

Six frontier models from OpenAI, Anthropic, xAI, and Google DeepMind converge on one imagined successor architecture when asked under a school-audience framing.

Researchers ran ten independent sessions per model type across six frontier models using a three-stage prompt sequence progressing to a full ASCII backbone architecture. Under school-audience framing, responses repeatedly converged on a shared motif including persistent latent state, adaptive computation, memory, specialist routing, verification, and stopping control, while control runs without the framing produced heterogeneous responses. A GPT-5.6 Sol output closely overlapped an architecture independently sketched by GPT-6 Astra, raising questions about shared design priors or motif propagation between model families. The paper coins 'epistemic jailbreak' for the observed loss of provenance discipline as prompt specificity increases.

Hugging Face daily papersupdated · 4d agofirst · 4d agoAI research 6 sources

Why don't machine learning research agents overfit?

Amazon researchers explain why ML research agents avoid benchmark overfitting, attributing generalization to compressibility of successful strategies.

Amazon Science summarizes the paper "What fits (into few tokens) doesn't overfit: Compression and generalization in ML research agents," which investigates why benchmark hill-climbing loops, whether run by human communities or LLM research agents, do not produce rampant overfitting. The explanation formalizes Occam's razor via a counting argument: successful ML strategies are highly compressible, so short descriptions lack room to memorize benchmark data and must capture real structure. LLM-based agents, being resettable and controllable, allow this hypothesis to be tested empirically.

Claude Fable Solves a Historical Cipher

Bruce Schneier's blog highlights that the Claude Fable AI model solved a historical cipher, demonstrating LLM capabilities in cryptanalysis.

Bruce Schneier's blog post discusses the Claude Fable AI model successfully deciphering a historical cipher. The post frames the result as a notable example of LLMs applied to classical cryptanalysis. The published text provides limited technical detail beyond the headline.

Schneier on Security · 8d agoAI research

🔬“We have foundation models for language, not for physics” — Anima Anandkumar, Bren Professor of Computing

Caltech professor Anima Anandkumar discusses Neural Operators and FourCastNet for physics modeling, arguing inductive biases beat pure token scaling.

Anima Anandkumar, Bren Professor at Caltech and co-founder of Accelerated Understanding, describes Fourier Neural Operators that learn in frequency and spherical-harmonic domains to model weather, fusion, and fluid or heat flow. Her team built FourCastNet 3, a global weather model competitive with physics-based simulations that runs on consumer-grade GPUs. She also introduced TorchLean, a framework for writing PyTorch-style networks inside the Lean proof assistant for formal verification, and was appointed to the United Nations Scientific Advisory Board. She argues physical domains resist scaling due to tiny datasets and context lengths in the hundreds of billions, so progress comes from built-in structure and physical priors.

Latent Space · 21d agoAI research1