ZeroHour

Search: “observations”

507 stories

Airrived adds Agentic Observability to track AI agent actions and risks

Airrived launches Agentic Observability to give enterprises end-to-end visibility into AI agent actions, permissions, data flows, and costs.

Airrived announced Agentic Observability, an expansion of its enterprise Agentic OS that traces the full agentic lifecycle from enterprise data ingestion through agent reasoning to business outcomes. The platform surfaces each agent's creator, owner, permissions, permitted actions, and human-in-the-loop approval requirements, and tracks movement of PII, PCI, and PHI across agentic workflows. It also adds token- and model-consumption tracking to turn AI spending into measurable AI FinOps.

Help Net Security · 2d agoAI industry

Characterizing Network Centralization and Observability in the Remote MCP Ecosystem

A measurement study of 179 remote MCP servers finds heavy infrastructure concentration (HHI 0.736) and a security-observability tradeoff in platform OAuth.

The paper introduces a three-tier observability framework (catalog metadata, passive compliance signals, live vulnerability analysis) applied to a stratified sample of 179 remote Model Context Protocol (MCP) endpoints from two public registries. The Herfindahl-Hirschman Index over ASN distribution is 0.736, well above the 0.25 high-concentration threshold, and 95% of commercial PaaS-hosted servers enforce gateway-level OAuth 2.1 with PKCE. Authentication correlates strongly with hosting platform choice rather than operator configuration, creating a security-observability tradeoff that constrains automated scanning for tool-poisoning vectors without prior credentials.

arXiv cs.CR · 13h agoAI safety & security

Do Input-Level Defenses Transfer to Observation-Level Attacks on VideoLLMs?

A systematic study shows input-level adversarial defenses provide inconsistent, often near-zero protection against observation-level attacks on video LLMs.

Researchers introduce DefTEval, a controlled framework testing eleven input-level defenses against five attack types across five video LLMs. Harmful-content detection rates are frequently near zero, and defenses fail even when attacks embed harmful signals in every sampled frame. Token compression discards localized safety features and modality fusion down-weights weakened visual signals, with defense outcomes dominated by model architecture rather than the defense method.

arXiv cs.CR · 8d agoAI safety & security

The Intelligible World of Agents

Recorded Future argues cybersecurity AI agents perform better when reasoning over structured, curated intelligence graphs rather than fragmented alerts or open-source noise.

In a vendor essay, Recorded Future describes how its security agents produced more authoritative analyses after being re-architected to reason primarily over the Recorded Future Intelligence Graph instead of weighting open-source information equally. The author argues agentic decision quality depends mainly on a structured, current operational world model of assets, vulnerabilities, threat actors, detections and organizational context, not on model intelligence itself. The piece further claims frontier model access is commoditizing and that orchestration tooling will converge, making trusted representations of organizational knowledge the durable competitive differentiator.

Recorded Future · 7d agoAI safety & security

numbat - AI agent observability, (Fri, Sep 4th)

SANS reviews Perplexity's open source numbat, a Go-based tool giving security teams observability, detection rules, and enforcement for AI agents like Claude and Gemini.

Numbat, Perplexity AI's open source observability tool, monitors desktop, CLI, IDE, and gateway AI agents through local hooks, OTLP/HTTP logs, and on-disk session artifacts. It ships detection rules mapped to MITRE ATT&CK (e.g., recon.network_sweep / T1046), supports enforcement mode, and packages investigations with SHA256-verified manifests and timelines. The SANS review positions it as a response to unmanaged AI agent and MCP server sprawl highlighted by the OpenAI/Hugging Face incident.

SANS Internet Storm Center · 12d agoAI tools & infra

Fast Learning Rates for Physics-Informed Kernel Methods

Theoretical analysis proves finite-sample learning rates for physics-informed kernel estimators, showing differential observations can improve rates from n^-1/4 to n^-1/2.

The paper analyzes a physics-informed kernel estimator combining n value observations and m differential observations for a linear differential operator D, asking how much differential information improves prediction. The authors prove finite-sample bounds, supported by simulations, revealing a two-regime structure: when m is limited the rate depends jointly on n and m, and when m exceeds a problem-dependent threshold the rate saturates to the oracle rate. Examples in Sobolev spaces, including partial Laplacian constraints on the torus and gradient observations on bounded domains, illustrate improvements from the nonparametric n^-1/4 rate to the parametric n^-1/2 rate, plus physically consistent rates in a stronger norm.

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

State of Open Models: Summer 2026 Observations

Hugging Face publishes observations on the state of the open-weights model ecosystem as of summer 2026.

A Hugging Face blog post titled 'State of Open Models: Summer 2026 Observations' surveys developments across the open-weights model ecosystem. No article text was available, so specific model releases, benchmarks, and findings are not detailed here.

Hugging Face Blog · Aug 14, 2026AI industry

Epsilon-Nash Equilibria in History-Dependent SA-MDPs

Researchers give the first algorithm for computing epsilon-approximate history-dependent equilibria in state-adversarial Markov decision processes with observation-perturbing adversaries.

The paper studies state-adversarial Markov decision processes (SA-MDPs) where an adversary knowing the true state perturbs observations within state-dependent proximity sets each step. The authors prove universal history-dependent equilibrium policies do not exist and reduce SA-MDPs to a strategically equivalent constrained zero-sum one-sided partially observable stochastic game, enabling the first algorithmic route to epsilon-approximations of initial-state dependent equilibria. The algorithm is validated on small analytically verifiable games and scales to larger benchmarks, including Atari Freeway rollouts with a 12-period-ahead horizon.

arXiv cs.CR · 15h agoAI safety & security