76 results for “recall”

List Grid

What you seeeverything

Recent Oldest Added A–Z

All types76 Papers35 Articles27 Write-ups8

More types4

Repos3 Courses1 Other1 Threads1

“recall”

bleepingcomputer.comarticle🛡️ Security

Drupal warns of critical Commerce Core flaw exploited in attacks

Drupal Commerce Core has a critical missing-authorization flaw, CVE-2026-118539, that unauthenticated attackers exploit in the wild. It affects versions 0.0.0 to 2.41 and 3.0.0 to 3.3.13. Drupal urges upgrading to 3.3.13 (or 8.x-2.41 on the older branch) and auditing orders for inconsistencies. The article also recalls CVE-2026-9082, exploited in May and added to CISA KEV, and two RCE patches (CVE-2026-108097, CVE-2026-108099).

DrupalDrupal Commerce Core

CVE-2026-118539CVE-2026-9082CVE-2026-108097+3

AppSec, Threat Intel· Published and added 30 Oct 2026

depthfirst.comarticle🧠 AI

dfbench — depthfirst

dfbench is depthfirst's held-out benchmark for frontier models on open-ended defensive security work: vulnerability detection, validation of findings, and differential analysis between commits. It reports recall, precision, F1 and cost per task for about 20 models at several thinking levels, split by domain (application, low level, smart contract) and by single or multi-repo scope. Overall detection recall ranges from about 21% to 69%.

LLM

dfbenchdepthfirstGPT-5.6 Sol+16

evals· Added 29 Oct 2026

depthfirst.comarticle🛡️ Security

dfbench — depthfirst

dfbench is a held-out benchmark maintained by depthfirst that scores frontier LLMs on defensive security work: vulnerability detection, validation (precision) and differential analysis between commits. It reports recall, precision, F1 and cost per task by model and thinking level, split by application, low-level and smart-contract code and by single or multi-repo scope. Overall detection recall runs from about 21% to 69%, with the top figure at $99.19 per task for Mythos 5; validation precision mostly falls between 15% and 49%.

LLMKimi K3Grok+3

dfbenchdepthfirstGPT-5.6 Sol+3

AI Security, AppSec· Added 29 Oct 2026

simonwillison.netarticle🧠 AI

Quoting Ted Sanders

Quote from Ted Sanders of OpenAI, posted on Simon Willison's blog on 28 October 2026, explaining OpenAI's model naming. Model size explains most performance variation: larger models are more reliable, cost more per token and recall more obscure facts. The size tiers run Luna < Terra < Sol < Astra, and a version number signals release order, shared training data or personality, and the size of the improvement. The excerpt is short and gives no benchmark data.

LLM

Ted SandersOpenAISimon Willison+3

models· Published and added 28 Oct 2026

arxiv.orgpaper🧠 AI

When LLM Architectures Meet Smart Contract Vulnerability Detection: a Replication Study

This paper replicates Chen et al.'s study of LLM-based smart contract vulnerability detection, first on GPT-4 and then on Mixture-of-Experts, RNN-like and State Space Models. The exact replication confirms the high-recall, low-precision pattern on GPT-4. The differentiated replication finds the pattern does not transfer uniformly: GPT-4 and Gemma-3 behave alike despite a roughly 100x parameter gap, while two MoE models diverge.

LLMTransformerMixture of Experts+3

Chen et al.GPT-4Gemma 3+1

research, evals· Added 30 Oct 2026, published 28 Oct 2026

arxiv.orgpaper🛡️ Security

When LLM Architectures Meet Smart Contract Vulnerability Detection: a Replication Study

This arXiv paper (October 2026) replicates Chen et al.'s study of LLM-based smart contract vulnerability detection. It confirms the high-recall, low-precision pattern on GPT-4, then tests Mixture-of-Experts and RNN-like models plus a preliminary State Space Model run. Gemma-3 matches GPT-4's profile despite far fewer parameters, while two Mixture-of-Experts models diverge, so architecture family alone does not predict detection behavior.

GPT-4GemmaLLM

Chen et al.

AI Security, AppSec· Added 30 Oct 2026, published 28 Oct 2026

decrypt.coarticle🛡️ Security

Coinbase Customer Data Hit in Analytics Vendor Breach, Funds ‘Not Impacted’

Coinbase said on 28 October 2026 that a security incident at analytics vendor Amplitude exposed contact data of a "small subset" of its customers. Coinbase reports no unauthorized access to its own systems and no impact on funds. It gave no counts, data types or dates. The article recalls the May 2025 bribed-support-agent breach (69,461 customers) and the 2025 Trezor/ShipMonk exposure.

Amplitude

CoinbaseShipMonkTrezor+1

Threat Intel· Published and added 28 Oct 2026

securityweek.comarticle🛡️ Security

Hackers Start Probing Fresh Oracle EBS Vulnerability

CVE-2026-101767 is a CVSS 9.8 unauthenticated SQL injection in the Application Object Library of Oracle E-Business Suite, patched in Oracle's October 2026 CPU and reported by Horizon3.ai. Defused decoys logged the first exploratory attempts on 27 October 2026, and the flaw could lead to remote code execution. The article recalls CVE-2026-46817 attacks in June and last year's Cl0p zero-day campaign against EBS.

Oracle E-Business SuiteCVSS

CVE-2026-101767CVE-2026-46817Cl0p+4

Threat Intel, AppSec· Published and added 28 Oct 2026

arxiv.orgpaper🧠 AI

Complementing Text Based Moderation with Multimodal Grounding: Detecting Fraudulent Inducement Behaviors on Short Video Platforms

The paper studies detection and temporal localization of fraudulent inducements (prompts to follow, join chat groups, click links) in internet finance short videos. It compares OCR+LLM, OCR+MLLM and a zero-shot MLLM, and builds a dataset of 2,419 videos (66.49 hours, 3,194 events, four categories). OCR+MLLM reaches mIoU 26.52 versus 14.49 for keyframe OCR+LLM, with 67.0 percent macro recall, using a recall-weighted F2 localization reward.

MLLMLLMOCR

arXiv

research, multimodal, training· Added 30 Oct 2026, published 28 Oct 2026

arxiv.orgpaper🧠 AI

HerHealthGPT: An Evidence-Grounded Conversational AI System for Women's Reproductive Health Copy title

HerHealthGPT is a conversational AI system for women's reproductive health that combines retrieval-augmented generation, context-aware clarification and source validation in a web interface. Evidence retrieval raises concern-category accuracy from 54.1% to 59.3% over fine-tuning alone on 540 messages from 90 cases. The clarification router reaches 85.6% recall and 86.2% specificity. In a 30-adult study, 83.3% preferred the retrieval-enabled version. The authors say clinical validation is still needed.

RAGLLM

HerHealthGPTarXiv

research, llm-apps· Added 27 Oct 2026, published 24 Oct 2026

arxiv.orgpaper🧠 AI

DRILS: Dependency-based Requirement Change Impact Analysis Using LLMs

DRILS is an LLM-based agentic framework for requirements change impact analysis. It uses multiple agents to generate candidate impact sets, with an LLM-as-a-judge promoting diversity in selection. It adds RE-RAG, a tuned retrieval technique, and a requirement dependency graph as a knowledge source. On three curated datasets it reaches 87.1% recall, 76.3% precision and 81% F1 at lower cost than baselines. The authors release the datasets.

LLMRAG

arXivDRILSRE-RAG

research, agents, llm-apps· Added 27 Oct 2026, published 24 Oct 2026

arxiv.orgpaper🧠 AI

Enhancing LLM-Based Vulnerability Detection via Representation-Aware Logical Ensemble

RALE (Representation-Aware Logical Ensemble) is a method for LLM-based vulnerability detection in C code. The authors train LLMs on raw source code, Abstract Syntax Trees and Control Flow Graphs, and find each representation works best for certain vulnerability classes. Combining the models with explicit logical rules and majority voting raises F1 from at most 73% for a single model to 78%, with gains in accuracy, precision and recall.

LLMstatic analysis

arXivRALE

research, training· Added 28 Oct 2026, published 24 Oct 2026

arxiv.orgpaper🧠 AI

Eat Your Precision: Precision Objective Mitigates Reward Hacking in Rubric-based RL

FORK is a reward for rubric-based reinforcement learning that jointly optimizes recall and a new precision objective. Precision requires each unit of a response to be necessary (rubric-driven necessity credits) and factually correct (a grader). Rubric-coverage rewards otherwise produce verbose, less accurate responses. FORK keeps similar coverage with shorter outputs, raising win rate against the base policy from 10.6% to 68.0% on RubricHub-Medical and from 22.1% to 74.1% on HealthBench.

LLM

HealthBenchRubricHub-MedicalFORK

training, research· Added 27 Oct 2026, published 24 Oct 2026

arxiv.orgpaper🛡️ Security

Deletion, Substitution, Repair and Transplant: Component Attribution in BARBICAN, a Layered Prompt-Injection Gateway for MCP

BARBICAN is a fail-closed prompt-injection gateway for MCP tool mediation. This paper shows its arbitration classifier ran on tokenizer-mangled text for a whole evaluation. Fixing it raised AUC from 0.392 to 0.855 while system recall fell from 80.67% to 80.34%. The routed band is 96.82% malicious, so deletion ablations mislead without substitution experiments and class-balance reporting.

Model Context ProtocolLLM

BARBICANprompt injection

AI Security· Added 27 Oct 2026, published 23 Oct 2026

arxiv.orgpaper🧠 AI

Deletion, Substitution, Repair and Transplant: Component Attribution in BARBICAN, a Layered Prompt-Injection Gateway for MCP

The paper analyses BARBICAN, a fail-closed prompt-injection gateway for MCP tool mediation, using deletion, substitution, repair and transplant experiments. Its arbitration classifier ran on tokenizer-mangled text for a whole evaluation. Fixing that raised AUC from 0.392 to 0.855 while system recall fell from 80.67% to 80.34%. The band it receives is 96.82% malicious. The authors argue ablation figures need the band's class balance and substitution baselines.

Model Context Protocol

BARBICAN

evals, research, mcp· Added 27 Oct 2026, published 23 Oct 2026

arxiv.orgpaper🧠 AI

How Ground Truth Shapes Retrieval Scores: Evidence-Aware Evaluation of a Retrieval-Augmented Generation System for Breast Lesions

This paper describes an evidence-aware retrieval evaluation protocol for a clinical RAG system over breast lesion management literature. Relevance is defined by evidence spans mapped to all containing chunks. A hybrid retriever (dense, BM25, cross-encoder reranking) with 384-token chunks and 20% overlap reached 0.94 Recall@3 on 18 queries. Expanding ground truth from 25 to 37 spans did not change rankings. The authors note the small set needs independent validation.

RAGBM25LLM

DeepSeekDeepEvalarXiv

llm-apps, evals, research· Added 24 Oct 2026, published 22 Oct 2026

arxiv.orgpaper🧠 AI

Chunk Recomputation under Real Document Revisions: Measuring Update Cost and Retrieval Quality of Fixed, Recursive, and Content-Defined Chunking

Chunk Recomputation under Real Document Revisions measures how much text must be re-embedded after edits for three stateless chunkers (non-overlapping fixed-size, recursive paragraph-first, content-defined) on 120 pairs of adjacent Chinese and English Wikipedia revisions. Fixed-size recomputes 57-68% of the new-version workload, recursive 38-56%, content-defined 43-54%, while evidence recall at a 2048-token budget differs by under two points. The authors argue update cost should be reported alongside retrieval quality.

RAG

WikipediaarXiv

llm-apps, research, evals· Added 24 Oct 2026, published 22 Oct 2026

x.comthread🧠 AI

elvis (@omarsar0) on X

FrontierMemory is a benchmark that evaluates agent memory through downstream task performance, measuring how agents learn from experience rather than recall, which the post says is saturated via agentic search. In elvis's summary, Claude Opus 5.5 ranks first and open-weight GLM-5.3 does well on memory generation. The authors reply that "memory" here means any adaptation from experience, so harness-level changes can also be scored. The post gives no scores or links.

LLM

FrontierMemoryClaude Opus 5.5GLM-5.3+2

evals, agents· Added 23 Oct 2026, published 21 Oct 2026

arxiv.orgpaper🛡️ Security

Context-Aware Prompt Injection Detection via Small Language Models in RAG Pipelines: nokast-secureRAG

nokast-secureRAG is a roughly 0.5B-parameter small language model that works as a semantic firewall between retrieval and generation in local RAG systems. It classifies each query and context pair as safe, suspicious or malicious. It reaches 0.994 recall at a 0.026 false-positive rate in-distribution, beating Llama Guard 3 1B and Prompt-Guard-86M (0.900 recall, 0.690 FPR). Recall on PoisonedRAG falls to near zero, and single-request latency is 293-404 ms.

Llama Guard 3LLM

indirect prompt injectionretrieval poisoningPoisonedRAG+2

AI Security· Added 22 Oct 2026, published 20 Oct 2026

endorlabs.comwriteup🛡️ Security

SBOM vs. SBOM: Comparing SBOMs from Different Tools and Lifecycle Stages | Endor Labs

Case study running three open source SBOM generators (two generic, one Maven plugin) on Eclipse Steady 3.2.5 rest-backend at three lifecycle stages (git clone, Maven package, Docker image), yielding 8 CycloneDX SBOMs. Compares precision/recall against the mvn dependency:tree ground truth and finds the Maven-integrated tool perfect (1.0/1.0) while generic tools miss versions, groupIds and transitive dependencies. It also shows PURL qualifier differences (e.g. type=jar, apt qualifiers) make SBOMs hard to compare, test dependencies are indistinguishable, and argues for an SBOM generator benchmark.

SBOMCycloneDXMaven+3

Eclipse SteadyPackage URLNTIA+3

Supply Chain· Published and added 16 Oct 2026

arxiv.orgpaper🧠 AI

Knowledge That Is Linear Before Fine-Tuning Generalizes After It

The paper separates "active" facts (which support generalization beyond recall) from "inert" ones. It builds new relations by relabeling answers of existing ones (Paris -> Europe becomes Paris -> crab), fine-tunes on a subset of subjects, and tests held-out subjects that share an answer (Munich -> crab). Across eleven language models and 70 relations, linear readability of the original relation in pretrained representations correlates with this generalization at Pearson r = 0.87 to 0.92 within each model. The result holds after controlling for fine-tuning set size, original-relation accuracy and subject frequency in pretraining text, and it survives re-randomized labels, seeds and thirteen other label categories. Mapping wrong labels back to the original answers shows the fine-tuned model's errors follow the linear probe's top answers.

LLM

arXiv

research, training· Added 17 Oct 2026, published 15 Oct 2026

securitylabs.datadoghq.comwriteup🛡️ Security

Jev as a judge: How counterfeit policy steers Jev

Datadog Security Labs tests TypeSafe AI's Jev decision model as a prompt-injection detector and as the judge behind LangChain's tool-risk gating. On four public datasets Jev had 99.66% precision and 82.90% recall. A prepended "counterfeit policy" that redefines the attack categories cut recall by over 79 points. In a LangChain scenario, a user-editable profile field lowered the mean is_risky score from 0.893 to 0.290, below the 0.5 block threshold. Plain prompt injection did not move the score.

JevLangChain

TypeSafe AIcounterfeit policyprompt injection+3

AI Security· Added 29 Oct 2026, published 15 Oct 2026

github.blogarticle🧠 AI

GitHub’s model for secret detection: Finding more secrets with less noise

GitHub describes replacing an LLM-based generic secret detection pipeline with a two-stage system. High-recall regex generates candidates, then a fine-tuned ModernBERT classifier scores each one using its file path, secret type, variable names and surrounding context. Training data mixes product feedback, weak-labelled regex candidates and synthetic hard negatives, with splits grouped by repository, value or example. The model is exported to ONNX with 8-bit quantization. Reported results against the LLM pipeline: 13% higher precision, 19% higher recall, 11.5% higher owner-weighted acceptance in an A/B test, 86% lower median post-push scan time and over 98% lower serving cost. It is a concrete case for using a small fine-tuned encoder instead of an LLM on a narrow, measurable classification task.

ModernBERTONNXGitHub

Microsoft

training, inference· Published and added 13 Oct 2026

github.blogarticle🛡️ Security

GitHub’s model for secret detection: Finding more secrets with less noise

GitHub describes its secret scanning pipeline for generic secrets. Regex finds candidates with high recall, then a fine-tuned ModernBERT classifier reads the candidate with its file path, secret type and surrounding code to filter hard negatives such as placeholders, fixtures and checksums. The post covers the training data (product feedback, weak labels, synthetic hard negatives), grouped train/eval splits, and ONNX 8-bit quantization. Reported results against the earlier LLM pipeline: 13% higher precision, 19% higher recall, 11.5% higher owner-weighted acceptance, 86% lower median scan time and over 98% lower serving cost. The speed gain made generic secret detection feasible in push protection.

GitHubModernBERTONNX+1

push protectionhard negatives

DevSecOps, AI Security· Published and added 13 Oct 2026

arxiv.orgpaper🛡️ Security

LLM-based Code Auditing by Inferring and Evaluating Developer Assumptions

Presents Creed, an LLM-based code auditing approach that infers a developer's security-related beliefs for a function, scores how reasonable each is, and derives the conditions under which it is violated. It catches domain-specific semantic flaws that syntactic static analysis misses, such as a timing side-channel that undermines user-enumeration protection. The paper also introduces two measures for explanation-based vulnerability detection, recall and overhead. On a recent real-world benchmark, Creed beats existing explanation-based tools on the effectiveness-effort trade-off.

LLM

Creedtiming side-channeluser enumeration

AI Security, AppSec· Added 15 Oct 2026, published 11 Oct 2026

arxiv.orgpaper🧠 AI

LLM-based Code Auditing by Inferring and Evaluating Developer Assumptions

Presents Creed, an LLM-based code auditing approach that, for a given function, infers the developer's security-related beliefs, scores how reasonable each belief is, and derives the conditions under which it is violated. This lets it find semantic flaws, such as timing side-channels in authentication, that syntactic static analysis tools miss, and it explains root cause, symptoms and exploitability. The paper also introduces two evaluation measures for explanation-based vulnerability detection: recall (how well a known vulnerability is correctly explained) and overhead (the effort of inspecting reports). On a recent real-world benchmark, Creed beats existing explanation-based tools on the effectiveness-effort trade-off.

LLMstatic analysis

CreedarXiv

research, evals· Added 15 Oct 2026, published 11 Oct 2026

arxiv.orgpaper🧠 AI

Stale, Misattributed, or Late: Where Personal Memory Fails Before Generation

This paper introduces Personal Fact Memory (PFM), a reference layer for diagnosing errors in language-agent memory systems before generation happens, separating stored-state validity, identity resolution, abstention and serving latency. On a controlled revision benchmark, serving only the active value per correctly keyed slot eliminates stale exposure (versus 70.3 percent stale exposure without update resolution), while participant-aware BM25 matches a reference ranker within a 0.02 margin once stores are shared. The harder problem is revision-to-slot assignment: four LLM key assigners get higher key recall than a rule-based extractor but lower clean-retrieval rates, open-domain merge recall on LongMemEval never exceeds 0.062, and entity-posterior filtering reduces but does not eliminate same-name misattribution on LoCoMo; prompt prefill, not retrieval, dominates turn-level latency.

BM25

LongMemEvalLoCoMo

agents, evals· Added 8 Oct 2026, published 7 Oct 2026

arxiv.orgpaper🧠 AI

Does Document Structure Help Dense Retrieval? A Placebo-Controlled Ablation of Four Mechanisms Across Two Corpora

This paper runs a mechanism-isolating ablation of four document-structure treatments used in retrieval-augmented generation — structure-aligned chunking, LLM-generated chunk contexts, heading-path metadata, and hierarchical two-stage retrieval — under one protocol with matched chunk sizes and a semantically null placebo (shuffled heading paths) to control for the confound that any prepended text perturbs embeddings. Using a coverage-aware nDCG metric and document-clustered bootstrap with Holm correction across 200 Wikipedia Featured Articles (951 queries) and 1,585 QASPER papers (4,303 questions), it finds that structure-aligned chunking with real heading paths beats both contextualized fixed windows and the placebo, naive hierarchical retrieval hurts performance (traced to first-stage section recall failures), and gold structure beats LLM-induced structure on Wikipedia but not QASPER. Effect sizes are small but statistically significant and consistent across corpora, giving RAG practitioners evidence-based guidance on which structure-aware retrieval tricks actually help versus which are placebo effects.

QASPERWikipedia Featured Articles

research, llm-apps· Added 8 Oct 2026, published 7 Oct 2026

arxiv.orgpaper🧠 AI

UNREAL: Unifying Retrieval and Long-Context with a Single Model

UNREAL is a model-native evidence-selection framework that unifies corpus retrieval and long-context inference using a single mechanism built on top of a frozen LLM, adding fewer than 500K trainable parameters. It derives retrieval queries and chunk encodings directly from the LLM's internal representations, outperforming retriever-reranker systems on a 21M-chunk Wikipedia index (e.g. HotpotQA recall 49.1%→73.2%) and improving long-context accuracy (NoLiMa 1.0%→24.83% at 128K tokens) while cutting FLOPs and time-to-first-token versus full-context inference.

TransformerBM25

HotpotQA2WikiMultiHopQAMuSiQue+2

research, llm-apps· Added 7 Oct 2026, published 6 Oct 2026

github.blogarticle🧠 AI

ReviewBench: An open benchmark for AI code review

ReviewBench is an open benchmark from GitHub and Microsoft for evaluating AI code review agents, built from 219 pull requests drawn from 187 public repositories across 19 languages, modeled on the distribution of 103.9 million real GitHub pull requests. It uses a three-stage multi-source golden-set process, reports six precision/recall-family metrics (including grounded and augmented recall to credit issues beyond the fixed golden set), supports severity/category slicing and a configurable F-beta score, and was validated by independent senior engineers who agreed with its labels 96.6 percent of the time. GitHub used it to evaluate Copilot code review (CCR), showing its offline predictions tracked the direction of later production A/B results.

GitHub CopilotGitHub

ReviewBenchMicrosoftMichelle Zhou

evals, coding-agents· Added 8 Oct 2026, published 5 Oct 2026

Showing 30 of 76