Search: “US high school”

4 stories

Searchkeyword smart Sortlatest hot importance relevance

DomainAll Cyber AIWindow24h 3d 7d 30d AllIn the wild Important only Show duplicates

CategoryAll Ransomware 163 Policy & legal 92 Malware 88 Vulnerability 79 Industry 65 Exploit / PoC 56 Data breach 52 Phishing & fraud 43 Threat actor 33 Research 18 AI industry 13 AI safety & security 5 AI research 4 AI policy 3

SeverityAll critical 268 high 175 medium 91 low 159 info 29

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.

Hacker News · securitySep 14, 12:23 UTC · 3d agoAI research HN 22↑ · 19 comments

WiCyS: A champion for a more diverse cybersecurity workforce

Help Net SecurityApr 8, 00:00 UTC · Apr 8, 2024AI research

Exclusive: Axon still wants to put Taser drones in your kid’s school

The RecordFeb 3, 00:00 UTC · Feb 3, 2023AI research

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.

Hacker News · securitySep 14, 16:32 UTC · 2d agoAI research HN 21↑ · 3 comments