Corporate-Family Resolution Is Not a String-Matching Problem: A Public Benchmark Stratified by Name Visibility
cs.DB, cs.IR, cs.LG, cs.LO
Submitted: 2026-09-02
Updated: 2026-09-02
Comments: 21 pages, 8 tables. Benchmark, full adjudication log, and code reproducing every number: https://github.com/harshitg93/corpfam-benchmark
Code: https://github.com/harshitg93/corpfam-benchmark
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Transformer-based Entity Legal Form Classification
- CompanyKG: A Large-Scale Heterogeneous Graph for Company Similarity Quantification
- BrowseComp-Plus: A More Fair and Transparent Evaluation Benchmark of Deep-Research Agent
- Alaska: A Flexible Benchmark for Data Integration Tasks
- Evaluating Blocking Biases in Entity Matching
- Link Prediction using Graph Neural Networks for Master Data Management
- xLP: Explainable Link Prediction for Master Data Management
- MaDI-Bench: An End-to-End Data Integration Benchmark
- Machamp: A Generalized Entity Matching Benchmark
- Measuring short-form factuality in large language models
- BrowseComp: A Simple Yet Challenging Benchmark for Browsing Agents
Related papers
- Vibe Coding on Trial: Operating Characteristics of Unanimous LLM Juries
- Human-Level Text-to-SQL via Reinforcement Learning on Verified Data, Without Pipeline Engineering
- Bridging Business Intent and Data: A Benchmark for Automatic Relational Data Product Generation
- DexterSQL: Deep Schema Exploration and Rule-based Correction for Text-to-SQL Generation
- MaDI-Bench: An End-to-End Data Integration Benchmark
- Eigenius: A Typed Knowledge-Graph DBMS with Epistemic Stratification and Institution-Mediated Reasoning