Triple

T10389270
Position Surface form Disambiguated ID Type / Status
Subject Weil pairing E244846 entity
Predicate relatedTo P37 FINISHED
Object Tate pairing
The Tate pairing is a bilinear, non-degenerate pairing on the points of an elliptic curve (or abelian variety) over a finite field, fundamental in number theory and widely used in pairing-based cryptography.
E860120 NE FINISHED

How this triple was built (4 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: Tate pairing | Statement: [Weil pairing, relatedTo, Tate pairing]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Tate pairing
Context triple: [Weil pairing, relatedTo, Tate pairing]
  • A. Weil pairing
    The Weil pairing is a bilinear, alternating, non-degenerate pairing on the torsion points of an elliptic curve, fundamental in number theory and modern cryptography.
  • B. Cassels–Tate pairing
    The Cassels–Tate pairing is a bilinear pairing on the Tate–Shafarevich group of an abelian variety over a number field that plays a central role in arithmetic geometry and the study of rational points.
  • C. Koblitz curves
    Koblitz curves are a special class of elliptic curves defined over binary fields that enable particularly efficient and fast implementations of elliptic curve cryptography.
  • D. Montgomery ladder
    The Montgomery ladder is a scalar multiplication algorithm on elliptic curves that provides efficient, uniform, and side-channel-resistant computation for cryptographic protocols such as those based on Curve25519.
  • E. Twisted Edwards curve
    A Twisted Edwards curve is a type of elliptic curve with a specific algebraic form that enables especially fast and secure implementations of cryptographic operations such as digital signatures and key exchange.
  • 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: Tate pairing
Triple: [Weil pairing, relatedTo, Tate pairing]
Generated description
The Tate pairing is a bilinear, non-degenerate pairing on the points of an elliptic curve (or abelian variety) over a finite field, fundamental in number theory and widely used in pairing-based cryptography.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Tate pairing
Target entity description: The Tate pairing is a bilinear, non-degenerate pairing on the points of an elliptic curve (or abelian variety) over a finite field, fundamental in number theory and widely used in pairing-based cryptography.
  • A. Weil pairing
    The Weil pairing is a bilinear, alternating, non-degenerate pairing on the torsion points of an elliptic curve, fundamental in number theory and modern cryptography.
  • B. Cassels–Tate pairing
    The Cassels–Tate pairing is a bilinear pairing on the Tate–Shafarevich group of an abelian variety over a number field that plays a central role in arithmetic geometry and the study of rational points.
  • C. Koblitz curves
    Koblitz curves are a special class of elliptic curves defined over binary fields that enable particularly efficient and fast implementations of elliptic curve cryptography.
  • D. Montgomery ladder
    The Montgomery ladder is a scalar multiplication algorithm on elliptic curves that provides efficient, uniform, and side-channel-resistant computation for cryptographic protocols such as those based on Curve25519.
  • E. Twisted Edwards curve
    A Twisted Edwards curve is a type of elliptic curve with a specific algebraic form that enables especially fast and secure implementations of cryptographic operations such as digital signatures and key exchange.
  • F. None of above. chosen

Provenance (5 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_69d381b5116081908d85227bab6d3c0c completed April 6, 2026, 9:49 a.m.
NER Named-entity recognition batch_69d4e9b40dd8819080ac839487020a44 completed April 7, 2026, 11:25 a.m.
NED1 Entity disambiguation (via context triple) batch_69d795b2423c8190a7c0e9b6fcbcc6db completed April 9, 2026, 12:04 p.m.
NEDg Description generation batch_69d7998acbf881909b6f063c4bf2d0a6 completed April 9, 2026, 12:20 p.m.
NED2 Entity disambiguation (via description) batch_69d79aa0cc5481908bc14cda8fb6e8b1 completed April 9, 2026, 12:25 p.m.
Created at: April 6, 2026, 12:05 p.m.