Triple
T19327991
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hensel’s lemma |
E483408
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Newton’s method |
—
|
NE NERFINISHED |
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: Newton’s method | Statement: [Hensel’s lemma, relatedTo, Newton’s method]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Newton’s method Context triple: [Hensel’s lemma, relatedTo, Newton’s method]
-
A.
Newton’s method
chosen
Newton’s method is an iterative numerical technique used to find successively better approximations to the roots of a real-valued function.
-
B.
Halley’s method for solving equations
Halley’s method for solving equations is an iterative numerical algorithm, related to and faster-converging than Newton’s method, used to find approximate roots of equations.
-
C.
Godunov's method
Godunov's method is a numerical scheme for solving hyperbolic partial differential equations that uses exact or approximate Riemann solvers to compute fluxes at cell interfaces in finite-volume discretizations.
-
D.
NewtonFour
NewtonFour is a liquid-fueled rocket engine developed by Virgin Orbit to power the second stage of its air-launched LauncherOne orbital vehicle.
-
E.
Picard iteration
Picard iteration is a successive approximation method used to construct solutions to ordinary differential equations and establish their existence and uniqueness.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69d8e8d13e3c81909d91d1d5ec37c095 |
completed | April 10, 2026, 12:10 p.m. |
| NER | Named-entity recognition | batch_69e6163f32f48190be17cccf4e537372 |
completed | April 20, 2026, 12:04 p.m. |
Created at: April 10, 2026, 1:33 p.m.