Triple
T29045109
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Menger's theorem (graph theory) |
E735111
|
entity |
| Predicate | hasEdgeVersionStatement |
P170154
|
FINISHED |
| Object | for any two distinct vertices s and t, the maximum number of pairwise edge-disjoint s–t paths equals the minimum size of an s–t edge cut |
—
|
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: for any two distinct vertices s and t, the maximum number of pairwise edge-disjoint s–t paths equals the minimum size of an s–t edge cut | Statement: [Menger's theorem (graph theory), hasEdgeVersionStatement, for any two distinct vertices s and t, the maximum number of pairwise edge-disjoint s–t paths equals the minimum size of an s–t edge cut]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasEdgeVersionStatement Context triple: [Menger's theorem (graph theory), hasEdgeVersionStatement, for any two distinct vertices s and t, the maximum number of pairwise edge-disjoint s–t paths equals the minimum size of an s–t edge cut]
-
A.
hasGlobalVertexVersionStatement
Indicates that there exists a statement specifying the global version information associated with a particular vertex.
-
B.
hasVersionIn
Indicates that one entity exists as a specific version or variant within the context, format, or system represented by another entity.
-
C.
hasEdge
Indicates that there exists a direct connection or link (an edge) between two entities in a graph or network.
-
D.
hasGapVersion
Indicates that there exists a discontinuity or missing segment between two versions or states of something.
-
E.
hasPlatformEdge
Indicates that an entity possesses or includes a boundary or edge associated with a platform.
- 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_69f077e64b88819094d37bdbca8191b3 |
completed | April 28, 2026, 9:03 a.m. |
| NER | Named-entity recognition | batch_69f68b121eac81909e90416207bc1157 |
completed | May 2, 2026, 11:38 p.m. |
| PD | Predicate disambiguation | batch_69f6860def1c81909d79e1f088c4b5e5 |
completed | May 2, 2026, 11:17 p.m. |
| PDg | Predicate description generation | batch_69f68a160374819084d720985f800dfc |
completed | May 2, 2026, 11:34 p.m. |
Created at: April 28, 2026, 10:04 a.m.