Wikipedia's first sentence called it “israeli mathematician”. Today it says “israeli computer scientist”.
Measured, not asserted. Every count, date and revision on this page was taken from Wikipedia's own history and checked against the live article. The words quoted are theirs.
Machine-checked against the full current article on 2026-08-03.
We saved snapshots of this article over twenty years; you are reading the 2015 one. Red dashes: removed from Wikipedia since.Pale dots: rewritten; the numbered note shows what it says now.Red text: written in or rewritten since the previous snapshot.1 tap a number or a side note to jump between them
The opening as it read in 2015
Irit Dinur (Hebrew: אירית דינור) is an Israeli mathematician. She is professor of computer science at the Weizmann Institute of Science . Her research is in foundations of computer science and in combinatorics , and especially in probabilistically checkable proofs and hardness of approximation . Dinur earned her doctorate in 2002 from the school of computer science in Tel-Aviv University , advised by Shmuel Safra ; her thesis was entitled On the Hardness of Approximating the Minimum Vertex Cover and The Closest Vector in a Lattice . She joined the Weizmann Institute after visiting the Institute of Advanced Studies in Princeton, New Jersey , NEC , and the University of California, Berkeley . Dinur published in 2006 a new proof of the PCP theorem that was significantly simpler than previous proofs of the same result. In 2007, she was given the Michael Bruno Memorial Award in Computer Science by Yad Hanadiv . She was a plenary speaker at the 2010 International Congress of Mathematicians . In 2012, she won the Anna and Lajos Erdős Prize in Mathematics , given by the Israel Mathematical Union.1
This is Wikipedia's own text, saved in our repository. Their copy of it is revision 659438136.
The opening as it stood in 2010
Irit Dinur (Hebrew: אירית דינור) is an Israeli mathematician. She is currently professor of computer science at the Weizmann Institute of Science . Her research is in foundations of computer science and in combinatorics , especially probabilistically checkable proofs, hardness of approximation. She graduated from the school of computer science in Tel-Aviv University . Her advisor was Shmuel Safra . She spent a couple of years in Princeton at Institute of Advanced Studies and NEC , and a year as a Miller fellow at University of California Berkeley . Irit Dinur contributed to the vertex cover problem. In 2005, she discovered a dramatically simple and radically new proof of the PCP theorem .
Red text was written in or rewritten since the previous snapshot. Their copy is revision 369478450.
The opening as it stood in 2020 6 passages from the previous snapshot no longer appear
Israeli mathematician Irit Dinur (Hebrew: אירית דינור) is an Israeli mathematician. She is professor of computer science at the Weizmann Institute of Science . Her research is in foundations of computer science and in combinatorics , and especially in probabilistically checkable proofs and hardness of approximation .
Red text was written in or rewritten since the previous snapshot. Their copy is revision 951544544.
The opening as it stood in 2025
Israeli computer scientist Irit Dinur ( Hebrew : אירית דינור ) is an Israeli computer scientist. She is professor of computer science at the Weizmann Institute of Science . In 2024 she was appointed a permanent faculty member in the School of Mathematics of the Institute for Advanced Study . Her research is in foundations of computer science and in combinatorics , and especially in probabilistically checkable proofs and hardness of approximation .
Red text was written in or rewritten since the previous snapshot. Their copy is revision 1293336023. This is our newest snapshot; the live article may have moved again since.
Today
Wikipedia's first sentence called it “israeli mathematician”. Today it says “israeli computer scientist”. Read the current article and compare.
2010
2015
2020
Oct '23
2025
Counts in the opening at each snapshot. Green: the word gained ground. Red: it was cut. Grey: no change.
What Wikipedia says this is
Every article opens by defining its subject. This one was redefined since 2010, and today's defining sentence is their current revision.
Then
israeli mathematician
Now
israeli computer scientist
Struck red text is no longer in the article; dotted amber text was rewritten. Every revision id links to Wikipedia's copy; the text shown is our own saved copy. Data: /data. Wikipedia text is CC BY-SA; quoted for the record; not affiliated with Wikipedia.
