Search: “digit-5”

Agility Robotics says its new Digit 5 robot can work next to people without safety fences

Agility Robotics unveiled Digit 5, a humanoid warehouse robot that can work safely alongside people without fences, with deliveries from early 2027.

Agility Robotics announced Digit 5, a humanoid robot for warehouses and factories that uses AI and sensors to detect people and stop or step aside without safety fences. It lifts up to 22.7 kg (40% more than Digit 4), charges in 9 minutes for 90 minutes of runtime, and is the first partner for Nvidia's Halos robotics safety platform. Agility cites over $300 million in orders, with first deliveries in early 2027 and production capacity of up to 10,000 units per year in Salem, Oregon.

The Decoder·Sep 15, 12:57 UTC · 2d agoAI industry

Agility’s new humanoid robot will stop, squat to avoid harming human coworkers

Agility Robotics unveils Digit 5 humanoid robot that autonomously stops, moves, or squats to avoid harming nearby human coworkers.

Agility Robotics announced Digit 5, its first humanoid robot designed to work safely near humans without isolation barriers, using a safe motion system that reacts to detected human presence by moving away, standing still, or squatting. Early access begins in H1 2027 with general availability by end of 2027. Previous Digit versions have logged over 65,000 working hours, with customers including GXO, Schaeffler, Amazon, and Toyota Motor Manufacturing Canada.

Ars Technica · AI·Sep 15, 18:33 UTC · 1d agoAI industry

Claude Fable 5.1 Solves the Cyphral Distich, a 370-year-old cipher

Claude Fable 5.1 solved Sir Thomas Urquhart's 370-year-old Cyphral Distich cipher, recovering a hidden royalist prayer for Charles II.

Vals AI reports that Claude Fable 5.1 solved the Cyphral Distich, a 64-number cryptogram from Sir Thomas Urquhart's Logopandecteision unsolved since 1653, in 44 minutes using 176k tokens with no human hints. The key insight was that the cipher's key was the book itself: each number indexes a word in the corresponding Proquiritation, taking the first letter, yielding 'O GOD UPHOLD KING CHARLS THE SECOND AND MAKE HIM THE SUPREME RULER OF THIS LAND'. The model also deciphered the larger Cyphral Octastich (285 numbers) from The Jewel (1652) using page-based word indexing, recovering all but nine letters of a royalist prayer. The puzzle had been listed among Klaus Schmeh's Top 50 unsolved encrypted messages.

Hacker News · AI·Sep 13, 21:06 UTC · 3d agoAI researchHN 63↑ · 6 comments1· 1 read

Right Tool, Right Job: Native-Language Evaluation, Tokenizer Sensitivity, and Methodological Findings from a French-Only BabyLM

French BabyLM entry METRON-FR (125M GPT-2, 92.47M words) shows tokenizer artifacts dominate child-scale zero-shot evaluation; proposes standard diagnostics.

METRON-FR is a 125M-parameter GPT-2 pretrained on 92.47M French words, submitted to the BabyLM 2026 Strict track, scoring 85.97% on the native Quebec-French QFrBLiMP benchmark and 62.80% on the BabyLM-weighted leaderboard. A cross-lingual GLUE protocol combining French task-data translation with rank-16 LoRA shows relational tasks gain while world-knowledge tasks regress. Bilingual Lexicon Induction reaches p@1 of 68.84%, 18x above chance, and ablations show single-token zero-shot scoring is dominated by tokenizer and template artifacts at child scale.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 16:43 UTC · 1d agoAI research

Why Johnny Can't Encrypt: A Usability Evaluation of PGP 5.0 (1999)

Seminal 1999 USENIX study finds most novice users cannot correctly sign and encrypt email with PGP 5.0 in 90 minutes.

Whitten and Tygar's USENIX Security Symposium paper evaluates whether cryptography novices can use PGP 5.0 effectively, using cognitive walkthrough analysis and a laboratory user test. The majority of test participants failed to successfully sign and encrypt a message within 90 minutes, despite PGP 5.0 having a well-regarded graphical interface. The authors argue that security requires usability standards beyond those of general consumer software and propose domain-specific UI design principles for security. The paper is a foundational reference in usable security research.

Lobsters · security·Sep 9, 06:47 UTC · 8d agoResearch

Claude Fable 5.1's language is less "load-bearing" than its predecessor's

Arena.ai found Claude Fable 5.1 writes 30% longer answers with fewer em dashes, hedges, and validation phrases than Fable 5.

Arena.ai compared tens of thousands of high-reasoning Text Arena outputs from Anthropic's Claude Fable 5 and Fable 5.1. Fable 5.1's median answer length rose 30% to 414 words (from 319), remaining 21% shorter than Opus 5's 525. Em-dash usage fell from 16.2 to 11.0 per 1,000 words while semicolons rose to 6.09, hedges like 'perhaps' and 'arguably' dropped 36%, and praise appeared in 1.98% of responses versus 3.17%. Long content words fell from 42.6% to 38.6% and abstract nouns declined 25%, suggesting the successor's language is less 'load-bearing'.

The Decoder·Sep 10, 15:26 UTC · 6d agoAI research1

CVE-2026-86287: Net::IP::LPM versions before 1.12 for Perl accept malformed prefix lengths

CVE-2026-86287: Net::IP::LPM Perl library before 1.12 accepts malformed IP prefix lengths, risking incorrect longest-prefix-match results.

Net::IP::LPM versions before 1.12 for Perl accept malformed prefix lengths, per an oss-security disclosure posted September 7, 2026. The lax input validation in this longest-prefix-match library could produce incorrect matching behavior. The fix is available in version 1.12 on CPAN.

oss-security·Sep 7, 18:40 UTC · 9d agoVulnerabilityCVE-2026-86287

Proximity Gaps for Gabidulin Codes and Applications

Researchers prove proximity-gap bounds for rank-metric and Gabidulin codes, enabling the first polynomial commitment scheme framework based on rank-metric error-correcting codes.

The paper proves every linear rank-metric code admits a proximity gap for deltas up to (d-1)/(3n) with error at most q^(e+1)/q^m, and improves the gap to (d-1)/(2n) for Gabidulin codes with error at most 10q^(n-1)/q^m, matching bounds for Reed-Solomon codes. A constructed infinite family of constant-rate Gabidulin codes shows the (d-1)/(2n) bound is tight, and a counterexample establishes a lower bound on the error at the d/(3n) gap. Applications include an IOPP for interleaved Gabidulin codes adapted from the Ligero IOPP and a q-linearized polynomial commitment scheme adapted from Ligero-based PCS, reportedly the first PCS framework based on rank-metric codes.

arXiv cs.CR·Sep 9, 07:45 UTC · 8d agoResearch

Towards a Deterministic Math Solver for Clinical Language Models

Paper shows handing arithmetic to a deterministic Python solver beats direct model calculation at 32B but not reliably at 7B on MedCalc-Bench.

Researchers test a Program-Solve interface where clinical LLMs write case-specific Python executed by a restricted local solver instead of doing arithmetic directly. On MedCalc-Bench Verified (1,100 cases, 55 calculators), Qwen2.5-32B-AWQ scored 90.53% with solver handoff versus 83.47% with direct arithmetic (+7.05 points), while Qwen2.5-7B gained an unreliable +3.29 points with a confidence interval spanning zero. The authors audited the benchmark against clinical guidelines and flagged 16 of 55 calculators for version, use, or coefficient concerns.

Hugging Face daily papers·Sep 8, 20:00 UTC · 8d agoAI research1

Breaking the 1.58-bit Barrier for Ternary LLMs

An arXiv paper claims a method that breaks the 1.58-bit barrier for ternary large language models.

The arXiv preprint 2609.16338, titled 'Breaking the 1.58-bit Barrier for Ternary LLMs,' presents research on ternary-weight large language models, which use roughly 1.58 bits per weight. The source text contained only the title and Hacker News engagement data (56 points, no comments), so further technical details are not available.

Hacker News · AI·Sep 16, 20:59 UTC · 16h agoAI researchHN 56↑ · 0 comments

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 · security·Sep 14, 12:23 UTC · 3d agoAI researchHN 22↑ · 19 comments

openbmb/MiniCPM5-2B — new model trending #4 on Hugging Face

OpenBMB released MiniCPM5-2B, a dense 2B open-weights Transformer claiming 2B-class open-source SOTA for on-device deployment.

OpenBMB released MiniCPM5-2B, the second model in the MiniCPM5 series following MiniCPM5-1B, and it is trending #4 on Hugging Face. The dense 2B Transformer targets on-device, local, and resource-constrained deployment and claims 2B-class open-source SOTA while remaining competitive with 4B-class models. Reported strengths include coding, mathematics, long-context understanding, tool use, and agentic tasks; a tech report (arXiv 2506.07900), GitHub repo, and online demo accompany the release.

Hugging Face trending models·Sep 6, 11:12 UTC · 11d agoModel release

Augustinian BabyLM: What Ostensive Definition Can and Cannot Teach a Small Language Model

Study shows visually grounded token embeddings in a small masked LM persist through training and improve object-property knowledge, but escape standard BabyLM benchmarks.

The paper implements ostensive definition for a small DeBERTa masked language model trained on 10M words, seeding visually grounded tokens with embeddings derived from labeled image regions before training. Visual initialization leaves a persistent, seed-replicated advantage on object-property knowledge (COMPS) and a corpus-tailored Visual-Property Swap benchmark covering color, material, size, and shape, but has no effect on most BabyLM grammar benchmarks. Synthetic grounding of previously unseeded words causally transfers the advantage to exactly those words.

arXiv cs.AI / cs.LG / cs.CL·Sep 10, 17:43 UTC · 6d agoAI research

USN-8736-1: Perl vulnerabilities

Ubuntu issued USN-8736-1 fixing two Perl regex flaws that could cause denial of service, code execution, or security-restriction bypass.

Ubuntu released a security notice addressing two Perl vulnerabilities in regular expression handling. CVE-2026-15534 involves mishandling of large inputs during regex matching, enabling out-of-bounds heap reads or writes that could lead to denial of service or arbitrary code execution. CVE-2026-19487 involves incorrect matching for regexes with alternative branches, allowing security restrictions to be bypassed. Users are advised to apply the updated packages.

Ubuntu Security Notices·Sep 8, 14:25 UTC · 8d agoAdvisoryCVE-2026-15534CVE-2026-19487

USN-8736-2: Perl vulnerabilities

Ubuntu issued USN-8736-2 fixing two Perl regex flaws that could cause out-of-bounds heap access, denial of service, or security bypass on 24.04 LTS.

USN-8736-2 backports the Perl fixes from USN-8736-1 to Ubuntu 24.04 LTS. CVE-2026-15534 involves out-of-bounds heap reads or writes when regular expressions handle large inputs, potentially causing denial of service or arbitrary code execution. CVE-2026-19487 causes incorrect regex matching with alternative branches, allowing security restrictions to be bypassed.

Ubuntu Security Notices·updated Sep 16, 20:12 UTC · 17h ago·first Sep 16, 14:37 UTC · 22h agoAdvisory 7 sourcesCVE-2026-15534CVE-2026-19487

USN-8731-1: MiniUPnPd vulnerability

Ubuntu issued USN-8731-1 fixing a MiniUPnPd integer underflow allowing remote DoS or information disclosure via malformed SOAPAction headers.

Ubuntu released USN-8731-1 to address an integer underflow vulnerability in MiniUPnPd's SOAPAction header parsing. A remote attacker could send a malformed SOAPAction header containing a single quote to trigger a denial of service or information disclosure. MiniUPnPd is a lightweight UPnP daemon widely deployed on routers and gateways.

Ubuntu Security Notices·Sep 7, 09:30 UTC · 10d agoAdvisory1

OpenBMB Releases MiniCPM5-2B: A 2.52B Dense Model Averaging 53.9 Across 34 Benchmarks and Built to Run On Device

OpenBMB released MiniCPM5-2B, a 2.52B-parameter Apache 2.0 on-device model averaging 53.9 across 34 benchmarks, ahead of Qwen3.5-4B.

OpenBMB released MiniCPM5-2B, a 2,516,756,480-parameter dense LlamaForCausalLM model with grouped-query attention and a 131,072-token context, under Apache 2.0, runnable via vLLM, SGLang, llama.cpp, and Ollama. It averages 53.9 across 34 benchmarks versus 51.1 for Qwen3.5-4B, with strong tool-use (97.1 on tau2-Bench Telecom) and code results (69.1 LiveCodeBench v6, 46.4 SWE-bench Verified). Training combined 400B tokens of deep-thinking SFT, critic-based JustRL II RL teachers, and on-policy distillation merging 16 RL experts; datasets and intermediate checkpoints were published alongside the weights.

MarkTechPost·Sep 7, 19:18 UTC · 9d agoModel release

USN-8729-1: Linux kernel vulnerabilities

Ubuntu issued USN-8729-1 fixing Linux kernel vulnerabilities across ARM, Bluetooth, GPU, SCSI, SMB, and Azure MANA subsystems.

Ubuntu released USN-8729-1 addressing several security issues discovered in the Linux kernel that could allow an attacker to compromise the system. Fixes span ARM32/ARM64/PowerPC architectures, Bluetooth, GPU, InfiniBand, and network drivers, plus the Microsoft Azure Network Adapter (MANA) driver. The update also corrects flaws in the SCSI and SPI subsystems, SMB and NTFS3 file systems, EFI core, and file systems infrastructure.

Ubuntu Security Notices·Sep 7, 09:08 UTC · 10d agoAdvisory 6 sources

Putting models to the secure coding test: Plan vs default mode

Datadog Security Labs tested Sonnet 5, Composer 2.5, and GPT 5.5 to see if plan mode yields more secure code than default mode.

Datadog Security Labs evaluated whether plan mode produces measurably more secure code than default mode. The test covered three frontier coding models: Sonnet 5, Composer 2.5, and GPT 5.5. The results inform how engineering teams should configure AI coding assistants to reduce insecure code. This is an AI security evaluation, not an incident report.

Datadog Security Labs·Aug 19, 00:00 UTC · 29d agoAI safety & security

dealignai/GLM-5.3-CYBERSECURITY-FP8 — new model trending #13 on Hugging Face

dealignai releases GLM-5.3-CYBERSECURITY-FP8, a 753B MoE weight-modified variant cutting refusals on offensive-security prompts, trending #13.

dealignai released GLM-5.3-CYBERSECURITY-FP8 on Hugging Face, a cybersecurity-domain 'crack' of the 753B-parameter GLM-5.3 MoE model, currently trending #13. The release directly edits bf16 residual writers, keeps FP8 routed experts, and serves with stock vLLM on 8x H200 GPUs with 131k context. HarmBench-320 evaluations show 80-84% direct harm compliance and 89% cyber-offense compliance, while MMLU rose 1.07 points to 86.65%. Copyright-verbatim reproduction remains a known soft-refusal limitation, with an UNCENSORED sibling variant offered.

Hugging Face trending models·Aug 30, 10:46 UTC · 18d agoModel release

GPT-5.6-Cyber refuses security researchers’ requests far less often

Help Net Security·Aug 11, 00:00 UTC · Aug 11, 2026Exploit / PoCCVE-2026-15903

MetroLLM-Bench: Evaluating Language Models as Transit Kiosk Runtimes

MetroLLM-Bench is a 955-case benchmark testing language models as transit kiosk tool-calling runtimes across six real metro systems.

The benchmark covers 37-414-station metro systems and eleven task categories including routing, fare calculation, disruptions, accessibility, and adversarial input, with 14 deterministic and 8 semantic scoring components. Of 26 models from six vendors, a PEFT-tuned 4B Qwen 3.5 student scored 91.3 on Tier 1, exceeding GPT-5.6 (90.6/90.0), while Muse Glimmer 30B led the composite ranking. A deterministic rule-based baseline reached 84.6, and PEFT gains over base models shrank from +7.03 points at 2B to -0.91 at 27B.

Hugging Face daily papers·Sep 8, 20:00 UTC · 8d agoAI research1

openbmb/MiniCPM5-2B-GGUF — new model trending #30 on Hugging Face

OpenBMB released MiniCPM5-2B, a dense 2B on-device model claiming open-source SOTA among 2B-class models.

OpenBMB released MiniCPM5-2B, the second model in the MiniCPM5 series following MiniCPM5-1B, as a dense 2B Transformer built for on-device and resource-constrained deployment with GGUF weights on Hugging Face. The team claims 2B-class open-source state-of-the-art performance, remaining competitive with 4B-class models in coding, mathematics, long-context understanding, tool use and agentic tasks. The release includes a tech report, GitHub repository and online demo, and is currently trending on Hugging Face.

Hugging Face trending models·Sep 5, 01:44 UTC · 12d agoModel release2

Objective vs. Search: Decomposing What Makes a Good Tokeniser

New tokeniser study shows search procedure, not optimisation objective, drives bits-per-byte performance across model sizes, vocabulary sizes, and multilingual settings.

The paper disentangles BPE and UnigramLM along two axes: optimisation objective (compression vs log-likelihood) and search procedure (bottom-up merging vs top-down pruning). Two new algorithms, BottomUpLL and TopDownComp, complete the 2x2 design space, and trained language models are evaluated on bits-per-byte and BLiMP across model sizes, vocabulary sizes, and English-only vs multilingual domains. Bottom-up tokenisers consistently achieve lower bits-per-byte in most settings, while BLiMP shows no consistent relationship with design choice.

arXiv cs.AI / cs.LG / cs.CL·Sep 16, 17:59 UTC · 19h agoAI research

USN-8742-1: Netty vulnerability

Ubuntu issues USN-8742-1 fixing a Netty DNS cache poisoning flaw caused by improper NS record bailiwick validation.

Ubuntu Security Notice USN-8742-1 addresses a vulnerability in the Netty framework in which NS records are incorrectly validated for bailiwick. An attacker could potentially exploit this to facilitate DNS cache poisoning attacks. Updated packages are available for supported Ubuntu releases.

Ubuntu Security Notices·Sep 10, 09:01 UTC · 7d agoAdvisory

The 2026 PNPL Competition: Word Classification and Efficient Cross-Subject Generalisation in LibriBrain100

The 2026 PNPL competition releases LibriBrain100, a MEG speech dataset with 32 extra subjects, targeting word classification and cross-subject BCI generalization.

The 2025 PNPL competition on non-invasive speech decoding from MEG achieved F1-macro scores of 95.6% for speech detection and 73.6% for phoneme classification, built on LibriBrain's ~50 hours of single-subject data. The 2026 edition extends this with LibriBrain100, adding 32 subjects (~40 minutes each) plus ~80 hours of within-subject data. Two tracks target within-subject word classification at scale and cross-subject generalization with subject-specific fine-tuning shrinking from ~40 to ~20 to ~10 minutes, aiming at clinically feasible non-invasive BCIs for people with profound paralysis.

Hugging Face daily papers·Sep 2, 20:00 UTC · 14d agoAI research

HyQuant: Hybrid-Precision Quantization for LLM Attention

HyQuant keeps most LLM attention states low-bit while preserving vertical-line tokens and local windows in high precision, maintaining near-lossless accuracy.

HyQuant is a hybrid-precision quantization framework for LLM attention that quantizes most attention states to low bits while keeping accuracy-critical vertical-line tokens and local-window states in full precision, selected via lightweight attention-pattern signals. In the prefill stage it uses a hybrid-precision attention operator, and in the decode stage it applies the same principle to KV-cache compression with fused dequantization and attention computation. Across diverse tasks, models, and datasets it maintains nearly lossless accuracy; code is available on GitHub.

Hugging Face daily papers·Aug 27, 20:00 UTC · 20d agoAI tools & infra1

Grouped Value Attention: Efficient KV Caching via On-Demand Key Reconstruction

Grouped Value Attention stores grouped values and reconstructs content keys via a learned linear map, cutting KV-cache size about 45-47% versus GQA.

GVA stores only grouped values and reconstructs content keys with a learned linear map absorbed into the query at decode time, while a small shared decoupled RoPE channel preserves positional information via a separately cached positional key. At 350M parameters trained on 30B FineWeb-Edu tokens, the 16-dimensional positional variant scores 44.18 average accuracy across five tasks versus 44.36 for GQA and 43.88 for MLA. Custom decoding kernels are in development with an open-source release planned.

Hugging Face daily papers·Sep 7, 20:00 UTC · 9d agoAI research

PaperCut Zero-Day Exploited in Attacks, Affecting All NG and MF Versions

PaperCut warns of actively exploited zero-day RCE chain CVE-2026-81578 and CVE-2026-82078 affecting all PaperCut NG and MF versions.

PaperCut alerted customers that attackers are actively exploiting a zero-day affecting all versions of PaperCut NG and MF print management software, with confirmed customer incidents and an ongoing investigation. Emergency patches were released for v25 and v26, and the flaw was later identified as an exploitation chain of CVE-2026-81578 and CVE-2026-82078 enabling remote code execution. Shared IoCs include suspicious post-exploitation activity from pc-app.exe and missing, truncated or deleted server.log files with specific database errors. Users with internet-exposed PaperCut Application Servers are urged to immediately restrict access to trusted IPs; in 2023, CVE-2023-27350 (CVSS 9.8) in the same products was exploited by Lace Tempest to deliver Cl0p and LockBit ransomware.

The Hacker News·Aug 31, 06:10 UTC · 17d agoExploit / PoC in the wildCVE-2026-81578CVE-2026-82078CVE-2023-273501

llm 0.35

llm CLI tool version 0.35 adds support for OpenAI's new GPT-6 Astra model exposed as gpt-6-astra.

Simon Willison released llm 0.35, which adds an OpenAI model definition for GPT-6 Astra under the model ID gpt-6-astra. No other release details were provided in the post.

Simon Willison·Sep 7, 23:54 UTC · 9d agoAI tools & infra