Humanity’s List

AIarXiv

Ranked by formulaVerdict: Notable

Data World: Scaling Data Environments from Scratch

Data agents use code to process heterogeneous files and derive analytical insights.

By Li, Xu, Pang +16

Score█████░░░░░5.3

Caveats

  • Preprint; not yet peer reviewed.

VerdictWorth a reader's time today.

Read the originalPDFCode

Abstract

Data agents use code to process heterogeneous files and derive analytical insights. Scaling their training faces costly environment curation, privacy and intellectual-property restrictions, and difficulty verifying open-ended findings without known generative truth. Our core insight is to specify the world behind the files before generating the files themselves. We introduce Data World, a multi-agent engine that synthesizes environments, tasks, and rubrics from explicit mechanisms. Independent audits check target recoverability from observed files; rubrics support evaluation and RL rewards. Human preference-based curation for question realism selects 100 tasks across 50 held-out worlds and 16 domains for DataWorld-Bench. The engine also yields 2,135 training tasks from 1,037 disjoint worlds. Evaluation of ten frontier models shows that the benchmark remains challenging, particularly for insight discovery, with a consistent computation-insight gap. RL-zero training on the synthesized tasks produces DataWorld-35B-A3B from Qwen3.6-35B-A3B without trajectory distillation. Under matched evaluation, it improves over its base by 7.06 points on DataWorld-Bench, 14.28 on DAComp, 20.90 on DABstep-Hard, and 12.13 on JobBench, a broader occupational benchmark.

Zhanli Li, Zeyuan Xu, Chaoxu Pang, Zeyuan Liu, Anyang Ji, Te Sun, Kongcheng Zhang, Wenbo Xu, Xubin Yue, Shipeng Luo, Junjie Zhao, Yingfan Hua, Jingqing Ruan, Zhongda Su, Feng Hong, Zhizhao Zeng, Ke Zeng, Xunliang Cai, Hanjia Ye

The editor's rubric

Heuristic review

Leverage4 / 5
A general-purpose tool used across several fields (Adam, ResNet, LoRA, next-generation sequencing).
24% of this desk’s rubric
Magnitude3 / 5
Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
18% of this desk’s rubric
Evidence3 / 5
Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
14% of this desk’s rubric
Novelty3 / 5
A genuinely new approach to an open problem.
16% of this desk’s rubric
Trajectory3 / 5
A clear path to scale.
18% of this desk’s rubric
Stakes2 / 5
Benefits a professional community (practitioners, clinicians, engineers).
10% of this desk’s rubric

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose); breadth (many tasks); gains (relative gain); novelty (discovery); verification (multiple benchmarks, held-out test, independent replication); scale (scalable); stakes (general AI).

How the score was computed

rank-2026-10-18

Score█████░░░░░5.3

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit
6.3 / 10
Weighted rubric, evidence-gated.
Adjusted merit
5.1 / 10
Shrunk toward the desk prior by editor confidence (48%).
Attention
61%
Citations, upvotes, points, mentions.
Freshness
42%
Half-life decay since publication.
  • Citations0 (reference 15, via semantic-scholar, Oct 18, 2026, 13:49 UTC)
  • Influential citations0 (reference 3, via semantic-scholar, Oct 18, 2026, 13:49 UTC)
  • Hugging Face upvotes27 (reference 25, via hf-daily, Oct 18, 2026, 13:49 UTC)
  • GitHub stars19 (reference 250, via hf-daily, Oct 18, 2026, 13:49 UTC)

The record

  • Reviewed by heuristic-v7 on Oct 18, 2026, 13:49 UTC. Paper type: method.
  • Categories: cs.AI
  • TOP, No.5 in the Front page edition of October 18, 2026.
  • TOP, No.5 in the Artificial Intelligence edition of October 18, 2026.