Triple
T18158074
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Merkle–Hellman knapsack cryptosystem |
E434684
|
entity |
| Predicate | basedOn |
P98
|
FINISHED |
| Object | subset sum problem |
—
|
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: subset sum problem | Statement: [Merkle–Hellman knapsack cryptosystem, basedOn, subset sum problem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: subset sum problem Context triple: [Merkle–Hellman knapsack cryptosystem, basedOn, subset sum problem]
-
A.
Subset sum problem
chosen
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.
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.
-
C.
Clique problem
The Clique problem is a classic NP-complete decision problem in graph theory that asks whether a graph contains a fully connected subgraph (clique) of at least a given size.
-
D.
Waring's problem
Waring's problem is a famous conjecture in number theory that concerns representing natural numbers as sums of fixed powers of integers and determining how many such powers are needed.
-
E.
Powerset
Powerset was a natural-language search engine startup, later acquired by Microsoft, that focused on enabling more intuitive, semantic web search.
- 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_69d8b90b7a188190b3fc7b8d4a6cd20a |
completed | April 10, 2026, 8:47 a.m. |
| NER | Named-entity recognition | batch_69e4dec02d9c81909ac6203b7d59c405 |
completed | April 19, 2026, 1:55 p.m. |
Created at: April 10, 2026, 10:30 a.m.