Datasets:
prompt string | language string | source string | aspect_ratio string | page_low int64 | page_high int64 | attachments list | extra_info dict |
|---|---|---|---|---|---|---|---|
Create a comprehensive lecture deck on Operating System Process Scheduling for an undergraduate CS course. Cover process and thread fundamentals, process state transitions, scheduling algorithms (FCFS, SJF, Round Robin, priority scheduling, multilevel feedback queues) with comparative analysis, and real-world schedulin... | en | lecture | 16:9 | 45 | 55 | [] | {
"arxiv_id": null,
"tags": [
"long_document",
"code"
],
"scenario": "undergraduate operating systems course lecture on process scheduling",
"audience": "computer science undergraduates"
} |
Design a comprehensive 50-slide lecture deck on Bayesian Inference for a graduate-level statistics course. Cover prior and posterior distributions, conjugate priors, Bayes' theorem derivations, MCMC methods (Metropolis-Hastings, Gibbs sampling), variational inference basics, and real-world applications. Include detaile... | en | lecture | 16:9 | 45 | 55 | [] | {
"arxiv_id": null,
"tags": [
"long_document",
"math",
"visualization"
],
"scenario": "graduate-level statistics course on Bayesian inference",
"audience": "graduate students in statistics or machine learning"
} |
请为研究生凸优化课程制作一套完整的教学幻灯片,内容包括:凸集与凸函数的定义与性质、对偶理论(拉格朗日对偶、KKT条件)、梯度下降法、次梯度方法、近端梯度法、内点法等优化算法的数学推导与伪代码描述,以及收敛性分析图表。要求至少55页,数学推导严谨,配合算法流程图和收敛曲线可视化。 | zh | lecture | 16:9 | 50 | 60 | [] | {
"arxiv_id": null,
"tags": [
"long_document",
"math",
"pseudocode",
"visualization"
],
"scenario": "graduate convex optimization course covering theory and algorithms",
"audience": "graduate students in optimization or applied mathematics"
} |
Create a full-length lecture series on Linear Algebra for an undergraduate engineering course. The slides should cover vector spaces, linear transformations, eigenvalues and eigenvectors, SVD decomposition, matrix factorizations (LU, QR, Cholesky), least squares, and applications in data science. Include step-by-step m... | en | lecture | 16:9 | 45 | 55 | [] | {
"arxiv_id": null,
"tags": [
"long_document",
"math",
"visualization"
],
"scenario": "undergraduate linear algebra course for engineering students",
"audience": "engineering undergraduates"
} |
Design a full lecture series on Information Theory for a graduate course. Cover entropy, mutual information, KL divergence with mathematical definitions and property derivations, channel capacity and Shannon's coding theorem, rate-distortion theory fundamentals, and information-theoretic applications in machine learnin... | en | lecture | 16:9 | 42 | 50 | [] | {
"arxiv_id": null,
"tags": [
"long_document",
"math",
"visualization"
],
"scenario": "graduate information theory course lecture series",
"audience": "graduate students in electrical engineering or computer science"
} |
Prepare a comprehensive lecture deck on Database Systems for an undergraduate course. Cover relational algebra, SQL query optimization, B-tree and hash indexing, transaction management (ACID properties, concurrency control, 2PL, MVCC), query execution plans, and distributed database architectures. Include SQL code exam... | en | lecture | 16:9 | 40 | 50 | [] | {
"arxiv_id": null,
"tags": [
"long_document",
"code",
"visualization"
],
"scenario": "undergraduate database systems course with SQL examples",
"audience": "computer science undergraduates"
} |
制作一套算法设计与分析的课程幻灯片,内容包括:分治法(归并排序、快速选择)、动态规划(最优子结构、状态转移方程)、贪心算法(活动选择、Huffman编码)、图算法(Dijkstra、Bellman-Ford、Floyd-Warshall)、NP完全性理论。每个算法需要给出数学复杂度分析、伪代码以及运行过程的可视化示意图。至少50页。 | zh | lecture | 16:9 | 48 | 55 | [] | {
"arxiv_id": null,
"tags": [
"long_document",
"math",
"pseudocode",
"visualization"
],
"scenario": "undergraduate algorithm design and analysis survey course",
"audience": "computer science undergraduates"
} |
Create a detailed lecture on Compiler Principles covering lexical analysis (finite automata, regular expressions), syntax analysis (LL and LR parsing), semantic analysis, intermediate code generation (three-address code, SSA form), and code optimization techniques. Include implementation code snippets in C/Python and p... | en | lecture | 16:9 | 42 | 50 | [] | {
"arxiv_id": null,
"tags": [
"long_document",
"code",
"pseudocode"
],
"scenario": "undergraduate compiler construction course lecture",
"audience": "senior CS undergraduates"
} |
Prepare a comprehensive lecture deck on Distributed Systems for a graduate course. Cover distributed system models (synchronous/asynchronous, failure models), consensus protocols (Paxos, Raft implementation details), distributed transactions (2PC, 3PC), CAP theorem and BASE theory, distributed storage architectures (GF... | en | lecture | 16:9 | 40 | 48 | [] | {
"arxiv_id": null,
"tags": [
"long_document",
"code",
"visualization"
],
"scenario": "graduate distributed systems course covering consensus and storage",
"audience": "graduate students in distributed computing"
} |
Design an extensive 55-slide lecture deck on Machine Learning Foundations for a graduate course. Cover supervised learning (linear regression, logistic regression, SVMs with kernel trick), unsupervised learning (k-means, PCA, GMM with EM algorithm), neural network fundamentals (backpropagation derivation, optimization ... | en | lecture | 16:9 | 50 | 60 | [] | {
"arxiv_id": null,
"tags": [
"long_document",
"math",
"pseudocode",
"visualization"
],
"scenario": "graduate machine learning foundations course",
"audience": "graduate students in CS or statistics"
} |
Create a lecture deck on Numerical Analysis / Numerical Methods for an undergraduate course. Cover floating-point arithmetic and error analysis, nonlinear equation solvers (bisection, Newton's method, secant method), iterative methods for linear systems (Jacobi, Gauss-Seidel, SOR), polynomial and spline interpolation, ... | en | lecture | 16:9 | 42 | 50 | [] | {
"arxiv_id": null,
"tags": [
"long_document",
"math",
"pseudocode"
],
"scenario": "undergraduate numerical methods course with algorithm derivations",
"audience": "mathematics or engineering undergraduates"
} |
Prepare a full lecture deck on Data Structures for a CS undergraduate course. Cover arrays, linked lists, stacks, queues, hash tables (open addressing, chaining, load factor analysis), binary search trees, AVL trees, red-black trees, B-trees, heaps, and graphs (adjacency list/matrix representations). Include C++ or Jav... | en | lecture | 16:9 | 40 | 48 | [] | {
"arxiv_id": null,
"tags": [
"long_document",
"code",
"pseudocode"
],
"scenario": "undergraduate data structures course with implementations",
"audience": "CS undergraduates in their second year"
} |
制作一套概率论与数理统计的完整课程讲义,涵盖概率空间公理化定义、条件概率与贝叶斯公式、常见离散和连续分布及其性质、大数定律与中心极限定理的证明思路、参数估计(极大似然、矩估计)、假设检验(z/t/卡方检验)以及回归分析基础。需要完整的数学推导和分布图形可视化,至少50页。 | zh | lecture | 16:9 | 48 | 55 | [] | {
"arxiv_id": null,
"tags": [
"long_document",
"math",
"visualization"
],
"scenario": "undergraduate probability and mathematical statistics course",
"audience": "mathematics or engineering undergraduates"
} |
Create a comprehensive lecture on Digital Signal Processing for an electrical engineering course. Cover discrete-time signals and systems, Z-transform and its properties, DFT and FFT algorithms, FIR and IIR filter design (windowing methods, bilinear transform), spectral analysis, and multirate signal processing. Includ... | en | lecture | 16:9 | 42 | 50 | [] | {
"arxiv_id": null,
"tags": [
"long_document",
"math",
"visualization"
],
"scenario": "undergraduate digital signal processing course lecture",
"audience": "electrical engineering undergraduates"
} |
Create a lecture deck on Graph Theory for an undergraduate course. Cover fundamental graph concepts and representations, Eulerian and Hamiltonian paths, trees and spanning trees (Kruskal's, Prim's algorithms), shortest path algorithms, network flow (Ford-Fulkerson, max-flow min-cut theorem), graph coloring and planar g... | en | lecture | 16:9 | 40 | 48 | [] | {
"arxiv_id": null,
"tags": [
"long_document",
"math",
"pseudocode"
],
"scenario": "undergraduate graph theory course with algorithm proofs",
"audience": "mathematics or CS undergraduates"
} |
Prepare a detailed lecture on Computer Networks for an undergraduate course. Cover the OSI and TCP/IP models, Ethernet and Wi-Fi protocols, IP addressing and subnetting, TCP congestion control algorithms (Tahoe, Reno, CUBIC), DNS and HTTP protocol details, socket programming examples in Python, network security basics ... | en | lecture | 16:9 | 35 | 42 | [] | {
"arxiv_id": null,
"tags": [
"code",
"visualization"
],
"scenario": "undergraduate computer networks course with protocol analysis",
"audience": "CS undergraduates"
} |
Please present the attached paper 'Attention Is All You Need' as a graduate seminar talk. Explain the Transformer architecture in detail: the scaled dot-product attention mechanism, multi-head attention, positional encoding, and the encoder-decoder structure. Include architecture diagrams and performance comparison cha... | en | arXiv | 16:9 | 18 | 22 | [
"data/arxiv/1706.03762.pdf"
] | {
"arxiv_id": "1706.03762",
"tags": [
"math",
"visualization"
],
"scenario": "graduate seminar presentation on the Transformer architecture",
"audience": "ML researchers and graduate students"
} |
Present the attached VAE paper for a lab meeting. Explain the variational inference mathematical framework, the ELBO derivation, the reparameterization trick, and provide visual analysis of the experimental results. About 15 slides, suitable for an audience with basic machine learning knowledge. Keep it plain, no need ... | en | arXiv | 16:9 | 13 | 18 | [
"data/arxiv/1312.6114.pdf"
] | {
"arxiv_id": "1312.6114",
"tags": [
"math",
"visualization"
],
"scenario": "research group meeting presentation on Variational Autoencoders",
"audience": "ML graduate students with foundational knowledge"
} |
Present the GAN paper by Goodfellow et al. for an academic reading group. Cover the minimax game formulation, the theoretical analysis (proof of global optimality of p_g = p_data), the training algorithm pseudocode, and experimental results on MNIST/CIFAR-10 with generated sample comparisons. About 18 slides, suitable ... | en | arXiv | 16:9 | 16 | 20 | [
"data/arxiv/1406.2661.pdf"
] | {
"arxiv_id": "1406.2661",
"tags": [
"math",
"visualization"
],
"scenario": "academic reading group presentation on Generative Adversarial Networks",
"audience": "ML researchers"
} |
请把这篇PPO论文做成课程讲义形式的slides,要详细讲解策略梯度方法的基础、trust region方法的动机、PPO的clipped surrogate objective的数学推导、算法伪代码流程,以及论文中在Atari和MuJoCo上的实验对比图表。风格朴素一点就行,约20页。 | zh | arXiv | 16:9 | 18 | 22 | [
"data/arxiv/1707.06347.pdf"
] | {
"arxiv_id": "1707.06347",
"tags": [
"math",
"pseudocode",
"visualization"
],
"scenario": "reinforcement learning course lecture based on the PPO paper",
"audience": "graduate students studying reinforcement learning"
} |
Create a presentation on the Vision Transformer (ViT) paper for a computer vision reading group. Explain how images are split into patches and treated as token sequences, the self-attention mechanism applied to vision, the comparison with CNN-based approaches (ResNets), and the scaling behavior shown in the experiments... | en | arXiv | 16:9 | 13 | 18 | [
"data/arxiv/2010.11929.pdf"
] | {
"arxiv_id": "2010.11929",
"tags": [
"math",
"visualization"
],
"scenario": "computer vision reading group talk on Vision Transformer",
"audience": "CV researchers and graduate students"
} |
Present the attached GCN paper as an academic seminar talk. Cover the spectral graph theory background, the mathematical derivation of graph convolution operations (simplification from spectral to spatial domain), the layer-wise propagation formula, and experimental results on citation network classification tasks with... | en | arXiv | 16:9 | 15 | 20 | [
"data/arxiv/1609.02907.pdf"
] | {
"arxiv_id": "1609.02907",
"tags": [
"math",
"visualization"
],
"scenario": "academic seminar on Graph Convolutional Networks",
"audience": "researchers familiar with graph neural networks"
} |
Present the LoRA paper for a systems-for-ML reading group. Explain the low-rank adaptation approach, the mathematical formulation of injecting trainable rank-decomposition matrices, how it reduces trainable parameters compared to full fine-tuning, the implementation details for integrating with existing frameworks (PyT... | en | arXiv | 16:9 | 13 | 18 | [
"data/arxiv/2106.09685.pdf"
] | {
"arxiv_id": "2106.09685",
"tags": [
"math",
"code",
"visualization"
],
"scenario": "systems-for-ML reading group on parameter-efficient fine-tuning",
"audience": "ML engineers and researchers"
} |
帮我把这篇SimCLR对比学习论文做成seminar报告slides,涵盖对比学习框架、NT-Xent损失函数的数学定义、数据增强策略消融实验、projection head的作用分析,以及在ImageNet上与监督方法的性能对比图表。大约18页。 | zh | arXiv | 16:9 | 15 | 20 | [
"data/arxiv/2002.05709.pdf"
] | {
"arxiv_id": "2002.05709",
"tags": [
"math",
"visualization"
],
"scenario": "self-supervised learning seminar on contrastive learning framework",
"audience": "CV/ML graduate students"
} |
Design a 25-slide technical tutorial on Rust's Ownership System. Cover ownership rules, borrowing and references (mutable vs immutable), lifetimes and lifetime annotations, the borrow checker, smart pointers (Box, Rc, Arc, RefCell), common ownership patterns, and pitfalls to avoid. Include Rust code examples throughout... | en | code_repo | 16:9 | 22 | 28 | [] | {
"arxiv_id": null,
"tags": [
"code",
"visualization"
],
"scenario": "Rust programming workshop on ownership and memory safety",
"audience": "intermediate programmers learning Rust"
} |
Create a technical talk on PyTorch's Automatic Differentiation mechanism. Cover computational graph construction principles, backpropagation mathematical derivation (chain rule in practice), core torch.autograd API usage (grad_fn, backward(), torch.no_grad()), implementing custom autograd Functions, and code examples f... | en | code_repo | 16:9 | 18 | 22 | [] | {
"arxiv_id": null,
"tags": [
"math",
"code"
],
"scenario": "internal tech talk on PyTorch autograd internals",
"audience": "ML engineers and researchers using PyTorch"
} |
Create a presentation comparing major sorting algorithms: Bubble Sort, Insertion Sort, Merge Sort, Quick Sort, Heap Sort, Counting Sort, and Radix Sort. For each algorithm, provide the pseudocode, time and space complexity analysis (best/average/worst case with mathematical proofs for key results), and comparative perf... | en | lecture | 16:9 | 22 | 28 | [] | {
"arxiv_id": null,
"tags": [
"pseudocode",
"visualization"
],
"scenario": "algorithms course module on sorting with complexity analysis",
"audience": "CS undergraduates studying algorithms"
} |
Create a special-topic lecture on Dynamic Programming algorithms. Cover DP fundamentals (optimal substructure, overlapping subproblems), memoization vs bottom-up DP comparison, detailed walkthroughs of classic problems (knapsack, longest common subsequence, edit distance, matrix chain multiplication, optimal BST). Each... | en | lecture | 16:9 | 28 | 35 | [] | {
"arxiv_id": null,
"tags": [
"math",
"pseudocode",
"code",
"visualization"
],
"scenario": "algorithms course special topic on dynamic programming",
"audience": "CS undergraduates or interview preparation learners"
} |
Prepare a 25-slide survey presentation on Reinforcement Learning Algorithms. Cover the RL framework (MDPs, Bellman equations), value-based methods (Q-learning, SARSA with pseudocode), policy gradient methods (REINFORCE derivation), actor-critic architectures, and PPO/SAC overview. Include mathematical derivations of ke... | en | lecture | 16:9 | 22 | 28 | [] | {
"arxiv_id": null,
"tags": [
"math",
"pseudocode",
"code",
"visualization"
],
"scenario": "RL course survey covering classical and modern algorithms",
"audience": "graduate students in AI/ML"
} |
Create a technical talk on RESTful API Design Patterns. Cover REST architectural constraints, resource naming conventions, HTTP method semantics, status code best practices, authentication scheme comparison (OAuth 2.0, JWT), API versioning strategies, pagination and filtering design, error handling patterns, with code ... | en | code_repo | 16:9 | 18 | 22 | [] | {
"arxiv_id": null,
"tags": [
"code",
"visualization"
],
"scenario": "engineering team tech talk on API design best practices",
"audience": "backend software engineers"
} |
Present the DPO (Direct Preference Optimization) paper for a language model alignment reading group. Explain the motivation from RLHF limitations, the mathematical derivation showing how the reward model can be analytically solved from the optimal policy, the resulting DPO objective function, and experimental compariso... | en | arXiv | 16:9 | 13 | 18 | [
"data/arxiv/2305.18290.pdf"
] | {
"arxiv_id": "2305.18290",
"tags": [
"math",
"visualization"
],
"scenario": "LLM alignment reading group on preference optimization",
"audience": "NLP researchers working on RLHF and alignment"
} |
Present the attached Word2Vec paper as teaching slides. Cover the motivation for word embeddings, mathematical derivations of both CBOW and Skip-gram architectures, negative sampling and hierarchical softmax optimization techniques with code implementation (demonstrate the core training loop in Python/NumPy), and word ... | en | arXiv | 16:9 | 13 | 18 | [
"data/arxiv/1301.3781.pdf"
] | {
"arxiv_id": "1301.3781",
"tags": [
"math",
"code"
],
"scenario": "NLP introductory course lecture on word embeddings",
"audience": "students beginning to study NLP"
} |
SeaSlidesBench-Rich
SeaSlidesBench-Rich is a 32-task stress-test extension of SeaSlidesBench for evaluating slide generation systems on long slide decks, mathematical formulas, code, pseudocode, and visualizations. It contains 27 English tasks, 5 Chinese tasks, and 10 arXiv paper attachments. All tasks specify a 16:9 aspect ratio.
This dataset provides task inputs only; it does not include reference slides, model outputs, or evaluation scores. This release preserves the original task text, fields, tags, and ordering to support reproduction of existing experiments.
Contents
Quick Start
Install the dependencies: pip install datasets huggingface_hub.
from pathlib import Path
from datasets import load_dataset
from huggingface_hub import snapshot_download
repo_id = "OrangeX4/SeaSlidesBench-Rich"
# For reproducible experiments, replace main with a fixed dataset commit hash.
revision = "main"
dataset = load_dataset(repo_id, split="validation", revision=revision)
# load_dataset loads the task table; snapshot_download also downloads the PDFs.
root = Path(snapshot_download(repo_id, repo_type="dataset", revision=revision))
for index, sample in enumerate(dataset):
task_id = 129 + index
attachments = [root / path for path in sample["attachments"]]
assert all(path.is_file() for path in attachments)
print(task_id, sample["prompt"], attachments)
If you have already downloaded the entire directory, you can read the JSONL file directly:
import json
from pathlib import Path
root = Path("SeaSlidesBench-Rich") # Set this to your local download directory.
with (root / "data/valid.jsonl").open(encoding="utf-8") as stream:
samples = [json.loads(line) for line in stream if line.strip()]
Files and Task IDs
SeaSlidesBench-Rich/
├── README.md
├── LICENSE
├── manifest.json # File hashes, sizes, and attachment source links
└── data/
├── valid.jsonl # 32 tasks, one JSON object per line
└── arxiv/ # 10 paper PDFs
The dataset has a single validation split and no training or test splits. This name follows the existing file naming convention; it does not imply an independently established train/validation/test partition.
JSONL rows 1–32 correspond to task IDs 129–160 in the combined SeaSlidesBench evaluation: task_id = row_number (1-based) + 128. The records do not have a separate ID field, so preserve their original order. The first 128 tasks are not included here.
All attachments paths are relative to the dataset root, not to the data/ directory. File checksums are provided in manifest.json.
Fields
| Field | Type | Description |
|---|---|---|
prompt |
string | Original slide generation instruction |
language |
string | Output language: en or zh |
source |
string | Task category: lecture, arXiv, or code_repo; see the table below |
aspect_ratio |
string | Slide aspect ratio; 16:9 for all tasks |
page_low |
int | Inclusive lower bound of the original evaluation slide-count range |
page_high |
int | Inclusive upper bound of the original evaluation slide-count range |
attachments |
list[string] | Relative attachment paths; an empty list when there are no attachments |
extra_info.arxiv_id |
string or null | Paper's arXiv ID; null for non-paper tasks |
extra_info.tags |
list[string] | Original capability tags; a task can have multiple tags |
extra_info.scenario |
string | Intended presentation scenario |
extra_info.audience |
string | Intended audience |
The structured slide-count ranges do not always match the natural-language requirements in the prompts. See Known Limitations for the specific discrepancies.
Dataset Statistics
| Task category | Count | Inputs provided |
|---|---|---|
lecture |
19 | Course or teaching-topic prompts; no source lecture notes are attached |
arXiv |
10 | Paper presentation prompts with the corresponding PDFs |
code_repo |
3 | Technical-topic prompts about Rust, PyTorch, and RESTful APIs; no repository attachments, URLs, or pinned commits are provided |
source is a legacy task category, not a complete provenance record. In particular, lecture and code_repo do not mean that actual lecture notes or code repositories are included.
| Capability tag | Tasks | Percentage |
|---|---|---|
long_document (long slide decks) |
15 | 46.9% |
math (mathematical content) |
23 | 71.9% |
code (code blocks) |
13 | 40.6% |
pseudocode |
11 | 34.4% |
visualization |
25 | 78.1% |
Tags overlap: 20 tasks have at least one of the code and pseudocode tags, and each task has 2.72 tags on average. In this dataset, long_document identifies the 15 tasks with page_low >= 40; it describes the target slide-deck length, not the length of an input PDF. The original tags are preserved and may not exhaustively cover every capability mentioned in a prompt.
Paper Sources
| arXiv ID | Paper |
|---|---|
| 1301.3781 | Efficient Estimation of Word Representations in Vector Space (Word2Vec) |
| 1312.6114 | Auto-Encoding Variational Bayes (VAE) |
| 1406.2661 | Generative Adversarial Nets (GAN) |
| 1609.02907 | Semi-Supervised Classification with Graph Convolutional Networks (GCN) |
| 1706.03762 | Attention Is All You Need (Transformer) |
| 1707.06347 | Proximal Policy Optimization Algorithms (PPO) |
| 2002.05709 | A Simple Framework for Contrastive Learning of Visual Representations (SimCLR) |
| 2010.11929 | An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale (ViT) |
| 2106.09685 | LoRA: Low-Rank Adaptation of Large Language Models |
| 2305.18290 | Direct Preference Optimization: Your Language Model is Secretly a Reward Model (DPO) |
The original records do not include arXiv version numbers or download dates. Later versions on arXiv may differ from the included attachments. For reproducibility, pin the dataset commit and verify attachment hashes against manifest.json.
Known Limitations
- This is a small, English-heavy set of 32 stress-test tasks for rich-content generation. It is not representative of all real-world presentation needs.
- This release does not include the original candidate pool, selection logs, or independent annotation-agreement records. It should not be taken as evidence of unbiased sampling or independent human validation.
- The 22 tasks without attachments require systems to organize content from a topic prompt. Their information-access conditions differ from those of the paper-based tasks. When comparing systems, report whether retrieval is allowed and which external materials are used.
- Some natural-language minimum slide counts are stricter than
page_low. The original values are retained to avoid changing existing experimental conditions. When reproducing results, report compliance with the prompt requirements separately from compliance with the structured slide-count ranges.
| JSONL row | Combined evaluation task ID | Prompt requirement | Original slide-count range |
|---|---|---|---|
| 3 | 131 | At least 55 slides | 50–60 |
| 5 | 133 | At least 45 slides | 42–50 |
| 7 | 135 | At least 50 slides | 48–55 |
| 13 | 141 | At least 50 slides | 48–55 |
License
The dataset's own tasks, metadata, and documentation are released under the MIT License.
Third-party papers in data/arxiv/ are not covered by this repository's MIT license. They remain subject to the copyrights and applicable licenses of their original authors or rights holders. Consult the source links above for each paper's license information; this dataset's MIT label does not grant permission to relicense or freely redistribute those papers. See the official arXiv licensing guidance.
- Downloads last month
- 104