Triple

T8640807
Position Surface form Disambiguated ID Type / Status
Subject Erdős–Rényi model E204641 entity
Predicate alsoKnownAs P39 FINISHED
Object binomial random graph E204641 NE FINISHED

How this triple was built (2 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini
Instruction
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).
Input
Phrase: binomial random graph | Statement: [Erdős–Rényi model, alsoKnownAs, binomial random graph]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: binomial random graph
Context triple: [Erdős–Rényi model, alsoKnownAs, binomial random graph]
  • A. 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.
  • B. 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.
  • C. Erdős–Stone theorem
    The Erdős–Stone theorem is a fundamental result in extremal graph theory that asymptotically determines the maximum number of edges in an n-vertex graph that avoids containing a given subgraph.
  • D. 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.
  • E. Alon–Boppana bound
    The Alon–Boppana bound is a fundamental result in spectral graph theory that gives an asymptotic lower bound on the second-largest eigenvalue of large regular graphs, showing inherent limitations on how well such graphs can approximate expanders.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69ca834ca1c88190a11ffb0200342fac completed March 30, 2026, 2:06 p.m.
NER Named-entity recognition batch_69cc47944d1c819081f448f14d04bf9d completed March 31, 2026, 10:15 p.m.
NED1 Entity disambiguation (via context triple) batch_69cebc3b1f508190978df29d995f494c completed April 2, 2026, 6:58 p.m.
Created at: March 30, 2026, 6:28 p.m.