Triple
T18359834
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Rabin–Karp algorithm |
E439883
|
entity |
| Predicate | hashCollisionProbability |
P70746
|
FINISHED |
| Object | can be made low with large modulus |
—
|
LITERAL 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: can be made low with large modulus | Statement: [Rabin–Karp algorithm, hashCollisionProbability, can be made low with large modulus]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hashCollisionProbability Context triple: [Rabin–Karp algorithm, hashCollisionProbability, can be made low with large modulus]
-
A.
hashFunction
Indicates a relationship where an input value is transformed into a fixed-size output (hash) according to a specific deterministic hashing algorithm.
-
B.
preimageResistance
Indicates that it is computationally infeasible to find any input that maps to a given output under the function (e.g., a cryptographic hash), even when that output is known.
-
C.
secondPreimageResistance
Indicates that, given one input and its output under a function (typically a hash), it is computationally infeasible to find a different input that produces the same output.
-
D.
hasFailureProbability
chosen
Indicates that an entity is associated with a likelihood or chance that it will fail within a given context or conditions.
-
E.
mineCountApproximate
Indicates that the number of mines associated with an entity is estimated or roughly counted rather than known exactly.
- F. None of above.
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_69d8b918221c8190a9f7b563d64ac677 |
completed | April 10, 2026, 8:47 a.m. |
| NER | Named-entity recognition | batch_69e516d9dba8819088c5d772e3ee670d |
completed | April 19, 2026, 5:54 p.m. |
| PD | Predicate disambiguation | batch_69e44fed3fdc81908f4ed6a81db42416 |
completed | April 19, 2026, 3:45 a.m. |
Created at: April 10, 2026, 10:37 a.m.