Triple
T8284178
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | B (bit-manipulation extension) |
E193750
|
entity |
| Predicate | hasSubextension |
P54767
|
FINISHED |
| Object | Zbc (carry-less multiplication) |
E637104
|
NE FINISHED |
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: Zbc (carry-less multiplication) | Statement: [B (bit-manipulation extension), hasSubextension, Zbc (carry-less multiplication)]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Zbc (carry-less multiplication) Context triple: [B (bit-manipulation extension), hasSubextension, Zbc (carry-less multiplication)]
-
A.
CLMUL
chosen
CLMUL is an x86 instruction set extension that accelerates carry-less multiplication operations used in cryptography and error-correcting codes.
-
B.
Poly1305
Poly1305 is a high-speed message authentication code (MAC) algorithm commonly used with stream ciphers like ChaCha20 to provide data integrity and authenticity.
-
C.
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.
-
D.
B (bit-manipulation extension)
B (bit-manipulation extension) is a RISC-V ISA extension that adds specialized instructions to efficiently perform common bit-level operations such as shifts, rotates, and bitfield manipulation.
-
E.
Benettin algorithm
The Benettin algorithm is a numerical method used in dynamical systems theory to estimate Lyapunov exponents, which quantify the rate of separation of nearby trajectories and indicate chaos.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69ca82e217a48190880695635c44b2ed |
completed | March 30, 2026, 2:04 p.m. |
| NER | Named-entity recognition | batch_69cbd11ed22c819082bf036602eaa038 |
completed | March 31, 2026, 1:50 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69cd687e64a08190a45a1cf5f5c32291 |
completed | April 1, 2026, 6:48 p.m. |
Created at: March 30, 2026, 5:52 p.m.