Citation notice #5004 · 2026-07-11 03:19:08.722131+00:00

Learning-Augmented Approximation for Unrelated-Machines Makespan Scheduling

Correction Crossref Open

cites SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python, which carries a correction notice dated 2020-03-04. One-hop deterministic notice: the citation edge exists in the Pith bibliography graph; no model judged whether the citation was load-bearing.

This is not a judgment on the citing paper.

Citing paper Event page Original DOI Notice DOI File a formal challenge All reference changes

01Evidence

Raw extraction · bibliography line · bibliography index 15

doi: 10.1038/s41592-019-0686-2. Wei, A. Better and simpler learning-augmented online caching. InApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), volume 176 ofLeibniz International Proceedings in Informatics (LIPIcs), pp. 60:1–60:17. Schloss Dagstuhl – Leibniz-Zentrum für Informatik,

Parser render (TeX stripped for reading; raw above is the evidence)

doi: 10.1038/s41592-019-0686-2. Wei, A. Better and simpler learning-augmented online caching. InApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), volume 176 ofLeibniz International Proceedings in Informatics (LIPIcs), pp. 60:1–60:17. Schloss Dagstuhl – Leibniz-Zentrum für Informatik

02Event

Type: Correction
Source: Crossref
Original DOI: 10.1038/s41592-019-0686-2
Notice DOI: 10.1038/s41592-020-0772-5
Date: 2020-03-04
Title: Author Correction: SciPy 1.0: fundamental algorithms for scientific computing in Python
Reasons: ['Correction']
Work: SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python (2020) Nature Methods

Schema constants (for re-runners): correction · crossref

03Dispute this notice

If this citation does not depend on the flagged claim, or the event is wrong, say so. Disputes are public. For a signed challenge against the paper itself, use the formal challenge form.