Triple

T23507772
Position Surface form Disambiguated ID Type / Status
Subject Leonid Levin E572330 entity
Predicate co-formulated P30733 FINISHED
Object P versus NP problem NE NERFINISHED

How this triple was built (3 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: [Leonid Levin, co-formulated, P versus NP problem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: P versus NP problem
Context triple: [Leonid Levin, co-formulated, 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.
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: co-formulated
Context triple: [Leonid Levin, co-formulated, P versus NP problem]
  • A. coFormulated chosen
    Indicates that two or more entities were jointly formulated, designed, or created together as part of the same process or product.
  • B. coFormulatedWith
    Indicates that one entity is formulated together with another as part of the same combined product or composition.
  • C. isFormulatedUsing
    Indicates that something is created, defined, or expressed by means of a specified method, material, or set of components.
  • D. formulatedIn
    Indicates that something was created, developed, or expressed within a particular context, place, or framework.
  • E. isFormulatedBy
    Indicates that something (such as a plan, idea, or substance) is created, devised, or composed by a particular agent or source.
  • F. None of above.

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_69e245b5e4208190bac8a6509867e394 completed April 17, 2026, 2:37 p.m.
NER Named-entity recognition batch_69f1a901c9908190a781e79fe8b96743 completed April 29, 2026, 6:45 a.m.
PD Predicate disambiguation batch_69f0621165c08190a0b27b1319733959 completed April 28, 2026, 7:30 a.m.
Created at: April 17, 2026, 6:07 p.m.