ZeroHour
DashboardNewsCVEsExploitsIncidentsAIBriefAnalyticsEntitiesWatchlistIOCsAsk the feedSourcesFeeds & APIKiosk mode

Search: “statistics”

39 stories in the last 7d

Searchkeywordsmart Sortlatesthotimportancerelevance
DomainAllCyberAIWindow24h3d7d30dAllIn the wildImportant onlyShow duplicates
CategoryAllResearch 13AI research 10AI safety & security 6AI industry 4Model release 3Phishing & fraud 2Advisory 2Industry 2Data breach 1AI policy 1
SeverityAllcritical 0high 1medium 4low 0info 39

35 Actionable Password Statistics for Businesses in 2026 | Huntress

Huntress compiles 2026 password statistics showing 94% of 19 billion leaked passwords were reused and 37% of identity threats used stolen credentials.

Huntress published a compilation of password security statistics drawing on sources including Cybernews, Verizon's 2026 DBIR, IBM, and Bitwarden. Cybernews found 19 billion exposed passwords from roughly 200 incidents between April 2024 and April 2025, with only 6% unique and 94% reused across accounts. Huntress telemetry reports 37% of identity-based threats in 2026 involved stolen or suspicious credentials, while Verizon cites credential abuse in 39% of breaches. The piece argues weak and reused passwords remain a top entry point and recommends improved password hygiene.

Huntress · 6d agoIndustry

Double descent is the principle of least action

A statistical mechanics analysis explains double descent: finite-time diffusion induces effective weight decay that regularizes models as parameters grow.

The paper models stochastic gradient-based training as a particle diffusing over the training-loss energy landscape at an induced temperature, sampling parameters via a Boltzmann distribution. Finite training time carries an effective weight decay, making every parameter a quadratic degree of freedom governed by the equipartition theorem. Adding parameters at fixed training loss lowers the temperature and the L2 norm of the stationary path, increasing effective regularization and explaining the double descent phenomenon.

arXiv cs.AI / cs.LG / cs.CL · 17h agoAI research

Forging Tree-Ring: Reproducing and Instrumenting Black-Box Semantic Watermark Forgery

Reprompt watermark forgery reproduces on Stable Diffusion XL using free-tier T4 GPUs, with forged images accepted by the genuine detector 5 of 6 times.

The authors reproduce the Reprompt forgery attack of Müller et al. against Tree-Ring watermarking on Stable Diffusion XL using the released code on free-tier dual T4 GPUs with 14.6 GB usable memory, versus the A40 hardware of the original study. Over six trials, the genuine detector flagged genuine images 6/6, clean images 0/6, and forged images 5/6, at 325-332 seconds per attack. They also recovered the detector's discarded non-central chi-square statistic and built two natural scores separating forged images from the clean null at AUC 0.861 and 0.972. The notebook, pinned fork, and all measurement artifacts are released with the paper.

arXiv cs.CR · 5d agoResearch

Certifying Adversarial Robustness of Quantum Classifiers under Known-Readout Query Access

Framework certifies adversarial robustness of quantum classifiers using only measurement statistics and finite-shot outcomes, demonstrated on IBM Quantum hardware.

The paper introduces a measurement-only certification framework for adversarial robustness of quantum classifiers under known-readout query access, requiring no tomography, parameters, or gradients. It returns a lower bound ruling out untargeted errors within a radius and an attack-independent upper bound witnessing an adversarial state, both estimable with finite-sample guarantees. Evaluations show the lower bound tracks exact optima on tractable instances while the upper bound stays informative when standard attacks fail. The method was validated on IBM Quantum hardware using 40 executions of two 8-qubit quantum neural networks.

arXiv cs.CR · 6d agoResearch

Coding Agents Have Converged: Why the SWE-bench Leaderboard Can No Longer Order Its Top Entries, and What to Measure Instead

Audit of 254 SWE-bench submissions finds top coding-agent entries statistically inseparable, so small leaderboard gaps no longer establish rank.

The paper audits 254 SWE-bench submissions across four splits without running models. On Verified, the top two entries each resolve 396 of 500 instances, and exact paired McNemar tests separate none of the 29 adjacent top-thirty pairs at alpha=0.05. Within-model scaffold score ranges reach 29.8 percentage points, versus an 8.8-point spread among the top thirty. The authors release a five-step audit protocol and recommend reporting comparison-set-specific resolution and model-scaffold provenance.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

Observational Indistinguishability and Integrity Blind Regions in Hybrid Quantum-Classical Workflows

Framework formalizes integrity blind regions in hybrid quantum-classical workflows, validated across 3,600 label interventions with conformal detection rules.

The paper presents a claim-relative evidence and reference framework for integrity of hybrid quantum-classical workflows, distinguishing structural blind regions caused by observational indistinguishability from finite-batch statistical misses. Experiments over 3,600 label interventions show exact label-path invariance for feature and prediction views. The geometry-aligned construction detects 343 of 2,700 conclusion-changing interventions using the conformal rule and 1,183 of 2,700 with the uncorrected union, with executed conformal clean false-action rates of 0.048-0.059.

arXiv cs.CR · 1d agoResearch

When LLM judges agree, should we believe them?

Amazon ICML paper uses Ising models to correct correlated LLM-judge votes, beating accuracy-weighted panels by 9-14%.

Amazon Science describes an ICML paper, "Dependence-aware label aggregation for LLM-as-a-judge via Ising models," addressing how correlated judge outputs inflate majority-vote confidence. The unsupervised method models pairwise dependence between judges, learning both reliability and similarity without human reference labels. Tested on relevance, toxicity, and summarization tasks with 10 judge models at temperature zero, it outperformed accuracy-weighted voting by 9% to 14%.

Hacker News · AI · 2d agoAI researchHN 41↑ · 23 comments

Exponential Hardness of Off-Policy Evaluation under History-Dependent Logging

Researchers prove off-policy evaluation under history-dependent logging requires exponentially many episodes, resolving a hardness question for model-based POMDP evaluation.

The paper constructs POMDPs with at most two latent states per stage, three actions, and a three-memory-state logger where evaluating a known deterministic target policy to accuracy 1/8 requires Θ((3/2)^H log(1/δ)) episodes for any horizon H≥3. Coverage and outcome-revealing conditions hold with constants independent of H, yet a reset erases the unknown transition that determines the target value. The authors characterize the resulting statistical experiment exactly, derive a matching optimal estimator, and validate predictions on a two-lane gridworld. This settles the history-dependent-logging, model-based case posed by Zhang and Jiang (arXiv:2503.01134).

arXiv cs.AI / cs.LG / cs.CL · 17h agoAI research

Flag Game: A Toy Model for Mechanistic Swarm Interpretability

Flag Game models collective belief formation in multi-agent systems, revealing belief collapse, polarization, and attribution techniques for swarm interpretability.

The paper introduces the Flag Game, a toy model where bounded agents observe only private crops of a hidden country flag and exchange beliefs while weighing social evidence. It reproduces non-monotonic performance scaling with population size, collective belief collapse at small populations, and polarization at large ones that drives performance decline. The authors propose social circuit attribution with causal agent-patching interventions, and a statistical-mechanical theory that matches the empirical phase diagram, as first steps toward mechanistic swarm interpretability for collective alignment.

arXiv cs.AI / cs.LG / cs.CL · 17h agoAI safety & security

Low-Rank Masking for Single-Server Matrix Multiplication

Researchers prove rank-r additive masks for outsourced matrix multiplication achieve maximal-correlation secrecy of at most q^-r, with a matching lower bound.

An arXiv paper analyzes statistical privacy for outsourcing matrix multiplication over a finite field to a single server using additive masks of rank at most r. Uniform rank-ball masks and products of independent uniform factors yield maximal-correlation secrecy bounded by q^{-r}, with encoding and decoding costing O(n^2 r) field operations. The authors prove an asymptotically matching lower bound for r=o(n), showing these samplers are optimal among input-independent additive masks even with secret invertible transformations. They also show every such mask requires delta approaching 1 in entry-level (epsilon, delta)-differential privacy for fixed field size.

arXiv cs.CR · 18h agoResearch

Normal Alignment: Improved Cryptanalytic Sign Recovery on Hard-Label Networks

Researchers propose Normal Alignment, improving cryptanalytic sign recovery for hard-label neural networks and enabling polynomial-time full model extraction.

The paper improves on Carlini et al.'s EUROCRYPT 2025 cryptanalytic extraction of hard-label (S1) DNNs, whose Future Toggle sign-recovery method offered only marginal advantage over random guessing and triggered exponential-time enumeration on errors. Normal Alignment infers neuron signs via expected length differences between projected normals of adjacent decision facets at dual points, delivering higher voting accuracy and low-confidence errors. Combined with the SOE extension, it achieves exact polynomial-time full sign recovery: CIFAR-10 (192-64x8-10) and MNIST (64-96x3-32-10) models are fully recovered where the prior method required 2^52 or 2^82 sign guesses.

arXiv cs.CR · 20h agoResearch

Nums AI Releases Causilo: A Tabular Foundation Model That Tops TabArena Among Single Models

Nums AI released Causilo, an Apache-2.0 tabular foundation model achieving the highest single-model Elo (1794) on TabArena for classification and regression.

Nums AI released Causilo 1.0.1, a pretrained in-context learning tabular foundation model for classification (up to 10 classes) and regression, with Apache-2.0 code and research-only weights on Hugging Face. It achieved the highest single-model TabArena Elo of 1792.9 overall, beating TabFM (1764.4) and EXAONE Tabular (1758.8), and a maintainer re-run placed it 3rd of 88 including system entries. It also ranked first by CRPS, R² and RMSE on ScoringBench across 101 datasets, and was fastest on fit and predict versus TabICLv2 and TabPFN-3 on an H100 GPU at 8.15 GiB memory. The model was pretrained only on synthetic data, uses cross-attention to keep cost linear in feature count, and version 1.0.1 adds quantile outputs via 999 native quantiles.

MarkTechPost · 1d agoModel release

Agora: Git as Shared Memory for Collective AutoResearch

Agora records multi-agent research as an append-only Git DAG; 13 LLM workers ran nearly 12 days on a weight-transfer problem.

Agora stores every result, hypothesis, and verification as an immutable commit in a Git-stored DAG, with a derived index exposing the frontier and verification status of claims. In a nearly 12-day run, 13 language-model workers with no assigned tasks or central planner published 1,703 contributions on initializing a frozen 119.6M-parameter attention-SSM hybrid from 141 donor models. They improved the evaluator from 3.39 to 1.899 bits per byte, closing 62% of the gap to a trained GPT-2 124M, with 165 independent reproductions posted and none failing.

Hugging Face daily papers · 1d agoAI research

AI labs have a data trust problem that their policies haven't solved

Nvidia, Palantir, and Booz Allen restrict Anthropic's Fable over data-retention distrust, exposing gaps in AI labs' customer data policies.

Nvidia limits Anthropic's Fable to non-sensitive work and runs its own Nemotron models for internal tasks, while Palantir blocks Fable deployment until Anthropic grants irrevocable zero-data-retention guarantees, and Booz Allen bans it for proprietary cybersecurity work. John Schulman and researcher Sarah Hooker explain that labs can still extract customer IP from metadata, user traces, and synthetic data even under zero data retention. The trust crisis crystallized around Tristan Buckmaster's accusation that OpenAI's Codex absorbed his Navier-Stokes drafts, though OpenAI later stated his prompts could not have influenced its model.

The Decoder · 1d agoAI industry

SEMA-GUARD: Semantic and Graph-Based Vulnerability Detection in Assembly Code

SEMA-GUARD uses semantic analysis and graph neural networks to detect vulnerabilities in assembly code, achieving 85.1% accuracy on a Juliet-derived benchmark.

SEMA-GUARD is a framework that detects vulnerabilities in compiled programs when source code is unavailable, targeting malware, firmware, and embedded systems analysis. It enriches control flow graphs with low-level execution semantics including stack manipulations, memory accesses, and data flow. Evaluated on a Juliet Test Suite set compiled to assembly and split into function-level chunks, it achieves 85.1% accuracy and an F1 score of 0.801, outperforming purely statistical or structural approaches.

arXiv cs.CR · 1d agoResearch1

What must happen for AI’s trillion-dollar gamble to pay off

Hyperscalers need 2.7x productivity gains by 2030 to justify nearly $1.1 trillion in AI data center spending, or risk bankruptcy and capital misallocation.

Wharton finance professor Jessica Wachter estimates hyperscaler AI expenditure will reach nearly $1.1 trillion through 2027 and that a 2.7x productivity increase is needed to break even by 2030. AI revenues of roughly $150-200 billion this year fall far short of about $750 billion in annual spending, with total investment from Alphabet, Microsoft, Amazon, Meta, and Oracle potentially exceeding $5 trillion over four years. Alphabet reported its first free cash flow deficit (about $5.9 billion) since its 2004 IPO due to AI infrastructure costs. Researchers warn that failed demand could make the buildout the largest capital misallocation in history, with depreciating GPU chips risking stranded assets.

MIT Technology Review · AI · 2d agoAI industry

Not All Relations Are Equal: Relation-Balanced and Calibrated Graph Learning for Provenance-Based Intrusion Detection

RECAL improves provenance-based APT detection with relation-balanced masked graph learning and calibrated errors, reaching 99.99% F1 on DARPA E3 datasets.

RECAL is an unsupervised framework for provenance-based intrusion detection that uses relation-balanced masked graph learning to capture rare interaction patterns, addressing statistical heterogeneity where relation frequencies differ by roughly 140,000X in CADETS. It calibrates reconstruction errors against each relation's benign error distribution to produce comparable anomaly evidence and reduce false alarms. On three DARPA E3 datasets, RECAL achieves F1 scores of 99.99%, 99.93%, and 99.99%, outperforming the best baseline on each dataset, and reduces mean false positive rate by approximately 105X, 4X, and 41X versus the lowest-FPR baseline.

arXiv cs.CR · 2d agoResearch

Implementing a White-Box Undetectable Backdoor for Random Fourier Features

Researchers implement Goldwasser's CLWE-based undetectable backdoor for Random Fourier Features models in numpy/scipy, confirming practical realizability with no detectable differences from clean models.

The paper provides an end-to-end implementation of the Goldwasser et al. white-box undetectable backdoor for models trained with the Random Fourier Features algorithm, using only numpy and scipy. It derives two samplers for the core GP_d(b_k) distribution: a rejection-sampling proxy and an exact closed-form sampler verified against its analytic form. Statistical indistinguishability tests covering weight-space and functional black-box comparisons found no detectable difference between backdoored and clean models across sparsity ratios. The underlying lattice hardness reduction was not reproduced, and the work demonstrates the threat is realizable with commodity scientific-computing tools rather than specialized cryptographic infrastructure.

arXiv cs.CR · 2d agoResearch

Bridging Control, Inference, Transport, and Thermodynamics: From Theory to Applications in Learning

Review connects control theory, optimal transport, probabilistic inference, thermodynamics, and machine learning via free-energy optimization under constraints.

The review unifies five fields: control theory, optimal transport, probabilistic inference, non-equilibrium thermodynamics, and machine learning. The common conceptual thread is optimization of free-energy-like functionals under dynamical or statistical constraints. Selected applications are presented in reinforcement learning, variational inference, and generative modeling. The tutorial-style text assumes no prior familiarity and begins from physics principles.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI 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 · security · 2d agoAI researchHN 21↑ · 3 comments

Notes on gotchas while migrating 35kb preprompts from Opus to self-hosted Ollama

Opinion piece urges migrating 35KB preprompts from Anthropic/OpenAI to self-hosted Ollama, citing session privacy risks and safety filters blocking security research.

The author documents gotchas migrating 35KB preprompts from Claude Opus to self-hosted Ollama, motivated by fears that frontier providers train on user sessions, citing the OpenAI Navier-Stokes controversy. The piece argues inference providers cannot audit their own retention or training pipelines and that only self-hosted hardware offers verifiable privacy. It also criticizes frontier safety filters for refusing vulnerability research tasks and calls for models that support exploitability testing in CI/CD pipelines.

Hacker News · AI · 2d agoAI industryHN 41↑ · 13 comments1

How Fyxer built an AI executive assistant people trust

Fyxer details its OpenAI-powered AI executive assistant, orchestrating 30-50 specialized models trained on 500,000+ hours of assistant workflows.

OpenAI published a case study on Fyxer, whose AI executive assistant orchestrates 30-50 specialized OpenAI models trained on more than 500,000 hours of annotated executive assistant workflows. The system uses supervised fine-tuning, LoRA, and Direct Preference Optimization on user edits, and 53% of AI-generated email drafts are accepted as written. Fyxer's annual recurring revenue grew from $1 million to $32 million during 2025.

OpenAI News · 2d agoAI industry

Who gets to define the rules for AI?

Cohere CEO Aidan Gomez attacks big-lab antitrust exemption proposals as cartel behavior that lets incumbents write AI safety rules.

Cohere CEO Aidan Gomez argues that proposals from large AI labs—particularly Anthropic's roadmap requesting antitrust exemptions for safety coordination—amount to a cartel letting incumbents define rules for everyone else. He draws parallels to the 1975 SEC NRSRO credit-rating designations and the EU's 1985 Motor Vehicle Block Exemption, where safety justifications produced incumbent-protecting market structures. Gomez supports independent review of highly capable AI systems but disputes who writes the standards, who conducts review, and who participates. He also warns AI cyber offense is getting cheaper faster than defenses are improving.

Hacker News · AI · 3d agoAI policyHN 41↑ · 29 comments

Enabling Creative Exploration for Vibe Design Agents

Separating design-direction exploration from code generation via structured specifications broadens UI alternatives without destabilizing output.

The paper proposes an inference architecture for vibe design agents that makes design direction an explicit intermediate decision: a Verbalized Sampling-inspired pre-pass proposes structured design specifications with typicality scores, an external selector samples one, and a downstream generator realizes it under fixed settings. Across 168 prompts with 1,255 paired comparisons per temperature, theme sampling broadens selection coverage and screenshot variation, with LLM-judge preferences varying across interventions and prompt complexity. An online experiment with over 300,000 tasks found the code-export increase statistically uncertain, though negative feedback events decreased alongside modest operational costs.

Hugging Face daily papers · 3d agoAI research

Not All Prompts Are Equal: Exploration-Guided Prompt Scaffolding for Multimodal Reinforcement Post-Training

Exploration-guided prompt scaffolding rewrites training prompts by Exploration Potential Score, boosting multimodal RL post-training accuracy up to 11.5%.

The paper proposes dynamically adapting the training prompt distribution during online RL post-training of multimodal LLMs using the Exploration Potential Score (EPS), a lightweight rollout-based proxy for prompt utility computed from on-policy statistics with no additional overhead. Rather than discarding low-utility prompts, a teacher model generates scaffolded rewrites that preserve task intent while making training more informative. Integrated with GRPO on Geo3K and MMK12, the method achieves up to 9.7% relative in-domain improvement plus 11.5% on MathVision and 11.1% on MMMU-Pro.

Hugging Face daily papers · 3d agoAI research

AI models don't kill people – people kill people

Register opinion argues AI extinction fears distract from present harms and proposes jailing executives whose unsafe models cause damage.

The Register opinion responds to Anthropic researcher Jacob Coxon's resignation over concerns AI 'could kill us all by the end of the decade,' a post that drew over 110 million views in under 24 hours. Anthropic science lead Evan Hubinger stated he believes there is a greater than 10 percent chance AI kills all humans within a decade and that Anthropic lacks a plan to solve superintelligence alignment. The author argues researchers ignore measurable present harms such as climate change, chatbot-linked suicides, autonomous vehicle failures, and AI-directed warfare. The piece proposes criminal liability for executives shipping unsafe models, citing Volkswagen emissions and Gree dehumidifier prosecutions as precedent.

Hacker News · AI · 3d agoAI safety & securityHN 40↑ · 58 comments

Cognition Releases SWE-2: A Kimi K3 Post-Trained Coding Model That Matches Fable 5.1 on FrontierCode at 64% Lower Cost

Cognition released SWE-2, an RL post-trained coding model from Kimi K3, scoring 50.0% on FrontierCode 1.1 Main and available only inside Devin.

Cognition released SWE-2, its most capable coding model, post-trained with reinforcement learning from Moonshot AI's 2.8T-parameter Kimi K3 base. It scores 50.0% on FrontierCode 1.1 Main, within 1 point of Fable 5.1 at 64% lower cost, and RL reportedly adds 5-6 points over the K3 base on many benchmarks. It is the first Cognition model with selectable reasoning-effort levels all trained in a single RL run using Pareto-slope-matched cost penalties. There are no open weights and no standalone API; it runs only inside Devin (Desktop, CLI, with Web and Fusion rolling out), free for paid tiers through October 10, 2026.

MarkTechPost · 4d agoModel release1

LLMs are real, AI is fake

Cory Doctorow argues the OpenAI chatbot 'hacking' of Hugging Face was a Python-scripted CTF loop, not autonomous AI.

In an opinion essay, Cory Doctorow debunks reports that OpenAI chatbots autonomously hacked Hugging Face servers during an 'Exploit Gym' capture-the-flag challenge. He explains the chatbot merely acts as a front-end queried by a Python program that replays commands drawn from CTF training data. He argues sensational 'AI went rogue' narratives are amplified by technical press and help AI companies raise investment capital.

Hacker News · AI · 4d agoAI safety & securityHN 40↑ · 10 comments1

Rare Not Random Using Token Efficiency for Secrets Scanning

Researcher proposes token efficiency (string length divided by BPE token count) as a better post-regex filter than entropy for secrets scanning, validated on CredData.

The post explores whether Byte-Pair Encoding tokenization can replace Shannon entropy as the primary filter for candidate secrets captured by regex in tools like Gitleaks. It defines 'token efficiency' as string length divided by token count under the cl100k_base tokenizer; secret-like strings such as GitHub tokens tokenize into many small tokens and score low, while natural text scores high. Evaluating labeled secrets from the CredData dataset shows a usable separation, with roughly 2.5 suggested as a minimum cutoff versus Gitleaks' 3.5 entropy threshold. The technique is positioned as a post-regex filtering step rather than a standalone detector.

Lobsters · security · 5d agoResearch

Countering misuse of AI: September 2026 / Anthropic

Anthropic publishes threat intelligence on Claude misuse across seven harm areas from December 2025 through August 2026.

Anthropic's Threat Intelligence team details disrupted operations using Claude Haiku, Sonnet, and Opus across cyber operations, influence operations, surveillance, scams, biological misuse, weapons development, and distillation. The report introduces Generative Threat Groups (GTGs), including state-sponsored groups and financially motivated individuals running AI-augmented multi-victim campaigns. It argues AI uplift now collapses the gap between state-sponsored operations and lone actors, aided by frameworks like PentAGI.

Lobsters · securityupdated · 5d agofirst · 6d agoAI safety & security 16 sources1

A Feature-Rich Embedded NIDS with eBPF/XDP: Detector and Architecture Trade-offs

eBPF/XDP-based NIDS with Isolation Forest reaches 0.965 live F1 on DDoS replay; gRPC microservices match monolithic accuracy within 2ms overhead.

The paper presents a DDoS-focused network intrusion detection system for transport networks built with Ericsson, combining a statistical baseline with an Isolation Forest trained on flow features from GoFlowMeter, an open-source Go implementation of CICFlowMeter, plus eBPF/XDP kernel-level traffic filtering. On a Raspberry Pi 5 testbed replaying CIC-DDoS2019 as real traffic, the Isolation Forest achieves 0.965 recall/F1 live in the monolithic variant, catching low-volume attack windows the baseline misses. gRPC microservices nearly match monolithic accuracy adding under 2ms per window, while the Kafka pipeline trails by roughly nine percentage points and adds about 27ms.

arXiv cs.CR · 6d agoResearch

Hardware Fingerprinting FTQC via Quantum Decoder Timing

Quantum decoder timing on IBM Heron processors forms a side channel enabling device fingerprinting with 89% accuracy and workload inference.

The work demonstrates that wall-clock syndrome-decoding times on fault-tolerant quantum computers constitute a novel hardware side channel. Using per-shot decoder timings from three IBM Heron processors collected over 68 days, a passive observer can reconstruct detector-firing distributions, estimate logical error rate, infer code distance, and fingerprint the specific device with up to 89% accuracy versus 33% for random guessing. Noisy simulation based on Google's 105-qubit Willow processor distinguishes nine surface-code patches at 81% accuracy, showing the channel persists across vendors and code families.

arXiv cs.CR · 6d agoResearch

Can Edge-Deployable Vision-Language Models Identify Species?

Evaluation of 2-8B VLMs (Qwen3-VL, Gemma3) against BioCLIP on camera-trap species ID shows all models degrade sharply on field imagery.

The study tests whether edge-deployable 2-8B vision-language models carry genuine taxonomic knowledge, comparing Qwen3-VL 2B/4B/8B and Gemma3 4B against the 300M specialist BioCLIP on a 96-species task across clean iNaturalist photos and six LILA.science camera-trap collections. All models degrade 9.6-26.6 percentage points on field imagery, and BioCLIP outperforms every VLM by 33.2-59.2 points on an expanded 200-image sample, suggesting specialized data rather than scale drives the gap. Under open-set prompting, 5.9-9.6% of responses are syntactically valid but taxonomically nonexistent species names, with fabrication rankings replicating across evaluation sets.

arXiv cs.AI / cs.LG / cs.CL · 6d agoAI research1

EFI Pairs Without One-Way Puzzles: Oracle Separations from Communication Complexity

Theorists build a classical oracle where one-way puzzles fail yet EFI pairs survive, separating two candidate minimal assumptions of quantum cryptography.

The paper constructs a single classical oracle relative to which one-way puzzles do not exist, even with an unbounded verifier, while an EFI pair survives every classical-query distinguisher holding advice, making one superposition query at the end. Security is proven by reducing adversary knowledge to communication complexity for Vector-in-Subspace, with the superposition query bounded using random matrix theory. Relative to the oracle, quantum polynomial time offers no advantage on tasks with classical inputs and outputs and there is no proof of quantumness, separating the leading minimal assumptions of quantum cryptography.

arXiv cs.CR · 6d agoResearch

Differentially Private EEG Feature Anonymization: A Privacy-Utility Case Study in Clinical Neurophysiology

Case study applies Gaussian and Laplace differential privacy to clinical EEG features, quantifying privacy-utility trade-offs across three deployment scenarios.

Researchers evaluate subject-level differential privacy for EEG-derived feature representations using Gaussian and Laplace perturbations across client-side, centralized server-side, and decentralized local training scenarios. Utility is assessed with statistical measures and a downstream machine-learning check on clinical neurophysiology data. Results show DP can be integrated into EEG workflows, but mechanism choice, privacy parameters, and sensitivity calibration strongly influence data utility, particularly on small and imbalanced clinical datasets. The study highlights the privacy-utility trade-off in protecting biomedical signals against re-identification and inference risks.

arXiv cs.CR · 6d agoResearch

Cognition launches new SWE-2 model, Rivaling Fable 5.1 and GPT-Astra

Cognition released SWE-2, a coding model post-trained from Kimi K3 that scores 50.0% on FrontierCode 1.1 Main, near Fable 5.1 at 64% lower cost.

Cognition introduced SWE-2, its most advanced coding model, post-trained from the 2.8T-parameter Kimi K3 base model. It achieves 50.0% on FrontierCode 1.1 Main, 73.0% on DeepSWE 1.1, and 92.8% on Terminal-Bench 2.1, beating Grok 4.6 and SWE-1.7 while matching Fable 5.1 and GPT-5.6 Sol at a fraction of the price. The company says it scaled reinforcement learning to the multi-trillion-parameter regime for the first time, using Pareto-informed cost penalties that train all reasoning-effort levels in a single run, tripled RL environments, and NVFP4/FP8 quantization-aware training. SWE-2 is available today in Devin Desktop and CLI, with rollout on Devin Web and Fusion.

Hacker News · AIupdated · 3h agofirst · 6d agoModel release 13 sourcesHN 58↑ · 15 comments2

Hacker Conversations: Vinnie Liu, Performer Turned Ringmaster

SecurityWeek interviews Bishop Fox CEO Vinnie Liu, recruited by the NSA at 17 in 1999, on hacker ethics, intent, and his career.

SecurityWeek's Hacker Conversations series profiles Vinnie Liu, who was recruited by the NSA in 1999 at age 17 via an IRC contact and later became CEO of security consulting firm Bishop Fox. The interview covers his white-hat philosophy that hacking for fun differs from hacking to harm, the moral development he attributes to parents and educators, and the industry's shift from the NSA to commercial firms like @stake after its 2000 acquisition of L0pht Heavy Industries. The piece is biographical and opinion-oriented with no incident, vulnerability, or research content.

SecurityWeek · 6d agoIndustry

CISA Updates Insider Threat Guide With New Mitigation Advice

CISA updated its Insider Threat Mitigation Guide on September 9 with new case studies and guidance on hybrid work, AI and employee separations.

CISA published a revision of its Insider Threat Mitigation Guide, first issued in 2020, adding case studies, statistics and guidance for security, HR and leadership audiences. New material covers hybrid and remote work changes to physical and digital access, AI used to manipulate or deceive, access control, visitor screening and adverse employee separations. The agency framed the update around growing insider threat impact on critical infrastructure and pointed to preparedness resources for organizations without existing programs.

Infosecurity Magazine · 6d agoAdvisory

The 20 Most Common Passwords Hackers Target in 2026

Huntress details the 20 most common passwords of 2026 and how attackers use brute force, spraying, and credential stuffing against weak credentials.

Huntress published an awareness piece based on NordPass's seventh annual list of the 200 most commonly used passwords, compiled from exposed data in cyberattacks across 44 countries. The top passwords remain simple sequences and variants such as "123456", "admin", "password", and "P@ssw0rd", all crackable in under a second. The article explains four password attack types: brute force, password spraying, credential stuffing, and dictionary attacks. Huntress cites its own data showing more than 1 in 4 IT professionals consider employees' password habits their biggest weakness, and recommends avoiding common passwords, not reusing credentials, and combining letters, numbers, and symbols.

Huntress · 6d agoPhishing & fraud