Search: “Claude 4.5 Opus”

5 stories

Searchkeyword smart Sortlatest hot importance relevance

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

CategoryAll AI research 5 Exploit / PoC 3 Malware 3 AI safety & security 3 AI industry 2 Vulnerability 2 AI tools & infra 1 Model release 1 AI policy 1 Advisory 1 Data breach 1 Policy & legal 1

SeverityAll critical 5 high 2 medium 5 low 0 info 12

Show HN: Pelican-bicycle alternatives (updated for 2026)

Hobbyist benchmark re-runs the pelican-bicycle SVG test on six 2026 frontier models, comparing generation time and API cost per image.

A Show HN post re-runs the classic pelican-bicycle and similar SVG generation tests across six 2026 models: GPT-6 Astra, Claude Fable 5.1, Gemini 3.8 Flash, DeepSeek V4 Pro, Qwen3.8 Max, and Fugu Ultra v2, recording wall-clock time and cost. It also lists 2025 baseline runs with ten models including Claude Sonnet 4.5, GPT-5.2 Pro, and Qwen3-VL-235B-A22B-Thinking. DeepSeek V4 Pro is consistently cheapest ($0.04-$0.10) while Qwen3.8 Max is slowest, taking up to roughly 17 minutes per generation.

Hacker News · securitySep 14, 13:20 UTC · 3d agoAI research HN 24↑ · 4 comments

Google Research Releases ToolGrad: Answer-First Framework Hits 99.8% Pass Rate for Tool-Use Data Generation

Google Research and partners introduce ToolGrad, a verified tool-chain-first data generation framework reaching 99.8% pass rate and boosting Gemma-3-12B to 83.1 on BFCL.

Researchers from Google, the University of Tokyo, RIKEN AIP, and Tohoku University released ToolGrad, which inverts query-first tool-use data generation by executing and verifying API chains before annotating them with user queries. On the ToolBench database of 16,000+ APIs, ToolGrad raised generation pass rate from 63.8% to 99.8% while increasing tool uses per sample from 2.1 to 3.4 and cutting tool-use steps from 34.3 to 20.0. Fine-tuning Gemma-3 at 1B, 4B, and 12B parameters on the 500-sample ToolGrad-500 dataset lifted ToolGrad-12B to 83.1 on the Berkeley Function Calling Leaderboard, near Gemini 2.5 Pro at 83.2 and ahead of GPT-5 at 74.4. Code is Apache-2.0, with the dataset, PyPI package, and models available on Hugging Face.

MarkTechPostSep 11, 06:01 UTC · 6d agoAI research1

Import AI 468: 23 RSI ideas; PostTrainBench+; and how trust and transparency interplay with AI racing

Import AI covers 23 IFP policy ideas for automated AI R&D risks and MIT/Columbia's game theory of AI racing slowdowns.

Think tank IFP published 23 policy recommendations across seven categories to help policymakers address risks from increasingly automated AI R&D. MIT and Columbia researchers released 'Racing to Ruin,' a game theory model showing that coordinated slowdowns between rival AI firms hinge on trust and transparency. The newsletter also links a short story on interacting with powerful AI systems.

Import AIAug 10, 12:32 UTC · Aug 10, 2026AI research1

Verifiable by Construction: Claim-Level Evaluation of Verbatim Citation in Clinical Question Answering

Evaluation of twelve LLMs on 222 clinical questions shows verbatim quotes rarely substantiate claims; claude-opus-5 fully substantiates only 37.1%.

The authors build a standardized harness over four clinical practice guidelines and evaluate twelve LLMs on 222 synthetic clinical questions, measuring citation attachment, verbatim quote production, and claim substantiation. Most models attach verbatim quotes to over 90% of claims from prompting alone, though lightweight models like claude-haiku-4.5 struggle. Quotes frequently fail to substantiate claims: claude-opus-5 quotes 98.0% of claims but fully substantiates only 37.1%, exposing a capability gap for verifiable clinical QA.

arXiv cs.AI / cs.LG / cs.CLSep 14, 17:53 UTC · 2d agoAI research

Playing log(N)-Questions over Wikipedia Abstracts: Communication Efficiency Between Paired Frontier Models

Six frontier models play a two-agent log(N)-Questions game; Claude Opus 5 lags with 28/68 wins while the top five are near-tied.

The study evaluates six frontier models on a two-agent game where a questioner must identify one of N Wikipedia lead paragraphs in exactly log2 N yes/no questions, run over 408 games at $363 total API cost. Claude Opus 5 wins 28 of 68 games versus 45-56 for GLM-5.3, GPT-5.6 Sol, Grok 4.6, Gemini 3.8 Flash, and Kimi K3. Pooled top-five win rates decline with set size (r=-0.973) and fit win = p^(log2 N) with per-round reliability p=0.928, and information per question correlates with win rate at r=+0.88.

arXiv cs.AI / cs.LG / cs.CLSep 16, 17:41 UTC · 20h agoAI research 20 sources