Triple

T29045098
Position Surface form Disambiguated ID Type / Status
Subject Menger's theorem (graph theory) E735111 entity
Predicate relatedTo P37 FINISHED
Object max-flow min-cut theorem
The max-flow min-cut theorem is a fundamental result in network flow theory stating that the maximum amount of flow that can be sent from a source to a sink in a flow network equals the minimum capacity of any cut separating them.
E1846972 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: max-flow min-cut theorem | Statement: [Menger's theorem (graph theory), relatedTo, max-flow min-cut theorem]
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: max-flow min-cut theorem
Triple: [Menger's theorem (graph theory), relatedTo, max-flow min-cut theorem]
Generated description
The max-flow min-cut theorem is a fundamental result in network flow theory stating that the maximum amount of flow that can be sent from a source to a sink in a flow network equals the minimum capacity of any cut separating them.

Provenance (5 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_69f077e64b88819094d37bdbca8191b3 completed April 28, 2026, 9:03 a.m.
NER Named-entity recognition batch_69f66060f3508190af8c48526206c8cc completed May 2, 2026, 8:36 p.m.
NED1 Entity disambiguation (via context triple) batch_6a251f70f5bc8190aca497dd6c4e62f0 completed June 7, 2026, 7:36 a.m.
NEDg Description generation batch_6a2523c42870819080405feb80019d83 completed June 7, 2026, 7:54 a.m.
NED2 Entity disambiguation (via description) batch_6a252484db5081909a9f337bb31abc2c completed June 7, 2026, 7:57 a.m.
Created at: April 28, 2026, 10:04 a.m.