Datasets:

MBZUAI-LLM
/

SlimPajama-627B-DC

text stringlengths 216 4.52M	meta dict
\section{Introduction} \noindent The vertical dynamics of a free falling ball on a moving racket is considered. The racket is supposed to move periodically in the vertical direction according to a regular periodic function $f(t)$ and the ball is reflected according to the law of elastic bouncing when hitting the racket...	{ "redpajama_set_name": "RedPajamaArXiv" }
\subsection{Deligne's category $\mathop{\underline{\smash{\mathrm{Rep}}}}(GL_t)$} From the perspective of the Killing-Cartan-Weyl classification of simple Lie algebras and their representation theory in terms of highest weights, root systems, Weyl groups and associated combinatorics it is not so easy to understand th...	{ "redpajama_set_name": "RedPajamaArXiv" }
\section{Introduction} \label{sec:intro} Mobile ad-hoc networking has presented many challenges to the research community, especially in designing suitable, efficient, and well performing protocols. The practical analysis and validation of such protocols often depends on synthetic data, generated by some mobility model...	{ "redpajama_set_name": "RedPajamaArXiv" }
\section{Introduction} \label{SecIntro} Let $\mathcal{G}=(V,E)$ be a connected undirected graph, with $V$ at most countable and each vertex $x\in V$ of finite degree. We do not allow self-loops, however the edges might be multiple. Given $e\in E$ an edge, we will denote $e_{+}$ and $e_{-}$ its end-vertices, even though...	{ "redpajama_set_name": "RedPajamaArXiv" }
"\\section{Introduction} \\label{farey_intro}\n\nIn \\cite{Weyl1} Hermann Weyl developed a general a(...TRUNCATED)	{ "redpajama_set_name": "RedPajamaArXiv" }
"\\section{Introduction}\n\\label{sec:intro}\n\nThe design of efficient flow control strategies for (...TRUNCATED)	{ "redpajama_set_name": "RedPajamaArXiv" }
"\\section{Introduction}\n\nLet $R$ be a finite ring equipped with a weight $w$. Two linear codes\n(...TRUNCATED)	{ "redpajama_set_name": "RedPajamaArXiv" }
"\\section{Introduction}\nAll graphs considered in this paper are finite and simple\n(undirected, lo(...TRUNCATED)	{ "redpajama_set_name": "RedPajamaArXiv" }
"\\section{Introduction}\nIn this paper, we study the cyclicity problem with respect to the forward (...TRUNCATED)	{ "redpajama_set_name": "RedPajamaArXiv" }
"\\section{Introduction} \n\\label{Introduction}\nDetecting communities (or clusters) in graphs is a(...TRUNCATED)	{ "redpajama_set_name": "RedPajamaArXiv" }

End of preview. Expand in Data Studio

Dataset Description:

This is a split version of cerebras/SlimPajama-627B that divides data based on its sources. The content of this dataset is the same as SlimPajama-627B. We divide data from different sources based on the "redpajama_setname" and save them in different directories, which is convenient for future dataset combination related research.

This dataset consists of 15,967 jsonl files and is ~ 883G compressed.