Triple
T22964785
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Sylvester’s theorem on partitions |
E571007
|
entity |
| Predicate | describes |
P264
|
FINISHED |
| Object | systematic counting of integer partitions under congruence conditions |
—
|
LITERAL FINISHED |
Named-entity recognition
Before disambiguation, gpt-5-mini classified whether the object phrase is a named entity — the step behind the object's LITERAL type shown above.
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: systematic counting of integer partitions under congruence conditions | Statement: [Sylvester’s theorem on partitions, describes, systematic counting of integer partitions under congruence conditions]
Provenance (2 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69e245b212a88190b5259caf51606084 |
elicitation | completed |
| NER | batch_69f181f763688190aab8f444a1a71577 |
ner | completed |
Created at: April 17, 2026, 3:47 p.m.