Triple

T12797445
Position Surface form Disambiguated ID Type / Status
Subject Introduction to Automata Theory, Languages, and Computation E305925 entity
Predicate topic P261 FINISHED
Object P versus NP problem E131016 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: P versus NP problem | Statement: [Introduction to Automata Theory, Languages, and Computation, topic, P versus NP problem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: P versus NP problem
Context triple: [Introduction to Automata Theory, Languages, and Computation, topic, P versus NP problem]
  • A. P versus NP problem chosen
    The P versus NP problem is a central unsolved question in theoretical computer science that asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer.
  • B. Millennium Prize Problem
    The Millennium Prize Problem is one of seven famous unsolved mathematical problems designated by the Clay Mathematics Institute, each carrying a $1 million reward for a correct solution.
  • C. 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.
  • 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. P, NP, and NP-Completeness: The Basics of Complexity Theory
    "P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
  • 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_69d7bdf366888190a8cccb982606889c completed April 9, 2026, 2:55 p.m.
NER Named-entity recognition batch_69d96e6db68481909a2ca8da1287f3e0 completed April 10, 2026, 9:41 p.m.
NED1 Entity disambiguation (via context triple) batch_69f6850d6ebc8190aaffcac09f4b15eb completed May 2, 2026, 11:13 p.m.
Created at: April 9, 2026, 5:30 p.m.