Triple
T22423425
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Erdős–Straus conjecture |
E554304
|
entity |
| Predicate | hasComputationalVerification |
P131814
|
FINISHED |
| Object | verified for all n up to very large bounds by computer search |
—
|
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: verified for all n up to very large bounds by computer search | Statement: [Erdős–Straus conjecture, hasComputationalVerification, verified for all n up to very large bounds by computer search]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasComputationalVerification Context triple: [Erdős–Straus conjecture, hasComputationalVerification, verified for all n up to very large bounds by computer search]
-
A.
verifiedByComputationUpTo
chosen
Indicates that the truth or validity of something has been confirmed by explicit computation up to a specified bound or limit.
-
B.
usesComputationMethod
Indicates that an entity performs its processing or decision-making by applying a specified computational method or algorithm.
-
C.
computationalCost
Indicates the amount of computing resources (such as time, memory, or processing power) required to perform a given operation or process.
-
D.
isUsedToCompute
Indicates that one entity serves as an input, basis, or resource for performing a calculation or deriving a result about another entity.
-
E.
computabilityRequirement
Indicates that something must be capable of being computed or effectively carried out by an algorithm or computational process.
- 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_69e11e4f2d0c819091aa3558ea2ee630 |
completed | April 16, 2026, 5:37 p.m. |
| NER | Named-entity recognition | batch_69f15a2af620819083338127e78137dc |
completed | April 29, 2026, 1:08 a.m. |
| PD | Predicate disambiguation | batch_69e898a327948190beee5e168006a0a7 |
completed | April 22, 2026, 9:45 a.m. |
Created at: April 16, 2026, 8:47 p.m.