Dataset Viewer
Auto-converted to Parquet Duplicate
table_id
string
paper_id
string
paper_title
string
paper_authors
list
paper_license
string
split
string
is_comp
bool
image
image
pdf
unknown
chunks
list
cells
list
relations
list
0705.4676v8.1
0705.4676
Recursive n-gram hashing is pairwise independent, at best
[ "Daniel Lemire", "Owen Kaser" ]
CC-BY
train
false
[ 37, 80, 68, 70, 45, 49, 46, 53, 10, 37, 208, 212, 197, 216, 10, 51, 32, 48, 32, 111, 98, 106, 10, 60, 60, 10, 47, 76, 101, 110, 103, 116, 104, 32, 55, 56, 51, 32, 32, 32, 32, 32, 32, 32, 10, 47, 70, 105, 108, 116, 10...
[ { "text": "name", "x1": 198.0449981689453, "x2": 221.2907257080078, "y1": 471.09698486328125, "y2": 476.0782775878906 }, { "text": "cost per n-gram", "x1": 299.13848876953125, "x2": 368.603271484375, "y1": 471.09698486328125, "y2": 476.0782775878906 }, { "text": "...
[ { "id": 7, "tex": "$O(n L |\\Sigma|)$", "content": [ "O(nL|Σ|)" ], "start_row": 1, "end_row": 1, "start_col": 3, "end_col": 3 }, { "id": 9, "tex": "$O(L \\log L 2^{O(\\log^*L)})$", "content": [ "O(L", "log", "L2O(log∗", "L))" ], "...
[ { "chunk_id_1": 0, "chunk_id_2": 1, "relation": 1, "num_blank": 0 }, { "chunk_id_1": 0, "chunk_id_2": 4, "relation": 2, "num_blank": 0 }, { "chunk_id_1": 1, "chunk_id_2": 2, "relation": 1, "num_blank": 0 }, { "chunk_id_1": 1, "chunk_id_2": 5, "...
0804.1448v1.1
0804.1448
Fast k Nearest Neighbor Search using GPU
[ "Vincent Garcia", "Eric Debreuve", "Michel Barlaud" ]
CC-BY
train
false
"JVBERi0xLjUKJdDUxdgKMyAwIG9iago8PAovTGVuZ3RoIDI4MDYgICAgICAKL0ZpbHRlciAvRmxhdGVEZWNvZGUKPj4Kc3RyZWF(...TRUNCATED)
[{"text":"Methods","x1":178.68299865722656,"x2":216.37747192382812,"y1":708.3209838867188,"y2":713.3(...TRUNCATED)
[{"id":0,"tex":"","content":[],"start_row":0,"end_row":0,"start_col":0,"end_col":0},{"id":1,"tex":"M(...TRUNCATED)
[{"chunk_id_1":0,"chunk_id_2":1,"relation":1,"num_blank":0},{"chunk_id_1":0,"chunk_id_2":8,"relation(...TRUNCATED)
0903.0843v2.3
0903.0843
Algorithms for Weighted Boolean Optimization
[ "Vasco Manquinho", "Joao Marques-Silva", "Jordi Planes" ]
CC-BY
train
false
"JVBERi0xLjUKJdDUxdgKMyAwIG9iago8PAovTGVuZ3RoIDY1OSAgICAgICAKL0ZpbHRlciAvRmxhdGVEZWNvZGUKPj4Kc3RyZWF(...TRUNCATED)
[{"text":"Class","x1":139.74600219726562,"x2":162.5483856201172,"y1":471.9070129394531,"y2":476.8883(...TRUNCATED)
[{"id":21,"tex":"SYN","content":["SYN"],"start_row":3,"end_row":3,"start_col":0,"end_col":0},{"id":0(...TRUNCATED)
[{"chunk_id_1":0,"chunk_id_2":1,"relation":1,"num_blank":0},{"chunk_id_1":0,"chunk_id_2":7,"relation(...TRUNCATED)
0903.0843v2.4
0903.0843
Algorithms for Weighted Boolean Optimization
[ "Vasco Manquinho", "Joao Marques-Silva", "Jordi Planes" ]
CC-BY
train
false
"JVBERi0xLjUKJdDUxdgKMyAwIG9iago8PAovTGVuZ3RoIDY2NSAgICAgICAKL0ZpbHRlciAvRmxhdGVEZWNvZGUKPj4Kc3RyZWF(...TRUNCATED)
[{"text":"Class","x1":139.74600219726562,"x2":162.5483856201172,"y1":471.9070129394531,"y2":476.8883(...TRUNCATED)
[{"id":19,"tex":"49","content":["49"],"start_row":2,"end_row":2,"start_col":5,"end_col":5},{"id":20,(...TRUNCATED)
[{"chunk_id_1":0,"chunk_id_2":1,"relation":1,"num_blank":0},{"chunk_id_1":0,"chunk_id_2":7,"relation(...TRUNCATED)
0905.0586v1.1
0905.0586
WinBioinfTools: Bioinformatics Tools for Windows High Performance Computing Server 2008
[ "Mohamed Abouelhoda", "Hisham Mohamed" ]
CC-BY-NC-SA
train
false
"JVBERi0xLjUKJdDUxdgKMyAwIG9iago8PAovTGVuZ3RoIDc1NSAgICAgICAKL0ZpbHRlciAvRmxhdGVEZWNvZGUKPj4Kc3RyZWF(...TRUNCATED)
[{"text":"Database","x1":143.91900634765625,"x2":181.21923828125,"y1":475.2950134277344,"y2":479.778(...TRUNCATED)
[{"id":3,"tex":"{Size (GB)}","content":["Size","(GB)"],"start_row":0,"end_row":0,"start_col":3,"end_(...TRUNCATED)
[{"chunk_id_1":0,"chunk_id_2":1,"relation":1,"num_blank":0},{"chunk_id_1":0,"chunk_id_2":4,"relation(...TRUNCATED)
0905.0586v1.2
0905.0586
WinBioinfTools: Bioinformatics Tools for Windows High Performance Computing Server 2008
[ "Mohamed Abouelhoda", "Hisham Mohamed" ]
CC-BY-NC-SA
train
false
"JVBERi0xLjUKJdDUxdgKMyAwIG9iago8PAovTGVuZ3RoIDEyNjUgICAgICAKL0ZpbHRlciAvRmxhdGVEZWNvZGUKPj4Kc3RyZWF(...TRUNCATED)
[{"text":"Database","x1":140.73899841308594,"x2":178.0392303466797,"y1":491.4339904785156,"y2":495.9(...TRUNCATED)
[{"id":48,"tex":"3.5","content":["3.5"],"start_row":5,"end_row":5,"start_col":7,"end_col":7},{"id":5(...TRUNCATED)
[{"chunk_id_1":0,"chunk_id_2":1,"relation":1,"num_blank":0},{"chunk_id_1":0,"chunk_id_2":17,"relatio(...TRUNCATED)
0905.0586v1.4
0905.0586
WinBioinfTools: Bioinformatics Tools for Windows High Performance Computing Server 2008
[ "Mohamed Abouelhoda", "Hisham Mohamed" ]
CC-BY-NC-SA
train
false
"JVBERi0xLjUKJdDUxdgKMyAwIG9iago8PAovTGVuZ3RoIDEyNzIgICAgICAKL0ZpbHRlciAvRmxhdGVEZWNvZGUKPj4Kc3RyZWF(...TRUNCATED)
[{"text":"ItemType","x1":154.9250030517578,"x2":204.0393829345703,"y1":515.0449829101562,"y2":519.52(...TRUNCATED)
[{"id":19,"tex":"{HDD Raid 500GB, 7200rpm, 16MB, SATA II NCQ}","content":["HDD","Raid","500GB,","720(...TRUNCATED)
[{"chunk_id_1":0,"chunk_id_2":1,"relation":1,"num_blank":0},{"chunk_id_1":0,"chunk_id_2":3,"relation(...TRUNCATED)
0905.0794v5.2
0905.0794
Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables
[ "WeiGuo Zhang", "GuoZhen Xiao" ]
CC-BY
train
false
"JVBERi0xLjUKJdDUxdgKMyAwIG9iago8PAovTGVuZ3RoIDQzMzIgICAgICAKL0ZpbHRlciAvRmxhdGVEZWNvZGUKPj4Kc3RyZWF(...TRUNCATED)
[{"text":"(30,5,24,2 29 − 2 14 − 2 13 )","x1":180.4340057373047,"x2":290.991455078125,"y1":707.3(...TRUNCATED)
[{"id":1,"tex":"$(36,5, 30,2^{35}-2^{17}-2^{15}-2^{6})^*$","content":["(36,","5,","30,","235","−",(...TRUNCATED)
[{"chunk_id_1":0,"chunk_id_2":1,"relation":1,"num_blank":0},{"chunk_id_1":0,"chunk_id_2":2,"relation(...TRUNCATED)
0906.0231v3.1
0906.0231
Solving $k$-Nearest Neighbor Problem on Multiple Graphics Processors
[ "Kimikazu Kato", "Tikara Hosino" ]
CC-BY
train
false
"JVBERi0xLjUKJdDUxdgKMyAwIG9iago8PAovTGVuZ3RoIDQ5MCAgICAgICAKL0ZpbHRlciAvRmxhdGVEZWNvZGUKPj4Kc3RyZWF(...TRUNCATED)
[{"text":"n","x1":222.26800537109375,"x2":228.24755859375,"y1":481.9700012207031,"y2":486.9512939453(...TRUNCATED)
[{"id":27,"tex":"173.3","content":["173.3"],"start_row":5,"end_row":5,"start_col":2,"end_col":2},{"i(...TRUNCATED)
[{"chunk_id_1":0,"chunk_id_2":1,"relation":1,"num_blank":0},{"chunk_id_1":0,"chunk_id_2":5,"relation(...TRUNCATED)
0908.3280v2.2
0908.3280
On the Relationship between Trading Network and WWW Network: A Preferential Attachment Perspective
[ "Andri Mirzal" ]
CC-BY-NC-SA
train
false
"JVBERi0xLjUKJdDUxdgKMyAwIG9iago8PAovTGVuZ3RoIDkyNCAgICAgICAKL0ZpbHRlciAvRmxhdGVEZWNvZGUKPj4Kc3RyZWF(...TRUNCATED)
[{"text":"Orderedbystand.meas.","x1":206.44200134277344,"x2":298.2902526855469,"y1":498.657012939453(...TRUNCATED)
[{"id":40,"tex":"China","content":["China"],"start_row":10,"end_row":10,"start_col":2,"end_col":2},{(...TRUNCATED)
[{"chunk_id_1":0,"chunk_id_2":1,"relation":1,"num_blank":0},{"chunk_id_1":0,"chunk_id_2":2,"relation(...TRUNCATED)
End of preview. Expand in Data Studio

SciTSR-CC-BY-NC-SA

A license-filtered subset of SciTSR, a large-scale table structure recognition dataset of scientific tables extracted from arXiv LaTeX source files.

This subset contains tables whose source papers are compatible with a CC-BY-NC-SA 4.0 open-weight model release — covering public domain, CC-BY, CC-BY-NC, and CC-BY-NC-SA licensed papers. The dataset itself is released under CC-BY-NC-SA 4.0.

Dataset Details

Split Tables Papers
train 697
test 192
total 889 470

Source paper licenses present:

License Tables Notes
CC-BY 444 Attribution required
CC-BY-NC-SA 337 NC + share-alike
CC0 85 Public domain
other:http://creativecommons.org/licenses/publicdomain/ 23 Old CC public domain dedication

Why This Subset Exists

The full SciTSR dataset (15,000 tables) was crawled from arXiv without license filtering. ~90% of those papers use the arXiv non-exclusive license, which retains full author copyright. This subset was produced by querying the arXiv OAI-PMH API for the license of each source paper and retaining only those compatible with a non-commercial open-weight release.

License compatibility logic: CC-BY-NC-SA on model weights requires that training data allows NC use and that any SA clause matches the output license. CC-BY-SA was explicitly excluded because its SA clause conflicts with adding an NC restriction. This analysis assumes model weights are not derivative works of training data — a legally unsettled question. Users should conduct their own legal review for their specific use case.

For unrestricted commercial use with no attribution requirements, see SciTSR-PD.

Dataset Structure

Each row represents one table extracted from a scientific PDF. The paper_license column records the source paper's license so downstream users can apply their own filtering.

Column Type Description
table_id string Unique identifier, format {arxiv_id}v{version}.{table_index}
paper_id string arXiv paper ID
paper_title string Paper title from arXiv metadata
paper_authors list[string] Author names from arXiv metadata
paper_license string License of the source paper
split string train or test
is_comp bool Whether this table is in the SciTSR-COMP subset (tables with at least one spanning cell)
image Image PNG render of the table (150 DPI)
pdf binary Raw PDF of the isolated table
chunks list[dict] Pre-extracted text spans with bounding box coordinates {text, x1, x2, y1, y2} (PDF coordinate space, bottom-left origin)
cells list[dict] Structure annotation: {id, tex, content, start_row, end_row, start_col, end_col}
relations list[dict] Chunk adjacency labels {chunk_id_1, chunk_id_2, relation, num_blank} where relation=1 is horizontal and relation=2 is vertical. Empty for test rows.

Usage

from datasets import load_dataset

ds = load_dataset("rootsautomation/SciTSR-cc-by-nc-sa")

# Iterate train split
for row in ds["train"]:
    image   = row["image"]          # PIL Image
    cells   = row["cells"]          # list of cell dicts
    chunks  = row["chunks"]         # list of chunk dicts with positions
    print(row["table_id"], row["paper_title"], row["paper_license"])

# Filter to only public domain if needed
pd_only = ds.filter(lambda x: "CC0" in x["paper_license"] or "publicdomain" in x["paper_license"])

Important Caveats

  • Annotation quality: Structure annotations were generated automatically from LaTeX source by the original SciTSR pipeline. Simple grid tables are generally reliable. Tables with spanning cells (is_comp=True) have a higher rate of annotation errors, particularly in spanning cell coordinates. Treat annotations as noisy weak supervision rather than ground truth.
  • Attribution: CC-BY, CC-BY-NC, and CC-BY-NC-SA papers require attribution to original authors. paper_title, paper_authors, and paper_id (linking to arxiv.org/abs/{paper_id}) are provided for this purpose.
  • Chunk coordinates: The chunks field was pre-processed by TabbyCDF and may contain noise.
  • Relations: Available for train split only; empty list for test.

Source & Citation

This dataset is a license-filtered derivative of SciTSR. If you use this dataset, please cite the original work:

@article{chi2019complicated,
  title={Complicated Table Structure Recognition},
  author={Chi, Zewen and Huang, Heyan and Xu, Heng-Da and Yu, Houjin and Yin, Wanxuan and Mao, Xian-Ling},
  journal={arXiv preprint arXiv:1908.04729},
  year={2019}
}
Downloads last month
14

Paper for rootsautomation/SciTSR-cc-by-nc-sa