Dataset Viewer
Auto-converted to Parquet Duplicate
paper_id
stringlengths
23
23
doi
stringlengths
23
23
title
stringlengths
18
163
authors
listlengths
1
1
date_published
stringdate
2025-07-25 00:00:00+0900
2026-07-24 00:00:00+0900
abstract
stringlengths
130
2.93k
keywords
listlengths
8
34
language
stringclasses
1 value
genre
stringclasses
3 values
canonical_url
stringlengths
39
39
works_url
stringlengths
85
189
tex_source
large_stringlengths
6.68k
498k
archive_path
stringlengths
24
125
archive_sha256
stringlengths
64
64
tex_entry
stringlengths
8
121
tex_sha256
stringlengths
64
64
source_archive_paths
listlengths
1
12
source_archive_sha256s
listlengths
1
12
source_tex_entries
listlengths
1
12
source_tex_sha256s
listlengths
1
12
mapping_status
stringclasses
4 values
content_status
stringclasses
1 value
quality_flags
listlengths
0
3
10.5281/zenodo.21531413
10.5281/zenodo.21531413
Evidence-Carrying Operational Claims in Open Systems: Physical Ledgers, Typed Interfaces, and One-Sided Deployment Guarantees
[ "K. Takahashi" ]
2026-07-24T00:00:00+09:00
Evidence-Carrying Operational Claims in Open Systems develops a contract-based framework for evaluating safety, service delivery, resilience, recovery, and other operational claims in open, partially observable, and adaptive systems. Instead of treating these properties as intrinsic system attributes, the paper represe...
[ "evidence-carrying operational claims", "operational assurance", "open systems", "safety-critical systems", "one-sided deployment guarantees", "probabilistic safety verification", "stochastic hybrid systems", "partial observability", "robust control", "causal identification", "model abstraction"...
en
Preprint
https://doi.org/10.5281/zenodo.21531413
https://kadubon.github.io/github.io/works.html#2026-07-24-evidence-carrying-operational-claims-in-open-systems-physical-ledgers-typed-interfaces-and-one-sided-deployment-guarantees-21531413
\documentclass[11pt]{article} \usepackage[T1]{fontenc} \usepackage[utf8]{inputenc} \usepackage{lmodern} \usepackage[margin=1in]{geometry} \usepackage{microtype} \usepackage{mathtools,amssymb,amsthm,bm} \usepackage{booktabs,tabularx,array} \usepackage{float} \usepackage{enumitem} \usepackage{xcolor} \usepackage[round,a...
raw/Evidence-Carrying Operational Claims in Open Systems.zip
8bc9aca3e569fee035132b0fc45764a415594587d4b3e68c2b045bbe5d2db171
Evidence-Carrying Operational Claims in Open Systems.tex
3e0197ca8906d70089ba2ae87137ca916ad59abc57f9db80752d008f46360540
[ "raw/Evidence-Carrying Operational Claims in Open Systems.zip" ]
[ "8bc9aca3e569fee035132b0fc45764a415594587d4b3e68c2b045bbe5d2db171" ]
[ "Evidence-Carrying Operational Claims in Open Systems.tex" ]
[ "3e0197ca8906d70089ba2ae87137ca916ad59abc57f9db80752d008f46360540" ]
exact_normalized_title
valid
[]
10.5281/zenodo.21501931
10.5281/zenodo.21501931
Functional Process Control Dynamics
[ "K. Takahashi" ]
2026-07-23T00:00:00+09:00
"Functional Process Control Dynamics (FPCD) is an auditable framework for evaluating claims about fu(...TRUNCATED)
["causal inference","partial identification","process control","provenance hypergraphs","functional (...TRUNCATED)
en
Preprint
https://doi.org/10.5281/zenodo.21501931
https://kadubon.github.io/github.io/works.html#2026-07-23-functional-process-control-dynamics-21501931
"\\documentclass[11pt]{article}\n\\usepackage[T1]{fontenc}\n\\usepackage[utf8]{inputenc}\n\\usepacka(...TRUNCATED)
raw/Functional Process Control Dynamics.zip
ee0d1e58645cce92ee82ea0dab44d8a87c868372067917c1ae9fdff9f03da72e
Functional Process Control Dynamics.tex
4d623d0740a873fae2985543102ece66b79b4cce63a9a4445777b703ce4ddec4
[ "raw/Functional Process Control Dynamics.zip" ]
[ "ee0d1e58645cce92ee82ea0dab44d8a87c868372067917c1ae9fdff9f03da72e" ]
[ "Functional Process Control Dynamics.tex" ]
[ "4d623d0740a873fae2985543102ece66b79b4cce63a9a4445777b703ce4ddec4" ]
exact_normalized_title
valid
[]
10.5281/zenodo.21393443
10.5281/zenodo.21393443
Epistemic Interface Autogenesis in Controlled Open Worlds
[ "K. Takahashi" ]
2026-07-16T00:00:00+09:00
"Epistemic Interface Autogenesis in Controlled Open Worlds develops a formal framework for evaluatin(...TRUNCATED)
["controlled open worlds","physical compilation","physical causal compiler","feasible generability",(...TRUNCATED)
en
Preprint
https://doi.org/10.5281/zenodo.21393443
https://kadubon.github.io/github.io/works.html#2026-07-16-epistemic-interface-autogenesis-in-controlled-open-worlds-21393443
"\\documentclass[11pt]{article}\n\n\\usepackage[a4paper,margin=26mm]{geometry}\n\\usepackage[T1]{fon(...TRUNCATED)
raw/Epistemic Interface Autogenesis in Controlled Open Worlds.zip
a2b2bb0b42ebf29330270d4af6ee942a561afa9fec4706d5c52b7925e6253d7e
Epistemic Interface Autogenesis in Controlled Open Worlds.tex
b3353b80ba5f4f94dd61ddb5402c134e5c0a11ac758f1ed8536bf5ec2284b7fa
[ "raw/Epistemic Interface Autogenesis in Controlled Open Worlds.zip" ]
[ "a2b2bb0b42ebf29330270d4af6ee942a561afa9fec4706d5c52b7925e6253d7e" ]
[ "Epistemic Interface Autogenesis in Controlled Open Worlds.tex" ]
[ "b3353b80ba5f4f94dd61ddb5402c134e5c0a11ac758f1ed8536bf5ec2284b7fa" ]
exact_normalized_title
valid
[]
10.5281/zenodo.21199529
10.5281/zenodo.21199529
"Dynamic Future-Claim Certification: A Replayable Authority Validation Protocol with Canonical Artif(...TRUNCATED)
[ "K. Takahashi" ]
2026-07-05T00:00:00+09:00
"Dynamic Future-Claim Certification (DFCC) is a replayable protocol for deciding when a bounded clai(...TRUNCATED)
["future claims","bounded future","claim certification","decision systems","AI agents","planning sys(...TRUNCATED)
en
Preprint
https://doi.org/10.5281/zenodo.21199529
https://kadubon.github.io/github.io/works.html#2026-07-05-dynamic-future-claim-certification-a-replayable-authority-validation-protocol-with-canonical-artifacts-21199529
"\\documentclass[11pt]{article}\n\n\\usepackage[utf8]{inputenc}\n\\usepackage[T1]{fontenc}\n\\usepac(...TRUNCATED)
raw/Dynamic Future-Claim Certification.zip
fa228fbb20f9e9f877b0631eb04f3fb1d2778604c40d7bbb4427ddbfdd746878
Dynamic Future-Claim Certification.tex
01f6cd4806c1d3185027fa45ed98f60fcee5942335a8967486363e59745c5bc0
[ "raw/Dynamic Future-Claim Certification.zip" ]
[ "fa228fbb20f9e9f877b0631eb04f3fb1d2778604c40d7bbb4427ddbfdd746878" ]
[ "Dynamic Future-Claim Certification.tex" ]
[ "01f6cd4806c1d3185027fa45ed98f60fcee5942335a8967486363e59745c5bc0" ]
exact_normalized_title
valid
[]
10.5281/zenodo.21147093
10.5281/zenodo.21147093
Verifier Ecology Theory: Packetized Self-Verification Under Residual Accountability
[ "K. Takahashi" ]
2026-07-03T00:00:00+09:00
"Verifier Ecology Theory (VET) studies systems where generating candidate outputs is no longer the m(...TRUNCATED)
["verifier","verifier ecology","AI evaluation","AI safety","self-verifying systems","verification","(...TRUNCATED)
en
Preprint
https://doi.org/10.5281/zenodo.21147093
https://kadubon.github.io/github.io/works.html#2026-07-03-verifier-ecology-theory-packetized-self-verification-under-residual-accountability-21147093
"\\documentclass[11pt]{article}\n\n\\usepackage[utf8]{inputenc}\n\\usepackage[T1]{fontenc}\n\\usepac(...TRUNCATED)
raw/Verifier Ecology Theory.zip
91d763c7b2b9569067166c6b1dcfe5c2e957e450e744226df24c2d23a1d82c34
Verifier Ecology Theory.tex
af4497c824d34bff3393366926337e9e9e87971dcc9c4867a33a32e91a90f380
[ "raw/Verifier Ecology Theory.zip" ]
[ "91d763c7b2b9569067166c6b1dcfe5c2e957e450e744226df24c2d23a1d82c34" ]
[ "Verifier Ecology Theory.tex" ]
[ "af4497c824d34bff3393366926337e9e9e87971dcc9c4867a33a32e91a90f380" ]
manual_evidence
valid
[]
10.5281/zenodo.20995846
10.5281/zenodo.20995846
Finite Operational Structure Theory: A Mathematical Theory of Finite Operational Cuts
[ "K. Takahashi" ]
2026-06-28T00:00:00+09:00
"Finite Operational Structure Theory (FOST) develops a mathematical framework for finite operational(...TRUNCATED)
["finite reasoning","operational support","AI safety","AI governance","decision accountability","aud(...TRUNCATED)
en
Preprint
https://doi.org/10.5281/zenodo.20995846
https://kadubon.github.io/github.io/works.html#2026-06-28-finite-operational-structure-theory-a-mathematical-theory-of-finite-operational-cuts-20995846
"\\pdfobjcompresslevel=0\n\\pdfcompresslevel=9\n\n\\documentclass[11pt]{article}\n\n\\usepackage[a4p(...TRUNCATED)
raw/Finite Operational Structure Theory.zip
04e652c6091313496ba38b406b5280f5638a94924985ea74757087cdb73674d2
Finite Operational Structure Theory.tex
08d9226a3bf03628af709d596e336bacc1b16e8320f42e370a533301d3634365
[ "raw/Finite Operational Structure Theory.zip" ]
[ "04e652c6091313496ba38b406b5280f5638a94924985ea74757087cdb73674d2" ]
[ "Finite Operational Structure Theory.tex" ]
[ "08d9226a3bf03628af709d596e336bacc1b16e8320f42e370a533301d3634365" ]
exact_normalized_title
valid
[]
10.5281/zenodo.20913669
10.5281/zenodo.20913669
Problemogenesis Theory: A Finite Proof-Carrying Audit Calculus for Problem-Frame Activation
[ "K. Takahashi" ]
2026-06-26T00:00:00+09:00
"Problemogenesis Theory develops a finite proof-carrying audit calculus for deciding when anomalies,(...TRUNCATED)
["AI agent","problem framing","audit trail","proof-carrying records","autonomous systems","AI safety(...TRUNCATED)
en
Preprint
https://doi.org/10.5281/zenodo.20913669
https://kadubon.github.io/github.io/works.html#2026-06-26-problemogenesis-theory-a-finite-proof-carrying-audit-calculus-for-problem-frame-activation-20913669
"\\documentclass[11pt]{article}\n\n\n\\usepackage[a4paper,margin=1in]{geometry}\n\\usepackage{amsmat(...TRUNCATED)
raw/Problemogenesis Theory.zip
8788762c6bae16e53fa101aef274a1f33ac100cc379ada07ebb32ade66ab9d9c
Problemogenesis Theory.tex
8b1b1306e1eba3d86d05142c8024a2df54b7b4827e423a814d503477e088443c
[ "raw/Problemogenesis Theory.zip" ]
[ "8788762c6bae16e53fa101aef274a1f33ac100cc379ada07ebb32ade66ab9d9c" ]
[ "Problemogenesis Theory.tex" ]
[ "8b1b1306e1eba3d86d05142c8024a2df54b7b4827e423a814d503477e088443c" ]
exact_normalized_title
valid
[]
10.5281/zenodo.20722725
10.5281/zenodo.20722725
"Chronomorphic Substrate Selection Theory: Certificate-Gated Self-Instantiation Planning for Future (...TRUNCATED)
[ "K. Takahashi" ]
2026-06-16T00:00:00+09:00
"Chronomorphic Substrate Selection Theory (CSST) develops a formal framework for analyzing how a fut(...TRUNCATED)
["Artificial intelligence","self-instantiation","substrate selection","embodiment","computational cl(...TRUNCATED)
en
Preprint
https://doi.org/10.5281/zenodo.20722725
https://kadubon.github.io/github.io/works.html#2026-06-16-chronomorphic-substrate-selection-theory-certificate-gated-self-instantiation-planning-for-future-intelligent-processes-20722725
"\\documentclass[11pt]{article}\n\n\\usepackage[T1]{fontenc}\n\\usepackage[utf8]{inputenc}\n\\usepac(...TRUNCATED)
raw/Chronomorphic Substrate Selection Theory.zip
85f82bce8d77d082a650d735eed945f8020252e823d8dd08255eeeeca71bc7f6
Chronomorphic Substrate Selection Theory.tex
44506ccc1342075918e1c83b9c30287c3e522f33ed0cd69fbc6c6d672cdeed61
[ "raw/Chronomorphic Substrate Selection Theory.zip" ]
[ "85f82bce8d77d082a650d735eed945f8020252e823d8dd08255eeeeca71bc7f6" ]
[ "Chronomorphic Substrate Selection Theory.tex" ]
[ "44506ccc1342075918e1c83b9c30287c3e522f33ed0cd69fbc6c6d672cdeed61" ]
exact_normalized_title
valid
[]
10.5281/zenodo.20694904
10.5281/zenodo.20694904
Asymmetric Coexistence Theory: Governance-Aware Certification of Non-Capturing Assistance
[ "K. Takahashi" ]
2026-06-15T00:00:00+09:00
"Asymmetric Coexistence Theory (ACT) is a governance-aware theory for certifying non-capturing assis(...TRUNCATED)
["non-capturing assistance","AI governance","human-AI interaction","autonomy preservation","agency v(...TRUNCATED)
en
Preprint
https://doi.org/10.5281/zenodo.20694904
https://kadubon.github.io/github.io/works.html#2026-06-15-asymmetric-coexistence-theory-governance-aware-certification-of-non-capturing-assistance-20694904
"\\documentclass[11pt]{article}\n\n\\usepackage[utf8]{inputenc}\n\\usepackage[T1]{fontenc}\n\\usepac(...TRUNCATED)
raw/Asymmetric Coexistence Theory.zip
22c59762a2ecdcf4a12fa49efa979010d1d3d497a386959d54c25d8a9bd75d27
Asymmetric Coexistence Theory.tex
1dbdbe98877337246acef326d30d5925a260ff8ae526db264ce52af062881301
[ "raw/Asymmetric Coexistence Theory.zip" ]
[ "22c59762a2ecdcf4a12fa49efa979010d1d3d497a386959d54c25d8a9bd75d27" ]
[ "Asymmetric Coexistence Theory.tex" ]
[ "1dbdbe98877337246acef326d30d5925a260ff8ae526db264ce52af062881301" ]
exact_normalized_title
valid
[]
10.5281/zenodo.20703439
10.5281/zenodo.20703439
A Self-Relative Constraint Theory of Reality Contact in Observable Signal Processes
[ "K. Takahashi" ]
2026-06-15T00:00:00+09:00
"This paper introduces Reality-Contact Theory (RCT), a formal framework for evaluating how observabl(...TRUNCATED)
["Reality-Contact Theory","grounding","observable signal processes","constraint events","AI evaluati(...TRUNCATED)
en
Preprint
https://doi.org/10.5281/zenodo.20703439
https://kadubon.github.io/github.io/works.html#2026-06-15-a-self-relative-constraint-theory-of-reality-contact-in-observable-signal-processes-20703439
"\\pdfminorversion=5\n\\pdfobjcompresslevel=0\n\\documentclass[11pt]{article}\n\n\\usepackage[a4pape(...TRUNCATED)
raw/A Self-Relative Constraint Theory of Reality Contact in Observable Signal Processes.zip
9967143ee8f3d31585223772967fa7a0e0b758a864be916b43a2d314beff9435
A Self-Relative Constraint Theory of Reality Contact in Observable Signal Processes.tex
3634045c8b8733963640e54b707179a97bf0c7f732cb4e14d77bc16f18daa35c
[ "raw/A Self-Relative Constraint Theory of Reality Contact in Observable Signal Processes.zip" ]
[ "9967143ee8f3d31585223772967fa7a0e0b758a864be916b43a2d314beff9435" ]
[ "A Self-Relative Constraint Theory of Reality Contact in Observable Signal Processes.tex" ]
[ "3634045c8b8733963640e54b707179a97bf0c7f732cb4e14d77bc16f18daa35c" ]
exact_normalized_title
valid
[]
End of preview. Expand in Data Studio

K. Takahashi Paper TeX Corpus

This dataset publishes K. Takahashi's TeX research corpus in four complementary views: canonical DOI records, uncatalogued archive records, section-aware retrieval chunks, and an inventory of the original source ZIPs. The unmodified ZIP files are available under raw/, while all viewer-facing data is provided directly as Parquet.

What this dataset is for

The purpose of this dataset is to make a collection of scholarly TeX sources usable as a searchable, citable, and auditable research corpus. A directory of ZIP files preserves the manuscripts, but it is difficult to search across papers, connect a passage to its DOI, or determine which file and version produced a result. This dataset adds those missing layers without replacing the original sources:

  • a bibliographic layer links each catalogued work to its DOI, title, abstract, publication date, keywords, and canonical URL;
  • a source layer preserves the full TeX text and byte-identical source ZIP so that a result can be inspected in its original context;
  • a retrieval layer supplies section-aware chunks that retain TeX mathematics and avoid splitting structural environments where possible; and
  • a provenance layer records checksums, archive members, mappings, duplicate relationships, and quality flags so that downstream results can be traced and rebuilt.

The intended outcome is not merely easier downloading. It is a reproducible path from finding a relevant passage, to identifying the paper and DOI, to checking the underlying TeX source and archive. This is useful when answers, search results, or corpus statistics need evidence that can be followed back to a specific scholarly document.

Research content overview

The papers form a connected, theory-oriented research program on how autonomous and self-modifying intelligent systems can remain viable, interpretable, governable, and physically grounded when no infallible external evaluator is available. The corpus asks how claims about intelligence, safety, autonomy, value, persistence, or improvement can be stated in operational terms and checked using finite observations, explicit assumptions, resource constraints, and reproducible evidence.

Major, overlapping research strands include:

  • Self-organizing and self-improving intelligence. Early and continuing papers study computational autopoiesis, active inference, collective adaptive intelligence, teleogenesis, and architectures that can revise their own models or organization while preserving specified viability or value constraints.
  • Observable-only and "no-meta" assurance. A large part of the corpus examines agents that cannot rely on a trusted meta-judge. It develops audit gates, proof- or evidence-carrying claims, typed contracts, replayable records, provenance rules, fail-closed controls, and institutional mechanisms for deciding what can be supported from observable data.
  • Persistence, semantics, observation, and memory. Papers analyze how identity, meaning, values, and predictive organization behave under coarse-graining, self-modification, finite context, partial logging, ontology drift, and non-Markovian memory. Related work studies semantic phase transitions and limits on stable representation.
  • Physical and thermodynamic constraints. The research treats computation and agency as processes embedded in open physical systems. Topics include free-energy and entropy-production principles, exergy and resource accounting, energy-memory-compute trade-offs, stochastic thermodynamics, and physically explicit boundaries and ledgers.
  • Mathematical structures for comparison and dynamics. The corpus uses category theory, information geometry, optimal transport and Hellinger--Kantorovich/Bures geometry, gradient flows, dynamical systems, control theory, information theory, and causal inference to compare models and describe change across scales.
  • AI systems, scaling, and multi-agent operation. Applied theoretical papers address LLM routing, inference reuse, memory telemetry, long-running agents, training bottlenecks, silent data corruption, compute and I/O limits, multi-agent coordination, and the conditions under which distributed inference or verification is beneficial.
  • Governance, welfare, and human--AI coexistence. Other papers connect the technical framework to rights, consent, non-coercive assistance, public claim certification, institutional accountability, work and welfare, benevolent propagation, and human--AI or organizational systems.

Across the collection, the emphasis shifts from broad architectures and axiomatic proposals for self-organizing intelligence toward increasingly operational frameworks based on measurable interfaces, causal identification, uncertainty sets, runtime monitoring, physical accounting, and machine-checkable certificates. This is a thematic guide, not a claim that every paper uses all of these concepts or that the proposed theories have been empirically validated. The authoritative description of each work is its catalog title, abstract, keywords, and linked DOI record.

Dataset snapshot

Item Count
Canonical scholarly records (papers) 227
Uncatalogued or unresolved records (archive_only) 4
Retrieval chunks (chunks) 6931
Original ZIP archives (archives) 250
TeX entries inside ZIPs 251
Non-TeX auxiliary entries 4
Invalid primary TeX sources 1
Exact duplicate primary TeX archives 1

Source snapshot:

  • TeX archive commit: f3e594ba21031e904c63f3821d8a1c07c1c22b49
  • Research catalog state: 2026-07-24
  • Dataset release: v1.0.0

Which config should I start with?

All configs have one train split representing the complete corpus; train does not mean that the records have been assigned to a machine-learning training partition.

If you want to... Start with What one row represents
browse papers, join metadata by DOI, or retrieve a complete manuscript papers one canonical catalog record
build search, RAG, ranking, or embedding experiments chunks one section-aware TeX/text fragment
verify files, hashes, members, mappings, or preservation state archives one original ZIP archive
include older, supplementary, derivative, or unresolved sources archive_only one non-catalogued source record

For most document-level analysis, begin with papers. For retrieval systems, begin with chunks and use its paper/document identifier and DOI fields to join back to papers. Use archives when exact source provenance matters. Add archive_only only when coverage beyond the current publication catalog is required.

Configs

papers (default)

One row per canonical scholarly DOI in the machine-readable publication catalog. Catalog metadata is authoritative. Source fields are empty when no TeX source can be established without guessing. A DOI can point to multiple component source manuscripts; the primary source is kept in the singular fields and every source is listed in the source_* arrays.

archive_only

ZIPs that are not safely attributable to a current catalog DOI. These include older versions, supplements, derivative manuscripts, and unresolved title candidates. No DOI is inferred for these rows.

chunks

Deterministic, section-aware chunks built from unique valid primary TeX sources. Chunking targets about 4,000 characters, allows up to 6,000 characters, and reuses up to 400 characters of complete trailing blocks. The pipeline does not split equation, theorem, proof, or verbatim environments. char_start and char_end refer to the comment-stripped document body. Both the original TeX fragment and a conservative readable projection are included.

archives

One row per original ZIP. It records SHA-256 checksums, member metadata, DOI mappings, duplicate relationships, and quality flags. The raw/*.zip files are byte-for-byte copies of the source backup.

Quick use

from datasets import load_dataset

papers = load_dataset("kadubon/paper-tex-corpus", "papers", split="train")
chunks = load_dataset("kadubon/paper-tex-corpus", "chunks", split="train")

print(papers[0]["title"], papers[0]["doi"])
print(chunks[0]["section_title"], chunks[0]["chunk_text"][:500])

DuckDB can query the Parquet files directly:

SELECT doi, title, mapping_status
FROM read_parquet(
  'https://huggingface.co/datasets/kadubon/paper-tex-corpus/resolve/main/data/papers/train-00000-of-00001.parquet'
)
LIMIT 10;

Provenance and mapping

Bibliographic metadata comes from the publication index and its research-catalog.json. Mappings use, in order, explicit evidence recorded in config/manual_mappings.json, a unique DOI in the manuscript front matter, exact normalized titles, or a strong unique title match. Similarity-only candidates below the acceptance threshold remain ambiguous or archive_only. The complete decision record is metadata/catalog-crosswalk.csv.

metadata/source-state.json, build-report.json, and checksums.sha256 make the release auditable. scripts/build_dataset.py regenerates all Parquet files and raw copies; scripts/validate_dataset.py performs structural, checksum, security-pattern, cross-config, PyArrow, DuckDB, and optional 🤗 Datasets checks. CITATION.cff provides machine-readable corpus citation metadata.

Practical use cases

Citation-grounded search and RAG

Index chunk_text for readable retrieval or chunk_tex when exact TeX syntax matters. After retrieval, carry the DOI, paper/document identifier, section path, and position into the application response. A user or evaluator can then open the corresponding papers row, inspect the complete tex_source, and follow canonical_url to the publication. This structure supports citation-grounded systems, but the dataset does not itself verify that a generated answer is entailed by a retrieved chunk.

Math- and TeX-aware retrieval research

The corpus retains equations in TeX instead of replacing them with MathML or a normalized formula language. It can therefore support experiments on tokenization, lexical and semantic retrieval, reranking, chunking, or representation learning for documents in which mathematical notation and document structure are important. Results may depend on author-specific macros and conservative TeX-to-text conversion, so comparisons should report the fields and preprocessing used.

Corpus analysis and reproducible preprocessing

The papers view supports document-level analyses using publication metadata and complete source text. The chunks view supports passage-level analyses while preserving section context. Because source and generated artifacts have SHA-256 identifiers and the build scripts are included, researchers can describe an input snapshot precisely and compare alternative extraction, parsing, deduplication, or chunking pipelines.

Archival and provenance work

The archives config and raw/ directory can be used to check whether a derived record matches an original package, inspect auxiliary files, study source-package composition, or reconstruct the corpus. Invalid, duplicated, multi-manuscript, ambiguous, and catalogue-external cases are represented explicitly rather than removed, which allows users to define and report their own inclusion policy.

Training and tool development

Under CC BY 4.0 attribution, the corpus can be used as input for model pretraining, fine-tuning, parser development, LaTeX tooling, or other preprocessing research. Users should create their own task-specific splits and evaluation criteria, prevent unintended train/test overlap caused by related or duplicate manuscripts, and retain paper-level attribution where outputs expose source content.

What this dataset does not provide

  • It is not an evaluation benchmark, answer key, or set of verified ground-truth answers.
  • It does not certify the scientific correctness, novelty, or current validity of a paper.
  • It does not include embeddings, a vector database, a retrieval service, or a trained model.
  • It does not normalize equations or convert them to MathML.
  • It does not guarantee that general-purpose TeX parsers can expand every author macro.
  • It does not define a train/validation/test split; each config's train split is the complete released view.

Limitations

  • Inclusion does not certify the scientific correctness of a manuscript.
  • TeX-to-text conversion is conservative and may retain formatting commands.
  • No MathML conversion or equation normalization is included in v1.
  • A small number of source packages are invalid, duplicated, multi-manuscript, or not attributable to a current DOI; these states are explicit rather than silently repaired.
  • Public author contact information and ORCID values present in the source are retained.
  • The corpus records source provenance, not whether any particular writing tool or assistance process was used.

License and citation

The dataset and included source materials are released under CC BY 4.0. Attribute K. Takahashi, cite this dataset, and cite each paper's DOI when using individual works.

Suggested BibTeX:

@dataset{takahashi_paper_tex_corpus_2026,
  author    = {Takahashi, K.},
  title     = {K. Takahashi Paper TeX Corpus},
  year      = {2026},
  version   = {1.0.0},
  publisher = {Hugging Face},
  url       = {https://huggingface.co/datasets/kadubon/paper-tex-corpus}
}

Canonical publication records and paper-specific citation links are available at https://kadubon.github.io/github.io/works.html.

Downloads last month
56