Triple
T20836679
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Nancy Lynch |
E512975
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Atomic Snapshots of Shared Memory |
—
|
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: Atomic Snapshots of Shared Memory | Statement: [Nancy Lynch, notableWork, Atomic Snapshots of Shared Memory]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Atomic Snapshots of Shared Memory Context triple: [Nancy Lynch, notableWork, Atomic Snapshots of Shared Memory]
-
A.
Software Transactional Memory
Software Transactional Memory is a concurrency control mechanism that lets programmers manage shared memory using atomic transactions instead of explicit locks, simplifying the writing of correct concurrent programs.
-
B.
“Separation Logic: A Logic for Shared Mutable Data Structures”
“Separation Logic: A Logic for Shared Mutable Data Structures” is a seminal paper that introduced separation logic, a formal system for reasoning locally and modularly about programs that manipulate shared, mutable memory.
-
C.
Verification of Concurrent Programs
"Verification of Concurrent Programs" is a foundational computer science text that presents formal methods and techniques for proving the correctness of programs that execute concurrently.
-
D.
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs"
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs" is a seminal paper by Leslie Lamport that introduced foundational concepts for ensuring correctness and consistency in concurrent and multiprocessor systems.
-
E.
Elements of Distributed Algorithms
Elements of Distributed Algorithms is a foundational textbook that systematically presents the principles, models, and key techniques used in the design and analysis of distributed algorithms.
- 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: Atomic Snapshots of Shared Memory Target entity description: "Atomic Snapshots of Shared Memory" is a foundational research work in distributed computing that introduces algorithms and theory for obtaining consistent, instantaneous views of shared memory in asynchronous systems.
-
A.
Software Transactional Memory
Software Transactional Memory is a concurrency control mechanism that lets programmers manage shared memory using atomic transactions instead of explicit locks, simplifying the writing of correct concurrent programs.
-
B.
“Separation Logic: A Logic for Shared Mutable Data Structures”
“Separation Logic: A Logic for Shared Mutable Data Structures” is a seminal paper that introduced separation logic, a formal system for reasoning locally and modularly about programs that manipulate shared, mutable memory.
-
C.
Verification of Concurrent Programs
"Verification of Concurrent Programs" is a foundational computer science text that presents formal methods and techniques for proving the correctness of programs that execute concurrently.
-
D.
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs"
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs" is a seminal paper by Leslie Lamport that introduced foundational concepts for ensuring correctness and consistency in concurrent and multiprocessor systems.
-
E.
Elements of Distributed Algorithms
Elements of Distributed Algorithms is a foundational textbook that systematically presents the principles, models, and key techniques used in the design and analysis of distributed algorithms.
- 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_69e0b4cf62a88190bbf92351e9e57259 |
completed | April 16, 2026, 10:07 a.m. |
| NER | Named-entity recognition | batch_69e6c326daec8190bd4caa41a4b38833 |
completed | April 21, 2026, 12:21 a.m. |
Created at: April 16, 2026, 12:42 p.m.