Triple

T8640840
Position Surface form Disambiguated ID Type / Status
Subject Erdős–Rényi model E204641 entity
Predicate edgeCountDistributionInG(n,p) P84388 FINISHED
Object binomial with parameters (n choose 2) and p LITERAL 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 with parameters (n choose 2) and p | Statement: [Erdős–Rényi model, edgeCountDistributionInG(n,p), binomial with parameters (n choose 2) and p]
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: edgeCountDistributionInG(n,p)
Context triple: [Erdős–Rényi model, edgeCountDistributionInG(n,p), binomial with parameters (n choose 2) and p]
  • A. junctionCountApprox
    Indicates an approximate count of junctions or connection points involved in or associated with the given entities.
  • B. edgesInMinimalTriangulation
    Indicates that the specified edges are exactly those that appear in at least one minimal triangulation (chordal completion with the fewest added edges) of a given graph.
  • C. networkLength
    Indicates the total measured extent or distance covered by a network (e.g., of connections, links, or paths).
  • D. numberOfDistances
    Indicates the count of distinct distance values associated with or measured between entities in a given context.
  • E. EulerCharacteristic
    Indicates the topological invariant of a space that equals, in a suitable decomposition, the alternating sum of the counts of its cells (e.g., vertices − edges + faces).
  • F. None of above. chosen

Provenance (4 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.
PD Predicate disambiguation batch_69cc455d6d448190a2da2a319ac78c37 completed March 31, 2026, 10:06 p.m.
PDg Predicate description generation batch_69cc479284a8819099b0b0d879af3372 completed March 31, 2026, 10:15 p.m.
Created at: March 30, 2026, 6:28 p.m.