Triple
T23372439
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | GL(n,ℝ) |
E593509
|
entity |
| Predicate | hasTwoConnectedComponentsFor |
P142617
|
FINISHED |
| Object | n ≥ 1 |
—
|
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: n ≥ 1 | Statement: [GL(n,ℝ), hasTwoConnectedComponentsFor, n ≥ 1]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasTwoConnectedComponentsFor Context triple: [GL(n,ℝ), hasTwoConnectedComponentsFor, n ≥ 1]
-
A.
hasConnectedComponent
Indicates that one entity includes or is associated with a specific connected component as part of its structure or decomposition.
-
B.
numberOfConnectedComponents
chosen
Indicates the count of distinct, mutually disconnected subgraphs or regions within a given graph or structure.
-
C.
isConnectedComponentOf
Indicates that one entity is a connected component that belongs to or forms part of another, larger structure or graph.
-
D.
isSimpleConnected
Indicates that a topological space is path-connected and every loop within it can be continuously contracted to a point (i.e., it has trivial fundamental group).
-
E.
connectedIsland
Indicates that two islands are linked by a direct or indirect path, such that travel or communication between them is possible within the same connected group.
- F. None of above.
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_69e25d2593c88190bcdf4a716a94ccb2 |
completed | April 17, 2026, 4:17 p.m. |
| NER | Named-entity recognition | batch_69f1a3af45ec8190a32aa4e5f04f6756 |
completed | April 29, 2026, 6:22 a.m. |
| PD | Predicate disambiguation | batch_69f061c7aaa48190a58ce93f87155ffc |
completed | April 28, 2026, 7:29 a.m. |
Created at: April 17, 2026, 5:32 p.m.