Triple
T8449054
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Molecular computation of solutions to combinatorial problems |
E199754
|
entity |
| Predicate | field |
P3
|
FINISHED |
| Object |
DNA computing
DNA computing is a branch of computing that uses biological molecules, particularly DNA, to perform information processing and solve complex computational and combinatorial problems in parallel.
|
E735011
|
NE FINISHED |
How this triple was built (4 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: DNA computing | Statement: [Molecular computation of solutions to combinatorial problems, field, DNA computing]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: DNA computing Context triple: [Molecular computation of solutions to combinatorial problems, field, DNA computing]
-
A.
“Molecular computation of solutions to combinatorial problems”
“Molecular computation of solutions to combinatorial problems” is Leonard Adleman’s pioneering 1994 paper that introduced DNA computing by demonstrating how molecular biology techniques can solve a combinatorial search problem.
-
B.
Biological and Artificial Computation
Biological and Artificial Computation is a scholarly work by Terrence Sejnowski that explores how principles of biological neural systems can inform and inspire computational and artificial intelligence models.
-
C.
DNA Tower
DNA Tower is a distinctive spiral lookout tower and popular landmark in Kings Park, Perth, offering panoramic views of the surrounding city and Swan River.
-
D.
The Science of Computing
"The Science of Computing" is a foundational work by Peter J. Denning that explores the principles, theory, and practice underlying computer science as a scientific discipline.
-
E.
Information and Computation
Information and Computation is a peer-reviewed scientific journal focusing on theoretical computer science, including areas such as algorithms, computational complexity, and formal methods.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: DNA computing Triple: [Molecular computation of solutions to combinatorial problems, field, DNA computing]
Generated description
DNA computing is a branch of computing that uses biological molecules, particularly DNA, to perform information processing and solve complex computational and combinatorial problems in parallel.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: DNA computing Target entity description: DNA computing is a branch of computing that uses biological molecules, particularly DNA, to perform information processing and solve complex computational and combinatorial problems in parallel.
-
A.
“Molecular computation of solutions to combinatorial problems”
“Molecular computation of solutions to combinatorial problems” is Leonard Adleman’s pioneering 1994 paper that introduced DNA computing by demonstrating how molecular biology techniques can solve a combinatorial search problem.
-
B.
Biological and Artificial Computation
Biological and Artificial Computation is a scholarly work by Terrence Sejnowski that explores how principles of biological neural systems can inform and inspire computational and artificial intelligence models.
-
C.
DNA Tower
DNA Tower is a distinctive spiral lookout tower and popular landmark in Kings Park, Perth, offering panoramic views of the surrounding city and Swan River.
-
D.
The Science of Computing
"The Science of Computing" is a foundational work by Peter J. Denning that explores the principles, theory, and practice underlying computer science as a scientific discipline.
-
E.
Information and Computation
Information and Computation is a peer-reviewed scientific journal focusing on theoretical computer science, including areas such as algorithms, computational complexity, and formal methods.
- F. None of above. chosen
Provenance (5 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_69ca83170f9081909cd98f55614c6476 |
completed | March 30, 2026, 2:05 p.m. |
| NER | Named-entity recognition | batch_69cbe445b7988190b53ae45070c70d1d |
completed | March 31, 2026, 3:12 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ce1dc85e48819083340d022d0dba9b |
completed | April 2, 2026, 7:42 a.m. |
| NEDg | Description generation | batch_69ce1f88d404819096c6024c0e61d1ea |
completed | April 2, 2026, 7:49 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69ce209338b48190ba8375200a5529bd |
completed | April 2, 2026, 7:53 a.m. |
Created at: March 30, 2026, 6:09 p.m.