Pith. Sign in

RECORD

Toward Resilient Algorithms and Applications

Mathematical Software · Submitted 16 Feb 2014

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

The authors' main claim In this paper we discuss four approaches for developing new algorithms that are resilient to hard and soft failures.

how it is stated · asserted 0.83 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1402.3809 (version 2)
Pith ID23N5W66F, Pith's permanent record of this paper and its review
CitationMichael A. Heroux. "Toward Resilient Algorithms and Applications." arXiv:1402.3809 (2014). https://pith.science/paper/23N5W66F
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-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 2,231 input tokens, $0.0001 reported.

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

The abstract, sentence by sentence

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

Over the past decade, the high performance computing community has become increasingly concerned that preserving the reliable, digital machine model will become too costly or infeasible. In this paper we discuss four approaches for developing new algorithms that are resilient to hard and soft failures.

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 Over the past decade, the high performance computing community has become increasingly concerned that preserving the reliable, digital machine model will become too costly or infeasible. background 1.00 0.05 0.04 hedged possibility 0.54
s1 In this paper we discuss four approaches for developing new algorithms that are resilient to hard and soft failures. contribution 1.00 0.61 0.16 asserted 0.83

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

What was examined, and what was not

sources read
  • arXiv listing abstract v2
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

Over the past decade, the high performance computing community has become increasingly concerned that preserving the reliable, digital machine model will become too costly or infeasible. In this paper we discuss four approaches for developing new algorithms that are resilient to hard and soft failures.

Human review

Discussion

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