Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: On Random Graphs I | Statement: [Erdős–Rényi model, formalizedIn, On Random Graphs I]

Target entity: On Random Graphs I
Context triple: [Erdős–Rényi model, formalizedIn, On Random Graphs I]

• A. Erdős on Graphs: His Legacy
  Erdős on Graphs: His Legacy is a mathematical monograph by Fan Chung and Ronald Graham that surveys and extends Paul Erdős’s influential work in graph theory and combinatorics.
• B. Pólya’s theorem on random walks
  Pólya’s theorem on random walks is a fundamental result in probability theory stating that simple random walks on one- and two-dimensional lattices are recurrent (almost surely return to the starting point infinitely often), while in three or more dimensions they are transient.
• C. Erdős–Rényi law of large numbers
  The Erdős–Rényi law of large numbers is a refinement of the classical law of large numbers that provides precise asymptotic behavior and convergence rates for sums of independent random variables, developed by mathematicians Pál Erdős and Alfréd Rényi.
• D. Erdős–Rényi model chosen
  The Erdős–Rényi model is a fundamental random graph model in probability theory and network science, where edges between pairs of nodes are included independently with a fixed probability.
• E. Conway's 99-graph problem
  Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.