Triple

T21088253
Position Surface form Disambiguated ID Type / Status
Subject Reducibility Among Combinatorial Problems E519559 entity
Predicate establishesNPCompletenessOf P142028 FINISHED
Object Knapsack 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: Knapsack problem | Statement: [Reducibility Among Combinatorial Problems, establishesNPCompletenessOf, Knapsack problem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Knapsack problem
Context triple: [Reducibility Among Combinatorial Problems, establishesNPCompletenessOf, Knapsack problem]
  • A. Subset sum problem
    The subset sum problem is a classic NP-complete decision problem in computer science that asks whether any subset of given integers sums to a specified target value.
  • B. Knapsack Col
    Knapsack Col is a high mountain pass in Wyoming’s Wind River Range, popular with backpackers and climbers traversing the rugged alpine terrain.
  • C. general knapsack cryptosystem
    The general knapsack cryptosystem is a public-key encryption scheme based on the computational hardness of the general subset sum (knapsack) problem, without relying on special structured sequences like superincreasing ones.
  • D. Knappsack
    Knappsack is a track from the album "Inviolate" by virtuoso guitarist Steve Vai, showcasing his intricate instrumental rock guitar work.
  • E. A Combinatorial Problem
    "A Combinatorial Problem" is a classic mathematical paper by N. G. de Bruijn that introduces and analyzes a fundamental counting problem in combinatorics.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Knapsack problem
Target entity description: The knapsack problem is a classic NP-complete optimization problem in combinatorial optimization, where one must select a subset of items with given weights and values to maximize total value without exceeding a capacity constraint.
  • A. Subset sum problem
    The subset sum problem is a classic NP-complete decision problem in computer science that asks whether any subset of given integers sums to a specified target value.
  • B. Knapsack Col
    Knapsack Col is a high mountain pass in Wyoming’s Wind River Range, popular with backpackers and climbers traversing the rugged alpine terrain.
  • C. general knapsack cryptosystem
    The general knapsack cryptosystem is a public-key encryption scheme based on the computational hardness of the general subset sum (knapsack) problem, without relying on special structured sequences like superincreasing ones.
  • D. Knappsack
    Knappsack is a track from the album "Inviolate" by virtuoso guitarist Steve Vai, showcasing his intricate instrumental rock guitar work.
  • E. A Combinatorial Problem
    "A Combinatorial Problem" is a classic mathematical paper by N. G. de Bruijn that introduces and analyzes a fundamental counting problem in combinatorics.
  • F. None of above. chosen

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_69e0b507dd9081908fb8bfcbef4c8b46 completed April 16, 2026, 10:08 a.m.
NER Named-entity recognition batch_69e7094cebe08190bb10f51a45c244ec completed April 21, 2026, 5:21 a.m.
Created at: April 16, 2026, 2:50 p.m.