Triple
T17693710
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Nando de Freitas |
E441101
|
entity |
| Predicate | coAuthorOf |
P2389
|
FINISHED |
| Object | Sequential Monte Carlo Methods for Bayesian Filtering |
—
|
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: Sequential Monte Carlo Methods for Bayesian Filtering | Statement: [Nando de Freitas, coAuthorOf, Sequential Monte Carlo Methods for Bayesian Filtering]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Sequential Monte Carlo Methods for Bayesian Filtering Context triple: [Nando de Freitas, coAuthorOf, Sequential Monte Carlo Methods for Bayesian Filtering]
-
A.
Monte Carlo localization
Monte Carlo localization is a probabilistic robotics algorithm that uses particle filters to estimate a robot’s pose within a known map based on noisy sensor and motion data.
-
B.
“A New Approach to Linear Filtering and Prediction Problems”
“A New Approach to Linear Filtering and Prediction Problems” is Rudolf E. Kálmán’s landmark 1960 paper that introduced the Kalman filter, a foundational algorithm for optimal estimation in control theory, signal processing, and navigation.
-
C.
Kalman filter
The Kalman filter is a mathematical algorithm used to estimate the changing state of a system from noisy measurements, widely applied in control systems, navigation, and signal processing.
-
D.
unscented Kalman filter
The unscented Kalman filter is a nonlinear state estimation algorithm that uses a deterministic sampling approach (sigma points) to more accurately capture the mean and covariance of a system than the standard extended Kalman filter.
-
E.
Markov localization
Markov localization is a probabilistic method in robotics for estimating a robot’s position by maintaining and updating a belief distribution over all possible locations based on sensor data and motion.
- 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: Sequential Monte Carlo Methods for Bayesian Filtering Target entity description: "Sequential Monte Carlo Methods for Bayesian Filtering" is a scholarly work that develops and analyzes particle filtering techniques for performing Bayesian inference in dynamic systems.
-
A.
Monte Carlo localization
Monte Carlo localization is a probabilistic robotics algorithm that uses particle filters to estimate a robot’s pose within a known map based on noisy sensor and motion data.
-
B.
“A New Approach to Linear Filtering and Prediction Problems”
“A New Approach to Linear Filtering and Prediction Problems” is Rudolf E. Kálmán’s landmark 1960 paper that introduced the Kalman filter, a foundational algorithm for optimal estimation in control theory, signal processing, and navigation.
-
C.
Kalman filter
The Kalman filter is a mathematical algorithm used to estimate the changing state of a system from noisy measurements, widely applied in control systems, navigation, and signal processing.
-
D.
unscented Kalman filter
The unscented Kalman filter is a nonlinear state estimation algorithm that uses a deterministic sampling approach (sigma points) to more accurately capture the mean and covariance of a system than the standard extended Kalman filter.
-
E.
Markov localization
Markov localization is a probabilistic method in robotics for estimating a robot’s position by maintaining and updating a belief distribution over all possible locations based on sensor data and motion.
- 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_69d8b9e940b081908b862bb0e6e89b0d |
completed | April 10, 2026, 8:50 a.m. |
| NER | Named-entity recognition | batch_69e4715485d88190b9b6f347ff85d7c7 |
completed | April 19, 2026, 6:08 a.m. |
Created at: April 10, 2026, 10:04 a.m.