Triple

T21763322
Position Surface form Disambiguated ID Type / Status
Subject Max-E3-LIN-2 E537215 entity
Predicate hasApproximationResistance P145846 FINISHED
Object yes 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: yes | Statement: [Max-E3-LIN-2, hasApproximationResistance, yes]
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: hasApproximationResistance
Context triple: [Max-E3-LIN-2, hasApproximationResistance, yes]
  • A. Merkle–Damgård strengthening
    Indicates that a hash function construction applies Merkle–Damgård strengthening, meaning the message is padded with its length (and possibly other structured padding) before processing to help ensure collision resistance and proper security properties.
  • B. approximateByzantineLombardStrength
    Indicates an estimation or comparison of the relative military or political strength between Byzantine and Lombard forces or influence.
  • C. hasCPApproximateEigenvalue
    Indicates that one entity is an approximate eigenvalue of a completely positive (CP) map or operator associated with another entity.
  • D. hasPolynomialTimeAlgorithm
    Indicates that there exists an algorithm for the given problem or task whose running time is bounded by a polynomial function of the size of its input.
  • E. boundedByApprox
    Indicates that one quantity is constrained by another within an approximate or tolerance-based bound, rather than an exact strict limit.
  • F. None of above. chosen

Provenance (4 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_69e0c46f5d1c8190bf830409e98464e5 completed April 16, 2026, 11:13 a.m.
NER Named-entity recognition batch_69f031a711dc8190a786c9849dc344e8 completed April 28, 2026, 4:03 a.m.
PD Predicate disambiguation batch_69e6be6299988190a34c98fa76d94700 completed April 21, 2026, 12:01 a.m.
PDg Predicate description generation batch_69e6d054737081908aa7112975b77475 completed April 21, 2026, 1:18 a.m.
Created at: April 16, 2026, 6:51 p.m.