Triple

T21763325
Position Surface form Disambiguated ID Type / Status
Subject Max-E3-LIN-2 E537215 entity
Predicate relatedTo P37 FINISHED
Object PCP theorem — 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: PCP theorem | Statement: [Max-E3-LIN-2, relatedTo, PCP theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: PCP theorem
Context triple: [Max-E3-LIN-2, relatedTo, PCP theorem]
  • A. PCP theorem chosen
    The PCP theorem is a fundamental result in computational complexity theory stating that every problem in NP has probabilistically checkable proofs that can be verified by examining only a constant number of bits, with major implications for the hardness of approximation.
  • B. Cook–Levin theorem
    The Cook–Levin theorem is a foundational result in computational complexity theory that established the Boolean satisfiability problem (SAT) as the first NP-complete problem, launching the theory of NP-completeness.
  • C. Papadimitriou–Yannakakis theorem
    The Papadimitriou–Yannakakis theorem is a fundamental result in computational complexity theory that characterizes the complexity of certain optimization and approximation problems, particularly in relation to classes like NP and the theory of approximation algorithms.
  • D. NP-completeness
    NP-completeness is a central concept in computational complexity theory that classifies decision problems believed to be among the hardest in NP, such that a polynomial-time solution to any one of them would yield polynomial-time solutions to all problems in NP.
  • E. Babai–Fortnow–Lund–Safra–Szegedy theorem
    The Babai–Fortnow–Lund–Safra–Szegedy theorem is a landmark result in computational complexity theory that characterizes the power of multi-prover interactive proofs by showing they capture exactly the class of nondeterministic exponential-time problems.
  • 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_69e0c46f5d1c8190bf830409e98464e5 completed April 16, 2026, 11:13 a.m.
NER Named-entity recognition batch_69f031a711dc8190a786c9849dc344e8 completed April 28, 2026, 4:03 a.m.
Created at: April 16, 2026, 6:51 p.m.