Reference change · event page

Ben-David, P

Published notice on a work cited in the Pith corpus. Exact quotes below. No model judges whether any citation was load-bearing.

This page records that a citing paper's bibliography includes a work with a published notice. It is not a judgment on the citing paper.

Correction Crossref 1 open · 1 total · 0 disputed

DOI: 10.1038/s42256-018-0002-3
Notice DOI: 10.1038/s42256-019-0023-6
Event date: 2019-01-23
Machine twin: JSON

01One-hop citing occurrences

Correction Open

Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning

ref [10] · 2511.02644 · notice #8317 · dispute

Raw extraction · bibliography line

S. Ben-David, P. Hrubes, S. Moran, A. Shpilka, A. Yehudayoff: Learnability can be undecidable. Nature Machine Intelligence Vol. 1, 44–48, 2019, doi:10.1038/s42256-018-0002-3 https://doi.org/10.1038/s42256-018-0002-3

Status lifecycle on notices: open → disputed → (response attached on the notice page). Repaired counts matter as much as open counts. There is no “safe,” “invalid,” or “resolved” badge.