Triple

T8673510
Position Surface form Disambiguated ID Type / Status
Subject LauncherOne E205857 entity
Predicate secondStageEngine P2092 FINISHED
Object NewtonFour
NewtonFour is a liquid-fueled rocket engine developed by Virgin Orbit to power the second stage of its air-launched LauncherOne orbital vehicle.
E749080 NE FINISHED

How this triple was built (4 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: NewtonFour | Statement: [LauncherOne, secondStageEngine, NewtonFour]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: NewtonFour
Context triple: [LauncherOne, secondStageEngine, NewtonFour]
  • A. 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.
  • 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. Picard iteration
    Picard iteration is a successive approximation method used to construct solutions to ordinary differential equations and establish their existence and uniqueness.
  • D. classical fourth-order Runge–Kutta method
    The classical fourth-order Runge–Kutta method is a widely used, higher-accuracy numerical technique for solving ordinary differential equations by combining multiple intermediate slope evaluations within each integration step.
  • E. Heun’s method
    Heun’s method is a second-order Runge–Kutta numerical integration technique that improves on Euler’s method by using a predictor-corrector approach to achieve greater accuracy.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
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: NewtonFour
Triple: [LauncherOne, secondStageEngine, NewtonFour]
Generated description
NewtonFour is a liquid-fueled rocket engine developed by Virgin Orbit to power the second stage of its air-launched LauncherOne orbital vehicle.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: NewtonFour
Target entity description: NewtonFour is a liquid-fueled rocket engine developed by Virgin Orbit to power the second stage of its air-launched LauncherOne orbital vehicle.
  • A. 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.
  • 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. Picard iteration
    Picard iteration is a successive approximation method used to construct solutions to ordinary differential equations and establish their existence and uniqueness.
  • D. classical fourth-order Runge–Kutta method
    The classical fourth-order Runge–Kutta method is a widely used, higher-accuracy numerical technique for solving ordinary differential equations by combining multiple intermediate slope evaluations within each integration step.
  • E. Heun’s method
    Heun’s method is a second-order Runge–Kutta numerical integration technique that improves on Euler’s method by using a predictor-corrector approach to achieve greater accuracy.
  • F. None of above. chosen

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_69ca83529a9c8190b5c075b4f14636ed completed March 30, 2026, 2:06 p.m.
NER Named-entity recognition batch_69cc491b807c81909563a34a947bc21a completed March 31, 2026, 10:22 p.m.
NED1 Entity disambiguation (via context triple) batch_69cecd43c91c8190a9d1e5d14d764530 completed April 2, 2026, 8:10 p.m.
NEDg Description generation batch_69ceceaab52c819082ecea1bcc38def8 completed April 2, 2026, 8:16 p.m.
NED2 Entity disambiguation (via description) batch_69cecf962f28819090fb93b6a7a2784b completed April 2, 2026, 8:20 p.m.
Created at: March 30, 2026, 6:31 p.m.