Triple
T8284176
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | B (bit-manipulation extension) |
E193750
|
entity |
| Predicate | hasSubextension |
P54767
|
FINISHED |
| Object |
Zba (address generation bit-manipulation)
Zba (address generation bit-manipulation) is a RISC-V bit-manipulation subextension that provides specialized instructions to efficiently compute and manipulate addresses.
|
E193750
|
NE FINISHED |
How this triple was built (5 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: Zba (address generation bit-manipulation) | Statement: [B (bit-manipulation extension), hasSubextension, Zba (address generation bit-manipulation)]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Zba (address generation bit-manipulation) Context triple: [B (bit-manipulation extension), hasSubextension, Zba (address generation bit-manipulation)]
-
A.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
B.
Zab protocol
The Zab protocol is a crash-recovery atomic broadcast and consensus algorithm used by Apache ZooKeeper to ensure ordered, reliable updates across distributed nodes.
-
C.
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.
-
D.
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.
-
E.
Blum–Micali pseudorandom number generator
The Blum–Micali pseudorandom number generator is a foundational cryptographic algorithm that produces provably secure pseudorandom bits based on number-theoretic hardness assumptions.
- 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: Zba (address generation bit-manipulation) Triple: [B (bit-manipulation extension), hasSubextension, Zba (address generation bit-manipulation)]
Generated description
Zba (address generation bit-manipulation) is a RISC-V bit-manipulation subextension that provides specialized instructions to efficiently compute and manipulate addresses.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Zba (address generation bit-manipulation) Target entity description: Zba (address generation bit-manipulation) is a RISC-V bit-manipulation subextension that provides specialized instructions to efficiently compute and manipulate addresses.
-
A.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
B.
Zab protocol
The Zab protocol is a crash-recovery atomic broadcast and consensus algorithm used by Apache ZooKeeper to ensure ordered, reliable updates across distributed nodes.
-
C.
B (bit-manipulation extension)
chosen
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.
-
D.
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.
-
E.
Blum–Micali pseudorandom number generator
The Blum–Micali pseudorandom number generator is a foundational cryptographic algorithm that produces provably secure pseudorandom bits based on number-theoretic hardness assumptions.
- F. None of above.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasSubextension Context triple: [B (bit-manipulation extension), hasSubextension, Zba (address generation bit-manipulation)]
-
A.
hasExtensionBy
chosen
Indicates that one entity is extended, augmented, or further developed by another entity.
-
B.
hasSubcomponent
Indicates that one entity is a constituent part or component of another, larger entity.
-
C.
hasSubArchitecture
Indicates that one architectural component or structure is a subordinate or constituent part of a larger overarching architecture.
-
D.
hasSubService
Indicates that one service includes or is composed of another, more specific service as a subordinate or component part.
-
E.
hasSecurityExtension
Indicates that an entity is associated with, or equipped with, an additional component or feature that enhances its security.
- F. None of above.
Provenance (6 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_69cb7ad0535081908bb234cfc0e32b32 |
completed | March 31, 2026, 7:42 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69cd687e64a08190a45a1cf5f5c32291 |
completed | April 1, 2026, 6:48 p.m. |
| NEDg | Description generation | batch_69cd6d55196881909cf5ec925792e09f |
completed | April 1, 2026, 7:09 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69cd7e20f71c8190959319c6683a2810 |
completed | April 1, 2026, 8:20 p.m. |
| PD | Predicate disambiguation | batch_69cb70ad9fc081908741f8c4a4141edf |
completed | March 31, 2026, 6:58 a.m. |
Created at: March 30, 2026, 5:52 p.m.