alphaFeedback

WorksComputer Science

Cleaning or Recalling? Knowledge Dependence in LLM-based Data Cleaning [Experiment, Analysis & Benchmark]

AI contributions
Not recorded for this paper
View details
Ancillary data
1 code link, 2 data links
View

Abstract

High scores on public data-cleaning benchmarks can reflect knowledge of familiar entities, making it difficult to assess how well an LLM repairs unfamiliar data. We present CoRE (Cleaning or Recalling), a protocol comparing public benchmarks with fresh real records and paired name surrogates built from English words or syllables. The surrogates retain error positions and non-identity values while transferring the benchmark's error mechanisms. Across 21 controlled tables and eight LLMs, repair performance varies substantially with entity names on Hospital and, for commercial models, Movies. Renaming removes some information needed for repair, such as a film's identifier mapping. It also affects repairs whose candidates remain available: replacing entity names with word-based surrogates lowers DeepSeek-V4-Pro's year accuracy from 91% to 18%. On Hospital and Movies, commercial models score higher on fresh records than on word-based surrogates. A screened continuation probe finds no positive evidence of benchmark-row memory in the tested models. Familiar facts can conflict with the task. Even with explicit table-evidence instructions, commercial models rewrite assigned directors at rates of 0.000-0.404 on known films. Reference scoring can also disagree with external records. On Rayyan, an ISSN correction matching a title-matched PubMed record receives no credit, whereas 94% of TabClean's credited repairs reproduce the reference date transformation. We provide controlled tables, scoring code and materials for offline replay.

PVLDB Reference Format:

Jingru Yang, Honglu Zhang, Jiayi Mi, Ju Fan, Zheng Chen, and Xiaoyong Du. Cleaning or Recalling? Knowledge Dependence in LLM-based Data Cleaning. PVLDB, 20(1): XXX-XXX, 2027.

doi:XX.XX/XXX.XX

PVLDB Artifact Availability:

The source code, data, and/or other artifacts have been made available at https://github.com/hinsonver/CoRe-Benchmark.

Introduction

Data cleaning methods detect and repair erroneous values and are commonly evaluated on a small set of public benchmark tables [2, 10, 22, 52]. Large language models (LLMs) have opened new approaches to data management [17], including few-shot error detection and imputation competitive with specialized systems [37]. Recent cleaners use LLMs to edit values, derive rules or write cleaning programs [41, 42, 64, 72]. These methods, however, can use information beyond the table being cleaned.

Public cleaning benchmarks contain familiar hospitals, films, breweries and articles. Pretrained models can retrieve entity facts from their parameters [34, 48], while public tabular datasets can carry signals of prior exposure [6, 58]. A correct repair can therefore combine benchmark-row memory, knowledge of the entity (entity knowledge), knowledge of English word forms (spelling knowledge), and evidence within the table. Scores on familiar entities need not predict repair quality on unfamiliar data.

Example 1.1. Movies contains two distinct recovery problems. A Rotten Tomatoes slug can stand in place of an IMDb identifier. For American Ultra, recovering tt3316948 from american_ultra requires the film’s mapping; a fictitious slug does not determine its random identifier. Year ranges, however, retain the same candidates after renaming. DeepSeek-V4-Pro’s repairs decline in both cases (see Figure 1), although the year candidates remain available.

Figure 1. Recovery evidence in Movies. DeepSeek-V4-Pro repairs fewer identifiers when mappings disappear, but also fewer years when candidates remain. Labels give repaired/error cells; the middle-year rule matches 167/190 references. O/W/S are paired; F uses fresh records.

Controlled tabular evaluations already test recognition and completion of dataset instances (KnowTable [58]) and adherence to counterfactual database values (ContraTable [63]). Cleaning requires deciding which cells to change and which source should supply their values. It also scores each edit against a reference, which may itself contain a systematic conversion.

We introduce CoRe (Cleaning or Recalling) to compare repairs on dirty/reference pairs under controlled entity replacements. Each benchmark is compared with fresh real records, a word-based surrogate with fictitious English-word names, and a syllable-based surrogate with meaningless names. The original and its surrogates share rows and error positions, while fresh records carry the same kinds of errors. Paired substitutions test entity familiarity and word form. Fresh records test performance beyond the benchmark, while a separate continuation probe tests for benchmark-row memory.

We transfer the benchmarks’ error mechanisms to new records and renamed identity values, retaining error positions and non-identity values in the paired surrogates. This is particularly important for Movies, where errors often reflect differences between two legitimate sources. Fictitious names must also hide the entity without themselves looking erroneous. We build 21 controlled tables: nine each for Hospital and Movies across three seeds, and three for Beers. Their surrogates contain about 41,000 fictitious values, assessed by 506 acceptance checks. We evaluate four commercial and four open-weight LLMs, alongside Baran [32] and the program-generating cleaner TabClean [64], using about 23,000 prompts. Our main findings are as follows.

Movie identifiers lose their mappings after renaming, but year ranges retain the same candidates. On Movies, DeepSeek-V4-Pro’s year accuracy falls from 91% on real films to 18% on word names and 13% on syllable names, even though the candidates are unchanged (Figure 1). Across the four commercial models, Movies’ identity-column F − W gaps are +0.17 to +0.42 at construction seed 0 (Table 7). On Hospital, three commercial models lose 0.59 to 0.72 repair F1 after syllable replacement on identity columns, which contain entity names and locations.

ModelHospital Scores OHospital Scores FHospital Scores WHospital Scores SHospital Nonpaired F−WHospital Paired W−SHospital Paired O−SMovies Scores OMovies Scores FMovies Scores WMovies Scores SMovies Nonpaired F−WMovies Paired O−W
DeepSeek-V4-Pro0.880.950.500.16+0.45†+0.34†+0.72†0.360.450.040.01+0.41†+0.32†
Qwen3.8-Max0.900.930.550.21+0.38†+0.33†+0.68†0.300.440.020.00+0.42†+0.27†
GLM-5.30.780.830.550.19+0.28†+0.37†+0.59†0.110.200.040.01+0.17†+0.07†
GPT-6.1-Sol0.940.980.710.62+0.28†+0.09+0.32†0.120.370.050.04+0.32†+0.07
Qwen2.5-7B0.220.230.070.02+0.16+0.05+0.20†0.010.020.000.00+0.02+0.01
Llama-3.1-8B0.310.210.020.00+0.19†+0.02+0.30†0.040.040.010.01+0.04+0.03†
Qwen2.5-14B0.440.420.190.04+0.23†+0.15+0.40†0.060.040.010.01+0.03+0.05†
Qwen2.5-32B0.550.480.310.03+0.17+0.28†+0.52†0.030.030.000.00+0.03+0.03

Table 7. Identity-column repair F1 at seed 0. F−W uses nonpaired fresh records; O/W/S contrasts are paired. †: Holm-corrected p<0.05p < 0.05 over 40 contrasts, using 50,000 entity/reply bootstrap reweightings (§ 5).

The screened continuation probe finds no positive evidence of benchmark-row memory in its tested models (§ 6). Hospital and Movies retain positive condition contrasts across construction seeds and, for DeepSeek-V4-Pro, with labeled examples and error positions. Hospital’s O − S gap grows across the three Qwen2.5 model sizes. On Hospital and Beers, whole-table Baran and TabClean retain high scores under renaming, with repeated records and formatting patterns available for repair (§ 7–§ 8). The supplementary report2 gives the overview with intervals.

Yet a familiar fact can be the wrong value to preserve. Under explicit table-evidence instructions, commercial models rewrite 0.000–0.404 of assigned directors of known films toward real-world credits, compared with 68%–100% under the standard prompt. Qwen2.5-14B still rewrites more than 60% under the explicit instruction. Hospital and brewery city rewrites are less frequent (§ 9).

Reference errors can also change which edits receive credit. Rayyan contains systematic date and page conversions (§ 10). A repair that matches a title-linked PubMed ISSN receives no credit because the reference contains a spreadsheet conversion. On TabClean’s input, 434 of 461 credited repairs (94%), after excluding development rows, reproduce the reference date transformation.

Stratified PubMed field checks examine these references separately, with field-specific criteria and measured title-match coverage.

We make the following contributions:

  • We propose CoRE, a controlled evaluation protocol that transfers benchmark errors to paired name surrogates and relates repair scores to the recovery evidence retained in the input (§ 3).

  • We construct controlled tables for three benchmarks and provide construction and evaluation code, numerical witnesses and replay materials (§ 4 and § 11.2).

  • We characterize both knowledge-dependent repair and directed rewriting of assigned values across eight LLMs, with separate continuation and information-condition checks (§ 6–§ 9).

  • We identify systematic reference transformations in Rayyan and trace how they receive repair credit (§ 10).

Section 2 provides background and related work. Sections 3–5 describe the protocol, constructions and evaluation settings. Sections 6–10 present the analyses, followed by recommendations and limitations in Section 11.

Background and Related Work

Cleaning Benchmarks

Cleaning systems draw on several kinds of evidence. Rules repair constraint violations or apply fixing patterns [11, 13, 62], while KATARA uses knowledge bases and crowdsourcing [12]. Learned detectors use a small set of labels [20, 33, 39]; Baran learns context models for repair [32], and HoloClean combines signals through probabilistic inference [53]. Experimental studies compare detection and repair tools [2, 40] and their effects on machine-learning models [1, 29]. ActiveClean integrates progressive cleaning with statistical model training [26]. BART controls detectability and repairability during error generation [3].

We select public dirty/reference pairs from Raha and Baran for their complementary error profiles (Table 1). Hospital’s damaged names contrast with Movies’ source-specific mappings and retained candidates. Beers adds a formatting contrast: its errors retain the information needed for repair. Rayyan’s spreadsheet transformations instead expose what reference matching rewards. For cleaning we use 1,000-row tables. Movies and Beers retain all source-replaced and city-error rows, respectively, plus sampled benchmark rows. Flights and Tax serve only the continuation probe.

DatasetEntitiesSourceError cellsKind of errorUse in this paper
HospitalUS hospitalsCMS registry509 (219)one character replaced by xfour conditions
MoviesfilmsIMDb and Rotten Tomatoes1,965 (379)the other source’s value; formatting rulesfour conditions
Beerscraft beers and breweriesCraftCans.com565 (127)state glued to city; alcohol % suffixformatting control
Rayyanbiomedical articlesPubMed948spreadsheet conversions (§ 10)quality analysis
Flightsflight times38 web sourcesnot used for cleaningmemorization probe
Taxpersonal tax records—not used for cleaningmemorization probe

Table 1. Benchmarks distributed with Raha and Baran. Parentheses give identity-column error cells. CMS: US Centers for Medicare & Medicaid Services.

Identity columns name or locate an entity: provider number, name, address, city, ZIP code, county and phone in Hospital; identifier, title, director, writers and actors in Movies; and beer, brewery and city in Beers. We distinguish their recovery from repairs of other values, such as film years and formatting errors.

LLM-Based Cleaners

Few-shot prompting can match specialized systems on studied detection, imputation and matching tasks [37]. Subsequent work includes table-tuned and preprocessing models [28, 71] and entity matchers [47, 59]. LLM cleaners label errors (ZeroER [41]), iterate on repairs (IterClean [42]), derive ontological or semantic rules (LLMclean [4], Cocoon [72]), standardize data as agents (Clean-Agent [49]), compile curation pipelines (SEED [9]), or generate cleaning programs (TabClean [64]). We study direct value editing and generated programs under controlled entity replacements.

Knowledge and Benchmark Evaluation

LLMs on enterprise data. Enterprise annotation and integration studies examine domain context, schemas, table width and sparsity [15, 25]. Bodensohn et al. also observe a bias toward familiar SQL despite explicit SIGNAL documentation [5].

Memorization and contamination. LLMs can memorize training text, with stronger effects as models grow or data repeat [7, 8]. Detection methods include benchmark completion [18], likelihoods of canonical and shuffled orderings under exchangeability [45], and least-likely token probabilities [57]. Benchmark-specific records and surveys document these issues [55, 68], while mitigation restricts exposure or refreshes questions [23, 65]. For tables, Bordt et al. [6] find strong memorization of Iris and Wine; Adult’s signals concentrate in headers and initial rows. KnowTable [58] compares completion and existence queries over real, column-resampled, swapped and obfuscated variants, with non-neural baselines and statistical tests. Our comparison instead follows dirty/reference cell pairs: we transfer their error mechanisms to renamed entities and relate repair scores to the candidates and patterns left in the input. The continuation probe separately uses structural baselines to distinguish predictable cells from evidence of row memory.

Knowledge and counterfactual evaluation. Models store facts about entities, especially popular ones [24, 34, 48]. Entity substitutions in QA reveal conflicts between parametric and contextual answers [31, 67, 69], and counterfactual or low-probability variants expose dependence on familiar task instances [35, 36, 66]. DisentQA separates contextual and parametric answers [38]. In data management, ContraTable [63] pairs original and counterfactual databases to compare answer faithfulness across lookup, joins and temporal reasoning. A cleaner must both change errors and preserve assigned values. Our conflict test measures directed rewrites of reference-consistent cells toward familiar facts, alongside arbitrary edits (§ 9.2). Fictional ontologies and pseudowords also limit factual shortcuts in reasoning tasks [54, 56]. We contrast word and syllable names for cleaning.

Benchmark quality. Label errors can change model comparisons, particularly on mislabeled subsets and at higher error prevalence [43]. Spreadsheet conversion can also silently alter values [73]. Rayyan lets us trace credited repairs back to reference transformations and examine what the score rewards.

The CoRe Protocol

CoRe evaluates repair under four input conditions. Within a setting, the prompt, information access and scoring are fixed. Paired surrogate replaces identity values in the same dirty/reference rows; fresh records provide a separate comparison on other records. Figure 2 also shows two checks beyond recovery: whether a cleaner preserves an assigned director, and whether a repair agrees with the scoring reference. These use the conflict and reference inputs in § 9 and § 10.

Figure 2. Three questions for interpreting repair scores: what evidence remains for recovery, which assigned values should be preserved, and which edits receive reference credit. The panels illustrate separate tests on their respective benchmark inputs.

Four Conditions and Their Comparisons

Besides the original (O), CoRe builds three tables with the same schema and size:

  • Fresh (F) uses real records outside the benchmark: newer registry records for Hospital, or other films and beers. Their entities may remain familiar to a model.

  • Word-based surrogate (W) replaces identity values one to one with fictitious names made of English words and random numeric identifiers, retaining non-identity values and error positions.

  • Syllable-based surrogate (S) uses syllable names in the same construction, retaining generic terms such as hospital and street.

Figure 3 illustrates naming and error transfer on Hospital rows.

Hospital construction example with original, word, syllable, and fresh records

Figure 3. Hospital construction example. O/W/S share a row and city error cell while changing identity values. F uses a newer registry row with a newly drawn error location. The supplementary report gives the extended identity-field example.

Let sOs_O, sFs_F, sWs_W, sSs_S denote a method’s repair F1 in a fixed column group. Table 2 defines three paired contrasts: O − W, W − S and O − S. They measure score changes under entity and word-form replacement; the first two sum to the third. We interpret these differences alongside the error profiles and information-access controls, since renaming changes candidate values and construction regularities as well as familiarity. F − W compares fresh real records with word-based surrogates and is reported separately. O − S also changes record difficulty; the continuation probe examines benchmark-row memory separately.

ContrastInterpretation and comparison assumption
O−WPaired entity-renaming contrast; replacement changes familiarity, word forms and factual associations between fields.
W−SWord-form contrast; interpretation depends on the difficulty of the two naming styles and any regularities they introduce.
O−SPaired O–S contrast, combining changes in entity familiarity and word form.
F−WFresh records versus word-based surrogates; entity familiarity changes with record difficulty and, where recipes cannot transfer exactly, error composition.
O−FOriginal–fresh comparison; benchmark exposure and table difficulty both change. Memorization is tested separately.

Table 2. Condition contrasts and their interpretation. O/W/S pair rows, error cells, chunks and non-identity values; F shares schema, size and error recipes or rules.

What Makes an Error Recoverable?

Recovery depends on the target convention and the information shown to the cleaner (Table 3). The reference specifies the target convention, which is not explicitly stated in the zero-shot prompt. A locally reversible error admits a conversion to the specified convention (R1). A constrained error retains candidates or regularities that narrow the choices (R2), without necessarily selecting a unique source value. An underdetermined error lacks a required mapping or replacement value (R3). We describe these properties for each error type and information setting, not from a model’s success rate. These properties can overlap.

CaseExamples in the benchmark conditions
R1: locally reversibleBeers city/state split and percentage suffix; Movies thousands separators and integer ratings with an added 0.
R2: constrainedMovies year ranges; Hospital name typos with a matching candidate; syllable names with a restricted construction vocabulary.
R3: underdeterminedRandom fictitious identifiers; omitted film credits; source-specific ratings and durations not recoverable from the other source.

Table 3. Recovery evidence relative to the shown input and target convention, as defined in Section 3.2.

Where rules or candidates remain available, paired contrasts test their use after renaming. When the required mapping is absent, lower scores instead expose the recovery evidence removed by construction. A repeated record or labeled example can supply a previously missing value (Section 8.1); a candidate list need not resolve which source takes priority. Report §4 gives the criteria and error-type coverage. The S score includes repairs using local rules and construction regularities.

Chunking, Prompting and Scoring

The main input contains 20 rows from different entities, preventing copying from another record of the same hospital or brewery while retaining cross-entity patterns. The same entity grouping gives O/W/S identical chunks, 50 per table. A zero-shot prompt requests JSON corrections with row, column and value fields, leaving correct cells unchanged. Other information settings are defined in Section 5.

Let EE be the cells whose dirty and reference strings differ, PP the cells effectively edited after no-ops are removed, and R⊆P∩ER \subseteq P \cap E those set to the reference value. Then

prec⁡=∣R∣∣P∣,rec⁡=∣R∣∣E∣,F1=2⋅prec⁡⋅rec⁡prec⁡+rec⁡\operatorname{prec} = \frac{|R|}{|P|}, \qquad \operatorname{rec} = \frac{|R|}{|E|}, \qquad F1 = \frac{2 \cdot\operatorname{prec} \cdot\operatorname{rec}}{\operatorname{prec} + \operatorname{rec}}

and detection F1 uses P∩EP \cap E in place of RR. Edit and repaired-value comparisons ignore case and normalize whitespace, while EE uses original strings. Thus Movies’ five case-only title errors remain in EE but cannot earn repair credit. Identity columns are reported separately from the others. Normalization and reply handling follow Report §2; the exact prompt is in Report §7.

Building the Controlled Tables

The controlled tables retain the benchmark’s error mechanisms while varying entities and word forms. Error generators can vary detectability and repairability [3]; here, we start from the observed error profile and transfer it to renamed values or fresh records. Surrogates preserve non-identity cells and error positions, whereas fresh error counts depend on whether recipes and rules apply to the new records. Naming rules hide identity cues while retaining expected word forms. Table 4 summarizes the constructions, with full recipes and checks in Report §1.

DatasetEntitiesErrorsSourceEntitiesErrorsValues renamedSeeds
Hospital45 hospitals509 (219)CMS registry, July 2026 release34 hospitals (33 also in O)509 (219)2963
Movies1,000 films1,965 (379)IMDb datasets, Sept. 20261,000 films2,195 (371)6,0183
Beers421 breweries565 (127)Wikidata, Sept. 202694 breweries565 (127)1,7121

Table 4. Controlled-table sources and scale. Parentheses give error counts in identity columns; values renamed are distinct one-to-one replacements. Seeds cover F, W and S.

Hospital

Hospital’s characteristic corruption replaces a character by x: 508 of 509 error cells follow this form, usually replacing every occurrence of that character. F uses the July 2026 CMS registry in the benchmark schema. Its 34 hospitals include 33 from O, but all quality measures have changed, giving new rows about largely the same entities. We retain the original per-column error counts and position-weighted substitution rule, with newly drawn error locations.

Surrogates rename each distinct identity value consistently and transfer the original errors by position (Figure 3). S uses an inventory of 24 syllables; W uses English-word combinations. Generic suffixes preserve column conventions, and numeric identifiers become random digits. Column-wise replacements preserve repeated-value relationships, but random ZIP codes and phones are not constrained by the retained State values. Thus Hospital also changes factual associations between fields; Report §1 details these relationships and the archived-edit checks. The restricted syllable inventory supplies a regularity examined in § 8.3.

Movies

Movies joins IMDb and Rotten Tomatoes records. Its 190 source-replaced rows, together with two formatting rules, produce the errors in Table 5. A film can have a Rotten Tomatoes slug instead of an IMDb identifier, a year range instead of a year, or credits that add or omit people. For example, American Ultra has american_ultra in place of tt3316948. Such differences require recovering the benchmark’s preferred source value, rather than merely fixing spelling.

ColumnErrorsIn the originalFresh tableSurrogates
identifier190Rotten Tomatoes slug (135 plain, 28 numbered, 27 with the year)slug of the fresh title, forms at the original’s ratesslug of the dirty fictitious title, same form
year190range “Y−1 Y Y+1”same rangethe original’s cell
title1712 edit recipes (capitalization, & for and, accent, punctuation, subtitle, article)the same edits on a fresh titlethe same edits on the fictitious title
director43115 names added, 1 dropped, 17 respelledcopied name by namecopied name by name
writers129123 names added, 51 dropped, 20 respelled; 5 cells emptiedcopied name by namecopied name by name
duration187Rotten Tomatoes format (105) or empty (80)drawn at the original’s ratesthe original’s cell
rating261score pair (165) or empty (22); “.0” added (74)drawn at the original’s ratesthe original’s cell
rating count768thousands separators on every count ≥ 1,000the same rulethe original’s cell
genre180Rotten Tomatoes genre vocabularycopied slot by slotthe original’s cell

Table 5. Movies’ 1,965 errors and their transfer mechanisms. Source-style errors occupy 190 rows, with formatting rules also applied table-wide. Copied errors transfer cell recipes; drawn errors follow measured rates. Slugs are the film identifiers used in Rotten Tomatoes URLs.

F matches each original film to another feature film in the September 2026 IMDb snapshot, using the same release year (or within two years) and the nearest logarithmic vote count among eligible films with at least 1,000 votes. The corresponding 190 rows receive source-style errors. People and title errors are transferred as recipes over names and edits; genre errors retain the other source’s vocabulary. A recipe that cannot apply to its assigned cell is moved to another source-style row able to take it.

Some recipes remain inapplicable: four director and four writer errors stay clean, leaving 371 identity errors in F versus 379 in O/W/S. Formatting rules also change counts: the separator rule affects all 1,000 fresh rating counts, compared with 768 in O. F therefore has 2,195 errors at seed 0 versus 1,965 in O/W/S. Table 2 specifies the nonpaired F comparison.

Surrogates rename the 6,018 distinct identity values one to one. Titles require special care: retaining a real title’s function words, numbers and punctuation can reveal the film. We generate title shapes independently at the original’s aggregate rates, exclude real title words from W, and require generated titles to support their transferred edit recipes. Fictitious IMDb identifiers and slugs are then formed consistently with those titles.

Recovery evidence varies even within a column. Of 105 duration errors expressed in hours and minutes, unit conversion agrees with the reference in 50 and disagrees in 55. A locally available conversion can therefore differ from the preferred source value. Year ranges instead retain useful candidates, whose use we examine in § 7.

Beers

All Beers errors retain the information needed for formatting repair. They append a percentage sign to a fractional alcohol value, or glue a state to a city and empty the state field. Removing the suffix or splitting the location restores the benchmark’s convention. F uses 1,000 beers from 94 Wikidata breweries [60], excluding original beers and transferring the original error forms and counts.

Surrogates preserve generic terms and consistent relationships between brewery and city names. A one-word city stays one word, avoiding the appearance of a glued city/state value.

Acceptance Checks and Construction Seeds

Acceptance checks cover structure, error counts and strength, naming leakage, fresh-source requirements and deterministic rebuilding. The tables pass 505 of 506 checks. Hospital W at seed 0 has fewer errors replacing three or more characters: 6.4%, versus 16.9% in O. The 10.5-point difference exceeds the eight-point tolerance by 2.5 points; error positions are unchanged. Report §1 gives the thresholds and Report §7 the distributions.

Naming and leakage account for 263 checks: one-to-one replacements, exclusion of real values, and title-shape comparisons against chance-level matching. Deterministic rebuilding checks that the same rules yield identical tables.

Hospital and Movies have three construction seeds: surrogates redraw names and applicable errors; F redraws errors on fixed clean records. Seed ranges capture construction variation, whereas cluster intervals describe one fixed construction. Main tables report seed 0. Hospital W at seeds 1 and 2 passes the strength check, with positive F − W and W − S contrasts for all eight cleaners. Table 12 gives construction ranges; Report §7 gives the passing-seed contrasts.

ModelHospitalMovies
F−WW−SO−SF−WO−W
DeepSeek.34–.45.33–.36.66–.72.39–.44.31–.32
Qwen3.8.34–.38.33–.38.68–.69.38–.42.26–.28
GLM-5.3.28–.29.34–.37.57–.61.14–.19.07–.08
GPT-6.1.28–.29.09–.10.32–.34.32–.35.07
Qwen-7B.16–.22.02–.07.19–.20.01–.03.00–.01
Llama-8B.14–.24.01–.04.30.03–.04.03
Qwen-14B.23–.31.12–.17.37–.42.03–.06.05
Qwen-32B.17–.30.27–.28.49–.52.02–.03.01–.03

Table 12. Identity-column contrast ranges over three construction seeds; seed 0 is in Table 7. Fresh clean records are fixed while errors are redrawn.

Experimental Setup

Models. Commercial requests disable thinking and set temperature 0 for DeepSeek-V4-Pro [14] and Qwen3.8-Max [51]. GLM-5.3 [70] uses low reasoning effort and temperature 0; GPT-6.1-Sol [44] uses low reasoning effort with sampling parameters left at API defaults. Settings stay fixed across conditions within each model. Locally, vLLM [27] greedily decodes Qwen2.5 Instruct at 7B,

14B and 32B (AWQ) [50], and Llama-3.1-8B-Instruct [19]. OLMo-2-7B instruction/base variants [61] support auxiliary continuation with a public pretraining corpus. Table labels shorten model names; Qwen-7B/14B/32B denote Qwen2.5. Eight of GLM’s 500 Movies replies remain incomplete with no parsed corrections. Report §2 gives budgets and retries; Report §7 covers usage and sensitivity.

Methods and information. The aligned setting adds 20 labeled dirty/clean tuples and error positions to the main chunks. Baran [32] uses the same aligned inputs with three seeds, plus whole tables with perfect detection or Raha [33]. We disable Baran’s Wikipedia-revision value models and Raha’s knowledge-base detector. TabClean runs DeepSeek-V4-Pro on whole tables with repeated records; scoring excludes 150 labeled development rows.

Scale. The 1,000-row inputs retain Movies’ source-style and Beers’ city-error rows (Section 2.1; Report §1). Fixed paired O/W/S chunks and Hospital/Movies construction-seed repetitions support recovery-mechanism comparisons (Section 4.4). Report §2 details about 23,000 cleaning, aligned, conflict and continuation prompts; Rayyan input versions follow Section 10.

Statistics. Repair intervals use 50,000 bootstrap reweightings [16, 46]. Hospital and Beers multiply independent entity and reply weights; Movies reweights replies. O/W/S share paired weights, while F uses independent reply weights. Weighted counts are pooled before computing F1. Two-sided tests use centered bootstrap differences, with Holm correction [21] within each result table (40 contrasts in Table 7). Chunk wins/losses are descriptive where entities recur; Movies sign tests form a separate eight-model family.

Conflict intervals resample whole replies 50,000 times, retaining equal entity weights (Section 9.2); all-or-none outcomes are reported as counts and rates. Rayyan uses 5,000 within-stratum resamples of saved binary checks with fixed type weights, conditional on title matches and field criteria (Section 10.3). Intervals use the 2.5th and 97.5th percentiles; Report §7 details the clustering.

Testing Benchmark Memorization

The continuation probe covers DeepSeek-V4-Pro, the four open-weight cleaners and both OLMo-2 variants. It asks for the next row after a header and ten consecutive rows, and tests whether dirty context elicits a clean reference value. Report §2 details trial counts and context settings.

Screening predictable continuations. Repeated values and record order make many continuations predictable. A cell is hard if its value is absent from the context column and missed by a full-table screen: column modes, frequent successors, low-cardinality functional dependencies and previous-value ±1. Counts subtract the target vote; dependency eligibility stays fixed. The screen uses records beyond the prompt (Report §2). On Hospital, screening lowers DeepSeek’s context-absent accuracy from 47% to 2.1% (3/144).

The highest hard-cell accuracy is 32/375 (0.085; Table 6). On Beers, many replies name other real beers of the contextual brewery, not the next beer in the file. OLMo-2 base also has low accuracy (at most 0.011); an infini-gram [30] search of its public corpus finds only Hospital fragments in a GitHub issue and tool documentation, and none of the other tables.

Clean-value leakage. For clean references absent from the corresponding context column, the hard-cell screen retains 601 erroneous cell-trials for DeepSeek, which supplies the clean reference in three; the four open instruction cleaners do so in 1 of 2,008. This additional screen uses the full clean table and clean predecessor—oracle information beyond the dirty prompt.

ModelAnonymous cleanAnonymous dirtyNamed cleanNamed dirtyError rowsClean value leaked
DeepSeek-V4-Pro0.0800.0700.0850.065—3 / 601
OLMo-2-7B-Instruct0.0270.019——0.0300 / 187
OLMo-2-7B (base)0.0110.011———1 / 92
Qwen2.5-7B0.0400.0280.0400.0460.0290 / 449
Llama-3.1-8B0.0420.0190.0140.0090.0161 / 490
Qwen2.5-14B0.0270.0610.0410.0490.0300 / 532
Qwen2.5-32B0.0050.0370.0130.0280.0290 / 537

Table 6. Highest hard-cell continuation accuracy over datasets for each context. Columns distinguish clean/dirty context, dataset naming and error-row selection. Leakage counts clean reference values written from dirty context.

Original versus fresh. All four commercial cleaners score lower on O than F on Hospital (−0.03 to −0.07) and Movies (−0.09 to −0.25; Table 7). Some open models have the opposite sign, including Llama’s +0.10 on Hospital, without positive evidence from the continuation probe. As defined in Table 2, O − F also includes difficulty changes in addition to exposure. § 7 compares repair on these real records with the paired surrogates.

Finding 1. The screened continuation results provide no positive evidence attributable to benchmark-row memory in the tested settings.

Entity Familiarity and Repair Performance

Table 7 reports the eight-model condition scores and contrasts. The error profiles in Section 3.2 distinguish missing entity mappings from candidates and rules retained after renaming.

Hospital: Damaged Identity Values

Replacing Hospital’s entity names with syllables reduces DeepSeek-V4-Pro’s identity-column repair F1 from 0.88 to 0.16. Qwen3.8-Max and GLM-5.3 have similarly large losses, giving a 0.59–0.72 range for these three models. Their W − S contrasts are +0.33 to +0.37, in addition to positive O − W contrasts. F − W is also large (+0.28 to +0.45), with higher scores on fresh real records than on word-based names. GPT-6.1-Sol’s higher S score follows the construction regularities examined in § 8.3.

Detection remains stronger than repair (Table 8). For example, DeepSeek detects S identity errors with F1 0.73 but repairs them with 0.16, while its non-identity repair scores remain between 0.91 and 0.95 across conditions. Name candidates can help resolve typos; recovering an arbitrary identifier requires its mapping. Open models show smaller O − S differences, from +0.20 to +0.52 at seed 0.

ModelHospital OHospital WHospital SMovies OMovies WMovies S
DeepSeek1.0/.88.95/.50.73/.16.56/.36.41/.04.47/.01
Qwen3.8.98/.90.97/.55.72/.21.56/.30.57/.02.52/.00
GLM-5.3.98/.78.97/.55.72/.19.26/.11.12/.04.08/.01
GPT-6.1.95/.94.71/.71.65/.62.17/.12.11/.05.09/.04

Table 8. Detection and repair diverge on surrogate identity columns. Entries give detection F1 / repair F1; detection counts corrupted cells found regardless of the value proposed for that cell.

Finding 2. Syllable replacement lowers identity-column repair F1 by 0.59–0.72 for DeepSeek-V4-Pro, Qwen3.8-Max and GLM-5.3 on Hospital. Detection remains stronger than repair.

Movies: Candidates and Mappings

Year ranges retain useful candidates. In the 190 source-style rows, the year is “Y−1 Y Y+1” and the middle candidate matches 167 references (88%). DeepSeek’s year accuracy is 91% on real films, but only 18% on W and 13% on S, where it mostly chooses the first year (Figure 4). Renaming shifts its choices from the middle toward the first candidate; the prompt does not specify which candidate to select. Report §7 separates the 167 middle-reference cases from the other 23. The other commercial models show the same pattern: 171–176 correct years on O, versus 24–48 on surrogates. Duration and genre repairs also decline after renaming (Table 10).

Figure 4. DeepSeek-V4-Pro’s year repairs deteriorate after renaming, although all 190 year ranges are unchanged. Bars show the candidate written; the right panel shows repair accuracy. The middle year matches 167 references (88%).

ColumnOFWS
identifier78 / 19075 / 1900 / 1900 / 190
title0 / 174 / 171 / 170 / 17
director18 / 4327 / 397 / 432 / 43
writers1 / 12927 / 1253 / 1291 / 129
year173 / 190183 / 19035 / 19025 / 190
duration90 / 187101 / 18742 / 18741 / 187
genre44 / 18070 / 1673 / 1801 / 180
rating30 / 26173 / 2809 / 2619 / 261
rating count2 / 76826 / 100024 / 76890 / 768

Table 10. DeepSeek-V4-Pro Movies repairs by column (repaired / errors). Identity columns are listed first; each condition uses its own error counts.

Rating-count formatting moves in the opposite direction. Its dirty and reference values are identical across O/W/S, yet DeepSeek repairs 2 of 768 counts on O and 90 on S by removing commas. All 90 S repairs occur in seven chunks. The rule remains locally available, but its use varies across chunks and naming conditions.

Identifiers require entity mappings. All commercial models score at most 0.05 on Movies’ surrogate identity columns. Their F − W gaps are +0.17 to +0.42, while the paired O − W contrasts are smaller (Table 7). DeepSeek replaces 78 of 190 real slugs with the correct IMDb identifier and none on surrogates (Table 10). A fictitious slug does not determine its random identifier, so the repairs on real films use mappings absent after renaming.

Without identifiers, F − W remains +0.26 to +0.33 across the four commercial models, whereas O − W is +0.04 to +0.15. Original people-list errors often contain legitimate Rotten Tomatoes credits, making the reference’s source choice difficult even when the film is known. GPT-6.1-Sol rarely guesses identifiers on O (10 of 190); its O − W of +0.07 is not significant after correction, whereas its F − W gap is.

Open models repair at most 14 of 379 identity errors on O and three on W (Table 9). These near-zero results provide little evidence about their response to entity renaming on Movies.

ModelHospital W/SHospital ChunksMovies O/WMovies Chunkspp
DeepSeek104/2835:197/1135:3<.001
Qwen3.8116/3739:294/737:2<.001
GLM-5.3117/3239:225/816:3.022
GPT-6.1120/10019:624/1013:6.334
Qwen-7B11/48:41/01:01
Llama-8B5/14:012/39:1.086
Qwen-14B35/723:214/310:0.012
Qwen-32B63/735:07/16:0.094

Table 9. Repaired cells and chunk wins:losses, excluding ties. Hospital compares W/S on 219 identity errors; Movies compares O/W on 379. Hospital chunk counts are descriptive; Movies sign tests use Holm correction over eight models.

GLM’s O − W remains significant after excluding incomplete replies: +0.06 versus +0.070 on all chunks.

Finding 3. Movies’ commercial-model F − W gaps are +0.17–+0.42 at seed 0, with surrogate identity repair F1 at most 0.05. Year repair also deteriorates despite retained candidate evidence.

Beers: Formatting Errors

On Beers, we compare city/state repairs for real and fictitious names (Table 11). At seed 0, seven models show no significant positive O − S effect; their contrasts range from −0.08 to +0.04, including GPT’s −0.03 in the opposite direction. Qwen3.8-Max instead repairs 122 of 127 cities on O, 108 on W and 82 on S, giving a significant O − S difference of +0.24 (adjusted p=0.042p = 0.042). W repairs more cities than S in 15 chunks and fewer in four. F is descriptive because its brewery concentration and alcohol distribution differ (§ 4.3).

ModelOFWSO−SCities repaired
DeepSeek-V4-Pro0.270.240.110.28−0.0120 / 18 / 8 / 22
Qwen3.8-Max0.940.610.820.69+0.24†122 / 67 / 108 / 82
GLM-5.30.940.880.890.94+0.00120 / 110 / 116 / 117
GPT-6.1-Sol0.960.890.981.00−0.03127 / 115 / 127 / 127
Qwen2.5-7B0.000.100.040.05−0.050 / 7 / 4 / 5
Llama-3.1-8B0.180.270.110.14+0.0423 / 28 / 14 / 17
Qwen2.5-14B0.160.050.110.19−0.0313 / 4 / 15 / 20
Qwen2.5-32B0.030.000.040.11−0.082 / 0 / 3 / 10

Table 11. Beers identity-column repair F1, O−S contrasts and repaired cities (O/F/W/S, of 127). †: Holm-corrected p<0.05p < 0.05 across eight O−S contrasts using entity/reply weights. F is descriptive; its brewery and alcohol-content distributions differ from O.

Finding 4. Qwen3.8-Max has a positive O − S repair-F1 difference of +0.24 on Beers’ formatting errors; no significant positive effect appears in the other seven models.

Stability over Construction Seeds

Table 12 reports construction variation separately from cluster intervals. Hospital’s O − S contrast varies by at most 0.06 per model, and W − S by at most 0.05. F − W is more sensitive to the fresh error draw, with ranges reaching 0.11 for DeepSeek and 0.13 for open models. Movies’ commercial-model gaps remain positive across seeds, including +0.39 to +0.44 for DeepSeek.

Information Available for Repair

Aligned Information and Repeated Records

The aligned setting adds labeled target-value examples and error positions without enlarging the main chunks. DeepSeek-V4-Pro improves across conditions but retains F − W gaps of +0.22 on Hospital and +0.58 on Movies (Figure 6). Hospital’s rounded W and S scores differ by only 0.01, compared with the larger W − S difference in the zero-shot setting.

Figure 6. Identity-column repair F1 in zero-shot and aligned settings. DeepSeek shows 95% cluster intervals; aligned Baran shows three-run means without error bars.

Baran with the same chunks, labels and positions scores 0.27–0.32 on Hospital and zero on Movies identity columns. With whole-table perfect detection, it reaches 0.91–0.93 and 0.25–0.27, respectively, with little condition variation (Table 13). Whole-table access exposes repeated records that can supply values missing from the main chunks. DeepSeek still leads Baran in every aligned Hospital and Movies condition, but its advantage narrows on surrogates.

MethodOFWS
Hospital
DeepSeek, aligned0.970.980.760.75
Baran, aligned0.290.320.270.28
Baran, whole table0.910.930.930.93
TabClean1.001.000.960.99
Movies
DeepSeek, aligned0.640.670.090.07
Baran, aligned0.000.000.000.00
Baran, whole table0.270.260.260.25
TabClean0.000.000.030.00
Beers
DeepSeek, aligned1.001.001.001.00
Baran, aligned0.190.770.200.22
Baran, whole table0.941.000.940.96
TabClean1.001.001.001.00

Table 13. Identity-column repair F1 under aligned and whole-table information. Aligned uses the same chunks, 20 labeled tuples and error positions; Baran is the mean of three runs. Whole-table Baran uses perfect detection. TabClean uses DeepSeek-V4-Pro with development rows excluded.

Model Scale

Within Qwen2.5, Hospital’s O−SO - S grows from +0.20 at 7B to +0.40 at 14B and +0.52 at 32B, in the same order at every construction seed (Figure 5; Table 12). S repair F1 stays low at 0.02, 0.04 and 0.03; the increase is mainly in scores on the original hospital names.

Figure 5. Hospital identity-column repair F1 across model sizes and families. Within Qwen2.5-7B/14B/32B, the O–S gap grows while S scores remain low. Llama and commercial models are shown for comparison; whiskers give 95% cluster intervals.

Recoverable Syllable Names

GPT-6.1-Sol repairs 100 of Hospital’s 219 identity errors with 105 edits, compared with 28–37 repairs for the other commercial models. The constructor’s 24-syllable inventory is represented in every chunk and permits a unique restoration for 95 corrupted names. GPT restores 74 of them; the other commercial models restore 8–12 and open models at most one (Table 14). The inventory is used by our analysis, not supplied to the cleaner. On digits, which it does not constrain, GPT repairs 6 of 97. Its S advantage is concentrated on names recoverable from the restricted vocabulary.

ModelUnique (95)Ambig. (11)Generic (14)Digits (97)
DeepSeek-V4-Pro80135
Qwen3.8-Max1201211
GLM-5.3100128
GPT-6.1-Sol744146
Open models0–100–30–6

Table 14. Hospital S repairs by recovery category. Unique and Ambig. use the 24-syllable inventory; Generic covers English terms, and Digits covers numeric tokens. Headers give cell counts, covering 217 of 219 errors, with two address-spacing errors excluded from these counts.

Program-Generating Cleaner

TabClean [64] generates cleaning programs. Its identity-column scores stay near perfect on Hospital and Beers, but near zero on Movies (Table 13). For example, it repairs “San Francisco CA” into city and state, both retained in the input. Movies’ source mappings and omitted credits require external evidence.

Finding 5. Labels and error positions improve DeepSeek-V4-Pro’s repair without closing its F−W gaps. Whole-table Baran and TabClean remain strong under renaming on Hospital and Beers, but weak on Movies.

Preserving Assigned Values

Movies often pairs legitimate values from different sources, so a familiar credit alone does not identify the task’s target. We next fix a value to preserve and test whether a familiar name draws the cleaner toward the real-world fact.

Constructing Knowledge Conflicts

Starting from S, we assign target cells another real director or location in both dirty and reference tables. Correctness here means preserving the assigned target, although other cells in the row may still contain errors. Table 15 illustrates the assignment of Stanley Kubrick to Taken, whose real director is Pierre Morel.

VersionNameYearDirector
Exact nameTaken2008Stanley Kubrick
One-letter nameTakun2008Stanley Kubrick
Surrogate controlDrikel Joujou2008Stanley Kubrick

Table 15. A conflict target with the same assigned Director reference in three name versions. The real credit of Taken (2008) is Pierre Morel; all other cells remain identical.

Each target has an exact real name, a one-vowel-changed name and its syllable control. Only the name differs across versions; attributes, other values, error positions and chunks are fixed. Hospital and Beers receive internally consistent locations. Movies also updates related director occurrences consistently, preventing another column from supplying the old director as a candidate. Report §2 specifies these cross-column replacements.

The common pool contains 57 films, 24 hospitals and 48 breweries known to DeepSeek-V4-Pro. Main chunks contain three targets and 17 other-entity fillers, with one row per target. Supplementary Hospital/Beers conditions use three rows per target. Every model receives the same pool, but rates use its own subset passing separate factual queries: 52–57 films, 22–24 hospitals and 7–48 breweries. The factual screen for films accepts a credited full name or a surname of at least four letters; the location screen requires matching city and state. Rates are conditional on the fixed pool.

The standard prompt asks for cleaning while preserving correct cells, without specifying source priority. The table-evidence prompt explicitly favors input-table evidence over real-world knowledge. Both use the same chunks and known subsets.

Measuring Rewrites

A directed rewrite changes the assigned Director or City to the paired entity’s real-world fact. Director outputs must contain a full credited name; cities must match the normalized real city. The one-letter-name variant instead measures restoration of the exact real name. These events are scored separately from any change to the target cell. Output parsing and matching normalization are specified in Report §2.

Let EmE_m contain entities passing model mm’s factual queries, ss be target rows per entity, and zejz_{ej} indicate a matching rewrite in row jj of entity ee. We report

r^m=1∣Em∣∑e∈Em1s∑j=1szej.\hat{r}_m = \frac{1}{\lvert E_m\rvert}\sum_{e\in E_m}\frac{1}{s}\sum_{j=1}^{s} z_{ej}.

For Movies, s=1s = 1, giving rewritten known films divided by known films. For s=3s = 3, row indicators are first averaged within entities. Targets without a matching correction, including unusable replies, remain in the denominator. Surrogate controls use the same known subset and paired fact. Reply-cluster intervals follow Section 5.

Results

Explicit table priority. With the table-evidence prompt, GPT does not replace any assigned director with a real-world credit (0/57). DeepSeek still rewrites 12 of 57 directors; GLM and Qwen3.8-Max rewrite 10/57 and 23/57, respectively. Rates for Qwen2.5 at 14B and 32B remain above 0.60 (Table 16). These updates contradict the prompt’s explicit instruction to use table evidence.

ModelExact-name target StandardExact-name target EvidenceSurrogate control StandardSurrogate control Evidence
DeepSeek-V4-Pro39/5712/572/570/57
Qwen3.8-Max56/5723/5714/573/57
GLM-5.357/5710/5710/571/57
GPT-6.1-Sol53/570/577/570/57
Qwen2.5-7B7/525/520/520/52
Llama-3.1-8B18/5615/562/562/56
Qwen2.5-14B38/5535/552/550/55
Qwen2.5-32B37/5332/530/530/53

Table 16. Director rewrite counts among known films (n/Nn/N). Exact-name targets count edits matching a real-world director credit. Surrogate controls count any Director change; none matches the paired film’s real credit.

Director rewrites. Commercial models know the same 57 films and rewrite 68%–100% of their assigned directors under the standard prompt (Figure 8). DeepSeek, for example, rewrites 39/57. Controls also receive Director edits, but none matches the paired film’s real credit (Table 16).

Figure 8. Director rewrites under standard and table-evidence prompts. Parentheses give known-film counts shared by both prompts; Table 16 includes control edits. Whiskers give 95% reply-cluster intervals, with counts for all-or-none outcomes.

Within Qwen2.5, conditional rates rise from 0.135 at 7B to 0.691 at 14B and 0.698 at 32B. Their known subsets differ, as shown in Table 16. Llama knows 56 films and rewrites 18 (0.321).

Director versus city. Standard-prompt city rewrites reach at most 0.042 on Hospital and 0.140 on Beers across models. DeepSeek also restores 91% of one-letter-changed film names (Figure 7). This may correct spelling without changing the assigned attribute.

Figure 7. DeepSeek-V4-Pro rewrites assigned directors more often than cities. Attribute rewrites and name restoration are separate events, using 57 films, 24 hospitals or 48 breweries with one row per target. Whiskers give 95% reply-cluster intervals; all-or-none outcomes show counts. Controls have zero directed rewrites.

Finding 6. Under explicit table-evidence instructions, commercial models’ director rewrite rates range from 0.000 to 0.404; Qwen2.5-14B/32B remain above 0.60. Standard-prompt rates for commercial models are 68%–100%, while city rewrites are less frequent in these tests.

Benchmark Quality

Rayyan contains systematic date and page conversions in its reference values. A cleaner can receive credit for reproducing these conversions but none for an externally matched ISSN correction.

Systematic Reference Transformations

Rayyan’s audit pair has 1,000 rows and eleven columns, differing in 948 cells. Its values exhibit patterns characteristic of spreadsheet conversion [73]. All 722 date differences map input m/d/yy to

d/int⁡(yy)/mm⁡d/\operatorname{int}(yy)/\operatorname{mm}, with a two-digit input month in the final position: for example, 1/1/13 becomes 1/13/01. Similarly, 31 of 32 pagination differences turn page ranges into month-name strings, such as 70–6 to Jun-70.

What the Reference Rewards

On the audit input, DeepSeek-V4-Pro’s zero-shot output scores F1 0.002. It changes dirty ISSN Mar–22 to 0003–3022, matching a title-matched PubMed record, but the reference is 22–Mar. This correction receives no repair credit.

TabClean’s distributed Rayyan input has 960 difference cells, rather than the audit’s 948. Both are 1,000-row, eleven-column tables with the same date-conversion pattern. We score the archived output against its actual input pair and exclude 150 development rows. The remaining 850 rows contain 808 errors; 498 effective edits yield 461 credited repairs, giving F1=2×461/(498+808)=0.71F_1 = 2 \times461/(498 + 808) = 0.71 after rounding. Of these credited repairs, 434 (94%) reproduce the reference date transformation. Report §3 specifies the actual inputs, development indices and output.

Stratified PubMed Checks

We sample up to 80 cells per error type, including all volume/issue, pagination and ISSN differences, for 279 cells. Automatic title matching selects the highest-similarity PubMed candidate among up to five results at a normalized similarity of at least 0.9. This yields 152 matched cells associated with 121 PMIDs: 54.5% overall and 47.5%–61.3% across types (Table 17). Query construction and retrieval provenance appear in Report §3.

CheckNhN_hnhn_hmhm_hReference fail bh/mhb_h/m_hDirty pass dh/mhd_h/m_h
Year722804443/4442/44
Changed words107803838/38—
Vol./issue75754628/4617/46
Pages32321818/1817/18
ISSN121266/60/6

Table 17. Rayyan field checks: population NhN_h, sample nhn_h, title matches mhm_h, failed reference and passed dirty checks per matched cell. A dash denotes an unassessed dirty check.

Field-specific checks. The date field article_jcreated_at is checked for agreement with PubMed’s publication year; the dataset does not document its exact semantics. Volume and issue checks measure presence, using reference −1 and dirty empty strings as absence. Two reference volumes of 1, for example, pass presence while differing numerically from saved PubMed values 31 and 21. Pagination matches the page string, and ISSN accepts print or electronic identifiers. For encoding differences, a nonempty set of reference-side changed words must all occur in the case-folded PubMed word set, with accents retained. Encoding’s dirty side is unassessed.

Let NhN_h be the error-cell population of type hh, mhm_h its title-matched count, and bhb_h the matched references failing that field’s check. The weighted reference-check failure rate is

q^=∑hNh948bhmh.(1)\hat{q} = \sum_h \frac{N_h}{948}\frac{b_h}{m_h}. \tag*{(1)}

Weighting the five field checks by the 948-cell audit composition gives a reference-check failure rate of 95.2% (95% interval: 91.2–97.8%; Table 17). Each within-type proportion uses title-matched cells. Dates account for 722 of 948 error cells and most of the weight. The interval conditions on the saved title matches and field checks; matching uncertainty and dependence between cells sharing a PMID are outside this estimate.

Among the 44 title-matched date cells, 42 dirty values agree with PubMed’s publication year, whereas 43 reference values do not. These sampled publication-year checks differ from TabClean’s credited-conversion count of 434/461.

Reference Issues in Other Benchmarks

Hospital’s reference places Helen Keller Memorial Hospital in Jefferson County, although its city, Sheffield, is in Colbert County. Three commercial models correct some of these cells and are penalized as false edits. Counts and duplicate writer credits in Movies are detailed in Report §3.

Finding 7. On Rayyan, 434/461 of TabClean’s credited repairs (94%), after excluding 150 development rows, reproduce the reference date transformation. An externally matched ISSN correction earns no repair credit.

Lessons and Recommendations

Distinguish missing mappings from retained candidates. An identifier may lose its mapping after renaming, while a year range retains its candidates (Section 3.2). Report formatting repairs separately once the target convention is established: a local conversion and a source-specific value pose different recovery problems (Findings 2–4). If a renamed identifier has no mapping, supply a candidate list or retrieval source before comparing a method’s ability to recover it. Where candidates remain, report which candidates the method selects, as in the year comparison, rather than interpreting all score losses as missing external knowledge.

Align labels, error positions and supporting records. Compare chunk-based and whole-table methods under aligned labels and error positions (Finding 5). Report supporting-record access separately: another record of the same entity may supply a replacement absent from the chunk. Equal detection information does not imply equal evidence for recovering values.

Set source priority and test value preservation. Movies requires selecting a preferred source, whereas the conflict test requires retaining an assigned director. Count factual rewrites separately from other edits: a real credit can still be the wrong update for that task (Finding 6). For cross-source errors, name the preferred source explicitly: a Rotten Tomatoes credit can be legitimate yet differ from an IMDb reference. For assigned values, state that the table takes priority and include unchanged target cells in evaluation.

Inspect the edits rewarded by the reference. Rayyan credits date conversion but rejects an externally matched ISSN. Compare fields with independent records under explicit criteria, and report the scored input and development exclusions (Finding 7). Separate mechanical conversions from changes in field content. An external year check also requires the date field’s semantics, while a weighted summary requires the match coverage and criteria for each field. Inspecting high-credit edits is especially useful when a single transformation accounts for most repaired cells.

Applying CoRe to Other Benchmarks

Applying CoRe requires profiling errors and reference conventions, selecting a compatible fresh source, and building the two naming styles with acceptance checks. Report F1 contrasts alongside error-type counts and candidate selections, as in the Movies year analysis. Record which field relationships survive identity replacement: geographic codes can retain familiar meanings after names change. Report §4 describes the adaptation procedure.

Artifact and Result Replay

The statistical core replays condition contrasts, conflict rates and Rayyan checks offline from Hospital/Beers tables, Movies numerical witnesses and re-scored continuation counts. Authorized local validation checks historical movie inputs, replies and scoring-code hashes before re-scoring. The repository README gives the commands; Report §5 maps each analysis to its inputs, scoring code and outputs; Report §6 gives the extended displays.

Limitations

The datasets diagnose recovery mechanisms and reference transformations in entity-rich public tables, rather than estimate their prevalence across cleaning workloads. Transfer to private data also depends on size, sparsity, task complexity and the availability of supporting records. Our comparisons change name forms as well as familiarity, and F1 introduces record-difficulty differences (Table 2). Beers F has different brewery concentration and alcohol distributions, while Hospital’s restricted syllables provide the regularity observed for GPT (Section 8.3). The study covers eight commercial and open-weight cleaners on English tables concerning mainly US entities, with decoding settings in Report §2; it does not cover Claude or Gemini.

The intervals describe variation across entities and replies within fixed constructions. New backgrounds, regrouped prompts and repeated API calls introduce other sources of variation. Report §7 gives the entity–reply structure and shows how repair F1 changes when one hospital’s rows are omitted from the saved outputs.

Conclusion

Remaining Movies lowers DeepSeek-V4-Pro’s year accuracy from 91% to 18% even though the candidate years remain in the input. Identifier repairs decline too, but their mappings are no longer available. On Hospital, GPT repairs 74 of 95 errors with a unique restoration under the constructor’s restricted syllable inventory. The paired comparisons in CoRe retain error positions, while fresh records and a screened continuation probe examine transfer and benchmark-row memory separately. The probe finds no positive evidence of row memory in its tested models.

The assigned-value and reference analyses reveal errors that conventional repair scores can miss. Some models replace assigned directors with real credits even after an explicit table-evidence instruction. On Rayyan, 434/461 of TabClean’s credited repairs reproduce a reference date transformation, while an externally matched ISSN correction earns no credit. For evaluation, these cases call for tests with a specified source priority and inspection of the edits counted as correct. The constructions and scoring code support comparisons with other data cleaners.

References

References

  1. [1]Mohamed Abdelaziz, Christian Hammacher, and Harald Schöning. 2023. REIN: A Comprehensive Benchmark Framework for Data Cleaning Methods in ML Pipelines. In Proceedings of the 26th International Conference on Extending Database Technology (EDBT). 499–511. https://doi.org/10.48786/edbt.2023.43 arXiv:2302.04702.
  2. [2]Ziawasch Abedjan, Xu Chu, Dong Deng, Raul Castro Fernandez, Ihab F. Ilyas, Mourad Ouzzani, Paolo Papotti, Michael Stonebraker, and Nan Tang. 2016. Detecting data errors: Where are we and what needs to be done? Proceedings of the VLDB Endowment 9, 12 (2016), 993–1004. https://doi.org/10.14778/2994509.2994518
  3. [3]Patricia C. Arocena, Boris Glavic, Giansalvatore Mecca, Renée J. Miller, Paolo Papotti, and Donatello Santoro. 2015. Messing up with BART: Error generation for evaluating data-cleaning algorithms. Proceedings of the VLDB Endowment 9, 2 (2015), 36–47. https://doi.org/10.14778/2850578.2850579
  4. [4]Fabian Biester, Mohamed Abdelaal, and Daniel Del Gaudio. 2025. LLM-Clean: Context-Aware Tabular Data Cleaning via LLM-Generated OFDs. In New Trends in Database and Information Systems (Communications in Computer and Information Science), Joe Tekli, Johann Gamper, Richard Chbeir, Yannis Manolopoulos, Salma Sassi, Mirjana Ivanovic, Genoveva Vargas-Solar, and Ester Zumpano (Eds.), Vol. 2186. Springer Nature Switzerland, Cham, 68–78. https://doi.org/10.1007/978-3-031-70421-5_7
  5. [5]Jan-Micha Bodensohn, Ulf Brackmann, Liane Vogel, Anupam Sanghi, and Carsten Binnig. 2025. Unveiling Challenges for LLMs in Enterprise Data Engineering. Proceedings of the VLDB Endowment 19, 2 (2025), 196–209. https://doi.org/10.14778/3773749.3773758
  6. [6]Sebastian Bordt, Harsha Nori, Vanessa Rodrigues, Besmira Nushi, and Rich Caruana. 2024. Elephants Never Forget: Memorization and Learning of Tabular Data in Large Language Models. In First Conference on Language Modeling. https://openreview.net/forum?id=HLoWN6m4fSarxiv.org/abs/2404.06209
  7. [7]Nicholas Carlini, Daphne Ippolito, Matthew Jagielski, Katherine Lee, Florian Tramer, and Chiyuan Zhang. 2023. Quantifying Memorization Across Neural Language Models. In The Eleventh International Conference on Learning Representations. https://openreview.net/forum?id=TatRHT_1cKarxiv.org/abs/2202.07646
  8. [8]Nicholas Carlini, Florian Tramer, Eric Wallace, Matthew Jagielski, Ariel Herbert-Voss, Katherine Lee, Adam Roberts, Tom Brown, Dawn Song, Úlfar Erlingsson, Alina Oprea, and Colin Raffel. 2021. Extracting Training Data from Large Language Models. In 30th USENIX Security Symposium (USENIX Security 21). USENIX Association, 2633–2650. https://www.usenix.org/conference/usenixsecurity21/presentation/carlini-extractingarxiv.org/abs/2012.07805
  9. [9]Zui Chen, Lei Cao, Sam Madden, Tim Kraska, Zeyuan Shang, Ju Fan, Nan Tang, Zihui Gu, Chunwei Liu, and Michael Cafarella. 2024. SEED: Domain-Specific Data Curation With Large Language Models. arXiv:2310.00749v3 [cs.DB] https://arxiv.org/abs/2310.00749v3
  10. [10]Xu Chu, Ihab F. Ilyas, Sanjay Krishnan, and Jiannan Wang. 2016. Data Cleaning: Overview and Emerging Challenges. In Proceedings of the 2016 International Conference on Management of Data. ACM, 2201–2206. https://doi.org/10.1145/2882903.2912574
  11. [11]Xu Chu, Ihab F. Ilyas, and Paolo Papotti. 2013. Holistic data cleaning: Putting violations into context. In 2013 IEEE 29th International Conference on Data Engineering (ICDE). IEEE, 458–469. https://doi.org/10.1109/icde.2013.6544847
  12. [12]Xu Chu, John Morcos, Ihab F. Ilyas, Mourad Ouzzani, Paolo Papotti, Nan Tang, and Yin Ye. 2015. KATARA: A Data Cleaning System Powered by Knowledge Bases and Crowdsourcing. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. 1247–1261. https://doi.org/10.1145/2723372.2749431
  13. [13]Michele Dalicham, Amr Ebaid, Ahmed Eldawy, Ahmed Elmagarmid, Ihab F. Ilyas, Mourad Ouzzani, and Nan Tang. 2013. NADEEF: A commodity data cleaning system. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. ACM, 541–552. https://doi.org/10.1145/2463676.2465327
  14. [14]DeepSeek-AI. 2026. DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligence. arXiv:2606.19348 [cs.CL] https://arxiv.org/abs/2606.19348
  15. [15]Çağatay Demiralp, Fabian Wenz, Peter Baile Chen, Moe Kayali, Nesime Tatbul, and Michael Stonebraker. 2025. Mind the Data Gap: Bridging LLMs to Enterprise Data Tasks. arXiv:2407.20256 https://arxiv.org/abs/2407.20256 Poster at North East Database Day 2024.
  16. [16]Bradley Efron and Robert J. Tibshirani. 1994. An Introduction to the Bootstrap (1 ed.). Chapman and Hall/CRC. https://www.routledge.com/An-Introduction-to-the-Bootstrap/Efron-Tibshirani/p/book/9780412042317
  17. [17]Raul Castro Fernandez, Aaron J. Elmore, Michael J. Franklin, Sanjay Krishnan, and Chenhao Tan. 2023. How Large Language Models Will Disrupt Data Management. Proceedings of the VLDB Endowment 16, 11 (2023), 3302–3309. https://doi.org/10.14778/3611479.3611527
  18. [18]Shahriar Golchin and Mihai Surdeanu. 2024. Time Travel in LLMs: Tracing Data Contamination in Large Language Models. In International Conference on Learning Representations, B. Kim, Y. Yue, S. Chaudhuri, K. Fragiadaki, M. Khan, and Y. Sun (Eds.), Vol. 2024. 43008–43029. https://proceedings.iclr.cc/paper_files/paper/2024/file/bc39a59c49b731c51398ad6b12f301d3-Paper-Conference.pdf
  19. [19]Aaron Grattafiori, Abhimanyu Dubey, Abhinav Jauhri, Abhinav Pandey, Abhishek Kadian, Ahmad Al-Dahle, Aiesha Letman, Akhil Mathur, Alan Schelten, Alex Vaughan, et al. 2024. The Llama 3 Herd of Models. arXiv:2407.21783 https://arxiv.org/abs/2407.21783
  20. [20]Alireza Heidari, Joshua McGrath, Ihab F. Ilyas, and Theodoros Rekatsinas. 2019. HoloDetect: Few-Shot Learning for Error Detection. In Proceedings of the 2019 International Conference on Management of Data. ACM, 829–846. https://doi.org/10.1145/3299869.3319888
  21. [21]Sture Holm. 1979. A Simple Sequentially Rejective Multiple Test Procedure. Scandinavian Journal of Statistics 6, 2 (1979), 65–70. https://www.jstor.org/stable/4615733 JSTOR 4615733.DOI
  22. [22]Ihab F. Ilyas and Xu Chu. 2019. Data Cleaning. ACM. https://doi.org/10.1145/3310205
  23. [23]Alon Jacovi, Avi Caciularu, Omer Goldman, and Yoav Goldberg. 2023. Stop Uploading Test Data in Plain Text: Practical Strategies for Mitigating Data Contamination by Evaluation Benchmarks. In Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing. 5075–5084. https://doi.org/10.18653/v1/2023.emnlp-main.308
  24. [24]Nikhil Kandpal, Haikang Deng, Adam Roberts, Eric Wallace, and Colin Raffel. 2023. Large language models struggle to learn long-tail knowledge. In Proceedings of the 40th International Conference on Machine Learning (Proceedings of Machine Learning Research), Vol. 202. PMLR, 15696–15707. https://proceedings.mlr.press/v202/kandpal23a.htmlarxiv.org/abs/2211.08411
  25. [25]Moe Kayali, Fabian Wenz, Nesime Tatbul, and Çağatay Demiralp. 2025. Mind the Data Gap: Bridging LLMs to Enterprise Data Integration. In Proceedings of the Conference on Innovative Data Systems Research (CIDR ’25). Amsterdam, Netherlands. https://www.vldb.org/cidrdb/papers/2025/p34-kayali.pdfarxiv.org/abs/2412.20331
  26. [26]Sanjay Krishnan, Jiannan Wang, Eugene Wu, Michael J. Franklin, and Ken Goldberg. 2016. ActiveClean: Interactive data cleaning for statistical modeling. Proceedings of the VLDB Endowment 9, 12 (2016), 948–959. https://doi.org/10.14778/2994509.2994514
  27. [27]Woosuk Kwon, Zhuohan Li, Siyuan Zhuang, Ying Sheng, Lianmin Zheng, Cody Hao Yu, Joseph E. Gonzalez, Hao Zhang, and Ion Stoica. 2023. Efficient Memory Management for Large Language Model Serving with PagedAttention. In Proceedings of the 29th Symposium on Operating Systems Principles. ACM, 611–626. https://doi.org/10.1145/3600006.3613165
  28. [28]Peng Li, Yeye He, Dor Rosenthal, Weiwei Cui, Song Ge, Haidong Zhang, Danielle Rifinski Fainman, Dongmei Zhang, and Surajit Chaudhuri. 2024. TableGPT: Table Fine-tuning GPT for Diverse Table Tasks. Proceedings of the ACM Management of Data 2, 3, Article 176 (2024), 28 pages. https://doi.org/10.1145/3654979
  29. [29]Peng Li, Xi Rao, Jennifer Blase, Yue Zhang, Xu Chu, and Ce Zhang. 2021. CleanML: A Study for Evaluating the Impact of Data Cleaning on ML Classification Tasks. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE, 13–24. https://doi.org/10.1109/icde51399.2021.00009
  30. [30]Jiacheng Liu, Sewon Min, Luke Zettlemoyer, Yejin Choi, and Hannah Hajishirzi. 2024. Infini-gram: Scaling Unbounded n-gram Language Models to a Trillion Tokens. In First Conference on Language Modeling. https://openreview.net/forum?id=u2vAyMeLMm
  31. [31]Shayne Longpre, Kartik Perisetla, Anthony Chen, Nikhil Ramesh, Chris DuBois, and Sameer Singh. 2021. Entity-Based Knowledge Conflicts in Question Answering. In Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing. 7052–7063. https://doi.org/10.18653/v1/2021.emnlp-main.565
  32. [32]Mohammad Mahdavi and Ziawasch Abedjan. 2020. Effective Error Correction via a Unified Context Representation and Transfer Learning. Proceedings of the VLDB Endowment 13, 11 (2020), 1948–1961. https://doi.org/10.14778/3407709.3407801
  33. [33]Mohammad Mahdavi, Ziawasch Abedjan, Raul Castro Fernandez, Samuel Madden, Mourad Ouzzani, Michael Stonebraker, and Nan Tang. 2019. Raha: A Configuration-Free Error Detection System. In Proceedings of the 2019 International Conference on Management of Data. ACM, 865–882. https://doi.org/10.1145/3299869.3324956
  34. [34]Alex Allen, Akari Asai, Victor Zhong, Rajarshi Das, Daniel Khashabi, and Hannah Hajishirzi. 2023. When Not to Trust Language Models: Investigating Effectiveness of Parametric and Non-Parametric Memories. In Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 9802–9822. https://doi.org/10.18653/v1/2023.acl-long.546
  35. [35]R. Thomas McCoy, Shunyu Yao, Dan Friedman, Mathew D. Hardy, and Thomas L. Griffiths. 2024. Numbers, Numbers, Numbers: Understanding how large language models are shaped by the problem they are trained to solve. Proceedings of the National Academy of Sciences 121, 41 (2024), e2322402121. https://doi.org/10.1073/pnas.2322402121
  36. [36]Iman Mirzadeh, Keivan Alizadeh-Vahid, Hooman Shahrorhkhi, Oncel Tuzel, Samy Bengio, and Mehrdad Farajtabar. 2025. GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Models. In International Conference on Learning Representations, Y. Yue, A. Garg, N. Peng, F. Sha, and R. Yu (Eds.), Vol. 2025. 94743–94765. https://proceedings.iclr.cc/paper_files/paper/2025/file/ec2e7a896f8250986b3907f57621ce94-Paper-Conference.pdfarxiv.org/abs/2410.05229
  37. [37]Avanika Narayan, Ines Chami, Laurel Orr, and Christopher Ré. 2022. Can Foundation Models Wrangle Your Data? Proceedings of the VLDB Endowment 16, 4 (2022), 738–746. https://doi.org/10.14778/3574245.3574258
  38. [38]Ella Neeman, Roee Aharoni, Or Hovnovich, Leshem Choshen, Idan Spektor, and Omri Abend. 2023. DisentQA: Dismantling Parametric and Contextual Knowledge with Counterfactual Question Answering. In Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 10056–10070. https://doi.org/10.18653/v1/2023.acl-long.559
  39. [39]Felix Neutatz, Mohammad Mahdavi, and Ziawasch Abedjan. 2019. ED2: A Case for Active Learning in Error Detection. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management. 2249–2252. https://doi.org/10.1145/3357384.3358129
  40. [40]Wei Ni, Xiaoye Miao, Xiangyu Zhao, Yangyang Wu, Shuwei Liang, and Jianwei Yin. 2024. Automatia Data Repair: Are We Ready to Deploy? Proceedings of the VLDB Endowment 17, 10 (2024), 2617–2630. https://doi.org/10.14778/3675034.3675051
  41. [41]Wei Ni, Kaihang Zhang, Xiaoye Miao, Xiangyu Zhao, Yangyang Wu, Yaoshu Wang, and Jianwei Yin. 2025. ZeroED: Hybrid Zero-Shot Error Detection Through Large Language Model Reasoning. In 2025 IEEE 41st International Conference on Data Engineering (ICDE). 3126–3139. https://doi.org/10.1109/ICDE65448.2025.00234
  42. [42]Wei Ni, Kaihang Zhang, Xiaoye Miao, Xiangyu Zhao, Yangyang Wu, and Jianwei Yin. 2024. InterClean: An Iterative Data Cleaning Framework with Large Language Models. In Proceedings of ACM Turing Award Celebration Conference - CHINA 2024. Association for Computing Machinery, 100–105. https://doi.org/10.1145/3674399.3674436
  43. [43]Curtis G. Northcutt, Anish Athalye, and Jonas Mueller. 2021. Pervasive Label Errors in Test Sets Destabilize Machine Learning Benchmarks. In Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks, J. Vanschoren and S. Yeung (Eds.), Vol. 1. https://datasets-benchmarks-proceedings.neurips.cc/paper_files/paper/2021/file/f2217062e9a397a1dca429e7d70bc6ca-Paper-round1.pdfarxiv.org/abs/2103.14749
  44. [44]OpenAI. 2026. GPT-6.1-Sol. https://openai.com/index/introducing-gpt-6-1-sol/ Accessed: 2026-10-03.
  45. [45]Yonatan Oren, Nicole Meister, Niladri Chatterji, Faisal Ladhak, and Tatsunori Hashimoto. 2024. Proving Test Set Contamination in Black-Box Language Models. In International Conference on Learning Representations, B. Kim, Y. Yue, S. Chaudhuri, K. Fragkiadaki, M. Khan, and Y. Sun (Eds.), Vol. 2024. 16354–16372. https://proceedings.iclr.cc/paper_files/paper/2024/file/46e624c244f6669223d488edf4e835-Paper-Conference.pdf
  46. [46]Art B. Owen and Dean Eckles. 2012. Bootstrapping Data Arrays of Arbitrary Order. The Annals of Applied Statistics 6, 3 (2012), 895–927. https://doi.org/10.1214/12-AOAS547
  47. [47]Rabiat Peerogin, Tamara Steiner, and Christian Bizer. 2025. Entity Matching using Large Language Models. In Proceedings of the 28th International Conference on Extending Database Technology. OpenProceedings.org, 529–541. https://doi.org/10.48786/edbt.2025.42
  48. [48]Fabio Petroni, Tim Rocktäschel, Sebastian Riedel, Patrick Lewis, Anton Bakhtin, Yuxiang Wu, and Alexander Miller. 2019. Language Models as Knowledge Bases?. In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). 2463–2473. https://doi.org/10.18653/v1/D19-1250
  49. [49]Danrui Qi, Zhengjie Miao, and Jiannan Wang. 2025. CleanAgent: Automating Data Standardization with LLM-based Agents. In VLDB 2025 Workshop: Data Driven AI. https://www.vldb.org/2025/Workshops/VLDB-Workshops-2025/DATAI/DATAI25_8.pdfarxiv.org/abs/2403.08291
  50. [50]Qwen, An Yang, Baosong Yang, Beichen Zhang, Binyuan Hui, Bo Zheng, Bowen Yu, Chengyuan Li, Dayiheng Liu, et al. 2024. Qwen2.5 Technical Report. arXiv:2412.15115 https://arxiv.org/abs/2412.15115
  51. [51]Qwen Team. 2026. Qwen3-8: Max: A New Bar for Coding and Cowork. https://qwen.ai/blog/?id=qwen3.8
  52. [52]Erhard Rahm and Hong Hai Do. 2000. Data cleaning: Problems and current approaches. IEEE Data Eng. Bull. 23, 4 (2000), 3–13. https://dbs.uni-leipzig.de/research/publications/data-cleaning-problems-and-current-approaches
  53. [53]Theodoros Rekatsinas, Xu Chu, Ihab F. Ilyas, and Christopher Ré. 2017. HoloClean: Holistic data repairs with probabilistic inference. Proceedings of the VLDB Endowment 10, 11 (2017), 1190–1201. https://doi.org/10.14778/3137628.3137631
  54. [54]Jayanta Sadhu, Sayem Shahad, and Kenneth Marino. 2026. DERELAB: Probing Defeasible Reasoning and Confirmation Bias in LLMs with a Generative Benchmark. In Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, 36952–36985. https://aclanthology.org/2026.emnlp-main.1625/arxiv.org/abs/2608.30413
  55. [55]Oscar Sainz, Jon Ander Campos, Iker García-Ferrero, Julen Etxaniz, Oier Lopez de Lacalle, and Eneko Agirre. 2023. NLP Evaluation in trouble: On the Need to Measure LLM Data Contamination for each Benchmark. In Findings of the Association for Computational Linguistics: EMNLP 2023. 10776–10787. https://doi.org/10.18653/v1/2023.findings-emnlp.722
  56. [56]Abulhair Saparov and He He. 2023. Language Models Are Greedy Reasoners: A Systematic Formal Analysis of Chain-of-Thought. In The Eleventh International Conference on Learning Representations. https://openreview.net/forum?id=qFVV BzXxR2Varxiv.org/abs/2210.01240
  57. [57]Weijia Shi, Anirudh Ajith, Mengzhou Xia, Yangsibo Huang, Daogao Liu, Terra Blevins, Danqi Chen, and Luke Zettlemoyer. 2024. Detecting Pretraining Data from Large Language Models. In International Conference on Learning Representations, Vol. 2024. 51826–51843. https://proceedings.iclr.cc/paper_files/paper/2024/file/e32ad85fa27be4a9868d55703f01323e-Paper-Conference.pdf
  58. [58]Matteo Silvestri, Fabiano Veglianti, Flavio Giorgi, Fabrizio Silvestri, and Gabriele Tolomei. 2026. When Large Language Models Know the Table: A Framework for Assessing Data Contamination in Tabular Datasets. In Conference on Language Modeling (COLM). https://proceedings.coml.c?paper_files/paper/2026/hash/d80f533473c2dc8dd6984ceffc3ed3df-Abstract-Conference.htmlarxiv.org/abs/2510.20351
  59. [59]Jianhong Tu, Ju Fan, Nan Tang, Peng Wang, Guoliang Li, Xiaoyong Du, Xiaofeng Jia, and Song Gao. 2023. Unicorn: A Unified Multi-tasking Model for Supporting Matching Tasks in Data Integration. Proceedings of the ACM on Management of Data 1, 1, Article 84 (2023), 26 pages. https://doi.org/10.1145/3588938
  60. [60]Denny Vrandecič and Markus Krötzsch. 2014. Wikidata: A free collaborative knowledgebase. Commun. ACM 57, 10 (2014), 78–85. https://doi.org/10.1145/2629489
  61. [61]Evan Pete Walsh, Luca Soldaini, Dirk Groeneveld, Kyle Lo, Shane Arora, Akshita Bhangia, Yuling Gu, Shengyi Huang, Matt Jordan, Nathan Lambert, et al. 2025. 2 OLMo 2 Furious (OLMo’s Version). In Second Conference on Language Modeling. https://openreview.net/forum?id=2euzgTT9KUarxiv.org/abs/2501.00656
  62. [62]Jiannan Wang and Nan Tang. 2014. Towards dependable data repairing with fixing rules. In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. ACM, 457–468. https://doi.org/10.1145/2588555.2610494
  63. [63]Xinzhi Wang and Chenxiu Liu. 2026. The Table Says Otherwise: Testing LLMs with Counterfactual Relational Data. In VLDB 2026 Workshop: NOVAS. https://www.vldb.org/2026/Workshops/VLDB-Workshops-2026/NOVAS/NOVAS26_21.pdfarxiv.org/abs/2606.23667
  64. [64]Yibo Wang, Riten Zhang, Yinghao He, Yongye Su, Bharat Bhargava, and Chunwei Liu. 2026. TabClean: Reusable LLM-Synthesized Programs for Tabular Data Cleaning. arXiv:2606.25388 https://arxiv.org/abs/2606.25388
  65. [65]Colin White, Samuel Dooley, Manley Roberts, Arka Pal, Benjamin Feuer, Siddhartha Jain, Ravid Shwartz-Ziv, Neel Jain, Khalid Saiful Islam, Sreemanti Dey, Shubh-Agrawal, Sandeep Singh Sandha, Siddartha Naidu, Chinmay Hegde, Yann LeCun, Tom Goldstein, Willie Neiswanger, and Micah Goldblum. 2025. LiveBench: A Challenging, Contamination-Limited LLM Benchmark. In International Conference on Learning Representations, Vol. 2025. 91595–91631. https://proceedings.iclr.cc/paper_files/paper/2025/hash/e4a64394a5378b3f91a685b4c650d1-Abstract-Conference.htmlarxiv.org/abs/2406.19314
  66. [66]Zhaofeng Wu, Lilu Qiu, Alexis Ross, Ekin Akyürek, Boyuan Chen, Bailin Wang, Najoung Kim, Jacob Andreas, and Yoon Kim. 2024. Reasoning or Reciting? Exploring the Capabilities and Limitations of Language Models Through Counterfactual Tasks. In Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 1819–1862. https://doi.org/10.18653/v1/2024.naacl-long.102
  67. [67]Jian Xie, Kai Zhang, Jiangjie Chen, Renze Lou, and Yu Shu. 2024. Adaptive Chameleon or Stubborn Sloth: Revealing the Behavior of Large Language Models in Knowledge Conflicts. In International Conference on Learning Representations, Vol. 2024. 35623–35646. https://proceedings.iclr.cc/paper_files/paper/2024/file/92961adca8643563b8bcf9999bba9a26dc-Paper-Conference.pdfarxiv.org/abs/2305.13300
  68. [68]Cheng Xu, Shuhao Guan, Derek Greene, and M-Tahar Kechadi. 2024. Benchmark Data Contamination of Large Language Models: A Survey. https://doi.org/10.48550/arXiv.2406.04244 arXiv:2406.04244
  69. [69]Rongwu Xu, Zehan Qi, Zhijiang Guo, Cunxiang Wang, Hongru Wang, Yue Zhang, and Wei Xu. 2024. Knowledge Conflicts for LLMs: A Survey. In Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. 8541–8565. https://doi.org/10.18653/v1/2024.emnlp-main.486
  70. [70]Z.ai. 2026. GLM-5.3: Frontier Coding with Emergent Cyber Capabilities. https://z.ai/blog/glm-5.3 Published August 14, 2026; accessed October 20, 2026.
  71. [71]Haochen Zhang, Yuyang Dong, Chuan Xiao, and Masafumi Oyamada. 2024. Jelyfish: Instruction-Tuning Local Large Language Models for Data Preprocessing. In Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. 8754–8782. https://doi.org/10.18653/v1/2024.emnlp-main.497
  72. [72]Shuo Zhang, Zezhou Huang, and Eugene Wu. 2025. Data cleaning using large language models. In 2025 IEEE 41st International Conference on Data Engineering Workshops (ICDEW). IEEE, 28–32. https://doi.org/10.1109/ICDEW67478.2025.00008
  73. [73]Mark Ziemann, Yotam Eren, and Assam El-Osta. 2016. Gene name errors are widespread in the scientific literature. Genome Biology 17, 1, Article 177 (2016), 3 pages. https://doi.org/10.1186/s13059-016-1044-7

Paper details

vlnc:W_3wktyacd
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 7

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Computer Science

Not recorded for this paper · View statement →

Looking for related papers…
Contents