ZeroHour
DashboardNewsCVEsExploitsIncidentsAIBriefAnalyticsEntitiesWatchlistIOCsAsk the feedSourcesFeeds & APIKiosk mode

Search: “provenance-graph”

30 stories

Searchkeywordsmart
DomainAllCyberAIWindow24h3d7d30dAllIn the wildImportant onlyShow duplicates
CategoryAll
SeverityAllcritical 0high 0medium 0low 0info 0

Smart search ranks by meaning as well as keywords (one row per story, last 45 days).

GraphProfiler: Source-Linked Sensitive Attribute Inference via Personal Knowledge Graphs

GraphProfiler links LLM attribute inferences to source posts via personal knowledge graphs, enabling targeted redaction of privacy-leaking content.

GraphProfiler represents a user's post history as a source-linked personal knowledge graph where nodes and edges trace back to originating posts, making LLM-based attribute inference auditable. It reaches 86.7% attack success rate on the eight-attribute SynthPAI benchmark and 84.6% on PANDORA, within two points of strong text-only baselines, while citing supporting evidence for over 98% of predictions. Ablation experiments show removing cited posts reduces attack success substantially more than removing random posts, supporting targeted privacy mitigation.

arXiv cs.CR · 5d agoResearch1

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 · 1d agoResearch

Do AI Coding Assistants Check Before They Install? A Pre-Registered Demand-Side Audit of Trust Signals in the Research Software Supply Chain

Pre-registered audit finds AI coding assistants verified provenance signals in only 9 of 1,920 trials before installing research software packages.

The study tested whether AI coding assistants check machine-readable trust signals such as SBOMs, signed releases, and provenance attestations before installing six open-source research software projects spanning HPC and quantum computing. Three models under two operating modes produced 1,920 registered trials scored from container logs. Provenance signals were opened in only 9 of 1,920 trials (0.5%) and zero of 384 control trials, with no trial running a verification command. The authors conclude publishing signals is insufficient and verification must be built into the program running the assistant.

arXiv cs.AI / cs.LG / cs.CL · 9d agoAI safety & security

An Evidence Model for Agentic Processes: Evidence Claims, Trust Assumptions, and Policy Assessment

Researchers propose an evidence claim model defining which trust and audit claims agentic AI systems can support, mapping claims to mechanisms, assumptions, and threats.

The paper proposes an evidence claim model for agentic AI processes that exchange messages, invoke tools, request approvals, and modify shared artifacts. It distinguishes claim types such as artifact integrity, provenance, approval evidence, and policy assessment, mapping each to mechanisms, assumptions, limitations, and threats. It stresses that hashes, signatures, and external anchors do not establish semantic truth, authorization, or capture completeness. The contribution is conceptual, offering vocabulary for what an agentic black box can and cannot evidence and which controls must surround it.

arXiv cs.CR · 8d agoAI safety & security

The Pelican comparison grid for Astra is pretty interesting

Simon Willison's pelican SVG comparison shows GPT-6 Astra producing markedly better images than GPT-5.6 Sol, Terra, and Luna across reasoning levels.

Willison generated pelicans-riding-bicycles SVGs with newly accessed GPT-6 Astra at low through max reasoning levels and rendered them in a comparison grid against GPT-5.6 Sol, Terra, and Luna. Astra's outputs were markedly more coherent, while even the best GPT-5.6-Sol images remained largely abstract shapes. Astra does not support a reasoning=none setting, so all comparisons involved reasoning-enabled runs.

Simon Willison · 11d agoAI research

E2A-Bench: Benchmarking Evidence-to-Action Reliability in Financial Chart Reasoning

E2A-Bench, a 969-query financial chart reasoning benchmark, finds VLMs fail evidence-to-action consistency, with fine-tuning amplifying BUY:SELL bias 4-6x.

E2A-Bench is a 969-query benchmark built from 323 HS300 constituents across three input modalities with deterministic OHLCV-derived evidence anchors, evaluating grounding, reasoning-action consistency, evidence-confidence calibration, and directional coverage via UCR, RCI, ECI, and NDR metrics. Testing 20 VLMs showed the lowest-hallucination model ranked near the bottom on coverage with only 6.4% directional coverage, and oracle-aided verification reduced unsupported claims but could collapse coverage. Financial fine-tuning amplified the BUY:SELL ratio by factors of 4.21 to 4.68 across base-fine-tuned pairs.

Hugging Face daily papers · 4d agoAI research

An Evidence-First Multi-LLM Framework for Auditable Critical-Infrastructure Dependency Modeling

Evidence-first multi-LLM framework builds auditable critical-infrastructure dependency graphs while preserving provenance and unresolved cases.

The framework constructs Infrastructure Knowledge Bases and Infrastructure Dependency Graphs from heterogeneous infrastructure documentation using multiple open-weight LLMs that independently extract candidate entities and dependencies from normalized evidence. It separates evidence verification, ontology grounding, entity resolution, dependency alignment, validation, fusion, and human review, projecting the validated IKB deterministically into the IDG without new LLM-generated knowledge. Evaluation across nine infrastructure projects shows entity recovery achieves substantially higher recall than full dependency recovery, and cross-model overlap is much lower for dependencies than entities, indicating models often produce non-overlapping candidate assertions rather than stable consensus.

arXiv cs.CR · 5d agoResearch

Decomposition Buys Integrity, Not Yield

Study of 600 production deep-research traces finds agent-tree decomposition loses findings at rate N^(1-δ); flat architectures maximize yield.

The paper models multi-agent decomposition as a tree where an agent holding b items retains each with probability r(b); with r(b)=1/b every tree delivers exactly one finding regardless of shape. Analysis of 600 production deep-research traces estimates delta=0.34 retention decay, and 1,012 annotated traces show one brief in sixteen goes off-target per tier, giving an alignment penalty of 0.536. Depth still cuts root context exposure from N to N^(1/k) and is cheaper at scale, with a hazard model over 743,819 production tool calls showing delegation is an opening move rather than a response to filling context.

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

LandingAI Releases Agentic Document Extraction Gen2 with DPT-3 Pro and DPT-3 Verity

LandingAI shipped Agentic Document Extraction Gen2 with DPT-3 Pro and DPT-3 Verity parsing models, adding usage-based billing, block-tree outputs, and word-level grounding.

LandingAI has generally released Agentic Document Extraction Gen2, rebuilt around two parsing models: DPT-3 Verity for deterministic transcription of digital documents with per-word bounding boxes and confidence scores, and DPT-3 Pro for layout-aware parsing of scans, handwriting, non-Latin scripts, and LaTeX math. Billing changes from a flat 3 credits per page to a page-plus-output-character model (Pro: 1 credit/page plus 0.5 credits per 1,000 output characters on priority; Verity: 0.3 plus 0.2), with an asynchronous standard tier at 0.5x price and vendor-claimed 25-80% cost reductions. Parse v2 returns a document-page-block tree with semantic IDs, normalized bounding boxes, and line- or word-level atomic grounding, replacing flat chunks; Gen1 client code will not run against Gen2 endpoints. Deployment options include US/EU cloud, VPCs on AWS, Azure, and Google Cloud, Snowflake, and air-gapped on-premises environments, with automated model routing planned for fall 2026.

MarkTechPost · 6d agoAI tools & infra

Procedural Graphs: Self-Evolving Execution Structures for LLM Agents

Procedural Graph framework stores procedural knowledge as triplets and self-evolves via LLM refinement, beating memory-based baselines across datasets, tasks, and LLMs.

The Procedural Graph organizes procedural knowledge into (procedure, relation, procedure) triplets; at each decision step the framework localizes the agent's active node and a guidance model translates the surrounding subgraph into step-level guidance that biases the solver's next action. An LLM refiner contrasts failed with successful trajectories and edits the graph's topology and attributes, retaining rejected edits to discourage repetition. Starting from a minimal skeleton, the loop builds graphs that match or surpass hand-designed ones and can repair flawed expert priors, delivering consistent gains over memory-based baselines across multiple datasets, task types, and LLMs.

Hugging Face daily papers · 9d agoAI research1

Think Before You Link: Rarity, Reasoning, and Retrieval in Multilingual Entity Linking

Training-free reasoning-plus-retrieval framework lifts multilingual multimodal entity linking accuracy by 6.9% overall and up to 23.3% on rare entities.

The paper broadens rarity measurement in multimodal entity linking using knowledge-graph structural metrics beyond popularity-based pageview metrics, identifying many rare entities that popularity metrics miss. Across these rare-entity slices, state-of-the-art accuracy drops by 15.4-39.9%, exposing distinct failure modes under different rarity definitions. The proposed training-free framework iteratively searches and reasons over Wikipedia with a reasoning-capable vision-language model; experiments show reasoning and retrieval are complementary. On the MERLIN benchmark covering Hindi, Indonesian, Japanese, Tamil, and Vietnamese, the system improves overall accuracy by 6.9% and up to 23.3% on rare entities, with MERLIN-Rare test slices released.

Hugging Face daily papers · 8d agoAI research

VeriScene: Reconstructing Crime Scenes from Legal Evidence via World-Model Agent

Researchers present VeriScene, a world-model agent that reconstructs crime scenes from forensic photos and witness statements with traceable, physically plausible output.

VeriScene orchestrates a world model to fuse forensic photographs and witness statements of varying reliability into cited narratives and physically plausible re-enactment videos. On a 25-scenario benchmark with planted unreliable testimony, it reaches 0.9014 evidence coverage and 0.7217 factual consistency on 20 test scenes. It outperforms an end-to-end multimodal-LLM baseline by 20.35% in factual consistency and 34.88% in temporal coherence at USD 1.82 per scene.

arXiv cs.CR · 8d agoAI research

ReCite: Agentic Reasoning for Faithful Citation

ReCite is an agentic citation framework using claim-level reasoning and verification, outperforming large generative models in strict citation accuracy.

ReCite is a decoupled agentic framework that orchestrates location perception, intent-aware query planning, and reflective verification for citation recommendation. Trained on synthesized reasoning trajectories, the agent verifies claim-evidence consistency and triggers self-correction loops when retrieved candidates lack logical support. Experiments show the lightweight framework outperforms state-of-the-art massive generative models in strict citation accuracy, addressing misattribution where cited papers are real but logically unsupportive.

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

Does Your Agent's Memory Survive a Model Upgrade? A Controlled Study of Memory Portability

A controlled study finds agent memory portability varies sharply: fixed-schema knowledge graphs survive model swaps while compressed notes degrade.

The study compares preserving an agent's history as raw long context, RAG chunks, compressed natural-language notes, or fixed-schema knowledge graphs across model upgrades, using 48 synthetic histories and two open-weight sub-10B-parameter models. Fixed-schema KG accuracy changed by only +0.0004 ± 0.0020 after a writer swap, while compressed NOTES shifted asymmetrically by +9.91 or -13.28 percentage points depending on migration direction. Mixed 50/50 embedding migrations captured only 4.96 of an 11.90-point RAG re-embedding gain; 80% of the NOTES deficit came from information lost at construction, and 81% of the RAG deficit from retrieval failures. Store-only repair of NOTES failed to reach 90% recovery in all 48 cases, while retaining raw histories enabled recovery in 34 of 48 for one direction.

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

.blend URL Viewer

Simon Willison demos a .blend URL viewer built with GPT-6 Astra in Codex and ChatGPT Images 2.5 generating Blender models.

Simon Willison used ChatGPT Images 2.5 to generate a Faberge egg concept image themed after the TV show Pluribus, then had Codex running GPT-6 Astra (high) execute a Blender local skill to build a 3D model from it. He published the result as a .blend URL viewer tool and continues experimenting with agentic Blender workflows. The post is a hands-on demo of AI-driven creative tooling rather than a security or release announcement.

Simon Willison · 6d agoAI tools & infra

Evidence-Grounded Retrieval for Investigation Hunt Lead Generation from CTI Reports

AHLERT generates environment-aware threat hunting leads from CTI reports using ATT&CK-seeded knowledge graph retrieval, roughly doubling F1 over flat-RAG baselines.

The paper introduces AHLERT, a system that converts Cyber Threat Intelligence reports into structured, investigable hunt leads via hybrid dense retrieval with multi-hop traversal over an MITRE ATT&CK-seeded knowledge graph and ontology-grounded RAG constrained to the defender's assets. It is LLM-agnostic and evaluated on public CTI reports for well-known APTs across proprietary and open-weight models. Hybrid evidence retrieval with ontology grounding raises mean F1 from 0.44 to 0.85, and AHLERT attains the highest effectiveness score (~86.95%) versus off-the-shelf LLMs.

arXiv cs.CR · 8d agoResearch

Procedural Graphs: Self-Evolving Execution Structures for LLM Agents

Researchers introduce Procedural Graphs, self-evolving (procedure, relation, procedure) structures guiding LLM agent tool use and planning.

Procedural Graphs organize procedural knowledge into (procedure, relation, procedure) triplets to guide LLM agent actions, addressing drift such as lost objectives, out-of-order tool calls, and repeated unproductive steps. At each decision step the framework localizes the active node and a guidance model translates the surrounding subgraph into step-level situational guidance. An LLM refiner edits graph topology by contrasting failed with successful trajectories, and across datasets, task types and LLMs the approach outperforms memory-based baselines and matches or surpasses hand-designed graphs.

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

A Graph-Based Approach for Mapping Kernel-Level Telemetry to MITRE ATT&CK

Trace2ATT&CK maps eBPF kernel telemetry to MITRE ATT&CK via provenance graphs and RAG with local open-weights LLMs, validated on 347 Atomic Red Team tests.

Trace2ATT&CK collects kernel-level events via eBPF, correlates attacker commands into a provenance graph, and derives compact graph representations suitable for LLM-based reasoning, mapping behavior to MITRE ATT&CK techniques with ranked candidates and rationales. Mapping uses both pure LLM prompting and retrieval-augmented generation grounded in the ATT&CK knowledge base. It was evaluated on 347 Linux Atomic Red Team tests using locally deployed open-weights LLMs. RAG consistently improved ATT&CK mapping over pure prompting, and provenance graphs substantially outperformed raw telemetry, without compromising data confidentiality.

arXiv cs.CR · 5d agoResearch

Molecular Déjà Vu: Digit-Level Retrieval of Published Values in Frontier Language Models

Audit of 22 frontier models finds widespread verbatim retrieval of published molecular property values, with higher reasoning increasing recall of memorized numbers.

An arXiv audit tests 22 frontier LLMs across 12 molecular regression benchmarks for verbatim retrieval of published values. More than 50% of the LLMs show verbatim retrieval on five datasets, and identical experiments are flagged 89% more often at a high reasoning level than at the lowest one. Suppressing retrieval moves model prediction errors closer together in relative terms, suggesting predictive capability is not determined solely by memorized values.

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

Opaque recurrence, and other AI terms that you should probably know

TechCrunch updates its plain-English glossary defining common AI terms from AGI and agents to chain-of-thought reasoning.

TechCrunch maintains a regularly updated glossary of AI terminology, defining terms such as AGI, AI agents, API endpoints, chain of thought, coding agents, compute, deep learning, and diffusion. It highlights 'opaque recurrence', the reasoning technique in OpenAI's new Astra model that has drawn attention from AI safety researchers. The piece is an educational living document rather than new research or a product announcement.

TechCrunch · AI · 9d agoAI industry1

Automating Attack Graph Construction for Agentic Pentesting. Towards Neuro-Symbolic Vulnerability Hunting

Semi-automated pipeline converts Trivy, Semgrep, Nmap output into MulVAL attack graphs for agentic pentesting, 53.7% mean vulnerability coverage in CyBench.

The paper presents a semi-automated pipeline that parses Trivy, Semgrep, and Nmap findings into MulVAL predicates and uses an LLM-assisted process to build domain-specific Datalog rules linking scanner evidence to attack techniques. MulVAL/XSB then performs symbolic inference to generate structured, auditable attack paths for agentic pentesting. Evaluated on 54 web CTF tasks from CyBench, every task produced at least one goal-reaching graph with 53.7% mean ground-truth vulnerability coverage, 51.9% full coverage, and an 83.9% noise-path rate. Median end-to-end runtime was 24.9 seconds, making the pipeline runtime-practical for agentic workflows.

arXiv cs.CR · 2d agoResearch

What Else Needs Fixing? Exploring Cost-Effective Test-Time Compute for Revision Propagation in Artifacts Generated Through Conversation

A new benchmark shows LLMs reach 68.3-93% accuracy propagating local revisions across conversationally generated artifacts, with parallel-sample selection most cost-effective.

The paper introduces a benchmark for revision propagation: when users request a local change, LLMs must identify dependencies and update all affected parts of an artifact generated through conversation, where context lives in the chat history. Nine revision methods, including sequential reflection and parallel sampling variants, were evaluated on gpt-oss-20b/120b, gpt-5.4-mini, and qwen3.5-9b/27b/122b. Baselines scored 68.3-93% accuracy, and selecting among three parallel samples via LLM-based or medoid selection improved accuracy by 2.2-9.7% as the most cost-effective test-time compute strategy. Code and dataset are released.

Hugging Face daily papers · 14d agoAI research

Root-Cause Attribution Is a Search Problem: Continual Search for Long-Horizon Agent Failures

Continual Search framework iteratively prompts LLM judges to keep searching agent execution logs, boosting long-horizon failure root-cause attribution accuracy.

The paper frames automated root-cause attribution (RCA) for long-horizon AI agent failures as a search problem, since relevant evidence is sparse and distributed across massive execution traces. The authors propose Continual Search, an iterative framework that nudges an LLM judge across successive turns to keep hunting unresolved diagnostic evidence instead of settling on an early plausible diagnosis. They introduce MegaRCA-Mix, a benchmark of 50 human-annotated failure trials on long-horizon, execution-heavy tasks. On MegaRCA-Mix, Continual Search improves GPT-5.5's F1 from 0.349 to 0.498 (over 40% gain), and lower-tier models can surpass higher-tier counterparts when search is effective.

Hugging Face daily papers · 6d agoAI research1

Technical Manual for a Toolkit for Measuring Contextual Individuation in Transformer Language Models

An open methodology toolkit measures whether transformer language models contextualize fixed word forms across domains using bridge forms and layer-wise silhouette analysis.

The manual documents an open toolkit built around 'bridge forms' - identical written words recurring across two or more subject domains with a different sense in each - to test whether transformer language models individuate word occurrences by context beyond the embedding layer. It covers declarative specification of bridge forms, Wikipedia corpus acquisition, occurrence localization, layer-wise representation extraction, domain-pairwise silhouette measurement, and visualization, justifying each choice against failure modes such as sense contamination and subword-tokenization misalignment. It is a methodological and implementation reference and reports no empirical results.

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

TRACE: Trajectory-robust Admission with Evidence Ordering for Efficient GUI Agents

TRACE, a training-free visual token pruning framework, cuts GUI agent inference latency and memory while keeping trajectory-wide visual evidence reusable.

TRACE is a training-free framework for trajectory-robust admission and coverage-aware evidence ordering that prunes high-resolution screenshot tokens accumulated in GUI agent trajectories. It ranks visual evidence using a query-independent layout-derived interaction prior combined with instruction relevance and feature novelty, and reserves part of the budget for native tokens distributed across the screen to repair spatial coverage. A monotone KV contraction incrementally compresses retired frames into compact session state, avoiding repeated visual encoding or pruning. Experiments across six GUI benchmarks and diverse models verify effectiveness under tight budgets, with source code to be released.

Hugging Face daily papers · 8d agoAI research

GPT-6 Astra needs leaner prompts and fewer guardrails, OpenAI recommends

OpenAI's Eric Provencher advises developers using GPT-6 Astra to shorten skill descriptions, trim AGENTS.md reading requirements, relax approval rules, and define clear completion goals.

OpenAI's Eric Provencher published guidance on adapting developer setups when switching to GPT-6 Astra, arguing that overly long skill descriptions, blanket reading requirements, and rigid approval rules waste context or make the agent stop too early. Skills are Markdown prompt files whose names and descriptions enter Codex's context, and too many or conflicting skills cause truncation and wrong skill selection. He recommends selective document references in AGENTS.md, explicit permissions for safe operations like local test runs, and defining upfront what "done" means, since Astra may stop earlier than GPT-5.6 Sol even without restrictions.

The Decoderupdated · 4d agofirst · 4d agoAI tools & infra 10 sources1

Stealing AI Reasoning Traces

Researchers demonstrate a decryption jailbreak that extracts encrypted reasoning traces from Anthropic, OpenAI, and Google LLM APIs via weaker sibling models.

The paper exploits the fact that encrypted chain-of-thought blocks returned by LLM providers are interchangeable across sessions, users, and models within a provider's ecosystem. Injecting an encrypted trace into a weaker, less-safeguarded model from the same provider forces it to output the trace in plaintext, bypassing anti-distillation mechanisms. Decoding 315,320 reasoning blocks scraped from public repositories recovered 367 PII artifacts and 182 credentials, showing large-scale private data leakage. The flaw also enables hidden hazardous information disclosure and invisible prompt injections embedded in encrypted blocks; mitigations were proposed after responsible disclosure.

Schneier on Security · 8d agoAI safety & security