Triple

T6788424
Position Surface form Disambiguated ID Type / Status
Subject Stokes parameters E155870 entity
Predicate relatedTo P37 FINISHED
Object Jones calculus
Jones calculus is a mathematical formalism used in optics to represent and analyze the polarization state of light and its transformation by optical elements using complex vectors and matrices.
E620785 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: Jones calculus | Statement: [Stokes parameters, relatedTo, Jones calculus]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Jones calculus
Context triple: [Stokes parameters, relatedTo, Jones calculus]
  • A. linear logic
    Linear logic is a substructural logic introduced by Jean-Yves Girard that treats logical propositions as resources, carefully tracking their use to model state change, concurrency, and resource-sensitive computation.
  • B. Curry–Howard correspondence
    The Curry–Howard correspondence is a foundational principle in logic and computer science that establishes a deep analogy between proofs and programs, and between logical propositions and types in programming languages.
  • C. Hilbert-style deductive systems
    Hilbert-style deductive systems are axiomatic proof systems in mathematical logic that use a small set of axiom schemas and a few inference rules (typically including modus ponens) to derive theorems in formal theories such as Zermelo–Fraenkel set theory.
  • D. The Calculus of Computation
    The Calculus of Computation is a textbook that introduces the mathematical foundations of verification, focusing on logic-based methods for specifying and proving properties of computational systems.
  • E. Brouwer–Heyting–Kolmogorov interpretation
    The Brouwer–Heyting–Kolmogorov interpretation is a foundational explanation of intuitionistic logic that interprets logical connectives and proofs in terms of explicit constructions and algorithms rather than classical truth values.
  • 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: Jones calculus
Triple: [Stokes parameters, relatedTo, Jones calculus]
Generated description
Jones calculus is a mathematical formalism used in optics to represent and analyze the polarization state of light and its transformation by optical elements using complex vectors and matrices.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Jones calculus
Target entity description: Jones calculus is a mathematical formalism used in optics to represent and analyze the polarization state of light and its transformation by optical elements using complex vectors and matrices.
  • A. linear logic
    Linear logic is a substructural logic introduced by Jean-Yves Girard that treats logical propositions as resources, carefully tracking their use to model state change, concurrency, and resource-sensitive computation.
  • B. Curry–Howard correspondence
    The Curry–Howard correspondence is a foundational principle in logic and computer science that establishes a deep analogy between proofs and programs, and between logical propositions and types in programming languages.
  • C. Hilbert-style deductive systems
    Hilbert-style deductive systems are axiomatic proof systems in mathematical logic that use a small set of axiom schemas and a few inference rules (typically including modus ponens) to derive theorems in formal theories such as Zermelo–Fraenkel set theory.
  • D. The Calculus of Computation
    The Calculus of Computation is a textbook that introduces the mathematical foundations of verification, focusing on logic-based methods for specifying and proving properties of computational systems.
  • E. Brouwer–Heyting–Kolmogorov interpretation
    The Brouwer–Heyting–Kolmogorov interpretation is a foundational explanation of intuitionistic logic that interprets logical connectives and proofs in terms of explicit constructions and algorithms rather than classical truth values.
  • 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_69c6881770fc8190972b2906390380f5 completed March 27, 2026, 1:37 p.m.
NER Named-entity recognition batch_69c6d2aa2e0c8190b994261826ae001d completed March 27, 2026, 6:55 p.m.
NED1 Entity disambiguation (via context triple) batch_69c71a8998408190b741417ce6f21f55 completed March 28, 2026, 12:02 a.m.
NEDg Description generation batch_69c71e2ad0b08190a24f8865b8074b35 completed March 28, 2026, 12:17 a.m.
NED2 Entity disambiguation (via description) batch_69c71e9ec7148190a5f1df4951990f64 completed March 28, 2026, 12:19 a.m.
Created at: March 27, 2026, 2:14 p.m.