Triple
T20614965
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Luhn algorithm variant |
E506542
|
entity |
| Predicate | basedOn |
P98
|
FINISHED |
| Object | Luhn algorithm |
—
|
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: Luhn algorithm | Statement: [Luhn algorithm variant, basedOn, Luhn algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Luhn algorithm Context triple: [Luhn algorithm variant, basedOn, Luhn algorithm]
-
A.
Luhn algorithm variant
chosen
The Luhn algorithm variant is a checksum method adapted for validating International Securities Identification Numbers (ISINs) and other financial identifiers under the ISO 6166 standard.
-
B.
LLL algorithm
The LLL algorithm is a polynomial-time lattice basis reduction algorithm widely used in computational number theory and cryptography to find relatively short, nearly orthogonal lattice vectors.
-
C.
ISO 10383 MIC database
The ISO 10383 MIC database is an international registry that assigns and maintains standardized Market Identifier Codes (MICs) for securities and derivatives trading venues and related entities worldwide.
-
D.
SPIN verification tool
The SPIN verification tool is a widely used open-source model checker for detecting logical design errors in concurrent and distributed software systems.
-
E.
Berlekamp–Massey algorithm
The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
- 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_69e0b4bc90988190ac360aaf645efc1d |
completed | April 16, 2026, 10:06 a.m. |
| NER | Named-entity recognition | batch_69e6aadaf47881909e93efb535c6c1e3 |
completed | April 20, 2026, 10:38 p.m. |
Created at: April 16, 2026, 11:41 a.m.