Triple

T26254416

Position	Surface form	Disambiguated ID	Type / Status
Subject	McLaughlin group	`E656679`	entity
Predicate	hasRelatedGeometry	`P25627`	FINISHED
Object	McLaughlin graph The McLaughlin graph is a highly symmetric, strongly regular graph with 275 vertices that encodes the combinatorial structure on which the sporadic McLaughlin simple group acts as an automorphism group.	`E1713576`	NE FINISHED

How this triple was built (3 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: McLaughlin graph | Statement: [McLaughlin group, hasRelatedGeometry, McLaughlin graph]

NEDg Description generation gpt-5.1

Instruction

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Input

Entity: McLaughlin graph
Triple: [McLaughlin group, hasRelatedGeometry, McLaughlin graph]

Generated description

The McLaughlin graph is a highly symmetric, strongly regular graph with 275 vertices that encodes the combinatorial structure on which the sporadic McLaughlin simple group acts as an automorphism group.

PD Predicate disambiguation gpt-5-mini-2025-08-07

Target predicate: hasRelatedGeometry
Context triple: [McLaughlin group, hasRelatedGeometry, McLaughlin graph]

A. hasRelatedPolygon
Indicates that one entity is associated with another entity that is represented or defined as a polygon.
B. hasGeometry chosen
Indicates that an entity is associated with a specific geometric representation or spatial form.
C. relatesGeometryTo
Indicates a relationship in which one entity is associated with, defined by, or linked to a specific geometric representation or structure.
D. hasShapeRelation
Indicates that one entity is related to another through a specific geometric or spatial shape relationship (such as similarity, congruence, or containment of shape).
E. hasRelation
Indicates that there exists some specified relationship or association between two entities.
F. None of above.

Provenance (6 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_69ee5b4d25ac819086acb51184602576`	completed	April 26, 2026, 6:37 p.m.
NER	Named-entity recognition	`batch_69fd6f9d600c8190acf495b7fc632e4b`	completed	May 8, 2026, 5:07 a.m.
NED1	Entity disambiguation (via context triple)	`batch_6a1185aaa938819094c6a7f051289d3d`	completed	May 23, 2026, 10:47 a.m.
NEDg	Description generation	`batch_6a11862050608190bf26431a0fb90b07`	completed	May 23, 2026, 10:49 a.m.
NED2	Entity disambiguation (via description)	`batch_6a1186c04c2c8190a5e70c9d9a5cbeb8`	completed	May 23, 2026, 10:51 a.m.
PD	Predicate disambiguation	`batch_69fd6e98a2948190a9f78c415ad23b8c`	completed	May 8, 2026, 5:03 a.m.

Created at: April 26, 2026, 9:08 p.m.