Triple
T19494933
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | ACM SIGecom |
E487743
|
entity |
| Predicate | sponsor |
P67
|
FINISHED |
| Object | ACM Conference on Economics and Computation |
—
|
NE NERFINISHED |
How this triple was built (3 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: ACM Conference on Economics and Computation | Statement: [ACM SIGecom, sponsor, ACM Conference on Economics and Computation]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: ACM Conference on Economics and Computation Context triple: [ACM SIGecom, sponsor, ACM Conference on Economics and Computation]
-
A.
ACM SIGecom
ACM SIGecom is the ACM Special Interest Group on Economics and Computation, focusing on the intersection of computer science, game theory, and economic systems.
-
B.
foundations of algorithmic game theory
The foundations of algorithmic game theory comprise the core concepts and results at the intersection of game theory and theoretical computer science, focusing on computational aspects of strategic behavior, equilibria, and mechanism design.
-
C.
The Computation of Economic Equilibria
"The Computation of Economic Equilibria" is a seminal book in mathematical economics that develops algorithmic and computational methods for finding general equilibrium solutions in economic models.
-
D.
Milgrom–Weber auction theory
Milgrom–Weber auction theory is a foundational framework in auction economics that analyzes bidding and pricing when bidders have interdependent values and asymmetric information.
-
E.
ACM Symposium on Theory of Computing
The ACM Symposium on Theory of Computing (STOC) is a premier annual research conference in theoretical computer science, featuring groundbreaking work in algorithms, complexity theory, cryptography, and related areas.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: ACM Conference on Economics and Computation Target entity description: The ACM Conference on Economics and Computation is a leading interdisciplinary research conference at the intersection of computer science, economics, and game theory, focusing on topics such as algorithmic game theory, market design, and computational social science.
-
A.
ACM SIGecom
chosen
ACM SIGecom is the ACM Special Interest Group on Economics and Computation, focusing on the intersection of computer science, game theory, and economic systems.
-
B.
foundations of algorithmic game theory
The foundations of algorithmic game theory comprise the core concepts and results at the intersection of game theory and theoretical computer science, focusing on computational aspects of strategic behavior, equilibria, and mechanism design.
-
C.
The Computation of Economic Equilibria
"The Computation of Economic Equilibria" is a seminal book in mathematical economics that develops algorithmic and computational methods for finding general equilibrium solutions in economic models.
-
D.
Milgrom–Weber auction theory
Milgrom–Weber auction theory is a foundational framework in auction economics that analyzes bidding and pricing when bidders have interdependent values and asymmetric information.
-
E.
ACM Symposium on Theory of Computing
The ACM Symposium on Theory of Computing (STOC) is a premier annual research conference in theoretical computer science, featuring groundbreaking work in algorithms, complexity theory, cryptography, and related areas.
- F. None of above.
Provenance (2 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_69d8e8d9d1c88190b01cd78b8be49384 |
completed | April 10, 2026, 12:11 p.m. |
| NER | Named-entity recognition | batch_69e63490c16481908423e304d82722d7 |
completed | April 20, 2026, 2:13 p.m. |
Created at: April 10, 2026, 1:40 p.m.