Triple

T33096538
Position Surface form Disambiguated ID Type / Status
Subject cut-elimination theorem E846922 entity
Predicate formalizedIn P6279 FINISHED
Object Gentzen’s sequent calculus LJ
Gentzen’s sequent calculus LJ is a proof-theoretic formal system for intuitionistic logic that represents deductions as sequents and underpins results like normalization and consistency via structural analysis of proofs.
E846923 NE 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: Gentzen’s sequent calculus LJ | Statement: [cut-elimination theorem, formalizedIn, Gentzen’s sequent calculus LJ]
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: Gentzen’s sequent calculus LJ
Triple: [cut-elimination theorem, formalizedIn, Gentzen’s sequent calculus LJ]
Generated description
Gentzen’s sequent calculus LJ is a proof-theoretic formal system for intuitionistic logic that represents deductions as sequents and underpins results like normalization and consistency via structural analysis of proofs.

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_69f3495590dc8190aa04f3dec74ce976 completed April 30, 2026, 12:21 p.m.
NER Named-entity recognition batch_69f6d6a8ce608190a6a4673b434945e8 completed May 3, 2026, 5:01 a.m.
NED1 Entity disambiguation (via context triple) batch_6a352fab1c0081909de0d56ffdb921bc completed June 19, 2026, 12:01 p.m.
NEDg Description generation batch_6a35308d798481908ed5bd2b3782e478 completed June 19, 2026, 12:05 p.m.
NED2 Entity disambiguation (via description) batch_6a35318eb1c4819099588aeac83c8a6a completed June 19, 2026, 12:09 p.m.
Created at: May 1, 2026, 1:26 a.m.