Triple

T14295334
Position Surface form Disambiguated ID Type / Status
Subject Steven Givant E354423 entity
Predicate coauthorOf P2389 FINISHED
Object Introduction to Relation Algebras E1091322 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: Introduction to Relation Algebras | Statement: [Steven Givant, coauthorOf, Introduction to Relation Algebras]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Introduction to Relation Algebras
Context triple: [Steven Givant, coauthorOf, Introduction to Relation Algebras]
  • A. Relation Algebras chosen
    Relation Algebras is a mathematical monograph that develops the theory of relation algebras as an abstract algebraic framework for studying relations and their logical properties.
  • B. The Calculus of Relations
    The Calculus of Relations is a mathematical logic text that systematically develops relation algebras and their applications to the foundations of mathematics and computer science.
  • C. The Logic of Relatives
    The Logic of Relatives is a seminal work by Charles Sanders Peirce that develops a formal theory of relations, significantly advancing the foundations of modern logic and mathematics.
  • D. Birkhoff’s representation theorem for finite distributive lattices
    Birkhoff’s representation theorem for finite distributive lattices is a fundamental result in lattice theory that characterizes every finite distributive lattice as isomorphic to the lattice of lower (order) ideals of a finite poset.
  • E. Handbook of Boolean Algebras
    The *Handbook of Boolean Algebras* is a comprehensive multi-volume reference work that surveys the theory, structure, and applications of Boolean algebras in modern mathematics and logic.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

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_69d8278e17088190b328c5a9d4be74ff completed April 9, 2026, 10:26 p.m.
NER Named-entity recognition batch_69de717b35ec81908968994e65737c66 completed April 14, 2026, 4:55 p.m.
NED1 Entity disambiguation (via context triple) batch_69fd46812ed48190b879afe9a93784e8 completed May 8, 2026, 2:12 a.m.
Created at: April 10, 2026, 1:11 a.m.