Charles Rackoff
E53517
Charles Rackoff is a Canadian computer scientist known for his influential work in cryptography and computational complexity theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Charles Rackoff canonical | 4 |
How this entity was disambiguated
This entity first appeared as the object of triple T143816 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Charles Rackoff Context triple: [Shafi Goldwasser, coAuthor, Charles Rackoff]
-
A.
Charles Jacobs
Charles Jacobs was an entrepreneur best known as a founder of Delaware North, a major global hospitality and food service company.
-
B.
Michael V. Drake
Michael V. Drake is an American academic leader and physician who has served as president of both The Ohio State University and the University of California system.
-
C.
Chris Lebenzon
Chris Lebenzon is an American film editor known for his long-time collaborations with directors like Tim Burton and Tony Scott on major Hollywood films.
-
D.
Paul G. Hoffman
Paul G. Hoffman was an American automobile executive and public administrator best known for leading post–World War II European recovery efforts and later serving in prominent roles at the United Nations.
-
E.
Pierce Anderson
Pierce Anderson was an American architect best known for his work with the firm Graham, Anderson, Probst & White, contributing to major Beaux-Arts and classical revival buildings in the early 20th century.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Charles Rackoff Target entity description: Charles Rackoff is a Canadian computer scientist known for his influential work in cryptography and computational complexity theory.
-
A.
Charles Jacobs
Charles Jacobs was an entrepreneur best known as a founder of Delaware North, a major global hospitality and food service company.
-
B.
Michael V. Drake
Michael V. Drake is an American academic leader and physician who has served as president of both The Ohio State University and the University of California system.
-
C.
Chris Lebenzon
Chris Lebenzon is an American film editor known for his long-time collaborations with directors like Tim Burton and Tony Scott on major Hollywood films.
-
D.
Paul G. Hoffman
Paul G. Hoffman was an American automobile executive and public administrator best known for leading post–World War II European recovery efforts and later serving in prominent roles at the United Nations.
-
E.
Pierce Anderson
Pierce Anderson was an American architect best known for his work with the firm Graham, Anderson, Probst & White, contributing to major Beaux-Arts and classical revival buildings in the early 20th century.
- F. None of above. chosen
Statements (32)
| Predicate | Object |
|---|---|
| instanceOf |
Canadian person
ⓘ
computer scientist ⓘ cryptographer ⓘ |
| academicAdvisor | Albert R. Meyer ⓘ |
| affiliation | Department of Computer Science, University of Toronto ⓘ |
| citizenship | Canada ⓘ |
| coAuthorWith |
Shafi Goldwasser
ⓘ
Silvio Micali ⓘ |
| countryOfEmployment | Canada ⓘ |
| educatedAt | Massachusetts Institute of Technology ⓘ |
| employer | University of Toronto ⓘ |
| fieldOfWork |
computational complexity theory
ⓘ
computer science ⓘ cryptography ⓘ |
| hasAcademicRank | professor ⓘ |
| hasContribution |
early development of zero-knowledge proof theory
ⓘ
foundational results in interactive proofs ⓘ |
| hasGender | male ⓘ |
| influenced | modern cryptographic protocol design ⓘ |
| influencedBy | Albert R. Meyer ⓘ |
| languageOfWorkOrName | English ⓘ |
| notableFor |
formalization of knowledge complexity
ⓘ
work on interactive proof systems ⓘ work on zero-knowledge proofs ⓘ |
| notableWork |
Interactive proof systems and zero-knowledge
ⓘ
The knowledge complexity of interactive proof systems ⓘ |
| occupation |
researcher
ⓘ
university teacher ⓘ |
| researchArea |
complexity of cryptographic protocols
ⓘ
probabilistic algorithms ⓘ theoretical computer science ⓘ |
| workLocation | Toronto ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Charles Rackoff Description of subject: Charles Rackoff is a Canadian computer scientist known for his influential work in cryptography and computational complexity theory.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.