ReasoningSFT
Collection
Great datasets for finetuning on reasoning traces. • 2 items • Updated • 1
conversations listlengths 2 2 | input stringlengths 158 466 | output stringlengths 68.8k 270k |
|---|---|---|
[{"from":"human","value":"Given a finite simple graph with prescribed degree sequence, determine nec(...TRUNCATED) | "Given a finite simple graph with prescribed degree sequence, determine necessary and sufficient spe(...TRUNCATED) | "<think>\nWe need to determine necessary and sufficient spectral conditions on the adjacency matrix (...TRUNCATED) |
[{"from":"human","value":"Consider a planar point set of n points in general position; devise an O(n(...TRUNCATED) | "Consider a planar point set of n points in general position; devise an O(n log n) algorithm to comp(...TRUNCATED) | "<think>\nWe need to design an O(n log n) algorithm to count the number of distinct empty convex qua(...TRUNCATED) |
[{"from":"human","value":"Let G be a finitely generated group acting properly discontinuously by iso(...TRUNCATED) | "Let G be a finitely generated group acting properly discontinuously by isometries on a CAT(0) cube (...TRUNCATED) | "<think>\nWe need to address the problem: \"Let G be a finitely generated group acting properly disc(...TRUNCATED) |
[{"from":"human","value":"Given a prime p≡1 (mod 4), construct a non‑abelian group of order p^3 (...TRUNCATED) | "Given a prime p≡1 (mod 4), construct a non‑abelian group of order p^3 whose irreducible complex(...TRUNCATED) | "<think>\nWe are asked: \"Given a prime p≡1 (mod 4), construct a non‑abelian group of order p^3 (...TRUNCATED) |
[{"from":"human","value":"Let \\(X\\) be a separable Banach space and \\(T:X\\to X\\) a compact oper(...TRUNCATED) | "Let \\(X\\) be a separable Banach space and \\(T:X\\to X\\) a compact operator whose spectrum accum(...TRUNCATED) | "<think>\nWe are asked: \"Let X be a separable Banach space and T:X→X a compact operator whose spe(...TRUNCATED) |
[{"from":"human","value":"Let \\(G\\) be a finitely generated group acting properly discontinuously (...TRUNCATED) | "Let \\(G\\) be a finitely generated group acting properly discontinuously by isometries on a CAT(0)(...TRUNCATED) | "<think>\nWe need to show: \"Let G be a finitely generated group acting properly discontinuously by (...TRUNCATED) |
[{"from":"human","value":"Consider a smooth vector field on the two‑torus whose flow has a single (...TRUNCATED) | "Consider a smooth vector field on the two‑torus whose flow has a single attracting periodic orbit(...TRUNCATED) | "<think>\nWe are given: \"Consider a smooth vector field on the two‑torus whose flow has a single (...TRUNCATED) |
[{"from":"human","value":"Consider a finitely generated group acting properly discontinuously by iso(...TRUNCATED) | "Consider a finitely generated group acting properly discontinuously by isometries on a CAT(0) space(...TRUNCATED) | "<think>\nWe need to prove that for a finitely generated group G acting properly discontinuously by (...TRUNCATED) |
[{"from":"human","value":"In a locally presentable ∞‑category, construct a left exact localizati(...TRUNCATED) | "In a locally presentable ∞‑category, construct a left exact localization whose reflective subca(...TRUNCATED) | "<think>\nWe need to address the user's question: \"In a locally presentable ∞‑category, constru(...TRUNCATED) |
[{"from":"human","value":"Given a set of n points in ℝ³ with pairwise distances rational, devise (...TRUNCATED) | "Given a set of n points in ℝ³ with pairwise distances rational, devise an O(n log n) algorithm t(...TRUNCATED) | "<think>\nWe are asked: \"Given a set of n points in ℝ³ with pairwise distances rational, devise (...TRUNCATED) |
End of preview. Expand in Data Studio
- Downloads last month
- 47