Triple
T2263000
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | RFC 7539 |
E50080
|
entity |
| Predicate | specifies |
P773
|
FINISHED |
| Object | Poly1305 message authentication code |
E43495
|
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: Poly1305 message authentication code | Statement: [RFC 7539, specifies, Poly1305 message authentication code]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Poly1305 message authentication code Context triple: [RFC 7539, specifies, Poly1305 message authentication code]
-
A.
Poly1305
chosen
Poly1305 is a high-speed message authentication code (MAC) algorithm commonly used with stream ciphers like ChaCha20 to provide data integrity and authenticity.
-
B.
AES-Poly1305
AES-Poly1305 is an authenticated encryption scheme that pairs the AES block cipher with the Poly1305 message authentication code to provide both confidentiality and integrity.
-
C.
Carter–Wegman MACs
Carter–Wegman MACs are a family of message authentication codes that use universal hashing combined with a secret key to provide efficient and provably secure authentication.
-
D.
Salsa20
Salsa20 is a high-speed stream cipher designed by Daniel J. Bernstein, widely used in modern cryptography for its strong security and efficient software performance.
-
E.
Merkle–Damgård construction
The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
- 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_69a88b01e0048190ba96431b5f990ba9 |
completed | March 4, 2026, 7:41 p.m. |
| NER | Named-entity recognition | batch_69abc18be8308190abc4a59d37dfd93a |
completed | March 7, 2026, 6:11 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ae7f08f2b88190bba173acb132a160 |
completed | March 9, 2026, 8:04 a.m. |
Created at: March 4, 2026, 7:48 p.m.