Pith. Sign in

RECORD

Confirmable Workflows in OSCAR

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Michael Joswig, Lars Kastner, Benjamin Lorenz

Mathematical Software · Submitted 9 Apr 2024

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim It is emphasized how the programming language Julia and the new computer algebra system OSCAR support such a reproducibility, and how users can benefit for their own work.

how it is stated · asserted 0.99 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2404.06241 (version 1)
Pith ID3QOW2HZJ, Pith's permanent record of this paper and its review
CitationBenjamin Lorenz, Lars Kastner, Michael Joswig. "Confirmable Workflows in OSCAR." arXiv:2404.06241 (2024). https://pith.science/paper/3QOW2HZJ
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 2,238 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.05 · human participants 0.03 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.02 · compares with prior results 0.06 · mentions code or data availability 0.05.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

We discuss what is special about the reproducibility of workflows in computer algebra. It is emphasized how the programming language Julia and the new computer algebra system OSCAR support such a reproducibility, and how users can benefit for their own work.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We discuss what is special about the reproducibility of workflows in computer algebra. contribution 0.57 0.29 0.11 unclear 0.57
s1 It is emphasized how the programming language Julia and the new computer algebra system OSCAR support such a reproducibility, and how users can benefit for their own work. contribution 0.73 0.16 0.32 asserted 0.99

What kind of paper the classifier reports this is: position or commentary 0.85 · evidence from argument 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We discuss what is special about the reproducibility of workflows in computer algebra. It is emphasized how the programming language Julia and the new computer algebra system OSCAR support such a reproducibility, and how users can benefit for their own work.

Human review

How Pith checks papers → · Full audit of this paper →

References
How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites · 3 sentences without a confident label

Uses the method or tool of 1 paper

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.