Triple
T27755540
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | IUnknown |
E701323
|
entity |
| Predicate | hasBinaryCompatibilityWith |
P168956
|
FINISHED |
| Object | C++ virtual function tables |
—
|
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: C++ virtual function tables | Statement: [IUnknown, hasBinaryCompatibilityWith, C++ virtual function tables]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasBinaryCompatibilityWith Context triple: [IUnknown, hasBinaryCompatibilityWith, C++ virtual function tables]
-
A.
checksCompatibilityWith
Indicates that one entity evaluates whether it is compatible or can function harmoniously with another entity.
-
B.
backwardCompatibleWith
Indicates that one entity can correctly interpret, use, or function with data, interfaces, or behavior designed for an earlier version of another entity.
-
C.
requiresCompatibilityWith
Indicates that one entity can only function correctly or be used if it is compatible with another specified entity.
-
D.
isGenerallyCompatibleWith
Indicates that two entities can typically function or coexist together without significant conflict, issues, or need for special adaptation.
-
E.
hasBinary
Indicates that one entity is associated with another entity in a binary (two-component) relationship, typically as one of the two members of a pair.
- 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_69ef6a5193808190816eb7d0020b2d87 |
completed | April 27, 2026, 1:53 p.m. |
| NER | Named-entity recognition | batch_69f67866e9248190b7ba218f9ca2ae8d |
completed | May 2, 2026, 10:19 p.m. |
| PD | Predicate disambiguation | batch_69f675fd59608190b246383435e68fce |
completed | May 2, 2026, 10:09 p.m. |
| PDg | Predicate description generation | batch_69f676c35f3481909b9ba18a5662d6ce |
completed | May 2, 2026, 10:12 p.m. |
Created at: April 27, 2026, 4:23 p.m.