Skip to content

DelistBench: Evaluating Search-Enabled LLMs for Auditable Corporate-Event Database Completion

Aug 2026 · 0 citations · 14 references
Computer Science

TL;DR

This work introduces Search-to-Record, a database-assurance task in which search-enabled large language models reconstruct institution-defined event records from public sources for a known security universe and historical cutoff, and DelistBench, a 1,200-record benchmark for security-level delisting announcements.

Abstract

Financial institutions need an independent way to detect missing, stale, and misclassified corporate-event records in vendor databases. We introduce Search-to-Record, a database-assurance task in which search-enabled large language models reconstruct institution-defined event records from public sources for a known security universe and historical cutoff, and DelistBench, a 1,200-record benchmark for security-level delisting announcements. We evaluate five models in paired closed-book and web-enabled conditions. Web access raises announcement-date accuracy within seven days by 34.0 to 48.0 percentage points and event-status accuracy by approximately 2.8 to 21.7 points; the best system achieves 81.5% overall joint accuracy within seven days. Economy web systems achieve 75.9-78.3% overall joint accuracy within seven days at 4.5-6.6% of the API cost of the most expensive web system. Risk-based triage identifies low-error subsets, although the highest-coverage operating point still sends 27.3% of the balanced test set to review. The evaluation identifies web retrieval as the main source of timing gains and shows that low-cost systems can approach the best system's accuracy. Together, Search-to-Record, DelistBench, and the evaluation provide concrete deployment guidance: calibrate triage to local event prevalence and market mix, preserve positive-event recall, and route positive and ambiguous cases to targeted review.

View source

Similar papers

#natural language process... Preprint Sep 2026

Measuring Brand and Source Discovery under Repeated LLM Queries: A Finite-Sample Audit

Repeated-query audits must distinguish recovery of a collected set from completeness of possible outputs. We apply sample-based rarefaction to 4,500 responses from 50 buying questions, six configurations and 15 calls per cell. Historical-dictionary median ten-call recovery of the observed 15-call set ranges from 92.6%...

Dmitrij Żatuchin · 0 citations
Preprint Aug 2026

OpenPM: Auditable Point-in-Time Evaluation for LLM Portfolio-Management Agents

This work presents OpenPM, an auditable point-in-time evaluation framework for LLM portfolio-management agents, and builds a reference agent named the tiered allocator, where typed analysts score candidates, a constructor LLM proposes weights, and a deterministic critic guarantees feasibility.

Xinying Cai, Ming-Hao Guo, Jiahe Liu et al. · 1 citation
#natural language process... Preprint Sep 2026

FinFIRST: Benchmarking Search Agents for Financial Information Retrieval, Sourcing and Traceability

FinFIRST is the first financial benchmark to jointly evaluate answers and supporting evidence through atomic rubrics, retaining final-answer correctness as the primary objective while making the supporting research process measurable, verifiable, and diagnosable.

Wen-Qing Wang, Hai-Tao Xiang, Xin-Yi Zhao et al. · 0 citations
Review Sep 2026

Abstention Errors and Segment Support in CUAD: An Auditable Contract-Extraction Case Study

Contract-clause extraction benchmarks measure reference recovery, but interpreting a system for review assistance also requires measuring unnecessary output and the evidence available within categories. This paper presents a retrospective, reproducible evaluation of a fixed public RoBERTa checkpoint on CUAD's published...

Zeki Emre Tekin · 0 citations
Review Open access 2026

Accura: A Web Application for Detecting StructuralInconsistencies in Migration Datasets Using GPT-4o

Data migration in the InsurTech sector requires reliable validation processes to ensure the quality, consistency, and structure of information before loading into enterprise systems. Traditional methods based on manual review, spreadsheets, and SQL queries are often slow, error-prone, and dependent on specialized staff...

Deyvid J. Guevara, Gwyneth L. Segura, José Santisteban · 0 citations
#artificial intelligence Preprint Sep 2026

The Era by Eon Benchmark: A Generated Enterprise Estate with Exact Ground Truth for Benchmarking LLM Agents

The Era by Eon Benchmark for evaluating LLM agents that use enterprise tools is presented, built around a complete fictional company and includes product simulators, company-specific internal databases, benchmark questions, and computed answer keys.

Benjamin Gruenbaum, Doron Porat, Assaf Natanzon et al. · 3 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.