Triple
T20578250
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Blum integer |
E505280
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | quadratic residuosity problem |
—
|
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: quadratic residuosity problem | Statement: [Blum integer, relatedTo, quadratic residuosity problem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: quadratic residuosity problem Context triple: [Blum integer, relatedTo, quadratic residuosity problem]
-
A.
Rabin cryptosystem
The Rabin cryptosystem is a public-key encryption scheme based on the hardness of integer factorization, notable for its provable security equivalence to factoring and its similarity to RSA.
-
B.
quadratic reciprocity law
The quadratic reciprocity law is a fundamental theorem in number theory that characterizes when a quadratic equation modulo one odd prime has solutions in terms of solvability modulo another, revealing a deep symmetry between primes.
-
C.
short integer solution (SIS) problem
The short integer solution (SIS) problem is a fundamental lattice-based computational problem that underpins many modern cryptographic constructions, especially in post-quantum cryptography.
-
D.
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.
-
E.
RSA Design
RSA Design is a creative design division of the production company RSA Films, specializing in visual and graphic solutions for film, advertising, and branded content.
- 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: quadratic residuosity problem Target entity description: The quadratic residuosity problem is a fundamental decision problem in number theory and cryptography that asks, given an integer and a modulus (typically a composite like a Blum integer), whether the integer is a quadratic residue modulo that modulus.
-
A.
Rabin cryptosystem
The Rabin cryptosystem is a public-key encryption scheme based on the hardness of integer factorization, notable for its provable security equivalence to factoring and its similarity to RSA.
-
B.
quadratic reciprocity law
The quadratic reciprocity law is a fundamental theorem in number theory that characterizes when a quadratic equation modulo one odd prime has solutions in terms of solvability modulo another, revealing a deep symmetry between primes.
-
C.
short integer solution (SIS) problem
The short integer solution (SIS) problem is a fundamental lattice-based computational problem that underpins many modern cryptographic constructions, especially in post-quantum cryptography.
-
D.
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.
-
E.
RSA Design
RSA Design is a creative design division of the production company RSA Films, specializing in visual and graphic solutions for film, advertising, and branded content.
- 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_69e0b4b721588190993ac7b0a9be2736 |
completed | April 16, 2026, 10:06 a.m. |
| NER | Named-entity recognition | batch_69e6a90cc22c8190969e3a21ae92f1c9 |
completed | April 20, 2026, 10:30 p.m. |
Created at: April 16, 2026, 11:39 a.m.