Triple

T7871689
Position Surface form Disambiguated ID Type / Status
Subject Jacobi symbol E182750 entity
Predicate usedIn P98 FINISHED
Object Solovay–Strassen primality test E530310 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: Solovay–Strassen primality test | Statement: [Jacobi symbol, usedIn, Solovay–Strassen primality test]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Solovay–Strassen primality test
Context triple: [Jacobi symbol, usedIn, Solovay–Strassen primality test]
  • A. Adleman–Pomerance–Rumely primality test
    The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
  • B. Selfridge–Conway primality test
    The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
  • C. Fermat primality test chosen
    The Fermat primality test is a probabilistic algorithm that checks whether a number is prime by verifying congruences derived from Fermat's little theorem.
  • 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. Cantor–Zassenhaus algorithm
    The Cantor–Zassenhaus algorithm is a probabilistic method used to factor polynomials over finite fields efficiently, widely employed in computational algebra and cryptography.
  • 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_69ca82894d9081908a832bfce71a4714 completed March 30, 2026, 2:02 p.m.
NER Named-entity recognition batch_69cb39a5950481908399211c5dfe2569 completed March 31, 2026, 3:04 a.m.
NED1 Entity disambiguation (via context triple) batch_69cb5b6bc7248190adbf4377c52e16a9 completed March 31, 2026, 5:28 a.m.
Created at: March 30, 2026, 4:56 p.m.